↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : KLE028+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:58:40 PM UTC 2026

% Result   : Theorem 5.74s 16.29s
% Output   : CNFRefutation 5.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   80 (  56 unt;   0 def)
%            Number of atoms       :  131 (  77 equ)
%            Maximal formula atoms :   10 (   1 avg)
%            Number of connectives :   90 (  39   ~;  32   |;  12   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-2 aty)
%            Number of variables   :  102 (   1 sgn  50   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(test_3,axiom,
    ! [X4,X5] :
      ( test(X4)
     => ( c(X4) = X5
      <=> complement(X4,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).

fof(goals,conjecture,
    ! [X4,X5,X6,X7,X8,X9] :
      ( ( test(X9)
        & test(X8) )
     => addition(multiplication(X8,addition(multiplication(X9,X4),multiplication(c(X9),X5))),multiplication(c(X8),addition(multiplication(X9,X6),multiplication(c(X9),X7)))) = addition(multiplication(X9,addition(multiplication(X8,X4),multiplication(c(X8),X6))),multiplication(c(X9),addition(multiplication(X8,X5),multiplication(c(X8),X7)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(test_2,axiom,
    ! [X4,X5] :
      ( complement(X5,X4)
    <=> ( addition(X4,X5) = one
        & multiplication(X5,X4) = zero
        & multiplication(X4,X5) = zero ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).

fof(additive_commutativity,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(test_1,axiom,
    ! [X4] :
      ( test(X4)
    <=> ? [X5] : complement(X5,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).

fof(test_deMorgan1,axiom,
    ! [X4,X5] :
      ( ( test(X5)
        & test(X4) )
     => c(addition(X4,X5)) = multiplication(c(X4),c(X5)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+2.ax',test_deMorgan1) ).

fof(right_distributivity,axiom,
    ! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).

fof(additive_associativity,axiom,
    ! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).

fof(multiplicative_associativity,axiom,
    ! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).

fof(c_0_9,plain,
    ! [X38,X39] :
      ( ( ~ test(X38)
        | c(X38) = X39
        | ~ complement(X38,X39) )
      & ( ~ test(X38)
        | complement(X38,X39)
        | c(X38) != X39 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X4,X5,X6,X7,X8,X9] :
        ( ( test(X9)
          & test(X8) )
       => addition(multiplication(X8,addition(multiplication(X9,X4),multiplication(c(X9),X5))),multiplication(c(X8),addition(multiplication(X9,X6),multiplication(c(X9),X7)))) = addition(multiplication(X9,addition(multiplication(X8,X4),multiplication(c(X8),X6))),multiplication(c(X9),addition(multiplication(X8,X5),multiplication(c(X8),X7)))) ),
    inference(assume_negation,[status(cth)],[goals]) ).

cnf(c_0_11,plain,
    ( ~ test(X1)
    | c(X1) != X2
    | complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_12,negated_conjecture,
    ( addition(multiplication(esk6_0,addition(multiplication(esk7_0,esk2_0),multiplication(c(esk7_0),esk3_0))),multiplication(c(esk6_0),addition(multiplication(esk7_0,esk4_0),multiplication(c(esk7_0),esk5_0)))) != addition(multiplication(esk7_0,addition(multiplication(esk6_0,esk2_0),multiplication(c(esk6_0),esk4_0))),multiplication(c(esk7_0),addition(multiplication(esk6_0,esk3_0),multiplication(c(esk6_0),esk5_0))))
    & test(esk7_0)
    & test(esk6_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).

fof(c_0_13,plain,
    ! [X36,X37] :
      ( ( complement(X37,X36)
        | addition(X36,X37) != one
        | multiplication(X37,X36) != zero
        | multiplication(X36,X37) != zero )
      & ( ~ complement(X37,X36)
        | addition(X36,X37) = one )
      & ( ~ complement(X37,X36)
        | multiplication(X37,X36) = zero )
      & ( ~ complement(X37,X36)
        | multiplication(X36,X37) = zero ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])]) ).

cnf(c_0_14,plain,
    ( ~ test(X1)
    | complement(X1,c(X1)) ),
    inference(er,[status(thm)],[c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    test(esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_16,plain,
    ! [X10,X11] : addition(X10,X11) = addition(X11,X10),
    inference(variable_rename,[status(thm)],[additive_commutativity]) ).

cnf(c_0_17,negated_conjecture,
    test(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    ( ~ complement(X2,X1)
    | addition(X1,X2) = one ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    complement(esk7_0,c(esk7_0)),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,plain,
    ( ~ complement(X1,X2)
    | multiplication(X1,X2) = zero ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,plain,
    ( ~ complement(X2,X1)
    | multiplication(X1,X2) = zero ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_23,plain,
    ! [X32,X34,X35] :
      ( ( test(X34)
        | ~ complement(X35,X34) )
      & ( complement(esk1_1(X32),X32)
        | ~ test(X32) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])])]) ).

fof(c_0_24,plain,
    ! [X41,X42] :
      ( c(addition(X41,X42)) = multiplication(c(X41),c(X42))
      | ~ test(X42)
      | ~ test(X41) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_deMorgan1])])]) ).

cnf(c_0_25,negated_conjecture,
    complement(esk6_0,c(esk6_0)),
    inference(spm,[status(thm)],[c_0_14,c_0_17]) ).

cnf(c_0_26,plain,
    ( addition(X1,X2) != one
    | multiplication(X2,X1) != zero
    | multiplication(X1,X2) != zero
    | complement(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_27,negated_conjecture,
    addition(esk7_0,c(esk7_0)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_28,negated_conjecture,
    multiplication(esk7_0,c(esk7_0)) = zero,
    inference(spm,[status(thm)],[c_0_21,c_0_19]) ).

cnf(c_0_29,negated_conjecture,
    multiplication(c(esk7_0),esk7_0) = zero,
    inference(spm,[status(thm)],[c_0_22,c_0_19]) ).

cnf(c_0_30,plain,
    ( ~ complement(X1,X2)
    | test(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_31,plain,
    ( ~ test(X2)
    | ~ test(X1)
    | c(addition(X1,X2)) = multiplication(c(X1),c(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_32,negated_conjecture,
    addition(esk6_0,c(esk6_0)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_25]),c_0_20]) ).

cnf(c_0_33,negated_conjecture,
    multiplication(esk6_0,c(esk6_0)) = zero,
    inference(spm,[status(thm)],[c_0_21,c_0_25]) ).

cnf(c_0_34,negated_conjecture,
    multiplication(c(esk6_0),esk6_0) = zero,
    inference(spm,[status(thm)],[c_0_22,c_0_25]) ).

cnf(c_0_35,plain,
    ( ~ test(X1)
    | ~ complement(X1,X2)
    | c(X1) = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_36,negated_conjecture,
    complement(c(esk7_0),esk7_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29])]) ).

cnf(c_0_37,negated_conjecture,
    test(c(esk7_0)),
    inference(spm,[status(thm)],[c_0_30,c_0_19]) ).

fof(c_0_38,plain,
    ! [X22,X23,X24] : multiplication(X22,addition(X23,X24)) = addition(multiplication(X22,X23),multiplication(X22,X24)),
    inference(variable_rename,[status(thm)],[right_distributivity]) ).

fof(c_0_39,plain,
    ! [X12,X13,X14] : addition(X14,addition(X13,X12)) = addition(addition(X14,X13),X12),
    inference(variable_rename,[status(thm)],[additive_associativity]) ).

fof(c_0_40,plain,
    ! [X17,X18,X19] : multiplication(X17,multiplication(X18,X19)) = multiplication(multiplication(X17,X18),X19),
    inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ test(X1)
    | multiplication(c(X1),c(esk7_0)) = c(addition(X1,esk7_0)) ),
    inference(spm,[status(thm)],[c_0_31,c_0_15]) ).

cnf(c_0_42,negated_conjecture,
    complement(c(esk6_0),esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_32]),c_0_33])]),c_0_34])]) ).

cnf(c_0_43,negated_conjecture,
    test(c(esk6_0)),
    inference(spm,[status(thm)],[c_0_30,c_0_25]) ).

cnf(c_0_44,negated_conjecture,
    c(c(esk7_0)) = esk7_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ test(X1)
    | multiplication(c(X1),c(esk6_0)) = c(addition(X1,esk6_0)) ),
    inference(spm,[status(thm)],[c_0_31,c_0_17]) ).

cnf(c_0_46,negated_conjecture,
    addition(multiplication(esk6_0,addition(multiplication(esk7_0,esk2_0),multiplication(c(esk7_0),esk3_0))),multiplication(c(esk6_0),addition(multiplication(esk7_0,esk4_0),multiplication(c(esk7_0),esk5_0)))) != addition(multiplication(esk7_0,addition(multiplication(esk6_0,esk2_0),multiplication(c(esk6_0),esk4_0))),multiplication(c(esk7_0),addition(multiplication(esk6_0,esk3_0),multiplication(c(esk6_0),esk5_0)))),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_47,plain,
    multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_48,plain,
    addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_49,plain,
    multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_50,negated_conjecture,
    multiplication(c(esk6_0),c(esk7_0)) = c(addition(esk6_0,esk7_0)),
    inference(spm,[status(thm)],[c_0_41,c_0_17]) ).

cnf(c_0_51,negated_conjecture,
    c(c(esk6_0)) = esk6_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_42]),c_0_43])]) ).

cnf(c_0_52,negated_conjecture,
    ( ~ test(X1)
    | multiplication(c(X1),esk7_0) = c(addition(X1,c(esk7_0))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_37]),c_0_44]) ).

cnf(c_0_53,negated_conjecture,
    multiplication(c(c(esk7_0)),c(esk6_0)) = c(addition(esk6_0,c(esk7_0))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_20]) ).

