TSTP Solution File: SWC303+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC303+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:25:27 EDT 2024
% Result : Theorem 0.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 17 unt; 0 def)
% Number of atoms : 236 ( 41 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 299 ( 114 ~; 109 |; 39 &)
% ( 1 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 6 ( 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 : 96 ( 0 sgn 63 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X4 != X2
| X3 != X1
| ! [X5] :
( ~ ssList(X5)
| app(X3,X5) != X4
| ~ totalorderedP(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
& leq(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
| ~ lt(X11,X10) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/Axioms/SWC001+0.ax',ax82) ).
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(ax90,axiom,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax90) ).
fof(ax91,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ( ( leq(X1,X2)
& lt(X2,X3) )
=> lt(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax91) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(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
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X4 != X2
| X3 != X1
| ! [X5] :
( ~ ssList(X5)
| app(X3,X5) != X4
| ~ totalorderedP(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
& leq(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
| ~ lt(X11,X10) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,negated_conjecture,
! [X20,X21,X22,X23] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk4_0 = esk2_0
& esk3_0 = esk1_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& totalorderedP(esk3_0)
& ( ~ ssItem(X20)
| ~ ssList(X21)
| app(cons(X20,nil),X21) != esk5_0
| ~ ssItem(X22)
| ~ ssList(X23)
| app(X23,cons(X22,nil)) != esk3_0
| ~ leq(X22,X20) )
& 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
& lt(esk7_0,esk6_0)
& ( nil = esk4_0
| nil != esk3_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])])])])]) ).
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,
esk3_0 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X61,X62,X63] :
( ~ ssList(X61)
| ~ ssList(X62)
| ~ ssList(X63)
| app(app(X61,X62),X63) = app(X61,app(X62,X63)) ),
inference(fof_nnf,[status(thm)],[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,
! [X59,X60] :
( ~ ssList(X59)
| ~ ssItem(X60)
| cons(X60,X59) = app(cons(X60,nil),X59) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
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,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
inference(fof_simplification,[status(thm)],[ax90]) ).
fof(c_0_23,plain,
! [X40,X41,X42] :
( ~ ssItem(X40)
| ~ ssItem(X41)
| ~ ssItem(X42)
| ~ leq(X40,X41)
| ~ lt(X41,X42)
| lt(X40,X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax91])])])]) ).
fof(c_0_24,plain,
! [X83,X84,X85,X86,X87,X88] :
( ( ~ totalorderedP(X83)
| ~ ssItem(X84)
| ~ ssItem(X85)
| ~ ssList(X86)
| ~ ssList(X87)
| ~ ssList(X88)
| app(app(X86,cons(X84,X87)),cons(X85,X88)) != X83
| leq(X84,X85)
| ~ ssList(X83) )
& ( ssItem(esk15_1(X83))
| totalorderedP(X83)
| ~ ssList(X83) )
& ( ssItem(esk16_1(X83))
| totalorderedP(X83)
| ~ ssList(X83) )
& ( ssList(esk17_1(X83))
| totalorderedP(X83)
| ~ ssList(X83) )
& ( ssList(esk18_1(X83))
| totalorderedP(X83)
| ~ ssList(X83) )
& ( ssList(esk19_1(X83))
| totalorderedP(X83)
| ~ ssList(X83) )
& ( app(app(esk17_1(X83),cons(esk15_1(X83),esk18_1(X83))),cons(esk16_1(X83),esk19_1(X83))) = X83
| totalorderedP(X83)
| ~ ssList(X83) )
& ( ~ leq(esk15_1(X83),esk16_1(X83))
| totalorderedP(X83)
| ~ ssList(X83) ) ),
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)],[ax11])])])])])]) ).
cnf(c_0_25,negated_conjecture,
( app(app(app(esk8_0,cons(esk6_0,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_19,c_0_20]),c_0_16]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_27,plain,
! [X39] :
( ~ ssItem(X39)
| ~ lt(X39,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
cnf(c_0_28,plain,
( lt(X1,X3)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ leq(X1,X2)
| ~ lt(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
lt(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( leq(X2,X3)
| ~ totalorderedP(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_24]) ).
cnf(c_0_32,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))
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_26])]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,plain,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( lt(X1,esk6_0)
| ~ leq(X1,esk7_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_30])]) ).
cnf(c_0_36,plain,
( leq(X1,X2)
| ~ totalorderedP(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_31]) ).
cnf(c_0_37,negated_conjecture,
( app(app(esk8_0,cons(esk6_0,esk9_0)),cons(esk7_0,esk10_0)) = esk3_0
| ~ ssList(app(esk8_0,cons(esk6_0,esk9_0)))
| ~ ssList(cons(esk7_0,nil))
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_26]),c_0_30])]) ).
cnf(c_0_38,negated_conjecture,
totalorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_40,negated_conjecture,
~ leq(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21])]) ).
fof(c_0_41,plain,
! [X47,X48] :
( ~ ssList(X47)
| ~ ssList(X48)
| ssList(app(X47,X48)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(app(esk8_0,cons(esk6_0,esk9_0)))
| ~ ssList(cons(esk7_0,nil))
| ~ ssList(cons(esk6_0,nil)) ),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]),c_0_26]),c_0_16]),c_0_17]),c_0_30]),c_0_21])]),c_0_40]) ).
cnf(c_0_43,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_44,plain,
! [X67,X68] :
( ~ ssList(X67)
| ~ ssItem(X68)
| ssList(cons(X68,X67)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(cons(esk7_0,nil))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk6_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_17])]) ).
cnf(c_0_46,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_47,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk6_0,esk9_0)) ),
inference(cn,[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_30])]) ).
cnf(c_0_49,negated_conjecture,
~ ssList(cons(esk6_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_16]),c_0_21])]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_46]),c_0_47]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC303+1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n028.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 03:48:22 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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/benchmark/theBenchmark.p
% 0.16/0.49 # Version: 3.1.0
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # Starting sh5l with 300s (1) cores
% 0.16/0.49 # new_bool_1 with pid 13455 completed with status 0
% 0.16/0.49 # Result found by new_bool_1
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13458 completed with status 0
% 0.16/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.49 # Preprocessing time : 0.004 s
% 0.16/0.49 # Presaturation interreduction done
% 0.16/0.49
% 0.16/0.49 # Proof found!
% 0.16/0.49 # SZS status Theorem
% 0.16/0.49 # SZS output start CNFRefutation
% See solution above
% 0.16/0.49 # Parsed axioms : 96
% 0.16/0.49 # Removed by relevancy pruning/SinE : 56
% 0.16/0.49 # Initial clauses : 79
% 0.16/0.49 # Removed in clause preprocessing : 1
% 0.16/0.49 # Initial clauses in saturation : 78
% 0.16/0.49 # Processed clauses : 470
% 0.16/0.49 # ...of these trivial : 12
% 0.16/0.49 # ...subsumed : 80
% 0.16/0.49 # ...remaining for further processing : 378
% 0.16/0.49 # Other redundant clauses eliminated : 11
% 0.16/0.49 # Clauses deleted for lack of memory : 0
% 0.16/0.49 # Backward-subsumed : 50
% 0.16/0.49 # Backward-rewritten : 13
% 0.16/0.49 # Generated clauses : 2218
% 0.16/0.49 # ...of the previous two non-redundant : 2091
% 0.16/0.49 # ...aggressively subsumed : 0
% 0.16/0.49 # Contextual simplify-reflections : 26
% 0.16/0.49 # Paramodulations : 2184
% 0.16/0.49 # Factorizations : 0
% 0.16/0.49 # NegExts : 0
% 0.16/0.49 # Equation resolutions : 15
% 0.16/0.49 # Disequality decompositions : 0
% 0.16/0.49 # Total rewrite steps : 660
% 0.16/0.49 # ...of those cached : 626
% 0.16/0.49 # Propositional unsat checks : 0
% 0.16/0.49 # Propositional check models : 0
% 0.16/0.49 # Propositional check unsatisfiable : 0
% 0.16/0.49 # Propositional clauses : 0
% 0.16/0.49 # Propositional clauses after purity: 0
% 0.16/0.49 # Propositional unsat core size : 0
% 0.16/0.49 # Propositional preprocessing time : 0.000
% 0.16/0.49 # Propositional encoding time : 0.000
% 0.16/0.49 # Propositional solver time : 0.000
% 0.16/0.49 # Success case prop preproc time : 0.000
% 0.16/0.49 # Success case prop encoding time : 0.000
% 0.16/0.49 # Success case prop solver time : 0.000
% 0.16/0.49 # Current number of processed clauses : 218
% 0.16/0.49 # Positive orientable unit clauses : 34
% 0.16/0.49 # Positive unorientable unit clauses: 0
% 0.16/0.49 # Negative unit clauses : 9
% 0.16/0.49 # Non-unit-clauses : 175
% 0.16/0.49 # Current number of unprocessed clauses: 1719
% 0.16/0.49 # ...number of literals in the above : 6824
% 0.16/0.49 # Current number of archived formulas : 0
% 0.16/0.49 # Current number of archived clauses : 156
% 0.16/0.49 # Clause-clause subsumption calls (NU) : 13871
% 0.16/0.49 # Rec. Clause-clause subsumption calls : 7747
% 0.16/0.49 # Non-unit clause-clause subsumptions : 121
% 0.16/0.49 # Unit Clause-clause subsumption calls : 1310
% 0.16/0.49 # Rewrite failures with RHS unbound : 0
% 0.16/0.49 # BW rewrite match attempts : 8
% 0.16/0.49 # BW rewrite match successes : 8
% 0.16/0.49 # Condensation attempts : 0
% 0.16/0.49 # Condensation successes : 0
% 0.16/0.49 # Termbank termtop insertions : 41264
% 0.16/0.49 # Search garbage collected termcells : 2050
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.049 s
% 0.16/0.49 # System time : 0.007 s
% 0.16/0.49 # Total time : 0.057 s
% 0.16/0.49 # Maximum resident set size: 2044 pages
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.051 s
% 0.16/0.49 # System time : 0.010 s
% 0.16/0.49 # Total time : 0.062 s
% 0.16/0.49 # Maximum resident set size: 1828 pages
% 0.16/0.49 % E---3.1 exiting
% 0.16/0.49 % E exiting
%------------------------------------------------------------------------------