TSTP Solution File: SET995+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET995+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:55:56 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 15 unt; 0 def)
% Number of atoms : 170 ( 70 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 217 ( 84 ~; 89 |; 29 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 58 ( 5 sgn 30 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t17_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( relation_dom(X2) = relation_dom(X3)
& relation_rng(X2) = singleton(X1)
& relation_rng(X3) = singleton(X1) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t17_funct_1) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d5_funct_1) ).
fof(t9_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( ( relation_dom(X1) = relation_dom(X2)
& ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) ) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t9_funct_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d1_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( relation_dom(X2) = relation_dom(X3)
& relation_rng(X2) = singleton(X1)
& relation_rng(X3) = singleton(X1) )
=> X2 = X3 ) ) ),
inference(assume_negation,[status(cth)],[t17_funct_1]) ).
fof(c_0_5,negated_conjecture,
( relation(esk15_0)
& function(esk15_0)
& relation(esk16_0)
& function(esk16_0)
& relation_dom(esk15_0) = relation_dom(esk16_0)
& relation_rng(esk15_0) = singleton(esk14_0)
& relation_rng(esk16_0) = singleton(esk14_0)
& esk15_0 != esk16_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_4])])])])]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( in(esk2_3(X5,X6,X7),relation_dom(X5))
| ~ in(X7,X6)
| X6 != relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( X7 = apply(X5,esk2_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( ~ in(X9,relation_dom(X5))
| X7 != apply(X5,X9)
| in(X7,X6)
| X6 != relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( ~ in(esk3_2(X5,X6),X6)
| ~ in(X11,relation_dom(X5))
| esk3_2(X5,X6) != apply(X5,X11)
| X6 = relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( in(esk4_2(X5,X6),relation_dom(X5))
| in(esk3_2(X5,X6),X6)
| X6 = relation_rng(X5)
| ~ relation(X5)
| ~ function(X5) )
& ( esk3_2(X5,X6) = apply(X5,esk4_2(X5,X6))
| in(esk3_2(X5,X6),X6)
| X6 = relation_rng(X5)
| ~ relation(X5)
| ~ function(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)],[d5_funct_1])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
relation_rng(esk16_0) = singleton(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
relation_rng(esk15_0) = singleton(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X3,X2)
| ~ function(X1)
| ~ relation(X1)
| X2 != relation_rng(X1)
| X3 != apply(X1,X4)
| ~ in(X4,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
relation_rng(esk16_0) = relation_rng(esk15_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
relation(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
function(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
relation_dom(esk15_0) = relation_dom(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_14,plain,
! [X4,X5] :
( ( in(esk17_2(X4,X5),relation_dom(X4))
| relation_dom(X4) != relation_dom(X5)
| X4 = X5
| ~ relation(X5)
| ~ function(X5)
| ~ relation(X4)
| ~ function(X4) )
& ( apply(X4,esk17_2(X4,X5)) != apply(X5,esk17_2(X4,X5))
| relation_dom(X4) != relation_dom(X5)
| X4 = X5
| ~ relation(X5)
| ~ function(X5)
| ~ relation(X4)
| ~ function(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)],[t9_funct_1])])])])])])]) ).
fof(c_0_15,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_16,negated_conjecture,
( in(X1,X2)
| X1 != apply(esk16_0,X3)
| X2 != relation_rng(esk15_0)
| ~ in(X3,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_17,plain,
( X1 = X2
| in(esk17_2(X1,X2),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| relation_dom(X1) != relation_dom(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( in(X1,relation_rng(esk15_0))
| X1 != apply(esk16_0,X2)
| ~ in(X2,relation_dom(esk15_0)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( esk16_0 = X1
| in(esk17_2(esk16_0,X1),relation_dom(esk15_0))
| relation_dom(esk15_0) != relation_dom(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_11]),c_0_12])]) ).
cnf(c_0_21,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
function(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
esk15_0 != esk16_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
( esk14_0 = X1
| X2 != relation_rng(esk15_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( in(apply(esk16_0,X1),relation_rng(esk15_0))
| ~ in(X1,relation_dom(esk15_0)) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
in(esk17_2(esk16_0,esk15_0),relation_dom(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_27,plain,
( in(X1,relation_rng(X2))
| X1 != apply(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ in(X3,relation_dom(X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_28,plain,
( X1 = X2
| ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| relation_dom(X1) != relation_dom(X2)
| apply(X1,esk17_2(X1,X2)) != apply(X2,esk17_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( esk14_0 = X1
| ~ in(X1,relation_rng(esk15_0)) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
in(apply(esk16_0,esk17_2(esk16_0,esk15_0)),relation_rng(esk15_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( in(apply(X1,X2),relation_rng(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_dom(X1)) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( esk16_0 = X1
| apply(esk16_0,esk17_2(esk16_0,X1)) != apply(X1,esk17_2(esk16_0,X1))
| relation_dom(esk15_0) != relation_dom(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_13]),c_0_11]),c_0_12])]) ).
cnf(c_0_33,negated_conjecture,
apply(esk16_0,esk17_2(esk16_0,esk15_0)) = esk14_0,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
in(apply(esk15_0,esk17_2(esk16_0,esk15_0)),relation_rng(esk15_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_21]),c_0_22])]) ).
cnf(c_0_35,negated_conjecture,
apply(esk15_0,esk17_2(esk16_0,esk15_0)) != esk14_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_32]),c_0_33]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET995+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n020.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 : Sat Jul 9 17:32:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.23/1.41 # Preprocessing time : 0.016 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 : 34
% 0.23/1.41 # Removed by relevancy pruning/SinE : 17
% 0.23/1.41 # Initial clauses : 32
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 32
% 0.23/1.41 # Processed clauses : 228
% 0.23/1.41 # ...of these trivial : 7
% 0.23/1.41 # ...subsumed : 120
% 0.23/1.41 # ...remaining for further processing : 101
% 0.23/1.41 # Other redundant clauses eliminated : 6
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 2
% 0.23/1.41 # Backward-rewritten : 27
% 0.23/1.41 # Generated clauses : 268
% 0.23/1.41 # ...of the previous two non-trivial : 235
% 0.23/1.41 # Contextual simplify-reflections : 164
% 0.23/1.41 # Paramodulations : 231
% 0.23/1.41 # Factorizations : 16
% 0.23/1.41 # Equation resolutions : 21
% 0.23/1.41 # Current number of processed clauses : 71
% 0.23/1.41 # Positive orientable unit clauses : 18
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 7
% 0.23/1.41 # Non-unit-clauses : 46
% 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 : 29
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 2409
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 1114
% 0.23/1.41 # Non-unit clause-clause subsumptions : 277
% 0.23/1.41 # Unit Clause-clause subsumption calls : 26
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 3
% 0.23/1.41 # BW rewrite match successes : 3
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 4947
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.027 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.030 s
% 0.23/1.41 # Maximum resident set size: 2972 pages
% 0.23/1.41 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.23/1.41 # Preprocessing time : 0.016 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 : 34
% 0.23/1.41 # Removed by relevancy pruning/SinE : 22
% 0.23/1.41 # Initial clauses : 27
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 27
% 0.23/1.41 # Processed clauses : 109
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 60
% 0.23/1.41 # ...remaining for further processing : 48
% 0.23/1.41 # Other redundant clauses eliminated : 7
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 2
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 105
% 0.23/1.41 # ...of the previous two non-trivial : 83
% 0.23/1.41 # Contextual simplify-reflections : 97
% 0.23/1.41 # Paramodulations : 82
% 0.23/1.41 # Factorizations : 8
% 0.23/1.41 # Equation resolutions : 15
% 0.23/1.41 # Current number of processed clauses : 45
% 0.23/1.41 # Positive orientable unit clauses : 12
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 6
% 0.23/1.41 # Non-unit-clauses : 27
% 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 : 2
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1679
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 771
% 0.23/1.41 # Non-unit clause-clause subsumptions : 151
% 0.23/1.41 # Unit Clause-clause subsumption calls : 34
% 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 : 3086
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.019 s
% 0.23/1.41 # System time : 0.005 s
% 0.23/1.41 # Total time : 0.023 s
% 0.23/1.41 # Maximum resident set size: 2972 pages
% 0.23/1.41 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.23/1.41 # Preprocessing time : 0.016 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 : 34
% 0.23/1.41 # Removed by relevancy pruning/SinE : 17
% 0.23/1.41 # Initial clauses : 32
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 32
% 0.23/1.41 # Processed clauses : 222
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 149
% 0.23/1.41 # ...remaining for further processing : 72
% 0.23/1.41 # Other redundant clauses eliminated : 7
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 3
% 0.23/1.41 # Generated clauses : 236
% 0.23/1.41 # ...of the previous two non-trivial : 193
% 0.23/1.41 # Contextual simplify-reflections : 146
% 0.23/1.41 # Paramodulations : 218
% 0.23/1.41 # Factorizations : 6
% 0.23/1.41 # Equation resolutions : 12
% 0.23/1.41 # Current number of processed clauses : 68
% 0.23/1.41 # Positive orientable unit clauses : 13
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 8
% 0.23/1.41 # Non-unit-clauses : 47
% 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 : 3
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1942
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 1638
% 0.23/1.41 # Non-unit clause-clause subsumptions : 252
% 0.23/1.41 # Unit Clause-clause subsumption calls : 55
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 3229
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.019 s
% 0.23/1.41 # System time : 0.005 s
% 0.23/1.41 # Total time : 0.024 s
% 0.23/1.41 # Maximum resident set size: 3012 pages
% 0.23/1.41 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.017 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 : 37
% 0.23/1.41 # Proof object clause steps : 28
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 25
% 0.23/1.41 # Proof object clause conjectures : 22
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 12
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 15
% 0.23/1.41 # Proof object simplifying inferences : 24
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 34
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 62
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 62
% 0.23/1.41 # Processed clauses : 4708
% 0.23/1.41 # ...of these trivial : 4
% 0.23/1.41 # ...subsumed : 3556
% 0.23/1.41 # ...remaining for further processing : 1148
% 0.23/1.41 # Other redundant clauses eliminated : 55
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 3
% 0.23/1.41 # Backward-rewritten : 22
% 0.23/1.41 # Generated clauses : 19532
% 0.23/1.41 # ...of the previous two non-trivial : 18352
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 19376
% 0.23/1.41 # Factorizations : 8
% 0.23/1.41 # Equation resolutions : 103
% 0.23/1.41 # Current number of processed clauses : 1094
% 0.23/1.41 # Positive orientable unit clauses : 47
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 22
% 0.23/1.41 # Non-unit-clauses : 1025
% 0.23/1.41 # Current number of unprocessed clauses: 13392
% 0.23/1.41 # ...number of literals in the above : 72820
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 25
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 149769
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 41012
% 0.23/1.41 # Non-unit clause-clause subsumptions : 2143
% 0.23/1.41 # Unit Clause-clause subsumption calls : 2043
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 18
% 0.23/1.41 # BW rewrite match successes : 11
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 349262
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.350 s
% 0.23/1.41 # System time : 0.012 s
% 0.23/1.41 # Total time : 0.362 s
% 0.23/1.41 # Maximum resident set size: 14584 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.mepo_128.in
% 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
% 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.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.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.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.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.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.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.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
% 0.23/23.48 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
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------