TSTP Solution File: SWC168+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC168+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:28:04 EDT 2024
% Result : Theorem 1.02s 0.61s
% Output : CNFRefutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 18 unt; 0 def)
% Number of atoms : 252 ( 54 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 313 ( 109 ~; 109 |; 52 &)
% ( 3 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 70 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ~ ssList(X18)
| app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1
| neq(X15,X16) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax1) ).
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/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax33) ).
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)
=> ! [X6] :
( ~ ssList(X6)
| app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ~ ssList(X18)
| app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1
| neq(X15,X16) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_11,negated_conjecture,
! [X269,X270,X271,X272,X273,X274,X275,X276] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssList(esk52_0)
& ssList(esk53_0)
& app(app(esk52_0,esk50_0),esk53_0) = esk51_0
& strictorderedP(esk50_0)
& ( ~ ssItem(X269)
| ~ ssList(X270)
| app(X270,cons(X269,nil)) != esk52_0
| ~ ssItem(X271)
| ~ ssList(X272)
| app(cons(X271,nil),X272) != esk50_0
| ~ lt(X269,X271) )
& ( ~ ssItem(X273)
| ~ ssList(X274)
| app(cons(X273,nil),X274) != esk53_0
| ~ ssItem(X275)
| ~ ssList(X276)
| app(X276,cons(X275,nil)) != esk50_0
| ~ lt(X275,X273) )
& ssItem(esk54_0)
& ssItem(esk55_0)
& ssList(esk56_0)
& ssList(esk57_0)
& app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk48_0
& ~ neq(esk54_0,esk55_0)
& ( nil = esk51_0
| nil != esk50_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_12,plain,
! [X19,X20] :
( ( ~ neq(X19,X20)
| X19 != X20
| ~ ssItem(X20)
| ~ ssItem(X19) )
& ( X19 = X20
| neq(X19,X20)
| ~ ssItem(X20)
| ~ ssItem(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
cnf(c_0_13,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X234,X235,X236] :
( ~ ssList(X234)
| ~ ssList(X235)
| ~ ssList(X236)
| app(app(X234,X235),X236) = app(X234,app(X235,X236)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_16,negated_conjecture,
~ neq(esk54_0,esk55_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
ssItem(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk50_0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
esk55_0 = esk54_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk57_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X123,X124] :
( ~ ssList(X123)
| ~ ssItem(X124)
| ssList(cons(X124,X123)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_25,negated_conjecture,
( app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(app(esk56_0,cons(esk54_0,nil)))
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[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]),c_0_22])]) ).
cnf(c_0_26,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_28,plain,
! [X142,X143] :
( ~ ssList(X142)
| ~ ssList(X143)
| ssList(app(X142,X143)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_29,negated_conjecture,
( app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(app(esk56_0,cons(esk54_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_19])]) ).
cnf(c_0_30,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_32,plain,
! [X90,X91,X92,X93,X94,X95] :
( ( ~ strictorderedP(X90)
| ~ ssItem(X91)
| ~ ssItem(X92)
| ~ ssList(X93)
| ~ ssList(X94)
| ~ ssList(X95)
| app(app(X93,cons(X91,X94)),cons(X92,X95)) != X90
| lt(X91,X92)
| ~ ssList(X90) )
& ( ssItem(esk30_1(X90))
| strictorderedP(X90)
| ~ ssList(X90) )
& ( ssItem(esk31_1(X90))
| strictorderedP(X90)
| ~ ssList(X90) )
& ( ssList(esk32_1(X90))
| strictorderedP(X90)
| ~ ssList(X90) )
& ( ssList(esk33_1(X90))
| strictorderedP(X90)
| ~ ssList(X90) )
& ( ssList(esk34_1(X90))
| strictorderedP(X90)
| ~ ssList(X90) )
& ( app(app(esk32_1(X90),cons(esk30_1(X90),esk33_1(X90))),cons(esk31_1(X90),esk34_1(X90))) = X90
| strictorderedP(X90)
| ~ ssList(X90) )
& ( ~ lt(esk30_1(X90),esk31_1(X90))
| strictorderedP(X90)
| ~ ssList(X90) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_33,negated_conjecture,
( app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
fof(c_0_34,plain,
! [X232,X233] :
( ~ ssList(X232)
| ~ ssItem(X233)
| cons(X233,X232) = app(cons(X233,nil),X232) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_35,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
cnf(c_0_36,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_32]) ).
cnf(c_0_37,negated_conjecture,
app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_26]),c_0_27]),c_0_19])]) ).
cnf(c_0_38,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_40,plain,
! [X156,X157] :
( ~ ssItem(X156)
| ~ ssItem(X157)
| ~ lt(X156,X157)
| ~ lt(X157,X156) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])]) ).
cnf(c_0_41,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_36]) ).
cnf(c_0_42,negated_conjecture,
app(app(esk56_0,cons(esk54_0,nil)),cons(esk54_0,esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23]),c_0_19])]) ).
cnf(c_0_43,negated_conjecture,
strictorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_39,c_0_14]) ).
cnf(c_0_45,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
lt(esk54_0,esk54_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(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44]),c_0_23]),c_0_27]),c_0_31]),c_0_19])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_46]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC168+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n015.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:26:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/benchmark/theBenchmark.p
% 1.02/0.61 # Version: 3.1.0
% 1.02/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.02/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.02/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.02/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.02/0.61 # Starting sh5l with 300s (1) cores
% 1.02/0.61 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30861 completed with status 0
% 1.02/0.61 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.02/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.02/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.02/0.61 # No SInE strategy applied
% 1.02/0.61 # Search class: FGHSF-FSLM21-MFFFFFNN
% 1.02/0.61 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.02/0.61 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 1.02/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.02/0.61 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 1.02/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 1.02/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 1.02/0.61 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 30885 completed with status 0
% 1.02/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 1.02/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.02/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.02/0.61 # No SInE strategy applied
% 1.02/0.61 # Search class: FGHSF-FSLM21-MFFFFFNN
% 1.02/0.61 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.02/0.61 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 1.02/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.02/0.61 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 1.02/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 1.02/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 1.02/0.61 # Preprocessing time : 0.004 s
% 1.02/0.61 # Presaturation interreduction done
% 1.02/0.61
% 1.02/0.61 # Proof found!
% 1.02/0.61 # SZS status Theorem
% 1.02/0.61 # SZS output start CNFRefutation
% See solution above
% 1.02/0.61 # Parsed axioms : 96
% 1.02/0.61 # Removed by relevancy pruning/SinE : 0
% 1.02/0.61 # Initial clauses : 209
% 1.02/0.61 # Removed in clause preprocessing : 2
% 1.02/0.61 # Initial clauses in saturation : 207
% 1.02/0.61 # Processed clauses : 744
% 1.02/0.61 # ...of these trivial : 12
% 1.02/0.61 # ...subsumed : 93
% 1.02/0.61 # ...remaining for further processing : 639
% 1.02/0.61 # Other redundant clauses eliminated : 65
% 1.02/0.61 # Clauses deleted for lack of memory : 0
% 1.02/0.61 # Backward-subsumed : 20
% 1.02/0.61 # Backward-rewritten : 47
% 1.02/0.61 # Generated clauses : 1524
% 1.02/0.61 # ...of the previous two non-redundant : 1317
% 1.02/0.61 # ...aggressively subsumed : 0
% 1.02/0.61 # Contextual simplify-reflections : 14
% 1.02/0.61 # Paramodulations : 1456
% 1.02/0.61 # Factorizations : 0
% 1.02/0.61 # NegExts : 0
% 1.02/0.61 # Equation resolutions : 70
% 1.02/0.61 # Disequality decompositions : 0
% 1.02/0.61 # Total rewrite steps : 1280
% 1.02/0.61 # ...of those cached : 1230
% 1.02/0.61 # Propositional unsat checks : 0
% 1.02/0.61 # Propositional check models : 0
% 1.02/0.61 # Propositional check unsatisfiable : 0
% 1.02/0.61 # Propositional clauses : 0
% 1.02/0.61 # Propositional clauses after purity: 0
% 1.02/0.61 # Propositional unsat core size : 0
% 1.02/0.61 # Propositional preprocessing time : 0.000
% 1.02/0.61 # Propositional encoding time : 0.000
% 1.02/0.61 # Propositional solver time : 0.000
% 1.02/0.61 # Success case prop preproc time : 0.000
% 1.02/0.61 # Success case prop encoding time : 0.000
% 1.02/0.61 # Success case prop solver time : 0.000
% 1.02/0.61 # Current number of processed clauses : 348
% 1.02/0.61 # Positive orientable unit clauses : 64
% 1.02/0.61 # Positive unorientable unit clauses: 0
% 1.02/0.61 # Negative unit clauses : 4
% 1.02/0.61 # Non-unit-clauses : 280
% 1.02/0.61 # Current number of unprocessed clauses: 976
% 1.02/0.61 # ...number of literals in the above : 5424
% 1.02/0.61 # Current number of archived formulas : 0
% 1.02/0.61 # Current number of archived clauses : 268
% 1.02/0.61 # Clause-clause subsumption calls (NU) : 24259
% 1.02/0.61 # Rec. Clause-clause subsumption calls : 7979
% 1.02/0.61 # Non-unit clause-clause subsumptions : 125
% 1.02/0.61 # Unit Clause-clause subsumption calls : 622
% 1.02/0.61 # Rewrite failures with RHS unbound : 0
% 1.02/0.61 # BW rewrite match attempts : 52
% 1.02/0.61 # BW rewrite match successes : 28
% 1.02/0.61 # Condensation attempts : 0
% 1.02/0.61 # Condensation successes : 0
% 1.02/0.61 # Termbank termtop insertions : 49340
% 1.02/0.61 # Search garbage collected termcells : 4522
% 1.02/0.61
% 1.02/0.61 # -------------------------------------------------
% 1.02/0.61 # User time : 0.092 s
% 1.02/0.61 # System time : 0.008 s
% 1.02/0.61 # Total time : 0.100 s
% 1.02/0.61 # Maximum resident set size: 2508 pages
% 1.02/0.61
% 1.02/0.61 # -------------------------------------------------
% 1.02/0.61 # User time : 0.395 s
% 1.02/0.61 # System time : 0.028 s
% 1.02/0.61 # Total time : 0.424 s
% 1.02/0.61 # Maximum resident set size: 1852 pages
% 1.02/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------