TSTP Solution File: SYN036-4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN036-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 20:28:44 EDT 2023
% Result : Timeout 0.28s 300.14s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 22
% Syntax : Number of clauses : 89 ( 7 unt; 55 nHn; 27 RR)
% Number of literals : 347 ( 0 equ; 160 neg)
% Maximal clause size : 6 ( 3 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 : 168 ( 109 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_16,negated_conjecture,
( p(cx)
| ~ p(X1)
| ~ q(cw)
| ~ q(X2)
| ~ q(fz5(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_16) ).
cnf(clause_3,negated_conjecture,
( p(cx)
| q(X2)
| ~ p(X1)
| ~ q(cw) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_3) ).
cnf(clause_4,negated_conjecture,
( p(cx)
| q(cw)
| ~ p(X1)
| ~ q(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( q(cw)
| ~ p(cx)
| ~ p(X1)
| ~ p(fy5(X1))
| ~ q(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_6) ).
cnf(clause_2,negated_conjecture,
( p(X2)
| q(cw)
| ~ p(cx)
| ~ q(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_2) ).
cnf(clause_7,negated_conjecture,
( p(X2)
| ~ p(cx)
| ~ q(cw)
| ~ q(X1)
| ~ q(fz5(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_7) ).
cnf(clause_1,negated_conjecture,
( p(X1)
| q(X2)
| ~ p(cx)
| ~ q(cw) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_1) ).
cnf(clause_5,negated_conjecture,
( q(X2)
| ~ p(cx)
| ~ p(X1)
| ~ p(fy5(X1))
| ~ q(cw) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_5) ).
cnf(clause_17,negated_conjecture,
( p(cx)
| q(X3)
| q(fz5(X3))
| ~ p(X1)
| ~ q(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_17) ).
cnf(clause_14,negated_conjecture,
( p(X3)
| p(fy5(X3))
| q(cw)
| ~ p(X1)
| ~ q(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_14) ).
cnf(clause_23,negated_conjecture,
( ~ p(cx)
| ~ p(X1)
| ~ p(fy5(X1))
| ~ q(cw)
| ~ q(X2)
| ~ q(fz5(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_23) ).
cnf(clause_20,negated_conjecture,
( p(cx)
| p(X2)
| p(fy(X2))
| q(cw)
| ~ q(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_20) ).
cnf(clause_32,negated_conjecture,
( p(cx)
| p(X1)
| p(fy5(X1))
| q(cw)
| q(X2)
| q(fz5(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_32) ).
cnf(clause_31,negated_conjecture,
( p(cx)
| p(X2)
| p(fy5(X2))
| q(cw)
| ~ q(X1)
| ~ q(fz5(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_31) ).
cnf(clause_15,negated_conjecture,
( p(cx)
| q(cw)
| q(X2)
| q(fz(X2))
| ~ p(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_15) ).
cnf(clause_10,negated_conjecture,
( p(X1)
| q(cw)
| q(X2)
| q(fz(X2))
| ~ p(cx) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_10) ).
cnf(clause_21,negated_conjecture,
( q(cw)
| ~ p(cx)
| ~ p(X1)
| ~ p(fy(X1))
| ~ q(X2)
| ~ q(fz(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_21) ).
cnf(clause_22,negated_conjecture,
( q(cw)
| q(X2)
| q(fz(X2))
| ~ p(cx)
| ~ p(X1)
| ~ p(fy(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_22) ).
cnf(clause_19,negated_conjecture,
( p(cx)
| p(X1)
| p(fy(X1))
| q(X2)
| ~ q(cw) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_19) ).
cnf(clause_30,negated_conjecture,
( p(cx)
| p(X2)
| p(fy(X2))
| ~ q(cw)
| ~ q(X1)
| ~ q(fz(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_30) ).
cnf(clause_11,negated_conjecture,
( p(X2)
| q(X3)
| ~ p(X1)
| ~ p(fy(X1))
| ~ q(cw) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_11) ).
cnf(clause_24,negated_conjecture,
( p(cx)
| ~ p(X1)
| ~ p(fy(X1))
| ~ q(cw)
| ~ q(X2)
| ~ q(fz(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p',clause_24) ).
cnf(c_0_22,negated_conjecture,
( p(cx)
| ~ p(X1)
| ~ q(cw)
| ~ q(X2)
| ~ q(fz5(X2)) ),
clause_16 ).
cnf(c_0_23,negated_conjecture,
( p(cx)
| q(X2)
| ~ p(X1)
| ~ q(cw) ),
clause_3 ).
cnf(c_0_24,negated_conjecture,
( p(cx)
| q(cw)
| ~ p(X1)
| ~ q(X2) ),
clause_4 ).
cnf(c_0_25,negated_conjecture,
( q(cw)
| ~ p(cx)
| ~ p(X1)
| ~ p(fy5(X1))
| ~ q(X2) ),
clause_6 ).
cnf(c_0_26,negated_conjecture,
( p(X2)
| q(cw)
| ~ p(cx)
| ~ q(X1) ),
clause_2 ).
cnf(c_0_27,negated_conjecture,
( p(X2)
| ~ p(cx)
| ~ q(cw)
| ~ q(X1)
| ~ q(fz5(X1)) ),
clause_7 ).
cnf(c_0_28,negated_conjecture,
( p(X1)
| q(X2)
| ~ p(cx)
| ~ q(cw) ),
clause_1 ).
cnf(c_0_29,negated_conjecture,
( q(X2)
| ~ p(cx)
| ~ p(X1)
| ~ p(fy5(X1))
| ~ q(cw) ),
clause_5 ).
cnf(c_0_30,negated_conjecture,
( p(cx)
| q(X3)
| q(fz5(X3))
| ~ p(X1)
| ~ q(X2) ),
clause_17 ).
cnf(c_0_31,negated_conjecture,
( p(cx)
| ~ q(fz5(X1))
| ~ p(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( p(X3)
| p(fy5(X3))
| q(cw)
| ~ p(X1)
| ~ q(X2) ),
clause_14 ).
cnf(c_0_33,negated_conjecture,
( q(cw)
| ~ q(X1)
| ~ p(fy5(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ p(cx)
| ~ p(X1)
| ~ p(fy5(X1))
| ~ q(cw)
| ~ q(X2)
| ~ q(fz5(X2)) ),
clause_23 ).
cnf(c_0_35,negated_conjecture,
( p(X1)
| ~ q(fz5(X2))
| ~ p(cx) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_27,c_0_28]),c_0_26]) ).
cnf(c_0_36,negated_conjecture,
( q(X1)
| ~ q(cw)
| ~ p(fy5(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_29,c_0_28]),c_0_23]) ).
cnf(c_0_37,negated_conjecture,
( p(cx)
| p(X2)
| p(fy(X2))
| q(cw)
| ~ q(X1) ),
clause_20 ).
cnf(c_0_38,negated_conjecture,
( p(cx)
| p(X1)
| p(fy5(X1))
| q(cw)
| q(X2)
| q(fz5(X2)) ),
clause_32 ).
cnf(c_0_39,negated_conjecture,
( q(X1)
| p(cx)
| ~ q(X2)
| ~ p(X3) ),
inference(csr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( p(cx)
| p(X2)
| p(fy5(X2))
| q(cw)
| ~ q(X1)
| ~ q(fz5(X1)) ),
clause_31 ).
cnf(c_0_41,negated_conjecture,
( q(cw)
| p(X1)
| ~ q(X2)
| ~ p(X3) ),
inference(csr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
( ~ q(fz5(X1))
| ~ p(fy5(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_34,c_0_35]),c_0_31]),c_0_36]),c_0_33]) ).
cnf(c_0_43,negated_conjecture,
( q(cw)
| p(fy(X1))
| ~ q(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_37,c_0_24]),c_0_26]) ).
cnf(c_0_44,negated_conjecture,
( q(cw)
| p(fy5(X1))
| p(cx)
| p(X1)
| ~ p(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_38]),c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( q(cw)
| ~ q(fz5(X1))
| ~ q(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_40,c_0_31]),c_0_41]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( q(cw)
| q(X1)
| p(fy5(X2))
| p(cx)
| p(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_38]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( p(cx)
| q(cw)
| q(X2)
| q(fz(X2))
| ~ p(X1) ),
clause_15 ).
cnf(c_0_48,negated_conjecture,
( q(cw)
| p(fy5(X1))
| p(cx)
| p(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( p(X1)
| q(cw)
| q(X2)
| q(fz(X2))
| ~ p(cx) ),
clause_10 ).
cnf(c_0_50,negated_conjecture,
( q(fz(X1))
| p(cx)
| ~ p(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_47,c_0_24]),c_0_23]) ).
cnf(c_0_51,negated_conjecture,
( q(cw)
| p(cx)
| ~ q(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_48]),c_0_39]) ).
cnf(c_0_52,negated_conjecture,
( q(cw)
| ~ p(cx)
| ~ p(X1)
| ~ p(fy(X1))
| ~ q(X2)
| ~ q(fz(X2)) ),
clause_21 ).
cnf(c_0_53,negated_conjecture,
( q(fz(X1))
| p(X2)
| ~ p(cx) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_49,c_0_26]),c_0_28]) ).
cnf(c_0_54,negated_conjecture,
( q(cw)
| p(cx) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_50]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( q(cw)
| ~ q(fz(X1))
| ~ q(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_52,c_0_26]),c_0_24]),c_0_43]) ).
cnf(c_0_56,negated_conjecture,
( q(fz(X1))
| q(cw)
| p(X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( q(cw)
| p(X1)
| ~ q(X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
( q(cw)
| p(X1)
| p(X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
( q(cw)
| q(X2)
| q(fz(X2))
| ~ p(cx)
| ~ p(X1)
| ~ p(fy(X1)) ),
clause_22 ).
cnf(c_0_60,negated_conjecture,
( q(cw)
| p(X1) ),
inference(ef,[status(thm)],[c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( p(cx)
| p(X1)
| p(fy(X1))
| q(X2)
| ~ q(cw) ),
clause_19 ).
cnf(c_0_62,negated_conjecture,
( q(fz(X1))
| q(cw)
| q(X1)
| ~ p(fy(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_59,c_0_53]),c_0_50]) ).
cnf(c_0_63,negated_conjecture,
( q(cw)
| ~ q(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( q(X1)
| p(fy(X2))
| ~ q(cw) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_61,c_0_23]),c_0_28]) ).
cnf(c_0_65,negated_conjecture,
q(cw),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_60]),c_0_63]),c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( p(cx)
| p(X2)
| p(fy(X2))
| ~ q(cw)
| ~ q(X1)
| ~ q(fz(X1)) ),
clause_30 ).
cnf(c_0_67,negated_conjecture,
( q(X1)
| p(fy(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_68,negated_conjecture,
( p(X2)
| q(X3)
| ~ p(X1)
| ~ p(fy(X1))
| ~ q(cw) ),
clause_11 ).
cnf(c_0_69,negated_conjecture,
( p(fy(X1))
| p(cx)
| p(X1)
| ~ q(fz(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_66,c_0_64]),c_0_43]) ).
cnf(c_0_70,negated_conjecture,
( p(fy(X1))
| p(cx)
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( p(fy(X1))
| p(X2)
| ~ p(cx) ),
inference(spm,[status(thm)],[c_0_35,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( p(cx)
| ~ p(X1)
| ~ p(fy(X1))
| ~ q(cw)
| ~ q(X2)
| ~ q(fz(X2)) ),
clause_24 ).
cnf(c_0_73,negated_conjecture,
( q(X1)
| p(X2)
| ~ q(cw)
| ~ p(X3) ),
inference(csr,[status(thm)],[c_0_68,c_0_64]) ).
cnf(c_0_74,negated_conjecture,
( p(fy(X1))
| p(fy(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_67]),c_0_70]),c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( p(cx)
| ~ q(fz(X1))
| ~ p(fy(X2))
| ~ p(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_72,c_0_23]),c_0_24]) ).
cnf(c_0_76,negated_conjecture,
( q(X1)
| p(X2)
| ~ p(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_65])]) ).
cnf(c_0_77,negated_conjecture,
p(fy(X1)),
inference(ef,[status(thm)],[c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( p(cx)
| ~ p(fy(X1))
| ~ p(X1) ),
inference(csr,[status(thm)],[c_0_75,c_0_50]) ).
cnf(c_0_79,negated_conjecture,
( q(X1)
| ~ p(fy5(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_65])]) ).
cnf(c_0_80,negated_conjecture,
( q(X1)
| p(X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,negated_conjecture,
( p(cx)
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_77])]) ).
cnf(c_0_82,negated_conjecture,
( q(X1)
| q(X2) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,negated_conjecture,
p(cx),
inference(spm,[status(thm)],[c_0_81,c_0_77]) ).
cnf(c_0_84,negated_conjecture,
q(X1),
inference(ef,[status(thm)],[c_0_82]) ).
cnf(c_0_85,negated_conjecture,
( p(X1)
| ~ q(fz5(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_83])]) ).
cnf(c_0_86,negated_conjecture,
~ p(fy5(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_84])]) ).
cnf(c_0_87,negated_conjecture,
p(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_84])]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SYN036-4 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 18:37:34 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.39 Running first-order model finding
% 0.15/0.39 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.4mgLFdKG2T/E---3.1_29654.p
% 0.28/300.14 # Version: 3.1pre001
% 0.28/300.14 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/300.14 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.14 # Starting new_bool_1 with 300s (1) cores
% 0.28/300.14 # Starting sh5l with 300s (1) cores
% 0.28/300.14 # new_bool_3 with pid 29732 completed with status 0
% 0.28/300.14 # Result found by new_bool_3
% 0.28/300.14 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/300.14 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.14 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.28/300.14 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.14 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.28/300.14 # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 29736 completed with status 0
% 0.28/300.14 # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 0.28/300.14 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/300.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.14 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/300.14 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.14 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.28/300.14 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.14 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.28/300.14 # Preprocessing time : 0.001 s
% 0.28/300.14 # Presaturation interreduction done
% 0.28/300.14
% 0.28/300.14 # Proof found!
% 0.28/300.14 # SZS status Unsatisfiable
% 0.28/300.14 # SZS output start CNFRefutation
% See solution above
% 0.28/300.14 # Parsed axioms : 32
% 0.28/300.14 # Removed by relevancy pruning/SinE : 0
% 0.28/300.14 # Initial clauses : 32
% 0.28/300.14 # Removed in clause preprocessing : 0
% 0.28/300.14 # Initial clauses in saturation : 32
% 0.28/300.14 # Processed clauses : 100
% 0.28/300.14 # ...of these trivial : 0
% 0.28/300.14 # ...subsumed : 15
% 0.28/300.14 # ...remaining for further processing : 85
% 0.28/300.14 # Other redundant clauses eliminated : 0
% 0.28/300.14 # Clauses deleted for lack of memory : 0
% 0.28/300.14 # Backward-subsumed : 39
% 0.28/300.14 # Backward-rewritten : 20
% 0.28/300.14 # Generated clauses : 125
% 0.28/300.14 # ...of the previous two non-redundant : 111
% 0.28/300.14 # ...aggressively subsumed : 0
% 0.28/300.14 # Contextual simplify-reflections : 52
% 0.28/300.14 # Paramodulations : 119
% 0.28/300.14 # Factorizations : 6
% 0.28/300.14 # NegExts : 0
% 0.28/300.14 # Equation resolutions : 0
% 0.28/300.14 # Total rewrite steps : 19
% 0.28/300.14 # Propositional unsat checks : 0
% 0.28/300.14 # Propositional check models : 0
% 0.28/300.14 # Propositional check unsatisfiable : 0
% 0.28/300.14 # Propositional clauses : 0
% 0.28/300.14 # Propositional clauses after purity: 0
% 0.28/300.14 # Propositional unsat core size : 0
% 0.28/300.14 # Propositional preprocessing time : 0.000
% 0.28/300.14 # Propositional encoding time : 0.000
% 0.28/300.14 # Propositional solver time : 0.000
% 0.28/300.14 # Success case prop preproc time : 0.000
% 0.28/300.14 # Success case prop encoding time : 0.000
% 0.28/300.14 # Success case prop solver time : 0.000
% 0.28/300.14 # Current number of processed clauses : 2
% 0.28/300.14 # Positive orientable unit clauses : 2
% 0.28/300.14 # Positive unorientable unit clauses: 0
% 0.28/300.14 # Negative unit clauses : 0
% 0.28/300.14 # Non-unit-clauses : 0
% 0.28/300.14 # Current number of unprocessed clauses: 25
% 0.28/300.14 # ...number of literals in the above : 103
% 0.28/300.14 # Current number of archived formulas : 0
% 0.28/300.14 # Current number of archived clauses : 83
% 0.28/300.14 # Clause-clause subsumption calls (NU) : 184
% 0.28/300.14 # Rec. Clause-clause subsumption calls : 145
% 0.28/300.14 # Non-unit clause-clause subsumptions : 101
% 0.28/300.14 # Unit Clause-clause subsumption calls : 5
% 0.28/300.14 # Rewrite failures with RHS unbound : 0
% 0.28/300.14 # BW rewrite match attempts : 12
% 0.28/300.14 # BW rewrite match successes : 12
% 0.28/300.14 # Condensation attempts : 0
% 0.28/300.14 # Condensation successes : 0
% 0.28/300.14 # Termbank termtop insertions : 3317
% 0.28/300.14
% 0.28/300.14 # -------------------------------------------------
% 0.28/300.14 # User time : 0.006 s
% 0.28/300.14 # System time : 0.000 s
% 0.28/300.14 # Total time : 0.006 s
% 0.28/300.14 # Maximum resident set size: 1776 pages
% 0.28/300.14
% 0.28/300.14 # -------------------------------------------------
% 0.28/300.14 # User time : 0.009 s
% 0.28/300.14 # System time : 0.001 s
% 0.28/300.14 # Total time : 0.009 s
% 0.28/300.14 # Maximum resident set size: 1696 pages
% 0.28/300.14 % E---3.1 exiting
%------------------------------------------------------------------------------