TSTP Solution File: GRP012+5 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP012+5 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n012.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 Aug 22 10:39:37 EDT 2023

% Result   : Theorem 6.90s 2.73s
% Output   : CNFRefutation 7.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (  10 unt;   8 typ;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :   65 (  27   ~;  23   |;  11   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 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    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   68 (;  67   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ product > #nlpp > inverse > #skF_5 > #skF_6 > #skF_3 > #skF_1 > #skF_4 > #skF_2

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(product,type,
    product: ( $i * $i * $i ) > $o ).

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

tff('#skF_5',type,
    '#skF_5': $i ).

tff('#skF_6',type,
    '#skF_6': $i ).

tff('#skF_3',type,
    '#skF_3': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

tff('#skF_4',type,
    '#skF_4': $i ).

tff('#skF_2',type,
    '#skF_2': ( $i * $i ) > $i ).

tff(f_67,negated_conjecture,
    ~ ! [E] :
        ( ( ! [X,Y] :
            ? [Z] : product(X,Y,Z)
          & ! [X,Y,Z,U,V,W] :
              ( ( product(X,Y,U)
                & product(Y,Z,V)
                & product(U,Z,W) )
             => product(X,V,W) )
          & ! [X,Y,Z,U,V,W] :
              ( ( product(X,Y,U)
                & product(Y,Z,V)
                & product(X,V,W) )
             => product(U,Z,W) )
          & ! [X] : product(X,E,X)
          & ! [X] : product(E,X,X)
          & ! [X] : product(X,inverse(X),E)
          & ! [X] : product(inverse(X),X,E) )
       => ! [U,V,W,X] :
            ( ( product(inverse(U),inverse(V),W)
              & product(V,U,X) )
           => product(inverse(W),inverse(X),E) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distribution) ).

tff(c_10,plain,
    ! [X_42] : product(X_42,inverse(X_42),'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_12,plain,
    ! [X_41] : product('#skF_1',X_41,X_41),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_26,plain,
    ! [X_54,V_53,U_50,Y_55,W_51,Z_52] :
      ( product(X_54,V_53,W_51)
      | ~ product(U_50,Z_52,W_51)
      | ~ product(Y_55,Z_52,V_53)
      | ~ product(X_54,Y_55,U_50) ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_220,plain,
    ! [X_82,V_83,X_84,Y_85] :
      ( product(X_82,V_83,X_84)
      | ~ product(Y_85,X_84,V_83)
      | ~ product(X_82,Y_85,'#skF_1') ),
    inference(resolution,[status(thm)],[c_12,c_26]) ).

tff(c_259,plain,
    ! [X_82,X_42] :
      ( product(X_82,'#skF_1',inverse(X_42))
      | ~ product(X_82,X_42,'#skF_1') ),
    inference(resolution,[status(thm)],[c_10,c_220]) ).

tff(c_48,plain,
    ! [V_56,Z_58,X_61,W_57,U_60,Y_59] :
      ( product(U_60,Z_58,W_57)
      | ~ product(X_61,V_56,W_57)
      | ~ product(Y_59,Z_58,V_56)
      | ~ product(X_61,Y_59,U_60) ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_971,plain,
    ! [U_115,Z_116,Y_117,X_118] :
      ( product(U_115,Z_116,'#skF_1')
      | ~ product(Y_117,Z_116,inverse(X_118))
      | ~ product(X_118,Y_117,U_115) ),
    inference(resolution,[status(thm)],[c_10,c_48]) ).

tff(c_1383,plain,
    ! [U_133,X_134] :
      ( product(U_133,inverse(X_134),'#skF_1')
      | ~ product(X_134,'#skF_1',U_133) ),
    inference(resolution,[status(thm)],[c_12,c_971]) ).

tff(c_2,plain,
    ~ product(inverse('#skF_5'),inverse('#skF_6'),'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_1425,plain,
    ~ product('#skF_6','#skF_1',inverse('#skF_5')),
    inference(resolution,[status(thm)],[c_1383,c_2]) ).

tff(c_1429,plain,
    ~ product('#skF_6','#skF_5','#skF_1'),
    inference(resolution,[status(thm)],[c_259,c_1425]) ).

tff(c_14,plain,
    ! [X_40] : product(X_40,'#skF_1',X_40),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_4,plain,
    product('#skF_4','#skF_3','#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_70,plain,
    ! [X_62,V_63,Y_64] :
      ( product(X_62,V_63,'#skF_6')
      | ~ product(Y_64,'#skF_3',V_63)
      | ~ product(X_62,Y_64,'#skF_4') ),
    inference(resolution,[status(thm)],[c_4,c_26]) ).

tff(c_85,plain,
    ! [X_62] :
      ( product(X_62,'#skF_3','#skF_6')
      | ~ product(X_62,'#skF_1','#skF_4') ),
    inference(resolution,[status(thm)],[c_12,c_70]) ).

tff(c_434,plain,
    ! [U_95,Z_96,X_97,Y_98] :
      ( product(U_95,Z_96,X_97)
      | ~ product(Y_98,Z_96,'#skF_1')
      | ~ product(X_97,Y_98,U_95) ),
    inference(resolution,[status(thm)],[c_14,c_48]) ).

tff(c_458,plain,
    ! [U_95,X_42,X_97] :
      ( product(U_95,inverse(X_42),X_97)
      | ~ product(X_97,X_42,U_95) ),
    inference(resolution,[status(thm)],[c_10,c_434]) ).

tff(c_6,plain,
    product(inverse('#skF_3'),inverse('#skF_4'),'#skF_5'),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_1490,plain,
    ! [X_135,V_136,Y_137,X_138] :
      ( product(X_135,V_136,'#skF_1')
      | ~ product(Y_137,inverse(X_138),V_136)
      | ~ product(X_135,Y_137,X_138) ),
    inference(resolution,[status(thm)],[c_10,c_26]) ).

tff(c_5269,plain,
    ! [X_213] :
      ( product(X_213,'#skF_5','#skF_1')
      | ~ product(X_213,inverse('#skF_3'),'#skF_4') ),
    inference(resolution,[status(thm)],[c_6,c_1490]) ).

tff(c_5275,plain,
    ! [U_214] :
      ( product(U_214,'#skF_5','#skF_1')
      | ~ product('#skF_4','#skF_3',U_214) ),
    inference(resolution,[status(thm)],[c_458,c_5269]) ).

tff(c_5278,plain,
    ( product('#skF_6','#skF_5','#skF_1')
    | ~ product('#skF_4','#skF_1','#skF_4') ),
    inference(resolution,[status(thm)],[c_85,c_5275]) ).

tff(c_5286,plain,
    product('#skF_6','#skF_5','#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_5278]) ).

tff(c_5288,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1429,c_5286]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GRP012+5 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 22:20:22 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 6.90/2.73  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.18/2.73  
% 7.18/2.73  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.18/2.76  
% 7.18/2.76  Inference rules
% 7.18/2.76  ----------------------
% 7.18/2.76  #Ref     : 0
% 7.18/2.76  #Sup     : 1435
% 7.18/2.76  #Fact    : 0
% 7.18/2.76  #Define  : 0
% 7.18/2.76  #Split   : 2
% 7.18/2.76  #Chain   : 0
% 7.18/2.76  #Close   : 0
% 7.18/2.76  
% 7.18/2.76  Ordering : KBO
% 7.18/2.76  
% 7.18/2.76  Simplification rules
% 7.18/2.76  ----------------------
% 7.18/2.76  #Subsume      : 17
% 7.18/2.76  #Demod        : 277
% 7.18/2.76  #Tautology    : 276
% 7.18/2.76  #SimpNegUnit  : 1
% 7.18/2.76  #BackRed      : 0
% 7.18/2.76  
% 7.18/2.76  #Partial instantiations: 0
% 7.18/2.76  #Strategies tried      : 1
% 7.18/2.76  
% 7.18/2.76  Timing (in seconds)
% 7.18/2.76  ----------------------
% 7.28/2.77  Preprocessing        : 0.43
% 7.28/2.77  Parsing              : 0.24
% 7.28/2.77  CNF conversion       : 0.03
% 7.28/2.77  Main loop            : 1.26
% 7.28/2.77  Inferencing          : 0.38
% 7.28/2.77  Reduction            : 0.41
% 7.28/2.77  Demodulation         : 0.30
% 7.28/2.77  BG Simplification    : 0.04
% 7.28/2.77  Subsumption          : 0.33
% 7.28/2.77  Abstraction          : 0.04
% 7.28/2.77  MUC search           : 0.00
% 7.28/2.77  Cooper               : 0.00
% 7.28/2.77  Total                : 1.73
% 7.28/2.77  Index Insertion      : 0.00
% 7.28/2.77  Index Deletion       : 0.00
% 7.28/2.77  Index Matching       : 0.00
% 7.28/2.77  BG Taut test         : 0.00
%------------------------------------------------------------------------------