TSTP Solution File: LCL455+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL455+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:19 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 10 ~; 6 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 2 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(principia_r2,conjecture,
r2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',principia_r2) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(or_2,axiom,
( or_2
<=> ! [X1,X2] : is_a_theorem(implies(X2,or(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_2) ).
fof(hilbert_or_2,axiom,
or_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_2) ).
fof(c_0_4,negated_conjecture,
~ r2,
inference(assume_negation,[status(cth)],[principia_r2]) ).
fof(c_0_5,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_6,negated_conjecture,
~ r2,
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ( ~ or_2
| is_a_theorem(implies(X4,or(X3,X4))) )
& ( ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0)))
| or_2 ) ),
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)],[or_2])])])])])]) ).
cnf(c_0_8,plain,
( r2
| ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ r2,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ or_2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
or_2,
inference(split_conjunct,[status(thm)],[hilbert_or_2]) ).
cnf(c_0_12,plain,
~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_14,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL455+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.32 % Computer : n014.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sat Jul 2 23:40:25 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.015 s
% 0.21/1.40
% 0.21/1.40 # Failure: Out of unprocessed clauses!
% 0.21/1.40 # OLD status GaveUp
% 0.21/1.40 # Parsed axioms : 53
% 0.21/1.40 # Removed by relevancy pruning/SinE : 51
% 0.21/1.40 # Initial clauses : 3
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 3
% 0.21/1.40 # Processed clauses : 3
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 1
% 0.21/1.40 # ...remaining for further processing : 2
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 0
% 0.21/1.40 # Generated clauses : 0
% 0.21/1.40 # ...of the previous two non-trivial : 0
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 0
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 2
% 0.21/1.40 # Positive orientable unit clauses : 0
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 2
% 0.21/1.40 # Non-unit-clauses : 0
% 0.21/1.40 # Current number of unprocessed clauses: 0
% 0.21/1.40 # ...number of literals in the above : 0
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 0
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.21/1.40 # Non-unit clause-clause subsumptions : 0
% 0.21/1.40 # Unit Clause-clause subsumption calls : 0
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 0
% 0.21/1.40 # BW rewrite match successes : 0
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 501
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.012 s
% 0.21/1.40 # System time : 0.003 s
% 0.21/1.40 # Total time : 0.015 s
% 0.21/1.40 # Maximum resident set size: 2732 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.019 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 15
% 0.21/1.40 # Proof object clause steps : 7
% 0.21/1.40 # Proof object formula steps : 8
% 0.21/1.40 # Proof object conjectures : 4
% 0.21/1.40 # Proof object clause conjectures : 1
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 4
% 0.21/1.40 # Proof object initial formulas used : 4
% 0.21/1.40 # Proof object generating inferences : 0
% 0.21/1.40 # Proof object simplifying inferences : 5
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 53
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 82
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 82
% 0.21/1.40 # Processed clauses : 49
% 0.21/1.40 # ...of these trivial : 13
% 0.21/1.40 # ...subsumed : 1
% 0.21/1.40 # ...remaining for further processing : 35
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 2
% 0.21/1.40 # Generated clauses : 5
% 0.21/1.40 # ...of the previous two non-trivial : 2
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 5
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 33
% 0.21/1.40 # Positive orientable unit clauses : 23
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 1
% 0.21/1.40 # Non-unit-clauses : 9
% 0.21/1.40 # Current number of unprocessed clauses: 35
% 0.21/1.40 # ...number of literals in the above : 71
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 2
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.21/1.40 # Non-unit clause-clause subsumptions : 0
% 0.21/1.40 # Unit Clause-clause subsumption calls : 0
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 3
% 0.21/1.40 # BW rewrite match successes : 2
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 4402
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.017 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.021 s
% 0.21/1.40 # Maximum resident set size: 3068 pages
%------------------------------------------------------------------------------