TSTP Solution File: KLE020+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n024.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:37 EDT 2022

% Result   : Theorem 9.03s 2.66s
% Output   : CNFRefutation 9.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   59 (  42 unt;   0 nHn;  29 RR)
%            Number of literals    :   76 (  49 equ;  21 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   78 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
    ( multiplication(X1,X2) = zero
    | ~ complement(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_23) ).

cnf(i_0_19,plain,
    ( complement(esk4_1(X1),X1)
    | ~ test(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_19) ).

cnf(i_0_17,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_17) ).

cnf(i_0_4,plain,
    addition(X1,zero) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_4) ).

cnf(i_0_21,plain,
    ( addition(X1,X2) = one
    | ~ complement(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_21) ).

cnf(i_0_13,plain,
    multiplication(X1,one) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_13) ).

cnf(i_0_1,plain,
    addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_1) ).

cnf(i_0_3,plain,
    addition(X1,X1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_3) ).

cnf(i_0_8,negated_conjecture,
    test(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_8) ).

cnf(i_0_2,plain,
    addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_2) ).

cnf(i_0_7,negated_conjecture,
    test(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_7) ).

cnf(i_0_6,negated_conjecture,
    test(esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_6) ).

cnf(i_0_11,plain,
    multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_11) ).

cnf(i_0_10,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_10) ).

cnf(i_0_12,plain,
    multiplication(one,X1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_12) ).

cnf(i_0_5,negated_conjecture,
    ( ~ leq(addition(esk1_0,multiplication(esk2_0,esk3_0)),multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)))
    | ~ leq(multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)),addition(esk1_0,multiplication(esk2_0,esk3_0))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_5) ).

cnf(i_0_14,plain,
    ( leq(X1,X2)
    | addition(X1,X2) != X2 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q46ktzf2/input.p',i_0_14) ).

cnf(c_0_41,plain,
    ( multiplication(X1,X2) = zero
    | ~ complement(X2,X1) ),
    i_0_23 ).

cnf(c_0_42,plain,
    ( complement(esk4_1(X1),X1)
    | ~ test(X1) ),
    i_0_19 ).

cnf(c_0_43,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    i_0_17 ).

cnf(c_0_44,plain,
    ( multiplication(X1,esk4_1(X1)) = zero
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,plain,
    addition(X1,zero) = X1,
    i_0_4 ).

cnf(c_0_46,plain,
    ( addition(X1,X2) = one
    | ~ complement(X2,X1) ),
    i_0_21 ).

cnf(c_0_47,plain,
    ( multiplication(X1,addition(X2,esk4_1(X1))) = multiplication(X1,X2)
    | ~ test(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).

cnf(c_0_48,plain,
    ( addition(X1,esk4_1(X1)) = one
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_46,c_0_42]) ).

cnf(c_0_49,plain,
    multiplication(X1,one) = X1,
    i_0_13 ).

cnf(c_0_50,plain,
    addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
    i_0_1 ).

cnf(c_0_51,plain,
    addition(X1,X1) = X1,
    i_0_3 ).

cnf(c_0_52,plain,
    ( multiplication(X1,X1) = X1
    | ~ test(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).

cnf(c_0_53,negated_conjecture,
    test(esk1_0),
    i_0_8 ).

cnf(c_0_54,plain,
    addition(X1,X2) = addition(X2,X1),
    i_0_2 ).

cnf(c_0_55,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_56,negated_conjecture,
    test(esk2_0),
    i_0_7 ).

cnf(c_0_57,negated_conjecture,
    multiplication(esk1_0,esk1_0) = esk1_0,
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_58,plain,
    addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_49]),c_0_54]) ).

cnf(c_0_59,plain,
    ( addition(X1,one) = one
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_55,c_0_48]) ).

cnf(c_0_60,negated_conjecture,
    test(esk3_0),
    i_0_6 ).

cnf(c_0_61,plain,
    multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
    i_0_11 ).

cnf(c_0_62,negated_conjecture,
    multiplication(esk2_0,esk2_0) = esk2_0,
    inference(spm,[status(thm)],[c_0_52,c_0_56]) ).

cnf(c_0_63,plain,
    multiplication(esk1_0,addition(X1,one)) = multiplication(esk1_0,addition(X1,esk1_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_57]),c_0_54]),c_0_58]) ).

