%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL537+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 11:44:57 AM UTC 2026
% Result : Theorem 16.64s 4.22s
% Output : CNFRefutation 16.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 30
% Syntax : Number of formulae : 112 ( 57 unt; 0 def)
% Number of atoms : 207 ( 30 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 159 ( 64 ~; 63 |; 15 &)
% ( 11 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 18 ( 16 usr; 16 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 18 con; 0-2 aty)
% Number of variables : 125 ( 5 sgn 50 !; 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(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(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(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
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(use_substitution_of_equivalents,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',use_substitution_of_equivalents) ).
fof(hilbert_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_equiv) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
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(and_1,axiom,
( and_1
<=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_1) ).
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(hilbert_and_1,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_1) ).
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(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
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_modus_tollens,axiom,
modus_tollens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
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(axiom_4,axiom,
( axiom_4
<=> ! [X1] : is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_4) ).
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(km4b_op_possibly,axiom,
op_possibly,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_op_possibly) ).
fof(km4b_axiom_4,axiom,
axiom_4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_axiom_4) ).
fof(km4b_axiom_M,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_axiom_M) ).
fof(km5_axiom_5,conjecture,
axiom_5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km5_axiom_5) ).
fof(axiom_B,axiom,
( axiom_B
<=> ! [X1] : is_a_theorem(implies(X1,necessarily(possibly(X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_B) ).
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(km4b_axiom_B,axiom,
axiom_B,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_axiom_B) ).
fof(c_0_30,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
fof(c_0_31,plain,
! [X41,X42] :
( ( ~ and_3
| is_a_theorem(implies(X41,implies(X42,and(X41,X42)))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])]) ).
fof(c_0_32,plain,
! [X11,X12] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X11,X12))
| X11 = X12 )
& ( 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_of_equivalents])])])])]) ).
fof(c_0_33,plain,
! [X125,X126] :
( ~ op_equiv
| equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
cnf(c_0_34,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
fof(c_0_38,plain,
! [X23,X24] :
( ( ~ implies_2
| is_a_theorem(implies(implies(X23,implies(X23,X24)),implies(X23,X24))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])]) ).
cnf(c_0_39,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents]) ).
cnf(c_0_41,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[hilbert_op_equiv]) ).
cnf(c_0_43,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_34,c_0_35])]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
fof(c_0_47,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
cnf(c_0_48,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_49,plain,
equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
fof(c_0_52,plain,
! [X33,X34] :
( ( ~ and_1
| is_a_theorem(implies(and(X33,X34),X33)) )
& ( ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))
| and_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_1])])])]) ).
fof(c_0_53,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_54,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
cnf(c_0_56,plain,
( X1 = X2
| ~ is_a_theorem(and(implies(X1,X2),implies(X2,X1))) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_50]) ).
cnf(c_0_58,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_59,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ and_1 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,plain,
and_1,
inference(split_conjunct,[status(thm)],[hilbert_and_1]) ).
fof(c_0_61,plain,
! [X15,X16] :
( ( ~ modus_tollens
| is_a_theorem(implies(implies(not(X16),not(X15)),implies(X15,X16))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_tollens])])])]) ).
cnf(c_0_62,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_63,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_64,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
fof(c_0_65,plain,
! [X45,X46] :
( ( ~ or_1
| is_a_theorem(implies(X45,or(X45,X46))) )
& ( ~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))
| or_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_1])])])]) ).
cnf(c_0_66,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_58,c_0_44]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_69,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_70,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_71,plain,
modus_tollens,
inference(split_conjunct,[status(thm)],[hilbert_modus_tollens]) ).
cnf(c_0_72,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_73,plain,
or_1,
inference(split_conjunct,[status(thm)],[hilbert_or_1]) ).
cnf(c_0_74,plain,
and(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]) ).
cnf(c_0_75,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_71])]) ).
cnf(c_0_76,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_77,plain,
not(not(X1)) = or(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_74]),c_0_70]) ).
cnf(c_0_78,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_43,c_0_75]) ).
fof(c_0_79,plain,
! [X205] :
( ~ op_possibly
| possibly(X205) = not(necessarily(not(X205))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_possibly])])]) ).
cnf(c_0_80,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,or(X1,X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_77]),c_0_70]) ).
cnf(c_0_82,plain,
is_a_theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_76,c_0_70]) ).
fof(c_0_83,plain,
! [X147] :
( ( ~ axiom_4
| is_a_theorem(implies(necessarily(X147),necessarily(necessarily(X147)))) )
& ( ~ is_a_theorem(implies(necessarily(esk66_0),necessarily(necessarily(esk66_0))))
| axiom_4 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])]) ).
fof(c_0_84,plain,
! [X145] :
( ( ~ axiom_M
| is_a_theorem(implies(necessarily(X145),X145)) )
& ( ~ is_a_theorem(implies(necessarily(esk65_0),esk65_0))
| axiom_M ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_M])])])]) ).
cnf(c_0_85,plain,
( possibly(X1) = not(necessarily(not(X1)))
| ~ op_possibly ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_86,plain,
op_possibly,
inference(split_conjunct,[status(thm)],[km4b_op_possibly]) ).
cnf(c_0_87,plain,
( not(not(X1)) = X1
| ~ is_a_theorem(or(not(X1),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_80]),c_0_70]) ).
cnf(c_0_88,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_89,plain,
( is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1))))
| ~ axiom_4 ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_90,plain,
axiom_4,
inference(split_conjunct,[status(thm)],[km4b_axiom_4]) ).
cnf(c_0_91,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_92,plain,
axiom_M,
inference(split_conjunct,[status(thm)],[km4b_axiom_M]) ).
fof(c_0_93,negated_conjecture,
~ axiom_5,
inference(assume_negation,[status(cth)],[km5_axiom_5]) ).
fof(c_0_94,plain,
! [X149] :
( ( ~ axiom_B
| is_a_theorem(implies(X149,necessarily(possibly(X149)))) )
& ( ~ is_a_theorem(implies(esk67_0,necessarily(possibly(esk67_0))))
| axiom_B ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_B])])])]) ).
cnf(c_0_95,plain,
not(necessarily(not(X1))) = possibly(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]) ).
cnf(c_0_96,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_97,plain,
is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90])]) ).
cnf(c_0_98,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
fof(c_0_99,plain,
! [X151] :
( ( ~ axiom_5
| is_a_theorem(implies(possibly(X151),necessarily(possibly(X151)))) )
& ( ~ is_a_theorem(implies(possibly(esk68_0),necessarily(possibly(esk68_0))))
| axiom_5 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])]) ).
fof(c_0_100,negated_conjecture,
~ axiom_5,
inference(fof_simplification,[status(thm)],[c_0_93]) ).
cnf(c_0_101,plain,
( is_a_theorem(implies(X1,necessarily(possibly(X1))))
| ~ axiom_B ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_102,plain,
axiom_B,
inference(split_conjunct,[status(thm)],[km4b_axiom_B]) ).
cnf(c_0_103,plain,
possibly(not(X1)) = not(necessarily(X1)),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_104,plain,
necessarily(necessarily(X1)) = necessarily(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_97]),c_0_98])]) ).
cnf(c_0_105,plain,
( axiom_5
| ~ is_a_theorem(implies(possibly(esk68_0),necessarily(possibly(esk68_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_106,negated_conjecture,
~ axiom_5,
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_107,plain,
is_a_theorem(implies(X1,necessarily(possibly(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102])]) ).
cnf(c_0_108,plain,
possibly(possibly(X1)) = possibly(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_95]),c_0_104]),c_0_95]) ).
cnf(c_0_109,plain,
~ is_a_theorem(implies(possibly(esk68_0),necessarily(possibly(esk68_0)))),
inference(sr,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,plain,
is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL537+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 4 22:42:07 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected SinE mode:
% 0.21/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 16.64/4.22 # ENIGMATIC: Solved by autoschedule:
% 16.64/4.22 # No SInE strategy applied
% 16.64/4.22 # Trying AutoSched0 for 150 seconds
% 16.64/4.22 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 16.64/4.22 # and selection function SelectComplexExceptUniqMaxHorn.
% 16.64/4.22 #
% 16.64/4.22 # Preprocessing time : 0.031 s
% 16.64/4.22 # Presaturation interreduction done
% 16.64/4.22
% 16.64/4.22 # Proof found!
% 16.64/4.22 # SZS status Theorem
% 16.64/4.22 # SZS output start CNFRefutation
% See solution above
% 16.64/4.22 # Training examples: 0 positive, 0 negative
% 16.64/4.22
% 16.64/4.22 # -------------------------------------------------
% 16.64/4.22 # User time : 0.384 s
% 16.64/4.22 # System time : 0.029 s
% 16.64/4.22 # Total time : 0.414 s
% 16.64/4.22 # Maximum resident set size: 3584 pages
% 16.64/4.22
%------------------------------------------------------------------------------