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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP001-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 : n004.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:32 EDT 2023

% Result   : Unsatisfiable 4.30s 2.10s
% Output   : CNFRefutation 4.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   38 (  18 unt;   7 typ;   0 def)
%            Number of atoms       :   57 (   4 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   54 (  28   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   62 (;  62   !;   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_108,axiom,
    ~ product(b,a,c),
    file(unknown,unknown) ).

tff(f_70,axiom,
    ! [X,Y] : product(X,Y,multiply(X,Y)),
    file(unknown,unknown) ).

tff(f_106,axiom,
    product(a,b,c),
    file(unknown,unknown) ).

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

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

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

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

tff(c_22,plain,
    ~ product(b,a,c),
    inference(cnfTransformation,[status(thm)],[f_108]) ).

tff(c_10,plain,
    ! [X_5,Y_6] : product(X_5,Y_6,multiply(X_5,Y_6)),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

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

tff(c_18,plain,
    ! [X_23] : product(X_23,X_23,identity),
    inference(cnfTransformation,[status(thm)],[f_105]) ).

tff(c_51,plain,
    ! [W_39,Z_40,X_36,V_38,U_37,Y_35] :
      ( product(U_37,Z_40,W_39)
      | ~ product(X_36,V_38,W_39)
      | ~ product(Y_35,Z_40,V_38)
      | ~ product(X_36,Y_35,U_37) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_399,plain,
    ! [U_66,Z_67,Y_68,X_69] :
      ( product(U_66,Z_67,identity)
      | ~ product(Y_68,Z_67,X_69)
      | ~ product(X_69,Y_68,U_66) ),
    inference(resolution,[status(thm)],[c_18,c_51]) ).

tff(c_466,plain,
    ! [U_74] :
      ( product(U_74,b,identity)
      | ~ product(c,a,U_74) ),
    inference(resolution,[status(thm)],[c_20,c_399]) ).

tff(c_470,plain,
    product(multiply(c,a),b,identity),
    inference(resolution,[status(thm)],[c_10,c_466]) ).

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

tff(c_170,plain,
    ! [Z_51,V_52,W_47,X_50,Y_48,U_49] :
      ( product(X_50,V_52,W_47)
      | ~ product(U_49,Z_51,W_47)
      | ~ product(Y_48,Z_51,V_52)
      | ~ product(X_50,Y_48,U_49) ),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_616,plain,
    ! [X_81,V_82,X_83,Y_84] :
      ( product(X_81,V_82,X_83)
      | ~ product(Y_84,X_83,V_82)
      | ~ product(X_81,Y_84,identity) ),
    inference(resolution,[status(thm)],[c_2,c_170]) ).

tff(c_644,plain,
    ! [X_85,X_86] :
      ( product(X_85,identity,X_86)
      | ~ product(X_85,X_86,identity) ),
    inference(resolution,[status(thm)],[c_18,c_616]) ).

tff(c_662,plain,
    product(multiply(c,a),identity,b),
    inference(resolution,[status(thm)],[c_470,c_644]) ).

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

tff(c_29,plain,
    ! [Z_31,W_32,X_33,Y_34] :
      ( ( Z_31 = W_32 )
      | ~ product(X_33,Y_34,W_32)
      | ~ product(X_33,Y_34,Z_31) ),
    inference(cnfTransformation,[status(thm)],[f_79]) ).

tff(c_48,plain,
    ! [Z_31,X_2] :
      ( ( Z_31 = X_2 )
      | ~ product(X_2,identity,Z_31) ),
    inference(resolution,[status(thm)],[c_4,c_29]) ).

tff(c_780,plain,
    multiply(c,a) = b,
    inference(resolution,[status(thm)],[c_662,c_48]) ).

tff(c_794,plain,
    product(c,a,b),
    inference(superposition,[status(thm),theory(equality)],[c_780,c_10]) ).

tff(c_1530,plain,
    ! [U_134,Z_135,X_136,Y_137] :
      ( product(U_134,Z_135,X_136)
      | ~ product(Y_137,Z_135,identity)
      | ~ product(X_136,Y_137,U_134) ),
    inference(resolution,[status(thm)],[c_4,c_51]) ).

tff(c_1553,plain,
    ! [U_139,X_140,X_141] :
      ( product(U_139,X_140,X_141)
      | ~ product(X_141,X_140,U_139) ),
    inference(resolution,[status(thm)],[c_18,c_1530]) ).

tff(c_1569,plain,
    product(b,a,c),
    inference(resolution,[status(thm)],[c_794,c_1553]) ).

tff(c_1590,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_22,c_1569]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP001-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.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 22:13:11 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 4.30/2.10  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.30/2.10  
% 4.30/2.10  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.64/2.13  
% 4.64/2.13  Inference rules
% 4.64/2.13  ----------------------
% 4.64/2.13  #Ref     : 0
% 4.64/2.13  #Sup     : 372
% 4.64/2.13  #Fact    : 0
% 4.64/2.13  #Define  : 0
% 4.64/2.13  #Split   : 6
% 4.64/2.13  #Chain   : 0
% 4.64/2.13  #Close   : 0
% 4.64/2.13  
% 4.64/2.13  Ordering : KBO
% 4.64/2.13  
% 4.64/2.13  Simplification rules
% 4.64/2.13  ----------------------
% 4.64/2.13  #Subsume      : 37
% 4.64/2.13  #Demod        : 154
% 4.64/2.13  #Tautology    : 164
% 4.64/2.13  #SimpNegUnit  : 1
% 4.64/2.13  #BackRed      : 13
% 4.64/2.13  
% 4.64/2.13  #Partial instantiations: 0
% 4.64/2.13  #Strategies tried      : 1
% 4.64/2.13  
% 4.64/2.13  Timing (in seconds)
% 4.64/2.13  ----------------------
% 4.64/2.14  Preprocessing        : 0.41
% 4.64/2.14  Parsing              : 0.22
% 4.64/2.14  CNF conversion       : 0.02
% 4.64/2.14  Main loop            : 0.67
% 4.64/2.14  Inferencing          : 0.24
% 4.64/2.14  Reduction            : 0.18
% 4.64/2.14  Demodulation         : 0.12
% 4.64/2.14  BG Simplification    : 0.03
% 4.64/2.14  Subsumption          : 0.17
% 4.64/2.14  Abstraction          : 0.02
% 4.64/2.14  MUC search           : 0.00
% 4.64/2.14  Cooper               : 0.00
% 4.64/2.14  Total                : 1.13
% 4.64/2.14  Index Insertion      : 0.00
% 4.64/2.14  Index Deletion       : 0.00
% 4.64/2.14  Index Matching       : 0.00
% 4.64/2.14  BG Taut test         : 0.00
%------------------------------------------------------------------------------