cnf(c_0_64,negated_conjecture,
    addition(esk3_0,one) = one,
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_65,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    i_0_10 ).

cnf(c_0_66,plain,
    multiplication(one,X1) = X1,
    i_0_12 ).

cnf(c_0_67,plain,
    multiplication(esk2_0,multiplication(esk2_0,X1)) = multiplication(esk2_0,X1),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_68,negated_conjecture,
    ( ~ leq(addition(esk1_0,multiplication(esk2_0,esk3_0)),multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)))
    | ~ leq(multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)),addition(esk1_0,multiplication(esk2_0,esk3_0))) ),
    i_0_5 ).

cnf(c_0_69,plain,
    ( leq(X1,X2)
    | addition(X1,X2) != X2 ),
    i_0_14 ).

cnf(c_0_70,plain,
    multiplication(esk1_0,addition(esk1_0,esk3_0)) = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_49]),c_0_54]) ).

cnf(c_0_71,plain,
    addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_54]) ).

cnf(c_0_72,plain,
    multiplication(esk2_0,addition(X1,multiplication(esk2_0,X2))) = multiplication(esk2_0,addition(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_67]),c_0_43]) ).

cnf(c_0_73,plain,
    addition(X1,addition(X2,X1)) = addition(X2,X1),
    inference(spm,[status(thm)],[c_0_55,c_0_54]) ).

cnf(c_0_74,negated_conjecture,
    addition(esk2_0,one) = one,
    inference(spm,[status(thm)],[c_0_59,c_0_56]) ).

cnf(c_0_75,negated_conjecture,
    ( addition(esk1_0,addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)))) != addition(esk1_0,multiplication(esk2_0,esk3_0))
    | ~ leq(addition(esk1_0,multiplication(esk2_0,esk3_0)),multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_54]),c_0_50]) ).

cnf(c_0_76,plain,
    addition(esk1_0,multiplication(X1,addition(esk1_0,esk3_0))) = multiplication(addition(esk1_0,X1),addition(esk1_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_65,c_0_70]) ).

cnf(c_0_77,plain,
    addition(X1,multiplication(esk2_0,addition(X1,X2))) = addition(X1,multiplication(esk2_0,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_50]),c_0_43]),c_0_73]),c_0_74]),c_0_66]) ).

cnf(c_0_78,plain,
    addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
    inference(spm,[status(thm)],[c_0_54,c_0_50]) ).

cnf(c_0_79,plain,
    ( addition(esk1_0,addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)))) != multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0))
    | addition(esk1_0,addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)))) != addition(esk1_0,multiplication(esk2_0,esk3_0)) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_69]),c_0_50]) ).

