0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_int
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n118.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 06:50:08 CST 2018
0.00/0.32	% done 150 iterations in 0.117s
0.00/0.32	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.32	% SZS output start Refutation
0.00/0.32	tff(conj_1, axiom,
0.00/0.32	  (pp(aa(dB,bool,it,
0.00/0.32	         aa(dB,dB,
0.00/0.32	            aa(dB,fun(dB,dB),app,
0.00/0.32	               foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),
0.00/0.32	            var(i)))))).
0.00/0.32	tff('0', plain,
0.00/0.32	    pp(
0.00/0.32	      aa(dB, bool, it, 
0.00/0.32	        aa(dB, dB, 
0.00/0.32	          aa(dB, fun(dB, dB), app, 
0.00/0.32	            foldl(dB, dB, app, subst(r, s, zero_zero(nat)), ss)), var(i)))),
0.00/0.32	    inference('cnf', [status(esa)], [conj_1])).
0.00/0.32	tff(conj_4, conjecture,
0.00/0.32	  (pp(aa(dB,bool,it,
0.00/0.32	         foldl(dB,dB,app,subst(r,s,zero_zero(nat)),
0.00/0.32	               append(dB,ss,cons(dB,var(i),nil(dB)))))))).
0.00/0.32	tff(zf_stmt_0, negated_conjecture,
0.00/0.32	  (~
0.00/0.32	    pp(aa(dB,bool,it,
0.00/0.32	          foldl(dB,dB,app,subst(r,s,zero_zero(nat)),
0.00/0.32	                append(dB,ss,cons(dB,var(i),nil(dB)))))))).
0.00/0.32	tff('1', plain,
0.00/0.32	    ~ pp(
0.00/0.32	        aa(dB, bool, it, 
0.00/0.32	          foldl(dB, dB, app, subst(r, s, zero_zero(nat)), 
0.00/0.32	            append(dB, ss, cons(dB, var(i), nil(dB)))))),
0.00/0.32	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.32	tff(fact_6_app__last, axiom,
0.00/0.32	  (![U2:dB,Ts:list(dB),Ta:dB]:
0.00/0.32	     (aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,Ta,Ts)),U2) =
0.00/0.32	      foldl(dB,dB,app,Ta,append(dB,Ts,cons(dB,U2,nil(dB))))))).
0.00/0.32	tff('2', plain,
0.00/0.32	    ![X25 : dB, X26 : list(dB), X27 : dB]:
0.00/0.32	      aa(dB, dB, aa(dB, fun(dB, dB), app, foldl(dB, dB, app, X25, X26)), X27)
0.00/0.32	       = foldl(dB, dB, app, X25, append(dB, X26, cons(dB, X27, nil(dB)))),
0.00/0.32	    inference('cnf', [status(esa)], [fact_6_app__last])).
0.00/0.32	tff('3', plain,
0.00/0.32	    ~ pp(
0.00/0.32	        aa(dB, bool, it, 
0.00/0.32	          aa(dB, dB, 
0.00/0.32	            aa(dB, fun(dB, dB), app, 
0.00/0.32	              foldl(dB, dB, app, subst(r, s, zero_zero(nat)), ss)), var(i)))),
0.00/0.32	    inference('demod', [status(thm)], ['1', '2'])).
0.00/0.32	tff('4', plain, ~ $true, inference('sup-', [status(thm)], ['0', '3'])).
0.00/0.32	tff('5', plain, $false, inference('simplify', [status(thm)], ['4'])).
0.00/0.32	
0.00/0.32	% SZS output end Refutation
0.00/0.32	EOF
