TSTP Solution File: NUM297+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM297+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:07 EDT 2022
% Result : Theorem 8.69s 2.51s
% Output : CNFRefutation 8.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 12 unt; 0 nHn; 18 RR)
% Number of literals : 31 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_neg(X3))
| ~ rdn_translate(X1,rdn_neg(X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-32eb_dtj/input.p',i_0_6) ).
cnf(i_0_139,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-32eb_dtj/input.p',i_0_139) ).
cnf(i_0_154,plain,
( rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X3),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-32eb_dtj/input.p',i_0_154) ).
cnf(i_0_146,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-32eb_dtj/input.p',i_0_146) ).
cnf(i_0_140,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-32eb_dtj/input.p',i_0_140) ).
cnf(i_0_18,negated_conjecture,
~ less(nn4,nn2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-32eb_dtj/input.p',i_0_18) ).
cnf(i_0_145,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-32eb_dtj/input.p',i_0_145) ).
cnf(c_0_162,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_neg(X3))
| ~ rdn_translate(X1,rdn_neg(X4)) ),
i_0_6 ).
cnf(c_0_163,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
i_0_139 ).
cnf(c_0_164,plain,
( rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X3),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
i_0_154 ).
cnf(c_0_165,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
i_0_146 ).
cnf(c_0_166,plain,
( less(X1,nn2)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_positive_less(rdnn(n2),X2) ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_167,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
i_0_140 ).
cnf(c_0_168,negated_conjecture,
~ less(nn4,nn2),
i_0_18 ).
cnf(c_0_169,plain,
( rdn_positive_less(rdnn(X1),rdnn(n4))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_170,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
i_0_145 ).
cnf(c_0_171,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_168]) ).
cnf(c_0_172,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_171]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM297+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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 : Fri Jul 8 00:16:52 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.69/2.51 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.69/2.51 # Version: 2.1pre011
% 8.69/2.51 # Preprocessing time : 0.018 s
% 8.69/2.51
% 8.69/2.51 # Proof found!
% 8.69/2.51 # SZS status Theorem
% 8.69/2.51 # SZS output start CNFRefutation
% See solution above
% 8.69/2.51 # Proof object total steps : 18
% 8.69/2.51 # Proof object clause steps : 11
% 8.69/2.51 # Proof object formula steps : 7
% 8.69/2.51 # Proof object conjectures : 2
% 8.69/2.51 # Proof object clause conjectures : 1
% 8.69/2.51 # Proof object formula conjectures : 1
% 8.69/2.51 # Proof object initial clauses used : 7
% 8.69/2.51 # Proof object initial formulas used : 7
% 8.69/2.51 # Proof object generating inferences : 4
% 8.69/2.51 # Proof object simplifying inferences : 2
% 8.69/2.51 # Training examples: 0 positive, 0 negative
% 8.69/2.51 # Parsed axioms : 163
% 8.69/2.51 # Removed by relevancy pruning/SinE : 0
% 8.69/2.51 # Initial clauses : 163
% 8.69/2.51 # Removed in clause preprocessing : 0
% 8.69/2.51 # Initial clauses in saturation : 163
% 8.69/2.51 # Processed clauses : 360
% 8.69/2.51 # ...of these trivial : 0
% 8.69/2.51 # ...subsumed : 9
% 8.69/2.51 # ...remaining for further processing : 351
% 8.69/2.51 # Other redundant clauses eliminated : 2
% 8.69/2.51 # Clauses deleted for lack of memory : 0
% 8.69/2.51 # Backward-subsumed : 0
% 8.69/2.51 # Backward-rewritten : 0
% 8.69/2.51 # Generated clauses : 487
% 8.69/2.51 # ...of the previous two non-trivial : 464
% 8.69/2.51 # Contextual simplify-reflections : 4
% 8.69/2.51 # Paramodulations : 483
% 8.69/2.51 # Factorizations : 2
% 8.69/2.51 # Equation resolutions : 2
% 8.69/2.51 # Propositional unsat checks : 0
% 8.69/2.51 # Propositional unsat check successes : 0
% 8.69/2.51 # Current number of processed clauses : 349
% 8.69/2.51 # Positive orientable unit clauses : 162
% 8.69/2.51 # Positive unorientable unit clauses: 0
% 8.69/2.51 # Negative unit clauses : 57
% 8.69/2.51 # Non-unit-clauses : 130
% 8.69/2.51 # Current number of unprocessed clauses: 267
% 8.69/2.51 # ...number of literals in the above : 1047
% 8.69/2.51 # Current number of archived formulas : 0
% 8.69/2.51 # Current number of archived clauses : 0
% 8.69/2.51 # Clause-clause subsumption calls (NU) : 2551
% 8.69/2.51 # Rec. Clause-clause subsumption calls : 1946
% 8.69/2.51 # Non-unit clause-clause subsumptions : 9
% 8.69/2.51 # Unit Clause-clause subsumption calls : 3112
% 8.69/2.51 # Rewrite failures with RHS unbound : 0
% 8.69/2.51 # BW rewrite match attempts : 1
% 8.69/2.51 # BW rewrite match successes : 0
% 8.69/2.51 # Condensation attempts : 0
% 8.69/2.51 # Condensation successes : 0
% 8.69/2.51 # Termbank termtop insertions : 12152
% 8.69/2.51
% 8.69/2.51 # -------------------------------------------------
% 8.69/2.51 # User time : 0.026 s
% 8.69/2.51 # System time : 0.005 s
% 8.69/2.51 # Total time : 0.031 s
% 8.69/2.51 # ...preprocessing : 0.018 s
% 8.69/2.51 # ...main loop : 0.013 s
% 8.69/2.51 # Maximum resident set size: 7124 pages
% 8.69/2.51
%------------------------------------------------------------------------------