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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP160-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/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 : n019.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:19 EDT 2023

% Result   : Unsatisfiable 2.69s 1.63s
% Output   : CNFRefutation 2.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   11 (   5 unt;   6 typ;   0 def)
%            Number of atoms       :    5 (   4 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Maximal term depth    :    2 (   1 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    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :    2 (;   2   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(identity,type,
    identity: $i ).

tff(f_97,axiom,
    ! [X] : ( least_upper_bound(X,X) = X ),
    file(unknown,unknown) ).

tff(f_116,axiom,
    least_upper_bound(a,a) != a,
    file(unknown,unknown) ).

tff(c_16,plain,
    ! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
    inference(cnfTransformation,[status(thm)],[f_97]) ).

tff(c_32,plain,
    least_upper_bound(a,a) != a,
    inference(cnfTransformation,[status(thm)],[f_116]) ).

tff(c_34,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : GRP160-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/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.19/0.37  % Computer : n019.cluster.edu
% 0.19/0.37  % Model    : x86_64 x86_64
% 0.19/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37  % Memory   : 8042.1875MB
% 0.19/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37  % CPULimit : 300
% 0.19/0.37  % WCLimit  : 300
% 0.19/0.37  % DateTime : Thu Aug  3 22:15:31 EDT 2023
% 0.19/0.37  % CPUTime  : 
% 2.69/1.63  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.69/1.64  
% 2.69/1.64  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.69/1.67  
% 2.69/1.67  Inference rules
% 2.69/1.67  ----------------------
% 2.69/1.67  #Ref     : 0
% 2.69/1.67  #Sup     : 0
% 2.69/1.67  #Fact    : 0
% 2.69/1.67  #Define  : 0
% 2.69/1.67  #Split   : 0
% 2.69/1.67  #Chain   : 0
% 2.69/1.67  #Close   : 0
% 2.69/1.67  
% 2.69/1.67  Ordering : KBO
% 2.69/1.67  
% 2.69/1.67  Simplification rules
% 2.69/1.67  ----------------------
% 2.69/1.67  #Subsume      : 15
% 2.69/1.67  #Demod        : 1
% 2.69/1.67  #Tautology    : 0
% 2.69/1.67  #SimpNegUnit  : 0
% 2.69/1.67  #BackRed      : 0
% 2.69/1.67  
% 2.69/1.67  #Partial instantiations: 0
% 2.69/1.67  #Strategies tried      : 1
% 2.69/1.67  
% 2.69/1.67  Timing (in seconds)
% 2.69/1.67  ----------------------
% 2.90/1.67  Preprocessing        : 0.49
% 2.90/1.67  Parsing              : 0.24
% 2.90/1.67  CNF conversion       : 0.03
% 2.90/1.67  Main loop            : 0.07
% 2.90/1.67  Inferencing          : 0.00
% 2.90/1.67  Reduction            : 0.03
% 2.90/1.67  Demodulation         : 0.02
% 2.90/1.67  BG Simplification    : 0.02
% 2.90/1.68  Subsumption          : 0.03
% 2.90/1.68  Abstraction          : 0.01
% 2.90/1.68  MUC search           : 0.00
% 2.90/1.68  Cooper               : 0.00
% 2.90/1.68  Total                : 0.61
% 2.90/1.68  Index Insertion      : 0.00
% 2.90/1.68  Index Deletion       : 0.00
% 2.90/1.68  Index Matching       : 0.00
% 2.90/1.68  BG Taut test         : 0.00
%------------------------------------------------------------------------------