%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN069+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 16:24:55 EDT 2022
% Result : Theorem 7.79s 2.35s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 5 RR)
% Number of literals : 16 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 15 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_59,negated_conjecture,
( ~ r1(X1)
| ~ id(X2,X2)
| ~ r2(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hlk2rr_h/input.p',i_0_59) ).
cnf(i_0_43,plain,
id(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hlk2rr_h/input.p',i_0_43) ).
cnf(i_0_12,plain,
r2(X1,esk3_2(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hlk2rr_h/input.p',i_0_12) ).
cnf(i_0_33,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hlk2rr_h/input.p',i_0_33) ).
cnf(c_0_64,negated_conjecture,
( ~ r1(X1)
| ~ id(X2,X2)
| ~ r2(X1,X2) ),
i_0_59 ).
cnf(c_0_65,plain,
id(X1,X1),
i_0_43 ).
cnf(c_0_66,negated_conjecture,
( ~ r2(X1,X2)
| ~ r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_67,plain,
r2(X1,esk3_2(X2,X1)),
i_0_12 ).
cnf(c_0_68,plain,
r1(esk13_1(X1)),
i_0_33 ).
cnf(c_0_69,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,plain,
$false,
inference(sr,[status(thm)],[c_0_68,c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN069+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 10:03:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.79/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.79/2.35 # Version: 2.1pre011
% 7.79/2.35 # Preprocessing time : 0.011 s
% 7.79/2.35
% 7.79/2.35 # Proof found!
% 7.79/2.35 # SZS status Theorem
% 7.79/2.35 # SZS output start CNFRefutation
% See solution above
% 7.79/2.35 # Proof object total steps : 11
% 7.79/2.35 # Proof object clause steps : 7
% 7.79/2.35 # Proof object formula steps : 4
% 7.79/2.35 # Proof object conjectures : 4
% 7.79/2.35 # Proof object clause conjectures : 3
% 7.79/2.35 # Proof object formula conjectures : 1
% 7.79/2.35 # Proof object initial clauses used : 4
% 7.79/2.35 # Proof object initial formulas used : 4
% 7.79/2.35 # Proof object generating inferences : 1
% 7.79/2.35 # Proof object simplifying inferences : 3
% 7.79/2.35 # Training examples: 0 positive, 0 negative
% 7.79/2.35 # Parsed axioms : 43
% 7.79/2.35 # Removed by relevancy pruning/SinE : 0
% 7.79/2.35 # Initial clauses : 43
% 7.79/2.35 # Removed in clause preprocessing : 0
% 7.79/2.35 # Initial clauses in saturation : 43
% 7.79/2.35 # Processed clauses : 44
% 7.79/2.35 # ...of these trivial : 0
% 7.79/2.35 # ...subsumed : 0
% 7.79/2.35 # ...remaining for further processing : 44
% 7.79/2.35 # Other redundant clauses eliminated : 0
% 7.79/2.35 # Clauses deleted for lack of memory : 0
% 7.79/2.35 # Backward-subsumed : 0
% 7.79/2.35 # Backward-rewritten : 0
% 7.79/2.35 # Generated clauses : 109
% 7.79/2.35 # ...of the previous two non-trivial : 96
% 7.79/2.35 # Contextual simplify-reflections : 0
% 7.79/2.35 # Paramodulations : 104
% 7.79/2.35 # Factorizations : 0
% 7.79/2.35 # Equation resolutions : 0
% 7.79/2.35 # Propositional unsat checks : 0
% 7.79/2.35 # Propositional unsat check successes : 0
% 7.79/2.35 # Current number of processed clauses : 39
% 7.79/2.35 # Positive orientable unit clauses : 15
% 7.79/2.35 # Positive unorientable unit clauses: 0
% 7.79/2.35 # Negative unit clauses : 1
% 7.79/2.35 # Non-unit-clauses : 23
% 7.79/2.35 # Current number of unprocessed clauses: 80
% 7.79/2.35 # ...number of literals in the above : 219
% 7.79/2.35 # Current number of archived formulas : 0
% 7.79/2.35 # Current number of archived clauses : 5
% 7.79/2.35 # Clause-clause subsumption calls (NU) : 169
% 7.79/2.35 # Rec. Clause-clause subsumption calls : 78
% 7.79/2.35 # Non-unit clause-clause subsumptions : 0
% 7.79/2.35 # Unit Clause-clause subsumption calls : 44
% 7.79/2.35 # Rewrite failures with RHS unbound : 0
% 7.79/2.35 # BW rewrite match attempts : 5
% 7.79/2.35 # BW rewrite match successes : 0
% 7.79/2.35 # Condensation attempts : 0
% 7.79/2.35 # Condensation successes : 0
% 7.79/2.35 # Termbank termtop insertions : 1768
% 7.79/2.35
% 7.79/2.35 # -------------------------------------------------
% 7.79/2.35 # User time : 0.010 s
% 7.79/2.35 # System time : 0.002 s
% 7.79/2.35 # Total time : 0.012 s
% 7.79/2.35 # ...preprocessing : 0.011 s
% 7.79/2.35 # ...main loop : 0.002 s
% 7.79/2.35 # Maximum resident set size: 7124 pages
% 7.79/2.35
%------------------------------------------------------------------------------