TSTP Solution File: SWC176+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC176+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:09 EDT 2022
% Result : Theorem 0.47s 40.64s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 17 unt; 0 def)
% Number of atoms : 253 ( 52 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 323 ( 117 ~; 118 |; 52 &)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 5 ( 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 : 116 ( 0 sgn 66 !; 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)
=> app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1 ) )
| neq(X15,X16) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax1) ).
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(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax90,axiom,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax90) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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)
=> app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1 ) )
| neq(X15,X16) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
! [X25,X26,X27,X28,X29,X30,X31,X32] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X25)
| ~ ssList(X26)
| app(X26,cons(X25,nil)) != esk5_0
| ~ ssItem(X27)
| ~ ssList(X28)
| app(cons(X27,nil),X28) != esk3_0
| ~ lt(X25,X27) )
& ( ~ ssItem(X29)
| ~ ssList(X30)
| app(cons(X29,nil),X30) != esk6_0
| ~ ssItem(X31)
| ~ ssList(X32)
| app(X32,cons(X31,nil)) != esk3_0
| ~ lt(X31,X29) )
& ssItem(esk7_0)
& ssItem(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& app(app(app(esk9_0,cons(esk7_0,nil)),cons(esk8_0,nil)),esk10_0) = esk1_0
& ~ neq(esk7_0,esk8_0)
& ( nil = esk4_0
| nil != esk3_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_9])])])])])])]) ).
fof(c_0_11,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( X3 = X4
| neq(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)],[ax1])])])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(app(esk9_0,cons(esk7_0,nil)),cons(esk8_0,nil)),esk10_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ neq(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
ssItem(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,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(esk15_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk16_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk17_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk18_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk19_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk17_1(X7),cons(esk15_1(X7),esk18_1(X7))),cons(esk16_1(X7),esk19_1(X7))) = X7
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ~ lt(esk15_1(X7),esk16_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])])])])])])]) ).
fof(c_0_19,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])])])])]) ).
fof(c_0_20,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_21,negated_conjecture,
app(app(app(esk9_0,cons(esk7_0,nil)),cons(esk8_0,nil)),esk10_0) = esk3_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
esk8_0 = esk7_0,
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_23,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_18]) ).
fof(c_0_24,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),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)],[ax27])])])])]) ).
cnf(c_0_25,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
app(app(app(esk9_0,cons(esk7_0,nil)),cons(esk7_0,nil)),esk10_0) = esk3_0,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( app(app(X1,app(X2,X3)),X4) = app(app(X1,X2),app(X3,X4))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_25]),c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( app(app(esk9_0,app(cons(esk7_0,nil),cons(esk7_0,nil))),esk10_0) = esk3_0
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28])]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_35,plain,
! [X2] :
( ~ ssItem(X2)
| ~ lt(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax90])])]) ).
cnf(c_0_36,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),app(cons(X2,X5),X6)))
| ~ ssList(app(app(X3,cons(X1,X4)),app(cons(X2,X5),X6)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]) ).
cnf(c_0_37,negated_conjecture,
( app(app(esk9_0,cons(esk7_0,nil)),app(cons(esk7_0,nil),esk10_0)) = esk3_0
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_28])]) ).
cnf(c_0_38,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_34,c_0_13]) ).
cnf(c_0_40,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_41,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( lt(esk7_0,esk7_0)
| ~ ssList(cons(esk7_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_36,c_0_37]),c_0_38]),c_0_39]),c_0_40]),c_0_28]),c_0_33]),c_0_17])]) ).
fof(c_0_43,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_44,negated_conjecture,
~ ssList(cons(esk7_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_17])]) ).
cnf(c_0_45,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_40]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC176+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n028.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 21:27:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.37/23.43 eprover: CPU time limit exceeded, terminating
% 0.37/23.43 eprover: CPU time limit exceeded, terminating
% 0.37/23.44 eprover: CPU time limit exceeded, terminating
% 0.37/23.54 eprover: CPU time limit exceeded, terminating
% 0.47/40.64 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.47/40.64
% 0.47/40.64 # Failure: Resource limit exceeded (time)
% 0.47/40.64 # OLD status Res
% 0.47/40.64 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.47/40.64 # Preprocessing time : 0.021 s
% 0.47/40.64 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.47/40.64 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.47/40.64 # Preprocessing time : 0.011 s
% 0.47/40.64
% 0.47/40.64 # Proof found!
% 0.47/40.64 # SZS status Theorem
% 0.47/40.64 # SZS output start CNFRefutation
% See solution above
% 0.47/40.64 # Proof object total steps : 47
% 0.47/40.64 # Proof object clause steps : 29
% 0.47/40.64 # Proof object formula steps : 18
% 0.47/40.64 # Proof object conjectures : 21
% 0.47/40.64 # Proof object clause conjectures : 18
% 0.47/40.64 # Proof object formula conjectures : 3
% 0.47/40.64 # Proof object initial clauses used : 17
% 0.47/40.64 # Proof object initial formulas used : 9
% 0.47/40.64 # Proof object generating inferences : 9
% 0.47/40.64 # Proof object simplifying inferences : 25
% 0.47/40.64 # Training examples: 0 positive, 0 negative
% 0.47/40.64 # Parsed axioms : 96
% 0.47/40.64 # Removed by relevancy pruning/SinE : 67
% 0.47/40.64 # Initial clauses : 69
% 0.47/40.64 # Removed in clause preprocessing : 1
% 0.47/40.64 # Initial clauses in saturation : 68
% 0.47/40.64 # Processed clauses : 29418
% 0.47/40.64 # ...of these trivial : 537
% 0.47/40.64 # ...subsumed : 26059
% 0.47/40.64 # ...remaining for further processing : 2822
% 0.47/40.64 # Other redundant clauses eliminated : 30
% 0.47/40.64 # Clauses deleted for lack of memory : 663129
% 0.47/40.64 # Backward-subsumed : 229
% 0.47/40.64 # Backward-rewritten : 15
% 0.47/40.64 # Generated clauses : 840309
% 0.47/40.64 # ...of the previous two non-trivial : 814272
% 0.47/40.64 # Contextual simplify-reflections : 31913
% 0.47/40.64 # Paramodulations : 839981
% 0.47/40.64 # Factorizations : 0
% 0.47/40.64 # Equation resolutions : 226
% 0.47/40.64 # Current number of processed clauses : 2546
% 0.47/40.64 # Positive orientable unit clauses : 24
% 0.47/40.64 # Positive unorientable unit clauses: 0
% 0.47/40.64 # Negative unit clauses : 6
% 0.47/40.64 # Non-unit-clauses : 2516
% 0.47/40.64 # Current number of unprocessed clauses: 110564
% 0.47/40.64 # ...number of literals in the above : 655412
% 0.47/40.64 # Current number of archived formulas : 0
% 0.47/40.64 # Current number of archived clauses : 244
% 0.47/40.64 # Clause-clause subsumption calls (NU) : 9638651
% 0.47/40.64 # Rec. Clause-clause subsumption calls : 4798812
% 0.47/40.64 # Non-unit clause-clause subsumptions : 58191
% 0.47/40.64 # Unit Clause-clause subsumption calls : 2064
% 0.47/40.64 # Rewrite failures with RHS unbound : 0
% 0.47/40.64 # BW rewrite match attempts : 7
% 0.47/40.64 # BW rewrite match successes : 7
% 0.47/40.64 # Condensation attempts : 0
% 0.47/40.64 # Condensation successes : 0
% 0.47/40.64 # Termbank termtop insertions : 21789584
% 0.47/40.64
% 0.47/40.64 # -------------------------------------------------
% 0.47/40.64 # User time : 16.230 s
% 0.47/40.64 # System time : 0.149 s
% 0.47/40.64 # Total time : 16.379 s
% 0.47/40.64 # Maximum resident set size: 141196 pages
% 0.47/46.44 eprover: CPU time limit exceeded, terminating
% 0.47/46.45 eprover: CPU time limit exceeded, terminating
% 0.47/46.45 eprover: CPU time limit exceeded, terminating
% 0.47/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.46 eprover: No such file or directory
% 0.47/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.46 eprover: No such file or directory
% 0.47/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.46 eprover: No such file or directory
% 0.47/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.46 eprover: No such file or directory
% 0.47/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.47 eprover: No such file or directory
% 0.47/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.47 eprover: No such file or directory
% 0.47/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.47 eprover: No such file or directory
% 0.47/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.47 eprover: No such file or directory
% 0.47/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.47 eprover: No such file or directory
% 0.47/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.47 eprover: No such file or directory
% 0.47/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.48 eprover: No such file or directory
% 0.47/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.48 eprover: No such file or directory
% 0.47/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.48 eprover: No such file or directory
% 0.47/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.48 eprover: No such file or directory
% 0.47/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.48 eprover: No such file or directory
% 0.47/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.48 eprover: No such file or directory
% 0.47/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.49 eprover: No such file or directory
% 0.47/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.49 eprover: No such file or directory
% 0.47/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.49 eprover: No such file or directory
% 0.47/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.49 eprover: No such file or directory
% 0.47/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.49 eprover: No such file or directory
% 0.47/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.49 eprover: No such file or directory
% 0.47/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.50 eprover: No such file or directory
% 0.47/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.50 eprover: No such file or directory
% 0.47/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.50 eprover: No such file or directory
% 0.47/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.50 eprover: No such file or directory
% 0.47/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.50 eprover: No such file or directory
% 0.47/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.50 eprover: No such file or directory
% 0.47/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.47/46.51 eprover: No such file or directory
% 0.47/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.47/46.51 eprover: No such file or directory
%------------------------------------------------------------------------------