%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:47 AM UTC 2026
% Result : Theorem 15.44s 4.25s
% Output : CNFRefutation 15.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 12 RR)
% Number of literals : 29 ( 6 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_59,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_bqq22h/input.p',i_0_59) ).
cnf(i_0_31,plain,
op_implies_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_bqq22h/input.p',i_0_31) ).
cnf(i_0_9,plain,
( cn2
| ~ is_a_theorem(implies(esk10_0,implies(not(esk10_0),esk11_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_bqq22h/input.p',i_0_9) ).
cnf(i_0_48,negated_conjecture,
~ cn2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_bqq22h/input.p',i_0_48) ).
cnf(i_0_61,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_bqq22h/input.p',i_0_61) ).
cnf(i_0_32,plain,
op_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_bqq22h/input.p',i_0_32) ).
cnf(i_0_63,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_bqq22h/input.p',i_0_63) ).
cnf(i_0_33,plain,
or_1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c_bqq22h/input.p',i_0_33) ).
cnf(c_0_72,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_59 ).
cnf(c_0_73,plain,
op_implies_and,
i_0_31 ).
cnf(c_0_74,plain,
( cn2
| ~ is_a_theorem(implies(esk10_0,implies(not(esk10_0),esk11_0))) ),
i_0_9 ).
cnf(c_0_75,negated_conjecture,
~ cn2,
i_0_48 ).
cnf(c_0_76,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_61 ).
cnf(c_0_77,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_78,plain,
op_or,
i_0_32 ).
cnf(c_0_79,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
i_0_63 ).
cnf(c_0_80,plain,
or_1,
i_0_33 ).
cnf(c_0_81,plain,
~ is_a_theorem(implies(esk10_0,implies(not(esk10_0),esk11_0))),
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_78])]) ).
cnf(c_0_83,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_84,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 5 01:05:20 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.45 # 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
% 15.44/4.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 15.44/4.25 # Version: 2.1pre011
% 15.44/4.25 # Preprocessing time : 0.016 s
% 15.44/4.25
% 15.44/4.25 # Proof found!
% 15.44/4.25 # SZS status Theorem
% 15.44/4.25 # SZS output start CNFRefutation
% See solution above
% 15.44/4.25 # Proof object total steps : 21
% 15.44/4.25 # Proof object clause steps : 13
% 15.44/4.25 # Proof object formula steps : 8
% 15.44/4.25 # Proof object conjectures : 2
% 15.44/4.25 # Proof object clause conjectures : 1
% 15.44/4.25 # Proof object formula conjectures : 1
% 15.44/4.25 # Proof object initial clauses used : 8
% 15.44/4.25 # Proof object initial formulas used : 8
% 15.44/4.25 # Proof object generating inferences : 0
% 15.44/4.25 # Proof object simplifying inferences : 11
% 15.44/4.25 # Training examples: 0 positive, 0 negative
% 15.44/4.25 # Parsed axioms : 81
% 15.44/4.25 # Removed by relevancy pruning/SinE : 0
% 15.44/4.25 # Initial clauses : 81
% 15.44/4.25 # Removed in clause preprocessing : 0
% 15.44/4.25 # Initial clauses in saturation : 81
% 15.44/4.25 # Processed clauses : 47
% 15.44/4.25 # ...of these trivial : 12
% 15.44/4.25 # ...subsumed : 0
% 15.44/4.25 # ...remaining for further processing : 35
% 15.44/4.25 # Other redundant clauses eliminated : 0
% 15.44/4.25 # Clauses deleted for lack of memory : 0
% 15.44/4.25 # Backward-subsumed : 0
% 15.44/4.25 # Backward-rewritten : 4
% 15.44/4.25 # Generated clauses : 21
% 15.44/4.25 # ...of the previous two non-trivial : 14
% 15.44/4.25 # Contextual simplify-reflections : 0
% 15.44/4.25 # Paramodulations : 21
% 15.44/4.25 # Factorizations : 0
% 15.44/4.25 # Equation resolutions : 0
% 15.44/4.25 # Propositional unsat checks : 0
% 15.44/4.25 # Propositional unsat check successes : 0
% 15.44/4.25 # Current number of processed clauses : 31
% 15.44/4.25 # Positive orientable unit clauses : 24
% 15.44/4.25 # Positive unorientable unit clauses: 0
% 15.44/4.25 # Negative unit clauses : 1
% 15.44/4.25 # Non-unit-clauses : 6
% 15.44/4.25 # Current number of unprocessed clauses: 48
% 15.44/4.25 # ...number of literals in the above : 97
% 15.44/4.25 # Current number of archived formulas : 0
% 15.44/4.25 # Current number of archived clauses : 4
% 15.44/4.25 # Clause-clause subsumption calls (NU) : 0
% 15.44/4.25 # Rec. Clause-clause subsumption calls : 0
% 15.44/4.25 # Non-unit clause-clause subsumptions : 0
% 15.44/4.25 # Unit Clause-clause subsumption calls : 14
% 15.44/4.25 # Rewrite failures with RHS unbound : 0
% 15.44/4.25 # BW rewrite match attempts : 5
% 15.44/4.25 # BW rewrite match successes : 3
% 15.44/4.25 # Condensation attempts : 0
% 15.44/4.25 # Condensation successes : 0
% 15.44/4.25 # Termbank termtop insertions : 1513
% 15.44/4.25
% 15.44/4.25 # -------------------------------------------------
% 15.44/4.25 # User time : 0.014 s
% 15.44/4.25 # System time : 0.004 s
% 15.44/4.25 # Total time : 0.018 s
% 15.44/4.25 # ...preprocessing : 0.016 s
% 15.44/4.25 # ...main loop : 0.002 s
% 15.44/4.25 # Maximum resident set size: 6400 pages
% 15.44/4.25
%------------------------------------------------------------------------------