TSTP Solution File: GRP001+6 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP001+6 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n023.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:13:31 EDT 2023

% Result   : Theorem 0.15s 0.54s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  14 unt;   7 typ;   0 def)
%            Number of atoms       :   91 (   0 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :   90 (  27   ~;  24   |;  29   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :  109 (   0 sgn;  65   !;   2   ?;   0   :)

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

tff(decl_23,type,
    inverse: $i > $i ).

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

tff(decl_25,type,
    esk2_2: ( $i * $i ) > $i ).

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

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

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

fof(commutativity,conjecture,
    ! [X1] :
      ( ( ! [X2,X3] :
          ? [X4] : product(X2,X3,X4)
        & ! [X2,X3,X4,X5,X6,X7] :
            ( ( product(X2,X3,X5)
              & product(X3,X4,X6)
              & product(X5,X4,X7) )
           => product(X2,X6,X7) )
        & ! [X2,X3,X4,X5,X6,X7] :
            ( ( product(X2,X3,X5)
              & product(X3,X4,X6)
              & product(X2,X6,X7) )
           => product(X5,X4,X7) )
        & ! [X2] : product(X2,X1,X2)
        & ! [X2] : product(X1,X2,X2)
        & ! [X2] : product(X2,inverse(X2),X1)
        & ! [X2] : product(inverse(X2),X2,X1) )
     => ( ! [X2] : product(X2,X2,X1)
       => ! [X5,X6,X7] :
            ( product(X5,X6,X7)
           => product(X6,X5,X7) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
        ( ( ! [X2,X3] :
            ? [X4] : product(X2,X3,X4)
          & ! [X2,X3,X4,X5,X6,X7] :
              ( ( product(X2,X3,X5)
                & product(X3,X4,X6)
                & product(X5,X4,X7) )
             => product(X2,X6,X7) )
          & ! [X2,X3,X4,X5,X6,X7] :
              ( ( product(X2,X3,X5)
                & product(X3,X4,X6)
                & product(X2,X6,X7) )
             => product(X5,X4,X7) )
          & ! [X2] : product(X2,X1,X2)
          & ! [X2] : product(X1,X2,X2)
          & ! [X2] : product(X2,inverse(X2),X1)
          & ! [X2] : product(inverse(X2),X2,X1) )
       => ( ! [X2] : product(X2,X2,X1)
         => ! [X5,X6,X7] :
              ( product(X5,X6,X7)
             => product(X6,X5,X7) ) ) ),
    inference(assume_negation,[status(cth)],[commutativity]) ).

fof(c_0_2,negated_conjecture,
    ! [X9,X10,X12,X13,X14,X15,X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28] :
      ( product(X9,X10,esk2_2(X9,X10))
      & ( ~ product(X12,X13,X15)
        | ~ product(X13,X14,X16)
        | ~ product(X15,X14,X17)
        | product(X12,X16,X17) )
      & ( ~ product(X18,X19,X21)
        | ~ product(X19,X20,X22)
        | ~ product(X18,X22,X23)
        | product(X21,X20,X23) )
      & product(X24,esk1_0,X24)
      & product(esk1_0,X25,X25)
      & product(X26,inverse(X26),esk1_0)
      & product(inverse(X27),X27,esk1_0)
      & product(X28,X28,esk1_0)
      & product(esk3_0,esk4_0,esk5_0)
      & ~ product(esk4_0,esk3_0,esk5_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( product(X3,X4,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X5,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    product(esk3_0,esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    product(X1,X1,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( product(X1,esk4_0,X2)
    | ~ product(X3,esk5_0,X2)
    | ~ product(X3,esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    product(X1,esk1_0,X1),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X4,esk1_0,X3)
    | ~ product(X4,X2,X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ( product(X1,esk4_0,esk1_0)
    | ~ product(esk5_0,esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    product(X1,X2,esk2_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_11,negated_conjecture,
    product(inverse(X1),X1,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_12,negated_conjecture,
    ( product(X1,esk1_0,X2)
    | ~ product(X3,X4,X2)
    | ~ product(X3,X4,X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    product(esk1_0,X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_14,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X3,X2,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    product(esk2_2(esk5_0,esk3_0),esk4_0,esk1_0),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X4,inverse(X2),X1)
    | ~ product(X4,esk1_0,X3) ),
    inference(spm,[status(thm)],[c_0_3,c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    product(X1,inverse(X1),esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_18,negated_conjecture,
    ( product(X1,esk1_0,X2)
    | ~ product(esk1_0,X2,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    product(esk1_0,esk4_0,esk2_2(esk5_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    ( product(esk1_0,X1,X2)
    | ~ product(X1,esk1_0,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    product(esk2_2(esk5_0,esk3_0),esk1_0,esk4_0),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ( product(X1,X2,X3)
    | ~ product(X4,esk2_2(X5,X2),X3)
    | ~ product(X4,X5,X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_10]) ).

cnf(c_0_23,negated_conjecture,
    product(esk1_0,esk2_2(esk5_0,esk3_0),esk4_0),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( product(X1,esk3_0,esk4_0)
    | ~ product(esk1_0,esk5_0,X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,negated_conjecture,
    product(esk5_0,esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_24,c_0_13]) ).

cnf(c_0_26,negated_conjecture,
    ~ product(esk4_0,esk3_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : GRP001+6 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.10  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.10/0.30  % Computer : n023.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon Aug 28 22:01:40 EDT 2023
% 0.10/0.30  % CPUTime  : 
% 0.15/0.52  start to proof: theBenchmark
% 0.15/0.54  % Version  : CSE_E---1.5
% 0.15/0.54  % Problem  : theBenchmark.p
% 0.15/0.54  % Proof found
% 0.15/0.54  % SZS status Theorem for theBenchmark.p
% 0.15/0.54  % SZS output start Proof
% See solution above
% 0.15/0.54  % Total time : 0.009000 s
% 0.15/0.54  % SZS output end Proof
% 0.15/0.54  % Total time : 0.011000 s
%------------------------------------------------------------------------------