TSTP Solution File: SWC115+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC115+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:34 EDT 2023
% Result : Theorem 23.48s 3.40s
% Output : CNFRefutation 23.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 19 unt; 0 def)
% Number of atoms : 278 ( 73 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 341 ( 134 ~; 135 |; 39 &)
% ( 3 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn; 53 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil = X2
& nil = X1 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.p',ax18) ).
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.0EeZIgb4oX/E---3.1_26839.p',ax7) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.p',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.p',ax26) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.p',ax81) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.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.0EeZIgb4oX/E---3.1_26839.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.0EeZIgb4oX/E---3.1_26839.p',ax53) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.p',ax16) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0EeZIgb4oX/E---3.1_26839.p',ax15) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil = X2
& nil = X1 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_13,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil != esk2_0
| nil != esk1_0 )
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk4_0
| ~ ssItem(X12)
| esk5_0 = X12
| ~ memberP(esk4_0,X12)
| ~ leq(X12,esk5_0) )
& ( nil = esk3_0
| ~ ssItem(X12)
| esk5_0 = X12
| ~ memberP(esk4_0,X12)
| ~ leq(X12,esk5_0) )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ) ),
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_12])])])])]) ).
fof(c_0_14,plain,
! [X113,X114] :
( ~ ssList(X113)
| ~ ssItem(X114)
| cons(X114,X113) != X113 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_15,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X13,X14,X17,X18] :
( ( ssList(esk6_2(X13,X14))
| ~ segmentP(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) )
& ( ssList(esk7_2(X13,X14))
| ~ segmentP(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) )
& ( app(app(esk6_2(X13,X14),X14),esk7_2(X13,X14)) = X13
| ~ segmentP(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) )
& ( ~ ssList(X17)
| ~ ssList(X18)
| app(app(X17,X14),X18) != X13
| segmentP(X13,X14)
| ~ ssList(X14)
| ~ ssList(X13) ) ),
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_19,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk4_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_24,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_18]) ).
fof(c_0_25,plain,
! [X40] :
( ~ ssList(X40)
| app(nil,X40) = X40 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_26,plain,
! [X128,X129] :
( ~ ssList(X128)
| ~ ssList(X129)
| ssList(app(X128,X129)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_27,plain,
! [X41,X42] :
( ~ ssList(X41)
| ~ ssItem(X42)
| cons(X42,X41) = app(cons(X42,nil),X41) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]),c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_31,plain,
! [X45] :
( ~ ssList(X45)
| app(X45,nil) = X45 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_32,plain,
! [X96,X97,X100,X101] :
( ( ssList(esk25_2(X96,X97))
| ~ memberP(X96,X97)
| ~ ssItem(X97)
| ~ ssList(X96) )
& ( ssList(esk26_2(X96,X97))
| ~ memberP(X96,X97)
| ~ ssItem(X97)
| ~ ssList(X96) )
& ( app(esk25_2(X96,X97),cons(X97,esk26_2(X96,X97))) = X96
| ~ memberP(X96,X97)
| ~ ssItem(X97)
| ~ ssList(X96) )
& ( ~ ssList(X100)
| ~ ssList(X101)
| app(X100,cons(X97,X101)) != X96
| memberP(X96,X97)
| ~ ssItem(X97)
| ~ ssList(X96) ) ),
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_33,negated_conjecture,
( nil = esk3_0
| memberP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,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_24]) ).
cnf(c_0_36,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_40,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_42,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( app(esk25_2(X1,X2),cons(X2,esk26_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_34,c_0_17]) ).
cnf(c_0_46,plain,
( ssList(esk25_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_47,plain,
! [X19,X20,X21] :
( ~ ssList(X19)
| ~ ssList(X20)
| ~ ssList(X21)
| ~ segmentP(X19,X20)
| ~ segmentP(X20,X21)
| segmentP(X19,X21) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])]) ).
cnf(c_0_48,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_35,c_0_36]),c_0_21])]),c_0_37]) ).
cnf(c_0_49,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_38,c_0_39]),c_0_40])]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_41,c_0_16]) ).
cnf(c_0_51,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_35,c_0_42]),c_0_21])]),c_0_37]) ).
cnf(c_0_52,negated_conjecture,
app(esk25_2(esk4_0,esk5_0),cons(esk5_0,esk26_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_43,c_0_44]),c_0_45]),c_0_40])]) ).
cnf(c_0_53,negated_conjecture,
ssList(esk25_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_45]),c_0_40])]) ).
fof(c_0_54,plain,
! [X111,X112] :
( ~ ssList(X111)
| ~ ssItem(X112)
| ssList(cons(X112,X111)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_55,plain,
( ssList(esk26_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_56,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,negated_conjecture,
( segmentP(cons(esk5_0,X1),esk3_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_58,negated_conjecture,
( ssList(cons(esk5_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_49]),c_0_50])]) ).
cnf(c_0_59,negated_conjecture,
( segmentP(esk4_0,cons(esk5_0,esk26_2(esk4_0,esk5_0)))
| ~ ssList(cons(esk5_0,esk26_2(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_60,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,negated_conjecture,
ssList(esk26_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_44]),c_0_45]),c_0_40])]) ).
cnf(c_0_62,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_63,negated_conjecture,
( segmentP(X1,esk3_0)
| ~ segmentP(X1,cons(esk5_0,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_50])]),c_0_58]) ).
cnf(c_0_64,negated_conjecture,
segmentP(esk4_0,cons(esk5_0,esk26_2(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_40])]) ).
cnf(c_0_65,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_16]),c_0_17]),c_0_16]) ).
cnf(c_0_66,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_63,c_0_64]),c_0_45]),c_0_61])]) ).
fof(c_0_67,plain,
! [X33,X34] :
( ( ~ neq(X33,X34)
| X33 != X34
| ~ ssList(X34)
| ~ ssList(X33) )
& ( X33 = X34
| neq(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_68,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_69,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_70,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_21]),c_0_50])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SWC115+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 02:06:17 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.0EeZIgb4oX/E---3.1_26839.p
% 23.48/3.40 # Version: 3.1pre001
% 23.48/3.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 23.48/3.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.48/3.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 23.48/3.40 # Starting new_bool_3 with 300s (1) cores
% 23.48/3.40 # Starting new_bool_1 with 300s (1) cores
% 23.48/3.40 # Starting sh5l with 300s (1) cores
% 23.48/3.40 # sh5l with pid 26919 completed with status 0
% 23.48/3.40 # Result found by sh5l
% 23.48/3.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 23.48/3.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.48/3.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 23.48/3.40 # Starting new_bool_3 with 300s (1) cores
% 23.48/3.40 # Starting new_bool_1 with 300s (1) cores
% 23.48/3.40 # Starting sh5l with 300s (1) cores
% 23.48/3.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 23.48/3.40 # Search class: FGHSF-FSLM21-MFFFFFNN
% 23.48/3.40 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 23.48/3.40 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 23.48/3.40 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 26922 completed with status 0
% 23.48/3.40 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 23.48/3.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 23.48/3.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.48/3.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 23.48/3.40 # Starting new_bool_3 with 300s (1) cores
% 23.48/3.40 # Starting new_bool_1 with 300s (1) cores
% 23.48/3.40 # Starting sh5l with 300s (1) cores
% 23.48/3.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 23.48/3.40 # Search class: FGHSF-FSLM21-MFFFFFNN
% 23.48/3.40 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 23.48/3.40 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 23.48/3.40 # Preprocessing time : 0.003 s
% 23.48/3.40 # Presaturation interreduction done
% 23.48/3.40
% 23.48/3.40 # Proof found!
% 23.48/3.40 # SZS status Theorem
% 23.48/3.40 # SZS output start CNFRefutation
% See solution above
% 23.48/3.40 # Parsed axioms : 96
% 23.48/3.40 # Removed by relevancy pruning/SinE : 8
% 23.48/3.40 # Initial clauses : 183
% 23.48/3.40 # Removed in clause preprocessing : 2
% 23.48/3.40 # Initial clauses in saturation : 181
% 23.48/3.40 # Processed clauses : 17014
% 23.48/3.40 # ...of these trivial : 195
% 23.48/3.40 # ...subsumed : 12793
% 23.48/3.40 # ...remaining for further processing : 4026
% 23.48/3.40 # Other redundant clauses eliminated : 504
% 23.48/3.40 # Clauses deleted for lack of memory : 0
% 23.48/3.40 # Backward-subsumed : 184
% 23.48/3.40 # Backward-rewritten : 458
% 23.48/3.40 # Generated clauses : 102821
% 23.48/3.40 # ...of the previous two non-redundant : 92434
% 23.48/3.40 # ...aggressively subsumed : 0
% 23.48/3.40 # Contextual simplify-reflections : 1249
% 23.48/3.40 # Paramodulations : 102288
% 23.48/3.40 # Factorizations : 4
% 23.48/3.40 # NegExts : 0
% 23.48/3.40 # Equation resolutions : 527
% 23.48/3.40 # Total rewrite steps : 123938
% 23.48/3.40 # Propositional unsat checks : 0
% 23.48/3.40 # Propositional check models : 0
% 23.48/3.40 # Propositional check unsatisfiable : 0
% 23.48/3.40 # Propositional clauses : 0
% 23.48/3.40 # Propositional clauses after purity: 0
% 23.48/3.40 # Propositional unsat core size : 0
% 23.48/3.40 # Propositional preprocessing time : 0.000
% 23.48/3.40 # Propositional encoding time : 0.000
% 23.48/3.40 # Propositional solver time : 0.000
% 23.48/3.40 # Success case prop preproc time : 0.000
% 23.48/3.40 # Success case prop encoding time : 0.000
% 23.48/3.40 # Success case prop solver time : 0.000
% 23.48/3.40 # Current number of processed clauses : 3186
% 23.48/3.40 # Positive orientable unit clauses : 570
% 23.48/3.40 # Positive unorientable unit clauses: 0
% 23.48/3.40 # Negative unit clauses : 439
% 23.48/3.40 # Non-unit-clauses : 2177
% 23.48/3.40 # Current number of unprocessed clauses: 74792
% 23.48/3.40 # ...number of literals in the above : 464739
% 23.48/3.40 # Current number of archived formulas : 0
% 23.48/3.40 # Current number of archived clauses : 820
% 23.48/3.40 # Clause-clause subsumption calls (NU) : 962043
% 23.48/3.40 # Rec. Clause-clause subsumption calls : 179257
% 23.48/3.40 # Non-unit clause-clause subsumptions : 7324
% 23.48/3.40 # Unit Clause-clause subsumption calls : 58403
% 23.48/3.40 # Rewrite failures with RHS unbound : 0
% 23.48/3.40 # BW rewrite match attempts : 1578
% 23.48/3.40 # BW rewrite match successes : 139
% 23.48/3.40 # Condensation attempts : 0
% 23.48/3.40 # Condensation successes : 0
% 23.48/3.40 # Termbank termtop insertions : 2654699
% 23.48/3.40
% 23.48/3.40 # -------------------------------------------------
% 23.48/3.40 # User time : 2.718 s
% 23.48/3.40 # System time : 0.074 s
% 23.48/3.40 # Total time : 2.792 s
% 23.48/3.40 # Maximum resident set size: 2448 pages
% 23.48/3.40
% 23.48/3.40 # -------------------------------------------------
% 23.48/3.40 # User time : 2.720 s
% 23.48/3.40 # System time : 0.077 s
% 23.48/3.40 # Total time : 2.797 s
% 23.48/3.40 # Maximum resident set size: 1796 pages
% 23.48/3.40 % E---3.1 exiting
%------------------------------------------------------------------------------