cnf(c_0_54,negated_conjecture,
    addition(multiplication(esk7_0,multiplication(esk6_0,esk2_0)),addition(multiplication(esk7_0,multiplication(c(esk6_0),esk4_0)),addition(multiplication(c(esk7_0),multiplication(esk6_0,esk3_0)),multiplication(c(esk7_0),multiplication(c(esk6_0),esk5_0))))) != addition(multiplication(esk6_0,multiplication(esk7_0,esk2_0)),addition(multiplication(esk6_0,multiplication(c(esk7_0),esk3_0)),addition(multiplication(c(esk6_0),multiplication(esk7_0,esk4_0)),multiplication(c(esk6_0),multiplication(c(esk7_0),esk5_0))))),
    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_46,c_0_47]),c_0_47]),c_0_48]),c_0_47]),c_0_47]),c_0_48]) ).

cnf(c_0_55,plain,
    addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_20]),c_0_48]) ).

cnf(c_0_56,negated_conjecture,
    multiplication(c(esk7_0),c(esk6_0)) = c(addition(esk6_0,esk7_0)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_15]),c_0_20]) ).

cnf(c_0_57,negated_conjecture,
    multiplication(c(addition(esk6_0,esk7_0)),X1) = multiplication(c(esk6_0),multiplication(c(esk7_0),X1)),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_58,negated_conjecture,
    ( ~ test(X1)
    | multiplication(c(X1),esk6_0) = c(addition(X1,c(esk6_0))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_43]),c_0_51]) ).

