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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n006.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:40:23 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > d > c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: $i ).

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

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

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

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

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

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

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

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

tff(f_116,axiom,
    ! [Y,Z,X] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
    file(unknown,unknown) ).

tff(f_112,axiom,
    ! [X,Y,Z] : ( multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ),
    file(unknown,unknown) ).

tff(f_122,axiom,
    multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
    file(unknown,unknown) ).

tff(c_28,plain,
    ! [Y_28,X_30,Z_29] : ( least_upper_bound(multiply(Y_28,X_30),multiply(Z_29,X_30)) = multiply(least_upper_bound(Y_28,Z_29),X_30) ),
    inference(cnfTransformation,[status(thm)],[f_116]) ).

tff(c_24,plain,
    ! [X_22,Y_23,Z_24] : ( least_upper_bound(multiply(X_22,Y_23),multiply(X_22,Z_24)) = multiply(X_22,least_upper_bound(Y_23,Z_24)) ),
    inference(cnfTransformation,[status(thm)],[f_112]) ).

tff(c_32,plain,
    least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) != multiply(c,multiply(least_upper_bound(a,b),d)),
    inference(cnfTransformation,[status(thm)],[f_122]) ).

tff(c_33,plain,
    multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))) != multiply(c,multiply(least_upper_bound(a,b),d)),
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_32]) ).

tff(c_35,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14  % 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.14/0.35  % Computer : n006.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 22:06:58 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 2.49/1.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.49/1.52  
% 2.49/1.52  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.49/1.56  
% 2.49/1.56  Inference rules
% 2.49/1.56  ----------------------
% 2.49/1.56  #Ref     : 0
% 2.49/1.56  #Sup     : 0
% 2.49/1.56  #Fact    : 0
% 2.49/1.56  #Define  : 0
% 2.49/1.56  #Split   : 0
% 2.49/1.56  #Chain   : 0
% 2.49/1.56  #Close   : 0
% 2.49/1.56  
% 2.49/1.56  Ordering : KBO
% 2.49/1.56  
% 2.49/1.56  Simplification rules
% 2.49/1.56  ----------------------
% 2.49/1.56  #Subsume      : 15
% 2.49/1.56  #Demod        : 2
% 2.49/1.56  #Tautology    : 0
% 2.49/1.56  #SimpNegUnit  : 0
% 2.49/1.56  #BackRed      : 0
% 2.49/1.56  
% 2.49/1.56  #Partial instantiations: 0
% 2.49/1.56  #Strategies tried      : 1
% 2.49/1.56  
% 2.49/1.56  Timing (in seconds)
% 2.49/1.56  ----------------------
% 2.49/1.56  Preprocessing        : 0.44
% 2.49/1.56  Parsing              : 0.23
% 2.49/1.56  CNF conversion       : 0.02
% 2.49/1.56  Main loop            : 0.06
% 2.49/1.56  Inferencing          : 0.00
% 2.49/1.56  Reduction            : 0.03
% 2.49/1.56  Demodulation         : 0.02
% 2.49/1.56  BG Simplification    : 0.01
% 2.49/1.56  Subsumption          : 0.03
% 2.49/1.56  Abstraction          : 0.01
% 2.49/1.56  MUC search           : 0.00
% 2.49/1.56  Cooper               : 0.00
% 2.49/1.56  Total                : 0.55
% 2.49/1.56  Index Insertion      : 0.00
% 2.49/1.56  Index Deletion       : 0.00
% 2.49/1.56  Index Matching       : 0.00
% 2.49/1.56  BG Taut test         : 0.00
%------------------------------------------------------------------------------