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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : FLD025-4 : TPTP v8.1.2. Bugfixed v2.1.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 : n009.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:37:30 EDT 2023

% Result   : Unsatisfiable 7.24s 2.73s
% Output   : CNFRefutation 7.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   46 (  17 unt;  15 typ;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   46 (  24   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (   8   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :   34 (;  34   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > u > multiplicative_identity > d > c > b > additive_identity > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(defined,type,
    defined: $i > $o ).

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

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

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

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

tff(f_258,axiom,
    ~ product(d,b,u),
    file(unknown,unknown) ).

tff(f_173,axiom,
    defined(multiplicative_identity),
    file(unknown,unknown) ).

tff(f_110,axiom,
    ! [X] :
      ( product(multiplicative_identity,X,X)
      | ~ defined(X) ),
    file(unknown,unknown) ).

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

tff(f_249,axiom,
    defined(a),
    file(unknown,unknown) ).

tff(f_254,axiom,
    product(multiplicative_identity,a,b),
    file(unknown,unknown) ).

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

tff(f_255,axiom,
    product(multiplicative_identity,c,d),
    file(unknown,unknown) ).

tff(f_256,axiom,
    product(a,c,u),
    file(unknown,unknown) ).

tff(c_70,plain,
    ~ product(d,b,u),
    inference(cnfTransformation,[status(thm)],[f_258]) ).

tff(c_34,plain,
    defined(multiplicative_identity),
    inference(cnfTransformation,[status(thm)],[f_173]) ).

tff(c_16,plain,
    ! [X_30] :
      ( ~ defined(X_30)
      | product(multiplicative_identity,X_30,X_30) ),
    inference(cnfTransformation,[status(thm)],[f_110]) ).

tff(c_91,plain,
    ! [X_85,Y_86,Z_87] :
      ( ~ product(X_85,Y_86,Z_87)
      | product(Y_86,X_85,Z_87) ),
    inference(cnfTransformation,[status(thm)],[f_122]) ).

tff(c_100,plain,
    ! [X_30] :
      ( product(X_30,multiplicative_identity,X_30)
      | ~ defined(X_30) ),
    inference(resolution,[status(thm)],[c_16,c_91]) ).

tff(c_54,plain,
    defined(a),
    inference(cnfTransformation,[status(thm)],[f_249]) ).

tff(c_64,plain,
    product(multiplicative_identity,a,b),
    inference(cnfTransformation,[status(thm)],[f_254]) ).

tff(c_504,plain,
    ! [Z_145,V_148,X_147,W_146,U_144,Y_149] :
      ( ~ product(U_144,Z_145,W_146)
      | ~ product(Y_149,Z_145,V_148)
      | ~ product(X_147,Y_149,U_144)
      | product(X_147,V_148,W_146) ),
    inference(cnfTransformation,[status(thm)],[f_94]) ).

tff(c_3423,plain,
    ! [Y_248,X_249,V_250,X_251] :
      ( ~ product(Y_248,X_249,V_250)
      | ~ product(X_251,Y_248,multiplicative_identity)
      | product(X_251,V_250,X_249)
      | ~ defined(X_249) ),
    inference(resolution,[status(thm)],[c_16,c_504]) ).

tff(c_3551,plain,
    ! [X_251] :
      ( ~ product(X_251,multiplicative_identity,multiplicative_identity)
      | product(X_251,b,a)
      | ~ defined(a) ),
    inference(resolution,[status(thm)],[c_64,c_3423]) ).

tff(c_3828,plain,
    ! [X_256] :
      ( ~ product(X_256,multiplicative_identity,multiplicative_identity)
      | product(X_256,b,a) ),
    inference(demodulation,[status(thm),theory(equality)],[c_54,c_3551]) ).

tff(c_3836,plain,
    ( product(multiplicative_identity,b,a)
    | ~ defined(multiplicative_identity) ),
    inference(resolution,[status(thm)],[c_100,c_3828]) ).

tff(c_3847,plain,
    product(multiplicative_identity,b,a),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_3836]) ).

tff(c_20,plain,
    ! [X_33,Y_32,Z_34] :
      ( ~ product(X_33,Y_32,Z_34)
      | product(Y_32,X_33,Z_34) ),
    inference(cnfTransformation,[status(thm)],[f_122]) ).

tff(c_3888,plain,
    product(b,multiplicative_identity,a),
    inference(resolution,[status(thm)],[c_3847,c_20]) ).

tff(c_66,plain,
    product(multiplicative_identity,c,d),
    inference(cnfTransformation,[status(thm)],[f_255]) ).

tff(c_68,plain,
    product(a,c,u),
    inference(cnfTransformation,[status(thm)],[f_256]) ).

tff(c_916,plain,
    ! [Y_183,V_184,X_185] :
      ( ~ product(Y_183,c,V_184)
      | ~ product(X_185,Y_183,a)
      | product(X_185,V_184,u) ),
    inference(resolution,[status(thm)],[c_68,c_504]) ).

tff(c_946,plain,
    ! [X_185] :
      ( ~ product(X_185,multiplicative_identity,a)
      | product(X_185,d,u) ),
    inference(resolution,[status(thm)],[c_66,c_916]) ).

tff(c_3922,plain,
    product(b,d,u),
    inference(resolution,[status(thm)],[c_3888,c_946]) ).

tff(c_3944,plain,
    product(d,b,u),
    inference(resolution,[status(thm)],[c_3922,c_20]) ).

tff(c_3958,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_70,c_3944]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : FLD025-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/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.35  % Computer : n009.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 19:45:38 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 7.24/2.73  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.24/2.74  
% 7.24/2.74  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.60/2.80  
% 7.60/2.80  Inference rules
% 7.60/2.80  ----------------------
% 7.60/2.80  #Ref     : 0
% 7.60/2.80  #Sup     : 913
% 7.60/2.80  #Fact    : 4
% 7.60/2.80  #Define  : 0
% 7.60/2.80  #Split   : 7
% 7.60/2.80  #Chain   : 0
% 7.60/2.80  #Close   : 0
% 7.60/2.80  
% 7.60/2.80  Ordering : KBO
% 7.60/2.80  
% 7.60/2.80  Simplification rules
% 7.60/2.80  ----------------------
% 7.60/2.80  #Subsume      : 125
% 7.60/2.80  #Demod        : 469
% 7.60/2.80  #Tautology    : 152
% 7.60/2.80  #SimpNegUnit  : 15
% 7.60/2.80  #BackRed      : 0
% 7.60/2.80  
% 7.60/2.80  #Partial instantiations: 0
% 7.60/2.80  #Strategies tried      : 1
% 7.60/2.80  
% 7.60/2.80  Timing (in seconds)
% 7.60/2.80  ----------------------
% 7.60/2.81  Preprocessing        : 0.52
% 7.60/2.81  Parsing              : 0.29
% 7.60/2.81  CNF conversion       : 0.03
% 7.60/2.81  Main loop            : 1.19
% 7.60/2.81  Inferencing          : 0.40
% 7.60/2.81  Reduction            : 0.36
% 7.60/2.81  Demodulation         : 0.26
% 7.60/2.81  BG Simplification    : 0.04
% 7.60/2.81  Subsumption          : 0.30
% 7.60/2.81  Abstraction          : 0.03
% 7.60/2.81  MUC search           : 0.00
% 7.60/2.81  Cooper               : 0.00
% 7.60/2.81  Total                : 1.80
% 7.60/2.81  Index Insertion      : 0.00
% 7.60/2.81  Index Deletion       : 0.00
% 7.60/2.81  Index Matching       : 0.00
% 7.60/2.81  BG Taut test         : 0.00
%------------------------------------------------------------------------------