%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM295+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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 08:24:06 EDT 2022
% Result : Theorem 8.08s 2.29s
% Output : CNFRefutation 8.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 11 unt; 2 nHn; 14 RR)
% Number of literals : 27 ( 3 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 25 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( less(X1,X2)
| ~ rdn_translate(X2,rdn_pos(X3))
| ~ rdn_translate(X1,rdn_neg(X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl616n1w/input.p',i_0_7) ).
cnf(i_0_152,negated_conjecture,
~ less(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl616n1w/input.p',i_0_152) ).
cnf(i_0_12,plain,
( X1 = X2
| less(X2,X1)
| less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl616n1w/input.p',i_0_12) ).
cnf(i_0_18,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl616n1w/input.p',i_0_18) ).
cnf(i_0_19,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl616n1w/input.p',i_0_19) ).
cnf(c_0_158,plain,
( less(X1,X2)
| ~ rdn_translate(X2,rdn_pos(X3))
| ~ rdn_translate(X1,rdn_neg(X4)) ),
i_0_7 ).
cnf(c_0_159,negated_conjecture,
~ less(X1,X2),
i_0_152 ).
cnf(c_0_160,plain,
( X1 = X2
| less(X2,X1)
| less(X1,X2) ),
i_0_12 ).
cnf(c_0_161,plain,
( ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_translate(X3,rdn_neg(X4)) ),
inference(sr,[status(thm)],[c_0_158,c_0_159]) ).
cnf(c_0_162,plain,
X1 = X2,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_160,c_0_159]),c_0_159]) ).
cnf(c_0_163,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
i_0_18 ).
cnf(c_0_164,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
i_0_19 ).
cnf(c_0_165,plain,
( ~ rdn_translate(X1,n1)
| ~ rdn_translate(X2,n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_162]),c_0_162]) ).
cnf(c_0_166,plain,
rdn_translate(n0,n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_162]),c_0_162]) ).
cnf(c_0_167,plain,
rdn_translate(n1,n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_162]),c_0_162]) ).
cnf(c_0_168,plain,
~ rdn_translate(X1,n1),
inference(spm,[status(thm)],[c_0_165,c_0_166]) ).
cnf(c_0_169,plain,
$false,
inference(sr,[status(thm)],[c_0_167,c_0_168]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM295+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n003.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 Jul 7 06:07:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.08/2.29 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.08/2.29 # Version: 2.1pre011
% 8.08/2.29 # Preprocessing time : 0.015 s
% 8.08/2.29
% 8.08/2.29 # Proof found!
% 8.08/2.29 # SZS status Theorem
% 8.08/2.29 # SZS output start CNFRefutation
% See solution above
% 8.08/2.29 # Proof object total steps : 17
% 8.08/2.29 # Proof object clause steps : 12
% 8.08/2.29 # Proof object formula steps : 5
% 8.08/2.29 # Proof object conjectures : 2
% 8.08/2.29 # Proof object clause conjectures : 1
% 8.08/2.29 # Proof object formula conjectures : 1
% 8.08/2.29 # Proof object initial clauses used : 5
% 8.08/2.29 # Proof object initial formulas used : 5
% 8.08/2.29 # Proof object generating inferences : 1
% 8.08/2.29 # Proof object simplifying inferences : 10
% 8.08/2.29 # Training examples: 0 positive, 0 negative
% 8.08/2.29 # Parsed axioms : 161
% 8.08/2.29 # Removed by relevancy pruning/SinE : 0
% 8.08/2.29 # Initial clauses : 161
% 8.08/2.29 # Removed in clause preprocessing : 0
% 8.08/2.29 # Initial clauses in saturation : 161
% 8.08/2.29 # Processed clauses : 170
% 8.08/2.29 # ...of these trivial : 125
% 8.08/2.29 # ...subsumed : 10
% 8.08/2.29 # ...remaining for further processing : 35
% 8.08/2.29 # Other redundant clauses eliminated : 1
% 8.08/2.29 # Clauses deleted for lack of memory : 0
% 8.08/2.29 # Backward-subsumed : 5
% 8.08/2.29 # Backward-rewritten : 15
% 8.08/2.29 # Generated clauses : 53
% 8.08/2.29 # ...of the previous two non-trivial : 62
% 8.08/2.29 # Contextual simplify-reflections : 6
% 8.08/2.29 # Paramodulations : 50
% 8.08/2.29 # Factorizations : 0
% 8.08/2.29 # Equation resolutions : 1
% 8.08/2.29 # Propositional unsat checks : 0
% 8.08/2.29 # Propositional unsat check successes : 0
% 8.08/2.29 # Current number of processed clauses : 12
% 8.08/2.29 # Positive orientable unit clauses : 5
% 8.08/2.29 # Positive unorientable unit clauses: 1
% 8.08/2.29 # Negative unit clauses : 2
% 8.08/2.29 # Non-unit-clauses : 4
% 8.08/2.29 # Current number of unprocessed clauses: 30
% 8.08/2.29 # ...number of literals in the above : 34
% 8.08/2.29 # Current number of archived formulas : 0
% 8.08/2.29 # Current number of archived clauses : 22
% 8.08/2.29 # Clause-clause subsumption calls (NU) : 102
% 8.08/2.29 # Rec. Clause-clause subsumption calls : 49
% 8.08/2.29 # Non-unit clause-clause subsumptions : 13
% 8.08/2.29 # Unit Clause-clause subsumption calls : 4
% 8.08/2.29 # Rewrite failures with RHS unbound : 0
% 8.08/2.29 # BW rewrite match attempts : 44
% 8.08/2.29 # BW rewrite match successes : 44
% 8.08/2.29 # Condensation attempts : 0
% 8.08/2.29 # Condensation successes : 0
% 8.08/2.29 # Termbank termtop insertions : 3683
% 8.08/2.29
% 8.08/2.29 # -------------------------------------------------
% 8.08/2.29 # User time : 0.009 s
% 8.08/2.29 # System time : 0.007 s
% 8.08/2.29 # Total time : 0.016 s
% 8.08/2.29 # ...preprocessing : 0.015 s
% 8.08/2.29 # ...main loop : 0.001 s
% 8.08/2.29 # Maximum resident set size: 7128 pages
% 8.08/2.29
%------------------------------------------------------------------------------