TSTP Solution File: SYN986+1.001 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN986+1.001 : TPTP v8.1.0. Released v4.0.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 : Thu Jul 21 04:58:39 EDT 2022

% Result   : Theorem 5.54s 2.16s
% Output   : CNFRefutation 5.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   10 (   5 unt;   0 nHn;   8 RR)
%            Number of literals    :   17 (   0 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   18 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( ~ r(zero,X1,X2)
    | ~ r(zero,zero,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_pkr2wzd/input.p',i_0_1) ).

cnf(i_0_2,plain,
    r(X1,zero,succ(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_pkr2wzd/input.p',i_0_2) ).

cnf(i_0_3,plain,
    ( r(X1,succ(X2),X3)
    | ~ r(X4,X2,X3)
    | ~ r(X1,X2,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_pkr2wzd/input.p',i_0_3) ).

cnf(c_0_7,negated_conjecture,
    ( ~ r(zero,X1,X2)
    | ~ r(zero,zero,X1) ),
    i_0_1 ).

cnf(c_0_8,plain,
    r(X1,zero,succ(X1)),
    i_0_2 ).

cnf(c_0_9,plain,
    ( r(X1,succ(X2),X3)
    | ~ r(X4,X2,X3)
    | ~ r(X1,X2,X4) ),
    i_0_3 ).

cnf(c_0_10,negated_conjecture,
    ~ r(zero,succ(zero),X1),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ( r(X1,succ(zero),succ(X2))
    | ~ r(X1,zero,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ~ r(zero,zero,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,plain,
    $false,
    inference(spm,[status(thm)],[c_0_12,c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n017.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jul 11 22:44:36 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected SinE mode:
% 0.17/0.44  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.17/0.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.17/0.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 5.54/2.16  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 5.54/2.16  # Version: 2.1pre011
% 5.54/2.16  # Preprocessing time       : 0.015 s
% 5.54/2.16  
% 5.54/2.16  # Proof found!
% 5.54/2.16  # SZS status Theorem
% 5.54/2.16  # SZS output start CNFRefutation
% See solution above
% 5.54/2.16  # Proof object total steps             : 10
% 5.54/2.16  # Proof object clause steps            : 7
% 5.54/2.16  # Proof object formula steps           : 3
% 5.54/2.16  # Proof object conjectures             : 4
% 5.54/2.16  # Proof object clause conjectures      : 3
% 5.54/2.16  # Proof object formula conjectures     : 1
% 5.54/2.16  # Proof object initial clauses used    : 3
% 5.54/2.16  # Proof object initial formulas used   : 3
% 5.54/2.16  # Proof object generating inferences   : 4
% 5.54/2.16  # Proof object simplifying inferences  : 0
% 5.54/2.16  # Training examples: 0 positive, 0 negative
% 5.54/2.16  # Parsed axioms                        : 3
% 5.54/2.16  # Removed by relevancy pruning/SinE    : 0
% 5.54/2.16  # Initial clauses                      : 3
% 5.54/2.16  # Removed in clause preprocessing      : 0
% 5.54/2.16  # Initial clauses in saturation        : 3
% 5.54/2.16  # Processed clauses                    : 6
% 5.54/2.16  # ...of these trivial                  : 0
% 5.54/2.16  # ...subsumed                          : 0
% 5.54/2.16  # ...remaining for further processing  : 6
% 5.54/2.16  # Other redundant clauses eliminated   : 0
% 5.54/2.16  # Clauses deleted for lack of memory   : 0
% 5.54/2.16  # Backward-subsumed                    : 0
% 5.54/2.16  # Backward-rewritten                   : 0
% 5.54/2.16  # Generated clauses                    : 5
% 5.54/2.16  # ...of the previous two non-trivial   : 4
% 5.54/2.16  # Contextual simplify-reflections      : 0
% 5.54/2.16  # Paramodulations                      : 5
% 5.54/2.16  # Factorizations                       : 0
% 5.54/2.16  # Equation resolutions                 : 0
% 5.54/2.16  # Propositional unsat checks           : 0
% 5.54/2.16  # Propositional unsat check successes  : 0
% 5.54/2.16  # Current number of processed clauses  : 6
% 5.54/2.16  #    Positive orientable unit clauses  : 1
% 5.54/2.16  #    Positive unorientable unit clauses: 0
% 5.54/2.16  #    Negative unit clauses             : 2
% 5.54/2.16  #    Non-unit-clauses                  : 3
% 5.54/2.16  # Current number of unprocessed clauses: 1
% 5.54/2.16  # ...number of literals in the above   : 3
% 5.54/2.16  # Current number of archived formulas  : 0
% 5.54/2.16  # Current number of archived clauses   : 0
% 5.54/2.16  # Clause-clause subsumption calls (NU) : 0
% 5.54/2.16  # Rec. Clause-clause subsumption calls : 0
% 5.54/2.16  # Non-unit clause-clause subsumptions  : 0
% 5.54/2.16  # Unit Clause-clause subsumption calls : 3
% 5.54/2.16  # Rewrite failures with RHS unbound    : 0
% 5.54/2.16  # BW rewrite match attempts            : 1
% 5.54/2.16  # BW rewrite match successes           : 0
% 5.54/2.16  # Condensation attempts                : 0
% 5.54/2.16  # Condensation successes               : 0
% 5.54/2.16  # Termbank termtop insertions          : 127
% 5.54/2.16  
% 5.54/2.16  # -------------------------------------------------
% 5.54/2.16  # User time                : 0.012 s
% 5.54/2.16  # System time              : 0.003 s
% 5.54/2.16  # Total time               : 0.015 s
% 5.54/2.16  # ...preprocessing         : 0.015 s
% 5.54/2.16  # ...main loop             : 0.000 s
% 5.54/2.16  # Maximum resident set size: 7136 pages
% 5.54/2.16  
%------------------------------------------------------------------------------