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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LAT039-1 : TPTP v8.1.2. Released v2.4.0.
% 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 : n014.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:46:16 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > zz > yy > xx

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(f_71,axiom,
    join(xx,yy) = yy,
    file(unknown,unknown) ).

tff(f_68,axiom,
    ! [X,Y,Z] : ( join(X,meet(Y,Z)) = meet(join(X,Y),join(X,Z)) ),
    file(unknown,unknown) ).

tff(f_73,axiom,
    join(xx,meet(yy,zz)) != meet(yy,join(xx,zz)),
    file(unknown,unknown) ).

tff(c_22,plain,
    join(xx,yy) = yy,
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_1553,plain,
    ! [X_66,Y_67,Z_68] : ( meet(join(X_66,Y_67),join(X_66,Z_68)) = join(X_66,meet(Y_67,Z_68)) ),
    inference(cnfTransformation,[status(thm)],[f_68]) ).

tff(c_1705,plain,
    ! [Z_68] : ( meet(yy,join(xx,Z_68)) = join(xx,meet(yy,Z_68)) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_1553]) ).

tff(c_24,plain,
    meet(yy,join(xx,zz)) != join(xx,meet(yy,zz)),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_15618,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1705,c_24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LAT039-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/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 : n014.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 12:49:03 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 8.94/3.41  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.94/3.41  
% 8.94/3.41  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.94/3.44  
% 8.94/3.44  Inference rules
% 8.94/3.44  ----------------------
% 8.94/3.44  #Ref     : 0
% 8.94/3.44  #Sup     : 3837
% 8.94/3.44  #Fact    : 0
% 8.94/3.44  #Define  : 0
% 8.94/3.44  #Split   : 0
% 8.94/3.44  #Chain   : 0
% 8.94/3.44  #Close   : 0
% 8.94/3.44  
% 8.94/3.44  Ordering : KBO
% 8.94/3.44  
% 8.94/3.44  Simplification rules
% 8.94/3.44  ----------------------
% 8.94/3.44  #Subsume      : 144
% 8.94/3.44  #Demod        : 4186
% 8.94/3.44  #Tautology    : 2374
% 8.94/3.44  #SimpNegUnit  : 0
% 8.94/3.44  #BackRed      : 1
% 8.94/3.44  
% 8.94/3.44  #Partial instantiations: 0
% 8.94/3.44  #Strategies tried      : 1
% 8.94/3.44  
% 8.94/3.44  Timing (in seconds)
% 8.94/3.44  ----------------------
% 8.94/3.44  Preprocessing        : 0.44
% 8.94/3.44  Parsing              : 0.22
% 8.94/3.44  CNF conversion       : 0.02
% 8.94/3.44  Main loop            : 1.81
% 8.94/3.44  Inferencing          : 0.49
% 8.94/3.44  Reduction            : 0.92
% 8.94/3.44  Demodulation         : 0.81
% 8.94/3.44  BG Simplification    : 0.05
% 8.94/3.44  Subsumption          : 0.25
% 8.94/3.44  Abstraction          : 0.08
% 8.94/3.44  MUC search           : 0.00
% 8.94/3.44  Cooper               : 0.00
% 8.94/3.44  Total                : 2.30
% 8.94/3.44  Index Insertion      : 0.00
% 8.94/3.44  Index Deletion       : 0.00
% 8.94/3.44  Index Matching       : 0.00
% 8.94/3.44  BG Taut test         : 0.00
%------------------------------------------------------------------------------