TSTP Solution File: HWV004-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HWV004-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:51:08 EDT 2023
% Result : Unsatisfiable 7.99s 1.48s
% Output : CNFRefutation 7.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 31
% Syntax : Number of clauses : 124 ( 124 unt; 0 nHn; 26 RR)
% Number of literals : 124 ( 111 equ; 6 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 : 208 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(and_or_subsumption1,axiom,
or(and(X1,X2),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_or_subsumption1) ).
cnf(or_symmetry,negated_conjecture,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',or_symmetry) ).
cnf(and_or_simplification,negated_conjecture,
and(or(X1,X2),X3) = or(and(X1,X3),and(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_or_simplification) ).
cnf(and_idempotency,axiom,
and(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_idempotency) ).
cnf(and_symmetry,negated_conjecture,
and(X1,X2) = and(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_symmetry) ).
cnf(and_or_subsumption3,axiom,
or(or(and(X1,X2),X3),X2) = or(X3,X2),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_or_subsumption3) ).
cnf(and_or_subsumption4,axiom,
or(or(X1,and(X2,X3)),X3) = or(X1,X3),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_or_subsumption4) ).
cnf(karnaugh2,axiom,
or(and(not(X1),not(X2)),X2) = or(X2,not(X1)),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',karnaugh2) ).
cnf(or_definition2,axiom,
or(X1,n1) = n1,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',or_definition2) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',not_definition1) ).
cnf(s0_definition,negated_conjecture,
s0 = sum(a0,b0,n0),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',s0_definition) ).
cnf(sum_definition,negated_conjecture,
sum(X1,X2,X3) = xor(xor(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',sum_definition) ).
cnf(xor_definition,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(X2,not(X1))),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',xor_definition) ).
cnf(overflow_definition,negated_conjecture,
overflow = carryout(a1,b1,carryout(a0,b0,n0)),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.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/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',carryout_definition) ).
cnf(not_involution,axiom,
not(not(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',not_involution) ).
cnf(or_commutativity,negated_conjecture,
or(or(X1,X2),X3) = or(or(X1,X3),X2),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',or_commutativity) ).
cnf(or_evaluation1,axiom,
or(or(X1,X2),X2) = or(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',or_evaluation1) ).
cnf(and_evaluation1,axiom,
and(and(X1,X2),X2) = and(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_evaluation1) ).
cnf(and_commutativity,negated_conjecture,
and(and(X1,X2),X3) = and(and(X1,X3),X2),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_commutativity) ).
cnf(or_definition1,axiom,
or(X1,n0) = X1,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',or_definition1) ).
cnf(the_output_circuit,negated_conjecture,
circuit(s0,s1,overflow),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',the_output_circuit) ).
cnf(and_definition2,axiom,
and(X1,n1) = X1,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_definition2) ).
cnf(and_definition1,axiom,
and(X1,n0) = n0,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_definition1) ).
cnf(s1_definition,negated_conjecture,
s1 = sum(a1,b1,carryout(a0,b0,n0)),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',s1_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/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',prove_circuit) ).
cnf(and_not_evaluation1,axiom,
and(X1,not(X1)) = n0,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',and_not_evaluation1) ).
cnf(demorgan1,axiom,
not(and(X1,X2)) = or(not(X1),not(X2)),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',demorgan1) ).
cnf(demorgan2,axiom,
not(or(X1,X2)) = and(not(X1),not(X2)),
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',demorgan2) ).
cnf(or_not_evaluation1,axiom,
or(X1,not(X1)) = n1,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.p',or_not_evaluation1) ).
cnf(or_idempotency,axiom,
or(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.7McjU1zNzp/E---3.1_996.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,plain,
or(X1,or(X2,and(X3,X1))) = or(X2,X1),
inference(rw,[status(thm)],[c_0_38,c_0_32]) ).
cnf(c_0_50,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_51,negated_conjecture,
and(X1,or(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_52,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_53,axiom,
not(not(X1)) = X1,
not_involution ).
cnf(c_0_54,negated_conjecture,
or(or(X1,X2),X3) = or(or(X1,X3),X2),
or_commutativity ).
cnf(c_0_55,axiom,
or(or(X1,X2),X2) = or(X1,X2),
or_evaluation1 ).
cnf(c_0_56,axiom,
and(and(X1,X2),X2) = and(X1,X2),
and_evaluation1 ).
cnf(c_0_57,negated_conjecture,
and(and(X1,X2),X3) = and(and(X1,X3),X2),
and_commutativity ).
cnf(c_0_58,axiom,
or(X1,n0) = X1,
or_definition1 ).
cnf(c_0_59,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_60,negated_conjecture,
circuit(s0,s1,overflow),
the_output_circuit ).
cnf(c_0_61,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_62,axiom,
and(X1,n1) = X1,
and_definition2 ).
cnf(c_0_63,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_64,axiom,
and(X1,n0) = n0,
and_definition1 ).
cnf(c_0_65,negated_conjecture,
s1 = sum(a1,b1,carryout(a0,b0,n0)),
s1_definition ).
cnf(c_0_66,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)))),
prove_circuit ).
cnf(c_0_67,negated_conjecture,
or(X1,and(or(X2,X1),X3)) = or(and(X2,X3),X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_68,negated_conjecture,
or(X1,and(or(X2,X1),X3)) = and(or(X1,X3),or(X2,X1)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_69,plain,
or(X1,and(X2,not(X1))) = or(X1,X2),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_70,negated_conjecture,
or(or(X1,X2),X3) = or(X2,or(X1,X3)),
inference(spm,[status(thm)],[c_0_32,c_0_54]) ).
cnf(c_0_71,plain,
or(X1,or(X2,X1)) = or(X2,X1),
inference(rw,[status(thm)],[c_0_55,c_0_32]) ).
cnf(c_0_72,plain,
and(X1,and(X2,X1)) = and(X2,X1),
inference(rw,[status(thm)],[c_0_56,c_0_36]) ).
cnf(c_0_73,negated_conjecture,
and(and(X1,X2),X3) = and(X2,and(X1,X3)),
inference(spm,[status(thm)],[c_0_36,c_0_57]) ).
cnf(c_0_74,axiom,
and(X1,not(X1)) = n0,
and_not_evaluation1 ).
cnf(c_0_75,negated_conjecture,
or(n0,X1) = X1,
inference(spm,[status(thm)],[c_0_58,c_0_32]) ).
cnf(c_0_76,negated_conjecture,
or(not(n0),X1) = not(n0),
inference(spm,[status(thm)],[c_0_59,c_0_32]) ).
cnf(c_0_77,axiom,
not(and(X1,X2)) = or(not(X1),not(X2)),
demorgan1 ).
cnf(c_0_78,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_60,c_0_61]) ).
cnf(c_0_79,plain,
and(X1,not(n0)) = X1,
inference(rw,[status(thm)],[c_0_62,c_0_43]) ).
cnf(c_0_80,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_63,c_0_58]),c_0_64]),c_0_64]),c_0_58]),c_0_58]),c_0_64]),c_0_64]),c_0_58]) ).
cnf(c_0_81,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_65,c_0_45]),c_0_46]),c_0_46]),c_0_48]),c_0_48]) ).
cnf(c_0_82,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_66,c_0_46]),c_0_46]),c_0_46]),c_0_48]),c_0_48]) ).
cnf(c_0_83,axiom,
not(or(X1,X2)) = and(not(X1),not(X2)),
demorgan2 ).
cnf(c_0_84,negated_conjecture,
and(or(X1,X2),or(X3,X1)) = or(and(X3,X2),X1),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_85,negated_conjecture,
or(X1,and(not(X1),X2)) = or(X1,X2),
inference(spm,[status(thm)],[c_0_69,c_0_36]) ).
cnf(c_0_86,negated_conjecture,
or(X1,or(X2,or(X3,X1))) = or(X3,or(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_51]),c_0_70]) ).
cnf(c_0_87,negated_conjecture,
or(X1,or(X2,or(X3,X1))) = or(X2,or(X3,X1)),
inference(spm,[status(thm)],[c_0_71,c_0_70]) ).
cnf(c_0_88,negated_conjecture,
and(X1,and(X2,and(X3,and(X2,X1)))) = and(X3,and(X2,X1)),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_89,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_73,c_0_72]),c_0_73]),c_0_73]) ).
cnf(c_0_90,negated_conjecture,
and(X1,and(X2,and(X3,X1))) = and(X2,and(X3,X1)),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_91,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_74]),c_0_75]) ).
cnf(c_0_92,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_76,c_0_74]),c_0_77]),c_0_53]),c_0_77]),c_0_53]),c_0_32]),c_0_32]) ).
cnf(c_0_93,axiom,
or(X1,not(X1)) = n1,
or_not_evaluation1 ).
cnf(c_0_94,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_78,c_0_79]),c_0_80]) ).
cnf(c_0_95,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_81,c_0_36]),c_0_32]),c_0_58]),c_0_64]),c_0_64]),c_0_58]),c_0_36]),c_0_58]),c_0_64]),c_0_64]),c_0_58]),c_0_36]),c_0_32]) ).
cnf(c_0_96,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_82,c_0_32]),c_0_36]),c_0_36]),c_0_32]),c_0_58]),c_0_64]),c_0_64]),c_0_58]),c_0_77]),c_0_36]),c_0_58]),c_0_64]),c_0_64]),c_0_58]),c_0_36]),c_0_32]),c_0_83]),c_0_77]),c_0_53]),c_0_77]),c_0_53]),c_0_36]),c_0_32]) ).
cnf(c_0_97,negated_conjecture,
or(and(X1,X2),X3) = and(or(X2,X3),or(X1,X3)),
inference(spm,[status(thm)],[c_0_84,c_0_32]) ).
cnf(c_0_98,negated_conjecture,
or(not(X1),and(X1,X2)) = or(not(X1),X2),
inference(spm,[status(thm)],[c_0_85,c_0_53]) ).
cnf(c_0_99,negated_conjecture,
or(X1,or(X2,X3)) = or(X2,or(X1,X3)),
inference(rw,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_100,negated_conjecture,
and(X1,and(X2,X3)) = and(X2,and(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_89]),c_0_90]) ).
cnf(c_0_101,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_73,c_0_91]),c_0_73]) ).
cnf(c_0_102,negated_conjecture,
or(X1,and(or(X1,X2),X3)) = and(or(X1,X3),or(X1,X2)),
inference(spm,[status(thm)],[c_0_50,c_0_39]) ).
cnf(c_0_103,negated_conjecture,
or(not(X1),or(X1,X2)) = or(X1,not(X1)),
inference(rw,[status(thm)],[c_0_92,c_0_70]) ).
cnf(c_0_104,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_49,c_0_39]),c_0_70]),c_0_71]) ).
cnf(c_0_105,plain,
or(X1,not(X1)) = not(n0),
inference(rw,[status(thm)],[c_0_93,c_0_43]) ).
cnf(c_0_106,negated_conjecture,
and(not(n0),X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_79]) ).
cnf(c_0_107,axiom,
or(X1,X1) = X1,
or_idempotency ).
cnf(c_0_108,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_94,c_0_32]),c_0_36]),c_0_32]),c_0_36]),c_0_32]),c_0_36]),c_0_32]),c_0_83]),c_0_77]),c_0_53]),c_0_77]),c_0_53]),c_0_36]),c_0_32]),c_0_95]),c_0_77]),c_0_83]),c_0_77]),c_0_53]),c_0_77]),c_0_53]),c_0_36]),c_0_32]) ).
cnf(c_0_109,negated_conjecture,
and(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_64,c_0_36]) ).
cnf(c_0_110,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_111,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_96,c_0_97]),c_0_69]),c_0_32]),c_0_98]),c_0_97]),c_0_97]),c_0_69]),c_0_32]),c_0_98]),c_0_97]),c_0_70]),c_0_99]),c_0_70]),c_0_99]),c_0_36]),c_0_97]),c_0_69]),c_0_32]),c_0_98]),c_0_97]),c_0_36]),c_0_73]),c_0_36]),c_0_73]),c_0_100]),c_0_36]),c_0_73]),c_0_73]),c_0_100]),c_0_100]),c_0_100]),c_0_97]),c_0_73]),c_0_100]),c_0_73]),c_0_100]),c_0_36]) ).
cnf(c_0_112,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_98,c_0_101]),c_0_53]),c_0_85]),c_0_53]),c_0_102]) ).
cnf(c_0_113,negated_conjecture,
or(X1,or(not(X1),X2)) = or(X1,not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_49]),c_0_104]) ).
cnf(c_0_114,plain,
and(X1,or(X2,not(X2))) = X1,
inference(spm,[status(thm)],[c_0_79,c_0_105]) ).
cnf(c_0_115,negated_conjecture,
or(X1,or(X2,not(X1))) = or(X1,not(X1)),
inference(spm,[status(thm)],[c_0_85,c_0_51]) ).
cnf(c_0_116,negated_conjecture,
and(or(X1,not(X1)),X2) = X2,
inference(spm,[status(thm)],[c_0_106,c_0_105]) ).
cnf(c_0_117,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_70,c_0_71]),c_0_70]),c_0_70]) ).
cnf(c_0_118,negated_conjecture,
or(X1,or(X1,X2)) = or(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_107]),c_0_32]) ).
cnf(c_0_119,plain,
or(X1,not(X1)) = or(X2,not(X2)),
inference(spm,[status(thm)],[c_0_105,c_0_105]) ).
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_108,c_0_109]),c_0_75]) ).
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_110,c_0_97]),c_0_102]),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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_112]),c_0_112]),c_0_113]),c_0_114]),c_0_112]),c_0_112]),c_0_115]),c_0_114]),c_0_112]),c_0_112]),c_0_115]),c_0_71]),c_0_116]),c_0_112]),c_0_112]),c_0_112]),c_0_71]),c_0_73]),c_0_112]),c_0_112]),c_0_113]),c_0_114]),c_0_117]),c_0_73]),c_0_73]),c_0_73]),c_0_112]),c_0_112]),c_0_118]),c_0_73]),c_0_112]),c_0_71]),c_0_73]),c_0_73]),c_0_73]),c_0_99]),c_0_113]),c_0_119]),c_0_59]),c_0_32]),c_0_70]),c_0_99]),c_0_99]),c_0_99]),c_0_32]),c_0_70]),c_0_99]),c_0_99]),c_0_99]),c_0_32]),c_0_119]),c_0_59]),c_0_59]),c_0_79]),c_0_106]),c_0_36]),c_0_73]),c_0_100]),c_0_100]),c_0_100]),c_0_100]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_36]),c_0_100]),c_0_100]),c_0_90]) ).
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)],[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_97]),c_0_69]),c_0_32]),c_0_98]),c_0_97]),c_0_97]),c_0_69]),c_0_32]),c_0_98]),c_0_97]),c_0_70]),c_0_99]),c_0_70]),c_0_99]),c_0_36]),c_0_97]),c_0_69]),c_0_32]),c_0_98]),c_0_97]),c_0_36]),c_0_73]),c_0_36]),c_0_73]),c_0_100]),c_0_36]),c_0_73]),c_0_73]),c_0_100]),c_0_100]),c_0_100]),c_0_97]),c_0_73]),c_0_100]),c_0_97]),c_0_36]),c_0_97]),c_0_97]),c_0_36]),c_0_73]),c_0_36]),c_0_36]),c_0_73]),c_0_100]),c_0_97]),c_0_36]),c_0_98]),c_0_73]),c_0_73]),c_0_100]),c_0_36]),c_0_73]),c_0_73]),c_0_100]),c_0_100]),c_0_100]),c_0_112]),c_0_112]),c_0_36]),c_0_113]),c_0_119]),c_0_59]),c_0_79]),c_0_112]),c_0_112]),c_0_36]),c_0_115]),c_0_119]),c_0_59]),c_0_79]),c_0_112]),c_0_112]),c_0_115]),c_0_119]),c_0_59]),c_0_71]),c_0_106]),c_0_32]),c_0_70]),c_0_99]),c_0_36]),c_0_112]),c_0_99]),c_0_113]),c_0_119]),c_0_59]),c_0_99]),c_0_99]),c_0_106]),c_0_112]),c_0_112]),c_0_71]),c_0_32]),c_0_70]),c_0_115]),c_0_119]),c_0_59]),c_0_79]),c_0_32]),c_0_70]),c_0_99]),c_0_36]),c_0_112]),c_0_113]),c_0_119]),c_0_59]),c_0_99]),c_0_99]),c_0_106]),c_0_73]),c_0_36]),c_0_73]),c_0_73]),c_0_100]),c_0_100]),c_0_100]),c_0_73]),c_0_100]),c_0_100]),c_0_100]),c_0_100]),c_0_112]),c_0_112]),c_0_118]),c_0_36]),c_0_121]),c_0_36]),c_0_112]),c_0_112]),c_0_118]),c_0_99]),c_0_51]),c_0_36]),c_0_112]),c_0_99]),c_0_99]),c_0_36]),c_0_112]),c_0_112]),c_0_71]),c_0_71]),c_0_36]),c_0_32]),c_0_73]),c_0_100]),c_0_73]),c_0_36]),c_0_73]),c_0_121]),c_0_73]),c_0_36]),c_0_36]),c_0_73]),c_0_100]),c_0_36]),c_0_73]),c_0_73]),c_0_100]),c_0_121]),c_0_36]),c_0_73]),c_0_100]),c_0_73]),c_0_100]),c_0_89]),c_0_100]),c_0_73]),c_0_100]),c_0_89]),c_0_100]),c_0_122]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV004-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 05:01:31 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/tmp/tmp.7McjU1zNzp/E---3.1_996.p
% 7.99/1.48 # Version: 3.1pre001
% 7.99/1.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 7.99/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.99/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.99/1.48 # Starting new_bool_3 with 300s (1) cores
% 7.99/1.48 # Starting new_bool_1 with 300s (1) cores
% 7.99/1.48 # Starting sh5l with 300s (1) cores
% 7.99/1.48 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1091 completed with status 0
% 7.99/1.48 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 7.99/1.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 7.99/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.99/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.99/1.48 # No SInE strategy applied
% 7.99/1.48 # Search class: FUUSM-FFMM21-DFFFFFNN
% 7.99/1.48 # partial match(1): FHUSM-FFMM21-DFFFFFNN
% 7.99/1.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 7.99/1.48 # Starting new_ho_10 with 271s (1) cores
% 7.99/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 7.99/1.48 # Starting ho_unfolding_3 with 271s (1) cores
% 7.99/1.48 # Starting new_ho_10_cnf2 with 271s (1) cores
% 7.99/1.48 # Starting pre_casc_2 with 271s (1) cores
% 7.99/1.48 # ho_unfolding_3 with pid 1100 completed with status 0
% 7.99/1.48 # Result found by ho_unfolding_3
% 7.99/1.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 7.99/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.99/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 7.99/1.48 # No SInE strategy applied
% 7.99/1.48 # Search class: FUUSM-FFMM21-DFFFFFNN
% 7.99/1.48 # partial match(1): FHUSM-FFMM21-DFFFFFNN
% 7.99/1.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 7.99/1.48 # Starting new_ho_10 with 271s (1) cores
% 7.99/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 7.99/1.48 # Starting ho_unfolding_3 with 271s (1) cores
% 7.99/1.48 # Preprocessing time : 0.001 s
% 7.99/1.48 # Presaturation interreduction done
% 7.99/1.48
% 7.99/1.48 # Proof found!
% 7.99/1.48 # SZS status Unsatisfiable
% 7.99/1.48 # SZS output start CNFRefutation
% See solution above
% 7.99/1.48 # Parsed axioms : 41
% 7.99/1.48 # Removed by relevancy pruning/SinE : 0
% 7.99/1.48 # Initial clauses : 41
% 7.99/1.48 # Removed in clause preprocessing : 3
% 7.99/1.48 # Initial clauses in saturation : 38
% 7.99/1.48 # Processed clauses : 7277
% 7.99/1.48 # ...of these trivial : 664
% 7.99/1.48 # ...subsumed : 6198
% 7.99/1.48 # ...remaining for further processing : 414
% 7.99/1.48 # Other redundant clauses eliminated : 0
% 7.99/1.48 # Clauses deleted for lack of memory : 0
% 7.99/1.48 # Backward-subsumed : 3
% 7.99/1.48 # Backward-rewritten : 226
% 7.99/1.48 # Generated clauses : 96034
% 7.99/1.48 # ...of the previous two non-redundant : 76232
% 7.99/1.48 # ...aggressively subsumed : 0
% 7.99/1.48 # Contextual simplify-reflections : 0
% 7.99/1.48 # Paramodulations : 96034
% 7.99/1.48 # Factorizations : 0
% 7.99/1.48 # NegExts : 0
% 7.99/1.48 # Equation resolutions : 0
% 7.99/1.48 # Total rewrite steps : 244565
% 7.99/1.48 # Propositional unsat checks : 0
% 7.99/1.48 # Propositional check models : 0
% 7.99/1.48 # Propositional check unsatisfiable : 0
% 7.99/1.48 # Propositional clauses : 0
% 7.99/1.48 # Propositional clauses after purity: 0
% 7.99/1.48 # Propositional unsat core size : 0
% 7.99/1.48 # Propositional preprocessing time : 0.000
% 7.99/1.48 # Propositional encoding time : 0.000
% 7.99/1.48 # Propositional solver time : 0.000
% 7.99/1.48 # Success case prop preproc time : 0.000
% 7.99/1.48 # Success case prop encoding time : 0.000
% 7.99/1.48 # Success case prop solver time : 0.000
% 7.99/1.48 # Current number of processed clauses : 148
% 7.99/1.48 # Positive orientable unit clauses : 92
% 7.99/1.48 # Positive unorientable unit clauses: 54
% 7.99/1.48 # Negative unit clauses : 2
% 7.99/1.48 # Non-unit-clauses : 0
% 7.99/1.48 # Current number of unprocessed clauses: 67103
% 7.99/1.48 # ...number of literals in the above : 67103
% 7.99/1.48 # Current number of archived formulas : 0
% 7.99/1.48 # Current number of archived clauses : 269
% 7.99/1.48 # Clause-clause subsumption calls (NU) : 0
% 7.99/1.48 # Rec. Clause-clause subsumption calls : 0
% 7.99/1.48 # Non-unit clause-clause subsumptions : 0
% 7.99/1.48 # Unit Clause-clause subsumption calls : 1023
% 7.99/1.48 # Rewrite failures with RHS unbound : 0
% 7.99/1.48 # BW rewrite match attempts : 4407
% 7.99/1.48 # BW rewrite match successes : 2461
% 7.99/1.48 # Condensation attempts : 7277
% 7.99/1.48 # Condensation successes : 0
% 7.99/1.48 # Termbank termtop insertions : 1309313
% 7.99/1.48
% 7.99/1.48 # -------------------------------------------------
% 7.99/1.48 # User time : 0.904 s
% 7.99/1.48 # System time : 0.044 s
% 7.99/1.48 # Total time : 0.948 s
% 7.99/1.48 # Maximum resident set size: 1692 pages
% 7.99/1.48
% 7.99/1.48 # -------------------------------------------------
% 7.99/1.48 # User time : 4.550 s
% 7.99/1.48 # System time : 0.229 s
% 7.99/1.48 # Total time : 4.779 s
% 7.99/1.48 # Maximum resident set size: 1728 pages
% 7.99/1.48 % E---3.1 exiting
% 7.99/1.48 % E---3.1 exiting
%------------------------------------------------------------------------------