TSTP Solution File: SWC165+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC165+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:49 EDT 2023
% Result : Theorem 0.85s 0.55s
% Output : CNFRefutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 62 ( 18 unt; 0 def)
% Number of atoms : 300 ( 94 equ)
% Maximal formula atoms : 48 ( 4 avg)
% Number of connectives : 373 ( 135 ~; 144 |; 46 &)
% ( 3 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 12 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn; 68 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| neq(X5,X6) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( cons(X9,nil) != X3
| app(app(X10,X3),X11) != X4
| ? [X12] :
( ssItem(X12)
& memberP(X10,X12)
& lt(X9,X12) )
| ? [X13] :
( ssItem(X13)
& memberP(X11,X13)
& lt(X13,X9) ) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.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.bEBvy0GNPx/E---3.1_15652.p',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.p',ax26) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.p',ax1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.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.bEBvy0GNPx/E---3.1_15652.p',ax82) ).
fof(ax71,axiom,
! [X1] :
( ssItem(X1)
=> duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.p',ax71) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.p',ax18) ).
fof(ax13,axiom,
! [X1] :
( ssList(X1)
=> ( duplicatefreeP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> X2 != X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.p',ax13) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.bEBvy0GNPx/E---3.1_15652.p',ax81) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| neq(X5,X6) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( cons(X9,nil) != X3
| app(app(X10,X3),X11) != X4
| ? [X12] :
( ssItem(X12)
& memberP(X10,X12)
& lt(X9,X12) )
| ? [X13] :
( ssItem(X13)
& memberP(X11,X13)
& lt(X13,X9) ) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
! [X269,X270] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& ~ neq(esk52_0,esk53_0)
& ( nil = esk51_0
| ssItem(esk56_0) )
& ( nil = esk50_0
| ssItem(esk56_0) )
& ( nil = esk51_0
| ssList(esk57_0) )
& ( nil = esk50_0
| ssList(esk57_0) )
& ( nil = esk51_0
| ssList(esk58_0) )
& ( nil = esk50_0
| ssList(esk58_0) )
& ( nil = esk51_0
| cons(esk56_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk56_0,nil) = esk50_0 )
& ( nil = esk51_0
| app(app(esk57_0,esk50_0),esk58_0) = esk51_0 )
& ( nil = esk50_0
| app(app(esk57_0,esk50_0),esk58_0) = esk51_0 )
& ( nil = esk51_0
| ~ ssItem(X269)
| ~ memberP(esk57_0,X269)
| ~ lt(esk56_0,X269) )
& ( nil = esk50_0
| ~ ssItem(X269)
| ~ memberP(esk57_0,X269)
| ~ lt(esk56_0,X269) )
& ( nil = esk51_0
| ~ ssItem(X270)
| ~ memberP(esk58_0,X270)
| ~ lt(X270,esk56_0) )
& ( nil = esk50_0
| ~ ssItem(X270)
| ~ memberP(esk58_0,X270)
| ~ lt(X270,esk56_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_11])])])])]) ).
fof(c_0_13,plain,
! [X232,X233] :
( ( nil = X233
| nil != app(X232,X233)
| ~ ssList(X233)
| ~ ssList(X232) )
& ( nil = X232
| nil != app(X232,X233)
| ~ ssList(X233)
| ~ ssList(X232) )
& ( nil != X233
| nil != X232
| nil = app(X232,X233)
| ~ ssList(X233)
| ~ ssList(X232) ) ),
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(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X137,X138] :
( ~ ssList(X137)
| ~ ssList(X138)
| ssList(app(X137,X138)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_20,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil
| esk50_0 != nil
| ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil
| esk50_0 != nil
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X14,X15] :
( ( ~ neq(X14,X15)
| X14 != X15
| ~ ssItem(X15)
| ~ ssItem(X14) )
& ( X14 = X15
| neq(X14,X15)
| ~ ssItem(X15)
| ~ ssItem(X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
cnf(c_0_25,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
! [X118,X119] :
( ~ ssList(X118)
| ~ ssItem(X119)
| ssList(cons(X119,X118)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_28,negated_conjecture,
~ neq(esk52_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_26])]) ).
cnf(c_0_33,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_35,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
fof(c_0_36,plain,
! [X229,X230,X231] :
( ~ ssList(X229)
| ~ ssList(X230)
| ~ ssList(X231)
| app(app(X229,X230),X231) = app(X229,app(X230,X231)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
fof(c_0_37,plain,
! [X212] :
( ~ ssItem(X212)
| duplicatefreeP(cons(X212,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax71])]) ).
fof(c_0_38,plain,
! [X120,X121] :
( ~ ssList(X120)
| ~ ssItem(X121)
| cons(X121,X120) != X120 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_39,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_30])]) ).
fof(c_0_40,plain,
! [X96,X97,X98,X99,X100,X101] :
( ( ~ duplicatefreeP(X96)
| ~ ssItem(X97)
| ~ ssItem(X98)
| ~ ssList(X99)
| ~ ssList(X100)
| ~ ssList(X101)
| app(app(X99,cons(X97,X100)),cons(X98,X101)) != X96
| X97 != X98
| ~ ssList(X96) )
& ( ssItem(esk35_1(X96))
| duplicatefreeP(X96)
| ~ ssList(X96) )
& ( ssItem(esk36_1(X96))
| duplicatefreeP(X96)
| ~ ssList(X96) )
& ( ssList(esk37_1(X96))
| duplicatefreeP(X96)
| ~ ssList(X96) )
& ( ssList(esk38_1(X96))
| duplicatefreeP(X96)
| ~ ssList(X96) )
& ( ssList(esk39_1(X96))
| duplicatefreeP(X96)
| ~ ssList(X96) )
& ( app(app(esk37_1(X96),cons(esk35_1(X96),esk38_1(X96))),cons(esk36_1(X96),esk39_1(X96))) = X96
| duplicatefreeP(X96)
| ~ ssList(X96) )
& ( esk35_1(X96) = esk36_1(X96)
| duplicatefreeP(X96)
| ~ 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)],[ax13])])])])]) ).
cnf(c_0_41,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,nil)),esk55_0) = esk50_0,
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_42,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_43,plain,
! [X227,X228] :
( ~ ssList(X227)
| ~ ssItem(X228)
| cons(X228,X227) = app(cons(X228,nil),X227) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_44,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( nil = esk50_0
| cons(esk56_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk50_0
| ssItem(esk56_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_34]),c_0_31])]) ).
cnf(c_0_49,plain,
( ~ duplicatefreeP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| X2 != X3
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_18])]) ).
cnf(c_0_51,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,negated_conjecture,
( esk50_0 = nil
| duplicatefreeP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_34]),c_0_30])]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_55,plain,
( ~ duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_49])]) ).
cnf(c_0_56,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_18]),c_0_31])]) ).
cnf(c_0_57,negated_conjecture,
duplicatefreeP(esk50_0),
inference(sr,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_54,c_0_15]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]),c_0_18]),c_0_34]),c_0_26]),c_0_31])]) ).
cnf(c_0_60,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_21]),c_0_26])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_33]),c_0_34]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC165+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n007.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Oct 3 01:45:39 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.bEBvy0GNPx/E---3.1_15652.p
% 0.85/0.55 # Version: 3.1pre001
% 0.85/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.85/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.85/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.85/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.85/0.55 # Starting sh5l with 300s (1) cores
% 0.85/0.55 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 15729 completed with status 0
% 0.85/0.55 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.85/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.85/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.85/0.55 # No SInE strategy applied
% 0.85/0.55 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.85/0.55 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.85/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.85/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.85/0.55 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.85/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.85/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.85/0.55 # G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 15739 completed with status 0
% 0.85/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.85/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.85/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.85/0.55 # No SInE strategy applied
% 0.85/0.55 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.85/0.55 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.85/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.85/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.85/0.55 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.85/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.85/0.55 # Preprocessing time : 0.003 s
% 0.85/0.55 # Presaturation interreduction done
% 0.85/0.55
% 0.85/0.55 # Proof found!
% 0.85/0.55 # SZS status Theorem
% 0.85/0.55 # SZS output start CNFRefutation
% See solution above
% 0.85/0.55 # Parsed axioms : 96
% 0.85/0.55 # Removed by relevancy pruning/SinE : 0
% 0.85/0.55 # Initial clauses : 216
% 0.85/0.55 # Removed in clause preprocessing : 2
% 0.85/0.55 # Initial clauses in saturation : 214
% 0.85/0.55 # Processed clauses : 895
% 0.85/0.55 # ...of these trivial : 21
% 0.85/0.55 # ...subsumed : 176
% 0.85/0.55 # ...remaining for further processing : 698
% 0.85/0.55 # Other redundant clauses eliminated : 101
% 0.85/0.55 # Clauses deleted for lack of memory : 0
% 0.85/0.55 # Backward-subsumed : 90
% 0.85/0.55 # Backward-rewritten : 10
% 0.85/0.55 # Generated clauses : 2218
% 0.85/0.55 # ...of the previous two non-redundant : 1908
% 0.85/0.55 # ...aggressively subsumed : 0
% 0.85/0.55 # Contextual simplify-reflections : 71
% 0.85/0.55 # Paramodulations : 2095
% 0.85/0.55 # Factorizations : 0
% 0.85/0.55 # NegExts : 0
% 0.85/0.55 # Equation resolutions : 106
% 0.85/0.55 # Total rewrite steps : 1749
% 0.85/0.55 # Propositional unsat checks : 0
% 0.85/0.55 # Propositional check models : 0
% 0.85/0.55 # Propositional check unsatisfiable : 0
% 0.85/0.55 # Propositional clauses : 0
% 0.85/0.55 # Propositional clauses after purity: 0
% 0.85/0.55 # Propositional unsat core size : 0
% 0.85/0.55 # Propositional preprocessing time : 0.000
% 0.85/0.55 # Propositional encoding time : 0.000
% 0.85/0.55 # Propositional solver time : 0.000
% 0.85/0.55 # Success case prop preproc time : 0.000
% 0.85/0.55 # Success case prop encoding time : 0.000
% 0.85/0.55 # Success case prop solver time : 0.000
% 0.85/0.55 # Current number of processed clauses : 348
% 0.85/0.55 # Positive orientable unit clauses : 54
% 0.85/0.55 # Positive unorientable unit clauses: 0
% 0.85/0.55 # Negative unit clauses : 12
% 0.85/0.55 # Non-unit-clauses : 282
% 0.85/0.55 # Current number of unprocessed clauses: 1353
% 0.85/0.55 # ...number of literals in the above : 8534
% 0.85/0.55 # Current number of archived formulas : 0
% 0.85/0.55 # Current number of archived clauses : 327
% 0.85/0.55 # Clause-clause subsumption calls (NU) : 28748
% 0.85/0.55 # Rec. Clause-clause subsumption calls : 8436
% 0.85/0.55 # Non-unit clause-clause subsumptions : 223
% 0.85/0.55 # Unit Clause-clause subsumption calls : 1250
% 0.85/0.55 # Rewrite failures with RHS unbound : 0
% 0.85/0.55 # BW rewrite match attempts : 14
% 0.85/0.55 # BW rewrite match successes : 13
% 0.85/0.55 # Condensation attempts : 0
% 0.85/0.55 # Condensation successes : 0
% 0.85/0.55 # Termbank termtop insertions : 58975
% 0.85/0.55
% 0.85/0.55 # -------------------------------------------------
% 0.85/0.55 # User time : 0.087 s
% 0.85/0.55 # System time : 0.008 s
% 0.85/0.55 # Total time : 0.095 s
% 0.85/0.55 # Maximum resident set size: 2552 pages
% 0.85/0.55
% 0.85/0.55 # -------------------------------------------------
% 0.85/0.55 # User time : 0.404 s
% 0.85/0.55 # System time : 0.020 s
% 0.85/0.55 # Total time : 0.425 s
% 0.85/0.55 # Maximum resident set size: 1808 pages
% 0.85/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------