%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL544+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:58 AM UTC 2026
% Result : Theorem 7.62s 2.24s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 19 unt; 0 nHn; 25 RR)
% Number of literals : 58 ( 3 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_106,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_106) ).
cnf(i_0_86,plain,
necessitation,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_86) ).
cnf(i_0_115,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_115) ).
cnf(i_0_137,plain,
op_strict_implies,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_137) ).
cnf(i_0_97,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_97) ).
cnf(i_0_68,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_68) ).
cnf(i_0_79,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_79) ).
cnf(i_0_66,plain,
implies_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_66) ).
cnf(i_0_29,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(esk23_0,and(esk23_0,esk23_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_29) ).
cnf(i_0_132,negated_conjecture,
~ axiom_m4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_132) ).
cnf(i_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_10) ).
cnf(i_0_61,plain,
and_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jn4twkl2/lgb.p',i_0_61) ).
cnf(c_0_150,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
i_0_106 ).
cnf(c_0_151,plain,
necessitation,
i_0_86 ).
cnf(c_0_152,plain,
( necessarily(implies(X1,X2)) = strict_implies(X1,X2)
| ~ op_strict_implies ),
i_0_115 ).
cnf(c_0_153,plain,
op_strict_implies,
i_0_137 ).
cnf(c_0_154,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_97 ).
cnf(c_0_155,plain,
modus_ponens,
i_0_68 ).
cnf(c_0_156,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
i_0_79 ).
cnf(c_0_157,plain,
implies_2,
i_0_66 ).
cnf(c_0_158,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(esk23_0,and(esk23_0,esk23_0))) ),
i_0_29 ).
cnf(c_0_159,negated_conjecture,
~ axiom_m4,
i_0_132 ).
cnf(c_0_160,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_151])]) ).
cnf(c_0_161,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_153])]) ).
cnf(c_0_162,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_154,c_0_155])]) ).
cnf(c_0_163,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_157])]) ).
cnf(c_0_164,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
i_0_10 ).
cnf(c_0_165,plain,
and_3,
i_0_61 ).
cnf(c_0_166,plain,
~ is_a_theorem(strict_implies(esk23_0,and(esk23_0,esk23_0))),
inference(sr,[status(thm)],[c_0_158,c_0_159]) ).
cnf(c_0_167,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_168,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_169,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_165])]) ).
cnf(c_0_170,plain,
~ is_a_theorem(implies(esk23_0,and(esk23_0,esk23_0))),
inference(spm,[status(thm)],[c_0_166,c_0_167]) ).
cnf(c_0_171,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_168,c_0_169]) ).
cnf(c_0_172,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_170,c_0_171])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL544+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.02 % Command : enigmatic-eprover.py %s %d 1
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Sat Sep 5 20:12:59 UTC 2026
% 0.03/0.29 % CPUTime :
% 0.08/0.34 # ENIGMATIC: Selected SinE mode:
% 0.08/0.34 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.08/0.34 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.08/0.34 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.62/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.24 # No SInE strategy applied
% 7.62/2.24 # Trying AutoSched0 for 150 seconds
% 7.62/2.24 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 7.62/2.24 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.62/2.24 #
% 7.62/2.24 # Preprocessing time : 0.014 s
% 7.62/2.24 # Presaturation interreduction done
% 7.62/2.24
% 7.62/2.24 # Proof found!
% 7.62/2.24 # SZS status Theorem
% 7.62/2.24 # SZS output start CNFRefutation
% See solution above
% 7.62/2.24 # Training examples: 0 positive, 0 negative
% 7.62/2.24
% 7.62/2.24 # -------------------------------------------------
% 7.62/2.24 # User time : 0.022 s
% 7.62/2.24 # System time : 0.006 s
% 7.62/2.24 # Total time : 0.028 s
% 7.62/2.24 # Maximum resident set size: 3584 pages
% 7.62/2.24
%------------------------------------------------------------------------------