TSTP Solution File: LCL688+1.001 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL688+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 18:33:40 EDT 2023
% Result : Theorem 16.21s 2.57s
% Output : CNFRefutation 16.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 42 ( 17 unt; 0 def)
% Number of atoms : 283 ( 0 equ)
% Maximal formula atoms : 110 ( 6 avg)
% Number of connectives : 477 ( 236 ~; 203 |; 37 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 47 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 114 ( 0 sgn; 77 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p4(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p3(X1) )
| ~ p2(X2) ) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p3(X1) )
| ~ p2(X2) ) )
& p2(X1)
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2) ) ) ) ) ) ) )
| ( ~ p1(X1)
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
& p1(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tH353D93gL/E---3.1_8747.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.tH353D93gL/E---3.1_8747.p',reflexivity) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( r1(X1,X2)
& r1(X2,X3) )
=> r1(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.tH353D93gL/E---3.1_8747.p',transitivity) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p4(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p3(X1) )
| ~ p2(X2) ) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p3(X1) )
| ~ p2(X2) ) )
& p2(X1)
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2) ) ) ) ) ) ) )
| ( ~ p1(X1)
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
& p1(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) ) ) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(c_0_4,negated_conjecture,
! [X5,X6,X7,X10,X11,X13,X15,X16,X19,X20,X23,X26,X28,X29,X30] :
( ( ~ r1(esk1_0,X5)
| ~ p4(X5) )
& ( r1(X7,esk2_2(X6,X7))
| ~ r1(X6,X7)
| ~ r1(esk1_0,X6) )
& ( r1(esk2_2(X6,X7),esk3_2(X6,X7))
| ~ r1(X6,X7)
| ~ r1(esk1_0,X6) )
& ( ~ p3(esk3_2(X6,X7))
| ~ r1(X6,X7)
| ~ r1(esk1_0,X6) )
& ( p2(esk2_2(X6,X7))
| ~ r1(X6,X7)
| ~ r1(esk1_0,X6) )
& ( r1(X13,esk5_3(X6,X10,X13))
| ~ r1(X10,X13)
| r1(X11,esk4_3(X6,X10,X11))
| ~ r1(X10,X11)
| ~ p2(X10)
| ~ r1(X6,X10)
| ~ r1(esk1_0,X6) )
& ( ~ r1(esk5_3(X6,X10,X13),X15)
| ~ p2(X15)
| ~ r1(X10,X13)
| r1(X11,esk4_3(X6,X10,X11))
| ~ r1(X10,X11)
| ~ p2(X10)
| ~ r1(X6,X10)
| ~ r1(esk1_0,X6) )
& ( r1(X13,esk5_3(X6,X10,X13))
| ~ r1(X10,X13)
| ~ p3(esk4_3(X6,X10,X11))
| ~ r1(X10,X11)
| ~ p2(X10)
| ~ r1(X6,X10)
| ~ r1(esk1_0,X6) )
& ( ~ r1(esk5_3(X6,X10,X13),X15)
| ~ p2(X15)
| ~ r1(X10,X13)
| ~ p3(esk4_3(X6,X10,X11))
| ~ r1(X10,X11)
| ~ p2(X10)
| ~ r1(X6,X10)
| ~ r1(esk1_0,X6) )
& ( r1(X13,esk5_3(X6,X10,X13))
| ~ r1(X10,X13)
| p2(X11)
| ~ r1(X10,X11)
| ~ p2(X10)
| ~ r1(X6,X10)
| ~ r1(esk1_0,X6) )
& ( ~ r1(esk5_3(X6,X10,X13),X15)
| ~ p2(X15)
| ~ r1(X10,X13)
| p2(X11)
| ~ r1(X10,X11)
| ~ p2(X10)
| ~ r1(X6,X10)
| ~ r1(esk1_0,X6) )
& ( r1(esk1_0,esk7_0)
| r1(X16,esk6_1(X16))
| ~ r1(esk1_0,X16)
| p1(esk1_0) )
& ( ~ p1(esk7_0)
| r1(X16,esk6_1(X16))
| ~ r1(esk1_0,X16)
| p1(esk1_0) )
& ( ~ r1(esk7_0,X19)
| ~ r1(X19,X20)
| p1(X20)
| ~ p1(X19)
| r1(X16,esk6_1(X16))
| ~ r1(esk1_0,X16)
| p1(esk1_0) )
& ( r1(esk1_0,esk7_0)
| ~ p1(esk6_1(X16))
| ~ r1(esk1_0,X16)
| p1(esk1_0) )
& ( ~ p1(esk7_0)
| ~ p1(esk6_1(X16))
| ~ r1(esk1_0,X16)
| p1(esk1_0) )
& ( ~ r1(esk7_0,X19)
| ~ r1(X19,X20)
| p1(X20)
| ~ p1(X19)
| ~ p1(esk6_1(X16))
| ~ r1(esk1_0,X16)
| p1(esk1_0) )
& r1(esk1_0,esk8_0)
& r1(esk8_0,esk9_0)
& ( ~ r1(esk9_0,X23)
| p1(X23) )
& r1(esk8_0,esk10_0)
& ~ p1(esk10_0)
& r1(esk1_0,esk11_0)
& ( r1(X26,esk12_1(X26))
| ~ r1(esk11_0,X26) )
& ( ~ p2(esk12_1(X26))
| ~ r1(esk11_0,X26) )
& ( r1(X28,esk13_1(X28))
| ~ r1(esk1_0,X28)
| ~ r1(X28,X29)
| ~ r1(X29,X30)
| ~ p1(X30) )
& ( p1(esk13_1(X28))
| ~ r1(esk1_0,X28)
| ~ r1(X28,X29)
| ~ r1(X29,X30)
| ~ p1(X30) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_5,negated_conjecture,
( r1(esk2_2(X1,X2),esk3_2(X1,X2))
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
r1(esk1_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X32] : r1(X32,X32),
inference(variable_rename,[status(thm)],[reflexivity]) ).
fof(c_0_8,plain,
! [X33,X34,X35] :
( ~ r1(X33,X34)
| ~ r1(X34,X35)
| r1(X33,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])]) ).
cnf(c_0_9,negated_conjecture,
( r1(esk2_2(esk11_0,X1),esk3_2(esk11_0,X1))
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( r1(X1,esk2_2(X2,X1))
| ~ r1(X2,X1)
| ~ r1(esk1_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( r1(X1,X3)
| ~ r1(X1,X2)
| ~ r1(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
r1(esk2_2(esk11_0,esk11_0),esk3_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( r1(X1,esk2_2(esk11_0,X1))
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( r1(X1,esk3_2(esk11_0,esk11_0))
| ~ r1(X1,esk2_2(esk11_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
r1(esk11_0,esk2_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( p2(esk2_2(X1,X2))
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( r1(X1,esk12_1(X1))
| ~ r1(esk11_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
r1(esk11_0,esk3_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( r1(X1,esk5_3(X2,X3,X1))
| p2(X4)
| ~ r1(X3,X1)
| ~ r1(X3,X4)
| ~ p2(X3)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
( r1(X1,esk2_2(esk11_0,esk11_0))
| ~ r1(X1,esk11_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( p2(esk2_2(esk11_0,X1))
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_6]) ).
cnf(c_0_23,negated_conjecture,
r1(esk3_2(esk11_0,esk11_0),esk12_1(esk3_2(esk11_0,esk11_0))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( p2(X1)
| r1(X2,esk5_3(esk1_0,X3,X2))
| ~ p2(X3)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X1)
| ~ r1(X3,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_25,negated_conjecture,
r1(esk1_0,esk2_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_21,c_0_6]) ).
cnf(c_0_26,negated_conjecture,
p2(esk2_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_27,negated_conjecture,
( r1(X1,esk12_1(esk3_2(esk11_0,esk11_0)))
| ~ r1(X1,esk3_2(esk11_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( p2(X1)
| r1(X2,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),X2))
| ~ r1(esk2_2(esk11_0,esk11_0),X1)
| ~ r1(esk2_2(esk11_0,esk11_0),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
r1(esk2_2(esk11_0,esk11_0),esk12_1(esk3_2(esk11_0,esk11_0))),
inference(spm,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_30,negated_conjecture,
( p2(esk12_1(esk3_2(esk11_0,esk11_0)))
| r1(X1,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),X1))
| ~ r1(esk2_2(esk11_0,esk11_0),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( ~ p2(esk12_1(X1))
| ~ r1(esk11_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_32,negated_conjecture,
( p2(esk12_1(esk3_2(esk11_0,esk11_0)))
| r1(esk2_2(esk11_0,esk11_0),esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0))) ),
inference(spm,[status(thm)],[c_0_30,c_0_10]) ).
cnf(c_0_33,negated_conjecture,
r1(esk2_2(esk11_0,esk11_0),esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_19])]) ).
cnf(c_0_34,negated_conjecture,
( r1(X1,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0)))
| ~ r1(X1,esk2_2(esk11_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
r1(esk11_0,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0))),
inference(spm,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_36,negated_conjecture,
( p2(X5)
| ~ r1(esk5_3(X1,X2,X3),X4)
| ~ p2(X4)
| ~ r1(X2,X3)
| ~ r1(X2,X5)
| ~ p2(X2)
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_37,negated_conjecture,
r1(esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0)),esk2_2(esk11_0,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0)))),
inference(spm,[status(thm)],[c_0_14,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
p2(esk2_2(esk11_0,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0)))),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( p2(X1)
| ~ r1(esk2_2(esk11_0,esk11_0),X1) ),
inference(cn,[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_36,c_0_37]),c_0_38]),c_0_26]),c_0_10]),c_0_10]),c_0_25])]) ).
cnf(c_0_40,negated_conjecture,
p2(esk12_1(esk3_2(esk11_0,esk11_0))),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_40]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL688+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 12:34:36 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.tH353D93gL/E---3.1_8747.p
% 16.21/2.57 # Version: 3.1pre001
% 16.21/2.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 16.21/2.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.21/2.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.21/2.57 # Starting new_bool_3 with 300s (1) cores
% 16.21/2.57 # Starting new_bool_1 with 300s (1) cores
% 16.21/2.57 # Starting sh5l with 300s (1) cores
% 16.21/2.57 # new_bool_1 with pid 8826 completed with status 0
% 16.21/2.57 # Result found by new_bool_1
% 16.21/2.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 16.21/2.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.21/2.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.21/2.57 # Starting new_bool_3 with 300s (1) cores
% 16.21/2.57 # Starting new_bool_1 with 300s (1) cores
% 16.21/2.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 16.21/2.57 # Search class: FGHNF-FFMS31-SFFFFFNN
% 16.21/2.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 16.21/2.57 # Starting G-E--_107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with 181s (1) cores
% 16.21/2.57 # G-E--_107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with pid 8833 completed with status 0
% 16.21/2.57 # Result found by G-E--_107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A
% 16.21/2.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 16.21/2.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.21/2.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.21/2.57 # Starting new_bool_3 with 300s (1) cores
% 16.21/2.57 # Starting new_bool_1 with 300s (1) cores
% 16.21/2.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 16.21/2.57 # Search class: FGHNF-FFMS31-SFFFFFNN
% 16.21/2.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 16.21/2.57 # Starting G-E--_107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with 181s (1) cores
% 16.21/2.57 # Preprocessing time : 0.001 s
% 16.21/2.57 # Presaturation interreduction done
% 16.21/2.57
% 16.21/2.57 # Proof found!
% 16.21/2.57 # SZS status Theorem
% 16.21/2.57 # SZS output start CNFRefutation
% See solution above
% 16.21/2.57 # Parsed axioms : 3
% 16.21/2.57 # Removed by relevancy pruning/SinE : 0
% 16.21/2.57 # Initial clauses : 29
% 16.21/2.57 # Removed in clause preprocessing : 0
% 16.21/2.57 # Initial clauses in saturation : 29
% 16.21/2.57 # Processed clauses : 12452
% 16.21/2.57 # ...of these trivial : 28
% 16.21/2.57 # ...subsumed : 1716
% 16.21/2.57 # ...remaining for further processing : 10708
% 16.21/2.57 # Other redundant clauses eliminated : 0
% 16.21/2.57 # Clauses deleted for lack of memory : 0
% 16.21/2.57 # Backward-subsumed : 9
% 16.21/2.57 # Backward-rewritten : 131
% 16.21/2.57 # Generated clauses : 31949
% 16.21/2.57 # ...of the previous two non-redundant : 27338
% 16.21/2.57 # ...aggressively subsumed : 0
% 16.21/2.57 # Contextual simplify-reflections : 2
% 16.21/2.57 # Paramodulations : 31949
% 16.21/2.57 # Factorizations : 0
% 16.21/2.57 # NegExts : 0
% 16.21/2.57 # Equation resolutions : 0
% 16.21/2.57 # Total rewrite steps : 7301
% 16.21/2.57 # Propositional unsat checks : 0
% 16.21/2.57 # Propositional check models : 0
% 16.21/2.57 # Propositional check unsatisfiable : 0
% 16.21/2.57 # Propositional clauses : 0
% 16.21/2.57 # Propositional clauses after purity: 0
% 16.21/2.57 # Propositional unsat core size : 0
% 16.21/2.57 # Propositional preprocessing time : 0.000
% 16.21/2.57 # Propositional encoding time : 0.000
% 16.21/2.57 # Propositional solver time : 0.000
% 16.21/2.57 # Success case prop preproc time : 0.000
% 16.21/2.57 # Success case prop encoding time : 0.000
% 16.21/2.57 # Success case prop solver time : 0.000
% 16.21/2.57 # Current number of processed clauses : 10539
% 16.21/2.57 # Positive orientable unit clauses : 4176
% 16.21/2.57 # Positive unorientable unit clauses: 0
% 16.21/2.57 # Negative unit clauses : 363
% 16.21/2.57 # Non-unit-clauses : 6000
% 16.21/2.57 # Current number of unprocessed clauses: 14430
% 16.21/2.57 # ...number of literals in the above : 41806
% 16.21/2.57 # Current number of archived formulas : 0
% 16.21/2.57 # Current number of archived clauses : 169
% 16.21/2.57 # Clause-clause subsumption calls (NU) : 5040607
% 16.21/2.57 # Rec. Clause-clause subsumption calls : 2900264
% 16.21/2.57 # Non-unit clause-clause subsumptions : 1725
% 16.21/2.57 # Unit Clause-clause subsumption calls : 744764
% 16.21/2.57 # Rewrite failures with RHS unbound : 0
% 16.21/2.57 # BW rewrite match attempts : 116241
% 16.21/2.57 # BW rewrite match successes : 49
% 16.21/2.57 # Condensation attempts : 0
% 16.21/2.57 # Condensation successes : 0
% 16.21/2.57 # Termbank termtop insertions : 779886
% 16.21/2.57
% 16.21/2.57 # -------------------------------------------------
% 16.21/2.57 # User time : 2.024 s
% 16.21/2.57 # System time : 0.027 s
% 16.21/2.57 # Total time : 2.051 s
% 16.21/2.57 # Maximum resident set size: 1860 pages
% 16.21/2.57
% 16.21/2.57 # -------------------------------------------------
% 16.21/2.57 # User time : 2.025 s
% 16.21/2.57 # System time : 0.029 s
% 16.21/2.57 # Total time : 2.054 s
% 16.21/2.57 # Maximum resident set size: 1684 pages
% 16.21/2.57 % E---3.1 exiting
%------------------------------------------------------------------------------