cnf(c_0_59,negated_conjecture,
    multiplication(esk6_0,esk7_0) = c(addition(c(esk6_0),c(esk7_0))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_43]),c_0_51]) ).

cnf(c_0_60,negated_conjecture,
    multiplication(esk7_0,c(esk6_0)) = c(addition(esk6_0,c(esk7_0))),
    inference(rw,[status(thm)],[c_0_53,c_0_44]) ).

cnf(c_0_61,negated_conjecture,
    multiplication(c(c(esk6_0)),c(esk7_0)) = c(addition(esk7_0,c(esk6_0))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_43]),c_0_20]) ).

cnf(c_0_62,negated_conjecture,
    addition(multiplication(esk7_0,multiplication(esk6_0,esk2_0)),addition(multiplication(esk7_0,multiplication(c(esk6_0),esk4_0)),addition(multiplication(c(esk7_0),multiplication(esk6_0,esk3_0)),multiplication(c(esk7_0),multiplication(c(esk6_0),esk5_0))))) != addition(multiplication(esk6_0,multiplication(esk7_0,esk2_0)),addition(multiplication(c(esk6_0),multiplication(esk7_0,esk4_0)),addition(multiplication(esk6_0,multiplication(c(esk7_0),esk3_0)),multiplication(c(esk6_0),multiplication(c(esk7_0),esk5_0))))),
    inference(rw,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_63,negated_conjecture,
    multiplication(c(esk7_0),multiplication(c(esk6_0),X1)) = multiplication(c(esk6_0),multiplication(c(esk7_0),X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_56]),c_0_57]) ).

