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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LAT038-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 : n004.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 89.47s 73.61s
% Output   : CNFRefutation 89.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   37 (  29 unt;   8 typ;   0 def)
%            Number of atoms       :   29 (  28 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   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  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   43 (;  43   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ meet > join > f > #nlpp > n0 > dd > cc > bb > aa

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_85,axiom,
    f(aa,dd) != f(cc,dd),
    file(unknown,unknown) ).

tff(f_75,axiom,
    ! [U,V,W] : ( f(join(U,V),W) = join(f(U,W),f(V,W)) ),
    file(unknown,unknown) ).

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

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

tff(f_82,axiom,
    f(join(aa,bb),dd) = f(join(cc,bb),dd),
    file(unknown,unknown) ).

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

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

tff(f_83,axiom,
    meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
    file(unknown,unknown) ).

tff(c_34,plain,
    f(cc,dd) != f(aa,dd),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_2318,plain,
    ! [U_91,W_92,V_93] : ( join(f(U_91,W_92),f(V_93,W_92)) = f(join(U_91,V_93),W_92) ),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

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

tff(c_2360,plain,
    ! [U_91,W_92,V_93] : ( meet(f(U_91,W_92),f(join(U_91,V_93),W_92)) = f(U_91,W_92) ),
    inference(superposition,[status(thm),theory(equality)],[c_2318,c_6]) ).

tff(c_12,plain,
    ! [Y_10,X_9] : ( join(Y_10,X_9) = join(X_9,Y_10) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_30,plain,
    f(join(cc,bb),dd) = f(join(aa,bb),dd),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_35,plain,
    f(join(bb,cc),dd) = f(join(aa,bb),dd),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_30]) ).

tff(c_22,plain,
    ! [U_23,W_25,V_24] : ( join(f(U_23,W_25),f(V_24,W_25)) = f(join(U_23,V_24),W_25) ),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

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

tff(c_1016,plain,
    ! [X_68,Y_69,Z_70] : ( join(meet(X_68,Y_69),meet(X_68,Z_70)) = meet(X_68,join(Y_69,Z_70)) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_1118,plain,
    ! [Y_8,Y_69,X_7] : ( join(meet(Y_8,Y_69),meet(X_7,Y_8)) = meet(Y_8,join(Y_69,X_7)) ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_1016]) ).

tff(c_32,plain,
    meet(f(cc,dd),f(bb,dd)) = meet(f(aa,dd),f(bb,dd)),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_20,plain,
    ! [X_20,Y_21,Z_22] : ( join(meet(X_20,Y_21),meet(X_20,Z_22)) = meet(X_20,join(Y_21,Z_22)) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_142445,plain,
    ! [Z_627] : ( join(meet(f(aa,dd),f(bb,dd)),meet(f(cc,dd),Z_627)) = meet(f(cc,dd),join(f(bb,dd),Z_627)) ),
    inference(superposition,[status(thm),theory(equality)],[c_32,c_20]) ).

tff(c_142960,plain,
    meet(f(cc,dd),join(f(bb,dd),f(aa,dd))) = meet(f(aa,dd),join(f(bb,dd),f(cc,dd))),
    inference(superposition,[status(thm),theory(equality)],[c_1118,c_142445]) ).

tff(c_143172,plain,
    meet(f(cc,dd),f(join(aa,bb),dd)) = f(aa,dd),
    inference(demodulation,[status(thm),theory(equality)],[c_2360,c_35,c_22,c_22,c_12,c_142960]) ).

tff(c_81054,plain,
    ! [U_457,W_458,V_459] : ( meet(f(U_457,W_458),f(join(U_457,V_459),W_458)) = f(U_457,W_458) ),
    inference(superposition,[status(thm),theory(equality)],[c_2318,c_6]) ).

tff(c_277045,plain,
    ! [Y_852,W_853,X_854] : ( meet(f(Y_852,W_853),f(join(X_854,Y_852),W_853)) = f(Y_852,W_853) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_81054]) ).

tff(c_278042,plain,
    meet(f(cc,dd),f(join(aa,bb),dd)) = f(cc,dd),
    inference(superposition,[status(thm),theory(equality)],[c_35,c_277045]) ).

tff(c_278269,plain,
    f(cc,dd) = f(aa,dd),
    inference(demodulation,[status(thm),theory(equality)],[c_143172,c_278042]) ).

tff(c_278271,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_34,c_278269]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LAT038-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % 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.13/0.34  % Computer : n004.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:28:26 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 89.47/73.61  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 89.47/73.62  
% 89.47/73.62  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 89.47/73.65  
% 89.47/73.65  Inference rules
% 89.47/73.65  ----------------------
% 89.47/73.65  #Ref     : 0
% 89.47/73.65  #Sup     : 70811
% 89.47/73.65  #Fact    : 0
% 89.47/73.65  #Define  : 0
% 89.47/73.65  #Split   : 0
% 89.47/73.65  #Chain   : 0
% 89.47/73.65  #Close   : 0
% 89.47/73.65  
% 89.47/73.65  Ordering : KBO
% 89.47/73.65  
% 89.47/73.65  Simplification rules
% 89.47/73.65  ----------------------
% 89.47/73.65  #Subsume      : 4454
% 89.47/73.65  #Demod        : 105313
% 89.47/73.65  #Tautology    : 29659
% 89.47/73.65  #SimpNegUnit  : 1
% 89.47/73.65  #BackRed      : 6
% 89.47/73.65  
% 89.47/73.65  #Partial instantiations: 0
% 89.47/73.65  #Strategies tried      : 1
% 89.47/73.65  
% 89.47/73.65  Timing (in seconds)
% 89.47/73.65  ----------------------
% 89.47/73.65  Preprocessing        : 0.48
% 89.47/73.65  Parsing              : 0.23
% 89.47/73.65  CNF conversion       : 0.02
% 89.47/73.66  Main loop            : 72.05
% 89.47/73.66  Inferencing          : 5.12
% 89.47/73.66  Reduction            : 53.22
% 89.47/73.66  Demodulation         : 51.36
% 89.47/73.66  BG Simplification    : 0.76
% 89.47/73.66  Subsumption          : 9.70
% 89.47/73.66  Abstraction          : 1.59
% 89.47/73.66  MUC search           : 0.00
% 89.47/73.66  Cooper               : 0.00
% 89.47/73.66  Total                : 72.58
% 89.47/73.66  Index Insertion      : 0.00
% 89.47/73.66  Index Deletion       : 0.00
% 89.47/73.66  Index Matching       : 0.00
% 89.47/73.66  BG Taut test         : 0.00
%------------------------------------------------------------------------------