TSTP Solution File: SWC067+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC067+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:22:58 EDT 2024
% Result : Theorem 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 65 ( 15 unt; 0 def)
% Number of atoms : 292 ( 105 equ)
% Maximal formula atoms : 40 ( 4 avg)
% Number of connectives : 369 ( 142 ~; 139 |; 59 &)
% ( 4 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn 47 !; 20 ?)
% 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) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X15] :
( ssList(X15)
& neq(X15,nil)
& segmentP(X2,X15)
& segmentP(X1,X15) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
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) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X15] :
( ssList(X15)
& neq(X15,nil)
& segmentP(X2,X15)
& segmentP(X1,X15) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,negated_conjecture,
! [X22,X23,X24,X25,X26,X27,X28,X29,X30] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X22)
| ~ ssList(X23)
| app(X23,cons(X22,nil)) != esk5_0
| ~ ssItem(X24)
| ~ ssList(X25)
| app(cons(X24,nil),X25) != esk3_0
| ~ lt(X22,X24) )
& ( ~ ssItem(X26)
| ~ ssList(X27)
| app(cons(X26,nil),X27) != esk6_0
| ~ ssItem(X28)
| ~ ssList(X29)
| app(X29,cons(X28,nil)) != esk3_0
| ~ lt(X28,X26) )
& ( nil = esk4_0
| nil != esk3_0 )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X30)
| ~ neq(X30,nil)
| ~ segmentP(esk2_0,X30)
| ~ segmentP(esk1_0,X30)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X30)
| ~ neq(X30,nil)
| ~ segmentP(esk2_0,X30)
| ~ segmentP(esk1_0,X30)
| nil != esk1_0 ) ),
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)],[c_0_9])])])])])]) ).
fof(c_0_11,plain,
! [X88,X89] :
( ( nil = X89
| nil != app(X88,X89)
| ~ ssList(X89)
| ~ ssList(X88) )
& ( nil = X88
| nil != app(X88,X89)
| ~ ssList(X89)
| ~ ssList(X88) )
& ( nil != X89
| nil != X88
| nil = app(X88,X89)
| ~ ssList(X89)
| ~ ssList(X88) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk2_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X71,X72] :
( ~ ssList(X71)
| ~ ssList(X72)
| ssList(app(X71,X72)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
( esk6_0 = nil
| esk2_0 != nil
| ~ ssList(app(esk5_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
! [X90] :
( ~ ssList(X90)
| app(X90,nil) = X90 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_25,negated_conjecture,
( esk6_0 = nil
| esk2_0 != nil ),
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,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( app(app(esk5_0,esk3_0),nil) = esk2_0
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( app(esk5_0,esk3_0) = nil
| esk2_0 != nil
| ~ ssList(app(esk5_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_16])]) ).
cnf(c_0_30,negated_conjecture,
( app(esk5_0,esk3_0) = esk2_0
| esk2_0 != nil
| ~ ssList(app(esk5_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( app(esk5_0,esk3_0) = nil
| esk2_0 != nil ),
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_23])]) ).
fof(c_0_32,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_35,plain,
! [X76] :
( ~ ssList(X76)
| app(nil,X76) = X76 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_36,negated_conjecture,
( app(esk5_0,esk3_0) = esk2_0
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_37,negated_conjecture,
( esk5_0 = nil
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_22]),c_0_23])]) ).
fof(c_0_38,plain,
! [X51,X52] :
( ( ~ neq(X51,X52)
| X51 != X52
| ~ ssList(X52)
| ~ ssList(X51) )
& ( X51 = X52
| neq(X51,X52)
| ~ ssList(X52)
| ~ ssList(X51) ) ),
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_32])])])])]) ).
fof(c_0_39,plain,
! [X31,X32,X35,X36] :
( ( ssList(esk7_2(X31,X32))
| ~ segmentP(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) )
& ( ssList(esk8_2(X31,X32))
| ~ segmentP(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) )
& ( app(app(esk7_2(X31,X32),X32),esk8_2(X31,X32)) = X31
| ~ segmentP(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) )
& ( ~ ssList(X35)
| ~ ssList(X36)
| app(app(X35,X32),X36) != X31
| segmentP(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) ) ),
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_40,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_19]),c_0_19]) ).
cnf(c_0_41,negated_conjecture,
( neq(esk2_0,nil)
| esk3_0 != nil ),
inference(rw,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,negated_conjecture,
( app(nil,esk3_0) = esk2_0
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_47,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_39]) ).
cnf(c_0_48,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
( esk3_0 = esk2_0
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_22])]) ).
fof(c_0_50,plain,
! [X42] :
( ~ ssList(X42)
| segmentP(X42,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_51,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_52,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,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_47]) ).
cnf(c_0_54,negated_conjecture,
( esk2_0 != nil
| ~ segmentP(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_51,c_0_19]) ).
cnf(c_0_57,negated_conjecture,
( esk3_0 = nil
| neq(esk3_0,nil) ),
inference(spm,[status(thm)],[c_0_52,c_0_22]) ).
cnf(c_0_58,negated_conjecture,
segmentP(esk2_0,esk3_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_53,c_0_15]),c_0_42]),c_0_22]),c_0_16]),c_0_23])]) ).
cnf(c_0_59,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_42])]) ).
cnf(c_0_60,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_61,negated_conjecture,
( esk3_0 = nil
| ~ segmentP(esk3_0,esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_22])]),c_0_59]) ).
cnf(c_0_62,negated_conjecture,
( esk2_0 = nil
| esk3_0 != nil ),
inference(rw,[status(thm)],[c_0_60,c_0_13]) ).
cnf(c_0_63,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_55]),c_0_22])]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC067+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n028.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:19:52 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.18/0.51 # Version: 3.1.0
% 0.18/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 # Starting sh5l with 300s (1) cores
% 0.18/0.51 # new_bool_3 with pid 1412 completed with status 0
% 0.18/0.51 # Result found by new_bool_3
% 0.18/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1415 completed with status 0
% 0.18/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.51 # Preprocessing time : 0.003 s
% 0.18/0.51 # Presaturation interreduction done
% 0.18/0.51
% 0.18/0.51 # Proof found!
% 0.18/0.51 # SZS status Theorem
% 0.18/0.51 # SZS output start CNFRefutation
% See solution above
% 0.18/0.52 # Parsed axioms : 96
% 0.18/0.52 # Removed by relevancy pruning/SinE : 47
% 0.18/0.52 # Initial clauses : 93
% 0.18/0.52 # Removed in clause preprocessing : 1
% 0.18/0.52 # Initial clauses in saturation : 92
% 0.18/0.52 # Processed clauses : 322
% 0.18/0.52 # ...of these trivial : 2
% 0.18/0.52 # ...subsumed : 28
% 0.18/0.52 # ...remaining for further processing : 292
% 0.18/0.52 # Other redundant clauses eliminated : 15
% 0.18/0.52 # Clauses deleted for lack of memory : 0
% 0.18/0.52 # Backward-subsumed : 26
% 0.18/0.52 # Backward-rewritten : 32
% 0.18/0.52 # Generated clauses : 1089
% 0.18/0.52 # ...of the previous two non-redundant : 1010
% 0.18/0.52 # ...aggressively subsumed : 0
% 0.18/0.52 # Contextual simplify-reflections : 0
% 0.18/0.52 # Paramodulations : 1068
% 0.18/0.52 # Factorizations : 0
% 0.18/0.52 # NegExts : 0
% 0.18/0.52 # Equation resolutions : 19
% 0.18/0.52 # Disequality decompositions : 0
% 0.18/0.52 # Total rewrite steps : 464
% 0.18/0.52 # ...of those cached : 448
% 0.18/0.52 # Propositional unsat checks : 0
% 0.18/0.52 # Propositional check models : 0
% 0.18/0.52 # Propositional check unsatisfiable : 0
% 0.18/0.52 # Propositional clauses : 0
% 0.18/0.52 # Propositional clauses after purity: 0
% 0.18/0.52 # Propositional unsat core size : 0
% 0.18/0.52 # Propositional preprocessing time : 0.000
% 0.18/0.52 # Propositional encoding time : 0.000
% 0.18/0.52 # Propositional solver time : 0.000
% 0.18/0.52 # Success case prop preproc time : 0.000
% 0.18/0.52 # Success case prop encoding time : 0.000
% 0.18/0.52 # Success case prop solver time : 0.000
% 0.18/0.52 # Current number of processed clauses : 136
% 0.18/0.52 # Positive orientable unit clauses : 24
% 0.18/0.52 # Positive unorientable unit clauses: 0
% 0.18/0.52 # Negative unit clauses : 3
% 0.18/0.52 # Non-unit-clauses : 109
% 0.18/0.52 # Current number of unprocessed clauses: 824
% 0.18/0.52 # ...number of literals in the above : 3092
% 0.18/0.52 # Current number of archived formulas : 0
% 0.18/0.52 # Current number of archived clauses : 148
% 0.18/0.52 # Clause-clause subsumption calls (NU) : 3962
% 0.18/0.52 # Rec. Clause-clause subsumption calls : 1719
% 0.18/0.52 # Non-unit clause-clause subsumptions : 30
% 0.18/0.52 # Unit Clause-clause subsumption calls : 146
% 0.18/0.52 # Rewrite failures with RHS unbound : 0
% 0.18/0.52 # BW rewrite match attempts : 2
% 0.18/0.52 # BW rewrite match successes : 2
% 0.18/0.52 # Condensation attempts : 0
% 0.18/0.52 # Condensation successes : 0
% 0.18/0.52 # Termbank termtop insertions : 23005
% 0.18/0.52 # Search garbage collected termcells : 2450
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.032 s
% 0.18/0.52 # System time : 0.006 s
% 0.18/0.52 # Total time : 0.038 s
% 0.18/0.52 # Maximum resident set size: 2164 pages
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.035 s
% 0.18/0.52 # System time : 0.009 s
% 0.18/0.52 # Total time : 0.044 s
% 0.18/0.52 # Maximum resident set size: 1852 pages
% 0.18/0.52 % E---3.1 exiting
% 0.18/0.52 % E exiting
%------------------------------------------------------------------------------