TSTP Solution File: SWC245+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC245+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:35 EDT 2022
% Result : Theorem 0.55s 63.74s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 63 ( 22 unt; 0 def)
% Number of atoms : 270 ( 100 equ)
% Maximal formula atoms : 42 ( 4 avg)
% Number of connectives : 342 ( 135 ~; 135 |; 44 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 92 ( 0 sgn 48 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ! [X9] :
( ~ ssList(X9)
| app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax75,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ? [X2] :
( ssItem(X2)
& hd(X1) = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax75) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
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(ax76,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ? [X2] :
( ssList(X2)
& tl(X1) = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax76) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ! [X9] :
( ~ ssList(X9)
| app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_13,negated_conjecture,
! [X17,X18,X19,X22,X23,X24] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& nil != esk48_0
& ( ssItem(esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X18,esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X19,esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( lt(X17,esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ leq(X17,esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ssList(esk53_0)
& app(esk50_0,esk53_0) = esk51_0
& equalelemsP(esk50_0)
& ( ~ ssItem(X22)
| ~ ssList(X23)
| app(cons(X22,nil),X23) != esk53_0
| ~ ssList(X24)
| app(X24,cons(X22,nil)) != esk50_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_12])])])])])])])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| nil = X3
| hd(app(X3,X4)) = hd(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)],[ax85])])])])]) ).
cnf(c_0_15,negated_conjecture,
app(esk50_0,esk53_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(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)],[ax83])])])])])]) ).
fof(c_0_18,plain,
! [X3] :
( ( ssItem(esk46_1(X3))
| nil = X3
| ~ ssList(X3) )
& ( hd(X3) = esk46_1(X3)
| nil = X3
| ~ ssList(X3) ) ),
inference(distribute,[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)],[ax75])])])])])]) ).
cnf(c_0_19,plain,
( hd(app(X1,X2)) = hd(X1)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
app(esk48_0,esk53_0) = esk51_0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( nil = X1
| hd(X1) = esk46_1(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
hd(esk51_0) = hd(esk48_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
nil != esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_26,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_31,negated_conjecture,
hd(esk48_0) = esk46_1(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
fof(c_0_32,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_33,negated_conjecture,
esk46_1(esk51_0) = esk46_1(esk48_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_27,c_0_31]),c_0_22])]),c_0_23]) ).
fof(c_0_34,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
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])])])])])]) ).
cnf(c_0_36,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
hd(esk48_0) = esk46_1(esk48_0),
inference(rw,[status(thm)],[c_0_31,c_0_33]) ).
fof(c_0_38,plain,
! [X3] :
( ( ssList(esk47_1(X3))
| nil = X3
| ~ ssList(X3) )
& ( tl(X3) = esk47_1(X3)
| nil = X3
| ~ ssList(X3) ) ),
inference(distribute,[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)],[ax76])])])])])]) ).
cnf(c_0_39,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( lt(X1,esk52_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_42,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ leq(X1,esk52_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_44,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_45,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_46,negated_conjecture,
cons(esk46_1(esk48_0),tl(esk48_0)) = esk48_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_36,c_0_37]),c_0_22])]),c_0_23]) ).
cnf(c_0_47,plain,
( nil = X1
| tl(X1) = esk47_1(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,negated_conjecture,
ssItem(hd(esk48_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_39,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_49,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_50,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_52,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
cons(esk46_1(esk48_0),esk47_1(esk48_0)) = esk48_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_46,c_0_47]),c_0_22])]),c_0_23]) ).
cnf(c_0_54,negated_conjecture,
ssItem(esk46_1(esk48_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_48,c_0_27]),c_0_22])]),c_0_23]) ).
cnf(c_0_55,negated_conjecture,
( app(cons(X1,nil),X2) != esk48_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_56,negated_conjecture,
( app(cons(esk46_1(esk48_0),nil),esk47_1(esk48_0)) = esk48_0
| ~ ssList(esk47_1(esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
fof(c_0_57,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_58,negated_conjecture,
( ~ ssList(cons(esk46_1(esk48_0),nil))
| ~ ssList(esk47_1(esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_55,c_0_56]),c_0_54])]) ).
cnf(c_0_59,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_60,negated_conjecture,
~ ssList(esk47_1(esk48_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_58,c_0_59]),c_0_51]),c_0_54])]) ).
cnf(c_0_61,plain,
( nil = X1
| ssList(esk47_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_60,c_0_61]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC245+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.11 % Command : run_ET %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sun Jun 12 04:47:55 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.33/23.38 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.33/23.38
% 0.33/23.38 eprover: CPU time limit exceeded, terminating
% 0.33/23.38 eprover: CPU time limit exceeded, terminating
% 0.47/46.39 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.47/46.39
% 0.47/46.40 eprover: CPU time limit exceeded, terminating
% 0.47/46.40 eprover: CPU time limit exceeded, terminating
% 0.55/63.74 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.55/63.74
% 0.55/63.74 # Failure: Resource limit exceeded (time)
% 0.55/63.74 # OLD status Res
% 0.55/63.74 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.55/63.74 # Preprocessing time : 0.015 s
% 0.55/63.74 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.55/63.74
% 0.55/63.74 # Failure: Resource limit exceeded (time)
% 0.55/63.74 # OLD status Res
% 0.55/63.74 # Preprocessing time : 0.015 s
% 0.55/63.74 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.55/63.74 # Preprocessing time : 0.013 s
% 0.55/63.74
% 0.55/63.74 # Proof found!
% 0.55/63.74 # SZS status Theorem
% 0.55/63.74 # SZS output start CNFRefutation
% See solution above
% 0.55/63.74 # Proof object total steps : 63
% 0.55/63.74 # Proof object clause steps : 39
% 0.55/63.74 # Proof object formula steps : 24
% 0.55/63.74 # Proof object conjectures : 30
% 0.55/63.74 # Proof object clause conjectures : 27
% 0.55/63.74 # Proof object formula conjectures : 3
% 0.55/63.74 # Proof object initial clauses used : 22
% 0.55/63.74 # Proof object initial formulas used : 12
% 0.55/63.74 # Proof object generating inferences : 14
% 0.55/63.74 # Proof object simplifying inferences : 43
% 0.55/63.74 # Training examples: 0 positive, 0 negative
% 0.55/63.74 # Parsed axioms : 96
% 0.55/63.74 # Removed by relevancy pruning/SinE : 0
% 0.55/63.74 # Initial clauses : 207
% 0.55/63.74 # Removed in clause preprocessing : 2
% 0.55/63.74 # Initial clauses in saturation : 205
% 0.55/63.74 # Processed clauses : 7503
% 0.55/63.74 # ...of these trivial : 157
% 0.55/63.74 # ...subsumed : 4237
% 0.55/63.74 # ...remaining for further processing : 3109
% 0.55/63.74 # Other redundant clauses eliminated : 3677
% 0.55/63.74 # Clauses deleted for lack of memory : 677100
% 0.55/63.74 # Backward-subsumed : 115
% 0.55/63.74 # Backward-rewritten : 210
% 0.55/63.74 # Generated clauses : 828781
% 0.55/63.74 # ...of the previous two non-trivial : 814290
% 0.55/63.74 # Contextual simplify-reflections : 5687
% 0.55/63.74 # Paramodulations : 824613
% 0.55/63.74 # Factorizations : 0
% 0.55/63.74 # Equation resolutions : 4066
% 0.55/63.74 # Current number of processed clauses : 2728
% 0.55/63.74 # Positive orientable unit clauses : 48
% 0.55/63.74 # Positive unorientable unit clauses: 0
% 0.55/63.74 # Negative unit clauses : 72
% 0.55/63.74 # Non-unit-clauses : 2608
% 0.55/63.74 # Current number of unprocessed clauses: 103510
% 0.55/63.74 # ...number of literals in the above : 823778
% 0.55/63.74 # Current number of archived formulas : 0
% 0.55/63.74 # Current number of archived clauses : 325
% 0.55/63.74 # Clause-clause subsumption calls (NU) : 1893761
% 0.55/63.74 # Rec. Clause-clause subsumption calls : 166693
% 0.55/63.74 # Non-unit clause-clause subsumptions : 8656
% 0.55/63.74 # Unit Clause-clause subsumption calls : 62000
% 0.55/63.74 # Rewrite failures with RHS unbound : 0
% 0.55/63.74 # BW rewrite match attempts : 17
% 0.55/63.74 # BW rewrite match successes : 17
% 0.55/63.74 # Condensation attempts : 0
% 0.55/63.74 # Condensation successes : 0
% 0.55/63.74 # Termbank termtop insertions : 17753955
% 0.55/63.74
% 0.55/63.74 # -------------------------------------------------
% 0.55/63.74 # User time : 16.413 s
% 0.55/63.74 # System time : 0.149 s
% 0.55/63.74 # Total time : 16.562 s
% 0.55/63.74 # Maximum resident set size: 140720 pages
% 0.55/69.41 eprover: CPU time limit exceeded, terminating
% 0.55/69.42 eprover: CPU time limit exceeded, terminating
% 0.55/69.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.42 eprover: No such file or directory
% 0.55/69.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.43 eprover: No such file or directory
% 0.55/69.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.43 eprover: No such file or directory
% 0.55/69.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.44 eprover: No such file or directory
% 0.55/69.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.44 eprover: No such file or directory
% 0.55/69.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.44 eprover: No such file or directory
% 0.55/69.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.44 eprover: No such file or directory
% 0.55/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.45 eprover: No such file or directory
% 0.55/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.45 eprover: No such file or directory
% 0.55/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.45 eprover: No such file or directory
% 0.55/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.45 eprover: No such file or directory
% 0.55/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.45 eprover: No such file or directory
% 0.55/69.46 eprover: CPU time limit exceeded, terminating
% 0.55/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.46 eprover: No such file or directory
% 0.55/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.46 eprover: No such file or directory
% 0.55/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.46 eprover: No such file or directory
% 0.55/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.46 eprover: No such file or directory
% 0.55/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.55/69.46 eprover: No such file or directory
% 0.55/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.47 eprover: No such file or directory
% 0.55/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.47 eprover: No such file or directory
% 0.55/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.48 eprover: No such file or directory
% 0.55/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.48 eprover: No such file or directory
% 0.55/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.48 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.49 eprover: No such file or directory
% 0.55/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.50 eprover: No such file or directory
% 0.55/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.50 eprover: No such file or directory
% 0.55/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.55/69.50 eprover: No such file or directory
%------------------------------------------------------------------------------