TSTP Solution File: NUM298+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n020.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:08 EDT 2022

% Result   : Theorem 7.16s 2.36s
% Output   : CNFRefutation 7.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   8 unt;   0 nHn;  13 RR)
%            Number of literals    :   20 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   14 (   5 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/sandbox2/tmp/enigma-theBenchmark.p-3q8k11n7/input.p',i_0_7) ).

cnf(i_0_21,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q8k11n7/input.p',i_0_21) ).

cnf(i_0_14,plain,
    ( ~ less(X1,X2)
    | ~ less(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q8k11n7/input.p',i_0_14) ).

cnf(i_0_18,negated_conjecture,
    less(n2,nn2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q8k11n7/input.p',i_0_18) ).

cnf(i_0_139,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3q8k11n7/input.p',i_0_139) ).

cnf(c_0_145,plain,
    ( less(X1,X2)
    | ~ rdn_translate(X2,rdn_pos(X3))
    | ~ rdn_translate(X1,rdn_neg(X4)) ),
    i_0_7 ).

cnf(c_0_146,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    i_0_21 ).

cnf(c_0_147,plain,
    ( ~ less(X1,X2)
    | ~ less(X2,X1) ),
    i_0_14 ).

cnf(c_0_148,negated_conjecture,
    less(n2,nn2),
    i_0_18 ).

cnf(c_0_149,plain,
    ( less(X1,n2)
    | ~ rdn_translate(X1,rdn_neg(X2)) ),
    inference(spm,[status(thm)],[c_0_145,c_0_146]) ).

cnf(c_0_150,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    i_0_139 ).

cnf(c_0_151,negated_conjecture,
    ~ less(nn2,n2),
    inference(spm,[status(thm)],[c_0_147,c_0_148]) ).

cnf(c_0_152,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_151]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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 01:44:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected SinE mode:
% 0.18/0.46  # Parsing /export/starexec/sandbox2/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
% 7.16/2.36  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.16/2.36  # Version: 2.1pre011
% 7.16/2.36  # Preprocessing time       : 0.019 s
% 7.16/2.36  
% 7.16/2.36  # Proof found!
% 7.16/2.36  # SZS status Theorem
% 7.16/2.36  # SZS output start CNFRefutation
% See solution above
% 7.16/2.36  # Proof object total steps             : 13
% 7.16/2.36  # Proof object clause steps            : 8
% 7.16/2.36  # Proof object formula steps           : 5
% 7.16/2.36  # Proof object conjectures             : 3
% 7.16/2.36  # Proof object clause conjectures      : 2
% 7.16/2.36  # Proof object formula conjectures     : 1
% 7.16/2.36  # Proof object initial clauses used    : 5
% 7.16/2.36  # Proof object initial formulas used   : 5
% 7.16/2.36  # Proof object generating inferences   : 3
% 7.16/2.36  # Proof object simplifying inferences  : 1
% 7.16/2.36  # Training examples: 0 positive, 0 negative
% 7.16/2.36  # Parsed axioms                        : 162
% 7.16/2.36  # Removed by relevancy pruning/SinE    : 0
% 7.16/2.36  # Initial clauses                      : 162
% 7.16/2.36  # Removed in clause preprocessing      : 0
% 7.16/2.36  # Initial clauses in saturation        : 162
% 7.16/2.36  # Processed clauses                    : 166
% 7.16/2.36  # ...of these trivial                  : 0
% 7.16/2.36  # ...subsumed                          : 0
% 7.16/2.36  # ...remaining for further processing  : 166
% 7.16/2.36  # Other redundant clauses eliminated   : 2
% 7.16/2.36  # Clauses deleted for lack of memory   : 0
% 7.16/2.36  # Backward-subsumed                    : 0
% 7.16/2.36  # Backward-rewritten                   : 0
% 7.16/2.36  # Generated clauses                    : 220
% 7.16/2.36  # ...of the previous two non-trivial   : 211
% 7.16/2.36  # Contextual simplify-reflections      : 0
% 7.16/2.36  # Paramodulations                      : 216
% 7.16/2.36  # Factorizations                       : 2
% 7.16/2.36  # Equation resolutions                 : 2
% 7.16/2.36  # Propositional unsat checks           : 0
% 7.16/2.36  # Propositional unsat check successes  : 0
% 7.16/2.36  # Current number of processed clauses  : 164
% 7.16/2.36  #    Positive orientable unit clauses  : 131
% 7.16/2.36  #    Positive unorientable unit clauses: 0
% 7.16/2.36  #    Negative unit clauses             : 2
% 7.16/2.36  #    Non-unit-clauses                  : 31
% 7.16/2.36  # Current number of unprocessed clauses: 207
% 7.16/2.36  # ...number of literals in the above   : 932
% 7.16/2.36  # Current number of archived formulas  : 0
% 7.16/2.36  # Current number of archived clauses   : 0
% 7.16/2.36  # Clause-clause subsumption calls (NU) : 624
% 7.16/2.36  # Rec. Clause-clause subsumption calls : 187
% 7.16/2.36  # Non-unit clause-clause subsumptions  : 0
% 7.16/2.36  # Unit Clause-clause subsumption calls : 65
% 7.16/2.36  # Rewrite failures with RHS unbound    : 0
% 7.16/2.36  # BW rewrite match attempts            : 1
% 7.16/2.36  # BW rewrite match successes           : 0
% 7.16/2.36  # Condensation attempts                : 0
% 7.16/2.36  # Condensation successes               : 0
% 7.16/2.36  # Termbank termtop insertions          : 9077
% 7.16/2.36  
% 7.16/2.36  # -------------------------------------------------
% 7.16/2.36  # User time                : 0.021 s
% 7.16/2.36  # System time              : 0.006 s
% 7.16/2.36  # Total time               : 0.027 s
% 7.16/2.36  # ...preprocessing         : 0.019 s
% 7.16/2.36  # ...main loop             : 0.008 s
% 7.16/2.36  # Maximum resident set size: 7132 pages
% 7.16/2.36  
%------------------------------------------------------------------------------