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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP704+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 : n017.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 00:23:16 EDT 2023

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

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

tff(decl_23,type,
    mult: ( $i * $i ) > $i ).

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

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

tff(decl_26,type,
    op_c: $i ).

tff(decl_27,type,
    op_d: $i ).

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

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

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

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

fof(goals,conjecture,
    ! [X4,X5] :
      ( mult(op_f,mult(X4,X5)) = mult(mult(op_f,X4),X5)
      & mult(X4,mult(X5,op_f)) = mult(mult(X4,X5),op_f)
      & mult(X4,mult(op_f,X5)) = mult(mult(X4,op_f),X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f06,axiom,
    ! [X2] : mult(unit,X2) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).

fof(f13,axiom,
    ! [X1,X2] : op_f = mult(X2,mult(X1,ld(mult(X2,X1),op_c))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f13) ).

fof(f01,axiom,
    ! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).

fof(f08,axiom,
    ! [X1,X2] : mult(op_c,mult(X2,X1)) = mult(mult(op_c,X2),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).

fof(f10,axiom,
    ! [X1,X2] : mult(X2,mult(op_c,X1)) = mult(mult(X2,op_c),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).

fof(f09,axiom,
    ! [X1,X2] : mult(X2,mult(X1,op_c)) = mult(mult(X2,X1),op_c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X4,X5] :
        ( mult(op_f,mult(X4,X5)) = mult(mult(op_f,X4),X5)
        & mult(X4,mult(X5,op_f)) = mult(mult(X4,X5),op_f)
        & mult(X4,mult(op_f,X5)) = mult(mult(X4,op_f),X5) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_8,plain,
    ! [X15] : mult(unit,X15) = X15,
    inference(variable_rename,[status(thm)],[f06]) ).

fof(c_0_9,plain,
    ! [X28,X29] : op_f = mult(X29,mult(X28,ld(mult(X29,X28),op_c))),
    inference(variable_rename,[status(thm)],[f13]) ).

fof(c_0_10,plain,
    ! [X6,X7] : mult(X7,ld(X7,X6)) = X6,
    inference(variable_rename,[status(thm)],[f01]) ).

fof(c_0_11,negated_conjecture,
    ( mult(op_f,mult(esk1_0,esk2_0)) != mult(mult(op_f,esk1_0),esk2_0)
    | mult(esk1_0,mult(esk2_0,op_f)) != mult(mult(esk1_0,esk2_0),op_f)
    | mult(esk1_0,mult(op_f,esk2_0)) != mult(mult(esk1_0,op_f),esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_12,plain,
    mult(unit,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    op_f = mult(X1,mult(X2,ld(mult(X1,X2),op_c))),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    mult(X1,ld(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_15,plain,
    ! [X19,X20] : mult(op_c,mult(X20,X19)) = mult(mult(op_c,X20),X19),
    inference(variable_rename,[status(thm)],[f08]) ).

fof(c_0_16,plain,
    ! [X23,X24] : mult(X24,mult(op_c,X23)) = mult(mult(X24,op_c),X23),
    inference(variable_rename,[status(thm)],[f10]) ).

fof(c_0_17,plain,
    ! [X21,X22] : mult(X22,mult(X21,op_c)) = mult(mult(X22,X21),op_c),
    inference(variable_rename,[status(thm)],[f09]) ).

cnf(c_0_18,negated_conjecture,
    ( mult(op_f,mult(esk1_0,esk2_0)) != mult(mult(op_f,esk1_0),esk2_0)
    | mult(esk1_0,mult(esk2_0,op_f)) != mult(mult(esk1_0,esk2_0),op_f)
    | mult(esk1_0,mult(op_f,esk2_0)) != mult(mult(esk1_0,op_f),esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,plain,
    op_f = op_c,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]),c_0_14]) ).

cnf(c_0_20,plain,
    mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_22,plain,
    mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    $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_18,c_0_19]),c_0_20]),c_0_19]),c_0_19]),c_0_21]),c_0_19]),c_0_19]),c_0_22]),c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GRP704+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n017.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 01:49:28 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.57  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.59  % Total time : 0.007000 s
% 0.19/0.59  % SZS output end Proof
% 0.19/0.59  % Total time : 0.009000 s
%------------------------------------------------------------------------------