TSTP Solution File: SWC093+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC093+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:41:27 EDT 2023
% Result : Theorem 24.76s 3.57s
% Output : CNFRefutation 24.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 72 ( 21 unt; 0 def)
% Number of atoms : 268 ( 46 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 335 ( 139 ~; 129 |; 33 &)
% ( 3 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn; 55 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',co1) ).
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/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax26) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax84) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax3) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax53) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.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.ShV9aq4Oqc/E---3.1_4972.p',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax16) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax55) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax18) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p',ax15) ).
fof(c_0_13,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) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,negated_conjecture,
! [X11] :
( 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(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) )
& ( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ) ),
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_13])])])])]) ).
fof(c_0_15,plain,
! [X66,X67,X70,X71] :
( ( ssList(esk12_2(X66,X67))
| ~ segmentP(X66,X67)
| ~ ssList(X67)
| ~ ssList(X66) )
& ( ssList(esk13_2(X66,X67))
| ~ segmentP(X66,X67)
| ~ ssList(X67)
| ~ ssList(X66) )
& ( app(app(esk12_2(X66,X67),X67),esk13_2(X66,X67)) = X66
| ~ segmentP(X66,X67)
| ~ ssList(X67)
| ~ ssList(X66) )
& ( ~ ssList(X70)
| ~ ssList(X71)
| app(app(X70,X67),X71) != X66
| segmentP(X66,X67)
| ~ ssList(X67)
| ~ ssList(X66) ) ),
inference(distribute,[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_16,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,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_15]) ).
fof(c_0_19,plain,
! [X22] :
( ~ ssList(X22)
| app(nil,X22) = X22 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_20,plain,
! [X84,X85] :
( ~ ssList(X84)
| ~ ssList(X85)
| ssList(app(X84,X85)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_21,plain,
! [X27] :
( ~ ssList(X27)
| app(X27,nil) = X27 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_22,plain,
! [X28,X29,X32,X33] :
( ( ssList(esk8_2(X28,X29))
| ~ memberP(X28,X29)
| ~ ssItem(X29)
| ~ ssList(X28) )
& ( ssList(esk9_2(X28,X29))
| ~ memberP(X28,X29)
| ~ ssItem(X29)
| ~ ssList(X28) )
& ( app(esk8_2(X28,X29),cons(X29,esk9_2(X28,X29))) = X28
| ~ memberP(X28,X29)
| ~ ssItem(X29)
| ~ ssList(X28) )
& ( ~ ssList(X32)
| ~ ssList(X33)
| app(X32,cons(X29,X33)) != X28
| memberP(X28,X29)
| ~ ssItem(X29)
| ~ ssList(X28) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])]) ).
cnf(c_0_23,negated_conjecture,
( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_27,plain,
! [X72,X73,X74] :
( ~ ssList(X72)
| ~ ssList(X73)
| ~ ssList(X74)
| ~ segmentP(X72,X73)
| ~ segmentP(X73,X74)
| segmentP(X72,X74) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])]) ).
cnf(c_0_28,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_18]) ).
cnf(c_0_29,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_31,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_32,plain,
! [X23,X24] :
( ~ ssList(X23)
| ~ ssItem(X24)
| cons(X24,X23) = app(cons(X24,nil),X23) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_33,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_34,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,plain,
( app(esk8_2(X1,X2),cons(X2,esk9_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_38,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24])]) ).
cnf(c_0_39,plain,
( ssList(esk8_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_40,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_41,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_28,c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_42,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_24])]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_46,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_28,c_0_34]),c_0_30])]),c_0_31]) ).
cnf(c_0_47,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),cons(esk5_0,esk9_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_36]),c_0_37]),c_0_38])]) ).
fof(c_0_49,plain,
! [X41,X42] :
( ~ ssList(X41)
| ~ ssItem(X42)
| ssList(cons(X42,X41)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_50,plain,
( ssList(esk9_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_52,plain,
! [X77] :
( ~ ssList(X77)
| segmentP(X77,X77) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_53,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31]) ).
cnf(c_0_54,negated_conjecture,
( app(esk3_0,X1) = cons(esk5_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_38])]) ).
cnf(c_0_55,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( segmentP(esk4_0,cons(esk5_0,esk9_2(esk4_0,esk5_0)))
| ~ ssList(cons(esk5_0,esk9_2(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_57,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk9_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_59,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_45]),c_0_17]) ).
cnf(c_0_60,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_61,negated_conjecture,
( segmentP(X1,esk3_0)
| ~ segmentP(X1,cons(esk5_0,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_62,negated_conjecture,
segmentP(esk4_0,cons(esk5_0,esk9_2(esk4_0,esk5_0))),
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_38])]) ).
fof(c_0_63,plain,
! [X43,X44] :
( ~ ssList(X43)
| ~ ssItem(X44)
| cons(X44,X43) != X43 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_64,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_55])]) ).
cnf(c_0_65,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_37]),c_0_58])]) ).
fof(c_0_66,plain,
! [X15,X16] :
( ( ~ neq(X15,X16)
| X15 != X16
| ~ ssList(X16)
| ~ ssList(X15) )
& ( X15 = X16
| neq(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_69,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_70,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_43]),c_0_30]),c_0_38])]) ).
cnf(c_0_71,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_68,c_0_69]),c_0_30]),c_0_55])]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC093+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 01:45:49 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ShV9aq4Oqc/E---3.1_4972.p
% 24.76/3.57 # Version: 3.1pre001
% 24.76/3.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 24.76/3.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.76/3.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 24.76/3.57 # Starting new_bool_3 with 300s (1) cores
% 24.76/3.57 # Starting new_bool_1 with 300s (1) cores
% 24.76/3.57 # Starting sh5l with 300s (1) cores
% 24.76/3.57 # sh5l with pid 5052 completed with status 0
% 24.76/3.57 # Result found by sh5l
% 24.76/3.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 24.76/3.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.76/3.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 24.76/3.57 # Starting new_bool_3 with 300s (1) cores
% 24.76/3.57 # Starting new_bool_1 with 300s (1) cores
% 24.76/3.57 # Starting sh5l with 300s (1) cores
% 24.76/3.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 24.76/3.57 # Search class: FGHSF-FSLM21-MFFFFFNN
% 24.76/3.57 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 24.76/3.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 24.76/3.57 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 5055 completed with status 0
% 24.76/3.57 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 24.76/3.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 24.76/3.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.76/3.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 24.76/3.57 # Starting new_bool_3 with 300s (1) cores
% 24.76/3.57 # Starting new_bool_1 with 300s (1) cores
% 24.76/3.57 # Starting sh5l with 300s (1) cores
% 24.76/3.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 24.76/3.57 # Search class: FGHSF-FSLM21-MFFFFFNN
% 24.76/3.57 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 24.76/3.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 24.76/3.57 # Preprocessing time : 0.003 s
% 24.76/3.57 # Presaturation interreduction done
% 24.76/3.57
% 24.76/3.57 # Proof found!
% 24.76/3.57 # SZS status Theorem
% 24.76/3.57 # SZS output start CNFRefutation
% See solution above
% 24.76/3.57 # Parsed axioms : 96
% 24.76/3.57 # Removed by relevancy pruning/SinE : 8
% 24.76/3.57 # Initial clauses : 179
% 24.76/3.57 # Removed in clause preprocessing : 2
% 24.76/3.57 # Initial clauses in saturation : 177
% 24.76/3.57 # Processed clauses : 17437
% 24.76/3.57 # ...of these trivial : 185
% 24.76/3.57 # ...subsumed : 13129
% 24.76/3.57 # ...remaining for further processing : 4123
% 24.76/3.57 # Other redundant clauses eliminated : 438
% 24.76/3.57 # Clauses deleted for lack of memory : 0
% 24.76/3.57 # Backward-subsumed : 172
% 24.76/3.57 # Backward-rewritten : 462
% 24.76/3.57 # Generated clauses : 104102
% 24.76/3.57 # ...of the previous two non-redundant : 92961
% 24.76/3.57 # ...aggressively subsumed : 0
% 24.76/3.57 # Contextual simplify-reflections : 1299
% 24.76/3.57 # Paramodulations : 103642
% 24.76/3.57 # Factorizations : 4
% 24.76/3.57 # NegExts : 0
% 24.76/3.57 # Equation resolutions : 457
% 24.76/3.57 # Total rewrite steps : 123725
% 24.76/3.57 # Propositional unsat checks : 0
% 24.76/3.57 # Propositional check models : 0
% 24.76/3.57 # Propositional check unsatisfiable : 0
% 24.76/3.57 # Propositional clauses : 0
% 24.76/3.57 # Propositional clauses after purity: 0
% 24.76/3.57 # Propositional unsat core size : 0
% 24.76/3.57 # Propositional preprocessing time : 0.000
% 24.76/3.57 # Propositional encoding time : 0.000
% 24.76/3.57 # Propositional solver time : 0.000
% 24.76/3.57 # Success case prop preproc time : 0.000
% 24.76/3.57 # Success case prop encoding time : 0.000
% 24.76/3.57 # Success case prop solver time : 0.000
% 24.76/3.57 # Current number of processed clauses : 3298
% 24.76/3.57 # Positive orientable unit clauses : 584
% 24.76/3.57 # Positive unorientable unit clauses: 0
% 24.76/3.57 # Negative unit clauses : 469
% 24.76/3.57 # Non-unit-clauses : 2245
% 24.76/3.57 # Current number of unprocessed clauses: 74941
% 24.76/3.57 # ...number of literals in the above : 470212
% 24.76/3.57 # Current number of archived formulas : 0
% 24.76/3.57 # Current number of archived clauses : 805
% 24.76/3.57 # Clause-clause subsumption calls (NU) : 1455269
% 24.76/3.57 # Rec. Clause-clause subsumption calls : 283437
% 24.76/3.57 # Non-unit clause-clause subsumptions : 7715
% 24.76/3.57 # Unit Clause-clause subsumption calls : 82092
% 24.76/3.57 # Rewrite failures with RHS unbound : 0
% 24.76/3.57 # BW rewrite match attempts : 1827
% 24.76/3.57 # BW rewrite match successes : 117
% 24.76/3.57 # Condensation attempts : 0
% 24.76/3.57 # Condensation successes : 0
% 24.76/3.57 # Termbank termtop insertions : 2723479
% 24.76/3.57
% 24.76/3.57 # -------------------------------------------------
% 24.76/3.57 # User time : 2.982 s
% 24.76/3.57 # System time : 0.078 s
% 24.76/3.57 # Total time : 3.060 s
% 24.76/3.57 # Maximum resident set size: 2444 pages
% 24.76/3.57
% 24.76/3.57 # -------------------------------------------------
% 24.76/3.57 # User time : 2.985 s
% 24.76/3.57 # System time : 0.080 s
% 24.76/3.57 # Total time : 3.065 s
% 24.76/3.57 # Maximum resident set size: 1800 pages
% 24.76/3.57 % E---3.1 exiting
%------------------------------------------------------------------------------