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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LAT251-1 : TPTP v8.1.2. Released v3.1.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 : n012.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:31 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > complement > zero > one > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_104,axiom,
    join(complement(b),complement(a)) != complement(a),
    file(unknown,unknown) ).

tff(f_87,axiom,
    ! [X] : ( join(X,complement(X)) = one ),
    file(unknown,unknown) ).

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

tff(f_56,axiom,
    ! [X,Y] : ( meet(X,Y) = meet(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_50,axiom,
    ! [X] : ( join(X,X) = X ),
    file(unknown,unknown) ).

tff(f_89,axiom,
    ! [X] : ( meet(X,complement(X)) = zero ),
    file(unknown,unknown) ).

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

tff(f_102,axiom,
    meet(b,a) = a,
    file(unknown,unknown) ).

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

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

tff(f_97,axiom,
    ! [X,Y] :
      ( ( meet(X,Y) != zero )
      | ( join(X,Y) != one )
      | ( complement(X) = Y ) ),
    file(unknown,unknown) ).

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

tff(c_28,plain,
    join(complement(b),complement(a)) != complement(a),
    inference(cnfTransformation,[status(thm)],[f_104]) ).

tff(c_29,plain,
    join(complement(a),complement(b)) != complement(a),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_28]) ).

tff(c_18,plain,
    ! [X_17] : ( join(X_17,complement(X_17)) = one ),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_149,plain,
    ! [X_32,Y_33] : ( meet(X_32,join(X_32,Y_33)) = X_32 ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_172,plain,
    ! [X_34] : ( meet(X_34,one) = X_34 ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_149]) ).

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_206,plain,
    ! [X_35] : ( meet(one,X_35) = X_35 ),
    inference(superposition,[status(thm),theory(equality)],[c_172,c_10]) ).

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_217,plain,
    ! [Y_4] : ( join(one,Y_4) = one ),
    inference(superposition,[status(thm),theory(equality)],[c_206,c_6]) ).

tff(c_570,plain,
    ! [X_43,Y_44,Z_45] : ( join(join(X_43,Y_44),Z_45) = join(X_43,join(Y_44,Z_45)) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_647,plain,
    ! [X_17,Z_45] : ( join(X_17,join(complement(X_17),Z_45)) = join(one,Z_45) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_570]) ).

tff(c_5311,plain,
    ! [X_17,Z_45] : ( join(X_17,join(complement(X_17),Z_45)) = one ),
    inference(demodulation,[status(thm),theory(equality)],[c_217,c_647]) ).

tff(c_4,plain,
    ! [X_2] : ( join(X_2,X_2) = X_2 ),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_20,plain,
    ! [X_18] : ( meet(X_18,complement(X_18)) = zero ),
    inference(cnfTransformation,[status(thm)],[f_89]) ).

tff(c_280,plain,
    ! [X_36,Y_37] : ( join(X_36,meet(X_36,Y_37)) = X_36 ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_325,plain,
    ! [X_38] : ( join(X_38,zero) = X_38 ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_280]) ).

tff(c_352,plain,
    ! [Y_10] : ( join(zero,Y_10) = Y_10 ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_325]) ).

tff(c_490,plain,
    ! [Y_42] : ( join(zero,Y_42) = Y_42 ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_325]) ).

tff(c_711,plain,
    ! [Y_48] : ( meet(zero,Y_48) = zero ),
    inference(superposition,[status(thm),theory(equality)],[c_490,c_6]) ).

tff(c_757,plain,
    ! [Y_8] : ( meet(Y_8,zero) = zero ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_711]) ).

tff(c_99,plain,
    ! [Y_30,X_31] : ( meet(Y_30,X_31) = meet(X_31,Y_30) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_26,plain,
    meet(b,a) = a,
    inference(cnfTransformation,[status(thm)],[f_102]) ).

tff(c_114,plain,
    meet(a,b) = a,
    inference(superposition,[status(thm),theory(equality)],[c_99,c_26]) ).

tff(c_382,plain,
    ! [X_39,Y_40,Z_41] : ( meet(meet(X_39,Y_40),Z_41) = meet(X_39,meet(Y_40,Z_41)) ),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_2418,plain,
    ! [Z_73] : ( meet(a,meet(b,Z_73)) = meet(a,Z_73) ),
    inference(superposition,[status(thm),theory(equality)],[c_114,c_382]) ).

tff(c_2489,plain,
    meet(a,complement(b)) = meet(a,zero),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_2418]) ).

tff(c_2511,plain,
    meet(a,complement(b)) = zero,
    inference(demodulation,[status(thm),theory(equality)],[c_757,c_2489]) ).