cnf(c_0_64,negated_conjecture,
    multiplication(esk7_0,esk6_0) = c(addition(c(esk6_0),c(esk7_0))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_37]),c_0_44]),c_0_20]) ).

cnf(c_0_65,negated_conjecture,
    multiplication(c(addition(c(esk6_0),c(esk7_0))),X1) = multiplication(esk6_0,multiplication(esk7_0,X1)),
    inference(spm,[status(thm)],[c_0_49,c_0_59]) ).

cnf(c_0_66,negated_conjecture,
    multiplication(c(esk6_0),esk7_0) = c(addition(esk6_0,c(esk7_0))),
    inference(spm,[status(thm)],[c_0_52,c_0_17]) ).

cnf(c_0_67,negated_conjecture,
    multiplication(c(addition(esk6_0,c(esk7_0))),X1) = multiplication(esk7_0,multiplication(c(esk6_0),X1)),
    inference(spm,[status(thm)],[c_0_49,c_0_60]) ).

cnf(c_0_68,negated_conjecture,
    multiplication(esk6_0,c(esk7_0)) = c(addition(esk7_0,c(esk6_0))),
    inference(rw,[status(thm)],[c_0_61,c_0_51]) ).

cnf(c_0_69,negated_conjecture,
    addition(multiplication(esk7_0,multiplication(esk6_0,esk2_0)),addition(multiplication(esk7_0,multiplication(c(esk6_0),esk4_0)),addition(multiplication(c(esk6_0),multiplication(c(esk7_0),esk5_0)),multiplication(c(esk7_0),multiplication(esk6_0,esk3_0))))) != addition(multiplication(esk6_0,multiplication(esk7_0,esk2_0)),addition(multiplication(c(esk6_0),multiplication(esk7_0,esk4_0)),addition(multiplication(esk6_0,multiplication(c(esk7_0),esk3_0)),multiplication(c(esk6_0),multiplication(c(esk7_0),esk5_0))))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_20]) ).

cnf(c_0_70,negated_conjecture,
    multiplication(esk7_0,multiplication(esk6_0,X1)) = multiplication(esk6_0,multiplication(esk7_0,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_64]),c_0_65]) ).

cnf(c_0_71,negated_conjecture,
    multiplication(c(esk6_0),multiplication(esk7_0,X1)) = multiplication(esk7_0,multiplication(c(esk6_0),X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_66]),c_0_67]) ).

cnf(c_0_72,negated_conjecture,
    multiplication(c(esk7_0),esk6_0) = c(addition(esk7_0,c(esk6_0))),
    inference(spm,[status(thm)],[c_0_58,c_0_15]) ).

cnf(c_0_73,negated_conjecture,
    multiplication(c(addition(esk7_0,c(esk6_0))),X1) = multiplication(esk6_0,multiplication(c(esk7_0),X1)),
    inference(spm,[status(thm)],[c_0_49,c_0_68]) ).

