TSTP Solution File: SWC299+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC299+1 : TPTP v8.1.2. Released v2.4.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 19:40:18 EDT 2023
% Result : Theorem 0.18s 0.54s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 23 unt; 0 def)
% Number of atoms : 256 ( 61 equ)
% Maximal formula atoms : 49 ( 4 avg)
% Number of connectives : 297 ( 97 ~; 109 |; 43 &)
% ( 1 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 13 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn; 64 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) )
| ( ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ! [X12] :
( ssList(X12)
=> ( cons(X10,nil) != X3
| app(app(X11,X3),X12) != X4
| ? [X13] :
( ssItem(X13)
& memberP(X11,X13)
& lt(X10,X13) )
| ? [X14] :
( ssItem(X14)
& memberP(X12,X14)
& lt(X14,X10) ) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.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/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax26) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax33) ).
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/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax12) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax68) ).
fof(ax69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/tmp/tmp.qgagyreCuM/E---3.1_18528.p',ax69) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) )
| ( ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ! [X12] :
( ssList(X12)
=> ( cons(X10,nil) != X3
| app(app(X11,X3),X12) != X4
| ? [X13] :
( ssItem(X13)
& memberP(X11,X13)
& lt(X10,X13) )
| ? [X14] :
( ssItem(X14)
& memberP(X12,X14)
& lt(X14,X10) ) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_11,negated_conjecture,
! [X27,X28] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssItem(esk5_0)
& ssItem(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0
& lt(esk6_0,esk5_0)
& ( nil = esk4_0
| ssItem(esk10_0) )
& ( nil = esk3_0
| ssItem(esk10_0) )
& ( nil = esk4_0
| ssList(esk11_0) )
& ( nil = esk3_0
| ssList(esk11_0) )
& ( nil = esk4_0
| ssList(esk12_0) )
& ( nil = esk3_0
| ssList(esk12_0) )
& ( nil = esk4_0
| cons(esk10_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk10_0,nil) = esk3_0 )
& ( nil = esk4_0
| app(app(esk11_0,esk3_0),esk12_0) = esk4_0 )
& ( nil = esk3_0
| app(app(esk11_0,esk3_0),esk12_0) = esk4_0 )
& ( nil = esk4_0
| ~ ssItem(X27)
| ~ memberP(esk11_0,X27)
| ~ lt(esk10_0,X27) )
& ( nil = esk3_0
| ~ ssItem(X27)
| ~ memberP(esk11_0,X27)
| ~ lt(esk10_0,X27) )
& ( nil = esk4_0
| ~ ssItem(X28)
| ~ memberP(esk12_0,X28)
| ~ lt(X28,esk10_0) )
& ( nil = esk3_0
| ~ ssItem(X28)
| ~ memberP(esk12_0,X28)
| ~ lt(X28,esk10_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_10])])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X143,X144,X145] :
( ~ ssList(X143)
| ~ ssList(X144)
| ~ ssList(X145)
| app(app(X143,X144),X145) = app(X143,app(X144,X145)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_15,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk3_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X94,X95] :
( ~ ssList(X94)
| ~ ssItem(X95)
| ssList(cons(X95,X94)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_20,negated_conjecture,
( app(app(app(esk7_0,app(cons(esk5_0,nil),esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_23,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X35,X36] :
( ~ ssList(X35)
| ~ ssItem(X36)
| cons(X36,X35) = app(cons(X36,nil),X35) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_25,negated_conjecture,
app(app(app(esk7_0,app(cons(esk5_0,nil),esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
app(app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_27]),c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
! [X125,X126] :
( ~ ssList(X125)
| ~ ssList(X126)
| ssList(app(X125,X126)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_32,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_22]),c_0_30])]) ).
cnf(c_0_33,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_34,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_35,plain,
! [X51,X52,X53,X54,X55,X56] :
( ( ~ strictorderedP(X51)
| ~ ssItem(X52)
| ~ ssItem(X53)
| ~ ssList(X54)
| ~ ssList(X55)
| ~ ssList(X56)
| app(app(X54,cons(X52,X55)),cons(X53,X56)) != X51
| lt(X52,X53)
| ~ ssList(X51) )
& ( ssItem(esk20_1(X51))
| strictorderedP(X51)
| ~ ssList(X51) )
& ( ssItem(esk21_1(X51))
| strictorderedP(X51)
| ~ ssList(X51) )
& ( ssList(esk22_1(X51))
| strictorderedP(X51)
| ~ ssList(X51) )
& ( ssList(esk23_1(X51))
| strictorderedP(X51)
| ~ ssList(X51) )
& ( ssList(esk24_1(X51))
| strictorderedP(X51)
| ~ ssList(X51) )
& ( app(app(esk22_1(X51),cons(esk20_1(X51),esk23_1(X51))),cons(esk21_1(X51),esk24_1(X51))) = X51
| strictorderedP(X51)
| ~ ssList(X51) )
& ( ~ lt(esk20_1(X51),esk21_1(X51))
| strictorderedP(X51)
| ~ ssList(X51) ) ),
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(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18])]) ).
fof(c_0_37,plain,
! [X62,X63] :
( ~ ssItem(X62)
| ~ ssItem(X63)
| ~ lt(X62,X63)
| ~ lt(X63,X62) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])]) ).
fof(c_0_38,plain,
! [X157] :
( ~ ssItem(X157)
| strictorderedP(cons(X157,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])]) ).
cnf(c_0_39,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_40,negated_conjecture,
app(app(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_21]),c_0_17]),c_0_23])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
lt(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( nil = esk3_0
| cons(esk10_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk3_0
| ssItem(esk10_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_47,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_39]) ).
cnf(c_0_48,negated_conjecture,
app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,esk9_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_26]),c_0_28]),c_0_30])]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_41,c_0_13]) ).
cnf(c_0_50,negated_conjecture,
~ lt(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_30]),c_0_23])]) ).
cnf(c_0_51,negated_conjecture,
( esk3_0 = nil
| strictorderedP(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
~ strictorderedP(esk3_0),
inference(sr,[status(thm)],[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(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_28]),c_0_17]),c_0_18]),c_0_30]),c_0_23])]),c_0_50]) ).
cnf(c_0_53,negated_conjecture,
esk3_0 = nil,
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[ax69]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC299+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 02:08:37 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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/tmp/tmp.qgagyreCuM/E---3.1_18528.p
% 0.18/0.54 # Version: 3.1pre001
% 0.18/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.54 # Starting sh5l with 300s (1) cores
% 0.18/0.54 # sh5l with pid 18609 completed with status 0
% 0.18/0.54 # Result found by sh5l
% 0.18/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.54 # Starting sh5l with 300s (1) cores
% 0.18/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.18/0.54 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.18/0.54 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 18612 completed with status 0
% 0.18/0.54 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.18/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.54 # Starting sh5l with 300s (1) cores
% 0.18/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.18/0.54 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.18/0.54 # Preprocessing time : 0.003 s
% 0.18/0.54 # Presaturation interreduction done
% 0.18/0.54
% 0.18/0.54 # Proof found!
% 0.18/0.54 # SZS status Theorem
% 0.18/0.54 # SZS output start CNFRefutation
% See solution above
% 0.18/0.54 # Parsed axioms : 96
% 0.18/0.54 # Removed by relevancy pruning/SinE : 10
% 0.18/0.54 # Initial clauses : 190
% 0.18/0.54 # Removed in clause preprocessing : 2
% 0.18/0.54 # Initial clauses in saturation : 188
% 0.18/0.54 # Processed clauses : 812
% 0.18/0.54 # ...of these trivial : 2
% 0.18/0.54 # ...subsumed : 175
% 0.18/0.54 # ...remaining for further processing : 635
% 0.18/0.54 # Other redundant clauses eliminated : 43
% 0.18/0.54 # Clauses deleted for lack of memory : 0
% 0.18/0.54 # Backward-subsumed : 59
% 0.18/0.54 # Backward-rewritten : 134
% 0.18/0.54 # Generated clauses : 1743
% 0.18/0.54 # ...of the previous two non-redundant : 1533
% 0.18/0.54 # ...aggressively subsumed : 0
% 0.18/0.54 # Contextual simplify-reflections : 139
% 0.18/0.54 # Paramodulations : 1694
% 0.18/0.54 # Factorizations : 0
% 0.18/0.54 # NegExts : 0
% 0.18/0.54 # Equation resolutions : 48
% 0.18/0.54 # Total rewrite steps : 1025
% 0.18/0.54 # Propositional unsat checks : 0
% 0.18/0.54 # Propositional check models : 0
% 0.18/0.54 # Propositional check unsatisfiable : 0
% 0.18/0.54 # Propositional clauses : 0
% 0.18/0.54 # Propositional clauses after purity: 0
% 0.18/0.54 # Propositional unsat core size : 0
% 0.18/0.54 # Propositional preprocessing time : 0.000
% 0.18/0.54 # Propositional encoding time : 0.000
% 0.18/0.54 # Propositional solver time : 0.000
% 0.18/0.54 # Success case prop preproc time : 0.000
% 0.18/0.54 # Success case prop encoding time : 0.000
% 0.18/0.54 # Success case prop solver time : 0.000
% 0.18/0.54 # Current number of processed clauses : 240
% 0.18/0.54 # Positive orientable unit clauses : 28
% 0.18/0.54 # Positive unorientable unit clauses: 0
% 0.18/0.54 # Negative unit clauses : 3
% 0.18/0.54 # Non-unit-clauses : 209
% 0.18/0.54 # Current number of unprocessed clauses: 1078
% 0.18/0.54 # ...number of literals in the above : 6360
% 0.18/0.54 # Current number of archived formulas : 0
% 0.18/0.54 # Current number of archived clauses : 377
% 0.18/0.54 # Clause-clause subsumption calls (NU) : 20611
% 0.18/0.54 # Rec. Clause-clause subsumption calls : 6235
% 0.18/0.54 # Non-unit clause-clause subsumptions : 373
% 0.18/0.54 # Unit Clause-clause subsumption calls : 292
% 0.18/0.54 # Rewrite failures with RHS unbound : 0
% 0.18/0.54 # BW rewrite match attempts : 13
% 0.18/0.54 # BW rewrite match successes : 9
% 0.18/0.54 # Condensation attempts : 0
% 0.18/0.54 # Condensation successes : 0
% 0.18/0.54 # Termbank termtop insertions : 47655
% 0.18/0.54
% 0.18/0.54 # -------------------------------------------------
% 0.18/0.54 # User time : 0.082 s
% 0.18/0.54 # System time : 0.000 s
% 0.18/0.54 # Total time : 0.082 s
% 0.18/0.54 # Maximum resident set size: 2468 pages
% 0.18/0.54
% 0.18/0.54 # -------------------------------------------------
% 0.18/0.54 # User time : 0.084 s
% 0.18/0.54 # System time : 0.003 s
% 0.18/0.54 # Total time : 0.087 s
% 0.18/0.54 # Maximum resident set size: 1808 pages
% 0.18/0.54 % E---3.1 exiting
% 0.18/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------