TSTP Solution File: SEU244+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU244+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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 09:18:14 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 65 ( 14 unt; 0 def)
% Number of atoms : 226 ( 0 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 271 ( 110 ~; 118 |; 25 &)
% ( 9 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 47 ( 1 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( well_orders(X1,relation_field(X1))
<=> well_ordering(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t8_wellord1) ).
fof(d5_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( well_orders(X1,X2)
<=> ( is_reflexive_in(X1,X2)
& is_transitive_in(X1,X2)
& is_antisymmetric_in(X1,X2)
& is_connected_in(X1,X2)
& is_well_founded_in(X1,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d5_wellord1) ).
fof(d4_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d4_wellord1) ).
fof(d16_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> is_transitive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d16_relat_2) ).
fof(d12_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> is_antisymmetric_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d12_relat_2) ).
fof(d9_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> is_reflexive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d9_relat_2) ).
fof(d14_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> is_connected_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d14_relat_2) ).
fof(t5_wellord1,lemma,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t5_wellord1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( well_orders(X1,relation_field(X1))
<=> well_ordering(X1) ) ),
inference(assume_negation,[status(cth)],[t8_wellord1]) ).
fof(c_0_9,plain,
! [X3,X4,X4] :
( ( is_reflexive_in(X3,X4)
| ~ well_orders(X3,X4)
| ~ relation(X3) )
& ( is_transitive_in(X3,X4)
| ~ well_orders(X3,X4)
| ~ relation(X3) )
& ( is_antisymmetric_in(X3,X4)
| ~ well_orders(X3,X4)
| ~ relation(X3) )
& ( is_connected_in(X3,X4)
| ~ well_orders(X3,X4)
| ~ relation(X3) )
& ( is_well_founded_in(X3,X4)
| ~ well_orders(X3,X4)
| ~ relation(X3) )
& ( ~ is_reflexive_in(X3,X4)
| ~ is_transitive_in(X3,X4)
| ~ is_antisymmetric_in(X3,X4)
| ~ is_connected_in(X3,X4)
| ~ is_well_founded_in(X3,X4)
| well_orders(X3,X4)
| ~ relation(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)],[d5_wellord1])])])])])]) ).
fof(c_0_10,negated_conjecture,
( relation(esk1_0)
& ( ~ well_orders(esk1_0,relation_field(esk1_0))
| ~ well_ordering(esk1_0) )
& ( well_orders(esk1_0,relation_field(esk1_0))
| well_ordering(esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X2] :
( ( reflexive(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( transitive(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( antisymmetric(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( connected(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( well_founded_relation(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( ~ reflexive(X2)
| ~ transitive(X2)
| ~ antisymmetric(X2)
| ~ connected(X2)
| ~ well_founded_relation(X2)
| well_ordering(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])]) ).
cnf(c_0_12,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( well_ordering(esk1_0)
| well_orders(esk1_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( is_antisymmetric_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X2] :
( ( ~ transitive(X2)
| is_transitive_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_transitive_in(X2,relation_field(X2))
| transitive(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_relat_2])])]) ).
cnf(c_0_17,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( well_ordering(esk1_0)
| is_transitive_in(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_19,plain,
( is_connected_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_20,plain,
! [X2] :
( ( ~ antisymmetric(X2)
| is_antisymmetric_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_antisymmetric_in(X2,relation_field(X2))
| antisymmetric(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d12_relat_2])])]) ).
cnf(c_0_21,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
( well_ordering(esk1_0)
| is_antisymmetric_in(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_14])]) ).
fof(c_0_23,plain,
! [X2] :
( ( ~ reflexive(X2)
| is_reflexive_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_reflexive_in(X2,relation_field(X2))
| reflexive(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_relat_2])])]) ).
cnf(c_0_24,plain,
( is_reflexive_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,plain,
( is_transitive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( is_transitive_in(esk1_0,relation_field(esk1_0))
| transitive(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14])]) ).
fof(c_0_27,plain,
! [X2] :
( ( ~ connected(X2)
| is_connected_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_connected_in(X2,relation_field(X2))
| connected(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d14_relat_2])])]) ).
cnf(c_0_28,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( well_ordering(esk1_0)
| is_connected_in(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_14])]) ).
cnf(c_0_30,plain,
( is_antisymmetric_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,negated_conjecture,
( is_antisymmetric_in(esk1_0,relation_field(esk1_0))
| antisymmetric(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14])]) ).
fof(c_0_32,lemma,
! [X2] :
( ( ~ well_founded_relation(X2)
| is_well_founded_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_well_founded_in(X2,relation_field(X2))
| well_founded_relation(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_wellord1])])]) ).
cnf(c_0_33,plain,
( is_well_founded_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
( well_ordering(esk1_0)
| is_reflexive_in(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_14])]) ).
cnf(c_0_36,plain,
( transitive(X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,negated_conjecture,
is_transitive_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_14])]) ).
cnf(c_0_38,plain,
( connected(X1)
| ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
( is_connected_in(esk1_0,relation_field(esk1_0))
| connected(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14])]) ).
cnf(c_0_40,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_41,negated_conjecture,
is_antisymmetric_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_14])]) ).
cnf(c_0_42,lemma,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,negated_conjecture,
( well_ordering(esk1_0)
| is_well_founded_in(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_13]),c_0_14])]) ).
cnf(c_0_44,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_45,negated_conjecture,
( reflexive(esk1_0)
| well_ordering(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_14])]) ).
cnf(c_0_46,negated_conjecture,
transitive(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_14])]) ).
cnf(c_0_47,negated_conjecture,
connected(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_14])]) ).
cnf(c_0_48,negated_conjecture,
antisymmetric(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_14])]) ).
cnf(c_0_49,lemma,
( well_ordering(esk1_0)
| well_founded_relation(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_14])]) ).
cnf(c_0_50,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_51,negated_conjecture,
well_ordering(esk1_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_14])]),c_0_46]),c_0_47]),c_0_48])]),c_0_49]) ).
cnf(c_0_52,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_53,lemma,
( is_well_founded_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_54,negated_conjecture,
well_founded_relation(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_14])]) ).
cnf(c_0_55,plain,
( is_connected_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_56,negated_conjecture,
( ~ well_ordering(esk1_0)
| ~ well_orders(esk1_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_57,plain,
( is_reflexive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_58,negated_conjecture,
reflexive(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_14])]) ).
cnf(c_0_59,plain,
( well_orders(X1,X2)
| ~ relation(X1)
| ~ is_well_founded_in(X1,X2)
| ~ is_connected_in(X1,X2)
| ~ is_antisymmetric_in(X1,X2)
| ~ is_transitive_in(X1,X2)
| ~ is_reflexive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_60,lemma,
is_well_founded_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_14])]) ).
cnf(c_0_61,negated_conjecture,
is_connected_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_47]),c_0_14])]) ).
cnf(c_0_62,negated_conjecture,
~ well_orders(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_51])]) ).
cnf(c_0_63,negated_conjecture,
is_reflexive_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_14])]) ).
cnf(c_0_64,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_37]),c_0_61]),c_0_41]),c_0_14])]),c_0_62]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU244+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 20 02:12:33 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.25/1.43 # Preprocessing time : 0.026 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 65
% 0.25/1.43 # Proof object clause steps : 48
% 0.25/1.43 # Proof object formula steps : 17
% 0.25/1.43 # Proof object conjectures : 26
% 0.25/1.43 # Proof object clause conjectures : 23
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 25
% 0.25/1.43 # Proof object initial formulas used : 8
% 0.25/1.43 # Proof object generating inferences : 22
% 0.25/1.43 # Proof object simplifying inferences : 57
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 299
% 0.25/1.43 # Removed by relevancy pruning/SinE : 245
% 0.25/1.43 # Initial clauses : 131
% 0.25/1.43 # Removed in clause preprocessing : 2
% 0.25/1.43 # Initial clauses in saturation : 129
% 0.25/1.43 # Processed clauses : 297
% 0.25/1.43 # ...of these trivial : 16
% 0.25/1.43 # ...subsumed : 38
% 0.25/1.43 # ...remaining for further processing : 242
% 0.25/1.43 # Other redundant clauses eliminated : 18
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 1
% 0.25/1.43 # Backward-rewritten : 32
% 0.25/1.43 # Generated clauses : 839
% 0.25/1.43 # ...of the previous two non-trivial : 634
% 0.25/1.43 # Contextual simplify-reflections : 8
% 0.25/1.43 # Paramodulations : 805
% 0.25/1.43 # Factorizations : 8
% 0.25/1.43 # Equation resolutions : 26
% 0.25/1.43 # Current number of processed clauses : 209
% 0.25/1.43 # Positive orientable unit clauses : 49
% 0.25/1.43 # Positive unorientable unit clauses: 2
% 0.25/1.43 # Negative unit clauses : 2
% 0.25/1.43 # Non-unit-clauses : 156
% 0.25/1.43 # Current number of unprocessed clauses: 350
% 0.25/1.43 # ...number of literals in the above : 1193
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 33
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 5038
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 2912
% 0.25/1.43 # Non-unit clause-clause subsumptions : 40
% 0.25/1.43 # Unit Clause-clause subsumption calls : 493
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 39
% 0.25/1.43 # BW rewrite match successes : 15
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 23831
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.045 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.049 s
% 0.25/1.43 # Maximum resident set size: 4404 pages
% 0.25/23.42 eprover: CPU time limit exceeded, terminating
% 0.25/23.44 eprover: CPU time limit exceeded, terminating
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.51 eprover: No such file or directory
% 0.25/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.52 eprover: No such file or directory
% 0.25/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.52 eprover: No such file or directory
%------------------------------------------------------------------------------