TSTP Solution File: GRP017-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP017-1 : 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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/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:37 EDT 2023

% Result   : Unsatisfiable 3.62s 1.99s
% Output   : CNFRefutation 3.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   27 (  13 unt;   7 typ;   0 def)
%            Number of atoms       :   34 (   6 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   30 (  16   ~;  14   |;   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  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (;  32   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ product > multiply > #nlpp > inverse > 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(c,type,
    c: $i ).

tff(f_98,axiom,
    b != c,
    file(unknown,unknown) ).

tff(f_94,axiom,
    product(b,a,identity),
    file(unknown,unknown) ).

tff(f_95,axiom,
    product(a,c,identity),
    file(unknown,unknown) ).

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

tff(f_90,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_50,axiom,
    ! [X] : product(identity,X,X),
    file(unknown,unknown) ).

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

tff(c_26,plain,
    c != b,
    inference(cnfTransformation,[status(thm)],[f_98]) ).

tff(c_20,plain,
    product(b,a,identity),
    inference(cnfTransformation,[status(thm)],[f_94]) ).

tff(c_22,plain,
    product(a,c,identity),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_4,plain,
    ! [X_2] : product(X_2,identity,X_2),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_118,plain,
    ! [U_39,Z_42,X_38,W_41,Y_37,V_40] :
      ( product(U_39,Z_42,W_41)
      | ~ product(X_38,V_40,W_41)
      | ~ product(Y_37,Z_42,V_40)
      | ~ product(X_38,Y_37,U_39) ),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_647,plain,
    ! [U_83,Z_84,X_85,Y_86] :
      ( product(U_83,Z_84,X_85)
      | ~ product(Y_86,Z_84,identity)
      | ~ product(X_85,Y_86,U_83) ),
    inference(resolution,[status(thm)],[c_4,c_118]) ).

tff(c_717,plain,
    ! [U_90,X_91] :
      ( product(U_90,c,X_91)
      | ~ product(X_91,a,U_90) ),
    inference(resolution,[status(thm)],[c_22,c_647]) ).

tff(c_733,plain,
    product(identity,c,b),
    inference(resolution,[status(thm)],[c_20,c_717]) ).

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

tff(c_32,plain,
    ! [Z_29,W_30,X_31,Y_32] :
      ( ( Z_29 = W_30 )
      | ~ product(X_31,Y_32,W_30)
      | ~ product(X_31,Y_32,Z_29) ),
    inference(cnfTransformation,[status(thm)],[f_68]) ).

tff(c_59,plain,
    ! [Z_29,X_1] :
      ( ( Z_29 = X_1 )
      | ~ product(identity,X_1,Z_29) ),
    inference(resolution,[status(thm)],[c_2,c_32]) ).

tff(c_749,plain,
    c = b,
    inference(resolution,[status(thm)],[c_733,c_59]) ).

tff(c_764,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_26,c_749]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GRP017-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35  % Computer : n017.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 21:29:06 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 3.62/1.99  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.62/1.99  
% 3.62/1.99  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.85/2.02  
% 3.85/2.02  Inference rules
% 3.85/2.02  ----------------------
% 3.85/2.02  #Ref     : 0
% 3.85/2.02  #Sup     : 176
% 3.85/2.02  #Fact    : 0
% 3.85/2.02  #Define  : 0
% 3.85/2.02  #Split   : 0
% 3.85/2.02  #Chain   : 0
% 3.85/2.02  #Close   : 0
% 3.85/2.02  
% 3.85/2.02  Ordering : KBO
% 3.85/2.02  
% 3.85/2.02  Simplification rules
% 3.85/2.02  ----------------------
% 3.85/2.02  #Subsume      : 6
% 3.85/2.02  #Demod        : 71
% 3.85/2.02  #Tautology    : 90
% 3.85/2.02  #SimpNegUnit  : 1
% 3.85/2.02  #BackRed      : 0
% 3.85/2.02  
% 3.85/2.02  #Partial instantiations: 0
% 3.85/2.02  #Strategies tried      : 1
% 3.85/2.02  
% 3.85/2.02  Timing (in seconds)
% 3.85/2.02  ----------------------
% 3.85/2.02  Preprocessing        : 0.46
% 3.85/2.02  Parsing              : 0.24
% 3.85/2.02  CNF conversion       : 0.02
% 3.85/2.02  Main loop            : 0.44
% 3.85/2.02  Inferencing          : 0.18
% 3.85/2.02  Reduction            : 0.12
% 3.85/2.02  Demodulation         : 0.09
% 3.85/2.02  BG Simplification    : 0.02
% 3.85/2.02  Subsumption          : 0.09
% 3.85/2.02  Abstraction          : 0.02
% 3.85/2.02  MUC search           : 0.00
% 3.85/2.02  Cooper               : 0.00
% 3.85/2.02  Total                : 0.94
% 3.85/2.02  Index Insertion      : 0.00
% 3.85/2.02  Index Deletion       : 0.00
% 3.85/2.02  Index Matching       : 0.00
% 3.85/2.02  BG Taut test         : 0.00
%------------------------------------------------------------------------------