TSTP Solution File: NUM401+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM401+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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 : Mon Jul 18 09:32:07 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 68 ( 10 unt; 0 def)
% Number of atoms : 228 ( 48 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 253 ( 93 ~; 118 |; 23 &)
% ( 9 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 102 ( 15 sgn 55 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,succ(X2))
<=> ordinal_subset(X1,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t34_ordinal1) ).
fof(connectedness_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',connectedness_r1_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_r1_ordinal1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_xboole_0) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t24_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_tarski) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_ordinal1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d10_xboole_0) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc1_ordinal1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,succ(X2))
<=> ordinal_subset(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[t34_ordinal1]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| ordinal_subset(X3,X4)
| ordinal_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_ordinal1])]) ).
fof(c_0_13,negated_conjecture,
( ordinal(esk18_0)
& ordinal(esk19_0)
& ( ~ in(esk18_0,succ(esk19_0))
| ~ ordinal_subset(esk18_0,esk19_0) )
& ( in(esk18_0,succ(esk19_0))
| ordinal_subset(esk18_0,esk19_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)],[c_0_11])])])])]) ).
cnf(c_0_14,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ordinal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ( ~ ordinal_subset(X3,X4)
| subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) )
& ( ~ subset(X3,X4)
| ordinal_subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_18,negated_conjecture,
( ordinal_subset(esk19_0,X1)
| ordinal_subset(X1,esk19_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
ordinal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| in(X8,X5)
| in(X8,X6)
| X7 != set_union2(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(X8,X6)
| in(X8,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X5)
| ~ in(esk3_3(X5,X6,X7),X7)
| X7 = set_union2(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X6)
| ~ in(esk3_3(X5,X6,X7),X7)
| X7 = set_union2(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X7)
| in(esk3_3(X5,X6,X7),X5)
| in(esk3_3(X5,X6,X7),X6)
| X7 = set_union2(X5,X6) ) ),
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)],[d2_xboole_0])])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| in(esk18_0,succ(esk19_0)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| in(X3,X4)
| X3 = X4
| in(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)],[t24_ordinal1])])])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ ordinal_subset(esk18_0,esk19_0)
| ~ in(esk18_0,succ(esk19_0)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| ordinal_subset(esk19_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( in(X1,X2)
| X2 = X1
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ ordinal_subset(esk18_0,esk19_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(rw,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( subset(esk19_0,esk18_0)
| ordinal_subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_15]),c_0_19])]) ).
cnf(c_0_32,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_33,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
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)],[d1_tarski])])])])])])]) ).
cnf(c_0_34,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_28]),c_0_19]),c_0_15])]) ).
fof(c_0_36,plain,
! [X3,X4,X3] :
( ( ~ epsilon_transitive(X3)
| ~ in(X4,X3)
| subset(X4,X3) )
& ( in(esk2_1(X3),X3)
| epsilon_transitive(X3) )
& ( ~ subset(esk2_1(X3),X3)
| epsilon_transitive(X3) ) ),
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)],[d2_ordinal1])])])])])])]) ).
cnf(c_0_37,negated_conjecture,
( X1 = esk19_0
| in(esk19_0,X1)
| in(X1,esk19_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_38,negated_conjecture,
( subset(esk19_0,esk18_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(esk18_0,singleton(esk19_0))
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_42,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])])]) ).
cnf(c_0_43,plain,
( subset(X1,X2)
| ~ in(X1,X2)
| ~ epsilon_transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( esk19_0 = esk18_0
| in(esk18_0,esk19_0)
| in(esk19_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_19]) ).
cnf(c_0_45,negated_conjecture,
( subset(esk19_0,esk18_0)
| ~ in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( X1 = esk18_0
| subset(esk18_0,esk19_0)
| in(esk18_0,esk19_0)
| singleton(esk19_0) != singleton(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( esk19_0 = esk18_0
| subset(esk19_0,esk18_0)
| ~ epsilon_transitive(esk18_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( esk19_0 = esk18_0
| subset(esk18_0,esk19_0)
| in(esk18_0,esk19_0) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_50,plain,
( ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_51,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_52,negated_conjecture,
( esk19_0 = esk18_0
| ~ subset(esk18_0,esk19_0)
| ~ epsilon_transitive(esk18_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( esk19_0 = esk18_0
| subset(esk18_0,esk19_0)
| ~ epsilon_transitive(esk19_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
fof(c_0_54,plain,
! [X2] :
( ( epsilon_transitive(X2)
| ~ ordinal(X2) )
& ( epsilon_connected(X2)
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
cnf(c_0_55,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_50]),c_0_19]),c_0_15])]) ).
cnf(c_0_56,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_57,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_58,negated_conjecture,
( esk19_0 = esk18_0
| ~ epsilon_transitive(esk18_0)
| ~ epsilon_transitive(esk19_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,singleton(esk19_0)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
( in(X1,X2)
| X2 != singleton(X1) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( esk19_0 = esk18_0
| ~ epsilon_transitive(esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_15])]) ).
fof(c_0_63,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_64,negated_conjecture,
( singleton(esk19_0) != singleton(esk18_0)
| ~ subset(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
esk19_0 = esk18_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_59]),c_0_19])]) ).
cnf(c_0_66,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_65]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM401+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 09:04:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.018 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 : 68
% 0.23/1.41 # Proof object clause steps : 45
% 0.23/1.41 # Proof object formula steps : 23
% 0.23/1.41 # Proof object conjectures : 30
% 0.23/1.41 # Proof object clause conjectures : 27
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 18
% 0.23/1.41 # Proof object initial formulas used : 11
% 0.23/1.41 # Proof object generating inferences : 23
% 0.23/1.41 # Proof object simplifying inferences : 21
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 54
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 112
% 0.23/1.41 # Removed in clause preprocessing : 3
% 0.23/1.41 # Initial clauses in saturation : 109
% 0.23/1.41 # Processed clauses : 624
% 0.23/1.41 # ...of these trivial : 7
% 0.23/1.41 # ...subsumed : 231
% 0.23/1.41 # ...remaining for further processing : 386
% 0.23/1.41 # Other redundant clauses eliminated : 16
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 27
% 0.23/1.41 # Backward-rewritten : 128
% 0.23/1.41 # Generated clauses : 1654
% 0.23/1.41 # ...of the previous two non-trivial : 1533
% 0.23/1.41 # Contextual simplify-reflections : 145
% 0.23/1.41 # Paramodulations : 1579
% 0.23/1.41 # Factorizations : 38
% 0.23/1.41 # Equation resolutions : 34
% 0.23/1.41 # Current number of processed clauses : 227
% 0.23/1.41 # Positive orientable unit clauses : 55
% 0.23/1.41 # Positive unorientable unit clauses: 1
% 0.23/1.41 # Negative unit clauses : 23
% 0.23/1.41 # Non-unit-clauses : 148
% 0.23/1.41 # Current number of unprocessed clauses: 770
% 0.23/1.41 # ...number of literals in the above : 2729
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 156
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 19388
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 13315
% 0.23/1.41 # Non-unit clause-clause subsumptions : 348
% 0.23/1.41 # Unit Clause-clause subsumption calls : 1803
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 17
% 0.23/1.41 # BW rewrite match successes : 14
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 22198
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.070 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.073 s
% 0.23/1.41 # Maximum resident set size: 4628 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------