TSTP Solution File: SEU305+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU305+1 : TPTP v8.1.2. Released v3.3.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 : n008.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:58:21 EDT 2023

% Result   : Theorem 4.79s 2.13s
% Output   : CNFRefutation 5.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   72 (  17 unt;  35 typ;   0 def)
%            Number of atoms       :  105 (  29 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  108 (  40   ~;  46   |;  12   &)
%                                         (   1 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   53 (  28   >;  25   *;   0   +;   0  <<)
%            Number of predicates  :   18 (  16 usr;   1 prp; 0-3 aty)
%            Number of functors    :   19 (  19 usr;   7 con; 0-6 aty)
%            Number of variables   :   30 (;  30   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ relation_of2_as_subset > relation_of2 > quasi_total > below > subset > in > element > preboolean > one_sorted_str > join_semilatt_str > join_commutative > function > empty_carrier > empty > diff_closed > cup_closed > apply_binary_as_element > join_commut > join > apply_binary > cartesian_product2 > #nlpp > the_carrier > the_L_join > powerset > empty_set > #skF_7 > #skF_4 > #skF_3 > #skF_10 > #skF_6 > #skF_2 > #skF_1 > #skF_9 > #skF_8 > #skF_5

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_7',type,
    '#skF_7': $i > $i ).

tff(empty_carrier,type,
    empty_carrier: $i > $o ).

tff(cup_closed,type,
    cup_closed: $i > $o ).

tff('#skF_4',type,
    '#skF_4': $i > $i ).

tff(quasi_total,type,
    quasi_total: ( $i * $i * $i ) > $o ).

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

tff(element,type,
    element: ( $i * $i ) > $o ).

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

tff(function,type,
    function: $i > $o ).

tff('#skF_3',type,
    '#skF_3': ( $i * $i ) > $i ).

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

tff('#skF_10',type,
    '#skF_10': $i ).

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

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

tff(in,type,
    in: ( $i * $i ) > $o ).

tff(one_sorted_str,type,
    one_sorted_str: $i > $o ).

tff(subset,type,
    subset: ( $i * $i ) > $o ).

tff(preboolean,type,
    preboolean: $i > $o ).

tff('#skF_6',type,
    '#skF_6': $i ).

tff('#skF_2',type,
    '#skF_2': $i ).

tff(diff_closed,type,
    diff_closed: $i > $o ).

tff('#skF_1',type,
    '#skF_1': $i ).

tff(empty,type,
    empty: $i > $o ).

tff('#skF_9',type,
    '#skF_9': $i ).

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

tff(relation_of2,type,
    relation_of2: ( $i * $i * $i ) > $o ).

tff('#skF_8',type,
    '#skF_8': $i ).

tff(join_semilatt_str,type,
    join_semilatt_str: $i > $o ).

tff(below,type,
    below: ( $i * $i * $i ) > $o ).

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

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

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

tff(relation_of2_as_subset,type,
    relation_of2_as_subset: ( $i * $i * $i ) > $o ).

tff('#skF_5',type,
    '#skF_5': ( $i * $i ) > $i ).

tff(join_commutative,type,
    join_commutative: $i > $o ).

tff(f_250,negated_conjecture,
    ~ ! [A] :
        ( ( ~ empty_carrier(A)
          & join_commutative(A)
          & join_semilatt_str(A) )
       => ! [B] :
            ( element(B,the_carrier(A))
           => ! [C] :
                ( element(C,the_carrier(A))
               => ( ( below(A,B,C)
                    & below(A,C,B) )
                 => ( B = C ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_lattices) ).

tff(f_84,axiom,
    ! [A] :
      ( ( ~ empty_carrier(A)
        & join_semilatt_str(A) )
     => ! [B] :
          ( element(B,the_carrier(A))
         => ! [C] :
              ( element(C,the_carrier(A))
             => ( below(A,B,C)
              <=> ( join(A,B,C) = C ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_lattices) ).

tff(f_220,axiom,
    ! [A,B,C] :
      ( ( ~ empty_carrier(A)
        & join_commutative(A)
        & join_semilatt_str(A)
        & element(B,the_carrier(A))
        & element(C,the_carrier(A)) )
     => ( join_commut(A,B,C) = join(A,B,C) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k3_lattices) ).

tff(f_56,axiom,
    ! [A,B,C] :
      ( ( ~ empty_carrier(A)
        & join_commutative(A)
        & join_semilatt_str(A)
        & element(B,the_carrier(A))
        & element(C,the_carrier(A)) )
     => ( join_commut(A,B,C) = join_commut(A,C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_lattices) ).

tff(c_90,plain,
    '#skF_10' != '#skF_9',
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_104,plain,
    ~ empty_carrier('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_100,plain,
    join_semilatt_str('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_96,plain,
    element('#skF_10',the_carrier('#skF_8')),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_98,plain,
    element('#skF_9',the_carrier('#skF_8')),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_92,plain,
    below('#skF_8','#skF_10','#skF_9'),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_434,plain,
    ! [A_190,B_191,C_192] :
      ( ( join(A_190,B_191,C_192) = C_192 )
      | ~ below(A_190,B_191,C_192)
      | ~ element(C_192,the_carrier(A_190))
      | ~ element(B_191,the_carrier(A_190))
      | ~ join_semilatt_str(A_190)
      | empty_carrier(A_190) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_436,plain,
    ( ( join('#skF_8','#skF_10','#skF_9') = '#skF_9' )
    | ~ element('#skF_9',the_carrier('#skF_8'))
    | ~ element('#skF_10',the_carrier('#skF_8'))
    | ~ join_semilatt_str('#skF_8')
    | empty_carrier('#skF_8') ),
    inference(resolution,[status(thm)],[c_92,c_434]) ).

tff(c_441,plain,
    ( ( join('#skF_8','#skF_10','#skF_9') = '#skF_9' )
    | empty_carrier('#skF_8') ),
    inference(demodulation,[status(thm),theory(equality)],[c_100,c_96,c_98,c_436]) ).

tff(c_442,plain,
    join('#skF_8','#skF_10','#skF_9') = '#skF_9',
    inference(negUnitSimplification,[status(thm)],[c_104,c_441]) ).

tff(c_102,plain,
    join_commutative('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_649,plain,
    ! [A_211,B_212,C_213] :
      ( ( join_commut(A_211,B_212,C_213) = join(A_211,B_212,C_213) )
      | ~ element(C_213,the_carrier(A_211))
      | ~ element(B_212,the_carrier(A_211))
      | ~ join_semilatt_str(A_211)
      | ~ join_commutative(A_211)
      | empty_carrier(A_211) ),
    inference(cnfTransformation,[status(thm)],[f_220]) ).

tff(c_659,plain,
    ! [B_212] :
      ( ( join_commut('#skF_8',B_212,'#skF_9') = join('#skF_8',B_212,'#skF_9') )
      | ~ element(B_212,the_carrier('#skF_8'))
      | ~ join_semilatt_str('#skF_8')
      | ~ join_commutative('#skF_8')
      | empty_carrier('#skF_8') ),
    inference(resolution,[status(thm)],[c_98,c_649]) ).

tff(c_675,plain,
    ! [B_212] :
      ( ( join_commut('#skF_8',B_212,'#skF_9') = join('#skF_8',B_212,'#skF_9') )
      | ~ element(B_212,the_carrier('#skF_8'))
      | empty_carrier('#skF_8') ),
    inference(demodulation,[status(thm),theory(equality)],[c_102,c_100,c_659]) ).

tff(c_719,plain,
    ! [B_217] :
      ( ( join_commut('#skF_8',B_217,'#skF_9') = join('#skF_8',B_217,'#skF_9') )
      | ~ element(B_217,the_carrier('#skF_8')) ),
    inference(negUnitSimplification,[status(thm)],[c_104,c_675]) ).

tff(c_737,plain,
    join_commut('#skF_8','#skF_10','#skF_9') = join('#skF_8','#skF_10','#skF_9'),
    inference(resolution,[status(thm)],[c_96,c_719]) ).

tff(c_756,plain,
    join_commut('#skF_8','#skF_10','#skF_9') = '#skF_9',
    inference(demodulation,[status(thm),theory(equality)],[c_442,c_737]) ).

tff(c_525,plain,
    ! [A_201,C_202,B_203] :
      ( ( join_commut(A_201,C_202,B_203) = join_commut(A_201,B_203,C_202) )
      | ~ element(C_202,the_carrier(A_201))
      | ~ element(B_203,the_carrier(A_201))
      | ~ join_semilatt_str(A_201)
      | ~ join_commutative(A_201)
      | empty_carrier(A_201) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_533,plain,
    ! [B_203] :
      ( ( join_commut('#skF_8',B_203,'#skF_9') = join_commut('#skF_8','#skF_9',B_203) )
      | ~ element(B_203,the_carrier('#skF_8'))
      | ~ join_semilatt_str('#skF_8')
      | ~ join_commutative('#skF_8')
      | empty_carrier('#skF_8') ),
    inference(resolution,[status(thm)],[c_98,c_525]) ).

tff(c_545,plain,
    ! [B_203] :
      ( ( join_commut('#skF_8',B_203,'#skF_9') = join_commut('#skF_8','#skF_9',B_203) )
      | ~ element(B_203,the_carrier('#skF_8'))
      | empty_carrier('#skF_8') ),
    inference(demodulation,[status(thm),theory(equality)],[c_102,c_100,c_533]) ).

tff(c_578,plain,
    ! [B_208] :
      ( ( join_commut('#skF_8',B_208,'#skF_9') = join_commut('#skF_8','#skF_9',B_208) )
      | ~ element(B_208,the_carrier('#skF_8')) ),
    inference(negUnitSimplification,[status(thm)],[c_104,c_545]) ).

tff(c_605,plain,
    join_commut('#skF_8','#skF_10','#skF_9') = join_commut('#skF_8','#skF_9','#skF_10'),
    inference(resolution,[status(thm)],[c_96,c_578]) ).

tff(c_759,plain,
    join_commut('#skF_8','#skF_9','#skF_10') = '#skF_9',
    inference(demodulation,[status(thm),theory(equality)],[c_756,c_605]) ).

tff(c_94,plain,
    below('#skF_8','#skF_9','#skF_10'),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_438,plain,
    ( ( join('#skF_8','#skF_9','#skF_10') = '#skF_10' )
    | ~ element('#skF_10',the_carrier('#skF_8'))
    | ~ element('#skF_9',the_carrier('#skF_8'))
    | ~ join_semilatt_str('#skF_8')
    | empty_carrier('#skF_8') ),
    inference(resolution,[status(thm)],[c_94,c_434]) ).

tff(c_445,plain,
    ( ( join('#skF_8','#skF_9','#skF_10') = '#skF_10' )
    | empty_carrier('#skF_8') ),
    inference(demodulation,[status(thm),theory(equality)],[c_100,c_98,c_96,c_438]) ).

tff(c_446,plain,
    join('#skF_8','#skF_9','#skF_10') = '#skF_10',
    inference(negUnitSimplification,[status(thm)],[c_104,c_445]) ).

tff(c_657,plain,
    ! [B_212] :
      ( ( join_commut('#skF_8',B_212,'#skF_10') = join('#skF_8',B_212,'#skF_10') )
      | ~ element(B_212,the_carrier('#skF_8'))
      | ~ join_semilatt_str('#skF_8')
      | ~ join_commutative('#skF_8')
      | empty_carrier('#skF_8') ),
    inference(resolution,[status(thm)],[c_96,c_649]) ).

tff(c_671,plain,
    ! [B_212] :
      ( ( join_commut('#skF_8',B_212,'#skF_10') = join('#skF_8',B_212,'#skF_10') )
      | ~ element(B_212,the_carrier('#skF_8'))
      | empty_carrier('#skF_8') ),
    inference(demodulation,[status(thm),theory(equality)],[c_102,c_100,c_657]) ).

tff(c_833,plain,
    ! [B_223] :
      ( ( join_commut('#skF_8',B_223,'#skF_10') = join('#skF_8',B_223,'#skF_10') )
      | ~ element(B_223,the_carrier('#skF_8')) ),
    inference(negUnitSimplification,[status(thm)],[c_104,c_671]) ).

tff(c_854,plain,
    join_commut('#skF_8','#skF_9','#skF_10') = join('#skF_8','#skF_9','#skF_10'),
    inference(resolution,[status(thm)],[c_98,c_833]) ).

tff(c_871,plain,
    '#skF_10' = '#skF_9',
    inference(demodulation,[status(thm),theory(equality)],[c_759,c_446,c_854]) ).

tff(c_873,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_90,c_871]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU305+1 : TPTP v8.1.2. Released v3.3.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.36  % Computer : n008.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 11:36:19 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 4.79/2.13  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.79/2.14  
% 4.79/2.14  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.16/2.17  
% 5.16/2.17  Inference rules
% 5.16/2.17  ----------------------
% 5.16/2.17  #Ref     : 0
% 5.16/2.17  #Sup     : 160
% 5.16/2.17  #Fact    : 0
% 5.16/2.17  #Define  : 0
% 5.16/2.17  #Split   : 4
% 5.16/2.17  #Chain   : 0
% 5.16/2.17  #Close   : 0
% 5.16/2.17  
% 5.16/2.17  Ordering : KBO
% 5.16/2.17  
% 5.16/2.17  Simplification rules
% 5.16/2.17  ----------------------
% 5.16/2.17  #Subsume      : 35
% 5.16/2.17  #Demod        : 70
% 5.16/2.17  #Tautology    : 41
% 5.16/2.17  #SimpNegUnit  : 42
% 5.16/2.17  #BackRed      : 9
% 5.16/2.17  
% 5.16/2.17  #Partial instantiations: 0
% 5.16/2.17  #Strategies tried      : 1
% 5.16/2.17  
% 5.16/2.17  Timing (in seconds)
% 5.16/2.17  ----------------------
% 5.16/2.17  Preprocessing        : 0.60
% 5.16/2.17  Parsing              : 0.31
% 5.16/2.17  CNF conversion       : 0.05
% 5.16/2.17  Main loop            : 0.51
% 5.16/2.17  Inferencing          : 0.19
% 5.16/2.17  Reduction            : 0.15
% 5.16/2.17  Demodulation         : 0.10
% 5.16/2.17  BG Simplification    : 0.04
% 5.16/2.17  Subsumption          : 0.11
% 5.16/2.17  Abstraction          : 0.02
% 5.16/2.17  MUC search           : 0.00
% 5.16/2.17  Cooper               : 0.00
% 5.16/2.17  Total                : 1.16
% 5.16/2.17  Index Insertion      : 0.00
% 5.16/2.17  Index Deletion       : 0.00
% 5.16/2.17  Index Matching       : 0.00
% 5.16/2.17  BG Taut test         : 0.00
%------------------------------------------------------------------------------