TSTP Solution File: KLE072+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : KLE072+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n021.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 : Thu Aug 31 05:25:57 EDT 2023

% Result   : Theorem 0.19s 0.58s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   25 (  16 unt;   9 typ;   0 def)
%            Number of atoms       :   16 (  15 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   4   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   27 (   0 sgn;  20   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    addition: ( $i * $i ) > $i ).

tff(decl_23,type,
    zero: $i ).

tff(decl_24,type,
    multiplication: ( $i * $i ) > $i ).

tff(decl_25,type,
    one: $i ).

tff(decl_26,type,
    leq: ( $i * $i ) > $o ).

tff(decl_27,type,
    domain: $i > $i ).

tff(decl_28,type,
    esk1_0: $i ).

tff(decl_29,type,
    esk2_0: $i ).

tff(decl_30,type,
    esk3_0: $i ).

fof(goals,conjecture,
    ! [X4,X5,X6] : domain(multiplication(addition(X4,X5),domain(X6))) = addition(domain(multiplication(X4,domain(X6))),domain(multiplication(X5,domain(X6)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

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

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

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

fof(c_0_5,negated_conjecture,
    domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0))) != addition(domain(multiplication(esk1_0,domain(esk3_0))),domain(multiplication(esk2_0,domain(esk3_0)))),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,plain,
    ! [X33,X34] : domain(addition(X33,X34)) = addition(domain(X33),domain(X34)),
    inference(variable_rename,[status(thm)],[domain5]) ).

cnf(c_0_7,negated_conjecture,
    domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0))) != addition(domain(multiplication(esk1_0,domain(esk3_0))),domain(multiplication(esk2_0,domain(esk3_0)))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

fof(c_0_9,plain,
    ! [X30,X31] : domain(multiplication(X30,X31)) = domain(multiplication(X30,domain(X31))),
    inference(variable_rename,[status(thm)],[domain2]) ).

cnf(c_0_10,negated_conjecture,
    domain(addition(multiplication(esk1_0,domain(esk3_0)),multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0))),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

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

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

cnf(c_0_13,negated_conjecture,
    domain(addition(multiplication(esk1_0,domain(esk3_0)),multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(addition(esk1_0,esk2_0),esk3_0)),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

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

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : KLE072+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n021.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    : 300
% 0.13/0.34  % DateTime   : Tue Aug 29 11:18:29 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.58  % Version  : CSE_E---1.5
% 0.19/0.58  % Problem  : theBenchmark.p
% 0.19/0.58  % Proof found
% 0.19/0.58  % SZS status Theorem for theBenchmark.p
% 0.19/0.58  % SZS output start Proof
% See solution above
% 0.19/0.58  % Total time : 0.006000 s
% 0.19/0.58  % SZS output end Proof
% 0.19/0.58  % Total time : 0.008000 s
%------------------------------------------------------------------------------