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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP028-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/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:39 EDT 2023

% Result   : Unsatisfiable 2.33s 1.62s
% Output   : CNFRefutation 2.33s
% 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_42,axiom,
    ! [X,Y] : product(left_solution(X,Y),X,Y),
    file(unknown,unknown) ).

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

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

tff(c_4,plain,
    ! [X_7,Y_8] : product(left_solution(X_7,Y_8),X_7,Y_8),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_6,plain,
    ! [X_9,Y_10] : product(X_9,right_solution(X_9,Y_10),Y_10),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_12,plain,
    ! [U_20,X_21,Z_17,V_19,W_22,Y_18] :
      ( product(U_20,Z_17,W_22)
      | ~ product(X_21,V_19,W_22)
      | ~ product(Y_18,Z_17,V_19)
      | ~ product(X_21,Y_18,U_20) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_19,plain,
    ! [U_24,Z_25,Y_23,X_26,Y_27] :
      ( product(U_24,Z_25,Y_23)
      | ~ product(Y_27,Z_25,X_26)
      | ~ product(left_solution(X_26,Y_23),Y_27,U_24) ),
    inference(resolution,[status(thm)],[c_4,c_12]) ).

tff(c_48,plain,
    ! [U_45,X_46,Y_47,Y_48] :
      ( product(U_45,right_solution(X_46,Y_47),Y_48)
      | ~ product(left_solution(Y_47,Y_48),X_46,U_45) ),
    inference(resolution,[status(thm)],[c_6,c_19]) ).

tff(c_60,plain,
    ! [Y_49,X_50] : product(Y_49,right_solution(X_50,X_50),Y_49),
    inference(resolution,[status(thm)],[c_4,c_48]) ).

tff(c_8,plain,
    ! [X_11] : ~ product(not_identity(X_11),X_11,not_identity(X_11)),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_79,plain,
    $false,
    inference(resolution,[status(thm)],[c_60,c_8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : GRP028-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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 : n024.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 22:24:30 EDT 2023
% 0.21/0.36  % CPUTime  : 
% 2.33/1.62  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.33/1.62  
% 2.33/1.62  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.33/1.66  
% 2.33/1.66  Inference rules
% 2.33/1.66  ----------------------
% 2.33/1.66  #Ref     : 0
% 2.33/1.66  #Sup     : 17
% 2.33/1.66  #Fact    : 0
% 2.33/1.66  #Define  : 0
% 2.33/1.66  #Split   : 0
% 2.33/1.66  #Chain   : 0
% 2.33/1.66  #Close   : 0
% 2.33/1.66  
% 2.33/1.66  Ordering : KBO
% 2.33/1.66  
% 2.33/1.66  Simplification rules
% 2.33/1.66  ----------------------
% 2.33/1.66  #Subsume      : 0
% 2.33/1.66  #Demod        : 0
% 2.33/1.66  #Tautology    : 0
% 2.33/1.66  #SimpNegUnit  : 0
% 2.33/1.66  #BackRed      : 0
% 2.33/1.66  
% 2.33/1.66  #Partial instantiations: 0
% 2.33/1.66  #Strategies tried      : 1
% 2.33/1.66  
% 2.33/1.66  Timing (in seconds)
% 2.33/1.66  ----------------------
% 2.33/1.66  Preprocessing        : 0.38
% 2.33/1.66  Parsing              : 0.21
% 2.33/1.66  CNF conversion       : 0.02
% 2.33/1.66  Main loop            : 0.21
% 2.33/1.66  Inferencing          : 0.09
% 2.33/1.66  Reduction            : 0.04
% 2.33/1.66  Demodulation         : 0.03
% 2.33/1.66  BG Simplification    : 0.01
% 2.33/1.66  Subsumption          : 0.05
% 2.33/1.66  Abstraction          : 0.01
% 2.33/1.66  MUC search           : 0.00
% 2.33/1.66  Cooper               : 0.00
% 2.33/1.66  Total                : 0.65
% 2.33/1.66  Index Insertion      : 0.00
% 2.33/1.66  Index Deletion       : 0.00
% 2.33/1.66  Index Matching       : 0.00
% 2.33/1.66  BG Taut test         : 0.00
%------------------------------------------------------------------------------