%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX241-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:14:22 PM UTC 2026
% Result : Unsatisfiable 54.43s 9.79s
% Output : CNFRefutation 54.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 29
% Syntax : Number of clauses : 80 ( 80 unt; 0 nHn; 19 RR)
% Number of literals : 80 ( 79 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 30 ( 30 usr; 8 con; 0-5 aty)
% Number of variables : 130 ( 40 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_060,axiom,
eq2(high(X1),low(X2)) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_060) ).
cnf(axiom_047,axiom,
eq3(var(X1),var(X2)) = eq2(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_047) ).
cnf(axiom_037,axiom,
typeCorrect(seq(X1,X2)) = andb(typeCorrect(X1),typeCorrect(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_037) ).
cnf(axiom_034,axiom,
typeCorrect(skip) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_034) ).
cnf(axiom_023,axiom,
andb(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_023) ).
cnf(axiom_038,axiom,
typeCorrect(ifThenElse(X1,X2,X3)) = andb(typeCorrect(X2),typeCorrect(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_038) ).
cnf(axiom_020,axiom,
elem(X1,cons(X2,X3)) = orb(eq2(X2,X1),elem(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_020) ).
cnf(axiom_028,axiom,
eval(X1,var(X2)) = elem(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_028) ).
cnf(axiom_015,axiom,
l = low(zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_015) ).
cnf(axiom_040,axiom,
prop(X1,X2) = impl(typeCorrect(X1),eq5(elem(l,run(X2,X1)),elem(l,run(cons(h,X2),X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_040) ).
cnf(axiom_096,axiom,
eq3(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_096) ).
cnf(axiom_006,axiom,
orb(btrue,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).
cnf(axiom_018,axiom,
h = high(zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_018) ).
cnf(axiom_032,axiom,
run(X1,ifThenElse(X2,X3,X4)) = aux3(X1,X2,X3,X4,eval(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_032) ).
cnf(axiom_004,axiom,
aux3(X1,X2,X3,X4,btrue) = run(X1,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_004) ).
cnf(axiom_007,axiom,
orb(bfalse,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).
cnf(axiom_019,axiom,
elem(X1,nil) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).
cnf(axiom_029,axiom,
run(X1,skip) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_029) ).
cnf(axiom_005,axiom,
aux3(X1,X2,X3,X4,bfalse) = run(X1,X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).
cnf(axiom_036,axiom,
typeCorrect(assign(low(X1),X2)) = notb(secret(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_036) ).
cnf(axiom_011,axiom,
secret(tT) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).
cnf(axiom_014,axiom,
notb(bfalse) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_014) ).
cnf(axiom_030,axiom,
run(X1,assign(X2,X3)) = aux2(X1,X2,X3,eval(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_030) ).
cnf(axiom_026,axiom,
eval(X1,tT) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_026) ).
cnf(axiom_002,axiom,
aux2(X1,X2,X3,btrue) = cons(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
cnf(goal,negated_conjecture,
eq5(prop(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(axiom_044,axiom,
eq5(btrue,bfalse) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_044) ).
cnf(axiom_016,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
cnf(axiom_098,axiom,
eq5(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_098) ).
cnf(c_0_29,axiom,
eq2(high(X1),low(X2)) = bfalse,
axiom_060 ).
cnf(c_0_30,axiom,
eq3(var(X1),var(X2)) = eq2(X1,X2),
axiom_047 ).
cnf(c_0_31,axiom,
typeCorrect(seq(X1,X2)) = andb(typeCorrect(X1),typeCorrect(X2)),
axiom_037 ).
cnf(c_0_32,axiom,
typeCorrect(skip) = btrue,
axiom_034 ).
cnf(c_0_33,axiom,
andb(btrue,X1) = X1,
axiom_023 ).
cnf(c_0_34,axiom,
typeCorrect(ifThenElse(X1,X2,X3)) = andb(typeCorrect(X2),typeCorrect(X3)),
axiom_038 ).
cnf(c_0_35,axiom,
elem(X1,cons(X2,X3)) = orb(eq2(X2,X1),elem(X1,X3)),
axiom_020 ).
cnf(c_0_36,axiom,
eval(X1,var(X2)) = elem(X2,X1),
axiom_028 ).
cnf(c_0_37,plain,
eq3(var(high(X1)),var(low(X2))) = bfalse,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,axiom,
l = low(zero),
axiom_015 ).
cnf(c_0_39,axiom,
prop(X1,X2) = impl(typeCorrect(X1),eq5(elem(l,run(X2,X1)),elem(l,run(cons(h,X2),X1)))),
axiom_040 ).
cnf(c_0_40,plain,
typeCorrect(seq(skip,X1)) = typeCorrect(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_41,plain,
typeCorrect(ifThenElse(X1,X2,X3)) = typeCorrect(seq(X2,X3)),
inference(rw,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_42,plain,
eval(cons(X2,X3),var(X1)) = orb(eq3(var(X2),var(X1)),eval(X3,var(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_36]),c_0_30]) ).
cnf(c_0_43,axiom,
eq3(X1,X1) = btrue,
axiom_096 ).
cnf(c_0_44,axiom,
orb(btrue,X1) = btrue,
axiom_006 ).
cnf(c_0_45,plain,
eq3(var(high(X1)),var(l)) = bfalse,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,axiom,
h = high(zero),
axiom_018 ).
cnf(c_0_47,plain,
prop(X1,X2) = impl(typeCorrect(X1),eq5(eval(run(X2,X1),var(l)),eval(run(cons(h,X2),X1),var(l)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_36]),c_0_36]) ).
cnf(c_0_48,plain,
typeCorrect(ifThenElse(X1,skip,X2)) = typeCorrect(X2),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,axiom,
run(X1,ifThenElse(X2,X3,X4)) = aux3(X1,X2,X3,X4,eval(X1,X2)),
axiom_032 ).
cnf(c_0_50,plain,
eval(cons(X1,X2),var(X1)) = btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_51,axiom,
aux3(X1,X2,X3,X4,btrue) = run(X1,X3),
axiom_004 ).
cnf(c_0_52,plain,
eq3(var(h),var(l)) = bfalse,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,axiom,
orb(bfalse,X1) = X1,
axiom_007 ).
cnf(c_0_54,axiom,
elem(X1,nil) = bfalse,
axiom_019 ).
cnf(c_0_55,plain,
impl(typeCorrect(X1),eq5(eval(run(X2,ifThenElse(X3,skip,X1)),var(l)),eval(run(cons(h,X2),ifThenElse(X3,skip,X1)),var(l)))) = prop(ifThenElse(X3,skip,X1),X2),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
run(cons(X1,X2),ifThenElse(var(X1),X3,X4)) = run(cons(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_57,axiom,
run(X1,skip) = X1,
axiom_029 ).
cnf(c_0_58,plain,
eval(cons(h,X1),var(l)) = eval(X1,var(l)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_52]),c_0_53]) ).
cnf(c_0_59,plain,
eval(nil,var(X1)) = bfalse,
inference(rw,[status(thm)],[c_0_54,c_0_36]) ).
cnf(c_0_60,axiom,
aux3(X1,X2,X3,X4,bfalse) = run(X1,X4),
axiom_005 ).
cnf(c_0_61,axiom,
typeCorrect(assign(low(X1),X2)) = notb(secret(X2)),
axiom_036 ).
cnf(c_0_62,plain,
impl(typeCorrect(X1),eq5(eval(run(X2,ifThenElse(var(h),skip,X1)),var(l)),eval(X2,var(l)))) = prop(ifThenElse(var(h),skip,X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]) ).
cnf(c_0_63,plain,
run(nil,ifThenElse(var(X1),X2,X3)) = run(nil,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_59]),c_0_60]) ).
cnf(c_0_64,plain,
notb(secret(X1)) = typeCorrect(assign(l,X1)),
inference(spm,[status(thm)],[c_0_61,c_0_38]) ).
cnf(c_0_65,axiom,
secret(tT) = bfalse,
axiom_011 ).
cnf(c_0_66,axiom,
notb(bfalse) = btrue,
axiom_014 ).
cnf(c_0_67,axiom,
run(X1,assign(X2,X3)) = aux2(X1,X2,X3,eval(X1,X3)),
axiom_030 ).
cnf(c_0_68,axiom,
eval(X1,tT) = btrue,
axiom_026 ).
cnf(c_0_69,axiom,
aux2(X1,X2,X3,btrue) = cons(X2,X1),
axiom_002 ).
cnf(c_0_70,negated_conjecture,
eq5(prop(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_71,plain,
impl(typeCorrect(X1),eq5(eval(run(nil,X1),var(l)),bfalse)) = prop(ifThenElse(var(h),skip,X1),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_59]),c_0_63]) ).
cnf(c_0_72,plain,
typeCorrect(assign(l,tT)) = btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_73,plain,
run(X1,assign(X2,tT)) = cons(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_74,axiom,
eq5(btrue,bfalse) = bfalse,
axiom_044 ).
cnf(c_0_75,axiom,
impl(btrue,X1) = X1,
axiom_016 ).
cnf(c_0_76,negated_conjecture,
eq5(prop(X1,X2),bfalse) != btrue,
c_0_70 ).
cnf(c_0_77,plain,
prop(ifThenElse(var(h),skip,assign(l,tT)),nil) = bfalse,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_50]),c_0_74]),c_0_75]) ).
cnf(c_0_78,axiom,
eq5(X1,X1) = btrue,
axiom_098 ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX241-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n007.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 10:35:50 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 54.43/9.79 % Version: 3.5.1
% 54.43/9.79 % Preprocessing class: FSMSSMSMSSSNFFN.
% 54.43/9.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.43/9.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 54.43/9.79 % Starting new_bool_3 with 300s (1) cores
% 54.43/9.79 % Starting new_bool_1 with 300s (1) cores
% 54.43/9.79 % Starting sh5l with 300s (1) cores
% 54.43/9.79 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 861201 completed with status 0
% 54.43/9.79 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 54.43/9.79 % Preprocessing class: FSMSSMSMSSSNFFN.
% 54.43/9.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.43/9.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 54.43/9.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 54.43/9.79 % No SInE strategy applied
% 54.43/9.79 % Search class: FHUPM-FFMM32-MFFFFFNN
% 54.43/9.79 % partial match(1): FHUPM-FFMF32-MFFFFFNN
% 54.43/9.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 54.43/9.79 % Starting SubtermCWHack with 136s (1) cores
% 54.43/9.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 54.43/9.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 226s (1) cores
% 54.43/9.79 % Starting new_bool_3 with 226s (1) cores
% 54.43/9.79 % Starting new_bool_1 with 226s (1) cores
% 54.43/9.79 % new_bool_3 with pid 861211 completed with status 0
% 54.43/9.79 % Result found by new_bool_3
% 54.43/9.79 % Preprocessing class: FSMSSMSMSSSNFFN.
% 54.43/9.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.43/9.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 54.43/9.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 54.43/9.79 % No SInE strategy applied
% 54.43/9.79 % Search class: FHUPM-FFMM32-MFFFFFNN
% 54.43/9.79 % partial match(1): FHUPM-FFMF32-MFFFFFNN
% 54.43/9.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 54.43/9.79 % Starting SubtermCWHack with 136s (1) cores
% 54.43/9.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 54.43/9.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 226s (1) cores
% 54.43/9.79 % Starting new_bool_3 with 226s (1) cores
% 54.43/9.79 % Preprocessing time : 0.003 s
% 54.43/9.79 % Presaturation interreduction done
% 54.43/9.79
% 54.43/9.79 % Proof found!
% 54.43/9.79 % SZS status Unsatisfiable
% 54.43/9.79 % SZS output start CNFRefutation
% See solution above
% 54.43/9.79 % Parsed axioms : 100
% 54.43/9.79 % Removed by relevancy pruning/SinE : 0
% 54.43/9.79 % Initial clauses : 100
% 54.43/9.79 % Removed in clause preprocessing : 3
% 54.43/9.79 % Initial clauses in saturation : 97
% 54.43/9.79 % Processed clauses : 24928
% 54.43/9.79 % ...of these trivial : 2245
% 54.43/9.79 % ...subsumed : 18396
% 54.43/9.79 % ...remaining for further processing : 4287
% 54.43/9.79 % Other redundant clauses eliminated : 0
% 54.43/9.79 % Clauses deleted for lack of memory : 0
% 54.43/9.79 % Backward-subsumed : 5
% 54.43/9.79 % Backward-rewritten : 552
% 54.43/9.79 % Generated clauses : 253789
% 54.43/9.79 % ...of the previous two non-redundant : 185419
% 54.43/9.79 % ...aggressively subsumed : 0
% 54.43/9.79 % Contextual simplify-reflections : 0
% 54.43/9.79 % Paramodulations : 253789
% 54.43/9.79 % Factorizations : 0
% 54.43/9.79 % NegExts : 0
% 54.43/9.79 % Equation resolutions : 0
% 54.43/9.79 % Disequality decompositions : 0
% 54.43/9.79 % Total rewrite steps : 324611
% 54.43/9.79 % ...of those cached : 219624
% 54.43/9.79 % Propositional unsat checks : 0
% 54.43/9.79 % Propositional check models : 0
% 54.43/9.79 % Propositional check unsatisfiable : 0
% 54.43/9.79 % Propositional clauses : 0
% 54.43/9.79 % Propositional clauses after purity: 0
% 54.43/9.79 % Propositional unsat core size : 0
% 54.43/9.79 % Propositional preprocessing time : 0.000
% 54.43/9.79 % Propositional encoding time : 0.000
% 54.43/9.79 % Propositional solver time : 0.000
% 54.43/9.79 % Success case prop preproc time : 0.000
% 54.43/9.79 % Success case prop encoding time : 0.000
% 54.43/9.79 % Success case prop solver time : 0.000
% 54.43/9.79 % Current number of processed clauses : 3635
% 54.43/9.79 % Positive orientable unit clauses : 3144
% 54.43/9.79 % Positive unorientable unit clauses: 39
% 54.43/9.79 % Negative unit clauses : 47
% 54.43/9.79 % Non-unit-clauses : 405
% 54.43/9.79 % Current number of unprocessed clauses: 159970
% 54.43/9.79 % ...number of literals in the above : 184590
% 54.43/9.79 % Current number of archived formulas : 0
% 54.43/9.79 % Current number of archived clauses : 655
% 54.43/9.79 % Clause-clause subsumption calls (NU) : 4049
% 54.43/9.79 % Rec. Clause-clause subsumption calls : 4046
% 54.43/9.79 % Non-unit clause-clause subsumptions : 36
% 54.43/9.79 % Unit Clause-clause subsumption calls : 2428
% 54.43/9.79 % Rewrite failures with RHS unbound : 3109
% 54.43/9.79 % BW rewrite match attempts : 100144
% 54.43/9.79 % BW rewrite match successes : 899
% 54.43/9.79 % Condensation attempts : 0
% 54.43/9.79 % Condensation successes : 0
% 54.43/9.79 % Termbank termtop insertions : 7371868
% 54.43/9.79 % Search garbage collected termcells : 31
% 54.43/9.79
% 54.43/9.79 % -------------------------------------------------
% 54.43/9.79 % User time : 8.717 s
% 54.43/9.79 % System time : 0.374 s
% 54.43/9.79 % Total time : 9.091 s
% 54.43/9.79 % Maximum resident set size: 3696 pages
% 54.43/9.79
% 54.43/9.79 % -------------------------------------------------
% 54.43/9.79 % User time : 43.812 s
% 54.43/9.79 % System time : 1.812 s
% 54.43/9.79 % Total time : 45.624 s
% 54.43/9.79 % Maximum resident set size: 4608 pages
% 54.43/9.79 % E exiting
%------------------------------------------------------------------------------