↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KLE063+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n029.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  : 300s
% DateTime : Tue May  5 04:35:38 PM UTC 2026

% Result   : Theorem 1.51s 1.78s
% Output   : CNFRefutation 1.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   44 (  41 unt;   0 def)
%            Number of atoms       :   47 (  46 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   4   ~;   0   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 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   :   65 (   5 sgn  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(domain3,axiom,
    ! [X4] : addition(domain(X4),one) = one,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).

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

fof(domain1,axiom,
    ! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).

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

fof(domain5,axiom,
    ! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).

fof(domain2,axiom,
    ! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).

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(goals,conjecture,
    ! [X4,X5] :
      ( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
     => addition(domain(X4),domain(X5)) = domain(X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

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

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

fof(c_0_10,plain,
    ! [X61] : addition(domain(X61),one) = one,
    inference(variable_rename,[status(thm)],[domain3]) ).

fof(c_0_11,plain,
    ! [X36,X37] : addition(X36,X37) = addition(X37,X36),
    inference(variable_rename,[status(thm)],[additive_commutativity]) ).

fof(c_0_12,plain,
    ! [X58] : addition(X58,multiplication(domain(X58),X58)) = multiplication(domain(X58),X58),
    inference(variable_rename,[status(thm)],[domain1]) ).

fof(c_0_13,plain,
    ! [X46] : multiplication(X46,one) = X46,
    inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).

cnf(c_0_14,plain,
    addition(domain(X1),one) = one,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

fof(c_0_16,plain,
    ! [X62,X63] : domain(addition(X62,X63)) = addition(domain(X62),domain(X63)),
    inference(variable_rename,[status(thm)],[domain5]) ).

cnf(c_0_17,plain,
    addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    multiplication(X1,one) = X1,
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    addition(one,domain(X1)) = one,
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

fof(c_0_20,plain,
    ! [X59,X60] : domain(multiplication(X59,X60)) = domain(multiplication(X59,domain(X60))),
    inference(variable_rename,[status(thm)],[domain2]) ).

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

cnf(c_0_22,plain,
    domain(one) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

fof(c_0_23,plain,
    ! [X48,X49,X50] : multiplication(X48,addition(X49,X50)) = addition(multiplication(X48,X49),multiplication(X48,X50)),
    inference(variable_rename,[status(thm)],[right_distributivity]) ).

fof(c_0_24,negated_conjecture,
    ~ ! [X4,X5] :
        ( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
       => addition(domain(X4),domain(X5)) = domain(X5) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_25,plain,
    ! [X51,X52,X53] : multiplication(addition(X51,X52),X53) = addition(multiplication(X51,X53),multiplication(X52,X53)),
    inference(variable_rename,[status(thm)],[left_distributivity]) ).

fof(c_0_26,plain,
    ! [X47] : multiplication(one,X47) = X47,
    inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).

cnf(c_0_27,plain,
    domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    domain(addition(X1,one)) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15]),c_0_19]) ).

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

fof(c_0_30,negated_conjecture,
    ( addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0)
    & addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).

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

cnf(c_0_32,plain,
    multiplication(one,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_33,plain,
    domain(multiplication(X1,addition(X2,one))) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]) ).

cnf(c_0_34,plain,
    addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_15]) ).

cnf(c_0_35,negated_conjecture,
    addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_36,plain,
    addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15]) ).

cnf(c_0_37,plain,
    domain(domain(X1)) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_32]),c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_39,plain,
    domain(addition(X1,multiplication(X1,X2))) = domain(X1),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    multiplication(domain(esk2_0),esk1_0) = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_15]),c_0_19]),c_0_32]) ).

cnf(c_0_41,plain,
    domain(addition(X1,domain(X2))) = domain(addition(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_37]),c_0_21]) ).

cnf(c_0_42,negated_conjecture,
    domain(addition(esk1_0,esk2_0)) != domain(esk2_0),
    inference(rw,[status(thm)],[c_0_38,c_0_21]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_15]),c_0_41]),c_0_37]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : KLE063+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.10  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.12/0.30  % Computer : n029.cluster.edu
% 0.12/0.30  % Model    : x86_64 x86_64
% 0.12/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30  % Memory   : 8042.1875MB
% 0.12/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30  % CPULimit   : 300
% 0.12/0.30  % WCLimit    : 300
% 0.12/0.30  % DateTime   : Mon May  4 20:28:44 EDT 2026
% 0.12/0.30  % CPUTime    : 
% 0.12/0.31  % start to proof: theBenchmark
% 1.51/1.78  % Version  : CSE_E---1.7
% 1.51/1.78  % Problem  : theBenchmark.p
% 1.51/1.78  % SZS status Theorem for theBenchmark.p
% 1.51/1.78  % SZS output start CNFRefutation
% See solution above
% 1.51/1.79  % Total time : 1.371s
%------------------------------------------------------------------------------