%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL536+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n002.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 12.55s 4.06s
% Output : CNFRefutation 12.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 12 unt; 0 nHn; 16 RR)
% Number of literals : 34 ( 3 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_105,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rblijppg/input.p',i_0_105) ).
cnf(i_0_85,plain,
necessitation,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rblijppg/input.p',i_0_85) ).
cnf(i_0_114,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rblijppg/input.p',i_0_114) ).
cnf(i_0_136,plain,
op_strict_implies,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rblijppg/input.p',i_0_136) ).
cnf(i_0_23,plain,
( axiom_m10
| ~ is_a_theorem(strict_implies(possibly(esk17_0),necessarily(possibly(esk17_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rblijppg/input.p',i_0_23) ).
cnf(i_0_131,negated_conjecture,
~ axiom_m10,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rblijppg/input.p',i_0_131) ).
cnf(i_0_14,plain,
( is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))
| ~ axiom_5 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rblijppg/input.p',i_0_14) ).
cnf(i_0_82,plain,
axiom_5,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rblijppg/input.p',i_0_82) ).
cnf(c_0_145,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
i_0_105 ).
cnf(c_0_146,plain,
necessitation,
i_0_85 ).
cnf(c_0_147,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
i_0_114 ).
cnf(c_0_148,plain,
op_strict_implies,
i_0_136 ).
cnf(c_0_149,plain,
( axiom_m10
| ~ is_a_theorem(strict_implies(possibly(esk17_0),necessarily(possibly(esk17_0)))) ),
i_0_23 ).
cnf(c_0_150,negated_conjecture,
~ axiom_m10,
i_0_131 ).
cnf(c_0_151,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_146])]) ).
cnf(c_0_152,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_147,c_0_148])]) ).
cnf(c_0_153,plain,
( is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))
| ~ axiom_5 ),
i_0_14 ).
cnf(c_0_154,plain,
axiom_5,
i_0_82 ).
cnf(c_0_155,plain,
~ is_a_theorem(strict_implies(possibly(esk17_0),necessarily(possibly(esk17_0)))),
inference(sr,[status(thm)],[c_0_149,c_0_150]) ).
cnf(c_0_156,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_157,plain,
is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_154])]) ).
cnf(c_0_158,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_157])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL536+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 5 02:52:22 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/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
% 12.55/4.06 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 12.55/4.06 # Version: 2.1pre011
% 12.55/4.06 # Preprocessing time : 0.018 s
% 12.55/4.06
% 12.55/4.06 # Proof found!
% 12.55/4.06 # SZS status Theorem
% 12.55/4.06 # SZS output start CNFRefutation
% See solution above
% 12.55/4.06 # Proof object total steps : 22
% 12.55/4.06 # Proof object clause steps : 14
% 12.55/4.06 # Proof object formula steps : 8
% 12.55/4.06 # Proof object conjectures : 2
% 12.55/4.06 # Proof object clause conjectures : 1
% 12.55/4.06 # Proof object formula conjectures : 1
% 12.55/4.06 # Proof object initial clauses used : 8
% 12.55/4.06 # Proof object initial formulas used : 8
% 12.55/4.06 # Proof object generating inferences : 2
% 12.55/4.06 # Proof object simplifying inferences : 9
% 12.55/4.06 # Training examples: 0 positive, 0 negative
% 12.55/4.06 # Parsed axioms : 143
% 12.55/4.06 # Removed by relevancy pruning/SinE : 0
% 12.55/4.06 # Initial clauses : 143
% 12.55/4.06 # Removed in clause preprocessing : 0
% 12.55/4.06 # Initial clauses in saturation : 143
% 12.55/4.06 # Processed clauses : 179
% 12.55/4.06 # ...of these trivial : 28
% 12.55/4.06 # ...subsumed : 3
% 12.55/4.06 # ...remaining for further processing : 148
% 12.55/4.06 # Other redundant clauses eliminated : 0
% 12.55/4.06 # Clauses deleted for lack of memory : 0
% 12.55/4.06 # Backward-subsumed : 0
% 12.55/4.06 # Backward-rewritten : 4
% 12.55/4.06 # Generated clauses : 408
% 12.55/4.06 # ...of the previous two non-trivial : 357
% 12.55/4.06 # Contextual simplify-reflections : 0
% 12.55/4.06 # Paramodulations : 408
% 12.55/4.06 # Factorizations : 0
% 12.55/4.06 # Equation resolutions : 0
% 12.55/4.06 # Propositional unsat checks : 0
% 12.55/4.06 # Propositional unsat check successes : 0
% 12.55/4.06 # Current number of processed clauses : 144
% 12.55/4.06 # Positive orientable unit clauses : 50
% 12.55/4.06 # Positive unorientable unit clauses: 1
% 12.55/4.06 # Negative unit clauses : 2
% 12.55/4.06 # Non-unit-clauses : 91
% 12.55/4.06 # Current number of unprocessed clauses: 311
% 12.55/4.06 # ...number of literals in the above : 815
% 12.55/4.06 # Current number of archived formulas : 0
% 12.55/4.06 # Current number of archived clauses : 4
% 12.55/4.06 # Clause-clause subsumption calls (NU) : 746
% 12.55/4.06 # Rec. Clause-clause subsumption calls : 610
% 12.55/4.06 # Non-unit clause-clause subsumptions : 2
% 12.55/4.06 # Unit Clause-clause subsumption calls : 113
% 12.55/4.06 # Rewrite failures with RHS unbound : 0
% 12.55/4.06 # BW rewrite match attempts : 22
% 12.55/4.06 # BW rewrite match successes : 3
% 12.55/4.06 # Condensation attempts : 0
% 12.55/4.06 # Condensation successes : 0
% 12.55/4.06 # Termbank termtop insertions : 6655
% 12.55/4.06
% 12.55/4.06 # -------------------------------------------------
% 12.55/4.06 # User time : 0.030 s
% 12.55/4.06 # System time : 0.001 s
% 12.55/4.06 # Total time : 0.031 s
% 12.55/4.06 # ...preprocessing : 0.018 s
% 12.55/4.06 # ...main loop : 0.014 s
% 12.55/4.06 # Maximum resident set size: 7680 pages
% 12.55/4.06
%------------------------------------------------------------------------------