cnf(c_0_80,plain,
    multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)) = addition(esk1_0,multiplication(esk2_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_81,plain,
    addition(multiplication(X1,X2),addition(X3,multiplication(X1,X4))) = addition(X3,multiplication(X1,addition(X4,X2))),
    inference(spm,[status(thm)],[c_0_78,c_0_43]) ).

cnf(c_0_82,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_51]),c_0_55]),c_0_80]),c_0_80]),c_0_81]),c_0_51]),c_0_55])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE020+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n024.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 12:44:49 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.03/2.66  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 9.03/2.66  # Version: 2.1pre011
% 9.03/2.66  # Preprocessing time       : 0.017 s
% 9.03/2.66  
% 9.03/2.66  # Proof found!
% 9.03/2.66  # SZS status Theorem
% 9.03/2.66  # SZS output start CNFRefutation
% See solution above
% 9.03/2.66  # Proof object total steps             : 59
% 9.03/2.66  # Proof object clause steps            : 42
% 9.03/2.66  # Proof object formula steps           : 17
% 9.03/2.66  # Proof object conjectures             : 13
% 9.03/2.66  # Proof object clause conjectures      : 9
% 9.03/2.66  # Proof object formula conjectures     : 4
% 9.03/2.66  # Proof object initial clauses used    : 17
% 9.03/2.66  # Proof object initial formulas used   : 17
% 9.03/2.66  # Proof object generating inferences   : 24
% 9.03/2.66  # Proof object simplifying inferences  : 27
% 9.03/2.66  # Training examples: 0 positive, 0 negative
% 9.03/2.66  # Parsed axioms                        : 26
% 9.03/2.66  # Removed by relevancy pruning/SinE    : 0
% 9.03/2.66  # Initial clauses                      : 26
% 9.03/2.66  # Removed in clause preprocessing      : 0
% 9.03/2.66  # Initial clauses in saturation        : 26
% 9.03/2.66  # Processed clauses                    : 613
% 9.03/2.66  # ...of these trivial                  : 128
% 9.03/2.66  # ...subsumed                          : 180
% 9.03/2.66  # ...remaining for further processing  : 305
% 9.03/2.66  # Other redundant clauses eliminated   : 1
% 9.03/2.66  # Clauses deleted for lack of memory   : 0
% 9.03/2.66  # Backward-subsumed                    : 33
% 9.03/2.66  # Backward-rewritten                   : 28
% 9.03/2.66  # Generated clauses                    : 8225
% 9.03/2.66  # ...of the previous two non-trivial   : 6569
% 9.03/2.66  # Contextual simplify-reflections      : 50
% 9.03/2.66  # Paramodulations                      : 8213
% 9.03/2.66  # Factorizations                       : 0
% 9.03/2.66  # Equation resolutions                 : 12
% 9.03/2.66  # Propositional unsat checks           : 0
% 9.03/2.66  # Propositional unsat check successes  : 0
% 9.03/2.66  # Current number of processed clauses  : 244
% 9.03/2.66  #    Positive orientable unit clauses  : 117
% 9.03/2.66  #    Positive unorientable unit clauses: 5
% 9.03/2.66  #    Negative unit clauses             : 0
% 9.03/2.66  #    Non-unit-clauses                  : 122
% 9.03/2.66  # Current number of unprocessed clauses: 5515
% 9.03/2.66  # ...number of literals in the above   : 13552
% 9.03/2.66  # Current number of archived formulas  : 0
% 9.03/2.66  # Current number of archived clauses   : 61
% 9.03/2.66  # Clause-clause subsumption calls (NU) : 3446
% 9.03/2.66  # Rec. Clause-clause subsumption calls : 1553
% 9.03/2.66  # Non-unit clause-clause subsumptions  : 200
% 9.03/2.66  # Unit Clause-clause subsumption calls : 666
% 9.03/2.66  # Rewrite failures with RHS unbound    : 0
% 9.03/2.66  # BW rewrite match attempts            : 99
% 9.03/2.66  # BW rewrite match successes           : 71
% 9.03/2.66  # Condensation attempts                : 0
% 9.03/2.66  # Condensation successes               : 0
% 9.03/2.66  # Termbank termtop insertions          : 121201
% 9.03/2.66  
% 9.03/2.66  # -------------------------------------------------
% 9.03/2.66  # User time                : 0.122 s
% 9.03/2.66  # System time              : 0.000 s
% 9.03/2.66  # Total time               : 0.122 s
% 9.03/2.66  # ...preprocessing         : 0.017 s
% 9.03/2.66  # ...main loop             : 0.105 s
% 9.03/2.66  # Maximum resident set size: 11576 pages
% 9.03/2.66  
%------------------------------------------------------------------------------