%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL488+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n031.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:51 AM UTC 2026
% Result : Theorem 14.21s 4.11s
% Output : CNFRefutation 14.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 28 unt; 0 nHn; 24 RR)
% Number of literals : 69 ( 13 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_64,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_64) ).
cnf(i_0_57,plain,
r2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_57) ).
cnf(i_0_44,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_44) ).
cnf(i_0_55,plain,
op_implies_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_55) ).
cnf(i_0_43,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_43) ).
cnf(i_0_21,plain,
op_implies_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_21) ).
cnf(i_0_38,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_38) ).
cnf(i_0_52,plain,
modus_ponens,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_52) ).
cnf(i_0_66,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_66) ).
cnf(i_0_58,plain,
r3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_58) ).
cnf(i_0_45,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_45) ).
cnf(i_0_22,plain,
op_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_22) ).
cnf(i_0_41,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_41) ).
cnf(i_0_53,plain,
op_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_53) ).
cnf(i_0_3,plain,
( and_2
| ~ is_a_theorem(implies(and(esk3_0,esk4_0),esk4_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_3) ).
cnf(i_0_19,negated_conjecture,
~ and_2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-szuwihuj/input.p',i_0_19) ).
cnf(c_0_83,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
i_0_64 ).
cnf(c_0_84,plain,
r2,
i_0_57 ).
cnf(c_0_85,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_44 ).
cnf(c_0_86,plain,
op_implies_or,
i_0_55 ).
cnf(c_0_87,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_43 ).
cnf(c_0_88,plain,
op_implies_and,
i_0_21 ).
cnf(c_0_89,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_90,plain,
modus_ponens,
i_0_52 ).
cnf(c_0_91,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_66 ).
cnf(c_0_92,plain,
r3,
i_0_58 ).
cnf(c_0_93,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).
cnf(c_0_94,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]) ).
cnf(c_0_95,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_45 ).
cnf(c_0_96,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_97,plain,
op_or,
i_0_22 ).
cnf(c_0_98,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_41 ).
cnf(c_0_99,plain,
op_and,
i_0_53 ).
cnf(c_0_100,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_89,c_0_90])]) ).
cnf(c_0_101,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_102,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_103,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96]),c_0_97])]) ).
cnf(c_0_104,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_94]),c_0_99])]) ).
cnf(c_0_105,plain,
( and_2
| ~ is_a_theorem(implies(and(esk3_0,esk4_0),esk4_0)) ),
i_0_3 ).
cnf(c_0_106,negated_conjecture,
~ and_2,
i_0_19 ).
cnf(c_0_107,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_108,plain,
is_a_theorem(or(X1,implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_109,plain,
or(implies(X1,not(X2)),X3) = implies(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_110,plain,
~ is_a_theorem(implies(and(esk3_0,esk4_0),esk4_0)),
inference(sr,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_111,plain,
is_a_theorem(implies(and(X1,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]) ).
cnf(c_0_112,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_111])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL488+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 : n031.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 07:14:41 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected SinE mode:
% 0.22/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 14.21/4.11 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 14.21/4.11 # Version: 2.1pre011
% 14.21/4.11 # Preprocessing time : 0.016 s
% 14.21/4.11
% 14.21/4.11 # Proof found!
% 14.21/4.11 # SZS status Theorem
% 14.21/4.11 # SZS output start CNFRefutation
% See solution above
% 14.21/4.11 # Proof object total steps : 46
% 14.21/4.11 # Proof object clause steps : 30
% 14.21/4.11 # Proof object formula steps : 16
% 14.21/4.11 # Proof object conjectures : 2
% 14.21/4.11 # Proof object clause conjectures : 1
% 14.21/4.11 # Proof object formula conjectures : 1
% 14.21/4.11 # Proof object initial clauses used : 16
% 14.21/4.11 # Proof object initial formulas used : 16
% 14.21/4.11 # Proof object generating inferences : 5
% 14.21/4.11 # Proof object simplifying inferences : 20
% 14.21/4.11 # Training examples: 0 positive, 0 negative
% 14.21/4.11 # Parsed axioms : 74
% 14.21/4.11 # Removed by relevancy pruning/SinE : 0
% 14.21/4.11 # Initial clauses : 74
% 14.21/4.11 # Removed in clause preprocessing : 0
% 14.21/4.11 # Initial clauses in saturation : 74
% 14.21/4.11 # Processed clauses : 226
% 14.21/4.11 # ...of these trivial : 13
% 14.21/4.11 # ...subsumed : 30
% 14.21/4.11 # ...remaining for further processing : 183
% 14.21/4.11 # Other redundant clauses eliminated : 0
% 14.21/4.11 # Clauses deleted for lack of memory : 0
% 14.21/4.11 # Backward-subsumed : 10
% 14.21/4.11 # Backward-rewritten : 14
% 14.21/4.11 # Generated clauses : 815
% 14.21/4.11 # ...of the previous two non-trivial : 731
% 14.21/4.11 # Contextual simplify-reflections : 4
% 14.21/4.11 # Paramodulations : 815
% 14.21/4.11 # Factorizations : 0
% 14.21/4.11 # Equation resolutions : 0
% 14.21/4.11 # Propositional unsat checks : 0
% 14.21/4.11 # Propositional unsat check successes : 0
% 14.21/4.11 # Current number of processed clauses : 159
% 14.21/4.11 # Positive orientable unit clauses : 44
% 14.21/4.11 # Positive unorientable unit clauses: 0
% 14.21/4.11 # Negative unit clauses : 2
% 14.21/4.11 # Non-unit-clauses : 113
% 14.21/4.11 # Current number of unprocessed clauses: 503
% 14.21/4.11 # ...number of literals in the above : 934
% 14.21/4.11 # Current number of archived formulas : 0
% 14.21/4.11 # Current number of archived clauses : 24
% 14.21/4.11 # Clause-clause subsumption calls (NU) : 2927
% 14.21/4.11 # Rec. Clause-clause subsumption calls : 2822
% 14.21/4.11 # Non-unit clause-clause subsumptions : 40
% 14.21/4.11 # Unit Clause-clause subsumption calls : 264
% 14.21/4.11 # Rewrite failures with RHS unbound : 0
% 14.21/4.11 # BW rewrite match attempts : 49
% 14.21/4.11 # BW rewrite match successes : 13
% 14.21/4.11 # Condensation attempts : 0
% 14.21/4.11 # Condensation successes : 0
% 14.21/4.11 # Termbank termtop insertions : 10549
% 14.21/4.11
% 14.21/4.11 # -------------------------------------------------
% 14.21/4.11 # User time : 0.034 s
% 14.21/4.11 # System time : 0.004 s
% 14.21/4.11 # Total time : 0.038 s
% 14.21/4.11 # ...preprocessing : 0.016 s
% 14.21/4.11 # ...main loop : 0.022 s
% 14.21/4.11 # Maximum resident set size: 7680 pages
% 14.21/4.11
%------------------------------------------------------------------------------