%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL469+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:49 AM UTC 2026
% Result : Theorem 10.15s 3.81s
% Output : CNFRefutation 10.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% 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_49,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f5g6d0gw/input.p',i_0_49) ).
cnf(i_0_20,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f5g6d0gw/input.p',i_0_20) ).
cnf(i_0_51,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f5g6d0gw/input.p',i_0_51) ).
cnf(i_0_21,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f5g6d0gw/input.p',i_0_21) ).
cnf(i_0_52,plain,
( or_1
| ~ is_a_theorem(implies(esk36_0,or(esk36_0,esk37_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f5g6d0gw/input.p',i_0_52) ).
cnf(i_0_22,negated_conjecture,
~ or_1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f5g6d0gw/input.p',i_0_22) ).
cnf(i_0_10,plain,
( is_a_theorem(implies(X1,implies(not(X1),X2)))
| ~ cn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f5g6d0gw/input.p',i_0_10) ).
cnf(i_0_36,plain,
cn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f5g6d0gw/input.p',i_0_36) ).
cnf(c_0_61,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_49 ).
cnf(c_0_62,plain,
op_implies_and,
i_0_20 ).
cnf(c_0_63,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_51 ).
cnf(c_0_64,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_65,plain,
op_or,
i_0_21 ).
cnf(c_0_66,plain,
( or_1
| ~ is_a_theorem(implies(esk36_0,or(esk36_0,esk37_0))) ),
i_0_52 ).
cnf(c_0_67,negated_conjecture,
~ or_1,
i_0_22 ).
cnf(c_0_68,plain,
( is_a_theorem(implies(X1,implies(not(X1),X2)))
| ~ cn2 ),
i_0_10 ).
cnf(c_0_69,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_70,plain,
cn2,
i_0_36 ).
cnf(c_0_71,plain,
~ is_a_theorem(implies(esk36_0,or(esk36_0,esk37_0))),
inference(sr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_73,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL469+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 4 18:41:25 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.13/0.41 # ENIGMATIC: Selected SinE mode:
% 0.13/0.41 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.41 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.41 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.41 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.15/3.81 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 10.15/3.81 # Version: 2.1pre011
% 10.15/3.81 # Preprocessing time : 0.016 s
% 10.15/3.81
% 10.15/3.81 # Proof found!
% 10.15/3.81 # SZS status Theorem
% 10.15/3.81 # SZS output start CNFRefutation
% See solution above
% 10.15/3.81 # Proof object total steps : 21
% 10.15/3.81 # Proof object clause steps : 13
% 10.15/3.81 # Proof object formula steps : 8
% 10.15/3.81 # Proof object conjectures : 2
% 10.15/3.81 # Proof object clause conjectures : 1
% 10.15/3.81 # Proof object formula conjectures : 1
% 10.15/3.81 # Proof object initial clauses used : 8
% 10.15/3.81 # Proof object initial formulas used : 8
% 10.15/3.81 # Proof object generating inferences : 0
% 10.15/3.81 # Proof object simplifying inferences : 11
% 10.15/3.81 # Training examples: 0 positive, 0 negative
% 10.15/3.81 # Parsed axioms : 71
% 10.15/3.81 # Removed by relevancy pruning/SinE : 0
% 10.15/3.81 # Initial clauses : 71
% 10.15/3.81 # Removed in clause preprocessing : 0
% 10.15/3.81 # Initial clauses in saturation : 71
% 10.15/3.81 # Processed clauses : 53
% 10.15/3.81 # ...of these trivial : 9
% 10.15/3.81 # ...subsumed : 1
% 10.15/3.81 # ...remaining for further processing : 43
% 10.15/3.81 # Other redundant clauses eliminated : 0
% 10.15/3.81 # Clauses deleted for lack of memory : 0
% 10.15/3.81 # Backward-subsumed : 0
% 10.15/3.81 # Backward-rewritten : 3
% 10.15/3.81 # Generated clauses : 49
% 10.15/3.81 # ...of the previous two non-trivial : 39
% 10.15/3.81 # Contextual simplify-reflections : 0
% 10.15/3.81 # Paramodulations : 49
% 10.15/3.81 # Factorizations : 0
% 10.15/3.81 # Equation resolutions : 0
% 10.15/3.81 # Propositional unsat checks : 0
% 10.15/3.81 # Propositional unsat check successes : 0
% 10.15/3.81 # Current number of processed clauses : 40
% 10.15/3.81 # Positive orientable unit clauses : 12
% 10.15/3.81 # Positive unorientable unit clauses: 0
% 10.15/3.81 # Negative unit clauses : 1
% 10.15/3.81 # Non-unit-clauses : 27
% 10.15/3.81 # Current number of unprocessed clauses: 57
% 10.15/3.81 # ...number of literals in the above : 124
% 10.15/3.81 # Current number of archived formulas : 0
% 10.15/3.81 # Current number of archived clauses : 3
% 10.15/3.81 # Clause-clause subsumption calls (NU) : 22
% 10.15/3.81 # Rec. Clause-clause subsumption calls : 21
% 10.15/3.81 # Non-unit clause-clause subsumptions : 0
% 10.15/3.81 # Unit Clause-clause subsumption calls : 8
% 10.15/3.81 # Rewrite failures with RHS unbound : 0
% 10.15/3.81 # BW rewrite match attempts : 6
% 10.15/3.81 # BW rewrite match successes : 2
% 10.15/3.81 # Condensation attempts : 0
% 10.15/3.81 # Condensation successes : 0
% 10.15/3.81 # Termbank termtop insertions : 1713
% 10.15/3.81
% 10.15/3.81 # -------------------------------------------------
% 10.15/3.81 # User time : 0.017 s
% 10.15/3.81 # System time : 0.002 s
% 10.15/3.81 # Total time : 0.019 s
% 10.15/3.81 # ...preprocessing : 0.016 s
% 10.15/3.81 # ...main loop : 0.003 s
% 10.15/3.81 # Maximum resident set size: 6656 pages
% 10.15/3.81
%------------------------------------------------------------------------------