%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX242-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 : n018.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 200.50s 40.75s
% Output : CNFRefutation 200.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 26
% Syntax : Number of clauses : 96 ( 88 unt; 0 nHn; 18 RR)
% Number of literals : 104 ( 103 equ; 23 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 4 con; 0-8 aty)
% Number of variables : 329 ( 46 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_029,axiom,
unifyoccurs(X1,var(X2)) = eq2(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_029) ).
cnf(axiom_071,axiom,
apply1(lam3,X1) = var(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_071) ).
cnf(goal,negated_conjecture,
eq4(prop_unify_makes_equal(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(axiom_034,axiom,
unifyloop(X1,cons(app(X2,X3),X4),cons(app(X5,X6),X7)) = aux3(X1,X4,X2,X3,X7,X5,X6,eq2(X2,X5)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_034) ).
cnf(axiom_056,axiom,
eq2(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_056) ).
cnf(axiom_043,axiom,
prop_unify_makes_equal(X1,X2) = eq4(unificationOK(X1,X2),btrue),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_043) ).
cnf(axiom_042,axiom,
unificationOK(X1,X2) = aux6(X1,X2,unify2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_042) ).
cnf(axiom_041,axiom,
unify2(X1,X2) = unifyloop(lam3,cons(X1,nil),cons(X2,nil)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_041) ).
cnf(axiom_004,axiom,
aux3(X1,X2,X3,X4,X5,X6,X7,btrue) = unifyloop(X1,append(X4,X2),append(X7,X5)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_004) ).
cnf(axiom_047,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_047) ).
cnf(axiom_046,axiom,
append(nil,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_046) ).
cnf(axiom_065,axiom,
( eq2(X1,X2) != btrue
| eq3(app(X1,X3),app(X2,X4)) = eq(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_065) ).
cnf(axiom_016,axiom,
fail(X1,cons(var(X2),X3),X4,X5) = unifyvar(X1,X2,X4,X5,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
cnf(axiom_011,axiom,
aux6(X1,X2,just(X3)) = eq3(subst(X3,X1),subst(X3,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).
cnf(axiom_031,axiom,
unifyloop(X1,nil,nil) = just(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_031) ).
cnf(axiom_037,axiom,
unifyloop(X1,cons(var(X2),X3),cons(X4,X5)) = unifyvar(X1,X2,X4,X3,X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_037) ).
cnf(axiom_039,axiom,
unifyvar(X1,X2,var(X3),X4,X5) = aux5(X1,X2,X4,X5,X3,eq2(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_039) ).
cnf(axiom_018,axiom,
subst(X1,app(X2,X3)) = app(X2,substList(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_018) ).
cnf(axiom_060,axiom,
( eq3(X1,X2) != bfalse
| eq(cons(X1,X3),cons(X2,X4)) = bfalse ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_060) ).
cnf(axiom_008,axiom,
aux5(X1,X2,X3,X4,X5,btrue) = unifyloop(X1,X3,X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).
cnf(axiom_021,axiom,
substList(X1,cons(X2,X3)) = cons(subst(X1,X2),substList(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_021) ).
cnf(axiom_020,axiom,
substList(X1,nil) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_020) ).
cnf(axiom_019,axiom,
subst(X1,var(X2)) = apply1(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).
cnf(axiom_062,axiom,
eq(nil,cons(X1,X2)) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_062) ).
cnf(axiom_054,axiom,
eq4(bfalse,btrue) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_054) ).
cnf(axiom_058,axiom,
eq4(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_058) ).
cnf(c_0_26,axiom,
unifyoccurs(X1,var(X2)) = eq2(X1,X2),
axiom_029 ).
cnf(c_0_27,axiom,
apply1(lam3,X1) = var(X1),
axiom_071 ).
cnf(c_0_28,negated_conjecture,
eq4(prop_unify_makes_equal(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_29,axiom,
unifyloop(X1,cons(app(X2,X3),X4),cons(app(X5,X6),X7)) = aux3(X1,X4,X2,X3,X7,X5,X6,eq2(X2,X5)),
axiom_034 ).
cnf(c_0_30,plain,
unifyoccurs(X1,apply1(lam3,X2)) = eq2(X1,X2),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,axiom,
eq2(X1,X1) = btrue,
axiom_056 ).
cnf(c_0_32,negated_conjecture,
eq4(prop_unify_makes_equal(X1,X2),bfalse) != btrue,
c_0_28 ).
cnf(c_0_33,axiom,
prop_unify_makes_equal(X1,X2) = eq4(unificationOK(X1,X2),btrue),
axiom_043 ).
cnf(c_0_34,axiom,
unificationOK(X1,X2) = aux6(X1,X2,unify2(X1,X2)),
axiom_042 ).
cnf(c_0_35,axiom,
unify2(X1,X2) = unifyloop(lam3,cons(X1,nil),cons(X2,nil)),
axiom_041 ).
cnf(c_0_36,plain,
unifyloop(X1,cons(app(X2,X3),X4),cons(app(X5,X6),X7)) = aux3(X1,X4,X2,X3,X7,X5,X6,unifyoccurs(X2,apply1(lam3,X5))),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
unifyoccurs(X1,apply1(lam3,X1)) = btrue,
inference(rw,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
eq4(eq4(aux6(X1,X2,unifyloop(lam3,cons(X1,nil),cons(X2,nil))),btrue),bfalse) != btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]) ).
cnf(c_0_39,plain,
unifyloop(X1,cons(app(X2,X3),X4),cons(app(X2,X5),X6)) = aux3(X1,X4,X2,X3,X6,X2,X5,btrue),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
eq4(eq4(aux6(app(X1,X2),app(X1,X3),aux3(lam3,nil,X1,X2,nil,X1,X3,btrue)),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,axiom,
aux3(X1,X2,X3,X4,X5,X6,X7,btrue) = unifyloop(X1,append(X4,X2),append(X7,X5)),
axiom_004 ).
cnf(c_0_42,negated_conjecture,
eq4(eq4(aux6(app(X1,X2),app(X1,X3),unifyloop(lam3,append(X2,nil),append(X3,nil))),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
axiom_047 ).
cnf(c_0_44,negated_conjecture,
eq4(eq4(aux6(app(X1,X2),app(X1,cons(X3,X4)),unifyloop(lam3,append(X2,nil),cons(X3,append(X4,nil)))),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,axiom,
append(nil,X1) = X1,
axiom_046 ).
cnf(c_0_46,negated_conjecture,
eq4(eq4(aux6(app(X1,X2),app(X1,cons(X3,nil)),unifyloop(lam3,append(X2,nil),cons(X3,nil))),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,plain,
aux3(X1,X2,X3,X4,X5,X6,cons(X7,X8),btrue) = unifyloop(X1,append(X4,X2),cons(X7,append(X8,X5))),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
eq4(eq4(aux6(app(X1,cons(X2,X3)),app(X1,cons(X4,nil)),unifyloop(lam3,cons(X2,append(X3,nil)),cons(X4,nil))),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_49,plain,
aux3(X1,X2,X3,X4,X5,X6,cons(X7,nil),btrue) = unifyloop(X1,append(X4,X2),cons(X7,X5)),
inference(spm,[status(thm)],[c_0_47,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
eq4(eq4(aux6(app(X1,cons(app(X2,X3),X4)),app(X1,cons(app(X2,X5),nil)),aux3(lam3,append(X4,nil),X2,X3,nil,X2,X5,btrue)),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_48,c_0_39]) ).
cnf(c_0_51,plain,
aux3(X1,X2,X3,nil,X4,X5,cons(X6,nil),btrue) = unifyloop(X1,X2,cons(X6,X4)),
inference(spm,[status(thm)],[c_0_49,c_0_45]) ).
cnf(c_0_52,plain,
( eq2(X1,X2) != btrue
| eq3(app(X1,X3),app(X2,X4)) = eq(X3,X4) ),
inference(fof_simplification,[status(thm)],[axiom_065]) ).
cnf(c_0_53,negated_conjecture,
eq4(eq4(aux6(app(X1,cons(app(X2,nil),X3)),app(X1,cons(app(X2,cons(X4,nil)),nil)),unifyloop(lam3,append(X3,nil),cons(X4,nil))),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
aux3(X1,X2,X3,X4,X5,X6,nil,btrue) = unifyloop(X1,append(X4,X2),X5),
inference(spm,[status(thm)],[c_0_41,c_0_45]) ).
cnf(c_0_55,plain,
aux3(X1,X2,X3,cons(X4,X5),X6,X7,X8,btrue) = unifyloop(X1,cons(X4,append(X5,X2)),append(X8,X6)),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_56,axiom,
fail(X1,cons(var(X2),X3),X4,X5) = unifyvar(X1,X2,X4,X5,X3),
axiom_016 ).
cnf(c_0_57,axiom,
aux6(X1,X2,just(X3)) = eq3(subst(X3,X1),subst(X3,X2)),
axiom_011 ).
cnf(c_0_58,axiom,
unifyloop(X1,nil,nil) = just(X1),
axiom_031 ).
cnf(c_0_59,plain,
( eq2(X1,X2) != btrue
| eq3(app(X1,X3),app(X2,X4)) = eq(X3,X4) ),
c_0_52 ).
cnf(c_0_60,negated_conjecture,
eq4(eq4(aux6(app(X1,cons(app(X2,nil),X3)),app(X1,cons(app(X2,cons(X4,nil)),nil)),aux3(lam3,nil,X5,X3,cons(X4,nil),X6,nil,btrue)),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
aux3(X1,X2,X3,cons(X4,nil),X5,X6,X7,btrue) = unifyloop(X1,cons(X4,X2),append(X7,X5)),
inference(spm,[status(thm)],[c_0_55,c_0_45]) ).
cnf(c_0_62,axiom,
unifyloop(X1,cons(var(X2),X3),cons(X4,X5)) = unifyvar(X1,X2,X4,X3,X5),
axiom_037 ).
cnf(c_0_63,plain,
fail(X1,cons(apply1(lam3,X2),X3),X4,X5) = unifyvar(X1,X2,X4,X5,X3),
inference(rw,[status(thm)],[c_0_56,c_0_27]) ).
cnf(c_0_64,axiom,
unifyvar(X1,X2,var(X3),X4,X5) = aux5(X1,X2,X4,X5,X3,eq2(X2,X3)),
axiom_039 ).
cnf(c_0_65,plain,
aux6(X1,X2,unifyloop(X3,nil,nil)) = eq3(subst(X3,X1),subst(X3,X2)),
inference(rw,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_66,axiom,
subst(X1,app(X2,X3)) = app(X2,substList(X1,X3)),
axiom_018 ).
cnf(c_0_67,plain,
( eq3(X1,X2) != bfalse
| eq(cons(X1,X3),cons(X2,X4)) = bfalse ),
inference(fof_simplification,[status(thm)],[axiom_060]) ).
cnf(c_0_68,plain,
( unifyoccurs(X1,apply1(lam3,X2)) != btrue
| eq3(app(X1,X3),app(X2,X4)) = eq(X3,X4) ),
inference(rw,[status(thm)],[c_0_59,c_0_30]) ).
cnf(c_0_69,negated_conjecture,
eq4(eq4(aux6(app(X1,cons(app(X2,nil),cons(X3,nil))),app(X1,cons(app(X2,cons(X4,nil)),nil)),unifyloop(lam3,cons(X3,nil),cons(X4,nil))),btrue),bfalse) != btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_45]) ).
cnf(c_0_70,plain,
unifyloop(X1,cons(apply1(lam3,X2),X3),cons(X4,X5)) = fail(X1,cons(apply1(lam3,X2),X5),X4,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_27]),c_0_63]) ).
cnf(c_0_71,plain,
fail(X1,cons(apply1(lam3,X2),X5),apply1(lam3,X3),X4) = aux5(X1,X2,X4,X5,X3,unifyoccurs(X2,apply1(lam3,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_27]),c_0_30]),c_0_63]) ).
cnf(c_0_72,axiom,
aux5(X1,X2,X3,X4,X5,btrue) = unifyloop(X1,X3,X4),
axiom_008 ).
cnf(c_0_73,plain,
eq3(subst(X1,X2),app(X3,substList(X1,X4))) = aux6(X2,app(X3,X4),unifyloop(X1,nil,nil)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,axiom,
substList(X1,cons(X2,X3)) = cons(subst(X1,X2),substList(X1,X3)),
axiom_021 ).
cnf(c_0_75,axiom,
substList(X1,nil) = nil,
axiom_020 ).
cnf(c_0_76,axiom,
subst(X1,var(X2)) = apply1(X1,X2),
axiom_019 ).
cnf(c_0_77,plain,
( eq3(X1,X2) != bfalse
| eq(cons(X1,X3),cons(X2,X4)) = bfalse ),
c_0_67 ).
cnf(c_0_78,plain,
eq3(app(X1,X2),app(X1,X3)) = eq(X2,X3),
inference(spm,[status(thm)],[c_0_68,c_0_37]) ).
cnf(c_0_79,negated_conjecture,
eq4(eq4(aux6(app(X1,cons(app(X2,nil),cons(apply1(lam3,X3),nil))),app(X1,cons(app(X2,cons(X4,nil)),nil)),fail(lam3,cons(apply1(lam3,X3),nil),X4,nil)),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_80,plain,
fail(X1,cons(apply1(lam3,X2),X3),apply1(lam3,X2),X4) = unifyloop(X1,X4,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_37]),c_0_72]) ).
cnf(c_0_81,plain,
eq3(app(X1,substList(X2,X3)),app(X4,substList(X2,X5))) = aux6(app(X1,X3),app(X4,X5),unifyloop(X2,nil,nil)),
inference(spm,[status(thm)],[c_0_73,c_0_66]) ).
cnf(c_0_82,plain,
cons(app(X1,substList(X2,X3)),substList(X2,X4)) = substList(X2,cons(app(X1,X3),X4)),
inference(spm,[status(thm)],[c_0_74,c_0_66]) ).
cnf(c_0_83,plain,
cons(subst(X1,X2),nil) = substList(X1,cons(X2,nil)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_84,plain,
subst(X1,apply1(lam3,X2)) = apply1(X1,X2),
inference(rw,[status(thm)],[c_0_76,c_0_27]) ).
cnf(c_0_85,plain,
( eq(X2,X4) != bfalse
| eq(cons(app(X1,X2),X3),cons(app(X1,X4),X5)) = bfalse ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_86,axiom,
eq(nil,cons(X1,X2)) = bfalse,
axiom_062 ).
cnf(c_0_87,negated_conjecture,
eq4(eq4(aux6(app(X1,cons(app(X2,nil),cons(apply1(lam3,X3),nil))),app(X1,cons(app(X2,cons(apply1(lam3,X3),nil)),nil)),unifyloop(lam3,nil,nil)),btrue),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_88,plain,
aux6(app(X1,X2),app(X1,X3),unifyloop(X4,nil,nil)) = eq(substList(X4,X2),substList(X4,X3)),
inference(spm,[status(thm)],[c_0_78,c_0_81]) ).
cnf(c_0_89,plain,
substList(X1,cons(app(X2,nil),X3)) = cons(app(X2,nil),substList(X1,X3)),
inference(spm,[status(thm)],[c_0_82,c_0_75]) ).
cnf(c_0_90,plain,
substList(X1,cons(apply1(lam3,X2),nil)) = cons(apply1(X1,X2),nil),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_91,plain,
substList(X1,cons(app(X2,X3),nil)) = cons(app(X2,substList(X1,X3)),nil),
inference(spm,[status(thm)],[c_0_83,c_0_66]) ).
cnf(c_0_92,plain,
eq(cons(app(X1,nil),X2),cons(app(X1,cons(X3,X4)),X5)) = bfalse,
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_93,axiom,
eq4(bfalse,btrue) = bfalse,
axiom_054 ).
cnf(c_0_94,axiom,
eq4(X1,X1) = btrue,
axiom_058 ).
cnf(c_0_95,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_90]),c_0_91]),c_0_90]),c_0_92]),c_0_93]),c_0_94])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX242-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 10:39:59 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 200.50/40.75 % Version: 3.5.1
% 200.50/40.75 % Preprocessing class: FSMSSMSMSSSNFFN.
% 200.50/40.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.50/40.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 200.50/40.75 % Starting new_bool_3 with 300s (1) cores
% 200.50/40.75 % Starting new_bool_1 with 300s (1) cores
% 200.50/40.75 % Starting sh5l with 300s (1) cores
% 200.50/40.75 % new_bool_1 with pid 1662078 completed with status 9
% 200.50/40.75 % new_bool_3 with pid 1662076 completed with status 9
% 200.50/40.75 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1662074 completed with status 0
% 200.50/40.75 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 200.50/40.75 % Preprocessing class: FSMSSMSMSSSNFFN.
% 200.50/40.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.50/40.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 200.50/40.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 200.50/40.75 % No SInE strategy applied
% 200.50/40.75 % Search class: FHUPM-FFMM33-MFFFFFNN
% 200.50/40.75 % partial match(2): FUUPM-FFMM31-MFFFFFNN
% 200.50/40.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 200.50/40.75 % Starting SubtermCWHack with 136s (1) cores
% 200.50/40.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 200.50/40.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 200.50/40.75 % Starting new_bool_3 with 136s (1) cores
% 200.50/40.75 % Starting new_bool_1 with 136s (1) cores
% 200.50/40.75 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1662091 completed with status 0
% 200.50/40.75 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 200.50/40.75 % Preprocessing class: FSMSSMSMSSSNFFN.
% 200.50/40.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.50/40.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 200.50/40.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 200.50/40.75 % No SInE strategy applied
% 200.50/40.75 % Search class: FHUPM-FFMM33-MFFFFFNN
% 200.50/40.75 % partial match(2): FUUPM-FFMM31-MFFFFFNN
% 200.50/40.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 200.50/40.75 % Starting SubtermCWHack with 136s (1) cores
% 200.50/40.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 200.50/40.75 % Preprocessing time : 0.002 s
% 200.50/40.75 % Presaturation interreduction done
% 200.50/40.75
% 200.50/40.75 % Proof found!
% 200.50/40.75 % SZS status Unsatisfiable
% 200.50/40.75 % SZS output start CNFRefutation
% See solution above
% 200.50/40.75 % Parsed axioms : 73
% 200.50/40.75 % Removed by relevancy pruning/SinE : 0
% 200.50/40.75 % Initial clauses : 73
% 200.50/40.75 % Removed in clause preprocessing : 12
% 200.50/40.75 % Initial clauses in saturation : 61
% 200.50/40.75 % Processed clauses : 41246
% 200.50/40.75 % ...of these trivial : 1868
% 200.50/40.75 % ...subsumed : 34446
% 200.50/40.75 % ...remaining for further processing : 4932
% 200.50/40.75 % Other redundant clauses eliminated : 0
% 200.50/40.75 % Clauses deleted for lack of memory : 0
% 200.50/40.75 % Backward-subsumed : 73
% 200.50/40.75 % Backward-rewritten : 335
% 200.50/40.75 % Generated clauses : 929643
% 200.50/40.75 % ...of the previous two non-redundant : 770566
% 200.50/40.75 % ...aggressively subsumed : 0
% 200.50/40.75 % Contextual simplify-reflections : 0
% 200.50/40.75 % Paramodulations : 929643
% 200.50/40.75 % Factorizations : 0
% 200.50/40.75 % NegExts : 0
% 200.50/40.75 % Equation resolutions : 0
% 200.50/40.75 % Disequality decompositions : 0
% 200.50/40.75 % Total rewrite steps : 980628
% 200.50/40.75 % ...of those cached : 751700
% 200.50/40.75 % Propositional unsat checks : 0
% 200.50/40.75 % Propositional check models : 0
% 200.50/40.75 % Propositional check unsatisfiable : 0
% 200.50/40.75 % Propositional clauses : 0
% 200.50/40.75 % Propositional clauses after purity: 0
% 200.50/40.75 % Propositional unsat core size : 0
% 200.50/40.75 % Propositional preprocessing time : 0.000
% 200.50/40.75 % Propositional encoding time : 0.000
% 200.50/40.75 % Propositional solver time : 0.000
% 200.50/40.75 % Success case prop preproc time : 0.000
% 200.50/40.75 % Success case prop encoding time : 0.000
% 200.50/40.75 % Success case prop solver time : 0.000
% 200.50/40.75 % Current number of processed clauses : 4463
% 200.50/40.75 % Positive orientable unit clauses : 2686
% 200.50/40.75 % Positive unorientable unit clauses: 285
% 200.50/40.75 % Negative unit clauses : 1426
% 200.50/40.75 % Non-unit-clauses : 66
% 200.50/40.75 % Current number of unprocessed clauses: 728767
% 200.50/40.75 % ...number of literals in the above : 738273
% 200.50/40.75 % Current number of archived formulas : 0
% 200.50/40.75 % Current number of archived clauses : 481
% 200.50/40.75 % Clause-clause subsumption calls (NU) : 403
% 200.50/40.75 % Rec. Clause-clause subsumption calls : 395
% 200.50/40.75 % Non-unit clause-clause subsumptions : 116
% 200.50/40.75 % Unit Clause-clause subsumption calls : 105325
% 200.50/40.75 % Rewrite failures with RHS unbound : 17097
% 200.50/40.75 % BW rewrite match attempts : 70847
% 200.50/40.75 % BW rewrite match successes : 1499
% 200.50/40.75 % Condensation attempts : 0
% 200.50/40.75 % Condensation successes : 0
% 200.50/40.75 % Termbank termtop insertions : 30112210
% 200.50/40.75 % Search garbage collected termcells : 14
% 200.50/40.75
% 200.50/40.75 % -------------------------------------------------
% 200.50/40.75 % User time : 38.297 s
% 200.50/40.75 % System time : 1.546 s
% 200.50/40.75 % Total time : 39.843 s
% 200.50/40.75 % Maximum resident set size: 3680 pages
% 200.50/40.75
% 200.50/40.75 % -------------------------------------------------
% 200.50/40.75 % User time : 192.590 s
% 200.50/40.75 % System time : 7.847 s
% 200.50/40.75 % Total time : 200.437 s
% 200.50/40.75 % Maximum resident set size: 4864 pages
% 200.50/40.75 % E exiting
%------------------------------------------------------------------------------