TSTP Solution File: LCL536+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL536+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:45 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 14 unt; 0 def)
% Number of atoms : 53 ( 4 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 44 ( 19 ~; 16 |; 4 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_0_m10_axiom_m10,conjecture,
axiom_m10,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_0_m10_axiom_m10) ).
fof(necessitation,axiom,
( necessitation
<=> ! [X1] :
( is_a_theorem(X1)
=> is_a_theorem(necessarily(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',necessitation) ).
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(axiom_m10,axiom,
( axiom_m10
<=> ! [X1] : is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m10) ).
fof(km5_necessitation,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_necessitation) ).
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(axiom_5,axiom,
( axiom_5
<=> ! [X1] : is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_5) ).
fof(km5_axiom_5,axiom,
axiom_5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_5) ).
fof(c_0_8,negated_conjecture,
~ axiom_m10,
inference(assume_negation,[status(cth)],[s1_0_m10_axiom_m10]) ).
fof(c_0_9,plain,
! [X2] :
( ( ~ necessitation
| ~ is_a_theorem(X2)
| is_a_theorem(necessarily(X2)) )
& ( is_a_theorem(esk56_0)
| necessitation )
& ( ~ is_a_theorem(necessarily(esk56_0))
| necessitation ) ),
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)],[necessitation])])])])])])]) ).
fof(c_0_10,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_11,plain,
! [X2] :
( ( ~ axiom_m10
| is_a_theorem(strict_implies(possibly(X2),necessarily(possibly(X2)))) )
& ( ~ is_a_theorem(strict_implies(possibly(esk94_0),necessarily(possibly(esk94_0))))
| axiom_m10 ) ),
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_m10])])])])])]) ).
fof(c_0_12,negated_conjecture,
~ axiom_m10,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1)
| ~ necessitation ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km5_necessitation]) ).
cnf(c_0_15,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
fof(c_0_17,plain,
! [X2] :
( ( ~ axiom_5
| is_a_theorem(implies(possibly(X2),necessarily(possibly(X2)))) )
& ( ~ is_a_theorem(implies(possibly(esk68_0),necessarily(possibly(esk68_0))))
| axiom_5 ) ),
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_5])])])])])]) ).
cnf(c_0_18,plain,
( axiom_m10
| ~ is_a_theorem(strict_implies(possibly(esk94_0),necessarily(possibly(esk94_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
~ axiom_m10,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_21,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))
| ~ axiom_5 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
axiom_5,
inference(split_conjunct,[status(thm)],[km5_axiom_5]) ).
cnf(c_0_24,plain,
~ is_a_theorem(strict_implies(possibly(esk94_0),necessarily(possibly(esk94_0)))),
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL536+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 15:29:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.015 s
% 0.22/1.41
% 0.22/1.41 # Failure: Out of unprocessed clauses!
% 0.22/1.41 # OLD status GaveUp
% 0.22/1.41 # Parsed axioms : 88
% 0.22/1.41 # Removed by relevancy pruning/SinE : 86
% 0.22/1.41 # Initial clauses : 3
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 3
% 0.22/1.41 # Processed clauses : 3
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 1
% 0.22/1.41 # ...remaining for further processing : 2
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 0
% 0.22/1.41 # ...of the previous two non-trivial : 0
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 0
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 2
% 0.22/1.41 # Positive orientable unit clauses : 0
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 0
% 0.22/1.41 # Current number of unprocessed clauses: 0
% 0.22/1.41 # ...number of literals in the above : 0
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 0
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.41 # Non-unit clause-clause subsumptions : 0
% 0.22/1.41 # Unit Clause-clause subsumption calls : 0
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 0
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 804
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.013 s
% 0.22/1.41 # System time : 0.002 s
% 0.22/1.41 # Total time : 0.015 s
% 0.22/1.41 # Maximum resident set size: 2848 pages
% 0.22/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.41 # Preprocessing time : 0.021 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 28
% 0.22/1.41 # Proof object clause steps : 14
% 0.22/1.41 # Proof object formula steps : 14
% 0.22/1.41 # Proof object conjectures : 4
% 0.22/1.41 # Proof object clause conjectures : 1
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 8
% 0.22/1.41 # Proof object initial formulas used : 8
% 0.22/1.41 # Proof object generating inferences : 2
% 0.22/1.41 # Proof object simplifying inferences : 9
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 88
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 146
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 146
% 0.22/1.41 # Processed clauses : 243
% 0.22/1.41 # ...of these trivial : 29
% 0.22/1.41 # ...subsumed : 18
% 0.22/1.41 # ...remaining for further processing : 196
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 18
% 0.22/1.41 # Generated clauses : 469
% 0.22/1.41 # ...of the previous two non-trivial : 408
% 0.22/1.41 # Contextual simplify-reflections : 14
% 0.22/1.41 # Paramodulations : 469
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 178
% 0.22/1.41 # Positive orientable unit clauses : 53
% 0.22/1.41 # Positive unorientable unit clauses: 1
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 122
% 0.22/1.41 # Current number of unprocessed clauses: 298
% 0.22/1.41 # ...number of literals in the above : 756
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 18
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 2375
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 1843
% 0.22/1.41 # Non-unit clause-clause subsumptions : 31
% 0.22/1.41 # Unit Clause-clause subsumption calls : 289
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 38
% 0.22/1.41 # BW rewrite match successes : 9
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 13291
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.034 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.038 s
% 0.22/1.41 # Maximum resident set size: 4276 pages
%------------------------------------------------------------------------------