%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC302+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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.36s 25.55s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 18 unt; 0 def)
% Number of atoms : 214 ( 33 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 261 ( 99 ~; 100 |; 21 &)
% ( 1 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) ) ) ) ) ) ),
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(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(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax92,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( leq(X1,X2)
=> ( X1 = X2
| lt(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax92) ).
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(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& segmentP(esk4_0,esk3_0)
& totalorderedP(esk3_0)
& ssItem(esk5_0)
& ssItem(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0
& lt(esk6_0,esk5_0) ),
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(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_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(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk3_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(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,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_19,negated_conjecture,
( app(app(app(esk7_0,app(cons(esk5_0,nil),esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0
| ~ ssList(cons(esk5_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,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,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(esk14_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk15_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk16_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk17_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk18_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk16_1(X7),cons(esk14_1(X7),esk17_1(X7))),cons(esk15_1(X7),esk18_1(X7))) = X7
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ~ leq(esk14_1(X7),esk15_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_23,negated_conjecture,
( app(app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,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_22]) ).
cnf(c_0_26,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,plain,
( leq(X1,X2)
| ~ totalorderedP(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_25]) ).
cnf(c_0_30,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,esk9_0)) = esk3_0
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_24]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
totalorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_28,c_0_12]) ).
fof(c_0_33,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])])])])]) ).
fof(c_0_34,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])])])])])]) ).
fof(c_0_35,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_36,negated_conjecture,
( leq(esk5_0,esk6_0)
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_24]),c_0_16]),c_0_17]),c_0_27]),c_0_21])]) ).
cnf(c_0_37,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
lt(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,plain,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( leq(esk5_0,esk6_0)
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17])]) ).
cnf(c_0_42,negated_conjecture,
~ lt(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_27]),c_0_21])]) ).
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,
( esk6_0 = esk5_0
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_27]),c_0_21])]),c_0_42]) ).
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,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_47,negated_conjecture,
( esk6_0 = esk5_0
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_27])]) ).
cnf(c_0_48,negated_conjecture,
( esk6_0 = esk5_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_45]),c_0_16]),c_0_21])]) ).
cnf(c_0_49,negated_conjecture,
esk6_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_45]),c_0_46]),c_0_21])]) ).
cnf(c_0_50,negated_conjecture,
~ lt(esk5_0,esk5_0),
inference(rw,[status(thm)],[c_0_42,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC302+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.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 22:27:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/25.55 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.36/25.55
% 0.36/25.55 # Failure: Resource limit exceeded (time)
% 0.36/25.55 # OLD status Res
% 0.36/25.55 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.36/25.55 # Preprocessing time : 0.020 s
% 0.36/25.55 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.36/25.55 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.36/25.55 # Preprocessing time : 0.011 s
% 0.36/25.55
% 0.36/25.55 # Proof found!
% 0.36/25.55 # SZS status Theorem
% 0.36/25.55 # SZS output start CNFRefutation
% See solution above
% 0.36/25.55 # Proof object total steps : 52
% 0.36/25.55 # Proof object clause steps : 34
% 0.36/25.55 # Proof object formula steps : 18
% 0.36/25.55 # Proof object conjectures : 28
% 0.36/25.55 # Proof object clause conjectures : 25
% 0.36/25.55 # Proof object formula conjectures : 3
% 0.36/25.55 # Proof object initial clauses used : 18
% 0.36/25.55 # Proof object initial formulas used : 9
% 0.36/25.55 # Proof object generating inferences : 12
% 0.36/25.55 # Proof object simplifying inferences : 42
% 0.36/25.55 # Training examples: 0 positive, 0 negative
% 0.36/25.55 # Parsed axioms : 96
% 0.36/25.55 # Removed by relevancy pruning/SinE : 62
% 0.36/25.55 # Initial clauses : 72
% 0.36/25.55 # Removed in clause preprocessing : 1
% 0.36/25.55 # Initial clauses in saturation : 71
% 0.36/25.55 # Processed clauses : 6488
% 0.36/25.55 # ...of these trivial : 85
% 0.36/25.55 # ...subsumed : 4671
% 0.36/25.55 # ...remaining for further processing : 1731
% 0.36/25.55 # Other redundant clauses eliminated : 45
% 0.36/25.55 # Clauses deleted for lack of memory : 0
% 0.36/25.55 # Backward-subsumed : 602
% 0.36/25.55 # Backward-rewritten : 620
% 0.36/25.55 # Generated clauses : 29849
% 0.36/25.55 # ...of the previous two non-trivial : 28549
% 0.36/25.55 # Contextual simplify-reflections : 10895
% 0.36/25.55 # Paramodulations : 29758
% 0.36/25.55 # Factorizations : 0
% 0.36/25.55 # Equation resolutions : 88
% 0.36/25.55 # Current number of processed clauses : 507
% 0.36/25.55 # Positive orientable unit clauses : 20
% 0.36/25.55 # Positive unorientable unit clauses: 0
% 0.36/25.55 # Negative unit clauses : 6
% 0.36/25.55 # Non-unit-clauses : 481
% 0.36/25.55 # Current number of unprocessed clauses: 7953
% 0.36/25.55 # ...number of literals in the above : 71212
% 0.36/25.55 # Current number of archived formulas : 0
% 0.36/25.55 # Current number of archived clauses : 1222
% 0.36/25.55 # Clause-clause subsumption calls (NU) : 1149642
% 0.36/25.55 # Rec. Clause-clause subsumption calls : 51817
% 0.36/25.55 # Non-unit clause-clause subsumptions : 13891
% 0.36/25.55 # Unit Clause-clause subsumption calls : 1129
% 0.36/25.55 # Rewrite failures with RHS unbound : 0
% 0.36/25.55 # BW rewrite match attempts : 6
% 0.36/25.55 # BW rewrite match successes : 6
% 0.36/25.55 # Condensation attempts : 0
% 0.36/25.55 # Condensation successes : 0
% 0.36/25.55 # Termbank termtop insertions : 730171
% 0.36/25.55
% 0.36/25.55 # -------------------------------------------------
% 0.36/25.55 # User time : 1.280 s
% 0.36/25.55 # System time : 0.008 s
% 0.36/25.55 # Total time : 1.288 s
% 0.36/25.55 # Maximum resident set size: 25636 pages
% 0.36/46.43 eprover: CPU time limit exceeded, terminating
% 0.36/46.43 eprover: CPU time limit exceeded, terminating
% 0.36/46.44 eprover: CPU time limit exceeded, terminating
% 0.36/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.44 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.49 eprover: No such file or directory
%------------------------------------------------------------------------------