TSTP Solution File: LCL535+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL535+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:44 EDT 2022
% Result : Theorem 0.32s 14.51s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 34
% Syntax : Number of formulae : 124 ( 62 unt; 0 def)
% Number of atoms : 235 ( 25 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 186 ( 75 ~; 73 |; 18 &)
% ( 13 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 20 ( 18 usr; 18 prp; 0-2 aty)
% Number of functors : 31 ( 31 usr; 23 con; 0-2 aty)
% Number of variables : 147 ( 5 sgn 60 !; 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(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(implies_3,axiom,
( implies_3
<=> ! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_3) ).
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(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(hilbert_implies_3,axiom,
implies_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_3) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(hilbert_modus_tollens,axiom,
modus_tollens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(equivalence_3,axiom,
( equivalence_3
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',equivalence_3) ).
fof(or_1,axiom,
( or_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,or(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(hilbert_equivalence_3,axiom,
equivalence_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_equivalence_3) ).
fof(hilbert_or_1,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_1) ).
fof(op_possibly,axiom,
( op_possibly
=> ! [X1] : possibly(X1) = not(necessarily(not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_possibly) ).
fof(s1_0_m6s3m9b_axiom_m9,conjecture,
axiom_m9,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',s1_0_m6s3m9b_axiom_m9) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(axiom_m9,axiom,
( axiom_m9
<=> ! [X1] : is_a_theorem(strict_implies(possibly(possibly(X1)),possibly(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m9) ).
fof(km5_op_possibly,axiom,
op_possibly,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_op_possibly) ).
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(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',substitution_of_equivalents) ).
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(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(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(necessitation,axiom,
( necessitation
<=> ! [X1] :
( is_a_theorem(X1)
=> is_a_theorem(necessarily(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',necessitation) ).
fof(km5_axiom_5,axiom,
axiom_5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_5) ).
fof(km5_axiom_M,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_M) ).
fof(implies_1,axiom,
( implies_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(km5_necessitation,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_necessitation) ).
fof(hilbert_implies_1,axiom,
implies_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
fof(c_0_34,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_35,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_36,plain,
! [X4,X5,X6] :
( ( ~ implies_3
| is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))) )
& ( ~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0))))
| implies_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)],[implies_3])])])])])]) ).
cnf(c_0_37,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
fof(c_0_41,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])])])])])]) ).
fof(c_0_42,plain,
! [X3,X4] :
( ( ~ modus_tollens
| is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))) )
& ( ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))
| modus_tollens ) ),
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_tollens])])])])])]) ).
fof(c_0_43,plain,
! [X3,X4] :
( ~ op_implies_and
| implies(X3,X4) = not(and(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_implies_and])])])])]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ implies_3 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
implies_3,
inference(split_conjunct,[status(thm)],[hilbert_implies_3]) ).
cnf(c_0_46,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_37,c_0_38])]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
modus_tollens,
inference(split_conjunct,[status(thm)],[hilbert_modus_tollens]) ).
fof(c_0_52,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_53,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_55,plain,
! [X3,X4] :
( ( ~ equivalence_3
| is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X3),equiv(X3,X4)))) )
& ( ~ is_a_theorem(implies(implies(esk31_0,esk32_0),implies(implies(esk32_0,esk31_0),equiv(esk31_0,esk32_0))))
| equivalence_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)],[equivalence_3])])])])])]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_57,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
fof(c_0_60,plain,
! [X3,X4] :
( ( ~ or_1
| is_a_theorem(implies(X3,or(X3,X4))) )
& ( ~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))
| or_1 ) ),
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_1])])])])])]) ).
cnf(c_0_61,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_63,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_64,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))
| ~ equivalence_3 ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_65,plain,
equivalence_3,
inference(split_conjunct,[status(thm)],[hilbert_equivalence_3]) ).
cnf(c_0_66,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_56]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_68,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_46,c_0_59]) ).
cnf(c_0_69,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_70,plain,
or(X1,X2) = implies(not(X1),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
cnf(c_0_71,plain,
or_1,
inference(split_conjunct,[status(thm)],[hilbert_or_1]) ).
fof(c_0_72,plain,
! [X2] :
( ~ op_possibly
| possibly(X2) = not(necessarily(not(X2))) ),
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_possibly])])])])]) ).
fof(c_0_73,negated_conjecture,
~ axiom_m9,
inference(assume_negation,[status(cth)],[s1_0_m6s3m9b_axiom_m9]) ).
fof(c_0_74,plain,
! [X3,X4] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X3,X4))
| X3 = X4 )
& ( is_a_theorem(equiv(esk3_0,esk4_0))
| substitution_of_equivalents )
& ( esk3_0 != esk4_0
| substitution_of_equivalents ) ),
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)],[substitution_of_equivalents])])])])])])]) ).
cnf(c_0_75,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_76,plain,
is_a_theorem(implies(implies(and(X1,X1),X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_77,plain,
( is_a_theorem(implies(and(X1,not(X2)),X3))
| ~ is_a_theorem(implies(not(X3),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_68,c_0_62]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_71])]) ).
fof(c_0_79,plain,
! [X2] :
( ( ~ axiom_m9
| is_a_theorem(strict_implies(possibly(possibly(X2)),possibly(X2))) )
& ( ~ is_a_theorem(strict_implies(possibly(possibly(esk93_0)),possibly(esk93_0)))
| axiom_m9 ) ),
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_m9])])])])])]) ).
cnf(c_0_80,plain,
( possibly(X1) = not(necessarily(not(X1)))
| ~ op_possibly ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_81,plain,
op_possibly,
inference(split_conjunct,[status(thm)],[km5_op_possibly]) ).
fof(c_0_82,negated_conjecture,
~ axiom_m9,
inference(fof_simplification,[status(thm)],[c_0_73]) ).
fof(c_0_83,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])])])])]) ).
cnf(c_0_84,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2))
| ~ substitution_of_equivalents ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_85,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_86,plain,
( is_a_theorem(implies(implies(X1,X2),equiv(X2,X1)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_75]) ).
fof(c_0_87,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])])])])])]) ).
fof(c_0_88,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_89,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(and(X1,X1),X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_76]) ).
cnf(c_0_90,plain,
is_a_theorem(implies(and(not(not(X1)),not(X2)),X1)),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_91,plain,
( axiom_m9
| ~ is_a_theorem(strict_implies(possibly(possibly(esk93_0)),possibly(esk93_0))) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_92,plain,
possibly(X1) = not(necessarily(not(X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]) ).
cnf(c_0_93,negated_conjecture,
~ axiom_m9,
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_94,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_95,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
fof(c_0_96,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])])])])])])]) ).
cnf(c_0_97,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_98,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_86]) ).
cnf(c_0_99,plain,
( is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))
| ~ axiom_5 ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_100,plain,
axiom_5,
inference(split_conjunct,[status(thm)],[km5_axiom_5]) ).
cnf(c_0_101,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_102,plain,
axiom_M,
inference(split_conjunct,[status(thm)],[km5_axiom_M]) ).
cnf(c_0_103,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
fof(c_0_104,plain,
! [X3,X4] :
( ( ~ implies_1
| is_a_theorem(implies(X3,implies(X4,X3))) )
& ( ~ is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0)))
| implies_1 ) ),
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_1])])])])])]) ).
cnf(c_0_105,plain,
~ is_a_theorem(strict_implies(not(necessarily(not(not(necessarily(not(esk93_0)))))),not(necessarily(not(esk93_0))))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92]),c_0_92]),c_0_92]),c_0_93]) ).
cnf(c_0_106,plain,
strict_implies(X1,X2) = necessarily(implies(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95])]) ).
cnf(c_0_107,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1)
| ~ necessitation ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_108,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km5_necessitation]) ).
cnf(c_0_109,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_110,plain,
is_a_theorem(implies(not(necessarily(not(X1))),necessarily(not(necessarily(not(X1)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_92]),c_0_92]),c_0_100])]) ).
cnf(c_0_111,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102])]) ).
cnf(c_0_112,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_68,c_0_103]) ).
cnf(c_0_113,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ implies_1 ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_114,plain,
implies_1,
inference(split_conjunct,[status(thm)],[hilbert_implies_1]) ).
cnf(c_0_115,plain,
~ is_a_theorem(necessarily(implies(not(necessarily(not(not(necessarily(not(esk93_0)))))),not(necessarily(not(esk93_0)))))),
inference(rw,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_116,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108])]) ).
cnf(c_0_117,plain,
necessarily(not(necessarily(not(X1)))) = not(necessarily(not(X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111])]) ).
cnf(c_0_118,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_103]),c_0_112])]) ).
cnf(c_0_119,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_114])]) ).
cnf(c_0_120,plain,
~ is_a_theorem(implies(not(necessarily(not(not(necessarily(not(esk93_0)))))),not(necessarily(not(esk93_0))))),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_121,plain,
necessarily(necessarily(not(X1))) = necessarily(not(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_117]),c_0_118]),c_0_118]) ).
cnf(c_0_122,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_57,c_0_119]) ).
cnf(c_0_123,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_118]),c_0_121]),c_0_122])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL535+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 13:21:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.32/14.51 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.32/14.51 # Preprocessing time : 0.022 s
% 0.32/14.51
% 0.32/14.51 # Proof found!
% 0.32/14.51 # SZS status Theorem
% 0.32/14.51 # SZS output start CNFRefutation
% See solution above
% 0.32/14.51 # Proof object total steps : 124
% 0.32/14.51 # Proof object clause steps : 71
% 0.32/14.51 # Proof object formula steps : 53
% 0.32/14.51 # Proof object conjectures : 4
% 0.32/14.51 # Proof object clause conjectures : 1
% 0.32/14.51 # Proof object formula conjectures : 3
% 0.32/14.51 # Proof object initial clauses used : 34
% 0.32/14.51 # Proof object initial formulas used : 34
% 0.32/14.51 # Proof object generating inferences : 18
% 0.32/14.51 # Proof object simplifying inferences : 51
% 0.32/14.51 # Training examples: 0 positive, 0 negative
% 0.32/14.51 # Parsed axioms : 88
% 0.32/14.51 # Removed by relevancy pruning/SinE : 0
% 0.32/14.51 # Initial clauses : 146
% 0.32/14.51 # Removed in clause preprocessing : 0
% 0.32/14.51 # Initial clauses in saturation : 146
% 0.32/14.51 # Processed clauses : 5790
% 0.32/14.51 # ...of these trivial : 203
% 0.32/14.51 # ...subsumed : 3076
% 0.32/14.51 # ...remaining for further processing : 2510
% 0.32/14.51 # Other redundant clauses eliminated : 0
% 0.32/14.51 # Clauses deleted for lack of memory : 629979
% 0.32/14.51 # Backward-subsumed : 92
% 0.32/14.51 # Backward-rewritten : 2066
% 0.32/14.51 # Generated clauses : 776066
% 0.32/14.51 # ...of the previous two non-trivial : 768618
% 0.32/14.51 # Contextual simplify-reflections : 1382
% 0.32/14.51 # Paramodulations : 776046
% 0.32/14.51 # Factorizations : 0
% 0.32/14.51 # Equation resolutions : 0
% 0.32/14.51 # Current number of processed clauses : 345
% 0.32/14.51 # Positive orientable unit clauses : 100
% 0.32/14.51 # Positive unorientable unit clauses: 0
% 0.32/14.51 # Negative unit clauses : 15
% 0.32/14.51 # Non-unit-clauses : 230
% 0.32/14.51 # Current number of unprocessed clauses: 3790
% 0.32/14.51 # ...number of literals in the above : 9139
% 0.32/14.51 # Current number of archived formulas : 0
% 0.32/14.51 # Current number of archived clauses : 2158
% 0.32/14.51 # Clause-clause subsumption calls (NU) : 275741
% 0.32/14.51 # Rec. Clause-clause subsumption calls : 228853
% 0.32/14.51 # Non-unit clause-clause subsumptions : 4302
% 0.32/14.51 # Unit Clause-clause subsumption calls : 24418
% 0.32/14.51 # Rewrite failures with RHS unbound : 0
% 0.32/14.51 # BW rewrite match attempts : 14549
% 0.32/14.51 # BW rewrite match successes : 636
% 0.32/14.51 # Condensation attempts : 0
% 0.32/14.51 # Condensation successes : 0
% 0.32/14.51 # Termbank termtop insertions : 22530699
% 0.32/14.51
% 0.32/14.51 # -------------------------------------------------
% 0.32/14.51 # User time : 13.380 s
% 0.32/14.51 # System time : 0.141 s
% 0.32/14.51 # Total time : 13.521 s
% 0.32/14.51 # Maximum resident set size: 141208 pages
% 0.32/23.42 eprover: CPU time limit exceeded, terminating
% 0.32/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.43 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.45 eprover: No such file or directory
% 0.32/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.45 eprover: No such file or directory
% 0.32/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.46 eprover: No such file or directory
% 0.32/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.47 eprover: No such file or directory
% 0.32/23.47 eprover: CPU time limit exceeded, terminating
% 0.32/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.47 eprover: No such file or directory
% 0.32/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.48 eprover: No such file or directory
% 0.32/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.48 eprover: No such file or directory
% 0.32/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.49 eprover: No such file or directory
% 0.32/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.49 eprover: No such file or directory
% 0.32/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.49 eprover: No such file or directory
% 0.32/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.50 eprover: No such file or directory
% 0.32/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.50 eprover: No such file or directory
% 0.32/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.51 eprover: No such file or directory
% 0.32/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.51 eprover: No such file or directory
% 0.32/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.52 eprover: No such file or directory
% 0.32/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.53 eprover: No such file or directory
%------------------------------------------------------------------------------