TSTP Solution File: SWC160+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC160+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 19:39:38 EDT 2023
% Result : Theorem 0.22s 0.58s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 22 unt; 0 def)
% Number of atoms : 253 ( 51 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 300 ( 101 ~; 106 |; 45 &)
% ( 1 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 12 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn; 66 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ leq(X11,X10)
| ( ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X13,X15)
| ( leq(X10,X15)
& leq(X15,X11) ) ) )
& leq(X10,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',ax26) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',ax33) ).
fof(ax92,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( leq(X1,X2)
=> ( X1 = X2
| lt(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',ax92) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Z22CuuiYLK/E---3.1_982.p',ax12) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ leq(X11,X10)
| ( ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X13,X15)
| ( leq(X10,X15)
& leq(X15,X11) ) ) )
& leq(X10,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,negated_conjecture,
! [X21,X22,X23,X24] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X21)
| ~ ssList(X22)
| app(cons(X21,nil),X22) != esk5_0
| ~ ssItem(X23)
| ~ ssList(X24)
| app(X24,cons(X23,nil)) != esk3_0
| ~ lt(X23,X21) )
& ssItem(esk6_0)
& ssItem(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& app(app(app(app(esk8_0,cons(esk6_0,nil)),esk9_0),cons(esk7_0,nil)),esk10_0) = esk1_0
& leq(esk7_0,esk6_0)
& ( ssItem(esk11_0)
| ~ leq(esk6_0,esk7_0) )
& ( memberP(esk9_0,esk11_0)
| ~ leq(esk6_0,esk7_0) )
& ( ~ leq(esk6_0,esk11_0)
| ~ leq(esk11_0,esk7_0)
| ~ leq(esk6_0,esk7_0) )
& ( nil = esk4_0
| nil != esk3_0 ) ),
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_9])])])])]) ).
cnf(c_0_11,negated_conjecture,
app(app(app(app(esk8_0,cons(esk6_0,nil)),esk9_0),cons(esk7_0,nil)),esk10_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X156,X157,X158] :
( ~ ssList(X156)
| ~ ssList(X157)
| ~ ssList(X158)
| app(app(X156,X157),X158) = app(X156,app(X157,X158)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(app(esk8_0,cons(esk6_0,nil)),esk9_0),cons(esk7_0,nil)),esk10_0) = esk3_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X107,X108] :
( ~ ssList(X107)
| ~ ssItem(X108)
| ssList(cons(X108,X107)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_19,negated_conjecture,
( app(app(app(esk8_0,app(cons(esk6_0,nil),esk9_0)),cons(esk7_0,nil)),esk10_0) = esk3_0
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X37,X38] :
( ~ ssList(X37)
| ~ ssItem(X38)
| cons(X38,X37) = app(cons(X38,nil),X37) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_24,negated_conjecture,
app(app(app(esk8_0,app(cons(esk6_0,nil),esk9_0)),cons(esk7_0,nil)),esk10_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
app(app(app(esk8_0,cons(esk6_0,esk9_0)),cons(esk7_0,nil)),esk10_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
( app(app(esk8_0,cons(esk6_0,esk9_0)),app(cons(esk7_0,nil),esk10_0)) = esk3_0
| ~ ssList(app(esk8_0,cons(esk6_0,esk9_0)))
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
! [X138,X139] :
( ~ ssList(X138)
| ~ ssList(X139)
| ssList(app(X138,X139)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_31,negated_conjecture,
( app(app(esk8_0,cons(esk6_0,esk9_0)),app(cons(esk7_0,nil),esk10_0)) = esk3_0
| ~ ssList(app(esk8_0,cons(esk6_0,esk9_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21]),c_0_29])]) ).
cnf(c_0_32,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_33,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_34,plain,
! [X88,X89] :
( ~ ssItem(X88)
| ~ ssItem(X89)
| ~ leq(X88,X89)
| X88 = X89
| lt(X88,X89) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax92])])]) ).
fof(c_0_35,plain,
! [X180,X181,X182,X183,X184,X185] :
( ( ~ strictorderedP(X180)
| ~ ssItem(X181)
| ~ ssItem(X182)
| ~ ssList(X183)
| ~ ssList(X184)
| ~ ssList(X185)
| app(app(X183,cons(X181,X184)),cons(X182,X185)) != X180
| lt(X181,X182)
| ~ ssList(X180) )
& ( ssItem(esk42_1(X180))
| strictorderedP(X180)
| ~ ssList(X180) )
& ( ssItem(esk43_1(X180))
| strictorderedP(X180)
| ~ ssList(X180) )
& ( ssList(esk44_1(X180))
| strictorderedP(X180)
| ~ ssList(X180) )
& ( ssList(esk45_1(X180))
| strictorderedP(X180)
| ~ ssList(X180) )
& ( ssList(esk46_1(X180))
| strictorderedP(X180)
| ~ ssList(X180) )
& ( app(app(esk44_1(X180),cons(esk42_1(X180),esk45_1(X180))),cons(esk43_1(X180),esk46_1(X180))) = X180
| strictorderedP(X180)
| ~ ssList(X180) )
& ( ~ lt(esk42_1(X180),esk43_1(X180))
| strictorderedP(X180)
| ~ ssList(X180) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])]) ).
cnf(c_0_36,negated_conjecture,
( app(app(esk8_0,cons(esk6_0,esk9_0)),app(cons(esk7_0,nil),esk10_0)) = esk3_0
| ~ ssList(cons(esk6_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]) ).
fof(c_0_37,plain,
! [X118,X119] :
( ~ ssItem(X118)
| ~ ssItem(X119)
| ~ lt(X118,X119)
| ~ lt(X119,X118) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).
cnf(c_0_38,plain,
( X1 = X2
| lt(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
leq(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,plain,
( lt(X2,X3)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
app(app(esk8_0,cons(esk6_0,esk9_0)),app(cons(esk7_0,nil),esk10_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_20]),c_0_16]),c_0_22])]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( esk7_0 = esk6_0
| lt(esk7_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_22]),c_0_29])]) ).
cnf(c_0_45,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
app(app(esk8_0,cons(esk6_0,esk9_0)),cons(esk7_0,esk10_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_27]),c_0_29])]) ).
cnf(c_0_47,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_42,c_0_12]) ).
cnf(c_0_49,negated_conjecture,
( esk7_0 = esk6_0
| ~ lt(esk6_0,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_29]),c_0_22])]) ).
cnf(c_0_50,negated_conjecture,
lt(esk6_0,esk7_0),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_27]),c_0_16]),c_0_17]),c_0_29]),c_0_22])]) ).
cnf(c_0_51,negated_conjecture,
esk7_0 = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_52,negated_conjecture,
lt(esk6_0,esk6_0),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_52]),c_0_52]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC160+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 02:00:35 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.Z22CuuiYLK/E---3.1_982.p
% 0.22/0.58 # Version: 3.1pre001
% 0.22/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.58 # Starting sh5l with 300s (1) cores
% 0.22/0.58 # sh5l with pid 1083 completed with status 0
% 0.22/0.58 # Result found by sh5l
% 0.22/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.58 # Starting sh5l with 300s (1) cores
% 0.22/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.58 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/0.58 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.22/0.58 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 1089 completed with status 0
% 0.22/0.58 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.22/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.58 # Starting sh5l with 300s (1) cores
% 0.22/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.58 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/0.58 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.22/0.58 # Preprocessing time : 0.004 s
% 0.22/0.58 # Presaturation interreduction done
% 0.22/0.58
% 0.22/0.58 # Proof found!
% 0.22/0.58 # SZS status Theorem
% 0.22/0.58 # SZS output start CNFRefutation
% See solution above
% 0.22/0.58 # Parsed axioms : 96
% 0.22/0.58 # Removed by relevancy pruning/SinE : 10
% 0.22/0.58 # Initial clauses : 184
% 0.22/0.58 # Removed in clause preprocessing : 2
% 0.22/0.58 # Initial clauses in saturation : 182
% 0.22/0.58 # Processed clauses : 511
% 0.22/0.58 # ...of these trivial : 2
% 0.22/0.58 # ...subsumed : 33
% 0.22/0.58 # ...remaining for further processing : 476
% 0.22/0.58 # Other redundant clauses eliminated : 43
% 0.22/0.58 # Clauses deleted for lack of memory : 0
% 0.22/0.58 # Backward-subsumed : 23
% 0.22/0.58 # Backward-rewritten : 34
% 0.22/0.58 # Generated clauses : 945
% 0.22/0.58 # ...of the previous two non-redundant : 838
% 0.22/0.58 # ...aggressively subsumed : 0
% 0.22/0.58 # Contextual simplify-reflections : 14
% 0.22/0.58 # Paramodulations : 898
% 0.22/0.58 # Factorizations : 0
% 0.22/0.58 # NegExts : 0
% 0.22/0.58 # Equation resolutions : 48
% 0.22/0.58 # Total rewrite steps : 685
% 0.22/0.58 # Propositional unsat checks : 0
% 0.22/0.58 # Propositional check models : 0
% 0.22/0.58 # Propositional check unsatisfiable : 0
% 0.22/0.58 # Propositional clauses : 0
% 0.22/0.58 # Propositional clauses after purity: 0
% 0.22/0.58 # Propositional unsat core size : 0
% 0.22/0.58 # Propositional preprocessing time : 0.000
% 0.22/0.58 # Propositional encoding time : 0.000
% 0.22/0.58 # Propositional solver time : 0.000
% 0.22/0.58 # Success case prop preproc time : 0.000
% 0.22/0.58 # Success case prop encoding time : 0.000
% 0.22/0.58 # Success case prop solver time : 0.000
% 0.22/0.58 # Current number of processed clauses : 225
% 0.22/0.58 # Positive orientable unit clauses : 43
% 0.22/0.58 # Positive unorientable unit clauses: 0
% 0.22/0.58 # Negative unit clauses : 1
% 0.22/0.58 # Non-unit-clauses : 181
% 0.22/0.58 # Current number of unprocessed clauses: 676
% 0.22/0.58 # ...number of literals in the above : 3859
% 0.22/0.58 # Current number of archived formulas : 0
% 0.22/0.58 # Current number of archived clauses : 233
% 0.22/0.58 # Clause-clause subsumption calls (NU) : 17169
% 0.22/0.58 # Rec. Clause-clause subsumption calls : 4962
% 0.22/0.58 # Non-unit clause-clause subsumptions : 70
% 0.22/0.58 # Unit Clause-clause subsumption calls : 545
% 0.22/0.58 # Rewrite failures with RHS unbound : 0
% 0.22/0.58 # BW rewrite match attempts : 15
% 0.22/0.58 # BW rewrite match successes : 11
% 0.22/0.58 # Condensation attempts : 0
% 0.22/0.58 # Condensation successes : 0
% 0.22/0.58 # Termbank termtop insertions : 34904
% 0.22/0.58
% 0.22/0.58 # -------------------------------------------------
% 0.22/0.58 # User time : 0.063 s
% 0.22/0.58 # System time : 0.005 s
% 0.22/0.58 # Total time : 0.068 s
% 0.22/0.58 # Maximum resident set size: 2464 pages
% 0.22/0.58
% 0.22/0.58 # -------------------------------------------------
% 0.22/0.58 # User time : 0.068 s
% 0.22/0.58 # System time : 0.006 s
% 0.22/0.58 # Total time : 0.074 s
% 0.22/0.58 # Maximum resident set size: 1824 pages
% 0.22/0.58 % E---3.1 exiting
% 0.22/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------