TSTP Solution File: LCL497+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL497+1 : TPTP v8.1.0. Released v3.3.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 : Sun Jul 17 10:11:32 EDT 2022
% Result : Theorem 0.48s 40.65s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of formulae : 73 ( 37 unt; 0 def)
% Number of atoms : 133 ( 13 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 103 ( 43 ~; 41 |; 9 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 102 ( 7 sgn 36 !; 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(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_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',luka_op_or) ).
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(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(r1,axiom,
( r1
<=> ! [X4] : is_a_theorem(implies(or(X4,X4),X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r1) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(principia_r1,axiom,
r1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r1) ).
fof(luka_cn2,conjecture,
cn2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',luka_cn2) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(c_0_18,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_19,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_20,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_22,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_23,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_25,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
fof(c_0_26,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])])])])])])]) ).
fof(c_0_27,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])])])])])]) ).
cnf(c_0_28,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
and(X1,X2) = not(implies(X1,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_30,plain,
op_or,
inference(split_conjunct,[status(thm)],[luka_op_or]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,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_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
cnf(c_0_36,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_31,c_0_32])]) ).
cnf(c_0_37,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_33,c_0_34]),c_0_34]),c_0_35])]) ).
fof(c_0_38,plain,
! [X6,X7] :
( ( ~ r2
| is_a_theorem(implies(X7,or(X6,X7))) )
& ( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
| r2 ) ),
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)],[r2])])])])])]) ).
fof(c_0_39,plain,
! [X6,X7] :
( ( ~ r3
| is_a_theorem(implies(or(X6,X7),or(X7,X6))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
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)],[r3])])])])])]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(not(not(implies(not(X1),not(not(X2))))),not(not(implies(not(X1),not(not(X3)))))))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(pm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
not(not(implies(not(not(X1)),not(not(X2))))) = implies(X1,X2),
inference(rw,[status(thm)],[c_0_24,c_0_34]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
fof(c_0_44,plain,
! [X5] :
( ( ~ r1
| is_a_theorem(implies(or(X5,X5),X5)) )
& ( ~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0))
| r1 ) ),
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)],[r1])])])])])]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_47,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_40,c_0_41]),c_0_41]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(X1,not(not(implies(not(X2),not(not(X1))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_34]),c_0_43])]) ).
cnf(c_0_49,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
r1,
inference(split_conjunct,[status(thm)],[principia_r1]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(not(not(implies(not(X1),not(not(X2))))),not(not(implies(not(X2),not(not(X1))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_34]),c_0_34]),c_0_46])]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(pm,[status(thm)],[c_0_36,c_0_47]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(pm,[status(thm)],[c_0_48,c_0_41]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(not(not(implies(not(X1),not(not(X1))))),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_34]),c_0_50])]) ).
cnf(c_0_55,plain,
( is_a_theorem(not(not(implies(not(X1),not(not(X2))))))
| ~ is_a_theorem(not(not(implies(not(X2),not(not(X1)))))) ),
inference(pm,[status(thm)],[c_0_36,c_0_51]) ).
cnf(c_0_56,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(pm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(implies(X1,not(X1)),not(X1))),
inference(pm,[status(thm)],[c_0_54,c_0_41]) ).
fof(c_0_58,negated_conjecture,
~ cn2,
inference(assume_negation,[status(cth)],[luka_cn2]) ).
cnf(c_0_59,plain,
( is_a_theorem(not(not(implies(not(X1),not(not(not(X2)))))))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(pm,[status(thm)],[c_0_55,c_0_41]) ).
cnf(c_0_60,plain,
is_a_theorem(implies(not(X1),not(X1))),
inference(pm,[status(thm)],[c_0_56,c_0_57]) ).
fof(c_0_61,plain,
! [X6,X7] :
( ( ~ cn2
| is_a_theorem(implies(X6,implies(not(X6),X7))) )
& ( ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0)))
| cn2 ) ),
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)],[cn2])])])])])]) ).
fof(c_0_62,negated_conjecture,
~ cn2,
inference(fof_simplification,[status(thm)],[c_0_58]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_59,c_0_60]),c_0_41]) ).
cnf(c_0_64,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(not(implies(not(X3),not(not(X1))))),X2)) ),
inference(pm,[status(thm)],[c_0_52,c_0_48]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(not(not(implies(not(X1),not(not(not(X2)))))),implies(X2,X1))),
inference(pm,[status(thm)],[c_0_51,c_0_41]) ).
cnf(c_0_66,plain,
( cn2
| ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_67,negated_conjecture,
~ cn2,
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_68,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(not(X1)),X2)) ),
inference(pm,[status(thm)],[c_0_52,c_0_63]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(pm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,plain,
~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))),
inference(sr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(pm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL497+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n020.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 : Sat Jul 2 20:16:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.37/23.41 eprover: CPU time limit exceeded, terminating
% 0.37/23.42 eprover: CPU time limit exceeded, terminating
% 0.37/23.43 eprover: CPU time limit exceeded, terminating
% 0.37/23.47 eprover: CPU time limit exceeded, terminating
% 0.48/40.65 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.48/40.65 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.48/40.65 # Preprocessing time : 0.014 s
% 0.48/40.65
% 0.48/40.65 # Failure: Out of unprocessed clauses!
% 0.48/40.65 # OLD status GaveUp
% 0.48/40.65 # Parsed axioms : 45
% 0.48/40.65 # Removed by relevancy pruning/SinE : 43
% 0.48/40.65 # Initial clauses : 3
% 0.48/40.65 # Removed in clause preprocessing : 0
% 0.48/40.65 # Initial clauses in saturation : 3
% 0.48/40.65 # Processed clauses : 3
% 0.48/40.65 # ...of these trivial : 0
% 0.48/40.65 # ...subsumed : 1
% 0.48/40.65 # ...remaining for further processing : 2
% 0.48/40.65 # Other redundant clauses eliminated : 0
% 0.48/40.65 # Clauses deleted for lack of memory : 0
% 0.48/40.65 # Backward-subsumed : 0
% 0.48/40.65 # Backward-rewritten : 0
% 0.48/40.65 # Generated clauses : 0
% 0.48/40.65 # ...of the previous two non-trivial : 0
% 0.48/40.65 # Contextual simplify-reflections : 0
% 0.48/40.65 # Paramodulations : 0
% 0.48/40.65 # Factorizations : 0
% 0.48/40.65 # Equation resolutions : 0
% 0.48/40.65 # Current number of processed clauses : 2
% 0.48/40.65 # Positive orientable unit clauses : 0
% 0.48/40.65 # Positive unorientable unit clauses: 0
% 0.48/40.65 # Negative unit clauses : 2
% 0.48/40.65 # Non-unit-clauses : 0
% 0.48/40.65 # Current number of unprocessed clauses: 0
% 0.48/40.65 # ...number of literals in the above : 0
% 0.48/40.65 # Current number of archived formulas : 0
% 0.48/40.65 # Current number of archived clauses : 0
% 0.48/40.65 # Clause-clause subsumption calls (NU) : 0
% 0.48/40.65 # Rec. Clause-clause subsumption calls : 0
% 0.48/40.65 # Non-unit clause-clause subsumptions : 0
% 0.48/40.65 # Unit Clause-clause subsumption calls : 0
% 0.48/40.65 # Rewrite failures with RHS unbound : 0
% 0.48/40.65 # BW rewrite match attempts : 0
% 0.48/40.65 # BW rewrite match successes : 0
% 0.48/40.65 # Condensation attempts : 0
% 0.48/40.65 # Condensation successes : 0
% 0.48/40.65 # Termbank termtop insertions : 493
% 0.48/40.65
% 0.48/40.65 # -------------------------------------------------
% 0.48/40.65 # User time : 0.011 s
% 0.48/40.65 # System time : 0.003 s
% 0.48/40.65 # Total time : 0.014 s
% 0.48/40.65 # Maximum resident set size: 2736 pages
% 0.48/40.65 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.48/40.65
% 0.48/40.65 # Failure: Resource limit exceeded (time)
% 0.48/40.65 # OLD status Res
% 0.48/40.65 # Preprocessing time : 0.019 s
% 0.48/40.65 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.48/40.65 # Preprocessing time : 0.011 s
% 0.48/40.65
% 0.48/40.65 # Proof found!
% 0.48/40.65 # SZS status Theorem
% 0.48/40.65 # SZS output start CNFRefutation
% See solution above
% 0.48/40.65 # Proof object total steps : 73
% 0.48/40.65 # Proof object clause steps : 44
% 0.48/40.65 # Proof object formula steps : 29
% 0.48/40.65 # Proof object conjectures : 4
% 0.48/40.65 # Proof object clause conjectures : 1
% 0.48/40.65 # Proof object formula conjectures : 3
% 0.48/40.65 # Proof object initial clauses used : 18
% 0.48/40.65 # Proof object initial formulas used : 18
% 0.48/40.65 # Proof object generating inferences : 15
% 0.48/40.65 # Proof object simplifying inferences : 30
% 0.48/40.65 # Training examples: 0 positive, 0 negative
% 0.48/40.65 # Parsed axioms : 45
% 0.48/40.65 # Removed by relevancy pruning/SinE : 0
% 0.48/40.65 # Initial clauses : 74
% 0.48/40.65 # Removed in clause preprocessing : 0
% 0.48/40.65 # Initial clauses in saturation : 74
% 0.48/40.65 # Processed clauses : 5044
% 0.48/40.65 # ...of these trivial : 77
% 0.48/40.65 # ...subsumed : 2641
% 0.48/40.65 # ...remaining for further processing : 2326
% 0.48/40.65 # Other redundant clauses eliminated : 0
% 0.48/40.65 # Clauses deleted for lack of memory : 1018215
% 0.48/40.65 # Backward-subsumed : 139
% 0.48/40.65 # Backward-rewritten : 33
% 0.48/40.65 # Generated clauses : 1181293
% 0.48/40.65 # ...of the previous two non-trivial : 1161545
% 0.48/40.65 # Contextual simplify-reflections : 2822
% 0.48/40.65 # Paramodulations : 1181290
% 0.48/40.65 # Factorizations : 0
% 0.48/40.65 # Equation resolutions : 0
% 0.48/40.65 # Current number of processed clauses : 2153
% 0.48/40.65 # Positive orientable unit clauses : 73
% 0.48/40.65 # Positive unorientable unit clauses: 2
% 0.48/40.65 # Negative unit clauses : 15
% 0.48/40.65 # Non-unit-clauses : 2063
% 0.48/40.65 # Current number of unprocessed clauses: 127388
% 0.48/40.65 # ...number of literals in the above : 456077
% 0.48/40.65 # Current number of archived formulas : 0
% 0.48/40.65 # Current number of archived clauses : 172
% 0.48/40.65 # Clause-clause subsumption calls (NU) : 932964
% 0.48/40.65 # Rec. Clause-clause subsumption calls : 814709
% 0.48/40.65 # Non-unit clause-clause subsumptions : 5347
% 0.48/40.65 # Unit Clause-clause subsumption calls : 13334
% 0.48/40.65 # Rewrite failures with RHS unbound : 0
% 0.48/40.65 # BW rewrite match attempts : 6056
% 0.48/40.65 # BW rewrite match successes : 46
% 0.48/40.65 # Condensation attempts : 0
% 0.48/40.65 # Condensation successes : 0
% 0.48/40.65 # Termbank termtop insertions : 27287138
% 0.48/40.65
% 0.48/40.65 # -------------------------------------------------
% 0.48/40.65 # User time : 17.030 s
% 0.48/40.65 # System time : 0.147 s
% 0.48/40.65 # Total time : 17.177 s
% 0.48/40.65 # Maximum resident set size: 148788 pages
% 0.48/46.44 eprover: CPU time limit exceeded, terminating
% 0.48/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.46 eprover: No such file or directory
% 0.48/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.46 eprover: No such file or directory
% 0.48/46.47 eprover: CPU time limit exceeded, terminating
% 0.48/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.47 eprover: No such file or directory
% 0.48/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.47 eprover: No such file or directory
% 0.48/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.48 eprover: No such file or directory
% 0.48/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.48 eprover: No such file or directory
% 0.48/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49 eprover: No such file or directory
% 0.48/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.49 eprover: No such file or directory
% 0.48/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49 eprover: No such file or directory
% 0.48/46.49 eprover: CPU time limit exceeded, terminating
% 0.48/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.49 eprover: No such file or directory
% 0.48/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49 eprover: No such file or directory
% 0.48/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.50 eprover: No such file or directory
% 0.48/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.50 eprover: No such file or directory
% 0.48/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.50 eprover: No such file or directory
% 0.48/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.50 eprover: No such file or directory
% 0.48/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.51 eprover: No such file or directory
% 0.48/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.51 eprover: No such file or directory
% 0.48/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.51 eprover: No such file or directory
% 0.48/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.51 eprover: No such file or directory
% 0.48/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.52 eprover: No such file or directory
% 0.48/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.52 eprover: No such file or directory
% 0.48/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.52 eprover: No such file or directory
% 0.48/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.53 eprover: No such file or directory
% 0.48/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.53 eprover: No such file or directory
%------------------------------------------------------------------------------