TSTP Solution File: SWC075+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC075+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:21 EDT 2023
% Result : Theorem 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 25 unt; 0 def)
% Number of atoms : 255 ( 94 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 304 ( 126 ~; 121 |; 28 &)
% ( 3 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn; 49 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(X6,X7) != X4
| app(X7,X6) != X3 ) )
| ( nil = X2
& nil = X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax83) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax15) ).
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/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax7) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax17) ).
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/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax82) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax84) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax26) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax80) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.niCRm3xQUv/E---3.1_9264.p',ax55) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(X6,X7) != X4
| app(X7,X6) != X3 ) )
| ( nil = X2
& nil = X1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_12,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk2_0,X12)
| ~ segmentP(esk1_0,X12) )
& ssList(esk5_0)
& ssList(esk6_0)
& app(esk5_0,esk6_0) = esk4_0
& app(esk6_0,esk5_0) = esk3_0
& ( nil != esk2_0
| nil != esk1_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_13,plain,
! [X37,X38] :
( ( nil = X38
| nil != app(X37,X38)
| ~ ssList(X38)
| ~ ssList(X37) )
& ( nil = X37
| nil != app(X37,X38)
| ~ ssList(X38)
| ~ ssList(X37) )
& ( nil != X38
| nil != X37
| nil = app(X37,X38)
| ~ ssList(X38)
| ~ ssList(X37) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_14,negated_conjecture,
app(esk6_0,esk5_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X60,X61] :
( ( ~ neq(X60,X61)
| X60 != X61
| ~ ssList(X61)
| ~ ssList(X60) )
& ( X60 = X61
| neq(X60,X61)
| ~ ssList(X61)
| ~ ssList(X60) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
fof(c_0_17,plain,
! [X40,X41,X44,X45] :
( ( ssList(esk9_2(X40,X41))
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( ssList(esk10_2(X40,X41))
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( app(app(esk9_2(X40,X41),X41),esk10_2(X40,X41)) = X40
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( ~ ssList(X44)
| ~ ssList(X45)
| app(app(X44,X41),X45) != X40
| segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) ) ),
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_18,negated_conjecture,
app(esk5_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
app(esk6_0,esk5_0) = esk1_0,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,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_17]) ).
cnf(c_0_27,negated_conjecture,
app(esk5_0,esk6_0) = esk2_0,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( esk5_0 = nil
| esk1_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_29,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_31,plain,
! [X34,X35,X36] :
( ~ ssList(X34)
| ~ ssList(X35)
| ~ ssList(X36)
| app(app(X34,X35),X36) = app(X34,app(X35,X36)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_32,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,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_26]) ).
fof(c_0_34,plain,
! [X39] :
( ~ ssList(X39)
| app(X39,nil) = X39 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_35,plain,
! [X25] :
( ~ ssList(X25)
| app(nil,X25) = X25 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_36,plain,
! [X20,X21] :
( ~ ssList(X20)
| ~ ssList(X21)
| ssList(app(X20,X21)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_37,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_27]),c_0_23]),c_0_22])]) ).
cnf(c_0_38,negated_conjecture,
( app(nil,esk6_0) = esk2_0
| esk1_0 != nil ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_39,negated_conjecture,
( esk6_0 = nil
| esk1_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_23]),c_0_22])]) ).
cnf(c_0_40,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])]),c_0_25])]) ).
cnf(c_0_41,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_42,plain,
! [X29,X30,X31] :
( ~ ssList(X29)
| ~ ssList(X30)
| ~ ssList(X31)
| app(X30,X31) != app(X30,X29)
| X31 = X29 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])]) ).
cnf(c_0_43,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
( esk6_0 = nil
| neq(esk6_0,nil) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_46,negated_conjecture,
( segmentP(app(esk2_0,X1),esk6_0)
| ~ ssList(app(esk2_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_22]),c_0_23])]) ).
cnf(c_0_47,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_49,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_50,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_51,negated_conjecture,
( app(nil,esk5_0) = esk1_0
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_21,c_0_37]) ).
cnf(c_0_52,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_29,c_0_27]),c_0_22]),c_0_23])]) ).
cnf(c_0_53,negated_conjecture,
esk1_0 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]) ).
cnf(c_0_54,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_55,negated_conjecture,
( app(esk6_0,app(esk5_0,X1)) = app(esk1_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_21]),c_0_23]),c_0_22])]) ).
cnf(c_0_56,negated_conjecture,
( esk6_0 = nil
| ~ segmentP(esk1_0,esk6_0)
| ~ segmentP(esk2_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_22])]) ).
cnf(c_0_57,negated_conjecture,
segmentP(esk2_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_25])]) ).
cnf(c_0_58,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_33,c_0_49]),c_0_25])]),c_0_50]) ).
cnf(c_0_59,negated_conjecture,
esk2_0 != nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_40]),c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( X1 = esk5_0
| app(esk6_0,X1) != esk1_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_21]),c_0_23]),c_0_22])]) ).
cnf(c_0_61,negated_conjecture,
app(esk6_0,esk2_0) = app(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_27]),c_0_22])]) ).
cnf(c_0_62,negated_conjecture,
( esk6_0 = nil
| ~ segmentP(esk1_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).
cnf(c_0_63,negated_conjecture,
segmentP(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_64,negated_conjecture,
neq(esk2_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_48]),c_0_59]) ).
fof(c_0_65,plain,
! [X51] :
( ~ ssList(X51)
| segmentP(X51,X51) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_66,negated_conjecture,
( segmentP(app(esk1_0,X1),esk5_0)
| ~ ssList(app(esk1_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_21]),c_0_23]),c_0_22])]) ).
cnf(c_0_67,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_68,negated_conjecture,
( esk5_0 = esk2_0
| app(esk1_0,esk6_0) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_48])]) ).
cnf(c_0_69,negated_conjecture,
esk6_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]) ).
cnf(c_0_70,negated_conjecture,
app(esk1_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_47]),c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_71,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_44,c_0_64]),c_0_48])]) ).
cnf(c_0_72,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_73,negated_conjecture,
segmentP(esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_47]),c_0_67]),c_0_25])]) ).
cnf(c_0_74,negated_conjecture,
esk5_0 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_75,negated_conjecture,
~ segmentP(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_48])]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC075+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:18:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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/tmp/tmp.niCRm3xQUv/E---3.1_9264.p
% 0.19/0.55 # Version: 3.1pre001
% 0.19/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.55 # Starting sh5l with 300s (1) cores
% 0.19/0.55 # new_bool_3 with pid 9343 completed with status 0
% 0.19/0.55 # Result found by new_bool_3
% 0.19/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9347 completed with status 0
% 0.19/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.55 # Preprocessing time : 0.002 s
% 0.19/0.55 # Presaturation interreduction done
% 0.19/0.55
% 0.19/0.55 # Proof found!
% 0.19/0.55 # SZS status Theorem
% 0.19/0.55 # SZS output start CNFRefutation
% See solution above
% 0.19/0.55 # Parsed axioms : 96
% 0.19/0.55 # Removed by relevancy pruning/SinE : 70
% 0.19/0.55 # Initial clauses : 50
% 0.19/0.55 # Removed in clause preprocessing : 0
% 0.19/0.55 # Initial clauses in saturation : 50
% 0.19/0.55 # Processed clauses : 716
% 0.19/0.55 # ...of these trivial : 42
% 0.19/0.55 # ...subsumed : 254
% 0.19/0.55 # ...remaining for further processing : 420
% 0.19/0.55 # Other redundant clauses eliminated : 18
% 0.19/0.55 # Clauses deleted for lack of memory : 0
% 0.19/0.55 # Backward-subsumed : 47
% 0.19/0.55 # Backward-rewritten : 143
% 0.19/0.55 # Generated clauses : 2417
% 0.19/0.55 # ...of the previous two non-redundant : 2243
% 0.19/0.55 # ...aggressively subsumed : 0
% 0.19/0.55 # Contextual simplify-reflections : 17
% 0.19/0.55 # Paramodulations : 2394
% 0.19/0.55 # Factorizations : 0
% 0.19/0.55 # NegExts : 0
% 0.19/0.55 # Equation resolutions : 22
% 0.19/0.55 # Total rewrite steps : 2284
% 0.19/0.55 # Propositional unsat checks : 0
% 0.19/0.55 # Propositional check models : 0
% 0.19/0.55 # Propositional check unsatisfiable : 0
% 0.19/0.55 # Propositional clauses : 0
% 0.19/0.55 # Propositional clauses after purity: 0
% 0.19/0.55 # Propositional unsat core size : 0
% 0.19/0.55 # Propositional preprocessing time : 0.000
% 0.19/0.55 # Propositional encoding time : 0.000
% 0.19/0.55 # Propositional solver time : 0.000
% 0.19/0.55 # Success case prop preproc time : 0.000
% 0.19/0.55 # Success case prop encoding time : 0.000
% 0.19/0.55 # Success case prop solver time : 0.000
% 0.19/0.55 # Current number of processed clauses : 175
% 0.19/0.55 # Positive orientable unit clauses : 42
% 0.19/0.55 # Positive unorientable unit clauses: 0
% 0.19/0.55 # Negative unit clauses : 11
% 0.19/0.55 # Non-unit-clauses : 122
% 0.19/0.55 # Current number of unprocessed clauses: 1559
% 0.19/0.55 # ...number of literals in the above : 6953
% 0.19/0.55 # Current number of archived formulas : 0
% 0.19/0.55 # Current number of archived clauses : 240
% 0.19/0.55 # Clause-clause subsumption calls (NU) : 12434
% 0.19/0.55 # Rec. Clause-clause subsumption calls : 7214
% 0.19/0.55 # Non-unit clause-clause subsumptions : 196
% 0.19/0.55 # Unit Clause-clause subsumption calls : 985
% 0.19/0.55 # Rewrite failures with RHS unbound : 0
% 0.19/0.55 # BW rewrite match attempts : 16
% 0.19/0.55 # BW rewrite match successes : 9
% 0.19/0.55 # Condensation attempts : 0
% 0.19/0.55 # Condensation successes : 0
% 0.19/0.55 # Termbank termtop insertions : 41085
% 0.19/0.55
% 0.19/0.55 # -------------------------------------------------
% 0.19/0.55 # User time : 0.063 s
% 0.19/0.55 # System time : 0.005 s
% 0.19/0.55 # Total time : 0.068 s
% 0.19/0.55 # Maximum resident set size: 2036 pages
% 0.19/0.55
% 0.19/0.55 # -------------------------------------------------
% 0.19/0.55 # User time : 0.067 s
% 0.19/0.55 # System time : 0.006 s
% 0.19/0.55 # Total time : 0.073 s
% 0.19/0.55 # Maximum resident set size: 1796 pages
% 0.19/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------