tff(c_310,plain,
    ! [X_18] : ( join(X_18,zero) = X_18 ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_280]) ).

tff(c_785,plain,
    ! [X_49,Z_50,Y_51] : ( join(meet(X_49,join(Z_50,meet(X_49,Y_51))),meet(X_49,join(Y_51,meet(X_49,Z_50)))) = meet(X_49,join(Y_51,Z_50)) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_949,plain,
    ! [X_18,Y_51] : ( join(meet(X_18,join(complement(X_18),meet(X_18,Y_51))),meet(X_18,join(Y_51,zero))) = meet(X_18,join(Y_51,complement(X_18))) ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_785]) ).

tff(c_32935,plain,
    ! [X_258,Y_259] : ( join(meet(X_258,Y_259),meet(X_258,join(complement(X_258),meet(X_258,Y_259)))) = meet(X_258,join(Y_259,complement(X_258))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_310,c_949]) ).

tff(c_33350,plain,
    join(zero,meet(a,join(complement(a),meet(a,complement(b))))) = meet(a,join(complement(b),complement(a))),
    inference(superposition,[status(thm),theory(equality)],[c_2511,c_32935]) ).

tff(c_33583,plain,
    meet(a,join(complement(a),complement(b))) = zero,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_20,c_352,c_12,c_2511,c_12,c_33350]) ).

tff(c_22,plain,
    ! [X_19,Y_20] :
      ( ( complement(X_19) = Y_20 )
      | ( join(X_19,Y_20) != one )
      | ( meet(X_19,Y_20) != zero ) ),
    inference(cnfTransformation,[status(thm)],[f_97]) ).

tff(c_89777,plain,
    ( ( join(complement(a),complement(b)) = complement(a) )
    | ( join(a,join(complement(a),complement(b))) != one ) ),
    inference(superposition,[status(thm),theory(equality)],[c_33583,c_22]) ).

tff(c_89898,plain,
    join(complement(a),complement(b)) = complement(a),
    inference(demodulation,[status(thm),theory(equality)],[c_5311,c_89777]) ).

tff(c_89900,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_29,c_89898]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LAT251-1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.12  % 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.11/0.32  % Computer : n012.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu Aug  3 12:44:52 EDT 2023
% 0.11/0.32  % CPUTime  : 
% 30.84/19.64  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.84/19.65  
% 30.84/19.65  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 30.84/19.68  
% 30.84/19.68  Inference rules
% 30.84/19.68  ----------------------
% 30.84/19.68  #Ref     : 1
% 30.84/19.68  #Sup     : 22323
% 30.84/19.68  #Fact    : 0
% 30.84/19.68  #Define  : 0
% 30.84/19.68  #Split   : 4
% 30.84/19.68  #Chain   : 0
% 30.84/19.68  #Close   : 0
% 30.84/19.68  
% 30.84/19.68  Ordering : KBO
% 30.84/19.68  
% 30.84/19.68  Simplification rules
% 30.84/19.68  ----------------------
% 30.84/19.68  #Subsume      : 2584
% 30.84/19.68  #Demod        : 38969
% 30.84/19.68  #Tautology    : 11850
% 30.84/19.68  #SimpNegUnit  : 294
% 30.84/19.68  #BackRed      : 1
% 30.84/19.68  
% 30.84/19.68  #Partial instantiations: 0
% 30.84/19.68  #Strategies tried      : 1
% 30.84/19.68  
% 30.84/19.68  Timing (in seconds)
% 30.84/19.68  ----------------------
% 30.84/19.69  Preprocessing        : 0.43
% 30.84/19.69  Parsing              : 0.23
% 30.84/19.69  CNF conversion       : 0.02
% 30.84/19.69  Main loop            : 18.32
% 30.84/19.69  Inferencing          : 1.86
% 30.84/19.69  Reduction            : 13.89
% 30.84/19.69  Demodulation         : 13.08
% 30.84/19.69  BG Simplification    : 0.23
% 30.84/19.69  Subsumption          : 1.80
% 30.84/19.69  Abstraction          : 0.50
% 30.84/19.69  MUC search           : 0.00
% 30.84/19.69  Cooper               : 0.00
% 30.84/19.69  Total                : 18.81
% 30.84/19.69  Index Insertion      : 0.00
% 30.84/19.69  Index Deletion       : 0.00
% 30.84/19.69  Index Matching       : 0.00
% 30.84/19.69  BG Taut test         : 0.00
%------------------------------------------------------------------------------