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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KLE067+1 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 01:49:57 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_10,negated_conjecture,
    domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjr08v9w/input.p',i_0_10) ).

cnf(i_0_9,plain,
    domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjr08v9w/input.p',i_0_9) ).

cnf(i_0_6,plain,
    domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjr08v9w/input.p',i_0_6) ).

cnf(i_0_14,plain,
    multiplication(one,X1) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vjr08v9w/input.p',i_0_14) ).

cnf(c_0_19,negated_conjecture,
    domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
    i_0_10 ).

cnf(c_0_20,plain,
    domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
    i_0_9 ).

cnf(c_0_21,plain,
    domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
    i_0_6 ).

cnf(c_0_22,plain,
    multiplication(one,X1) = X1,
    i_0_14 ).

cnf(c_0_23,negated_conjecture,
    domain(domain(addition(esk1_0,esk2_0))) != domain(addition(esk1_0,esk2_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).

cnf(c_0_24,plain,
    domain(domain(X1)) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
    [proof] ).

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