%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN036-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:31:52 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.46s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 20
% Syntax : Number of clauses : 98 ( 7 unt; 63 nHn; 27 RR)
% Number of literals : 397 ( 0 equ; 190 neg)
% Maximal clause size : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 189 ( 123 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_10,negated_conjecture,
( ~ p(cx)
| q(fz(X2))
| q(X2)
| q(cw)
| p(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_2,negated_conjecture,
( ~ q(X1)
| ~ p(cx)
| q(cw)
| p(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
( ~ q(cw)
| ~ p(cx)
| q(X2)
| p(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_9,negated_conjecture,
( ~ q(fz(X1))
| ~ q(X1)
| ~ p(cx)
| q(X3)
| p(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_6,negated_conjecture,
( ~ q(X2)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx)
| q(cw) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_4,negated_conjecture,
( ~ q(X2)
| ~ p(X1)
| q(cw)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_15,negated_conjecture,
( ~ p(X1)
| q(fz(X2))
| q(X2)
| q(cw)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_3,negated_conjecture,
( ~ q(cw)
| ~ p(X1)
| q(X2)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_17,negated_conjecture,
( ~ q(X2)
| ~ p(X1)
| q(fz5(X3))
| q(X3)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_32,negated_conjecture,
( q(fz5(X2))
| q(X2)
| q(cw)
| p(fy5(X1))
| p(X1)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_32) ).
cnf(clause_20,negated_conjecture,
( ~ q(X1)
| q(cw)
| p(fy(X2))
| p(X2)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_21,negated_conjecture,
( ~ q(fz(X2))
| ~ q(X2)
| ~ p(fy(X1))
| ~ p(X1)
| ~ p(cx)
| q(cw) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_19,negated_conjecture,
( ~ q(cw)
| q(X2)
| p(fy(X1))
| p(X1)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_22,negated_conjecture,
( ~ p(fy(X1))
| ~ p(X1)
| ~ p(cx)
| q(fz(X2))
| q(X2)
| q(cw) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_11,negated_conjecture,
( ~ q(cw)
| ~ p(fy(X1))
| ~ p(X1)
| q(X3)
| p(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_5,negated_conjecture,
( ~ q(cw)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx)
| q(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_16,negated_conjecture,
( ~ q(fz5(X2))
| ~ q(X2)
| ~ q(cw)
| ~ p(X1)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_7,negated_conjecture,
( ~ q(fz5(X1))
| ~ q(X1)
| ~ q(cw)
| ~ p(cx)
| p(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_30,negated_conjecture,
( ~ q(fz(X1))
| ~ q(X1)
| ~ q(cw)
| p(fy(X2))
| p(X2)
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_30) ).
cnf(clause_23,negated_conjecture,
( ~ q(fz5(X2))
| ~ q(X2)
| ~ q(cw)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).
cnf(c_0_20,negated_conjecture,
( ~ p(cx)
| q(fz(X2))
| q(X2)
| q(cw)
| p(X1) ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_21,negated_conjecture,
( ~ q(X1)
| ~ p(cx)
| q(cw)
| p(X2) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_22,negated_conjecture,
( ~ q(cw)
| ~ p(cx)
| q(X2)
| p(X1) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_23,negated_conjecture,
( ~ q(fz(X1))
| ~ q(X1)
| ~ p(cx)
| q(X3)
| p(X2) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_24,negated_conjecture,
( ~ p(cx)
| q(fz(X2))
| q(X2)
| q(cw)
| p(X1) ),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
( ~ q(X1)
| ~ p(cx)
| q(cw)
| p(X2) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
( ~ q(cw)
| ~ p(cx)
| q(X2)
| p(X1) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
( ~ q(X2)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx)
| q(cw) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_28,negated_conjecture,
( ~ q(fz(X1))
| ~ q(X1)
| ~ p(cx)
| q(X3)
| p(X2) ),
c_0_23 ).
cnf(c_0_29,negated_conjecture,
( ~ p(cx)
| p(X2)
| q(fz(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( ~ q(X2)
| ~ p(X1)
| q(cw)
| p(cx) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_31,negated_conjecture,
( ~ p(X1)
| q(fz(X2))
| q(X2)
| q(cw)
| p(cx) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_32,negated_conjecture,
( ~ q(cw)
| ~ p(X1)
| q(X2)
| p(cx) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_33,negated_conjecture,
( ~ q(X2)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx)
| q(cw) ),
c_0_27 ).
cnf(c_0_34,negated_conjecture,
( ~ p(cx)
| ~ q(X3)
| p(X2)
| q(X1) ),
inference(csr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( ~ q(X2)
| ~ p(X1)
| q(cw)
| p(cx) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
( ~ q(X2)
| ~ p(X1)
| q(fz5(X3))
| q(X3)
| p(cx) ),
inference(fof_simplification,[status(thm)],[clause_17]) ).
cnf(c_0_37,negated_conjecture,
( ~ p(X1)
| q(fz(X2))
| q(X2)
| q(cw)
| p(cx) ),
c_0_31 ).
cnf(c_0_38,negated_conjecture,
( ~ q(cw)
| ~ p(X1)
| q(X2)
| p(cx) ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
( ~ p(fy5(X2))
| ~ q(X1)
| q(cw) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( q(fz5(X2))
| q(X2)
| q(cw)
| p(fy5(X1))
| p(X1)
| p(cx) ),
clause_32 ).
cnf(c_0_41,negated_conjecture,
( ~ q(X2)
| ~ p(X1)
| q(fz5(X3))
| q(X3)
| p(cx) ),
c_0_36 ).
cnf(c_0_42,negated_conjecture,
( ~ q(X1)
| q(cw)
| p(fy(X2))
| p(X2)
| p(cx) ),
inference(fof_simplification,[status(thm)],[clause_20]) ).
cnf(c_0_43,negated_conjecture,
( ~ p(X2)
| p(cx)
| q(fz(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_37,c_0_35]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( ~ q(X2)
| p(cx)
| q(X1)
| q(cw)
| q(fz5(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ q(fz(X2))
| ~ q(X2)
| ~ p(fy(X1))
| ~ p(X1)
| ~ p(cx)
| q(cw) ),
inference(fof_simplification,[status(thm)],[clause_21]) ).
cnf(c_0_46,negated_conjecture,
( ~ q(X1)
| q(cw)
| p(fy(X2))
| p(X2)
| p(cx) ),
c_0_42 ).
cnf(c_0_47,negated_conjecture,
( p(cx)
| q(X1)
| q(cw)
| q(fz5(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_43]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( ~ q(fz(X2))
| ~ q(X2)
| ~ p(fy(X1))
| ~ p(X1)
| ~ p(cx)
| q(cw) ),
c_0_45 ).
cnf(c_0_49,negated_conjecture,
( ~ q(X2)
| p(fy(X1))
| q(cw) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_46,c_0_35]),c_0_25]) ).
cnf(c_0_50,negated_conjecture,
( ~ p(X1)
| p(cx)
| q(cw) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_47]),c_0_35]) ).
cnf(c_0_51,negated_conjecture,
( ~ q(X1)
| ~ q(fz(X1))
| q(cw) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_48,c_0_34]),c_0_35]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( p(cx)
| q(X1)
| q(cw) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_47]),c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( p(cx)
| q(cw) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_52]) ).
cnf(c_0_54,negated_conjecture,
( p(X2)
| q(cw)
| q(fz(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
( ~ q(X2)
| p(X1)
| q(cw) ),
inference(spm,[status(thm)],[c_0_51,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
( ~ q(cw)
| q(X2)
| p(fy(X1))
| p(X1)
| p(cx) ),
inference(fof_simplification,[status(thm)],[clause_19]) ).
cnf(c_0_57,negated_conjecture,
( ~ p(fy(X1))
| ~ p(X1)
| ~ p(cx)
| q(fz(X2))
| q(X2)
| q(cw) ),
inference(fof_simplification,[status(thm)],[clause_22]) ).
cnf(c_0_58,negated_conjecture,
( p(X2)
| p(X1)
| q(cw) ),
inference(spm,[status(thm)],[c_0_55,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( ~ q(cw)
| ~ p(fy(X1))
| ~ p(X1)
| q(X3)
| p(X2) ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_60,negated_conjecture,
( ~ q(cw)
| q(X2)
| p(fy(X1))
| p(X1)
| p(cx) ),
c_0_56 ).
cnf(c_0_61,negated_conjecture,
( ~ p(fy(X1))
| ~ p(X1)
| ~ p(cx)
| q(fz(X2))
| q(X2)
| q(cw) ),
c_0_57 ).
cnf(c_0_62,negated_conjecture,
( p(X1)
| q(cw) ),
inference(ef,[status(thm)],[c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( ~ q(cw)
| ~ p(fy(X1))
| ~ p(X1)
| q(X3)
| p(X2) ),
c_0_59 ).
cnf(c_0_64,negated_conjecture,
( ~ q(cw)
| p(fy(X2))
| q(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_60,c_0_38]),c_0_26]) ).
cnf(c_0_65,negated_conjecture,
( ~ p(fy(X2))
| q(X1)
| q(cw)
| q(fz(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_61,c_0_29]),c_0_43]) ).
cnf(c_0_66,negated_conjecture,
( ~ q(X1)
| q(cw) ),
inference(spm,[status(thm)],[c_0_39,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
( ~ q(cw)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx)
| q(X2) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_68,negated_conjecture,
( ~ p(X3)
| ~ q(cw)
| p(X2)
| q(X1) ),
inference(csr,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
q(cw),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_62]),c_0_66]),c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( ~ q(cw)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx)
| q(X2) ),
c_0_67 ).
cnf(c_0_71,negated_conjecture,
( ~ p(X3)
| p(X2)
| q(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_72,negated_conjecture,
( p(fy(X2))
| q(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_69])]) ).
cnf(c_0_73,negated_conjecture,
( ~ p(fy5(X2))
| ~ q(cw)
| q(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_70,c_0_34]),c_0_68]) ).
cnf(c_0_74,negated_conjecture,
( p(X3)
| q(X2)
| q(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,negated_conjecture,
( ~ q(fz5(X2))
| ~ q(X2)
| ~ q(cw)
| ~ p(X1)
| p(cx) ),
inference(fof_simplification,[status(thm)],[clause_16]) ).
cnf(c_0_76,negated_conjecture,
( ~ p(fy5(X2))
| q(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_69])]) ).
cnf(c_0_77,negated_conjecture,
( p(X2)
| q(X1) ),
inference(ef,[status(thm)],[c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( ~ q(fz5(X1))
| ~ q(X1)
| ~ q(cw)
| ~ p(cx)
| p(X2) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_79,negated_conjecture,
( ~ q(fz(X1))
| ~ q(X1)
| ~ q(cw)
| p(fy(X2))
| p(X2)
| p(cx) ),
inference(fof_simplification,[status(thm)],[clause_30]) ).
cnf(c_0_80,negated_conjecture,
( ~ q(fz5(X2))
| ~ q(X2)
| ~ q(cw)
| ~ p(X1)
| p(cx) ),
c_0_75 ).
cnf(c_0_81,negated_conjecture,
( q(X2)
| q(X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,negated_conjecture,
( ~ q(fz5(X1))
| ~ q(X1)
| ~ q(cw)
| ~ p(cx)
| p(X2) ),
c_0_78 ).
cnf(c_0_83,negated_conjecture,
( ~ q(fz(X1))
| ~ q(X1)
| ~ q(cw)
| p(fy(X2))
| p(X2)
| p(cx) ),
c_0_79 ).
cnf(c_0_84,negated_conjecture,
( ~ p(X2)
| ~ q(fz5(X1))
| p(cx) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_80,c_0_68]),c_0_35]) ).
cnf(c_0_85,negated_conjecture,
q(X1),
inference(ef,[status(thm)],[c_0_81]) ).
cnf(c_0_86,negated_conjecture,
( ~ p(cx)
| ~ q(fz5(X2))
| p(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_82,c_0_34]),c_0_34]) ).
cnf(c_0_87,negated_conjecture,
( ~ q(fz5(X2))
| ~ q(X2)
| ~ q(cw)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx) ),
inference(fof_simplification,[status(thm)],[clause_23]) ).
cnf(c_0_88,negated_conjecture,
( ~ q(fz(X2))
| p(X1)
| p(cx)
| p(fy(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_83,c_0_64]),c_0_49]) ).
cnf(c_0_89,negated_conjecture,
( ~ p(X1)
| p(cx) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_90,negated_conjecture,
( ~ p(cx)
| p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_85])]) ).
cnf(c_0_91,negated_conjecture,
( ~ q(fz5(X2))
| ~ q(X2)
| ~ q(cw)
| ~ p(fy5(X1))
| ~ p(X1)
| ~ p(cx) ),
c_0_87 ).
cnf(c_0_92,negated_conjecture,
p(fy(X1)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_85])]),c_0_89]),c_0_90]) ).
cnf(c_0_93,negated_conjecture,
( ~ p(fy5(X2))
| ~ q(fz5(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_91,c_0_86]),c_0_84]),c_0_73]),c_0_39]) ).
cnf(c_0_94,negated_conjecture,
p(cx),
inference(spm,[status(thm)],[c_0_89,c_0_92]) ).
cnf(c_0_95,negated_conjecture,
~ p(fy5(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_85])]) ).
cnf(c_0_96,negated_conjecture,
p(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_94])]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN036-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 21 10:42:37 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 0.26/0.46 % Version: 3.5.1
% 0.26/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.46 % Starting sh5l with 300s (1) cores
% 0.26/0.46 % new_bool_3 with pid 2054781 completed with status 0
% 0.26/0.46 % Result found by new_bool_3
% 0.26/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.46 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.26/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.46 % SubtermCWHack with pid 2054788 completed with status 0
% 0.26/0.46 % Result found by SubtermCWHack
% 0.26/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.46 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.26/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.46 % Preprocessing time : 0.001 s
% 0.26/0.46
% 0.26/0.46 % Proof found!
% 0.26/0.46 % SZS status Unsatisfiable
% 0.26/0.46 % SZS output start CNFRefutation
% See solution above
% 0.26/0.46 % Parsed axioms : 32
% 0.26/0.46 % Removed by relevancy pruning/SinE : 0
% 0.26/0.46 % Initial clauses : 32
% 0.26/0.46 % Removed in clause preprocessing : 0
% 0.26/0.46 % Initial clauses in saturation : 32
% 0.26/0.46 % Processed clauses : 66
% 0.26/0.46 % ...of these trivial : 0
% 0.26/0.46 % ...subsumed : 10
% 0.26/0.46 % ...remaining for further processing : 56
% 0.26/0.46 % Other redundant clauses eliminated : 0
% 0.26/0.46 % Clauses deleted for lack of memory : 0
% 0.26/0.46 % Backward-subsumed : 37
% 0.26/0.46 % Backward-rewritten : 17
% 0.26/0.46 % Generated clauses : 143
% 0.26/0.46 % ...of the previous two non-redundant : 133
% 0.26/0.46 % ...aggressively subsumed : 0
% 0.26/0.46 % Contextual simplify-reflections : 49
% 0.26/0.46 % Paramodulations : 137
% 0.26/0.46 % Factorizations : 6
% 0.26/0.46 % NegExts : 0
% 0.26/0.46 % Equation resolutions : 0
% 0.26/0.46 % Disequality decompositions : 0
% 0.26/0.46 % Total rewrite steps : 16
% 0.26/0.46 % ...of those cached : 5
% 0.26/0.46 % Propositional unsat checks : 0
% 0.26/0.46 % Propositional check models : 0
% 0.26/0.46 % Propositional check unsatisfiable : 0
% 0.26/0.46 % Propositional clauses : 0
% 0.26/0.46 % Propositional clauses after purity: 0
% 0.26/0.46 % Propositional unsat core size : 0
% 0.26/0.46 % Propositional preprocessing time : 0.000
% 0.26/0.46 % Propositional encoding time : 0.000
% 0.26/0.46 % Propositional solver time : 0.000
% 0.26/0.46 % Success case prop preproc time : 0.000
% 0.26/0.46 % Success case prop encoding time : 0.000
% 0.26/0.46 % Success case prop solver time : 0.000
% 0.26/0.46 % Current number of processed clauses : 2
% 0.26/0.46 % Positive orientable unit clauses : 2
% 0.26/0.46 % Positive unorientable unit clauses: 0
% 0.26/0.46 % Negative unit clauses : 0
% 0.26/0.46 % Non-unit-clauses : 0
% 0.26/0.46 % Current number of unprocessed clauses: 0
% 0.26/0.46 % ...number of literals in the above : 0
% 0.26/0.46 % Current number of archived formulas : 0
% 0.26/0.46 % Current number of archived clauses : 54
% 0.26/0.46 % Clause-clause subsumption calls (NU) : 134
% 0.26/0.46 % Rec. Clause-clause subsumption calls : 111
% 0.26/0.46 % Non-unit clause-clause subsumptions : 92
% 0.26/0.46 % Unit Clause-clause subsumption calls : 4
% 0.26/0.46 % Rewrite failures with RHS unbound : 0
% 0.26/0.46 % BW rewrite match attempts : 11
% 0.26/0.46 % BW rewrite match successes : 11
% 0.26/0.46 % Condensation attempts : 0
% 0.26/0.46 % Condensation successes : 0
% 0.26/0.46 % Termbank termtop insertions : 3840
% 0.26/0.46 % Search garbage collected termcells : 98
% 0.26/0.46
% 0.26/0.46 % -------------------------------------------------
% 0.26/0.46 % User time : 0.008 s
% 0.26/0.46 % System time : 0.002 s
% 0.26/0.46 % Total time : 0.010 s
% 0.26/0.46 % Maximum resident set size: 3656 pages
% 0.26/0.46
% 0.26/0.46 % -------------------------------------------------
% 0.26/0.46 % User time : 0.010 s
% 0.26/0.46 % System time : 0.006 s
% 0.26/0.46 % Total time : 0.017 s
% 0.26/0.46 % Maximum resident set size: 4608 pages
% 0.26/0.46 % E exiting
%------------------------------------------------------------------------------