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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LAT031-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/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 : n023.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:15 EDT 2023

% Result   : Unsatisfiable 96.20s 81.36s
% Output   : CNFRefutation 96.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   23 (  18 unt;   5 typ;   0 def)
%            Number of atoms       :   18 (  17 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  :    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   :   36 (;  36   !;   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_56,axiom,
    ! [X,Y] : ( meet(X,Y) = meet(Y,X) ),
    file(unknown,unknown) ).

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

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

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

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

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

tff(c_10,plain,
    ! [Y_8,X_7] : ( meet(Y_8,X_7) = meet(X_7,Y_8) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_1323,plain,
    ! [X_62,Y_63,Z_64] : ( join(meet(X_62,Y_63),meet(X_62,Z_64)) = meet(X_62,join(Y_63,Z_64)) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_38084,plain,
    ! [Y_271,X_272,Z_273] : ( join(meet(Y_271,X_272),meet(X_272,Z_273)) = meet(X_272,join(Y_271,Z_273)) ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_1323]) ).

tff(c_8,plain,
    ! [X_5,Y_6] : ( join(X_5,meet(X_5,Y_6)) = X_5 ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_234,plain,
    ! [X_34,Y_35,Z_36] : ( join(join(X_34,Y_35),Z_36) = join(X_34,join(Y_35,Z_36)) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_280,plain,
    ! [X_5,Y_6,Z_36] : ( join(X_5,join(meet(X_5,Y_6),Z_36)) = join(X_5,Z_36) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_234]) ).

tff(c_38268,plain,
    ! [Y_271,X_272,Z_273] : ( join(Y_271,meet(X_272,join(Y_271,Z_273))) = join(Y_271,meet(X_272,Z_273)) ),
    inference(superposition,[status(thm),theory(equality)],[c_38084,c_280]) ).

tff(c_6,plain,
    ! [X_3,Y_4] : ( meet(X_3,join(X_3,Y_4)) = X_3 ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_38689,plain,
    ! [X_3,Y_4,Z_273] : ( meet(join(X_3,Y_4),join(X_3,Z_273)) = join(X_3,meet(join(X_3,Y_4),Z_273)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_38084]) ).

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

tff(c_265594,plain,
    join(xx,meet(join(xx,yy),zz)) != join(xx,meet(yy,zz)),
    inference(demodulation,[status(thm),theory(equality)],[c_38689,c_20]) ).

tff(c_265599,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_38268,c_10,c_265594]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : LAT031-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.13  % 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.13/0.34  % Computer : n023.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 12:45:52 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 96.20/81.36  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 96.20/81.37  
% 96.20/81.37  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 96.20/81.39  
% 96.20/81.39  Inference rules
% 96.20/81.39  ----------------------
% 96.20/81.39  #Ref     : 0
% 96.20/81.39  #Sup     : 67102
% 96.20/81.39  #Fact    : 0
% 96.20/81.39  #Define  : 0
% 96.20/81.39  #Split   : 0
% 96.20/81.39  #Chain   : 0
% 96.20/81.39  #Close   : 0
% 96.20/81.39  
% 96.20/81.39  Ordering : KBO
% 96.20/81.39  
% 96.20/81.39  Simplification rules
% 96.20/81.39  ----------------------
% 96.20/81.39  #Subsume      : 5930
% 96.20/81.39  #Demod        : 106380
% 96.20/81.39  #Tautology    : 25168
% 96.20/81.39  #SimpNegUnit  : 0
% 96.20/81.39  #BackRed      : 7
% 96.20/81.39  
% 96.20/81.39  #Partial instantiations: 0
% 96.20/81.39  #Strategies tried      : 1
% 96.20/81.39  
% 96.20/81.39  Timing (in seconds)
% 96.20/81.39  ----------------------
% 96.20/81.40  Preprocessing        : 0.53
% 96.20/81.40  Parsing              : 0.30
% 96.20/81.40  CNF conversion       : 0.02
% 96.20/81.40  Main loop            : 79.79
% 96.20/81.40  Inferencing          : 5.80
% 96.20/81.40  Reduction            : 61.54
% 96.20/81.40  Demodulation         : 59.76
% 96.20/81.40  BG Simplification    : 0.90
% 96.20/81.40  Subsumption          : 8.10
% 96.20/81.40  Abstraction          : 1.86
% 96.20/81.40  MUC search           : 0.00
% 96.20/81.40  Cooper               : 0.00
% 96.20/81.40  Total                : 80.38
% 96.20/81.40  Index Insertion      : 0.00
% 96.20/81.40  Index Deletion       : 0.00
% 96.20/81.40  Index Matching       : 0.00
% 96.20/81.40  BG Taut test         : 0.00
%------------------------------------------------------------------------------