%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV004-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 12:47:17 PM UTC 2026
% Result : Unsatisfiable 22.03s 3.93s
% Output : CNFRefutation 22.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 31
% Syntax : Number of clauses : 124 ( 124 unt; 0 nHn; 27 RR)
% Number of literals : 124 ( 110 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-3 aty)
% Number of variables : 206 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(and_or_subsumption1,axiom,
or(and(X1,X2),X2) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_or_subsumption1) ).
cnf(or_symmetry,negated_conjecture,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_symmetry) ).
cnf(and_or_simplification,negated_conjecture,
and(or(X1,X2),X3) = or(and(X1,X3),and(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_or_simplification) ).
cnf(and_idempotency,axiom,
and(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_idempotency) ).
cnf(and_symmetry,negated_conjecture,
and(X1,X2) = and(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_symmetry) ).
cnf(and_or_subsumption3,axiom,
or(or(and(X1,X2),X3),X2) = or(X3,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_or_subsumption3) ).
cnf(and_or_subsumption4,axiom,
or(or(X1,and(X2,X3)),X3) = or(X1,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_or_subsumption4) ).
cnf(karnaugh2,axiom,
or(and(not(X1),not(X2)),X2) = or(X2,not(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',karnaugh2) ).
cnf(or_definition2,axiom,
or(X1,n1) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',or_definition2) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',not_definition1) ).
cnf(s0_definition,negated_conjecture,
s0 = sum(a0,b0,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s0_definition) ).
cnf(sum_definition,negated_conjecture,
sum(X1,X2,X3) = xor(xor(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_definition) ).
cnf(xor_definition,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(X2,not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_definition) ).
cnf(overflow_definition,negated_conjecture,
overflow = carryout(a1,b1,carryout(a0,b0,n0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',overflow_definition) ).
cnf(carryout_definition,negated_conjecture,
carryout(X1,X2,X3) = or(and(X1,or(X2,X3)),and(not(X1),and(X2,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',carryout_definition) ).
cnf(prove_circuit,negated_conjecture,
~ circuit(xor(a0,b0),xor(xor(a1,b1),carryout(a0,b0,n0)),or(and(a1,b1),and(and(a0,b0),or(a1,b1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_circuit) ).
cnf(not_involution,axiom,
not(not(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_involution) ).
cnf(or_commutativity,negated_conjecture,
or(or(X1,X2),X3) = or(or(X1,X3),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_commutativity) ).
cnf(or_evaluation1,axiom,
or(or(X1,X2),X2) = or(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_evaluation1) ).
cnf(and_evaluation1,axiom,
and(and(X1,X2),X2) = and(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_evaluation1) ).
cnf(and_commutativity,negated_conjecture,
and(and(X1,X2),X3) = and(and(X1,X3),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_commutativity) ).
cnf(or_definition1,axiom,
or(X1,n0) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',or_definition1) ).
cnf(the_output_circuit,negated_conjecture,
circuit(s0,s1,overflow),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_output_circuit) ).
cnf(and_definition2,axiom,
and(X1,n1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',and_definition2) ).
cnf(and_definition1,axiom,
and(X1,n0) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',and_definition1) ).
cnf(s1_definition,negated_conjecture,
s1 = sum(a1,b1,carryout(a0,b0,n0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_definition) ).
cnf(and_not_evaluation1,axiom,
and(X1,not(X1)) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_not_evaluation1) ).
cnf(demorgan1,axiom,
not(and(X1,X2)) = or(not(X1),not(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',demorgan1) ).
cnf(demorgan2,axiom,
not(or(X1,X2)) = and(not(X1),not(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',demorgan2) ).
cnf(or_not_evaluation1,axiom,
or(X1,not(X1)) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_not_evaluation1) ).
cnf(or_idempotency,axiom,
or(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_idempotency) ).
cnf(c_0_31,axiom,
or(and(X1,X2),X2) = X2,
and_or_subsumption1 ).
cnf(c_0_32,negated_conjecture,
or(X1,X2) = or(X2,X1),
or_symmetry ).
cnf(c_0_33,negated_conjecture,
and(or(X1,X2),X3) = or(and(X1,X3),and(X2,X3)),
and_or_simplification ).
cnf(c_0_34,axiom,
and(X1,X1) = X1,
and_idempotency ).
cnf(c_0_35,plain,
or(X1,and(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
and(X1,X2) = and(X2,X1),
and_symmetry ).
cnf(c_0_37,axiom,
or(or(and(X1,X2),X3),X2) = or(X3,X2),
and_or_subsumption3 ).
cnf(c_0_38,axiom,
or(or(X1,and(X2,X3)),X3) = or(X1,X3),
and_or_subsumption4 ).
cnf(c_0_39,negated_conjecture,
and(X1,or(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
or(X1,or(and(X2,X1),X3)) = or(X3,X1),
inference(rw,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_41,axiom,
or(and(not(X1),not(X2)),X2) = or(X2,not(X1)),
karnaugh2 ).
cnf(c_0_42,axiom,
or(X1,n1) = n1,
or_definition2 ).
cnf(c_0_43,axiom,
not(n0) = n1,
not_definition1 ).
cnf(c_0_44,negated_conjecture,
s0 = sum(a0,b0,n0),
s0_definition ).
cnf(c_0_45,negated_conjecture,
sum(X1,X2,X3) = xor(xor(X1,X2),X3),
sum_definition ).
cnf(c_0_46,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(X2,not(X1))),
xor_definition ).
cnf(c_0_47,negated_conjecture,
overflow = carryout(a1,b1,carryout(a0,b0,n0)),
overflow_definition ).
cnf(c_0_48,negated_conjecture,
carryout(X1,X2,X3) = or(and(X1,or(X2,X3)),and(not(X1),and(X2,X3))),
carryout_definition ).
cnf(c_0_49,negated_conjecture,
~ circuit(xor(a0,b0),xor(xor(a1,b1),carryout(a0,b0,n0)),or(and(a1,b1),and(and(a0,b0),or(a1,b1)))),
inference(fof_simplification,[status(thm)],[prove_circuit]) ).
cnf(c_0_50,plain,
or(X1,or(X2,and(X3,X1))) = or(X2,X1),
inference(rw,[status(thm)],[c_0_38,c_0_32]) ).
cnf(c_0_51,negated_conjecture,
or(and(X1,X2),and(X2,X3)) = and(or(X1,X3),X2),
inference(spm,[status(thm)],[c_0_33,c_0_36]) ).
cnf(c_0_52,negated_conjecture,
and(X1,or(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_53,plain,
or(X1,and(not(X2),not(X1))) = or(X1,not(X2)),
inference(rw,[status(thm)],[c_0_41,c_0_32]) ).
cnf(c_0_54,axiom,
not(not(X1)) = X1,
not_involution ).
cnf(c_0_55,negated_conjecture,
or(or(X1,X2),X3) = or(or(X1,X3),X2),
or_commutativity ).
cnf(c_0_56,axiom,
or(or(X1,X2),X2) = or(X1,X2),
or_evaluation1 ).
cnf(c_0_57,axiom,
and(and(X1,X2),X2) = and(X1,X2),
and_evaluation1 ).
cnf(c_0_58,negated_conjecture,
and(and(X1,X2),X3) = and(and(X1,X3),X2),
and_commutativity ).
cnf(c_0_59,axiom,
or(X1,n0) = X1,
or_definition1 ).
cnf(c_0_60,plain,
or(X1,not(n0)) = not(n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43]) ).
cnf(c_0_61,negated_conjecture,
circuit(s0,s1,overflow),
the_output_circuit ).
cnf(c_0_62,negated_conjecture,
s0 = or(and(or(and(a0,not(b0)),and(b0,not(a0))),not(n0)),and(n0,not(or(and(a0,not(b0)),and(b0,not(a0)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_46]) ).
cnf(c_0_63,axiom,
and(X1,n1) = X1,
and_definition2 ).
cnf(c_0_64,negated_conjecture,
overflow = or(and(a1,or(b1,or(and(a0,or(b0,n0)),and(not(a0),and(b0,n0))))),and(not(a1),and(b1,or(and(a0,or(b0,n0)),and(not(a0),and(b0,n0)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_48]) ).
cnf(c_0_65,axiom,
and(X1,n0) = n0,
and_definition1 ).
cnf(c_0_66,negated_conjecture,
s1 = sum(a1,b1,carryout(a0,b0,n0)),
s1_definition ).
cnf(c_0_67,negated_conjecture,
~ circuit(xor(a0,b0),xor(xor(a1,b1),carryout(a0,b0,n0)),or(and(a1,b1),and(and(a0,b0),or(a1,b1)))),
c_0_49 ).
cnf(c_0_68,negated_conjecture,
or(X1,and(or(X2,X1),X3)) = or(and(X2,X3),X1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_69,negated_conjecture,
or(X1,and(or(X2,X1),X3)) = and(or(X1,X3),or(X2,X1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_70,plain,
or(X1,and(X2,not(X1))) = or(X1,X2),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_71,negated_conjecture,
or(or(X1,X2),X3) = or(X2,or(X1,X3)),
inference(spm,[status(thm)],[c_0_32,c_0_55]) ).
cnf(c_0_72,plain,
or(X1,or(X2,X1)) = or(X2,X1),
inference(rw,[status(thm)],[c_0_56,c_0_32]) ).
cnf(c_0_73,plain,
and(X1,and(X2,X1)) = and(X2,X1),
inference(rw,[status(thm)],[c_0_57,c_0_36]) ).
cnf(c_0_74,negated_conjecture,
and(and(X1,X2),X3) = and(X2,and(X1,X3)),
inference(spm,[status(thm)],[c_0_36,c_0_58]) ).
cnf(c_0_75,axiom,
and(X1,not(X1)) = n0,
and_not_evaluation1 ).
cnf(c_0_76,negated_conjecture,
or(n0,X1) = X1,
inference(spm,[status(thm)],[c_0_59,c_0_32]) ).
cnf(c_0_77,negated_conjecture,
or(not(n0),X1) = not(n0),
inference(spm,[status(thm)],[c_0_60,c_0_32]) ).
cnf(c_0_78,axiom,
not(and(X1,X2)) = or(not(X1),not(X2)),
demorgan1 ).
cnf(c_0_79,negated_conjecture,
circuit(or(and(or(and(a0,not(b0)),and(b0,not(a0))),not(n0)),and(n0,not(or(and(a0,not(b0)),and(b0,not(a0)))))),s1,overflow),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_80,plain,
and(X1,not(n0)) = X1,
inference(rw,[status(thm)],[c_0_63,c_0_43]) ).
cnf(c_0_81,negated_conjecture,
overflow = or(and(a1,or(b1,and(a0,b0))),and(not(a1),and(b1,and(a0,b0)))),
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_64,c_0_59]),c_0_65]),c_0_65]),c_0_59]),c_0_59]),c_0_65]),c_0_65]),c_0_59]) ).
cnf(c_0_82,negated_conjecture,
s1 = or(and(or(and(a1,not(b1)),and(b1,not(a1))),not(or(and(a0,or(b0,n0)),and(not(a0),and(b0,n0))))),and(or(and(a0,or(b0,n0)),and(not(a0),and(b0,n0))),not(or(and(a1,not(b1)),and(b1,not(a1)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_45]),c_0_46]),c_0_46]),c_0_48]),c_0_48]) ).
cnf(c_0_83,negated_conjecture,
~ circuit(or(and(a0,not(b0)),and(b0,not(a0))),or(and(or(and(a1,not(b1)),and(b1,not(a1))),not(or(and(a0,or(b0,n0)),and(not(a0),and(b0,n0))))),and(or(and(a0,or(b0,n0)),and(not(a0),and(b0,n0))),not(or(and(a1,not(b1)),and(b1,not(a1)))))),or(and(a1,b1),and(and(a0,b0),or(a1,b1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_46]),c_0_46]),c_0_46]),c_0_48]),c_0_48]) ).
cnf(c_0_84,axiom,
not(or(X1,X2)) = and(not(X1),not(X2)),
demorgan2 ).
cnf(c_0_85,negated_conjecture,
and(or(X1,X2),or(X3,X1)) = or(and(X3,X2),X1),
inference(rw,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_86,negated_conjecture,
or(X1,and(not(X1),X2)) = or(X1,X2),
inference(spm,[status(thm)],[c_0_70,c_0_36]) ).
cnf(c_0_87,negated_conjecture,
or(X1,or(X2,or(X3,X1))) = or(X3,or(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_52]),c_0_71]) ).
cnf(c_0_88,negated_conjecture,
or(X1,or(X2,or(X3,X1))) = or(X2,or(X3,X1)),
inference(spm,[status(thm)],[c_0_72,c_0_71]) ).
cnf(c_0_89,negated_conjecture,
and(X1,and(X2,and(X3,and(X2,X1)))) = and(X3,and(X2,X1)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_90,negated_conjecture,
and(X1,and(X2,and(X1,X3))) = and(X1,and(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_73]),c_0_74]),c_0_74]) ).
cnf(c_0_91,negated_conjecture,
and(X1,and(X2,and(X3,X1))) = and(X2,and(X3,X1)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_92,negated_conjecture,
and(or(X1,X2),not(X1)) = and(X2,not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_75]),c_0_76]) ).
cnf(c_0_93,negated_conjecture,
or(or(X1,not(X1)),X2) = or(X1,not(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(spm,[status(thm)],[c_0_77,c_0_75]),c_0_78]),c_0_54]),c_0_78]),c_0_54]),c_0_32]),c_0_32]) ).
cnf(c_0_94,axiom,
or(X1,not(X1)) = n1,
or_not_evaluation1 ).
cnf(c_0_95,negated_conjecture,
circuit(or(or(and(a0,not(b0)),and(b0,not(a0))),and(n0,not(or(and(a0,not(b0)),and(b0,not(a0)))))),s1,or(and(a1,or(b1,and(a0,b0))),and(not(a1),and(b1,and(a0,b0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_81]) ).
cnf(c_0_96,negated_conjecture,
s1 = or(and(not(and(a0,b0)),or(and(not(a1),b1),and(a1,not(b1)))),and(and(a0,b0),not(or(and(not(a1),b1),and(a1,not(b1)))))),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_36]),c_0_32]),c_0_59]),c_0_65]),c_0_65]),c_0_59]),c_0_36]),c_0_59]),c_0_65]),c_0_65]),c_0_59]),c_0_36]),c_0_32]) ).
cnf(c_0_97,negated_conjecture,
~ circuit(or(and(not(a0),b0),and(a0,not(b0))),or(and(and(a0,b0),and(or(not(a1),b1),or(a1,not(b1)))),and(or(not(a0),not(b0)),or(and(not(a1),b1),and(a1,not(b1))))),or(and(a1,b1),and(and(a0,b0),or(a1,b1)))),
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)],[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_32]),c_0_36]),c_0_36]),c_0_32]),c_0_59]),c_0_65]),c_0_65]),c_0_59]),c_0_78]),c_0_36]),c_0_59]),c_0_65]),c_0_65]),c_0_59]),c_0_36]),c_0_32]),c_0_84]),c_0_78]),c_0_54]),c_0_78]),c_0_54]),c_0_36]),c_0_32]) ).
cnf(c_0_98,negated_conjecture,
or(and(X1,X2),X3) = and(or(X2,X3),or(X1,X3)),
inference(spm,[status(thm)],[c_0_85,c_0_32]) ).
cnf(c_0_99,negated_conjecture,
or(not(X1),and(X1,X2)) = or(not(X1),X2),
inference(spm,[status(thm)],[c_0_86,c_0_54]) ).
cnf(c_0_100,negated_conjecture,
or(X1,or(X2,X3)) = or(X2,or(X1,X3)),
inference(rw,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_101,negated_conjecture,
and(X1,and(X2,X3)) = and(X2,and(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90]),c_0_91]) ).
cnf(c_0_102,negated_conjecture,
and(not(X1),and(or(X1,X2),X3)) = and(not(X1),and(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_92]),c_0_74]) ).
cnf(c_0_103,negated_conjecture,
or(X1,and(or(X1,X2),X3)) = and(or(X1,X3),or(X1,X2)),
inference(spm,[status(thm)],[c_0_51,c_0_39]) ).
cnf(c_0_104,negated_conjecture,
or(not(X1),or(X1,X2)) = or(X1,not(X1)),
inference(rw,[status(thm)],[c_0_93,c_0_71]) ).
cnf(c_0_105,negated_conjecture,
or(X1,or(X2,X3)) = or(X2,or(X3,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_71]),c_0_72]) ).
cnf(c_0_106,plain,
or(X1,not(X1)) = not(n0),
inference(rw,[status(thm)],[c_0_94,c_0_43]) ).
cnf(c_0_107,negated_conjecture,
and(not(n0),X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_80]) ).
cnf(c_0_108,axiom,
or(X1,X1) = X1,
or_idempotency ).
cnf(c_0_109,negated_conjecture,
circuit(or(and(n0,and(or(not(a0),b0),or(a0,not(b0)))),or(and(not(a0),b0),and(a0,not(b0)))),or(and(and(a0,b0),and(or(not(a1),b1),or(a1,not(b1)))),and(or(not(a0),not(b0)),or(and(not(a1),b1),and(a1,not(b1))))),or(and(not(a1),and(and(a0,b0),b1)),and(a1,or(and(a0,b0),b1)))),
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)],[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_32]),c_0_36]),c_0_32]),c_0_36]),c_0_32]),c_0_36]),c_0_32]),c_0_84]),c_0_78]),c_0_54]),c_0_78]),c_0_54]),c_0_36]),c_0_32]),c_0_96]),c_0_78]),c_0_84]),c_0_78]),c_0_54]),c_0_78]),c_0_54]),c_0_36]),c_0_32]) ).
cnf(c_0_110,negated_conjecture,
and(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_65,c_0_36]) ).
cnf(c_0_111,negated_conjecture,
or(X1,or(and(X2,X1),X3)) = or(X1,X3),
inference(spm,[status(thm)],[c_0_32,c_0_40]) ).
cnf(c_0_112,negated_conjecture,
~ circuit(and(or(a0,b0),or(not(a0),not(b0))),and(or(a0,and(or(not(a0),not(b0)),and(or(a1,b1),or(not(a1),not(b1))))),and(or(b0,and(or(not(a0),not(b0)),and(or(a1,b1),or(not(a1),not(b1))))),and(or(not(a1),or(b1,and(or(not(a0),not(b0)),and(or(a1,b1),or(not(a1),not(b1)))))),or(a1,or(not(b1),and(or(not(a0),not(b0)),and(or(a1,b1),or(not(a1),not(b1))))))))),and(or(a1,and(a0,and(b0,or(a1,b1)))),or(b1,and(a0,and(b0,or(a1,b1)))))),
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)],[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)],[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)],[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_97,c_0_98]),c_0_70]),c_0_32]),c_0_99]),c_0_98]),c_0_98]),c_0_70]),c_0_32]),c_0_99]),c_0_98]),c_0_71]),c_0_100]),c_0_71]),c_0_100]),c_0_36]),c_0_98]),c_0_70]),c_0_32]),c_0_99]),c_0_98]),c_0_36]),c_0_74]),c_0_36]),c_0_74]),c_0_101]),c_0_36]),c_0_74]),c_0_74]),c_0_101]),c_0_101]),c_0_101]),c_0_98]),c_0_74]),c_0_101]),c_0_74]),c_0_101]),c_0_36]) ).
cnf(c_0_113,negated_conjecture,
or(X1,and(X2,X3)) = and(or(X1,X3),or(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_102]),c_0_54]),c_0_86]),c_0_54]),c_0_103]) ).
cnf(c_0_114,negated_conjecture,
or(X1,or(not(X1),X2)) = or(X1,not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_50]),c_0_105]) ).
cnf(c_0_115,plain,
and(X1,or(X2,not(X2))) = X1,
inference(spm,[status(thm)],[c_0_80,c_0_106]) ).
cnf(c_0_116,negated_conjecture,
or(X1,or(X2,not(X1))) = or(X1,not(X1)),
inference(spm,[status(thm)],[c_0_86,c_0_52]) ).
cnf(c_0_117,negated_conjecture,
and(or(X1,not(X1)),X2) = X2,
inference(spm,[status(thm)],[c_0_107,c_0_106]) ).
cnf(c_0_118,negated_conjecture,
or(X1,or(X2,or(X1,X3))) = or(X1,or(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_71]),c_0_71]) ).
cnf(c_0_119,negated_conjecture,
or(X1,or(X1,X2)) = or(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_108]),c_0_32]) ).
cnf(c_0_120,negated_conjecture,
circuit(or(and(not(a0),b0),and(a0,not(b0))),or(and(and(a0,b0),and(or(not(a1),b1),or(a1,not(b1)))),and(or(not(a0),not(b0)),or(and(not(a1),b1),and(a1,not(b1))))),or(and(not(a1),and(and(a0,b0),b1)),and(a1,or(and(a0,b0),b1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110]),c_0_76]) ).
cnf(c_0_121,negated_conjecture,
and(or(X1,X2),or(X1,or(X3,X2))) = or(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_98]),c_0_103]),c_0_36]) ).
cnf(c_0_122,negated_conjecture,
~ circuit(and(or(a0,b0),or(not(a0),not(b0))),and(or(a0,or(a1,b1)),and(or(b0,or(a1,b1)),and(or(not(a0),or(not(b0),or(not(a1),b1))),and(or(not(a0),or(not(b0),or(a1,not(b1)))),and(or(a0,or(not(a1),not(b1))),or(b0,or(not(a1),not(b1)))))))),and(or(a0,a1),and(or(b0,a1),and(or(a0,b1),and(or(b0,b1),or(a1,b1)))))),
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)],[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)],[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)],[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)],[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)],[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)],[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_112,c_0_113]),c_0_113]),c_0_113]),c_0_114]),c_0_115]),c_0_113]),c_0_113]),c_0_116]),c_0_115]),c_0_113]),c_0_113]),c_0_116]),c_0_72]),c_0_117]),c_0_113]),c_0_113]),c_0_113]),c_0_72]),c_0_74]),c_0_113]),c_0_113]),c_0_114]),c_0_115]),c_0_118]),c_0_74]),c_0_74]),c_0_74]),c_0_113]),c_0_113]),c_0_119]),c_0_74]),c_0_113]),c_0_72]),c_0_74]),c_0_74]),c_0_74]),c_0_100]),c_0_114]),c_0_106]),c_0_32]),c_0_71]),c_0_100]),c_0_100]),c_0_100]),c_0_32]),c_0_71]),c_0_100]),c_0_100]),c_0_100]),c_0_32]),c_0_106]),c_0_60]),c_0_80]),c_0_107]),c_0_36]),c_0_74]),c_0_101]),c_0_101]),c_0_101]),c_0_101]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_36]),c_0_101]),c_0_101]),c_0_91]) ).
cnf(c_0_123,negated_conjecture,
$false,
inference(sr,[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_98]),c_0_70]),c_0_32]),c_0_99]),c_0_98]),c_0_98]),c_0_70]),c_0_32]),c_0_99]),c_0_98]),c_0_71]),c_0_100]),c_0_71]),c_0_100]),c_0_36]),c_0_98]),c_0_70]),c_0_32]),c_0_99]),c_0_98]),c_0_36]),c_0_74]),c_0_36]),c_0_74]),c_0_101]),c_0_36]),c_0_74]),c_0_74]),c_0_101]),c_0_101]),c_0_101]),c_0_98]),c_0_74]),c_0_101]),c_0_98]),c_0_36]),c_0_98]),c_0_98]),c_0_36]),c_0_74]),c_0_36]),c_0_36]),c_0_74]),c_0_101]),c_0_98]),c_0_36]),c_0_99]),c_0_74]),c_0_74]),c_0_101]),c_0_36]),c_0_74]),c_0_74]),c_0_101]),c_0_101]),c_0_101]),c_0_113]),c_0_113]),c_0_36]),c_0_114]),c_0_106]),c_0_80]),c_0_113]),c_0_113]),c_0_36]),c_0_116]),c_0_106]),c_0_80]),c_0_113]),c_0_113]),c_0_116]),c_0_106]),c_0_72]),c_0_107]),c_0_32]),c_0_71]),c_0_100]),c_0_36]),c_0_113]),c_0_100]),c_0_114]),c_0_106]),c_0_100]),c_0_100]),c_0_107]),c_0_113]),c_0_113]),c_0_72]),c_0_32]),c_0_71]),c_0_116]),c_0_106]),c_0_80]),c_0_32]),c_0_71]),c_0_100]),c_0_36]),c_0_113]),c_0_114]),c_0_106]),c_0_100]),c_0_100]),c_0_107]),c_0_74]),c_0_36]),c_0_74]),c_0_74]),c_0_101]),c_0_101]),c_0_101]),c_0_74]),c_0_101]),c_0_101]),c_0_101]),c_0_101]),c_0_113]),c_0_113]),c_0_119]),c_0_36]),c_0_121]),c_0_36]),c_0_113]),c_0_113]),c_0_119]),c_0_100]),c_0_52]),c_0_36]),c_0_113]),c_0_100]),c_0_100]),c_0_36]),c_0_113]),c_0_113]),c_0_72]),c_0_72]),c_0_36]),c_0_32]),c_0_74]),c_0_101]),c_0_74]),c_0_36]),c_0_74]),c_0_121]),c_0_74]),c_0_36]),c_0_36]),c_0_74]),c_0_101]),c_0_36]),c_0_74]),c_0_74]),c_0_101]),c_0_121]),c_0_36]),c_0_74]),c_0_101]),c_0_74]),c_0_101]),c_0_90]),c_0_101]),c_0_74]),c_0_101]),c_0_90]),c_0_101]),c_0_122]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : HWV004-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 % Computer : n018.cluster.edu
% 0.16/0.45 % Model : x86_64 x86_64
% 0.16/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.45 % Memory : 8046.5625MB
% 0.16/0.45 % OS : Linux 6.8.0-71-generic
% 0.16/0.45 % CPULimit : 300
% 0.16/0.45 % WCLimit : 300
% 0.16/0.45 % DateTime : Sun Sep 20 20:49:14 UTC 2026
% 0.16/0.45 % CPUTime :
% 0.16/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.51 Running first-order theorem proving
% 0.24/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 22.03/3.93 % Version: 3.5.1
% 22.03/3.93 % Preprocessing class: FSMSSMSMSSSNFFN.
% 22.03/3.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.03/3.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 22.03/3.93 % Starting new_bool_3 with 300s (1) cores
% 22.03/3.93 % Starting new_bool_1 with 300s (1) cores
% 22.03/3.93 % Starting sh5l with 300s (1) cores
% 22.03/3.93 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 168408 completed with status 0
% 22.03/3.93 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 22.03/3.93 % Preprocessing class: FSMSSMSMSSSNFFN.
% 22.03/3.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.03/3.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 22.03/3.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 22.03/3.93 % No SInE strategy applied
% 22.03/3.93 % Search class: FUUSM-FFMM21-DFFFFFNN
% 22.03/3.93 % partial match(1): FHUSM-FFMM21-DFFFFFNN
% 22.03/3.93 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 22.03/3.93 % Starting SubtermCWHack with 136s (1) cores
% 22.03/3.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 22.03/3.93 % Starting sh3 with 271s (1) cores
% 22.03/3.93 % Starting ho_unfolding_3 with 271s (1) cores
% 22.03/3.93 % Starting new_ho_10_cnf2 with 271s (1) cores
% 22.03/3.93 % ho_unfolding_3 with pid 168417 completed with status 0
% 22.03/3.93 % Result found by ho_unfolding_3
% 22.03/3.93 % Preprocessing class: FSMSSMSMSSSNFFN.
% 22.03/3.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.03/3.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 22.03/3.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 22.03/3.93 % No SInE strategy applied
% 22.03/3.93 % Search class: FUUSM-FFMM21-DFFFFFNN
% 22.03/3.93 % partial match(1): FHUSM-FFMM21-DFFFFFNN
% 22.03/3.93 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 22.03/3.93 % Starting SubtermCWHack with 136s (1) cores
% 22.03/3.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 22.03/3.93 % Starting sh3 with 271s (1) cores
% 22.03/3.93 % Starting ho_unfolding_3 with 271s (1) cores
% 22.03/3.93 % Preprocessing time : 0.002 s
% 22.03/3.93 % Presaturation interreduction done
% 22.03/3.93
% 22.03/3.93 % Proof found!
% 22.03/3.93 % SZS status Unsatisfiable
% 22.03/3.93 % SZS output start CNFRefutation
% See solution above
% 22.03/3.93 % Parsed axioms : 41
% 22.03/3.93 % Removed by relevancy pruning/SinE : 0
% 22.03/3.93 % Initial clauses : 41
% 22.03/3.93 % Removed in clause preprocessing : 3
% 22.03/3.93 % Initial clauses in saturation : 38
% 22.03/3.93 % Processed clauses : 7277
% 22.03/3.93 % ...of these trivial : 664
% 22.03/3.93 % ...subsumed : 6198
% 22.03/3.93 % ...remaining for further processing : 414
% 22.03/3.93 % Other redundant clauses eliminated : 0
% 22.03/3.93 % Clauses deleted for lack of memory : 0
% 22.03/3.93 % Backward-subsumed : 3
% 22.03/3.93 % Backward-rewritten : 226
% 22.03/3.93 % Generated clauses : 96034
% 22.03/3.93 % ...of the previous two non-redundant : 76232
% 22.03/3.93 % ...aggressively subsumed : 0
% 22.03/3.93 % Contextual simplify-reflections : 0
% 22.03/3.93 % Paramodulations : 96034
% 22.03/3.93 % Factorizations : 0
% 22.03/3.93 % NegExts : 0
% 22.03/3.93 % Equation resolutions : 0
% 22.03/3.93 % Disequality decompositions : 0
% 22.03/3.93 % Total rewrite steps : 244547
% 22.03/3.93 % ...of those cached : 202540
% 22.03/3.93 % Propositional unsat checks : 0
% 22.03/3.93 % Propositional check models : 0
% 22.03/3.93 % Propositional check unsatisfiable : 0
% 22.03/3.93 % Propositional clauses : 0
% 22.03/3.93 % Propositional clauses after purity: 0
% 22.03/3.93 % Propositional unsat core size : 0
% 22.03/3.93 % Propositional preprocessing time : 0.000
% 22.03/3.93 % Propositional encoding time : 0.000
% 22.03/3.93 % Propositional solver time : 0.000
% 22.03/3.93 % Success case prop preproc time : 0.000
% 22.03/3.93 % Success case prop encoding time : 0.000
% 22.03/3.93 % Success case prop solver time : 0.000
% 22.03/3.93 % Current number of processed clauses : 148
% 22.03/3.93 % Positive orientable unit clauses : 92
% 22.03/3.93 % Positive unorientable unit clauses: 54
% 22.03/3.93 % Negative unit clauses : 2
% 22.03/3.93 % Non-unit-clauses : 0
% 22.03/3.93 % Current number of unprocessed clauses: 67103
% 22.03/3.93 % ...number of literals in the above : 67103
% 22.03/3.93 % Current number of archived formulas : 0
% 22.03/3.93 % Current number of archived clauses : 269
% 22.03/3.93 % Clause-clause subsumption calls (NU) : 0
% 22.03/3.93 % Rec. Clause-clause subsumption calls : 0
% 22.03/3.93 % Non-unit clause-clause subsumptions : 0
% 22.03/3.93 % Unit Clause-clause subsumption calls : 1023
% 22.03/3.93 % Rewrite failures with RHS unbound : 0
% 22.03/3.93 % BW rewrite match attempts : 4407
% 22.03/3.93 % BW rewrite match successes : 2461
% 22.03/3.93 % Condensation attempts : 7277
% 22.03/3.93 % Condensation successes : 0
% 22.03/3.93 % Termbank termtop insertions : 1309349
% 22.03/3.93 % Search garbage collected termcells : 2
% 22.03/3.93
% 22.03/3.93 % -------------------------------------------------
% 22.03/3.93 % User time : 2.595 s
% 22.03/3.93 % System time : 0.103 s
% 22.03/3.93 % Total time : 2.698 s
% 22.03/3.93 % Maximum resident set size: 3604 pages
% 22.03/3.93
% 22.03/3.93 % -------------------------------------------------
% 22.03/3.93 % User time : 14.719 s
% 22.03/3.93 % System time : 0.683 s
% 22.03/3.93 % Total time : 15.402 s
% 22.03/3.93 % Maximum resident set size: 4608 pages
% 22.03/3.93 % E exiting
%------------------------------------------------------------------------------