%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC416+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:28:36 EDT 2022
% Result : Theorem 0.39s 23.55s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 14 unt; 0 def)
% Number of atoms : 234 ( 94 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 298 ( 120 ~; 118 |; 33 &)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 41 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X2 = X5
& ? [X6] :
( ssList(X6)
& app(X6,X1) = X5
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X2) = X7
& neq(nil,X2) ) ) )
| ! [X8] :
( ssItem(X8)
=> app(cons(X8,nil),X3) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
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(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
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(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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X2 = X5
& ? [X6] :
( ssList(X6)
& app(X6,X1) = X5
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X2) = X7
& neq(nil,X2) ) ) )
| ! [X8] :
( ssItem(X8)
=> app(cons(X8,nil),X3) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
! [X13,X14,X15] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X13)
| esk2_0 != X13
| ~ ssList(X14)
| app(X14,esk1_0) != X13
| ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(esk2_0) != X15
| ~ neq(nil,esk2_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| esk2_0 != X13
| ~ ssList(X14)
| app(X14,esk1_0) != X13
| ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(esk2_0) != X15
| ~ neq(nil,esk2_0) )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( app(cons(esk5_0,nil),esk3_0) = esk4_0
| neq(esk2_0,nil) ),
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]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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(cons(esk5_0,nil),esk3_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( app(cons(esk5_0,nil),esk1_0) = esk2_0
| neq(esk2_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| hd(cons(X4,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)],[ax23])])])])]) ).
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(cons(esk5_0,nil),esk1_0) = esk2_0,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12]),c_0_13]),c_0_13]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( hd(cons(esk5_0,nil)) = hd(esk2_0)
| cons(esk5_0,nil) = nil
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_13]),c_0_23])]) ).
fof(c_0_28,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])])])])]) ).
fof(c_0_29,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_30,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != 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)],[ax21])])])])]) ).
cnf(c_0_31,negated_conjecture,
( cons(esk5_0,nil) = nil
| esk5_0 = hd(esk2_0)
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_32,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( ~ neq(nil,esk2_0)
| hd(esk2_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| app(X2,esk1_0) != X3
| ~ ssList(X2)
| esk2_0 != X3
| ~ ssList(X3)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( cons(esk5_0,nil) = nil
| esk5_0 = hd(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_37,negated_conjecture,
( esk1_0 = nil
| esk2_0 != nil
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_21])]) ).
cnf(c_0_38,negated_conjecture,
( cons(X1,nil) != X2
| app(X2,esk1_0) != X3
| hd(esk2_0) != X1
| esk2_0 != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk2_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_13]),c_0_23])]) ).
cnf(c_0_39,negated_conjecture,
esk5_0 = hd(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26]),c_0_27])]) ).
fof(c_0_40,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_41,negated_conjecture,
( esk1_0 = nil
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_42,negated_conjecture,
( app(cons(X1,nil),esk1_0) != X2
| hd(esk2_0) != X1
| esk2_0 != X2
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ neq(nil,esk2_0)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_43,negated_conjecture,
app(cons(hd(esk2_0),nil),esk1_0) = esk2_0,
inference(rw,[status(thm)],[c_0_20,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
ssItem(hd(esk2_0)),
inference(rw,[status(thm)],[c_0_27,c_0_39]) ).
cnf(c_0_45,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( app(cons(esk5_0,nil),nil) = esk2_0
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( esk2_0 != X1
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
fof(c_0_48,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(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)],[ax15])])])])])]) ).
cnf(c_0_49,negated_conjecture,
( cons(esk5_0,nil) = esk2_0
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_26]),c_0_27])]) ).
cnf(c_0_50,negated_conjecture,
( esk2_0 != X1
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_32]),c_0_26]),c_0_44])]) ).
cnf(c_0_51,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_53,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_49]),c_0_26]),c_0_27])]) ).
cnf(c_0_54,negated_conjecture,
( esk2_0 != X1
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_26])]),c_0_53]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_54,c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC416+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n029.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 : Sun Jun 12 23:19:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.39/23.41 eprover: CPU time limit exceeded, terminating
% 0.39/23.42 eprover: CPU time limit exceeded, terminating
% 0.39/23.42 eprover: CPU time limit exceeded, terminating
% 0.39/23.43 eprover: CPU time limit exceeded, terminating
% 0.39/23.55 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.39/23.55
% 0.39/23.55 # Failure: Resource limit exceeded (time)
% 0.39/23.55 # OLD status Res
% 0.39/23.55 # Preprocessing time : 0.026 s
% 0.39/23.55 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.39/23.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.39/23.55 # Preprocessing time : 0.010 s
% 0.39/23.55
% 0.39/23.55 # Proof found!
% 0.39/23.55 # SZS status Theorem
% 0.39/23.55 # SZS output start CNFRefutation
% See solution above
% 0.39/23.55 # Proof object total steps : 56
% 0.39/23.55 # Proof object clause steps : 38
% 0.39/23.55 # Proof object formula steps : 18
% 0.39/23.55 # Proof object conjectures : 33
% 0.39/23.55 # Proof object clause conjectures : 30
% 0.39/23.55 # Proof object formula conjectures : 3
% 0.39/23.55 # Proof object initial clauses used : 17
% 0.39/23.55 # Proof object initial formulas used : 9
% 0.39/23.55 # Proof object generating inferences : 14
% 0.39/23.55 # Proof object simplifying inferences : 46
% 0.39/23.55 # Training examples: 0 positive, 0 negative
% 0.39/23.55 # Parsed axioms : 96
% 0.39/23.55 # Removed by relevancy pruning/SinE : 67
% 0.39/23.55 # Initial clauses : 53
% 0.39/23.55 # Removed in clause preprocessing : 0
% 0.39/23.55 # Initial clauses in saturation : 53
% 0.39/23.55 # Processed clauses : 181
% 0.39/23.55 # ...of these trivial : 9
% 0.39/23.55 # ...subsumed : 68
% 0.39/23.55 # ...remaining for further processing : 104
% 0.39/23.55 # Other redundant clauses eliminated : 2
% 0.39/23.55 # Clauses deleted for lack of memory : 0
% 0.39/23.55 # Backward-subsumed : 18
% 0.39/23.55 # Backward-rewritten : 11
% 0.39/23.55 # Generated clauses : 396
% 0.39/23.55 # ...of the previous two non-trivial : 343
% 0.39/23.55 # Contextual simplify-reflections : 19
% 0.39/23.55 # Paramodulations : 375
% 0.39/23.55 # Factorizations : 1
% 0.39/23.55 # Equation resolutions : 11
% 0.39/23.55 # Current number of processed clauses : 73
% 0.39/23.55 # Positive orientable unit clauses : 11
% 0.39/23.55 # Positive unorientable unit clauses: 0
% 0.39/23.55 # Negative unit clauses : 3
% 0.39/23.55 # Non-unit-clauses : 59
% 0.39/23.55 # Current number of unprocessed clauses: 139
% 0.39/23.55 # ...number of literals in the above : 774
% 0.39/23.55 # Current number of archived formulas : 0
% 0.39/23.55 # Current number of archived clauses : 29
% 0.39/23.55 # Clause-clause subsumption calls (NU) : 1005
% 0.39/23.55 # Rec. Clause-clause subsumption calls : 371
% 0.39/23.55 # Non-unit clause-clause subsumptions : 61
% 0.39/23.55 # Unit Clause-clause subsumption calls : 26
% 0.39/23.55 # Rewrite failures with RHS unbound : 0
% 0.39/23.55 # BW rewrite match attempts : 3
% 0.39/23.55 # BW rewrite match successes : 3
% 0.39/23.55 # Condensation attempts : 0
% 0.39/23.55 # Condensation successes : 0
% 0.39/23.55 # Termbank termtop insertions : 9928
% 0.39/23.55
% 0.39/23.55 # -------------------------------------------------
% 0.39/23.55 # User time : 0.020 s
% 0.39/23.55 # System time : 0.002 s
% 0.39/23.55 # Total time : 0.022 s
% 0.39/23.55 # Maximum resident set size: 3440 pages
% 0.39/46.43 eprover: CPU time limit exceeded, terminating
% 0.39/46.43 eprover: CPU time limit exceeded, terminating
% 0.39/46.44 eprover: CPU time limit exceeded, terminating
% 0.39/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.44 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.49 eprover: No such file or directory
% 0.39/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.49 eprover: No such file or directory
% 0.39/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.49 eprover: No such file or directory
%------------------------------------------------------------------------------