TSTP Solution File: GRP044-2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP044-2 : TPTP v8.1.2. Released v1.0.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 : 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 : Tue Aug 22 10:39:43 EDT 2023

% Result   : Unsatisfiable 3.72s 1.97s
% Output   : CNFRefutation 3.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   27 (  10 unt;   9 typ;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  18   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   4   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   30 (;  30   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ product > equalish > multiply > #nlpp > inverse > result > identity > c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: $i ).

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

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

tff(multiply,type,
    multiply: ( $i * $i ) > $i ).

tff(b,type,
    b: $i ).

tff(identity,type,
    identity: $i ).

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

tff(result,type,
    result: $i ).

tff(c,type,
    c: $i ).

tff(f_98,axiom,
    equalish(a,b),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ! [X] : product(identity,X,X),
    file(unknown,unknown) ).

tff(f_95,axiom,
    ! [X,Y,W,Z] :
      ( ~ equalish(X,Y)
      | ~ product(W,Z,X)
      | product(W,Z,Y) ),
    file(unknown,unknown) ).

tff(f_99,axiom,
    product(a,c,result),
    file(unknown,unknown) ).

tff(f_87,axiom,
    ! [W,U,Z,X,Y,V] :
      ( ~ product(X,Y,U)
      | ~ product(Y,Z,V)
      | ~ product(X,V,W)
      | product(U,Z,W) ),
    file(unknown,unknown) ).

tff(f_101,axiom,
    ~ product(b,c,result),
    file(unknown,unknown) ).

tff(c_16,plain,
    equalish(a,b),
    inference(cnfTransformation,[status(thm)],[f_98]) ).

tff(c_2,plain,
    ! [X_1] : product(identity,X_1,X_1),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_48,plain,
    ! [W_36,Z_37,Y_38,X_39] :
      ( product(W_36,Z_37,Y_38)
      | ~ product(W_36,Z_37,X_39)
      | ~ equalish(X_39,Y_38) ),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_59,plain,
    ! [X_1,Y_38] :
      ( product(identity,X_1,Y_38)
      | ~ equalish(X_1,Y_38) ),
    inference(resolution,[status(thm)],[c_2,c_48]) ).

tff(c_18,plain,
    product(a,c,result),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_93,plain,
    ! [W_46,Z_47,X_48,Y_51,U_49,V_50] :
      ( product(U_49,Z_47,W_46)
      | ~ product(X_48,V_50,W_46)
      | ~ product(Y_51,Z_47,V_50)
      | ~ product(X_48,Y_51,U_49) ),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_326,plain,
    ! [U_76,Z_77,X_78,Y_79] :
      ( product(U_76,Z_77,X_78)
      | ~ product(Y_79,Z_77,X_78)
      | ~ product(identity,Y_79,U_76) ),
    inference(resolution,[status(thm)],[c_2,c_93]) ).

tff(c_561,plain,
    ! [U_94] :
      ( product(U_94,c,result)
      | ~ product(identity,a,U_94) ),
    inference(resolution,[status(thm)],[c_18,c_326]) ).

tff(c_603,plain,
    ! [Y_95] :
      ( product(Y_95,c,result)
      | ~ equalish(a,Y_95) ),
    inference(resolution,[status(thm)],[c_59,c_561]) ).

tff(c_20,plain,
    ~ product(b,c,result),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_630,plain,
    ~ equalish(a,b),
    inference(resolution,[status(thm)],[c_603,c_20]) ).

tff(c_645,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_630]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GRP044-2 : TPTP v8.1.2. Released v1.0.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.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 21:42:51 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.72/1.97  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.72/1.97  
% 3.72/1.97  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.72/2.00  
% 3.72/2.00  Inference rules
% 3.72/2.00  ----------------------
% 3.72/2.00  #Ref     : 0
% 3.72/2.00  #Sup     : 159
% 3.72/2.00  #Fact    : 0
% 3.72/2.00  #Define  : 0
% 3.72/2.00  #Split   : 3
% 3.72/2.00  #Chain   : 0
% 3.72/2.00  #Close   : 0
% 3.72/2.00  
% 3.72/2.00  Ordering : KBO
% 3.72/2.00  
% 3.72/2.00  Simplification rules
% 3.72/2.00  ----------------------
% 3.72/2.00  #Subsume      : 5
% 3.72/2.00  #Demod        : 35
% 3.72/2.00  #Tautology    : 26
% 3.72/2.00  #SimpNegUnit  : 0
% 3.72/2.00  #BackRed      : 0
% 3.72/2.00  
% 3.72/2.00  #Partial instantiations: 0
% 3.72/2.00  #Strategies tried      : 1
% 3.72/2.00  
% 3.72/2.00  Timing (in seconds)
% 3.72/2.00  ----------------------
% 3.72/2.01  Preprocessing        : 0.42
% 3.72/2.01  Parsing              : 0.23
% 3.72/2.01  CNF conversion       : 0.02
% 3.72/2.01  Main loop            : 0.49
% 3.72/2.01  Inferencing          : 0.19
% 3.72/2.01  Reduction            : 0.13
% 3.72/2.01  Demodulation         : 0.09
% 3.72/2.01  BG Simplification    : 0.02
% 3.72/2.01  Subsumption          : 0.12
% 3.72/2.01  Abstraction          : 0.02
% 3.72/2.01  MUC search           : 0.00
% 3.72/2.01  Cooper               : 0.00
% 3.72/2.01  Total                : 0.97
% 3.72/2.01  Index Insertion      : 0.00
% 3.72/2.01  Index Deletion       : 0.00
% 3.72/2.01  Index Matching       : 0.00
% 3.72/2.01  BG Taut test         : 0.00
%------------------------------------------------------------------------------