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

View Problem - Process Solution

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

% Computer : n026.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:22 EDT 2022

% Result   : Theorem 7.04s 2.33s
% Output   : CNFRefutation 7.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   12 (   3 unt;   2 nHn;   8 RR)
%            Number of literals    :   23 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   33 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
    ( sum(X1,X2,X3)
    | difference(X3,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yrvy35p0/input.p',i_0_6) ).

cnf(i_0_19,plain,
    ( sum(X1,X2,X3)
    | ~ difference(X3,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yrvy35p0/input.p',i_0_19) ).

cnf(i_0_8,negated_conjecture,
    ( ~ sum(X1,X2,X3)
    | ~ difference(X3,X2,X1)
    | ~ difference(X3,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yrvy35p0/input.p',i_0_8) ).

cnf(i_0_20,plain,
    ( difference(X1,X2,X3)
    | ~ sum(X2,X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yrvy35p0/input.p',i_0_20) ).

cnf(c_0_25,negated_conjecture,
    ( sum(X1,X2,X3)
    | difference(X3,X1,X2) ),
    i_0_6 ).

cnf(c_0_26,plain,
    ( sum(X1,X2,X3)
    | ~ difference(X3,X1,X2) ),
    i_0_19 ).

cnf(c_0_27,negated_conjecture,
    ( ~ sum(X1,X2,X3)
    | ~ difference(X3,X2,X1)
    | ~ difference(X3,X1,X2) ),
    i_0_8 ).

cnf(c_0_28,plain,
    ( difference(X1,X2,X3)
    | ~ sum(X2,X3,X1) ),
    i_0_20 ).

cnf(c_0_29,negated_conjecture,
    sum(X1,X2,X3),
    inference(csr,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ difference(X1,X2,X3)
    | ~ sum(X3,X2,X1) ),
    inference(csr,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    difference(X1,X2,X3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_29])]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : NUM341+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jul  7 18:09:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.47  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.04/2.33  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.04/2.33  # Version: 2.1pre011
% 7.04/2.33  # Preprocessing time       : 0.011 s
% 7.04/2.33  
% 7.04/2.33  # Proof found!
% 7.04/2.33  # SZS status Theorem
% 7.04/2.33  # SZS output start CNFRefutation
% See solution above
% 7.04/2.33  # Proof object total steps             : 12
% 7.04/2.33  # Proof object clause steps            : 8
% 7.04/2.33  # Proof object formula steps           : 4
% 7.04/2.33  # Proof object conjectures             : 7
% 7.04/2.33  # Proof object clause conjectures      : 5
% 7.04/2.33  # Proof object formula conjectures     : 2
% 7.04/2.33  # Proof object initial clauses used    : 4
% 7.04/2.33  # Proof object initial formulas used   : 4
% 7.04/2.33  # Proof object generating inferences   : 0
% 7.04/2.33  # Proof object simplifying inferences  : 8
% 7.04/2.33  # Training examples: 0 positive, 0 negative
% 7.04/2.33  # Parsed axioms                        : 163
% 7.04/2.33  # Removed by relevancy pruning/SinE    : 0
% 7.04/2.33  # Initial clauses                      : 163
% 7.04/2.33  # Removed in clause preprocessing      : 0
% 7.04/2.33  # Initial clauses in saturation        : 163
% 7.04/2.33  # Processed clauses                    : 169
% 7.04/2.33  # ...of these trivial                  : 125
% 7.04/2.33  # ...subsumed                          : 4
% 7.04/2.33  # ...remaining for further processing  : 39
% 7.04/2.33  # Other redundant clauses eliminated   : 2
% 7.04/2.33  # Clauses deleted for lack of memory   : 0
% 7.04/2.33  # Backward-subsumed                    : 3
% 7.04/2.33  # Backward-rewritten                   : 19
% 7.04/2.33  # Generated clauses                    : 47
% 7.04/2.33  # ...of the previous two non-trivial   : 57
% 7.04/2.33  # Contextual simplify-reflections      : 4
% 7.04/2.33  # Paramodulations                      : 43
% 7.04/2.33  # Factorizations                       : 2
% 7.04/2.33  # Equation resolutions                 : 2
% 7.04/2.33  # Propositional unsat checks           : 0
% 7.04/2.33  # Propositional unsat check successes  : 0
% 7.04/2.33  # Current number of processed clauses  : 15
% 7.04/2.33  #    Positive orientable unit clauses  : 9
% 7.04/2.33  #    Positive unorientable unit clauses: 1
% 7.04/2.33  #    Negative unit clauses             : 1
% 7.04/2.33  #    Non-unit-clauses                  : 4
% 7.04/2.33  # Current number of unprocessed clauses: 46
% 7.04/2.33  # ...number of literals in the above   : 50
% 7.04/2.33  # Current number of archived formulas  : 0
% 7.04/2.33  # Current number of archived clauses   : 22
% 7.04/2.33  # Clause-clause subsumption calls (NU) : 72
% 7.04/2.33  # Rec. Clause-clause subsumption calls : 67
% 7.04/2.33  # Non-unit clause-clause subsumptions  : 7
% 7.04/2.33  # Unit Clause-clause subsumption calls : 11
% 7.04/2.33  # Rewrite failures with RHS unbound    : 0
% 7.04/2.33  # BW rewrite match attempts            : 41
% 7.04/2.33  # BW rewrite match successes           : 40
% 7.04/2.33  # Condensation attempts                : 0
% 7.04/2.33  # Condensation successes               : 0
% 7.04/2.33  # Termbank termtop insertions          : 3616
% 7.04/2.33  
% 7.04/2.33  # -------------------------------------------------
% 7.04/2.33  # User time                : 0.010 s
% 7.04/2.33  # System time              : 0.002 s
% 7.04/2.33  # Total time               : 0.012 s
% 7.04/2.33  # ...preprocessing         : 0.011 s
% 7.04/2.33  # ...main loop             : 0.001 s
% 7.04/2.33  # Maximum resident set size: 7136 pages
% 7.04/2.33  
%------------------------------------------------------------------------------