%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX194-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:13 PM UTC 2026
% Result : Unsatisfiable 183.92s 32.44s
% Output : CNFRefutation 183.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 33
% Syntax : Number of clauses : 119 ( 119 unt; 0 nHn; 8 RR)
% Number of literals : 119 ( 118 equ; 5 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 : 31 ( 31 usr; 4 con; 0-3 aty)
% Number of variables : 222 ( 64 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_082,axiom,
y(X1) = simp1(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_082) ).
cnf(axiom_081,axiom,
b(X1) = simp1(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_081) ).
cnf(axiom_109,axiom,
x6(X1) = simp1(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_109) ).
cnf(axiom_108,axiom,
b2(X1) = simp1(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_108) ).
cnf(axiom_111,axiom,
a3(X1) = simp1(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_111) ).
cnf(axiom_110,axiom,
b3(X1) = simp1(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_110) ).
cnf(axiom_127,axiom,
simp1(add(X1,X2)) = aux6(X1,X2,y(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_127) ).
cnf(axiom_131,axiom,
simp1(v(X1)) = v(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_131) ).
cnf(axiom_141,axiom,
eval(X1,mul(X2,X3)) = mulNat(eval(X1,X2),eval(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_141) ).
cnf(axiom_139,axiom,
eval(X1,n(X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_139) ).
cnf(axiom_134,axiom,
fetch(cons(X1,X2),suc(X3)) = fetch(X2,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_134) ).
cnf(axiom_143,axiom,
eval(X1,v(X2)) = fetch(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_143) ).
cnf(axiom_136,axiom,
addNat(suc(X1),X2) = suc(addNat(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_136) ).
cnf(axiom_138,axiom,
mulNat(suc(X1),X2) = addNat(X2,mulNat(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_138) ).
cnf(axiom_031,axiom,
aux6(X1,X2,v(X3)) = fail4(y(X1),b(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_031) ).
cnf(axiom_132,axiom,
fetch(nil,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_132) ).
cnf(axiom_080,axiom,
fail4(X1,v(X2)) = fail13(X1,v(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_080) ).
cnf(axiom_074,axiom,
fail13(X1,X2) = aux4(X1,X2,eq3(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_074) ).
cnf(axiom_154,axiom,
eq3(v(X1),v(X2)) = eq2(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_154) ).
cnf(axiom_147,axiom,
eq3(n(X1),n(X2)) = eq2(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_147) ).
cnf(axiom_016,axiom,
aux4(v(X1),v(X2),bfalse) = aux3(X1,X2,eq2(X1,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
cnf(axiom_140,axiom,
eval(X1,add(X2,X3)) = addNat(eval(X1,X2),eval(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_140) ).
cnf(axiom_135,axiom,
addNat(zero,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_135) ).
cnf(axiom_177,axiom,
eq2(suc(X1),zero) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_177) ).
cnf(axiom_179,axiom,
eq3(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_179) ).
cnf(axiom_133,axiom,
fetch(cons(X1,X2),zero) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_133) ).
cnf(axiom_002,axiom,
aux2(X1,X2,btrue) = mul(n(suc(suc(zero))),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
cnf(axiom_137,axiom,
mulNat(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_137) ).
cnf(axiom_012,axiom,
aux3(X1,X2,btrue) = mul(n(suc(suc(zero))),v(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_012) ).
cnf(goal,negated_conjecture,
eq4(prop1(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(axiom_144,axiom,
prop1(X1,X2) = eq4(eq2(eval(X1,X2),eval(X1,simp1(X2))),btrue),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_144) ).
cnf(axiom_145,axiom,
eq4(bfalse,btrue) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_145) ).
cnf(axiom_180,axiom,
eq4(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_180) ).
cnf(c_0_33,axiom,
y(X1) = simp1(X1),
axiom_082 ).
cnf(c_0_34,axiom,
b(X1) = simp1(X1),
axiom_081 ).
cnf(c_0_35,axiom,
x6(X1) = simp1(X1),
axiom_109 ).
cnf(c_0_36,plain,
b(X1) = y(X1),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,axiom,
b2(X1) = simp1(X1),
axiom_108 ).
cnf(c_0_38,plain,
y(X1) = x6(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_34]),c_0_36]) ).
cnf(c_0_39,axiom,
a3(X1) = simp1(X1),
axiom_111 ).
cnf(c_0_40,plain,
x6(X1) = b2(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_34]),c_0_36]),c_0_38]) ).
cnf(c_0_41,axiom,
b3(X1) = simp1(X1),
axiom_110 ).
cnf(c_0_42,plain,
b2(X1) = a3(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_34]),c_0_36]),c_0_38]),c_0_40]) ).
cnf(c_0_43,axiom,
simp1(add(X1,X2)) = aux6(X1,X2,y(X1)),
axiom_127 ).
cnf(c_0_44,plain,
a3(X1) = b3(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_34]),c_0_36]),c_0_38]),c_0_40]),c_0_42]) ).
cnf(c_0_45,axiom,
simp1(v(X1)) = v(X1),
axiom_131 ).
cnf(c_0_46,axiom,
eval(X1,mul(X2,X3)) = mulNat(eval(X1,X2),eval(X1,X3)),
axiom_141 ).
cnf(c_0_47,axiom,
eval(X1,n(X2)) = X2,
axiom_139 ).
cnf(c_0_48,axiom,
fetch(cons(X1,X2),suc(X3)) = fetch(X2,X3),
axiom_134 ).
cnf(c_0_49,axiom,
eval(X1,v(X2)) = fetch(X1,X2),
axiom_143 ).
cnf(c_0_50,axiom,
addNat(suc(X1),X2) = suc(addNat(X1,X2)),
axiom_136 ).
cnf(c_0_51,axiom,
mulNat(suc(X1),X2) = addNat(X2,mulNat(X1,X2)),
axiom_138 ).
cnf(c_0_52,axiom,
aux6(X1,X2,v(X3)) = fail4(y(X1),b(X2)),
axiom_031 ).
cnf(c_0_53,plain,
b3(add(X1,X2)) = aux6(X1,X2,b3(X1)),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_34]),c_0_36]),c_0_38]),c_0_38]),c_0_40]),c_0_40]),c_0_42]),c_0_42]),c_0_44]),c_0_44]) ).
cnf(c_0_54,plain,
b3(v(X1)) = v(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_34]),c_0_36]),c_0_38]),c_0_40]),c_0_42]),c_0_44]) ).
cnf(c_0_55,plain,
mulNat(eval(X1,X2),X3) = eval(X1,mul(X2,n(X3))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,axiom,
fetch(nil,X1) = zero,
axiom_132 ).
cnf(c_0_57,plain,
eval(cons(X1,X2),v(suc(X3))) = eval(X2,v(X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_49]) ).
cnf(c_0_58,plain,
suc(addNat(X1,mulNat(X2,suc(X1)))) = mulNat(suc(X2),suc(X1)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,plain,
aux6(X1,X2,v(X3)) = fail4(b3(X1),b3(X2)),
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(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_36]),c_0_38]),c_0_38]),c_0_40]),c_0_40]),c_0_42]),c_0_42]),c_0_44]),c_0_44]) ).
cnf(c_0_60,plain,
aux6(v(X1),X2,v(X1)) = b3(add(v(X1),X2)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
eval(X1,mul(n(X2),n(X3))) = mulNat(X2,X3),
inference(spm,[status(thm)],[c_0_55,c_0_47]) ).
cnf(c_0_62,plain,
eval(X1,mul(X2,n(eval(X1,X3)))) = eval(X1,mul(X2,X3)),
inference(rw,[status(thm)],[c_0_46,c_0_55]) ).
cnf(c_0_63,plain,
eval(nil,v(X1)) = zero,
inference(rw,[status(thm)],[c_0_56,c_0_49]) ).
cnf(c_0_64,plain,
eval(cons(X1,X2),v(mulNat(suc(X3),suc(X4)))) = eval(X2,v(addNat(X4,mulNat(X3,suc(X4))))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,axiom,
fail4(X1,v(X2)) = fail13(X1,v(X2)),
axiom_080 ).
cnf(c_0_66,axiom,
fail13(X1,X2) = aux4(X1,X2,eq3(X1,X2)),
axiom_074 ).
cnf(c_0_67,axiom,
eq3(v(X1),v(X2)) = eq2(X1,X2),
axiom_154 ).
cnf(c_0_68,axiom,
eq3(n(X1),n(X2)) = eq2(X1,X2),
axiom_147 ).
cnf(c_0_69,plain,
fail4(v(X1),b3(X2)) = b3(add(v(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_54]) ).
cnf(c_0_70,axiom,
aux4(v(X1),v(X2),bfalse) = aux3(X1,X2,eq2(X1,X1)),
axiom_016 ).
cnf(c_0_71,axiom,
eval(X1,add(X2,X3)) = addNat(eval(X1,X2),eval(X1,X3)),
axiom_140 ).
cnf(c_0_72,plain,
mulNat(X1,eval(X2,X3)) = eval(X2,mul(n(X1),X3)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_73,plain,
eval(cons(X1,nil),v(mulNat(suc(X2),suc(X3)))) = zero,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_74,axiom,
addNat(zero,X1) = X1,
axiom_135 ).
cnf(c_0_75,plain,
aux4(X1,v(X2),eq3(X1,v(X2))) = fail4(X1,v(X2)),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_76,plain,
eq3(v(X1),v(X2)) = eq3(n(X1),n(X2)),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_77,plain,
fail4(v(X1),v(X2)) = b3(add(v(X1),v(X2))),
inference(spm,[status(thm)],[c_0_69,c_0_54]) ).
cnf(c_0_78,axiom,
eq2(suc(X1),zero) = bfalse,
axiom_177 ).
cnf(c_0_79,plain,
aux4(v(X1),v(X2),bfalse) = aux3(X1,X2,eq3(n(X1),n(X1))),
inference(rw,[status(thm)],[c_0_70,c_0_68]) ).
cnf(c_0_80,axiom,
eq3(X1,X1) = btrue,
axiom_179 ).
cnf(c_0_81,plain,
addNat(eval(X1,X2),X3) = eval(X1,add(X2,n(X3))),
inference(spm,[status(thm)],[c_0_71,c_0_47]) ).
cnf(c_0_82,axiom,
fetch(cons(X1,X2),zero) = X1,
axiom_133 ).
cnf(c_0_83,plain,
eval(cons(X1,nil),mul(n(X2),v(mulNat(suc(X3),suc(X4))))) = mulNat(X2,zero),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_84,axiom,
aux2(X1,X2,btrue) = mul(n(suc(suc(zero))),X1),
axiom_002 ).
cnf(c_0_85,plain,
mulNat(suc(X1),zero) = mulNat(X1,zero),
inference(spm,[status(thm)],[c_0_74,c_0_51]) ).
cnf(c_0_86,axiom,
mulNat(zero,X1) = zero,
axiom_137 ).
cnf(c_0_87,axiom,
aux3(X1,X2,btrue) = mul(n(suc(suc(zero))),v(X1)),
axiom_012 ).
cnf(c_0_88,plain,
aux4(v(X1),v(X2),eq3(n(X1),n(X2))) = b3(add(v(X1),v(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_89,plain,
eq3(n(suc(X1)),n(zero)) = bfalse,
inference(rw,[status(thm)],[c_0_78,c_0_68]) ).
cnf(c_0_90,plain,
aux4(v(X1),v(X2),bfalse) = aux3(X1,X2,btrue),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_91,plain,
eval(X1,add(X2,n(eval(X1,X3)))) = eval(X1,add(X2,X3)),
inference(rw,[status(thm)],[c_0_71,c_0_81]) ).
cnf(c_0_92,plain,
eval(cons(X1,X2),v(zero)) = X1,
inference(rw,[status(thm)],[c_0_82,c_0_49]) ).
cnf(c_0_93,plain,
eval(cons(X1,nil),aux2(v(mulNat(suc(X2),suc(X3))),X4,btrue)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_85]),c_0_86]) ).
cnf(c_0_94,plain,
mulNat(suc(zero),X1) = addNat(X1,zero),
inference(spm,[status(thm)],[c_0_51,c_0_86]) ).
cnf(c_0_95,plain,
aux3(X1,X2,btrue) = aux3(X1,X3,btrue),
inference(spm,[status(thm)],[c_0_87,c_0_87]) ).
cnf(c_0_96,plain,
aux3(suc(X1),zero,btrue) = b3(add(v(suc(X1)),v(zero))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]) ).
cnf(c_0_97,plain,
eval(cons(X1,nil),add(v(mulNat(suc(X2),suc(X3))),n(X4))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_73]),c_0_74]) ).
cnf(c_0_98,plain,
eval(cons(X1,X2),add(X3,n(X1))) = eval(cons(X1,X2),add(X3,v(zero))),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_99,negated_conjecture,
eq4(prop1(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_100,axiom,
prop1(X1,X2) = eq4(eq2(eval(X1,X2),eval(X1,simp1(X2))),btrue),
axiom_144 ).
cnf(c_0_101,plain,
eval(cons(X1,nil),aux2(v(suc(addNat(X2,zero))),X3,btrue)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_50]) ).
cnf(c_0_102,plain,
aux3(suc(X1),X2,btrue) = b3(add(v(suc(X1)),v(zero))),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_103,plain,
eval(cons(X1,nil),add(v(mulNat(suc(X2),suc(X3))),v(zero))) = X1,
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_104,negated_conjecture,
eq4(prop1(X1,X2),bfalse) != btrue,
c_0_99 ).
cnf(c_0_105,plain,
prop1(X1,X2) = eq4(eq3(n(eval(X1,X2)),n(eval(X1,b3(X2)))),btrue),
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)],[c_0_100,c_0_34]),c_0_36]),c_0_38]),c_0_40]),c_0_42]),c_0_44]),c_0_68]) ).
cnf(c_0_106,plain,
eval(cons(X1,nil),aux2(v(suc(zero)),X2,btrue)) = zero,
inference(spm,[status(thm)],[c_0_101,c_0_74]) ).
cnf(c_0_107,plain,
mul(n(suc(suc(zero))),v(suc(X1))) = b3(add(v(suc(X1)),v(zero))),
inference(spm,[status(thm)],[c_0_87,c_0_102]) ).
cnf(c_0_108,plain,
eval(cons(X1,nil),add(v(suc(addNat(X2,zero))),v(zero))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_94]),c_0_50]) ).
cnf(c_0_109,negated_conjecture,
eq4(eq4(eq3(n(eval(X1,X2)),n(eval(X1,b3(X2)))),btrue),bfalse) != btrue,
inference(rw,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_110,plain,
eval(cons(X1,nil),b3(add(v(suc(zero)),v(zero)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_84]),c_0_107]) ).
cnf(c_0_111,plain,
eval(cons(X1,nil),add(v(suc(zero)),v(zero))) = X1,
inference(spm,[status(thm)],[c_0_108,c_0_74]) ).
cnf(c_0_112,plain,
eq3(n(mulNat(suc(X1),suc(X2))),n(zero)) = bfalse,
inference(spm,[status(thm)],[c_0_89,c_0_58]) ).
cnf(c_0_113,plain,
eval(X1,aux2(n(X2),X3,btrue)) = mulNat(suc(suc(zero)),X2),
inference(spm,[status(thm)],[c_0_61,c_0_84]) ).
cnf(c_0_114,negated_conjecture,
eq4(eq4(eq3(n(X1),n(zero)),btrue),bfalse) != btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).
cnf(c_0_115,plain,
eq3(n(eval(X1,aux2(n(suc(X2)),X3,btrue))),n(zero)) = bfalse,
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_116,axiom,
eq4(bfalse,btrue) = bfalse,
axiom_145 ).
cnf(c_0_117,axiom,
eq4(X1,X1) = btrue,
axiom_180 ).
cnf(c_0_118,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116]),c_0_117])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX194-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.46 % Computer : n018.cluster.edu
% 0.20/5.46 % Model : x86_64 x86_64
% 0.20/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.46 % Memory : 8046.5625MB
% 0.20/5.46 % OS : Linux 6.8.0-71-generic
% 0.20/5.46 % CPULimit : 300
% 0.20/5.46 % WCLimit : 300
% 0.20/5.46 % DateTime : Mon Sep 21 10:34:05 UTC 2026
% 0.20/5.47 % CPUTime :
% 0.20/5.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.54 Running first-order theorem proving
% 0.23/5.54 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
% 183.92/32.44 % Version: 3.5.1
% 183.92/32.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 183.92/32.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.92/32.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 183.92/32.44 % Starting new_bool_3 with 300s (1) cores
% 183.92/32.44 % Starting new_bool_1 with 300s (1) cores
% 183.92/32.44 % Starting sh5l with 300s (1) cores
% 183.92/32.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1653125 completed with status 0
% 183.92/32.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 183.92/32.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 183.92/32.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.92/32.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 183.92/32.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 183.92/32.44 % No SInE strategy applied
% 183.92/32.44 % Search class: FHUPM-FFLF32-DFFFFFNN
% 183.92/32.44 % partial match(2): FGUPS-FFLF32-DFFFFFNN
% 183.92/32.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 183.92/32.44 % Starting SubtermCWHack with 136s (1) cores
% 183.92/32.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 183.92/32.44 % Starting G----_405_C05_02_F1_SE_CS_SP_PS_RG_S04AN with 257s (1) cores
% 183.92/32.44 % Starting new_bool_3 with 255s (1) cores
% 183.92/32.44 % Starting new_bool_1 with 251s (1) cores
% 183.92/32.44 % SubtermCWHack with pid 1653132 completed with status 0
% 183.92/32.44 % Result found by SubtermCWHack
% 183.92/32.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 183.92/32.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.92/32.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 183.92/32.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 183.92/32.44 % No SInE strategy applied
% 183.92/32.44 % Search class: FHUPM-FFLF32-DFFFFFNN
% 183.92/32.44 % partial match(2): FGUPS-FFLF32-DFFFFFNN
% 183.92/32.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 183.92/32.44 % Starting SubtermCWHack with 136s (1) cores
% 183.92/32.44 % Preprocessing time : 0.004 s
% 183.92/32.44
% 183.92/32.44 % Proof found!
% 183.92/32.44 % SZS status Unsatisfiable
% 183.92/32.44 % SZS output start CNFRefutation
% See solution above
% 183.92/32.44 % Parsed axioms : 182
% 183.92/32.44 % Removed by relevancy pruning/SinE : 0
% 183.92/32.44 % Initial clauses : 182
% 183.92/32.44 % Removed in clause preprocessing : 12
% 183.92/32.44 % Initial clauses in saturation : 170
% 183.92/32.44 % Processed clauses : 38015
% 183.92/32.44 % ...of these trivial : 13720
% 183.92/32.44 % ...subsumed : 16135
% 183.92/32.44 % ...remaining for further processing : 8160
% 183.92/32.44 % Other redundant clauses eliminated : 0
% 183.92/32.44 % Clauses deleted for lack of memory : 0
% 183.92/32.44 % Backward-subsumed : 13
% 183.92/32.44 % Backward-rewritten : 540
% 183.92/32.44 % Generated clauses : 1361438
% 183.92/32.44 % ...of the previous two non-redundant : 1159797
% 183.92/32.44 % ...aggressively subsumed : 0
% 183.92/32.44 % Contextual simplify-reflections : 0
% 183.92/32.44 % Paramodulations : 1361438
% 183.92/32.44 % Factorizations : 0
% 183.92/32.44 % NegExts : 0
% 183.92/32.44 % Equation resolutions : 0
% 183.92/32.44 % Disequality decompositions : 0
% 183.92/32.44 % Total rewrite steps : 1258452
% 183.92/32.44 % ...of those cached : 1018295
% 183.92/32.44 % Propositional unsat checks : 0
% 183.92/32.44 % Propositional check models : 0
% 183.92/32.44 % Propositional check unsatisfiable : 0
% 183.92/32.44 % Propositional clauses : 0
% 183.92/32.44 % Propositional clauses after purity: 0
% 183.92/32.44 % Propositional unsat core size : 0
% 183.92/32.44 % Propositional preprocessing time : 0.000
% 183.92/32.44 % Propositional encoding time : 0.000
% 183.92/32.44 % Propositional solver time : 0.000
% 183.92/32.44 % Success case prop preproc time : 0.000
% 183.92/32.44 % Success case prop encoding time : 0.000
% 183.92/32.44 % Success case prop solver time : 0.000
% 183.92/32.44 % Current number of processed clauses : 7607
% 183.92/32.44 % Positive orientable unit clauses : 6859
% 183.92/32.44 % Positive unorientable unit clauses: 627
% 183.92/32.44 % Negative unit clauses : 40
% 183.92/32.44 % Non-unit-clauses : 81
% 183.92/32.44 % Current number of unprocessed clauses: 1119868
% 183.92/32.44 % ...number of literals in the above : 1134597
% 183.92/32.44 % Current number of archived formulas : 0
% 183.92/32.44 % Current number of archived clauses : 565
% 183.92/32.44 % Clause-clause subsumption calls (NU) : 680
% 183.92/32.44 % Rec. Clause-clause subsumption calls : 680
% 183.92/32.44 % Non-unit clause-clause subsumptions : 184
% 183.92/32.44 % Unit Clause-clause subsumption calls : 71098
% 183.92/32.44 % Rewrite failures with RHS unbound : 127573
% 183.92/32.44 % BW rewrite match attempts : 229078
% 183.92/32.44 % BW rewrite match successes : 20206
% 183.92/32.44 % Condensation attempts : 0
% 183.92/32.44 % Condensation successes : 0
% 183.92/32.44 % Termbank termtop insertions : 29886793
% 183.92/32.44 % Search garbage collected termcells : 12
% 183.92/32.44
% 183.92/32.44 % -------------------------------------------------
% 183.92/32.44 % User time : 24.907 s
% 183.92/32.44 % System time : 1.272 s
% 183.92/32.44 % Total time : 26.179 s
% 183.92/32.44 % Maximum resident set size: 3740 pages
% 183.92/32.44
% 183.92/32.44 % -------------------------------------------------
% 183.92/32.44 % User time : 123.775 s
% 183.92/32.44 % System time : 6.387 s
% 183.92/32.44 % Total time : 130.162 s
% 183.92/32.44 % Maximum resident set size: 4864 pages
% 183.92/32.44 % E exiting
%------------------------------------------------------------------------------