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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : BOO005-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 : n002.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:34:22 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ sum > product > multiply > add > #nlpp > inverse > x > multiplicative_identity > additive_identity

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_50,axiom,
    ! [X,Y] : sum(X,Y,add(X,Y)),
    file(unknown,unknown) ).

tff(f_184,axiom,
    ! [X] : sum(inverse(X),X,multiplicative_identity),
    file(unknown,unknown) ).

tff(f_199,axiom,
    ! [X,Y,U,V] :
      ( ~ sum(X,Y,U)
      | ~ sum(X,Y,V)
      | ( U = V ) ),
    file(unknown,unknown) ).

tff(f_186,axiom,
    ! [X] : sum(X,inverse(X),multiplicative_identity),
    file(unknown,unknown) ).

tff(f_68,axiom,
    ! [X] : product(multiplicative_identity,X,X),
    file(unknown,unknown) ).

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

tff(f_154,axiom,
    ! [V3,Z,V1,X,Y,V2,V4] :
      ( ~ sum(X,Y,V1)
      | ~ sum(X,Z,V2)
      | ~ product(Y,Z,V3)
      | ~ product(V1,V2,V4)
      | sum(X,V3,V4) ),
    file(unknown,unknown) ).

tff(f_57,axiom,
    ! [X,Y,Z] :
      ( ~ sum(X,Y,Z)
      | sum(Y,X,Z) ),
    file(unknown,unknown) ).

tff(f_211,axiom,
    ~ sum(x,multiplicative_identity,multiplicative_identity),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [X_1,Y_2] : sum(X_1,Y_2,add(X_1,Y_2)),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_34,plain,
    ! [X_71] : sum(inverse(X_71),X_71,multiplicative_identity),
    inference(cnfTransformation,[status(thm)],[f_184]) ).

tff(c_190,plain,
    ! [V_112,U_113,X_114,Y_115] :
      ( ( V_112 = U_113 )
      | ~ sum(X_114,Y_115,V_112)
      | ~ sum(X_114,Y_115,U_113) ),
    inference(cnfTransformation,[status(thm)],[f_199]) ).

tff(c_406,plain,
    ! [U_132,X_133] :
      ( ( multiplicative_identity = U_132 )
      | ~ sum(inverse(X_133),X_133,U_132) ),
    inference(resolution,[status(thm)],[c_34,c_190]) ).

tff(c_429,plain,
    ! [Y_2] : ( add(inverse(Y_2),Y_2) = multiplicative_identity ),
    inference(resolution,[status(thm)],[c_2,c_406]) ).

tff(c_36,plain,
    ! [X_72] : sum(X_72,inverse(X_72),multiplicative_identity),
    inference(cnfTransformation,[status(thm)],[f_186]) ).

tff(c_14,plain,
    ! [X_13] : product(multiplicative_identity,X_13,X_13),
    inference(cnfTransformation,[status(thm)],[f_68]) ).

tff(c_16,plain,
    ! [X_14] : product(X_14,multiplicative_identity,X_14),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_1148,plain,
    ! [V3_211,Z_209,Y_212,V4_213,V2_208,V1_210,X_214] :
      ( sum(X_214,V3_211,V4_213)
      | ~ product(V1_210,V2_208,V4_213)
      | ~ product(Y_212,Z_209,V3_211)
      | ~ sum(X_214,Z_209,V2_208)
      | ~ sum(X_214,Y_212,V1_210) ),
    inference(cnfTransformation,[status(thm)],[f_154]) ).

tff(c_4170,plain,
    ! [X_394,Y_392,X_395,V3_396,Z_393] :
      ( sum(X_394,V3_396,X_395)
      | ~ product(Y_392,Z_393,V3_396)
      | ~ sum(X_394,Z_393,multiplicative_identity)
      | ~ sum(X_394,Y_392,X_395) ),
    inference(resolution,[status(thm)],[c_16,c_1148]) ).

tff(c_4393,plain,
    ! [X_405,X_406,X_407] :
      ( sum(X_405,X_406,X_407)
      | ~ sum(X_405,X_406,multiplicative_identity)
      | ~ sum(X_405,multiplicative_identity,X_407) ),
    inference(resolution,[status(thm)],[c_14,c_4170]) ).

