TSTP Solution File: SWC303+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC303+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:55 EDT 2022
% Result : Theorem 0.70s 69.86s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 24 unt; 0 def)
% Number of atoms : 250 ( 54 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 306 ( 113 ~; 111 |; 42 &)
% ( 2 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 66 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X4 != X2
| X3 != X1
| ! [X5] :
( ~ ssList(X5)
| app(X3,X5) != X4
| ~ totalorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& leq(X8,X6) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ~ ssList(X14)
| app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ lt(X11,X10) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(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
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(ax29,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( ( leq(X1,X2)
& leq(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax29) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X4 != X2
| X3 != X1
| ! [X5] :
( ~ ssList(X5)
| app(X3,X5) != X4
| ~ totalorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& leq(X8,X6) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ~ ssList(X14)
| app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ lt(X11,X10) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
! [X20,X21,X22,X23] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk51_0 = esk49_0
& esk50_0 = esk48_0
& ssList(esk52_0)
& app(esk50_0,esk52_0) = esk51_0
& totalorderedP(esk50_0)
& ( ~ ssItem(X20)
| ~ ssList(X21)
| app(cons(X20,nil),X21) != esk52_0
| ~ ssItem(X22)
| ~ ssList(X23)
| app(X23,cons(X22,nil)) != esk50_0
| ~ leq(X22,X20) )
& ssItem(esk53_0)
& ssItem(esk54_0)
& ssList(esk55_0)
& ssList(esk56_0)
& ssList(esk57_0)
& app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk48_0
& lt(esk54_0,esk53_0)
& ( nil = esk51_0
| nil != esk50_0 ) ),
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_10])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_13,negated_conjecture,
esk50_0 = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,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_15,negated_conjecture,
app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk50_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,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_20,negated_conjecture,
( app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_23,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_24,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_25,negated_conjecture,
app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0,
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_26,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk57_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(app(esk55_0,cons(esk53_0,esk56_0)))
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_27]),c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_31,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_32,negated_conjecture,
( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(app(esk55_0,cons(esk53_0,esk56_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_22]),c_0_30])]) ).
cnf(c_0_33,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(cons(esk53_0,esk56_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18])]) ).
fof(c_0_35,plain,
! [X3,X4] :
( ( X3 != X4
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( leq(X3,X4)
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) ) ),
inference(distribute,[status(thm)],[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)],[ax93])])])])])]) ).
fof(c_0_36,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ totalorderedP(X7)
| ~ ssItem(X8)
| ~ ssItem(X9)
| ~ ssList(X10)
| ~ ssList(X11)
| ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9)
| ~ ssList(X7) )
& ( ssItem(esk25_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk26_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk27_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk28_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk29_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk27_1(X7),cons(esk25_1(X7),esk28_1(X7))),cons(esk26_1(X7),esk29_1(X7))) = X7
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ~ leq(esk25_1(X7),esk26_1(X7))
| totalorderedP(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)],[ax11])])])])])])]) ).
cnf(c_0_37,negated_conjecture,
app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_21]),c_0_17]),c_0_23])]) ).
fof(c_0_38,plain,
! [X3,X4] :
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ leq(X3,X4)
| ~ leq(X4,X3)
| 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)],[ax29])])])])]) ).
cnf(c_0_39,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
lt(esk54_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,plain,
( leq(X2,X3)
| ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_28]),c_0_30])]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_44,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_45,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,negated_conjecture,
leq(esk54_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_23]),c_0_30])]) ).
cnf(c_0_47,negated_conjecture,
( leq(esk53_0,esk54_0)
| esk50_0 != X1
| ~ totalorderedP(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_41,c_0_42]),c_0_28]),c_0_17]),c_0_18]),c_0_30]),c_0_23])]) ).
cnf(c_0_48,negated_conjecture,
totalorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_43,c_0_13]) ).
cnf(c_0_50,plain,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( esk54_0 = esk53_0
| ~ leq(esk53_0,esk54_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_30]),c_0_23])]) ).
cnf(c_0_52,negated_conjecture,
leq(esk53_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_53,negated_conjecture,
~ lt(esk53_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_40]),c_0_30]),c_0_23])]) ).
cnf(c_0_54,negated_conjecture,
esk54_0 = esk53_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_55,negated_conjecture,
~ lt(esk53_0,esk53_0),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC303+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 21:10:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.41/23.43 eprover: CPU time limit exceeded, terminating
% 0.41/23.43 eprover: CPU time limit exceeded, terminating
% 0.41/23.43 eprover: CPU time limit exceeded, terminating
% 0.41/23.44 eprover: CPU time limit exceeded, terminating
% 0.55/46.44 eprover: CPU time limit exceeded, terminating
% 0.55/46.45 eprover: CPU time limit exceeded, terminating
% 0.55/46.45 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.55/46.45
% 0.70/69.46 eprover: CPU time limit exceeded, terminating
% 0.70/69.47 eprover: eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.70/69.47
% 0.70/69.47
% 0.70/69.86 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.70/69.86
% 0.70/69.86 # Failure: Resource limit exceeded (time)
% 0.70/69.86 # OLD status Res
% 0.70/69.86 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.70/69.86 # Preprocessing time : 0.021 s
% 0.70/69.86 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.70/69.86
% 0.70/69.86 # Failure: Resource limit exceeded (time)
% 0.70/69.86 # OLD status Res
% 0.70/69.86 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.70/69.86 # Preprocessing time : 0.012 s
% 0.70/69.86 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.70/69.86
% 0.70/69.86 # Failure: Resource limit exceeded (time)
% 0.70/69.86 # OLD status Res
% 0.70/69.86 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.70/69.86 # Preprocessing time : 0.023 s
% 0.70/69.86 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.70/69.86 # Preprocessing time : 0.015 s
% 0.70/69.86
% 0.70/69.86 # Proof found!
% 0.70/69.86 # SZS status Theorem
% 0.70/69.86 # SZS output start CNFRefutation
% See solution above
% 0.70/69.86 # Proof object total steps : 57
% 0.70/69.86 # Proof object clause steps : 37
% 0.70/69.86 # Proof object formula steps : 20
% 0.70/69.86 # Proof object conjectures : 31
% 0.70/69.86 # Proof object clause conjectures : 28
% 0.70/69.86 # Proof object formula conjectures : 3
% 0.70/69.86 # Proof object initial clauses used : 19
% 0.70/69.86 # Proof object initial formulas used : 10
% 0.70/69.86 # Proof object generating inferences : 13
% 0.70/69.86 # Proof object simplifying inferences : 47
% 0.70/69.86 # Training examples: 0 positive, 0 negative
% 0.70/69.86 # Parsed axioms : 96
% 0.70/69.86 # Removed by relevancy pruning/SinE : 0
% 0.70/69.86 # Initial clauses : 208
% 0.70/69.86 # Removed in clause preprocessing : 2
% 0.70/69.86 # Initial clauses in saturation : 206
% 0.70/69.86 # Processed clauses : 958
% 0.70/69.86 # ...of these trivial : 16
% 0.70/69.86 # ...subsumed : 216
% 0.70/69.86 # ...remaining for further processing : 725
% 0.70/69.86 # Other redundant clauses eliminated : 69
% 0.70/69.86 # Clauses deleted for lack of memory : 0
% 0.70/69.86 # Backward-subsumed : 289
% 0.70/69.86 # Backward-rewritten : 193
% 0.70/69.86 # Generated clauses : 2670
% 0.70/69.86 # ...of the previous two non-trivial : 2474
% 0.70/69.86 # Contextual simplify-reflections : 0
% 0.70/69.86 # Paramodulations : 2577
% 0.70/69.86 # Factorizations : 0
% 0.70/69.86 # Equation resolutions : 93
% 0.70/69.86 # Current number of processed clauses : 237
% 0.70/69.86 # Positive orientable unit clauses : 32
% 0.70/69.86 # Positive unorientable unit clauses: 0
% 0.70/69.86 # Negative unit clauses : 3
% 0.70/69.86 # Non-unit-clauses : 202
% 0.70/69.86 # Current number of unprocessed clauses: 699
% 0.70/69.86 # ...number of literals in the above : 4246
% 0.70/69.86 # Current number of archived formulas : 0
% 0.70/69.86 # Current number of archived clauses : 482
% 0.70/69.86 # Clause-clause subsumption calls (NU) : 19069
% 0.70/69.86 # Rec. Clause-clause subsumption calls : 15429
% 0.70/69.86 # Non-unit clause-clause subsumptions : 505
% 0.70/69.86 # Unit Clause-clause subsumption calls : 971
% 0.70/69.86 # Rewrite failures with RHS unbound : 0
% 0.70/69.86 # BW rewrite match attempts : 230
% 0.70/69.86 # BW rewrite match successes : 40
% 0.70/69.86 # Condensation attempts : 0
% 0.70/69.86 # Condensation successes : 0
% 0.70/69.86 # Termbank termtop insertions : 77206
% 0.70/69.86
% 0.70/69.86 # -------------------------------------------------
% 0.70/69.86 # User time : 0.061 s
% 0.70/69.86 # System time : 0.005 s
% 0.70/69.86 # Total time : 0.066 s
% 0.70/69.86 # Maximum resident set size: 5900 pages
% 0.70/92.47 eprover: CPU time limit exceeded, terminating
% 0.70/92.48 eprover: CPU time limit exceeded, terminating
% 0.70/92.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.49 eprover: No such file or directory
% 0.70/92.49 eprover: CPU time limit exceeded, terminating
% 0.70/92.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.50 eprover: No such file or directory
% 0.70/92.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.50 eprover: No such file or directory
% 0.70/92.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.50 eprover: No such file or directory
% 0.70/92.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.50 eprover: No such file or directory
% 0.70/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.51 eprover: No such file or directory
% 0.70/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.70/92.51 eprover: No such file or directory
% 0.70/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.51 eprover: No such file or directory
% 0.70/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.51 eprover: No such file or directory
% 0.70/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.70/92.51 eprover: No such file or directory
% 0.70/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.52 eprover: No such file or directory
% 0.70/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.52 eprover: No such file or directory
% 0.70/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.52 eprover: No such file or directory
% 0.70/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.52 eprover: No such file or directory
% 0.70/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.70/92.52 eprover: No such file or directory
% 0.70/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.52 eprover: No such file or directory
% 0.70/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.70/92.52 eprover: No such file or directory
% 0.70/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.53 eprover: No such file or directory
% 0.70/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.70/92.53 eprover: No such file or directory
% 0.70/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.70/92.53 eprover: No such file or directory
% 0.70/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.53 eprover: No such file or directory
% 0.70/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.70/92.54 eprover: No such file or directory
% 0.70/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/92.54 eprover: No such file or directory
% 0.70/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.70/92.54 eprover: No such file or directory
%------------------------------------------------------------------------------