cnf(c_0_74,negated_conjecture,
    addition(multiplication(esk6_0,multiplication(esk7_0,esk2_0)),addition(multiplication(esk7_0,multiplication(c(esk6_0),esk4_0)),addition(multiplication(c(esk6_0),multiplication(c(esk7_0),esk5_0)),multiplication(c(esk7_0),multiplication(esk6_0,esk3_0))))) != addition(multiplication(esk6_0,multiplication(esk7_0,esk2_0)),addition(multiplication(esk7_0,multiplication(c(esk6_0),esk4_0)),addition(multiplication(esk6_0,multiplication(c(esk7_0),esk3_0)),multiplication(c(esk6_0),multiplication(c(esk7_0),esk5_0))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).

cnf(c_0_75,negated_conjecture,
    multiplication(c(esk7_0),multiplication(esk6_0,X1)) = multiplication(esk6_0,multiplication(c(esk7_0),X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_72]),c_0_73]) ).

cnf(c_0_76,plain,
    addition(X1,X2) = addition(X2,X1),
    c_0_20 ).

cnf(c_0_77,plain,
    addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
    c_0_48 ).

cnf(c_0_78,plain,
    multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
    c_0_49 ).

cnf(c_0_79,negated_conjecture,
    $false,
    inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76,c_0_77,c_0_78]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KLE028+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34   % Computer : n011.cluster.edu
% 0.08/0.34   % Model    : x86_64 x86_64
% 0.08/0.34   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34   % Memory   : 8046.5625MB
% 0.08/0.34   % OS       : Linux 6.8.0-71-generic
% 0.08/15.39  % CPULimit : 300
% 0.08/15.39  % WCLimit  : 300
% 0.08/15.39  % DateTime : Sun Sep 20 22:40:08 UTC 2026
% 0.08/15.40  % CPUTime  : 
% 0.08/15.40  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.31/15.43  Running first-order theorem proving
% 0.31/15.43  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.74/16.29  % Version: 3.5.1
% 5.74/16.29  % Preprocessing class: FSMSSMSSSSSNFFN.
% 5.74/16.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.74/16.29  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.74/16.29  % Starting new_bool_3 with 300s (1) cores
% 5.74/16.29  % Starting new_bool_1 with 300s (1) cores
% 5.74/16.29  % Starting sh5l with 300s (1) cores
% 5.74/16.29  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1014405 completed with status 0
% 5.74/16.29  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 5.74/16.29  % Preprocessing class: FSMSSMSSSSSNFFN.
% 5.74/16.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.74/16.29  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.74/16.29  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.74/16.29  % No SInE strategy applied
% 5.74/16.29  % Search class: FGUSM-FFMF21-MFFFFFNN
% 5.74/16.29  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.74/16.29  % Starting SubtermCWHack with 136s (1) cores
% 5.74/16.29  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.74/16.29  % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0S with 136s (1) cores
% 5.74/16.29  % Starting new_bool_3 with 136s (1) cores
% 5.74/16.29  % Starting new_bool_1 with 136s (1) cores
% 5.74/16.29  % G-E--_200_B02_F1_AE_CS_SP_PI_S0S with pid 1014413 completed with status 0
% 5.74/16.29  % Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0S
% 5.74/16.29  % Preprocessing class: FSMSSMSSSSSNFFN.
% 5.74/16.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.74/16.29  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.74/16.29  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.74/16.29  % No SInE strategy applied
% 5.74/16.29  % Search class: FGUSM-FFMF21-MFFFFFNN
% 5.74/16.29  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.74/16.29  % Starting SubtermCWHack with 136s (1) cores
% 5.74/16.29  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.74/16.29  % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0S with 136s (1) cores
% 5.74/16.29  % Preprocessing time       : 0.001 s
% 5.74/16.29  
% 5.74/16.29  % Proof found!
% 5.74/16.29  % SZS status Theorem
% 5.74/16.29  % SZS output start CNFRefutation
% See solution above
% 5.74/16.29  % Parsed axioms                        : 19
% 5.74/16.29  % Removed by relevancy pruning/SinE    : 0
% 5.74/16.29  % Initial clauses                      : 27
% 5.74/16.29  % Removed in clause preprocessing      : 0
% 5.74/16.29  % Initial clauses in saturation        : 27
% 5.74/16.29  % Processed clauses                    : 7730
% 5.74/16.29  % ...of these trivial                  : 532
% 5.74/16.29  % ...subsumed                          : 5821
% 5.74/16.29  % ...remaining for further processing  : 1377
% 5.74/16.29  % Other redundant clauses eliminated   : 0
% 5.74/16.29  % Clauses deleted for lack of memory   : 0
% 5.74/16.29  % Backward-subsumed                    : 133
% 5.74/16.29  % Backward-rewritten                   : 264
% 5.74/16.29  % Generated clauses                    : 45074
% 5.74/16.29  % ...of the previous two non-redundant : 34315
% 5.74/16.29  % ...aggressively subsumed             : 0
% 5.74/16.29  % Contextual simplify-reflections      : 11
% 5.74/16.29  % Paramodulations                      : 45062
% 5.74/16.29  % Factorizations                       : 1
% 5.74/16.29  % NegExts                              : 0
% 5.74/16.29  % Equation resolutions                 : 11
% 5.74/16.29  % Disequality decompositions           : 0
% 5.74/16.29  % Total rewrite steps                  : 94376
% 5.74/16.29  % ...of those cached                   : 88648
% 5.74/16.29  % Propositional unsat checks           : 0
% 5.74/16.29  %    Propositional check models        : 0
% 5.74/16.29  %    Propositional check unsatisfiable : 0
% 5.74/16.29  %    Propositional clauses             : 0
% 5.74/16.29  %    Propositional clauses after purity: 0
% 5.74/16.29  %    Propositional unsat core size     : 0
% 5.74/16.29  %    Propositional preprocessing time  : 0.000
% 5.74/16.29  %    Propositional encoding time       : 0.000
% 5.74/16.29  %    Propositional solver time         : 0.000
% 5.74/16.29  %    Success case prop preproc time    : 0.000
% 5.74/16.29  %    Success case prop encoding time   : 0.000
% 5.74/16.29  %    Success case prop solver time     : 0.000
% 5.74/16.29  % Current number of processed clauses  : 980
% 5.74/16.29  %    Positive orientable unit clauses  : 299
% 5.74/16.29  %    Positive unorientable unit clauses: 5
% 5.74/16.29  %    Negative unit clauses             : 1
% 5.74/16.29  %    Non-unit-clauses                  : 675
% 5.74/16.29  % Current number of unprocessed clauses: 25779
% 5.74/16.29  % ...number of literals in the above   : 63849
% 5.74/16.29  % Current number of archived formulas  : 0
% 5.74/16.29  % Current number of archived clauses   : 397
% 5.74/16.29  % Clause-clause subsumption calls (NU) : 334417
% 5.74/16.29  % Rec. Clause-clause subsumption calls : 295702
% 5.74/16.29  % Non-unit clause-clause subsumptions  : 5595
% 5.74/16.29  % Unit Clause-clause subsumption calls : 18168
% 5.74/16.29  % Rewrite failures with RHS unbound    : 0
% 5.74/16.29  % BW rewrite match attempts            : 788
% 5.74/16.29  % BW rewrite match successes           : 220
% 5.74/16.29  % Condensation attempts                : 0
% 5.74/16.29  % Condensation successes               : 0
% 5.74/16.29  % Termbank termtop insertions          : 837780
% 5.74/16.29  % Search garbage collected termcells   : 235
% 5.74/16.29  
% 5.74/16.29  % -------------------------------------------------
% 5.74/16.29  % User time                : 0.768 s
% 5.74/16.29  % System time              : 0.033 s
% 5.74/16.29  % Total time               : 0.800 s
% 5.74/16.29  % Maximum resident set size: 3656 pages
% 5.74/16.29  
% 5.74/16.29  % -------------------------------------------------
% 5.74/16.29  % User time                : 3.528 s
% 5.74/16.29  % System time              : 0.156 s
% 5.74/16.29  % Total time               : 3.684 s
% 5.74/16.29  % Maximum resident set size: 4608 pages
% 5.74/16.29  % E exiting
%------------------------------------------------------------------------------