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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP029-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/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 : n016.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:40 EDT 2023

% Result   : Unsatisfiable 6.55s 2.58s
% Output   : CNFRefutation 6.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   31 (  12 unt;   6 typ;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   52 (  27   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   5   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   60 (;  60   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ product > equalish > multiply > #nlpp > not_right_identity > inverse > identity

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_34,axiom,
    ! [X] : equalish(X,X),
    file(unknown,unknown) ).

tff(f_124,axiom,
    ! [A] : product(inverse(A),A,identity),
    file(unknown,unknown) ).

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

tff(f_122,axiom,
    ! [A] : product(identity,A,A),
    file(unknown,unknown) ).

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

tff(f_120,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_127,axiom,
    ! [A] : ~ product(not_right_identity(A),A,not_right_identity(A)),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [X_1] : equalish(X_1,X_1),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_30,plain,
    ! [A_46] : product(inverse(A_46),A_46,identity),
    inference(cnfTransformation,[status(thm)],[f_124]) ).

tff(c_149,plain,
    ! [W_89,Z_90,Y_91,X_92] :
      ( product(W_89,Z_90,Y_91)
      | ~ product(W_89,Z_90,X_92)
      | ~ equalish(X_92,Y_91) ),
    inference(cnfTransformation,[status(thm)],[f_81]) ).

tff(c_160,plain,
    ! [A_46,Y_91] :
      ( product(inverse(A_46),A_46,Y_91)
      | ~ equalish(identity,Y_91) ),
    inference(resolution,[status(thm)],[c_30,c_149]) ).

tff(c_28,plain,
    ! [A_45] : product(identity,A_45,A_45),
    inference(cnfTransformation,[status(thm)],[f_122]) ).

tff(c_278,plain,
    ! [X_111,Z_115,Y_112,W_113,V_110,U_114] :
      ( product(X_111,V_110,W_113)
      | ~ product(U_114,Z_115,W_113)
      | ~ product(Y_112,Z_115,V_110)
      | ~ product(X_111,Y_112,U_114) ),
    inference(cnfTransformation,[status(thm)],[f_109]) ).

tff(c_1291,plain,
    ! [X_200,V_201,A_202,Y_203] :
      ( product(X_200,V_201,A_202)
      | ~ product(Y_203,A_202,V_201)
      | ~ product(X_200,Y_203,identity) ),
    inference(resolution,[status(thm)],[c_28,c_278]) ).

tff(c_2146,plain,
    ! [X_237,A_238] :
      ( product(X_237,identity,A_238)
      | ~ product(X_237,inverse(A_238),identity) ),
    inference(resolution,[status(thm)],[c_30,c_1291]) ).

tff(c_2170,plain,
    ! [A_238] :
      ( product(inverse(inverse(A_238)),identity,A_238)
      | ~ equalish(identity,identity) ),
    inference(resolution,[status(thm)],[c_160,c_2146]) ).

tff(c_2190,plain,
    ! [A_238] : product(inverse(inverse(A_238)),identity,A_238),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2170]) ).

tff(c_399,plain,
    ! [X_125,U_124,Z_126,Y_128,V_127,W_123] :
      ( product(U_124,Z_126,W_123)
      | ~ product(X_125,V_127,W_123)
      | ~ product(Y_128,Z_126,V_127)
      | ~ product(X_125,Y_128,U_124) ),
    inference(cnfTransformation,[status(thm)],[f_120]) ).

tff(c_1972,plain,
    ! [U_230,Z_231,Y_232,A_233] :
      ( product(U_230,Z_231,identity)
      | ~ product(Y_232,Z_231,A_233)
      | ~ product(inverse(A_233),Y_232,U_230) ),
    inference(resolution,[status(thm)],[c_30,c_399]) ).

tff(c_4315,plain,
    ! [U_290,A_291] :
      ( product(U_290,A_291,identity)
      | ~ product(inverse(A_291),identity,U_290) ),
    inference(resolution,[status(thm)],[c_28,c_1972]) ).

tff(c_4414,plain,
    ! [A_292] : product(A_292,inverse(A_292),identity),
    inference(resolution,[status(thm)],[c_2190,c_4315]) ).

tff(c_1344,plain,
    ! [X_200,A_46] :
      ( product(X_200,identity,A_46)
      | ~ product(X_200,inverse(A_46),identity) ),
    inference(resolution,[status(thm)],[c_30,c_1291]) ).

tff(c_4472,plain,
    ! [A_293] : product(A_293,identity,A_293),
    inference(resolution,[status(thm)],[c_4414,c_1344]) ).

tff(c_32,plain,
    ! [A_47] : ~ product(not_right_identity(A_47),A_47,not_right_identity(A_47)),
    inference(cnfTransformation,[status(thm)],[f_127]) ).

tff(c_4553,plain,
    $false,
    inference(resolution,[status(thm)],[c_4472,c_32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GRP029-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/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.13/0.36  % Computer : n016.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Thu Aug  3 22:45:23 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 6.55/2.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.55/2.59  
% 6.55/2.59  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.55/2.61  
% 6.55/2.61  Inference rules
% 6.55/2.61  ----------------------
% 6.55/2.61  #Ref     : 0
% 6.55/2.61  #Sup     : 1157
% 6.55/2.61  #Fact    : 0
% 6.55/2.61  #Define  : 0
% 6.55/2.61  #Split   : 0
% 6.55/2.61  #Chain   : 0
% 6.55/2.61  #Close   : 0
% 6.55/2.61  
% 6.55/2.61  Ordering : KBO
% 6.55/2.61  
% 6.55/2.61  Simplification rules
% 6.55/2.61  ----------------------
% 6.55/2.61  #Subsume      : 107
% 6.55/2.61  #Demod        : 205
% 6.55/2.61  #Tautology    : 167
% 6.55/2.61  #SimpNegUnit  : 0
% 6.55/2.61  #BackRed      : 0
% 6.55/2.61  
% 6.55/2.61  #Partial instantiations: 0
% 6.55/2.61  #Strategies tried      : 1
% 6.55/2.61  
% 6.55/2.61  Timing (in seconds)
% 6.55/2.61  ----------------------
% 6.55/2.62  Preprocessing        : 0.45
% 6.55/2.62  Parsing              : 0.25
% 6.55/2.62  CNF conversion       : 0.03
% 6.55/2.62  Main loop            : 1.08
% 6.55/2.62  Inferencing          : 0.37
% 6.55/2.62  Reduction            : 0.31
% 6.55/2.62  Demodulation         : 0.21
% 6.55/2.62  BG Simplification    : 0.04
% 6.55/2.62  Subsumption          : 0.29
% 6.55/2.62  Abstraction          : 0.04
% 6.55/2.62  MUC search           : 0.00
% 6.55/2.62  Cooper               : 0.00
% 6.55/2.62  Total                : 1.59
% 6.55/2.62  Index Insertion      : 0.00
% 6.55/2.62  Index Deletion       : 0.00
% 6.55/2.62  Index Matching       : 0.00
% 6.55/2.62  BG Taut test         : 0.00
%------------------------------------------------------------------------------