%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC161+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 20:27:03 EDT 2022
% Result : Theorem 0.57s 69.75s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 23 unt; 0 def)
% Number of atoms : 270 ( 58 equ)
% Maximal formula atoms : 40 ( 5 avg)
% Number of connectives : 329 ( 113 ~; 118 |; 59 &)
% ( 1 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 13 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn 70 !; 16 ?)
% 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) ) ) ) ) ) )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ssList(X18)
=> ! [X19] :
( ~ ssList(X19)
| app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19) != X1
| ~ leq(X16,X15)
| ( ! [X20] :
( ~ ssItem(X20)
| ~ memberP(X18,X20)
| ( leq(X15,X20)
& leq(X20,X16) ) )
& leq(X15,X16) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',co1) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(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
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax92,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( leq(X1,X2)
=> ( X1 = X2
| lt(X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax92) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
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) ) ) ) ) ) )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ssList(X18)
=> ! [X19] :
( ~ ssList(X19)
| app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19) != X1
| ~ leq(X16,X15)
| ( ! [X20] :
( ~ ssItem(X20)
| ~ memberP(X18,X20)
| ( leq(X15,X20)
& leq(X20,X16) ) )
& leq(X15,X16) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
! [X27,X28,X29,X30,X31,X32,X33,X34] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssList(esk52_0)
& ssList(esk53_0)
& app(app(esk52_0,esk50_0),esk53_0) = esk51_0
& strictorderedP(esk50_0)
& ( ~ ssItem(X27)
| ~ ssList(X28)
| app(X28,cons(X27,nil)) != esk52_0
| ~ ssItem(X29)
| ~ ssList(X30)
| app(cons(X29,nil),X30) != esk50_0
| ~ lt(X27,X29) )
& ( ~ ssItem(X31)
| ~ ssList(X32)
| app(cons(X31,nil),X32) != esk53_0
| ~ ssItem(X33)
| ~ ssList(X34)
| app(X34,cons(X33,nil)) != esk50_0
| ~ lt(X33,X31) )
& ssItem(esk54_0)
& ssItem(esk55_0)
& ssList(esk56_0)
& ssList(esk57_0)
& ssList(esk58_0)
& app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0) = esk48_0
& leq(esk55_0,esk54_0)
& ( ssItem(esk59_0)
| ~ leq(esk54_0,esk55_0) )
& ( memberP(esk57_0,esk59_0)
| ~ leq(esk54_0,esk55_0) )
& ( ~ leq(esk54_0,esk59_0)
| ~ leq(esk59_0,esk55_0)
| ~ leq(esk54_0,esk55_0) )
& ( nil = esk51_0
| nil != esk50_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0) = esk50_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk57_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])])]) ).
cnf(c_0_19,negated_conjecture,
( app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0) = esk50_0
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])])]) ).
cnf(c_0_24,negated_conjecture,
app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,nil)),esk58_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk58_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
( app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0)) = esk50_0
| ~ ssList(app(esk56_0,cons(esk54_0,esk57_0)))
| ~ ssList(cons(esk55_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])])]) ).
cnf(c_0_31,negated_conjecture,
( app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0)) = esk50_0
| ~ ssList(app(esk56_0,cons(esk54_0,esk57_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21]),c_0_29])]) ).
cnf(c_0_32,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0)) = esk50_0
| ~ ssList(cons(esk54_0,esk57_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]) ).
fof(c_0_34,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ strictorderedP(X7)
| ~ ssItem(X8)
| ~ ssItem(X9)
| ~ ssList(X10)
| ~ ssList(X11)
| ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9)
| ~ ssList(X7) )
& ( ssItem(esk30_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk31_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk32_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk33_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk34_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk32_1(X7),cons(esk30_1(X7),esk33_1(X7))),cons(esk31_1(X7),esk34_1(X7))) = X7
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ~ lt(esk30_1(X7),esk31_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])])])]) ).
cnf(c_0_35,negated_conjecture,
app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_16]),c_0_22])]) ).
fof(c_0_36,plain,
! [X3,X4] :
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ leq(X3,X4)
| X3 = X4
| lt(X3,X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax92])])])])]) ).
cnf(c_0_37,plain,
( lt(X2,X3)
| ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ strictorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,esk58_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_25]),c_0_27]),c_0_29])]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_40,plain,
! [X3,X4] :
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ lt(X3,X4)
| ~ lt(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax33])])])])])]) ).
cnf(c_0_41,plain,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
leq(esk55_0,esk54_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,negated_conjecture,
( lt(esk54_0,esk55_0)
| esk50_0 != X1
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
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(spm,[status(thm)],[c_0_37,c_0_38]),c_0_27]),c_0_16]),c_0_17]),c_0_29]),c_0_22])]) ).
cnf(c_0_44,negated_conjecture,
strictorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_39,c_0_12]) ).
cnf(c_0_46,plain,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( esk55_0 = esk54_0
| lt(esk55_0,esk54_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_22]),c_0_29])]) ).
cnf(c_0_48,negated_conjecture,
lt(esk54_0,esk55_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
( esk55_0 = esk54_0
| ~ lt(esk54_0,esk55_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_29]),c_0_22])]) ).
cnf(c_0_50,negated_conjecture,
~ lt(esk55_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_48]),c_0_22]),c_0_29])]) ).
cnf(c_0_51,negated_conjecture,
esk55_0 = esk54_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_48])]) ).
cnf(c_0_52,negated_conjecture,
~ lt(esk54_0,esk54_0),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_51]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC161+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n007.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 19:39:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.35/23.41 eprover: CPU time limit exceeded, terminating
% 0.35/23.42 eprover: CPU time limit exceeded, terminating
% 0.35/23.42 eprover: CPU time limit exceeded, terminating
% 0.35/23.44 eprover: CPU time limit exceeded, terminating
% 0.46/46.43 eprover: CPU time limit exceeded, terminating
% 0.46/46.44 eprover: CPU time limit exceeded, terminating
% 0.46/46.44 eprover: CPU time limit exceeded, terminating
% 0.46/46.46 eprover: CPU time limit exceeded, terminating
% 0.57/69.44 eprover: CPU time limit exceeded, terminating
% 0.57/69.45 eprover: CPU time limit exceeded, terminating
% 0.57/69.45 eprover: CPU time limit exceeded, terminating
% 0.57/69.47 eprover: CPU time limit exceeded, terminating
% 0.57/69.75 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.57/69.75
% 0.57/69.75 # Failure: Resource limit exceeded (time)
% 0.57/69.75 # OLD status Res
% 0.57/69.75 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.57/69.75 # Preprocessing time : 0.021 s
% 0.57/69.75 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.57/69.75
% 0.57/69.75 # Failure: Resource limit exceeded (time)
% 0.57/69.75 # OLD status Res
% 0.57/69.75 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.57/69.75 # Preprocessing time : 0.011 s
% 0.57/69.75 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.57/69.75
% 0.57/69.75 # Failure: Resource limit exceeded (time)
% 0.57/69.75 # OLD status Res
% 0.57/69.75 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.57/69.75 # Preprocessing time : 0.018 s
% 0.57/69.75 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.57/69.75 # Preprocessing time : 0.026 s
% 0.57/69.75
% 0.57/69.75 # Proof found!
% 0.57/69.75 # SZS status Theorem
% 0.57/69.75 # SZS output start CNFRefutation
% See solution above
% 0.57/69.75 # Proof object total steps : 54
% 0.57/69.75 # Proof object clause steps : 36
% 0.57/69.75 # Proof object formula steps : 18
% 0.57/69.75 # Proof object conjectures : 31
% 0.57/69.75 # Proof object clause conjectures : 28
% 0.57/69.75 # Proof object formula conjectures : 3
% 0.57/69.75 # Proof object initial clauses used : 18
% 0.57/69.75 # Proof object initial formulas used : 9
% 0.57/69.75 # Proof object generating inferences : 13
% 0.57/69.75 # Proof object simplifying inferences : 47
% 0.57/69.75 # Training examples: 0 positive, 0 negative
% 0.57/69.75 # Parsed axioms : 96
% 0.57/69.75 # Removed by relevancy pruning/SinE : 0
% 0.57/69.75 # Initial clauses : 213
% 0.57/69.75 # Removed in clause preprocessing : 2
% 0.57/69.75 # Initial clauses in saturation : 211
% 0.57/69.75 # Processed clauses : 978
% 0.57/69.75 # ...of these trivial : 16
% 0.57/69.75 # ...subsumed : 216
% 0.57/69.75 # ...remaining for further processing : 745
% 0.57/69.75 # Other redundant clauses eliminated : 69
% 0.57/69.75 # Clauses deleted for lack of memory : 0
% 0.57/69.75 # Backward-subsumed : 299
% 0.57/69.75 # Backward-rewritten : 196
% 0.57/69.75 # Generated clauses : 2682
% 0.57/69.75 # ...of the previous two non-trivial : 2500
% 0.57/69.75 # Contextual simplify-reflections : 0
% 0.57/69.75 # Paramodulations : 2587
% 0.57/69.75 # Factorizations : 0
% 0.57/69.75 # Equation resolutions : 94
% 0.57/69.75 # Current number of processed clauses : 243
% 0.57/69.75 # Positive orientable unit clauses : 37
% 0.57/69.75 # Positive unorientable unit clauses: 0
% 0.57/69.75 # Negative unit clauses : 3
% 0.57/69.75 # Non-unit-clauses : 203
% 0.57/69.75 # Current number of unprocessed clauses: 703
% 0.57/69.75 # ...number of literals in the above : 4257
% 0.57/69.75 # Current number of archived formulas : 0
% 0.57/69.75 # Current number of archived clauses : 496
% 0.57/69.75 # Clause-clause subsumption calls (NU) : 23626
% 0.57/69.75 # Rec. Clause-clause subsumption calls : 19473
% 0.57/69.75 # Non-unit clause-clause subsumptions : 515
% 0.57/69.75 # Unit Clause-clause subsumption calls : 794
% 0.57/69.75 # Rewrite failures with RHS unbound : 0
% 0.57/69.75 # BW rewrite match attempts : 230
% 0.57/69.75 # BW rewrite match successes : 40
% 0.57/69.75 # Condensation attempts : 0
% 0.57/69.75 # Condensation successes : 0
% 0.57/69.75 # Termbank termtop insertions : 78149
% 0.57/69.75
% 0.57/69.75 # -------------------------------------------------
% 0.57/69.75 # User time : 0.119 s
% 0.57/69.75 # System time : 0.005 s
% 0.57/69.75 # Total time : 0.124 s
% 0.57/69.75 # Maximum resident set size: 5956 pages
% 0.57/92.46 eprover: CPU time limit exceeded, terminating
% 0.57/92.46 eprover: CPU time limit exceeded, terminating
% 0.57/92.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.47 eprover: No such file or directory
% 0.57/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.57/92.48 eprover: No such file or directory
% 0.57/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.48 eprover: No such file or directory
% 0.57/92.48 eprover: CPU time limit exceeded, terminating
% 0.57/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.48 eprover: No such file or directory
% 0.57/92.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.57/92.48 eprover: No such file or directory
% 0.57/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.49 eprover: No such file or directory
% 0.57/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.57/92.49 eprover: No such file or directory
% 0.57/92.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.49 eprover: No such file or directory
% 0.57/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.50 eprover: No such file or directory
% 0.57/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.57/92.50 eprover: No such file or directory
% 0.57/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.50 eprover: No such file or directory
% 0.57/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.50 eprover: No such file or directory
% 0.57/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.57/92.50 eprover: No such file or directory
% 0.57/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.50 eprover: No such file or directory
% 0.57/92.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.57/92.50 eprover: No such file or directory
% 0.57/92.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.51 eprover: No such file or directory
% 0.57/92.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.57/92.51 eprover: No such file or directory
% 0.57/92.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.51 eprover: No such file or directory
% 0.57/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.52 eprover: No such file or directory
% 0.57/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.57/92.52 eprover: No such file or directory
% 0.57/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.52 eprover: No such file or directory
% 0.57/92.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.52 eprover: No such file or directory
% 0.57/92.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.53 eprover: No such file or directory
% 0.57/92.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/92.53 eprover: No such file or directory
%------------------------------------------------------------------------------