TSTP Solution File: GRP028-4 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP028-4 : TPTP v8.1.2. Released v2.6.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 : n024.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 3.04s 2.01s
% Output   : CNFRefutation 3.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   16 (   8 unt;   4 typ;   0 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   20 (  11   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   4   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   0 con; 1-2 aty)
%            Number of variables   :   33 (;  33   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ product > right_solution > left_solution > #nlpp > not_identity

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_47,axiom,
    ! [X,Y] : product(left_solution(X,Y),X,Y),
    file(unknown,unknown) ).

tff(f_49,axiom,
    ! [X,Y] : product(X,right_solution(X,Y),Y),
    file(unknown,unknown) ).

tff(f_34,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_53,axiom,
    ! [X] : ~ product(not_identity(X),X,not_identity(X)),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [X_13,Y_14] : product(left_solution(X_13,Y_14),X_13,Y_14),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_8,plain,
    ! [X_15,Y_16] : product(X_15,right_solution(X_15,Y_16),Y_16),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_28,plain,
    ! [W_39,V_36,Z_34,U_37,X_38,Y_35] :
      ( product(U_37,Z_34,W_39)
      | ~ product(X_38,V_36,W_39)
      | ~ product(Y_35,Z_34,V_36)
      | ~ product(X_38,Y_35,U_37) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_428,plain,
    ! [Z_107,U_106,X_103,Y_105,Y_104] :
      ( product(U_106,Z_107,Y_104)
      | ~ product(Y_105,Z_107,X_103)
      | ~ product(left_solution(X_103,Y_104),Y_105,U_106) ),
    inference(resolution,[status(thm)],[c_6,c_28]) ).

tff(c_548,plain,
    ! [U_118,X_119,Y_120,Y_121] :
      ( product(U_118,right_solution(X_119,Y_120),Y_121)
      | ~ product(left_solution(Y_120,Y_121),X_119,U_118) ),
    inference(resolution,[status(thm)],[c_8,c_428]) ).

tff(c_595,plain,
    ! [Y_122,X_123] : product(Y_122,right_solution(X_123,X_123),Y_122),
    inference(resolution,[status(thm)],[c_6,c_548]) ).

tff(c_10,plain,
    ! [X_17] : ~ product(not_identity(X_17),X_17,not_identity(X_17)),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_632,plain,
    $false,
    inference(resolution,[status(thm)],[c_595,c_10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : GRP028-4 : TPTP v8.1.2. Released v2.6.0.
% 0.13/0.15  % 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.15/0.37  % Computer : n024.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 22:01:45 EDT 2023
% 0.23/0.37  % CPUTime  : 
% 3.04/2.01  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.04/2.01  
% 3.04/2.01  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.57/2.05  
% 3.57/2.05  Inference rules
% 3.57/2.05  ----------------------
% 3.57/2.05  #Ref     : 0
% 3.57/2.05  #Sup     : 157
% 3.57/2.05  #Fact    : 0
% 3.57/2.05  #Define  : 0
% 3.57/2.05  #Split   : 0
% 3.57/2.05  #Chain   : 0
% 3.57/2.05  #Close   : 0
% 3.57/2.05  
% 3.57/2.05  Ordering : KBO
% 3.57/2.05  
% 3.57/2.05  Simplification rules
% 3.57/2.05  ----------------------
% 3.57/2.05  #Subsume      : 0
% 3.57/2.05  #Demod        : 11
% 3.57/2.05  #Tautology    : 12
% 3.57/2.05  #SimpNegUnit  : 0
% 3.57/2.05  #BackRed      : 0
% 3.57/2.05  
% 3.57/2.05  #Partial instantiations: 0
% 3.57/2.05  #Strategies tried      : 1
% 3.57/2.05  
% 3.57/2.05  Timing (in seconds)
% 3.57/2.05  ----------------------
% 3.57/2.05  Preprocessing        : 0.41
% 3.57/2.05  Parsing              : 0.23
% 3.57/2.05  CNF conversion       : 0.02
% 3.57/2.05  Main loop            : 0.45
% 3.57/2.05  Inferencing          : 0.17
% 3.57/2.05  Reduction            : 0.11
% 3.57/2.05  Demodulation         : 0.08
% 3.57/2.05  BG Simplification    : 0.02
% 3.57/2.05  Subsumption          : 0.11
% 3.57/2.05  Abstraction          : 0.02
% 3.57/2.06  MUC search           : 0.00
% 3.57/2.06  Cooper               : 0.00
% 3.57/2.06  Total                : 0.91
% 3.57/2.06  Index Insertion      : 0.00
% 3.57/2.06  Index Deletion       : 0.00
% 3.57/2.06  Index Matching       : 0.00
% 3.57/2.06  BG Taut test         : 0.00
%------------------------------------------------------------------------------