tff(c_4671,plain,
    ! [X_415,X_416] :
      ( sum(X_415,inverse(X_415),X_416)
      | ~ sum(X_415,multiplicative_identity,X_416) ),
    inference(resolution,[status(thm)],[c_36,c_4393]) ).

tff(c_57,plain,
    ! [Y_95,X_96,Z_97] :
      ( sum(Y_95,X_96,Z_97)
      | ~ sum(X_96,Y_95,Z_97) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_68,plain,
    ! [Y_2,X_1] : sum(Y_2,X_1,add(X_1,Y_2)),
    inference(resolution,[status(thm)],[c_2,c_57]) ).

tff(c_203,plain,
    ! [X_1,Y_2,U_113] :
      ( ( add(X_1,Y_2) = U_113 )
      | ~ sum(Y_2,X_1,U_113) ),
    inference(resolution,[status(thm)],[c_68,c_190]) ).

tff(c_4716,plain,
    ! [X_415,X_416] :
      ( ( add(inverse(X_415),X_415) = X_416 )
      | ~ sum(X_415,multiplicative_identity,X_416) ),
    inference(resolution,[status(thm)],[c_4671,c_203]) ).

tff(c_4776,plain,
    ! [X_417,X_418] :
      ( ( multiplicative_identity = X_417 )
      | ~ sum(X_418,multiplicative_identity,X_417) ),
    inference(demodulation,[status(thm),theory(equality)],[c_429,c_4716]) ).

tff(c_4913,plain,
    ! [X_425] : ( add(X_425,multiplicative_identity) = multiplicative_identity ),
    inference(resolution,[status(thm)],[c_2,c_4776]) ).

tff(c_4937,plain,
    ! [X_425] : sum(X_425,multiplicative_identity,multiplicative_identity),
    inference(superposition,[status(thm),theory(equality)],[c_4913,c_2]) ).

tff(c_46,plain,
    ~ sum(x,multiplicative_identity,multiplicative_identity),
    inference(cnfTransformation,[status(thm)],[f_211]) ).

tff(c_5052,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4937,c_46]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : BOO005-1 : TPTP v8.1.2. Released v1.0.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.14/0.36  % Computer : n002.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 18:48:01 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 6.87/2.75  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.87/2.76  
% 6.87/2.76  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.87/2.79  
% 6.87/2.79  Inference rules
% 6.87/2.79  ----------------------
% 6.87/2.79  #Ref     : 0
% 6.87/2.79  #Sup     : 1173
% 6.87/2.79  #Fact    : 0
% 6.87/2.79  #Define  : 0
% 6.87/2.79  #Split   : 5
% 6.87/2.79  #Chain   : 0
% 6.87/2.79  #Close   : 0
% 6.87/2.79  
% 6.87/2.79  Ordering : KBO
% 6.87/2.79  
% 6.87/2.79  Simplification rules
% 6.87/2.79  ----------------------
% 6.87/2.79  #Subsume      : 278
% 6.87/2.79  #Demod        : 473
% 6.87/2.79  #Tautology    : 427
% 6.87/2.79  #SimpNegUnit  : 0
% 6.87/2.79  #BackRed      : 2
% 6.87/2.79  
% 6.87/2.79  #Partial instantiations: 0
% 6.87/2.79  #Strategies tried      : 1
% 6.87/2.79  
% 6.87/2.79  Timing (in seconds)
% 6.87/2.79  ----------------------
% 6.87/2.79  Preprocessing        : 0.52
% 6.87/2.79  Parsing              : 0.30
% 6.87/2.79  CNF conversion       : 0.03
% 6.87/2.79  Main loop            : 1.10
% 6.87/2.79  Inferencing          : 0.37
% 6.87/2.79  Reduction            : 0.32
% 6.87/2.79  Demodulation         : 0.23
% 6.87/2.79  BG Simplification    : 0.04
% 6.87/2.79  Subsumption          : 0.29
% 6.87/2.79  Abstraction          : 0.04
% 6.87/2.79  MUC search           : 0.00
% 6.87/2.79  Cooper               : 0.00
% 6.87/2.79  Total                : 1.67
% 6.87/2.79  Index Insertion      : 0.00
% 6.87/2.79  Index Deletion       : 0.00
% 6.87/2.79  Index Matching       : 0.00
% 6.87/2.79  BG Taut test         : 0.00
%------------------------------------------------------------------------------