TSTP Solution File: SET018+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET018+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 00:47:48 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of formulae : 56 ( 24 unt; 0 def)
% Number of atoms : 113 ( 70 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 82 ( 25 ~; 46 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 51 ( 9 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ordered_pair_determines_components2,conjecture,
! [X7,X1,X2,X5] :
( ( ordered_pair(X7,X1) = ordered_pair(X2,X5)
& member(X1,universal_class) )
=> X1 = X5 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ordered_pair_determines_components2) ).
fof(ordered_pair_defn,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(unordered_pair,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(c_0_5,negated_conjecture,
~ ! [X7,X1,X2,X5] :
( ( ordered_pair(X7,X1) = ordered_pair(X2,X5)
& member(X1,universal_class) )
=> X1 = X5 ),
inference(assume_negation,[status(cth)],[ordered_pair_determines_components2]) ).
fof(c_0_6,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(singleton(X3),unordered_pair(X3,singleton(X4))),
inference(variable_rename,[status(thm)],[ordered_pair_defn]) ).
fof(c_0_7,plain,
! [X2] : singleton(X2) = unordered_pair(X2,X2),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_8,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X4,universal_class)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 = X5
| X4 = X6
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 != X5
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) )
& ( X4 != X6
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])]) ).
fof(c_0_9,negated_conjecture,
( ordered_pair(esk8_0,esk9_0) = ordered_pair(esk10_0,esk11_0)
& member(esk9_0,universal_class)
& esk9_0 != esk11_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_10,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
ordered_pair(esk8_0,esk9_0) = ordered_pair(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
fof(c_0_15,plain,
! [X3,X4] : member(unordered_pair(X3,X4),universal_class),
inference(variable_rename,[status(thm)],[unordered_pair]) ).
cnf(c_0_16,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))) = unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_18,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
member(unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)),unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
( unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0)
| member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
( unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0)
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0)
| unordered_pair(esk9_0,esk9_0) = esk10_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0)
| unordered_pair(esk9_0,esk9_0) = esk10_0
| member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,esk10_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_23]),c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0)
| unordered_pair(esk9_0,esk9_0) = esk10_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( unordered_pair(esk9_0,esk9_0) = esk10_0
| X1 = esk11_0
| ~ member(X1,unordered_pair(esk9_0,esk9_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
member(esk9_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
esk9_0 != esk11_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
unordered_pair(esk9_0,esk9_0) = esk10_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_27])]),c_0_28]) ).
cnf(c_0_30,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))) = unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,esk10_0)),
inference(rw,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_32,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
member(unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,esk10_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_31]),c_0_18])]) ).
cnf(c_0_34,negated_conjecture,
member(unordered_pair(esk10_0,esk10_0),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,esk10_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_18])]) ).
cnf(c_0_35,negated_conjecture,
( unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk8_0,esk10_0)
| unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk8_0,esk8_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
member(esk10_0,universal_class),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
( unordered_pair(esk8_0,esk10_0) = unordered_pair(esk10_0,esk10_0)
| unordered_pair(esk8_0,esk8_0) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk8_0,esk10_0)
| member(esk10_0,unordered_pair(esk8_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_35]),c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
( unordered_pair(esk8_0,esk10_0) = unordered_pair(esk10_0,esk10_0)
| X1 = esk8_0
| ~ member(X1,unordered_pair(esk10_0,esk10_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk8_0,esk10_0)
| esk8_0 = esk10_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( unordered_pair(esk8_0,esk10_0) = unordered_pair(esk10_0,esk10_0)
| esk8_0 = esk10_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_16]),c_0_36])]) ).
cnf(c_0_42,negated_conjecture,
( esk8_0 = esk10_0
| member(unordered_pair(esk11_0,esk11_0),unordered_pair(esk8_0,esk10_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_40]),c_0_18])]) ).
cnf(c_0_43,negated_conjecture,
( esk8_0 = esk10_0
| member(esk8_0,unordered_pair(esk10_0,esk10_0))
| ~ member(esk8_0,universal_class) ),
inference(spm,[status(thm)],[c_0_32,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk10_0
| unordered_pair(esk11_0,esk11_0) = esk8_0
| esk8_0 = esk10_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( esk8_0 = esk10_0
| ~ member(esk8_0,universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk8_0,esk10_0)
| unordered_pair(esk8_0,esk8_0) != unordered_pair(esk8_0,esk10_0) ),
inference(ef,[status(thm)],[c_0_35]) ).
cnf(c_0_47,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk10_0
| esk8_0 = esk10_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_44]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( member(unordered_pair(esk11_0,esk11_0),unordered_pair(esk8_0,esk10_0))
| unordered_pair(esk8_0,esk8_0) != unordered_pair(esk8_0,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_46]),c_0_18])]) ).
cnf(c_0_49,negated_conjecture,
( esk8_0 = esk10_0
| X1 = esk11_0
| ~ member(X1,esk10_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
member(esk9_0,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_27])]) ).
cnf(c_0_51,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk10_0
| unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk8_0,esk8_0) != unordered_pair(esk8_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
esk8_0 = esk10_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_28]) ).
cnf(c_0_53,negated_conjecture,
unordered_pair(esk11_0,esk11_0) = esk10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52]),c_0_52]),c_0_52])]) ).
cnf(c_0_54,negated_conjecture,
( X1 = esk11_0
| ~ member(X1,esk10_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_50]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET018+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 05:55:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 44
% 0.23/1.41 # Removed by relevancy pruning/SinE : 42
% 0.23/1.41 # Initial clauses : 6
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 6
% 0.23/1.41 # Processed clauses : 15
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 15
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 1
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 13
% 0.23/1.41 # ...of the previous two non-trivial : 9
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 13
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 14
% 0.23/1.41 # Positive orientable unit clauses : 2
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 1
% 0.23/1.41 # Non-unit-clauses : 11
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 1
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 11
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 11
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1008
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.015 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.016 s
% 0.23/1.41 # Maximum resident set size: 2748 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.020 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 56
% 0.23/1.41 # Proof object clause steps : 45
% 0.23/1.41 # Proof object formula steps : 11
% 0.23/1.41 # Proof object conjectures : 39
% 0.23/1.41 # Proof object clause conjectures : 36
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 9
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 30
% 0.23/1.41 # Proof object simplifying inferences : 38
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 44
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 92
% 0.23/1.41 # Removed in clause preprocessing : 8
% 0.23/1.41 # Initial clauses in saturation : 84
% 0.23/1.41 # Processed clauses : 818
% 0.23/1.41 # ...of these trivial : 7
% 0.23/1.41 # ...subsumed : 313
% 0.23/1.41 # ...remaining for further processing : 498
% 0.23/1.41 # Other redundant clauses eliminated : 11
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 33
% 0.23/1.41 # Backward-rewritten : 194
% 0.23/1.41 # Generated clauses : 3947
% 0.23/1.41 # ...of the previous two non-trivial : 3670
% 0.23/1.41 # Contextual simplify-reflections : 188
% 0.23/1.41 # Paramodulations : 3916
% 0.23/1.41 # Factorizations : 17
% 0.23/1.41 # Equation resolutions : 14
% 0.23/1.41 # Current number of processed clauses : 267
% 0.23/1.41 # Positive orientable unit clauses : 40
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 224
% 0.23/1.41 # Current number of unprocessed clauses: 1670
% 0.23/1.41 # ...number of literals in the above : 5017
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 235
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 29524
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 20000
% 0.23/1.41 # Non-unit clause-clause subsumptions : 484
% 0.23/1.41 # Unit Clause-clause subsumption calls : 912
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 33
% 0.23/1.41 # BW rewrite match successes : 10
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 76054
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.128 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.132 s
% 0.23/1.41 # Maximum resident set size: 6804 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------