TSTP Solution File: LCL525+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL525+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:41 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 76 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 66 ( 24 ~; 27 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(axiom_M,axiom,
( axiom_M
<=> ! [X1] : is_a_theorem(implies(necessarily(X1),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_M) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(km5_axiom_M,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_M) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(s1_0_modus_ponens_strict_implies,conjecture,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_0_modus_ponens_strict_implies) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_0_op_strict_implies) ).
fof(modus_ponens_strict_implies,axiom,
( modus_ponens_strict_implies
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(strict_implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',modus_ponens_strict_implies) ).
fof(c_0_8,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_9,plain,
! [X2] :
( ( ~ axiom_M
| is_a_theorem(implies(necessarily(X2),X2)) )
& ( ~ is_a_theorem(implies(necessarily(esk65_0),esk65_0))
| axiom_M ) ),
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)],[axiom_M])])])])])]) ).
cnf(c_0_10,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
axiom_M,
inference(split_conjunct,[status(thm)],[km5_axiom_M]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ op_strict_implies
| strict_implies(X3,X4) = necessarily(implies(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_strict_implies])])])])]) ).
fof(c_0_15,negated_conjecture,
~ modus_ponens_strict_implies,
inference(assume_negation,[status(cth)],[s1_0_modus_ponens_strict_implies]) ).
cnf(c_0_16,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_10,c_0_11])]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_18,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ( ~ modus_ponens_strict_implies
| ~ is_a_theorem(X3)
| ~ is_a_theorem(strict_implies(X3,X4))
| is_a_theorem(X4) )
& ( is_a_theorem(esk57_0)
| modus_ponens_strict_implies )
& ( is_a_theorem(strict_implies(esk57_0,esk58_0))
| modus_ponens_strict_implies )
& ( ~ is_a_theorem(esk58_0)
| modus_ponens_strict_implies ) ),
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_strict_implies])])])])])])]) ).
fof(c_0_21,negated_conjecture,
~ modus_ponens_strict_implies,
inference(fof_simplification,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(necessarily(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_24,plain,
( modus_ponens_strict_implies
| is_a_theorem(strict_implies(esk57_0,esk58_0)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ modus_ponens_strict_implies,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
is_a_theorem(strict_implies(esk57_0,esk58_0)),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( modus_ponens_strict_implies
| is_a_theorem(esk57_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(esk57_0,esk58_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
is_a_theorem(esk57_0),
inference(sr,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_31,plain,
( modus_ponens_strict_implies
| ~ is_a_theorem(esk58_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
is_a_theorem(esk58_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL525+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Mon Jul 4 21:01:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.016 s
% 0.23/1.42
% 0.23/1.42 # Failure: Out of unprocessed clauses!
% 0.23/1.42 # OLD status GaveUp
% 0.23/1.42 # Parsed axioms : 88
% 0.23/1.42 # Removed by relevancy pruning/SinE : 86
% 0.23/1.42 # Initial clauses : 5
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 5
% 0.23/1.42 # Processed clauses : 5
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 1
% 0.23/1.42 # ...remaining for further processing : 4
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 0
% 0.23/1.42 # ...of the previous two non-trivial : 0
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 0
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 4
% 0.23/1.42 # Positive orientable unit clauses : 2
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 0
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 0
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 900
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.012 s
% 0.23/1.42 # System time : 0.004 s
% 0.23/1.42 # Total time : 0.016 s
% 0.23/1.42 # Maximum resident set size: 2856 pages
% 0.23/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.022 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 34
% 0.23/1.42 # Proof object clause steps : 20
% 0.23/1.42 # Proof object formula steps : 14
% 0.23/1.42 # Proof object conjectures : 4
% 0.23/1.42 # Proof object clause conjectures : 1
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 10
% 0.23/1.42 # Proof object initial formulas used : 8
% 0.23/1.42 # Proof object generating inferences : 4
% 0.23/1.42 # Proof object simplifying inferences : 13
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 88
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 146
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 146
% 0.23/1.42 # Processed clauses : 216
% 0.23/1.42 # ...of these trivial : 30
% 0.23/1.42 # ...subsumed : 6
% 0.23/1.42 # ...remaining for further processing : 180
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 7
% 0.23/1.42 # Generated clauses : 407
% 0.23/1.42 # ...of the previous two non-trivial : 363
% 0.23/1.42 # Contextual simplify-reflections : 2
% 0.23/1.42 # Paramodulations : 407
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 173
% 0.23/1.42 # Positive orientable unit clauses : 56
% 0.23/1.42 # Positive unorientable unit clauses: 1
% 0.23/1.42 # Negative unit clauses : 1
% 0.23/1.42 # Non-unit-clauses : 115
% 0.23/1.42 # Current number of unprocessed clauses: 293
% 0.23/1.42 # ...number of literals in the above : 760
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 7
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 1359
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 1191
% 0.23/1.42 # Non-unit clause-clause subsumptions : 7
% 0.23/1.42 # Unit Clause-clause subsumption calls : 257
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 37
% 0.23/1.42 # BW rewrite match successes : 8
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 12547
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.033 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.036 s
% 0.23/1.42 # Maximum resident set size: 4272 pages
%------------------------------------------------------------------------------