%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU232+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:07 EDT 2022
% Result : Theorem 1.25s 190.45s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 10 unt; 0 def)
% Number of atoms : 181 ( 13 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 178 ( 61 ~; 85 |; 20 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 78 ( 4 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_ordinal1,conjecture,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t23_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',cc1_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d2_ordinal1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d3_tarski) ).
fof(d3_ordinal1,axiom,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d3_ordinal1) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_transitive(X1)
& epsilon_connected(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',cc2_ordinal1) ).
fof(t3_ordinal1,lemma,
! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t3_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
inference(assume_negation,[status(cth)],[t23_ordinal1]) ).
fof(c_0_9,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])])]) ).
fof(c_0_10,negated_conjecture,
( ordinal(esk2_0)
& in(esk1_0,esk2_0)
& ~ ordinal(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X3,X4,X3] :
( ( ~ epsilon_transitive(X3)
| ~ in(X4,X3)
| subset(X4,X3) )
& ( in(esk8_1(X3),X3)
| epsilon_transitive(X3) )
& ( ~ subset(esk8_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_12,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk9_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk9_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ in(X1,X2)
| ~ epsilon_transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
epsilon_transitive(esk2_0),
inference(pm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
subset(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
fof(c_0_20,plain,
! [X4,X5,X6,X4] :
( ( ~ epsilon_connected(X4)
| ~ in(X5,X4)
| ~ in(X6,X4)
| in(X5,X6)
| X5 = X6
| in(X6,X5) )
& ( in(esk6_1(X4),X4)
| epsilon_connected(X4) )
& ( in(esk7_1(X4),X4)
| epsilon_connected(X4) )
& ( ~ in(esk6_1(X4),esk7_1(X4))
| epsilon_connected(X4) )
& ( esk6_1(X4) != esk7_1(X4)
| epsilon_connected(X4) )
& ( ~ in(esk7_1(X4),esk6_1(X4))
| epsilon_connected(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)],[inference(fof_simplification,[status(thm)],[d3_ordinal1])])])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(pm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( epsilon_connected(X1)
| in(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
( epsilon_connected(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( in(X1,X2)
| X2 = X1
| in(X2,X1)
| ~ in(X1,X3)
| ~ in(X2,X3)
| ~ epsilon_connected(X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( epsilon_connected(esk1_0)
| in(esk7_1(esk1_0),esk2_0) ),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
epsilon_connected(esk2_0),
inference(pm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_27,plain,
( epsilon_connected(X1)
| in(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( X1 = esk7_1(esk1_0)
| epsilon_connected(esk1_0)
| in(esk7_1(esk1_0),X1)
| in(X1,esk7_1(esk1_0))
| ~ in(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
( epsilon_connected(esk1_0)
| in(esk6_1(esk1_0),esk2_0) ),
inference(pm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_30,plain,
( epsilon_transitive(X1)
| in(esk8_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,plain,
( epsilon_connected(X1)
| ~ in(esk7_1(X1),esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,negated_conjecture,
( esk7_1(esk1_0) = esk6_1(esk1_0)
| epsilon_connected(esk1_0)
| in(esk7_1(esk1_0),esk6_1(esk1_0))
| in(esk6_1(esk1_0),esk7_1(esk1_0)) ),
inference(pm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( epsilon_transitive(esk1_0)
| in(esk8_1(esk1_0),esk2_0) ),
inference(pm,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_34,plain,
( epsilon_connected(X1)
| ~ in(esk6_1(X1),esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_35,negated_conjecture,
( esk7_1(esk1_0) = esk6_1(esk1_0)
| epsilon_connected(esk1_0)
| in(esk6_1(esk1_0),esk7_1(esk1_0)) ),
inference(pm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( subset(esk8_1(esk1_0),esk2_0)
| epsilon_transitive(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_15,c_0_33]),c_0_17])]) ).
fof(c_0_37,plain,
! [X2] :
( ~ epsilon_transitive(X2)
| ~ epsilon_connected(X2)
| ordinal(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])]) ).
cnf(c_0_38,plain,
( epsilon_connected(X1)
| esk6_1(X1) != esk7_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_39,negated_conjecture,
( esk7_1(esk1_0) = esk6_1(esk1_0)
| epsilon_connected(esk1_0) ),
inference(pm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( epsilon_transitive(esk1_0)
| in(X1,esk2_0)
| ~ in(X1,esk8_1(esk1_0)) ),
inference(pm,[status(thm)],[c_0_18,c_0_36]) ).
cnf(c_0_41,plain,
( subset(X1,X2)
| in(esk9_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,plain,
( ordinal(X1)
| ~ epsilon_connected(X1)
| ~ epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
epsilon_connected(esk1_0),
inference(pm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_45,lemma,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ in(X5,X6)
| ~ in(X6,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_ordinal1])]) ).
cnf(c_0_46,negated_conjecture,
( subset(esk8_1(esk1_0),X1)
| epsilon_transitive(esk1_0)
| in(esk9_2(esk8_1(esk1_0),X1),esk2_0) ),
inference(pm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
~ epsilon_transitive(esk1_0),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_48,lemma,
( ~ in(X1,X2)
| ~ in(X3,X1)
| ~ in(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( X1 = esk1_0
| in(esk1_0,X1)
| in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_24,c_0_16]),c_0_26])]) ).
cnf(c_0_50,negated_conjecture,
( subset(esk8_1(esk1_0),X1)
| in(esk9_2(esk8_1(esk1_0),X1),esk2_0) ),
inference(sr,[status(thm)],[c_0_46,c_0_47]) ).
fof(c_0_51,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden])])]) ).
cnf(c_0_52,lemma,
( epsilon_transitive(X1)
| ~ in(X2,esk8_1(X1))
| ~ in(X1,X2) ),
inference(pm,[status(thm)],[c_0_48,c_0_30]) ).
cnf(c_0_53,plain,
( subset(X1,X2)
| ~ in(esk9_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,negated_conjecture,
( esk9_2(esk8_1(esk1_0),X1) = esk1_0
| subset(esk8_1(esk1_0),X1)
| in(esk1_0,esk9_2(esk8_1(esk1_0),X1))
| in(esk9_2(esk8_1(esk1_0),X1),esk1_0) ),
inference(pm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,lemma,
( subset(esk8_1(X1),X2)
| epsilon_transitive(X1)
| ~ in(X1,esk9_2(esk8_1(X1),X2)) ),
inference(pm,[status(thm)],[c_0_52,c_0_41]) ).
cnf(c_0_57,negated_conjecture,
( esk9_2(esk8_1(esk1_0),esk1_0) = esk1_0
| subset(esk8_1(esk1_0),esk1_0)
| in(esk1_0,esk9_2(esk8_1(esk1_0),esk1_0)) ),
inference(pm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
( subset(X1,X2)
| ~ in(X1,esk9_2(X1,X2)) ),
inference(pm,[status(thm)],[c_0_55,c_0_41]) ).
cnf(c_0_59,lemma,
( esk9_2(esk8_1(esk1_0),esk1_0) = esk1_0
| subset(esk8_1(esk1_0),esk1_0) ),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_56,c_0_57]),c_0_47]) ).
cnf(c_0_60,lemma,
( subset(esk8_1(esk1_0),esk1_0)
| ~ in(esk8_1(esk1_0),esk1_0) ),
inference(pm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,plain,
( epsilon_transitive(X1)
| ~ subset(esk8_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_62,lemma,
subset(esk8_1(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_60,c_0_30]),c_0_47]) ).
cnf(c_0_63,lemma,
$false,
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_61,c_0_62]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU232+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n003.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 06:23:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.38/23.48 eprover: CPU time limit exceeded, terminating
% 0.38/23.48 eprover: CPU time limit exceeded, terminating
% 0.38/23.50 eprover: CPU time limit exceeded, terminating
% 0.38/23.53 eprover: CPU time limit exceeded, terminating
% 0.49/46.51 eprover: CPU time limit exceeded, terminating
% 0.49/46.55 eprover: CPU time limit exceeded, terminating
% 0.49/46.57 eprover: CPU time limit exceeded, terminating
% 0.49/46.58 eprover: CPU time limit exceeded, terminating
% 0.61/69.53 eprover: CPU time limit exceeded, terminating
% 0.61/69.56 eprover: CPU time limit exceeded, terminating
% 0.61/69.59 eprover: CPU time limit exceeded, terminating
% 0.61/69.59 eprover: CPU time limit exceeded, terminating
% 0.73/92.56 eprover: CPU time limit exceeded, terminating
% 0.73/92.58 eprover: CPU time limit exceeded, terminating
% 0.73/92.60 eprover: CPU time limit exceeded, terminating
% 0.73/92.61 eprover: CPU time limit exceeded, terminating
% 0.86/115.59 eprover: CPU time limit exceeded, terminating
% 0.86/115.59 eprover: CPU time limit exceeded, terminating
% 0.86/115.62 eprover: CPU time limit exceeded, terminating
% 0.86/115.62 eprover: CPU time limit exceeded, terminating
% 0.99/138.60 eprover: CPU time limit exceeded, terminating
% 0.99/138.63 eprover: CPU time limit exceeded, terminating
% 0.99/138.63 eprover: CPU time limit exceeded, terminating
% 0.99/138.64 eprover: CPU time limit exceeded, terminating
% 1.10/161.62 eprover: CPU time limit exceeded, terminating
% 1.10/161.64 eprover: CPU time limit exceeded, terminating
% 1.10/161.64 eprover: CPU time limit exceeded, terminating
% 1.10/161.65 eprover: CPU time limit exceeded, terminating
% 1.22/184.63 eprover: CPU time limit exceeded, terminating
% 1.22/184.66 eprover: CPU time limit exceeded, terminating
% 1.22/184.66 eprover: CPU time limit exceeded, terminatingeprover:
% 1.22/184.66 CPU time limit exceeded, terminating
% 1.25/190.45 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 1.25/190.45
% 1.25/190.45 # Failure: Resource limit exceeded (time)
% 1.25/190.45 # OLD status Res
% 1.25/190.45 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 1.25/190.45 # Preprocessing time : 0.020 s
% 1.25/190.45 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 1.25/190.45 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 1.25/190.45 # Preprocessing time : 0.017 s
% 1.25/190.45
% 1.25/190.45 # Failure: Out of unprocessed clauses!
% 1.25/190.45 # OLD status GaveUp
% 1.25/190.45 # Parsed axioms : 264
% 1.25/190.45 # Removed by relevancy pruning/SinE : 259
% 1.25/190.45 # Initial clauses : 9
% 1.25/190.45 # Removed in clause preprocessing : 0
% 1.25/190.45 # Initial clauses in saturation : 9
% 1.25/190.45 # Processed clauses : 45
% 1.25/190.45 # ...of these trivial : 0
% 1.25/190.45 # ...subsumed : 1
% 1.25/190.45 # ...remaining for further processing : 44
% 1.25/190.45 # Other redundant clauses eliminated : 0
% 1.25/190.45 # Clauses deleted for lack of memory : 0
% 1.25/190.45 # Backward-subsumed : 0
% 1.25/190.45 # Backward-rewritten : 0
% 1.25/190.45 # Generated clauses : 39
% 1.25/190.45 # ...of the previous two non-trivial : 36
% 1.25/190.45 # Contextual simplify-reflections : 1
% 1.25/190.45 # Paramodulations : 37
% 1.25/190.45 # Factorizations : 2
% 1.25/190.45 # Equation resolutions : 0
% 1.25/190.45 # Current number of processed clauses : 44
% 1.25/190.45 # Positive orientable unit clauses : 2
% 1.25/190.45 # Positive unorientable unit clauses: 0
% 1.25/190.45 # Negative unit clauses : 2
% 1.25/190.45 # Non-unit-clauses : 40
% 1.25/190.45 # Current number of unprocessed clauses: 0
% 1.25/190.45 # ...number of literals in the above : 0
% 1.25/190.45 # Current number of archived formulas : 0
% 1.25/190.45 # Current number of archived clauses : 0
% 1.25/190.45 # Clause-clause subsumption calls (NU) : 787
% 1.25/190.45 # Rec. Clause-clause subsumption calls : 392
% 1.25/190.45 # Non-unit clause-clause subsumptions : 2
% 1.25/190.45 # Unit Clause-clause subsumption calls : 0
% 1.25/190.45 # Rewrite failures with RHS unbound : 0
% 1.25/190.45 # BW rewrite match attempts : 0
% 1.25/190.45 # BW rewrite match successes : 0
% 1.25/190.45 # Condensation attempts : 0
% 1.25/190.45 # Condensation successes : 0
% 1.25/190.45 # Termbank termtop insertions : 4522
% 1.25/190.45
% 1.25/190.45 # -------------------------------------------------
% 1.25/190.45 # User time : 0.017 s
% 1.25/190.45 # System time : 0.003 s
% 1.25/190.45 # Total time : 0.020 s
% 1.25/190.45 # Maximum resident set size: 3068 pages
% 1.25/190.45 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 1.25/190.45 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 1.25/190.45 # Preprocessing time : 0.017 s
% 1.25/190.45
% 1.25/190.45 # Failure: Out of unprocessed clauses!
% 1.25/190.45 # OLD status GaveUp
% 1.25/190.45 # Parsed axioms : 264
% 1.25/190.45 # Removed by relevancy pruning/SinE : 259
% 1.25/190.45 # Initial clauses : 9
% 1.25/190.45 # Removed in clause preprocessing : 0
% 1.25/190.45 # Initial clauses in saturation : 9
% 1.25/190.45 # Processed clauses : 45
% 1.25/190.45 # ...of these trivial : 0
% 1.25/190.45 # ...subsumed : 1
% 1.25/190.45 # ...remaining for further processing : 44
% 1.25/190.45 # Other redundant clauses eliminated : 0
% 1.25/190.45 # Clauses deleted for lack of memory : 0
% 1.25/190.45 # Backward-subsumed : 0
% 1.25/190.45 # Backward-rewritten : 0
% 1.25/190.45 # Generated clauses : 39
% 1.25/190.45 # ...of the previous two non-trivial : 36
% 1.25/190.45 # Contextual simplify-reflections : 1
% 1.25/190.45 # Paramodulations : 37
% 1.25/190.45 # Factorizations : 2
% 1.25/190.45 # Equation resolutions : 0
% 1.25/190.45 # Current number of processed clauses : 44
% 1.25/190.45 # Positive orientable unit clauses : 2
% 1.25/190.45 # Positive unorientable unit clauses: 0
% 1.25/190.45 # Negative unit clauses : 2
% 1.25/190.45 # Non-unit-clauses : 40
% 1.25/190.45 # Current number of unprocessed clauses: 0
% 1.25/190.45 # ...number of literals in the above : 0
% 1.25/190.45 # Current number of archived formulas : 0
% 1.25/190.45 # Current number of archived clauses : 0
% 1.25/190.45 # Clause-clause subsumption calls (NU) : 781
% 1.25/190.45 # Rec. Clause-clause subsumption calls : 383
% 1.25/190.45 # Non-unit clause-clause subsumptions : 2
% 1.25/190.45 # Unit Clause-clause subsumption calls : 0
% 1.25/190.45 # Rewrite failures with RHS unbound : 0
% 1.25/190.45 # BW rewrite match attempts : 0
% 1.25/190.45 # BW rewrite match successes : 0
% 1.25/190.45 # Condensation attempts : 0
% 1.25/190.45 # Condensation successes : 0
% 1.25/190.45 # Termbank termtop insertions : 4380
% 1.25/190.45
% 1.25/190.45 # -------------------------------------------------
% 1.25/190.45 # User time : 0.018 s
% 1.25/190.45 # System time : 0.002 s
% 1.25/190.45 # Total time : 0.020 s
% 1.25/190.45 # Maximum resident set size: 3144 pages
% 1.25/190.45 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 1.25/190.45
% 1.25/190.45 # Failure: Resource limit exceeded (time)
% 1.25/190.45 # OLD status Res
% 1.25/190.45 # Preprocessing time : 0.039 s
% 1.25/190.45 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 1.25/190.45
% 1.25/190.45 # Failure: Resource limit exceeded (time)
% 1.25/190.45 # OLD status Res
% 1.25/190.45 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 1.25/190.45 # Preprocessing time : 0.011 s
% 1.25/190.45 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 1.25/190.45
% 1.25/190.45 # Failure: Resource limit exceeded (time)
% 1.25/190.45 # OLD status Res
% 1.25/190.45 # Preprocessing time : 0.025 s
% 1.25/190.45 # Running protocol protocol_eprover_e6b386026570787d4ac06e541c4634c5e3f09cc5 for 23 seconds:
% 1.25/190.45
% 1.25/190.45 # Failure: Resource limit exceeded (time)
% 1.25/190.45 # OLD status Res
% 1.25/190.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,100,1.0)
% 1.25/190.45 # Preprocessing time : 0.012 s
% 1.25/190.45 # Running protocol protocol_eprover_2e85aeff02a0bd3743f362014f6604d7fba54d74 for 23 seconds:
% 1.25/190.45
% 1.25/190.45 # Failure: Resource limit exceeded (time)
% 1.25/190.45 # OLD status Res
% 1.25/190.45 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.25/190.45 # Preprocessing time : 0.011 s
% 1.25/190.45 # Running protocol protocol_eprover_334d43c175335e554899225728a5c2ebd420f86b for 23 seconds:
% 1.25/190.45
% 1.25/190.45 # Failure: Resource limit exceeded (time)
% 1.25/190.45 # OLD status Res
% 1.25/190.45 # Preprocessing time : 0.023 s
% 1.25/190.45 # Running protocol protocol_eprover_13918ce26d63c8fe682016bfda2032977bcbf85b for 23 seconds:
% 1.25/190.45
% 1.25/190.45 # Failure: Resource limit exceeded (time)
% 1.25/190.45 # OLD status Res
% 1.25/190.45 # Preprocessing time : 0.024 s
% 1.25/190.45 # Running protocol protocol_eprover_374255c1532cc4daa30b60038971be8183a2c553 for 23 seconds:
% 1.25/190.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,03,100,1.0)
% 1.25/190.45 # Preprocessing time : 0.011 s
% 1.25/190.45
% 1.25/190.45 # Proof found!
% 1.25/190.45 # SZS status Theorem
% 1.25/190.45 # SZS output start CNFRefutation
% See solution above
% 1.25/190.45 # Proof object total steps : 64
% 1.25/190.45 # Proof object clause steps : 47
% 1.25/190.45 # Proof object formula steps : 17
% 1.25/190.45 # Proof object conjectures : 26
% 1.25/190.45 # Proof object clause conjectures : 23
% 1.25/190.45 # Proof object formula conjectures : 3
% 1.25/190.45 # Proof object initial clauses used : 20
% 1.25/190.45 # Proof object initial formulas used : 8
% 1.25/190.45 # Proof object generating inferences : 26
% 1.25/190.45 # Proof object simplifying inferences : 13
% 1.25/190.45 # Training examples: 0 positive, 0 negative
% 1.25/190.45 # Parsed axioms : 264
% 1.25/190.45 # Removed by relevancy pruning/SinE : 244
% 1.25/190.45 # Initial clauses : 42
% 1.25/190.45 # Removed in clause preprocessing : 0
% 1.25/190.45 # Initial clauses in saturation : 42
% 1.25/190.45 # Processed clauses : 7873
% 1.25/190.45 # ...of these trivial : 91
% 1.25/190.45 # ...subsumed : 1639
% 1.25/190.45 # ...remaining for further processing : 6143
% 1.25/190.45 # Other redundant clauses eliminated : 3
% 1.25/190.45 # Clauses deleted for lack of memory : 54510
% 1.25/190.45 # Backward-subsumed : 367
% 1.25/190.45 # Backward-rewritten : 802
% 1.25/190.45 # Generated clauses : 214374
% 1.25/190.45 # ...of the previous two non-trivial : 206628
% 1.25/190.45 # Contextual simplify-reflections : 0
% 1.25/190.45 # Paramodulations : 213839
% 1.25/190.45 # Factorizations : 460
% 1.25/190.45 # Equation resolutions : 3
% 1.25/190.45 # Current number of processed clauses : 4899
% 1.25/190.45 # Positive orientable unit clauses : 65
% 1.25/190.45 # Positive unorientable unit clauses: 0
% 1.25/190.45 # Negative unit clauses : 53
% 1.25/190.45 # Non-unit-clauses : 4781
% 1.25/190.45 # Current number of unprocessed clauses: 105349
% 1.25/190.45 # ...number of literals in the above : 721333
% 1.25/190.45 # Current number of archived formulas : 0
% 1.25/190.45 # Current number of archived clauses : 1241
% 1.25/190.45 # Clause-clause subsumption calls (NU) : 1318945
% 1.25/190.45 # Rec. Clause-clause subsumption calls : 218386
% 1.25/190.45 # Non-unit clause-clause subsumptions : 1850
% 1.25/190.45 # Unit Clause-clause subsumption calls : 61613
% 1.25/190.45 # Rewrite failures with RHS unbound : 0
% 1.25/190.45 # BW rewrite match attempts : 1422
% 1.25/190.45 # BW rewrite match successes : 17
% 1.25/190.45 # Condensation attempts : 0
% 1.25/190.45 # Condensation successes : 0
% 1.25/190.45 # Termbank termtop insertions : 3827562
% 1.25/190.45
% 1.25/190.45 # -------------------------------------------------
% 1.25/190.45 # User time : 5.508 s
% 1.25/190.45 # System time : 0.106 s
% 1.25/190.45 # Total time : 5.614 s
% 1.25/190.45 # Maximum resident set size: 135140 pages
% 1.25/207.67 eprover: CPU time limit exceeded, terminating
% 1.25/207.68 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.25/207.68 eprover: No such file or directory
% 1.25/207.69 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.25/207.69 eprover: No such file or directory
% 1.25/207.70 eprover: CPU time limit exceeded, terminating
% 1.25/207.70 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.25/207.70 eprover: No such file or directory
% 1.25/207.71 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.25/207.71 eprover: No such file or directory
% 1.25/207.72 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.25/207.72 eprover: No such file or directory
%------------------------------------------------------------------------------