TSTP Solution File: SWC083+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC083+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:23:09 EDT 2024
% Result : Theorem 1.13s 0.62s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 68 ( 24 unt; 0 def)
% Number of atoms : 226 ( 51 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 264 ( 106 ~; 102 |; 24 &)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 51 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ~ ssList(X8)
| app(app(X6,X7),X8) != X3
| app(X6,X8) != X4 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
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/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(c_0_10,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ~ ssList(X8)
| app(app(X6,X7),X8) != X3
| app(X6,X8) != X4 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_12,plain,
! [X57,X58] :
( ( ~ neq(X57,X58)
| X57 != X58
| ~ ssList(X58)
| ~ ssList(X57) )
& ( X57 = X58
| neq(X57,X58)
| ~ ssList(X58)
| ~ ssList(X57) ) ),
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])])])])]) ).
fof(c_0_13,plain,
! [X49,X50,X51,X52] :
( ~ ssList(X49)
| ~ ssList(X50)
| ~ ssList(X51)
| ~ ssList(X52)
| ~ segmentP(X49,X50)
| segmentP(app(app(X51,X49),X52),X50) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_14,plain,
! [X22] :
( ~ ssList(X22)
| app(nil,X22) = X22 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_15,negated_conjecture,
! [X13] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( ~ ssList(X13)
| ~ neq(X13,nil)
| ~ segmentP(esk2_0,X13)
| ~ segmentP(esk1_0,X13) )
& ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& app(app(esk5_0,esk6_0),esk7_0) = esk3_0
& app(esk5_0,esk7_0) = esk4_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_11])])])])]) ).
cnf(c_0_16,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_18,plain,
( segmentP(app(app(X3,X1),X4),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
app(esk5_0,esk7_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X37,X38,X41,X42] :
( ( ssList(esk8_2(X37,X38))
| ~ segmentP(X37,X38)
| ~ ssList(X38)
| ~ ssList(X37) )
& ( ssList(esk9_2(X37,X38))
| ~ segmentP(X37,X38)
| ~ ssList(X38)
| ~ ssList(X37) )
& ( app(app(esk8_2(X37,X38),X38),esk9_2(X37,X38)) = X37
| ~ segmentP(X37,X38)
| ~ ssList(X38)
| ~ ssList(X37) )
& ( ~ ssList(X41)
| ~ ssList(X42)
| app(app(X41,X38),X42) != X37
| segmentP(X37,X38)
| ~ ssList(X38)
| ~ ssList(X37) ) ),
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)],[ax7])])])])])]) ).
cnf(c_0_23,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( segmentP(app(X1,X2),X3)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
app(esk5_0,esk7_0) = esk2_0,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_28,plain,
! [X48] :
( ~ ssList(X48)
| segmentP(X48,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_29,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
! [X17,X18] :
( ~ ssList(X17)
| ~ ssList(X18)
| ssList(app(X17,X18)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_31,negated_conjecture,
app(app(esk5_0,esk6_0),esk7_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_33,plain,
! [X31,X32,X33] :
( ~ ssList(X31)
| ~ ssList(X32)
| ~ ssList(X33)
| app(app(X31,X32),X33) = app(X31,app(X32,X33)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( esk5_0 = nil
| neq(esk5_0,nil) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
( segmentP(esk2_0,X1)
| ~ segmentP(esk5_0,X1)
| ~ ssList(X1) ),
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_24])]) ).
cnf(c_0_37,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,negated_conjecture,
app(app(esk5_0,esk6_0),esk7_0) = esk1_0,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,negated_conjecture,
( esk5_0 = nil
| ~ segmentP(esk1_0,esk5_0)
| ~ segmentP(esk2_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24])]) ).
cnf(c_0_44,negated_conjecture,
segmentP(esk2_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_24])]) ).
cnf(c_0_45,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_19]),c_0_17])]),c_0_39]) ).
cnf(c_0_46,negated_conjecture,
app(esk5_0,app(esk6_0,esk7_0)) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_27]),c_0_42]),c_0_24])]) ).
cnf(c_0_47,negated_conjecture,
( esk5_0 = nil
| ~ segmentP(esk1_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
( segmentP(esk1_0,esk5_0)
| ~ ssList(app(esk6_0,esk7_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_24])]) ).
cnf(c_0_49,negated_conjecture,
( esk5_0 = nil
| ~ ssList(app(esk6_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
fof(c_0_50,plain,
! [X36] :
( ~ ssList(X36)
| app(X36,nil) = X36 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_51,negated_conjecture,
esk5_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_39]),c_0_27]),c_0_42])]) ).
cnf(c_0_52,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_53,negated_conjecture,
app(nil,esk7_0) = esk2_0,
inference(rw,[status(thm)],[c_0_26,c_0_51]) ).
cnf(c_0_54,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_17])]),c_0_39]) ).
cnf(c_0_55,negated_conjecture,
( app(esk5_0,app(esk7_0,X1)) = app(esk2_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_26]),c_0_27]),c_0_24])]) ).
cnf(c_0_56,negated_conjecture,
esk7_0 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_53]),c_0_27])]) ).
cnf(c_0_57,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_59,negated_conjecture,
app(esk2_0,nil) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_26]),c_0_27]),c_0_24]),c_0_17])]) ).
cnf(c_0_60,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_19]),c_0_17])]) ).
cnf(c_0_61,negated_conjecture,
app(nil,app(esk6_0,esk2_0)) = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_51]),c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( ~ segmentP(esk1_0,esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_57]),c_0_58])]) ).
cnf(c_0_63,negated_conjecture,
segmentP(esk2_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_59]),c_0_58]),c_0_17])]) ).
cnf(c_0_64,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_52]),c_0_17])]),c_0_39]) ).
cnf(c_0_65,negated_conjecture,
app(esk6_0,esk2_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_58]),c_0_42])]) ).
cnf(c_0_66,negated_conjecture,
~ segmentP(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_58]),c_0_42])]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC083+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n024.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 : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 03:26:37 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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/benchmark/theBenchmark.p
% 1.13/0.62 # Version: 3.1.0
% 1.13/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.13/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.13/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.13/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.13/0.62 # Starting sh5l with 300s (1) cores
% 1.13/0.62 # new_bool_1 with pid 22410 completed with status 0
% 1.13/0.62 # Result found by new_bool_1
% 1.13/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.13/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.13/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.13/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.13/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.13/0.62 # Search class: FGHSF-FFMM21-MFFFFFNN
% 1.13/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.13/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.13/0.62 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22413 completed with status 0
% 1.13/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.13/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.13/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.13/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.13/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.13/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.13/0.62 # Search class: FGHSF-FFMM21-MFFFFFNN
% 1.13/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.13/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.13/0.62 # Preprocessing time : 0.002 s
% 1.13/0.62 # Presaturation interreduction done
% 1.13/0.62
% 1.13/0.62 # Proof found!
% 1.13/0.62 # SZS status Theorem
% 1.13/0.62 # SZS output start CNFRefutation
% See solution above
% 1.13/0.62 # Parsed axioms : 96
% 1.13/0.62 # Removed by relevancy pruning/SinE : 70
% 1.13/0.62 # Initial clauses : 51
% 1.13/0.62 # Removed in clause preprocessing : 0
% 1.13/0.62 # Initial clauses in saturation : 51
% 1.13/0.62 # Processed clauses : 1500
% 1.13/0.62 # ...of these trivial : 100
% 1.13/0.62 # ...subsumed : 835
% 1.13/0.62 # ...remaining for further processing : 565
% 1.13/0.62 # Other redundant clauses eliminated : 15
% 1.13/0.62 # Clauses deleted for lack of memory : 0
% 1.13/0.62 # Backward-subsumed : 198
% 1.13/0.62 # Backward-rewritten : 103
% 1.13/0.62 # Generated clauses : 7141
% 1.13/0.62 # ...of the previous two non-redundant : 6384
% 1.13/0.62 # ...aggressively subsumed : 0
% 1.13/0.62 # Contextual simplify-reflections : 43
% 1.13/0.62 # Paramodulations : 7114
% 1.13/0.62 # Factorizations : 0
% 1.13/0.62 # NegExts : 0
% 1.13/0.62 # Equation resolutions : 19
% 1.13/0.62 # Disequality decompositions : 0
% 1.13/0.62 # Total rewrite steps : 7368
% 1.13/0.62 # ...of those cached : 7329
% 1.13/0.62 # Propositional unsat checks : 0
% 1.13/0.62 # Propositional check models : 0
% 1.13/0.62 # Propositional check unsatisfiable : 0
% 1.13/0.62 # Propositional clauses : 0
% 1.13/0.62 # Propositional clauses after purity: 0
% 1.13/0.62 # Propositional unsat core size : 0
% 1.13/0.62 # Propositional preprocessing time : 0.000
% 1.13/0.62 # Propositional encoding time : 0.000
% 1.13/0.62 # Propositional solver time : 0.000
% 1.13/0.62 # Success case prop preproc time : 0.000
% 1.13/0.62 # Success case prop encoding time : 0.000
% 1.13/0.62 # Success case prop solver time : 0.000
% 1.13/0.62 # Current number of processed clauses : 201
% 1.13/0.62 # Positive orientable unit clauses : 38
% 1.13/0.62 # Positive unorientable unit clauses: 0
% 1.13/0.62 # Negative unit clauses : 17
% 1.13/0.62 # Non-unit-clauses : 146
% 1.13/0.62 # Current number of unprocessed clauses: 4756
% 1.13/0.62 # ...number of literals in the above : 24573
% 1.13/0.62 # Current number of archived formulas : 0
% 1.13/0.62 # Current number of archived clauses : 359
% 1.13/0.62 # Clause-clause subsumption calls (NU) : 20231
% 1.13/0.62 # Rec. Clause-clause subsumption calls : 12560
% 1.13/0.62 # Non-unit clause-clause subsumptions : 804
% 1.13/0.62 # Unit Clause-clause subsumption calls : 1204
% 1.13/0.62 # Rewrite failures with RHS unbound : 0
% 1.13/0.62 # BW rewrite match attempts : 11
% 1.13/0.62 # BW rewrite match successes : 11
% 1.13/0.62 # Condensation attempts : 0
% 1.13/0.62 # Condensation successes : 0
% 1.13/0.62 # Termbank termtop insertions : 112827
% 1.13/0.62 # Search garbage collected termcells : 1544
% 1.13/0.62
% 1.13/0.62 # -------------------------------------------------
% 1.13/0.62 # User time : 0.126 s
% 1.13/0.62 # System time : 0.004 s
% 1.13/0.62 # Total time : 0.130 s
% 1.13/0.62 # Maximum resident set size: 1908 pages
% 1.13/0.62
% 1.13/0.62 # -------------------------------------------------
% 1.13/0.62 # User time : 0.129 s
% 1.13/0.62 # System time : 0.007 s
% 1.13/0.62 # Total time : 0.136 s
% 1.13/0.62 # Maximum resident set size: 1820 pages
% 1.13/0.62 % E---3.1 exiting
% 1.13/0.62 % E exiting
%------------------------------------------------------------------------------