TSTP Solution File: LCL496+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL496+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : Sun Jul 17 10:11:32 EDT 2022
% Result : Theorem 0.45s 31.62s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 51 ( 28 unt; 0 def)
% Number of atoms : 93 ( 13 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 71 ( 29 ~; 27 |; 7 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
fof(r4,axiom,
( r4
<=> ! [X4,X5,X6] : is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r4) ).
fof(luka_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',luka_op_or) ).
fof(principia_r4,axiom,
r4,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r4) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r5) ).
fof(luka_cn1,conjecture,
cn1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',luka_cn1) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(principia_r5,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r5) ).
fof(cn1,axiom,
( cn1
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',cn1) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ op_implies_or
| implies(X3,X4) = or(not(X3),X4) ),
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)],[op_implies_or])])])])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ op_and
| and(X3,X4) = not(or(not(X3),not(X4))) ),
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)],[op_and])])])])]) ).
cnf(c_0_16,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ op_or
| or(X3,X4) = not(and(not(X3),not(X4))) ),
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)],[op_or])])])])]) ).
cnf(c_0_19,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
fof(c_0_22,plain,
! [X7,X8,X9] :
( ( ~ r4
| is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9)))) )
& ( ~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))
| r4 ) ),
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)],[r4])])])])])]) ).
cnf(c_0_23,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
and(X1,X2) = not(implies(X1,not(X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
op_or,
inference(split_conjunct,[status(thm)],[luka_op_or]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
or(X1,X2) = not(not(implies(not(X1),not(not(X2))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
r4,
inference(split_conjunct,[status(thm)],[principia_r4]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ( ~ modus_ponens
| ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X4))
| is_a_theorem(X4) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
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)],[modus_ponens])])])])])])]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(not(not(implies(not(X1),not(not(not(not(implies(not(X2),not(not(X3)))))))))),not(not(implies(not(X2),not(not(not(not(implies(not(X1),not(not(X3)))))))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_28])]) ).
cnf(c_0_31,plain,
not(not(implies(not(not(X1)),not(not(X2))))) = implies(X1,X2),
inference(rw,[status(thm)],[c_0_20,c_0_27]) ).
fof(c_0_32,plain,
! [X7,X8,X9] :
( ( ~ r5
| is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9)))) )
& ( ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))
| r5 ) ),
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)],[r5])])])])])]) ).
fof(c_0_33,negated_conjecture,
~ cn1,
inference(assume_negation,[status(cth)],[luka_cn1]) ).
cnf(c_0_34,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(X1,not(not(implies(not(X2),not(not(X3)))))),not(not(implies(not(X2),not(not(implies(X1,X3)))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_31]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
fof(c_0_39,plain,
! [X7,X8,X9] :
( ( ~ cn1
| is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))) )
& ( ~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0))))
| cn1 ) ),
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)],[cn1])])])])])]) ).
fof(c_0_40,negated_conjecture,
~ cn1,
inference(fof_simplification,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_31]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(not(implies(not(X3),not(not(X1))))),not(not(implies(not(X3),not(not(X2)))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_27]),c_0_27]),c_0_38])]) ).
cnf(c_0_44,plain,
( cn1
| ~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
~ cn1,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_31]),c_0_31]) ).
cnf(c_0_48,plain,
~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0)))),
inference(sr,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL496+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n026.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 2 15:55:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.39/23.42 eprover: CPU time limit exceeded, terminating
% 0.39/23.42 eprover: CPU time limit exceeded, terminating
% 0.39/23.43 eprover: CPU time limit exceeded, terminating
% 0.39/23.47 eprover: CPU time limit exceeded, terminating
% 0.45/31.62 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.45/31.62 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.45/31.62 # Preprocessing time : 0.014 s
% 0.45/31.62
% 0.45/31.62 # Failure: Out of unprocessed clauses!
% 0.45/31.62 # OLD status GaveUp
% 0.45/31.62 # Parsed axioms : 45
% 0.45/31.62 # Removed by relevancy pruning/SinE : 43
% 0.45/31.62 # Initial clauses : 3
% 0.45/31.62 # Removed in clause preprocessing : 0
% 0.45/31.62 # Initial clauses in saturation : 3
% 0.45/31.62 # Processed clauses : 3
% 0.45/31.62 # ...of these trivial : 0
% 0.45/31.62 # ...subsumed : 1
% 0.45/31.62 # ...remaining for further processing : 2
% 0.45/31.62 # Other redundant clauses eliminated : 0
% 0.45/31.62 # Clauses deleted for lack of memory : 0
% 0.45/31.62 # Backward-subsumed : 0
% 0.45/31.62 # Backward-rewritten : 0
% 0.45/31.62 # Generated clauses : 0
% 0.45/31.62 # ...of the previous two non-trivial : 0
% 0.45/31.62 # Contextual simplify-reflections : 0
% 0.45/31.62 # Paramodulations : 0
% 0.45/31.62 # Factorizations : 0
% 0.45/31.62 # Equation resolutions : 0
% 0.45/31.62 # Current number of processed clauses : 2
% 0.45/31.62 # Positive orientable unit clauses : 0
% 0.45/31.62 # Positive unorientable unit clauses: 0
% 0.45/31.62 # Negative unit clauses : 2
% 0.45/31.62 # Non-unit-clauses : 0
% 0.45/31.62 # Current number of unprocessed clauses: 0
% 0.45/31.62 # ...number of literals in the above : 0
% 0.45/31.62 # Current number of archived formulas : 0
% 0.45/31.62 # Current number of archived clauses : 0
% 0.45/31.62 # Clause-clause subsumption calls (NU) : 0
% 0.45/31.62 # Rec. Clause-clause subsumption calls : 0
% 0.45/31.62 # Non-unit clause-clause subsumptions : 0
% 0.45/31.62 # Unit Clause-clause subsumption calls : 0
% 0.45/31.62 # Rewrite failures with RHS unbound : 0
% 0.45/31.62 # BW rewrite match attempts : 0
% 0.45/31.62 # BW rewrite match successes : 0
% 0.45/31.62 # Condensation attempts : 0
% 0.45/31.62 # Condensation successes : 0
% 0.45/31.62 # Termbank termtop insertions : 535
% 0.45/31.62
% 0.45/31.62 # -------------------------------------------------
% 0.45/31.62 # User time : 0.011 s
% 0.45/31.62 # System time : 0.003 s
% 0.45/31.62 # Total time : 0.014 s
% 0.45/31.62 # Maximum resident set size: 2736 pages
% 0.45/31.62 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.45/31.62 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.45/31.62 # Preprocessing time : 0.014 s
% 0.45/31.62
% 0.45/31.62 # Failure: Out of unprocessed clauses!
% 0.45/31.62 # OLD status GaveUp
% 0.45/31.62 # Parsed axioms : 45
% 0.45/31.62 # Removed by relevancy pruning/SinE : 43
% 0.45/31.62 # Initial clauses : 3
% 0.45/31.62 # Removed in clause preprocessing : 0
% 0.45/31.62 # Initial clauses in saturation : 3
% 0.45/31.62 # Processed clauses : 3
% 0.45/31.62 # ...of these trivial : 0
% 0.45/31.62 # ...subsumed : 1
% 0.45/31.62 # ...remaining for further processing : 2
% 0.45/31.62 # Other redundant clauses eliminated : 0
% 0.45/31.62 # Clauses deleted for lack of memory : 0
% 0.45/31.62 # Backward-subsumed : 0
% 0.45/31.62 # Backward-rewritten : 0
% 0.45/31.62 # Generated clauses : 0
% 0.45/31.62 # ...of the previous two non-trivial : 0
% 0.45/31.62 # Contextual simplify-reflections : 0
% 0.45/31.62 # Paramodulations : 0
% 0.45/31.62 # Factorizations : 0
% 0.45/31.62 # Equation resolutions : 0
% 0.45/31.62 # Current number of processed clauses : 2
% 0.45/31.62 # Positive orientable unit clauses : 0
% 0.45/31.62 # Positive unorientable unit clauses: 0
% 0.45/31.62 # Negative unit clauses : 1
% 0.45/31.62 # Non-unit-clauses : 1
% 0.45/31.62 # Current number of unprocessed clauses: 0
% 0.45/31.62 # ...number of literals in the above : 0
% 0.45/31.62 # Current number of archived formulas : 0
% 0.45/31.62 # Current number of archived clauses : 0
% 0.45/31.62 # Clause-clause subsumption calls (NU) : 0
% 0.45/31.62 # Rec. Clause-clause subsumption calls : 0
% 0.45/31.62 # Non-unit clause-clause subsumptions : 0
% 0.45/31.62 # Unit Clause-clause subsumption calls : 0
% 0.45/31.62 # Rewrite failures with RHS unbound : 0
% 0.45/31.62 # BW rewrite match attempts : 0
% 0.45/31.62 # BW rewrite match successes : 0
% 0.45/31.62 # Condensation attempts : 0
% 0.45/31.62 # Condensation successes : 0
% 0.45/31.62 # Termbank termtop insertions : 535
% 0.45/31.62
% 0.45/31.62 # -------------------------------------------------
% 0.45/31.62 # User time : 0.012 s
% 0.45/31.62 # System time : 0.002 s
% 0.45/31.62 # Total time : 0.014 s
% 0.45/31.62 # Maximum resident set size: 2744 pages
% 0.45/31.62 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.45/31.62 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.45/31.62 # Preprocessing time : 0.016 s
% 0.45/31.62
% 0.45/31.62 # Failure: Out of unprocessed clauses!
% 0.45/31.62 # OLD status GaveUp
% 0.45/31.62 # Parsed axioms : 45
% 0.45/31.62 # Removed by relevancy pruning/SinE : 43
% 0.45/31.62 # Initial clauses : 3
% 0.45/31.62 # Removed in clause preprocessing : 0
% 0.45/31.62 # Initial clauses in saturation : 3
% 0.45/31.62 # Processed clauses : 3
% 0.45/31.62 # ...of these trivial : 0
% 0.45/31.62 # ...subsumed : 1
% 0.45/31.62 # ...remaining for further processing : 2
% 0.45/31.62 # Other redundant clauses eliminated : 0
% 0.45/31.62 # Clauses deleted for lack of memory : 0
% 0.45/31.62 # Backward-subsumed : 0
% 0.45/31.62 # Backward-rewritten : 0
% 0.45/31.62 # Generated clauses : 0
% 0.45/31.62 # ...of the previous two non-trivial : 0
% 0.45/31.62 # Contextual simplify-reflections : 0
% 0.45/31.62 # Paramodulations : 0
% 0.45/31.62 # Factorizations : 0
% 0.45/31.62 # Equation resolutions : 0
% 0.45/31.62 # Current number of processed clauses : 2
% 0.45/31.62 # Positive orientable unit clauses : 0
% 0.45/31.62 # Positive unorientable unit clauses: 0
% 0.45/31.62 # Negative unit clauses : 2
% 0.45/31.62 # Non-unit-clauses : 0
% 0.45/31.62 # Current number of unprocessed clauses: 0
% 0.45/31.62 # ...number of literals in the above : 0
% 0.45/31.62 # Current number of archived formulas : 0
% 0.45/31.62 # Current number of archived clauses : 0
% 0.45/31.62 # Clause-clause subsumption calls (NU) : 0
% 0.45/31.62 # Rec. Clause-clause subsumption calls : 0
% 0.45/31.62 # Non-unit clause-clause subsumptions : 0
% 0.45/31.62 # Unit Clause-clause subsumption calls : 0
% 0.45/31.62 # Rewrite failures with RHS unbound : 0
% 0.45/31.62 # BW rewrite match attempts : 0
% 0.45/31.62 # BW rewrite match successes : 0
% 0.45/31.62 # Condensation attempts : 0
% 0.45/31.62 # Condensation successes : 0
% 0.45/31.62 # Termbank termtop insertions : 535
% 0.45/31.62
% 0.45/31.62 # -------------------------------------------------
% 0.45/31.62 # User time : 0.011 s
% 0.45/31.62 # System time : 0.005 s
% 0.45/31.62 # Total time : 0.016 s
% 0.45/31.62 # Maximum resident set size: 2864 pages
% 0.45/31.62 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.45/31.62
% 0.45/31.62 # Failure: Resource limit exceeded (time)
% 0.45/31.62 # OLD status Res
% 0.45/31.62 # Preprocessing time : 0.020 s
% 0.45/31.62 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.45/31.62 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.45/31.62 # Preprocessing time : 0.008 s
% 0.45/31.62
% 0.45/31.62 # Failure: Out of unprocessed clauses!
% 0.45/31.62 # OLD status GaveUp
% 0.45/31.62 # Parsed axioms : 45
% 0.45/31.62 # Removed by relevancy pruning/SinE : 43
% 0.45/31.62 # Initial clauses : 3
% 0.45/31.62 # Removed in clause preprocessing : 0
% 0.45/31.62 # Initial clauses in saturation : 3
% 0.45/31.62 # Processed clauses : 3
% 0.45/31.62 # ...of these trivial : 0
% 0.45/31.62 # ...subsumed : 1
% 0.45/31.62 # ...remaining for further processing : 2
% 0.45/31.62 # Other redundant clauses eliminated : 0
% 0.45/31.62 # Clauses deleted for lack of memory : 0
% 0.45/31.62 # Backward-subsumed : 0
% 0.45/31.62 # Backward-rewritten : 0
% 0.45/31.62 # Generated clauses : 0
% 0.45/31.62 # ...of the previous two non-trivial : 0
% 0.45/31.62 # Contextual simplify-reflections : 0
% 0.45/31.62 # Paramodulations : 0
% 0.45/31.62 # Factorizations : 0
% 0.45/31.62 # Equation resolutions : 0
% 0.45/31.62 # Current number of processed clauses : 2
% 0.45/31.62 # Positive orientable unit clauses : 0
% 0.45/31.62 # Positive unorientable unit clauses: 0
% 0.45/31.62 # Negative unit clauses : 2
% 0.45/31.62 # Non-unit-clauses : 0
% 0.45/31.62 # Current number of unprocessed clauses: 0
% 0.45/31.62 # ...number of literals in the above : 0
% 0.45/31.62 # Current number of archived formulas : 0
% 0.45/31.62 # Current number of archived clauses : 0
% 0.45/31.62 # Clause-clause subsumption calls (NU) : 0
% 0.45/31.62 # Rec. Clause-clause subsumption calls : 0
% 0.45/31.62 # Non-unit clause-clause subsumptions : 0
% 0.45/31.62 # Unit Clause-clause subsumption calls : 0
% 0.45/31.62 # Rewrite failures with RHS unbound : 0
% 0.45/31.62 # BW rewrite match attempts : 0
% 0.45/31.62 # BW rewrite match successes : 0
% 0.45/31.62 # Condensation attempts : 0
% 0.45/31.62 # Condensation successes : 0
% 0.45/31.62 # Termbank termtop insertions : 535
% 0.45/31.62
% 0.45/31.62 # -------------------------------------------------
% 0.45/31.62 # User time : 0.006 s
% 0.45/31.62 # System time : 0.002 s
% 0.45/31.62 # Total time : 0.008 s
% 0.45/31.62 # Maximum resident set size: 2740 pages
% 0.45/31.62 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 0.45/31.62 # Preprocessing time : 0.010 s
% 0.45/31.62
% 0.45/31.62 # Proof found!
% 0.45/31.62 # SZS status Theorem
% 0.45/31.62 # SZS output start CNFRefutation
% See solution above
% 0.45/31.62 # Proof object total steps : 51
% 0.45/31.62 # Proof object clause steps : 28
% 0.45/31.62 # Proof object formula steps : 23
% 0.45/31.62 # Proof object conjectures : 4
% 0.45/31.62 # Proof object clause conjectures : 1
% 0.45/31.62 # Proof object formula conjectures : 3
% 0.45/31.62 # Proof object initial clauses used : 14
% 0.45/31.62 # Proof object initial formulas used : 14
% 0.45/31.62 # Proof object generating inferences : 5
% 0.45/31.62 # Proof object simplifying inferences : 27
% 0.45/31.62 # Training examples: 0 positive, 0 negative
% 0.45/31.62 # Parsed axioms : 45
% 0.45/31.62 # Removed by relevancy pruning/SinE : 0
% 0.45/31.62 # Initial clauses : 74
% 0.45/31.62 # Removed in clause preprocessing : 0
% 0.45/31.62 # Initial clauses in saturation : 74
% 0.45/31.62 # Processed clauses : 4111
% 0.45/31.62 # ...of these trivial : 278
% 0.45/31.62 # ...subsumed : 2763
% 0.45/31.62 # ...remaining for further processing : 1070
% 0.45/31.62 # Other redundant clauses eliminated : 0
% 0.45/31.62 # Clauses deleted for lack of memory : 290512
% 0.45/31.62 # Backward-subsumed : 27
% 0.45/31.62 # Backward-rewritten : 745
% 0.45/31.62 # Generated clauses : 442786
% 0.45/31.62 # ...of the previous two non-trivial : 406057
% 0.45/31.62 # Contextual simplify-reflections : 0
% 0.45/31.62 # Paramodulations : 442786
% 0.45/31.62 # Factorizations : 0
% 0.45/31.62 # Equation resolutions : 0
% 0.45/31.62 # Current number of processed clauses : 298
% 0.45/31.62 # Positive orientable unit clauses : 72
% 0.45/31.62 # Positive unorientable unit clauses: 3
% 0.45/31.62 # Negative unit clauses : 6
% 0.45/31.62 # Non-unit-clauses : 217
% 0.45/31.62 # Current number of unprocessed clauses: 9001
% 0.45/31.62 # ...number of literals in the above : 22522
% 0.45/31.62 # Current number of archived formulas : 0
% 0.45/31.62 # Current number of archived clauses : 772
% 0.45/31.62 # Clause-clause subsumption calls (NU) : 50931
% 0.45/31.62 # Rec. Clause-clause subsumption calls : 47063
% 0.45/31.62 # Non-unit clause-clause subsumptions : 2529
% 0.45/31.62 # Unit Clause-clause subsumption calls : 5440
% 0.45/31.62 # Rewrite failures with RHS unbound : 151
% 0.45/31.62 # BW rewrite match attempts : 48880
% 0.45/31.62 # BW rewrite match successes : 792
% 0.45/31.62 # Condensation attempts : 0
% 0.45/31.62 # Condensation successes : 0
% 0.45/31.62 # Termbank termtop insertions : 14189896
% 0.45/31.62
% 0.45/31.62 # -------------------------------------------------
% 0.45/31.62 # User time : 7.258 s
% 0.45/31.62 # System time : 0.114 s
% 0.45/31.62 # Total time : 7.372 s
% 0.45/31.62 # Maximum resident set size: 147236 pages
% 0.45/46.43 eprover: CPU time limit exceeded, terminating
% 0.45/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.45 eprover: No such file or directory
% 0.45/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.46 eprover: No such file or directory
% 0.45/46.46 eprover: CPU time limit exceeded, terminating
% 0.45/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.46 eprover: No such file or directory
% 0.45/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.47 eprover: No such file or directory
% 0.45/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.47 eprover: No such file or directory
% 0.45/46.47 eprover: CPU time limit exceeded, terminating
% 0.45/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.45/46.48 eprover: No such file or directory
% 0.45/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.48 eprover: No such file or directory
% 0.45/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.45/46.48 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.peprover:
% 0.45/46.51 Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.45/46.52 eprover: No such file or directory
% 0.45/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.52 eprover: No such file or directory
% 0.45/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.52 eprover: No such file or directory
% 0.45/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.45/46.52 eprover: No such file or directory
%------------------------------------------------------------------------------