TSTP Solution File: LCL531+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL531+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:43 EDT 2022
% Result : Theorem 0.10s 1.30s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 48 ( 22 unt; 0 def)
% Number of atoms : 102 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 92 ( 38 ~; 35 |; 10 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_0_axiom_m4,conjecture,
axiom_m4,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_0_axiom_m4) ).
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(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(implies_2,axiom,
( implies_2
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_2) ).
fof(axiom_m4,axiom,
( axiom_m4
<=> ! [X1] : is_a_theorem(strict_implies(X1,and(X1,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m4) ).
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(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(c_0_13,negated_conjecture,
~ axiom_m4,
inference(assume_negation,[status(cth)],[s1_0_axiom_m4]) ).
fof(c_0_14,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_15,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_16,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_17,plain,
! [X3,X4] :
( ( ~ implies_2
| is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4))) )
& ( ~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0)))
| implies_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)],[implies_2])])])])])]) ).
fof(c_0_18,plain,
! [X2] :
( ( ~ axiom_m4
| is_a_theorem(strict_implies(X2,and(X2,X2))) )
& ( ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0)))
| axiom_m4 ) ),
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_m4])])])])])]) ).
fof(c_0_19,negated_conjecture,
~ axiom_m4,
inference(fof_simplification,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1)
| ~ necessitation ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km5_necessitation]) ).
cnf(c_0_22,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_0_24,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
fof(c_0_28,plain,
! [X3,X4] :
( ( ~ and_3
| is_a_theorem(implies(X3,implies(X4,and(X3,X4)))) )
& ( ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))
| and_3 ) ),
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)],[and_3])])])])])]) ).
cnf(c_0_29,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,negated_conjecture,
~ axiom_m4,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_32,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_33,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_24,c_0_25])]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_37,plain,
~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))),
inference(sr,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_39,plain,
! [X5] :
( ( ~ kn1
| is_a_theorem(implies(X5,and(X5,X5))) )
& ( ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))
| kn1 ) ),
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)],[kn1])])])])])]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_42,plain,
~ is_a_theorem(implies(esk84_0,and(esk84_0,esk84_0))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
( kn1
| ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0))) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
~ kn1,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : LCL531+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.07 % Command : run_ET %s %d
% 0.06/0.26 % Computer : n005.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Sun Jul 3 18:18:37 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.10/1.30 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.10/1.30 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.10/1.30 # Preprocessing time : 0.009 s
% 0.10/1.30
% 0.10/1.30 # Failure: Out of unprocessed clauses!
% 0.10/1.30 # OLD status GaveUp
% 0.10/1.30 # Parsed axioms : 88
% 0.10/1.30 # Removed by relevancy pruning/SinE : 86
% 0.10/1.30 # Initial clauses : 3
% 0.10/1.30 # Removed in clause preprocessing : 0
% 0.10/1.30 # Initial clauses in saturation : 3
% 0.10/1.30 # Processed clauses : 3
% 0.10/1.30 # ...of these trivial : 0
% 0.10/1.30 # ...subsumed : 1
% 0.10/1.30 # ...remaining for further processing : 2
% 0.10/1.30 # Other redundant clauses eliminated : 0
% 0.10/1.30 # Clauses deleted for lack of memory : 0
% 0.10/1.30 # Backward-subsumed : 0
% 0.10/1.30 # Backward-rewritten : 0
% 0.10/1.30 # Generated clauses : 0
% 0.10/1.30 # ...of the previous two non-trivial : 0
% 0.10/1.30 # Contextual simplify-reflections : 0
% 0.10/1.30 # Paramodulations : 0
% 0.10/1.30 # Factorizations : 0
% 0.10/1.30 # Equation resolutions : 0
% 0.10/1.30 # Current number of processed clauses : 2
% 0.10/1.30 # Positive orientable unit clauses : 0
% 0.10/1.30 # Positive unorientable unit clauses: 0
% 0.10/1.30 # Negative unit clauses : 2
% 0.10/1.30 # Non-unit-clauses : 0
% 0.10/1.30 # Current number of unprocessed clauses: 0
% 0.10/1.30 # ...number of literals in the above : 0
% 0.10/1.30 # Current number of archived formulas : 0
% 0.10/1.30 # Current number of archived clauses : 0
% 0.10/1.30 # Clause-clause subsumption calls (NU) : 0
% 0.10/1.30 # Rec. Clause-clause subsumption calls : 0
% 0.10/1.30 # Non-unit clause-clause subsumptions : 0
% 0.10/1.30 # Unit Clause-clause subsumption calls : 0
% 0.10/1.30 # Rewrite failures with RHS unbound : 0
% 0.10/1.30 # BW rewrite match attempts : 0
% 0.10/1.30 # BW rewrite match successes : 0
% 0.10/1.30 # Condensation attempts : 0
% 0.10/1.30 # Condensation successes : 0
% 0.10/1.30 # Termbank termtop insertions : 791
% 0.10/1.30
% 0.10/1.30 # -------------------------------------------------
% 0.10/1.30 # User time : 0.007 s
% 0.10/1.30 # System time : 0.002 s
% 0.10/1.30 # Total time : 0.010 s
% 0.10/1.30 # Maximum resident set size: 2848 pages
% 0.10/1.30 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.10/1.30 # Preprocessing time : 0.012 s
% 0.10/1.30
% 0.10/1.30 # Proof found!
% 0.10/1.30 # SZS status Theorem
% 0.10/1.30 # SZS output start CNFRefutation
% See solution above
% 0.10/1.30 # Proof object total steps : 48
% 0.10/1.30 # Proof object clause steps : 26
% 0.10/1.30 # Proof object formula steps : 22
% 0.10/1.30 # Proof object conjectures : 4
% 0.10/1.30 # Proof object clause conjectures : 1
% 0.10/1.30 # Proof object formula conjectures : 3
% 0.10/1.30 # Proof object initial clauses used : 14
% 0.10/1.30 # Proof object initial formulas used : 13
% 0.10/1.30 # Proof object generating inferences : 5
% 0.10/1.30 # Proof object simplifying inferences : 14
% 0.10/1.30 # Training examples: 0 positive, 0 negative
% 0.10/1.30 # Parsed axioms : 88
% 0.10/1.30 # Removed by relevancy pruning/SinE : 0
% 0.10/1.30 # Initial clauses : 146
% 0.10/1.30 # Removed in clause preprocessing : 0
% 0.10/1.30 # Initial clauses in saturation : 146
% 0.10/1.30 # Processed clauses : 4723
% 0.10/1.30 # ...of these trivial : 62
% 0.10/1.30 # ...subsumed : 3350
% 0.10/1.30 # ...remaining for further processing : 1311
% 0.10/1.30 # Other redundant clauses eliminated : 0
% 0.10/1.30 # Clauses deleted for lack of memory : 0
% 0.10/1.30 # Backward-subsumed : 48
% 0.10/1.30 # Backward-rewritten : 65
% 0.10/1.30 # Generated clauses : 98727
% 0.10/1.30 # ...of the previous two non-trivial : 96440
% 0.10/1.30 # Contextual simplify-reflections : 4281
% 0.10/1.30 # Paramodulations : 98727
% 0.10/1.30 # Factorizations : 0
% 0.10/1.30 # Equation resolutions : 0
% 0.10/1.30 # Current number of processed clauses : 1198
% 0.10/1.30 # Positive orientable unit clauses : 108
% 0.10/1.30 # Positive unorientable unit clauses: 3
% 0.10/1.30 # Negative unit clauses : 6
% 0.10/1.30 # Non-unit-clauses : 1081
% 0.10/1.30 # Current number of unprocessed clauses: 90269
% 0.10/1.30 # ...number of literals in the above : 314032
% 0.10/1.30 # Current number of archived formulas : 0
% 0.10/1.30 # Current number of archived clauses : 113
% 0.10/1.30 # Clause-clause subsumption calls (NU) : 546762
% 0.10/1.30 # Rec. Clause-clause subsumption calls : 192589
% 0.10/1.30 # Non-unit clause-clause subsumptions : 7639
% 0.10/1.30 # Unit Clause-clause subsumption calls : 1197
% 0.10/1.30 # Rewrite failures with RHS unbound : 16
% 0.10/1.30 # BW rewrite match attempts : 816
% 0.10/1.30 # BW rewrite match successes : 32
% 0.10/1.30 # Condensation attempts : 0
% 0.10/1.30 # Condensation successes : 0
% 0.10/1.30 # Termbank termtop insertions : 1424028
% 0.10/1.30
% 0.10/1.30 # -------------------------------------------------
% 0.10/1.30 # User time : 0.883 s
% 0.10/1.30 # System time : 0.045 s
% 0.10/1.30 # Total time : 0.927 s
% 0.10/1.30 # Maximum resident set size: 84792 pages
% 0.10/23.34 eprover: CPU time limit exceeded, terminating
% 0.10/23.36 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.10/23.36 eprover: No such file or directory
% 0.10/23.36 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.10/23.36 eprover: No such file or directory
% 0.10/23.37 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.10/23.37 eprover: No such file or directory
% 0.10/23.37 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.10/23.37 eprover: No such file or directory
% 0.10/23.38 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.10/23.38 eprover: No such file or directory
% 0.10/23.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.10/23.39 eprover: No such file or directory
% 0.10/23.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.10/23.39 eprover: No such file or directory
% 0.10/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.10/23.40 eprover: No such file or directory
%------------------------------------------------------------------------------