TSTP Solution File: SWB029+2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWB029+2 : TPTP v8.1.2. Released v5.2.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 : 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 11:00:30 EDT 2023

% Result   : Theorem 4.24s 2.09s
% Output   : CNFRefutation 4.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   54 (  16 unt;  19 typ;   0 def)
%            Number of atoms       :  102 (   0 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :  119 (  52   ~;  44   |;  17   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (   5   >;  11   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;  14 con; 0-5 aty)
%            Number of variables   :   57 (;  53   !;   4   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ iext > icext > ic > #nlpp > uri_rdf_type > uri_rdf_rest > uri_rdf_nil > uri_rdf_first > uri_owl_intersectionOf > uri_owl_complementOf > uri_owl_Class > uri_ex_w > uri_ex_B > uri_ex_A > #skF_2 > #skF_5 > #skF_6 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_83,axiom,
    ? [BNODE_x,BNODE_y,BNODE_l1,BNODE_l2] :
      ( iext(uri_rdf_type,uri_ex_A,uri_owl_Class)
      & iext(uri_rdf_type,uri_ex_B,uri_owl_Class)
      & iext(uri_rdf_type,uri_ex_w,BNODE_x)
      & iext(uri_owl_intersectionOf,BNODE_x,BNODE_l1)
      & iext(uri_rdf_first,BNODE_l1,uri_ex_A)
      & iext(uri_rdf_rest,BNODE_l1,BNODE_l2)
      & iext(uri_rdf_first,BNODE_l2,BNODE_y)
      & iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil)
      & iext(uri_owl_complementOf,BNODE_y,uri_ex_A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_029_Ex_Falso_Quodlibet) ).

tff(f_28,axiom,
    ! [X,C] :
      ( iext(uri_rdf_type,X,C)
    <=> icext(C,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdfs_cext_def) ).

tff(f_63,axiom,
    ! [Z,S1,C1,S2,C2] :
      ( ( iext(uri_rdf_first,S1,C1)
        & iext(uri_rdf_rest,S1,S2)
        & iext(uri_rdf_first,S2,C2)
        & iext(uri_rdf_rest,S2,uri_rdf_nil) )
     => ( iext(uri_owl_intersectionOf,Z,S1)
      <=> ( ic(Z)
          & ic(C1)
          & ic(C2)
          & ! [X] :
              ( icext(Z,X)
            <=> ( icext(C1,X)
                & icext(C2,X) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_bool_intersectionof_class_002) ).

tff(f_40,axiom,
    ! [Z,C] :
      ( iext(uri_owl_complementOf,Z,C)
     => ( ic(Z)
        & ic(C)
        & ! [X] :
            ( icext(Z,X)
          <=> ~ icext(C,X) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_bool_complementof_class) ).

tff(c_40,plain,
    iext(uri_owl_complementOf,'#skF_4',uri_ex_A),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_48,plain,
    iext(uri_rdf_first,'#skF_5',uri_ex_A),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_50,plain,
    iext(uri_owl_intersectionOf,'#skF_3','#skF_5'),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_46,plain,
    iext(uri_rdf_rest,'#skF_5','#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_42,plain,
    iext(uri_rdf_rest,'#skF_6',uri_rdf_nil),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_52,plain,
    iext(uri_rdf_type,uri_ex_w,'#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_72,plain,
    ! [C_21,X_22] :
      ( icext(C_21,X_22)
      | ~ iext(uri_rdf_type,X_22,C_21) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_86,plain,
    icext('#skF_3',uri_ex_w),
    inference(resolution,[status(thm)],[c_52,c_72]) ).

tff(c_142,plain,
    ! [S1_52,Z_50,X_53,C1_54,S2_51,C2_55] :
      ( icext(C1_54,X_53)
      | ~ icext(Z_50,X_53)
      | ~ iext(uri_owl_intersectionOf,Z_50,S1_52)
      | ~ iext(uri_rdf_rest,S2_51,uri_rdf_nil)
      | ~ iext(uri_rdf_first,S2_51,C2_55)
      | ~ iext(uri_rdf_rest,S1_52,S2_51)
      | ~ iext(uri_rdf_first,S1_52,C1_54) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_308,plain,
    ! [C1_104,S1_105,S2_106,C2_107] :
      ( icext(C1_104,uri_ex_w)
      | ~ iext(uri_owl_intersectionOf,'#skF_3',S1_105)
      | ~ iext(uri_rdf_rest,S2_106,uri_rdf_nil)
      | ~ iext(uri_rdf_first,S2_106,C2_107)
      | ~ iext(uri_rdf_rest,S1_105,S2_106)
      | ~ iext(uri_rdf_first,S1_105,C1_104) ),
    inference(resolution,[status(thm)],[c_86,c_142]) ).

tff(c_311,plain,
    ! [C1_104,S1_105,C2_107] :
      ( icext(C1_104,uri_ex_w)
      | ~ iext(uri_owl_intersectionOf,'#skF_3',S1_105)
      | ~ iext(uri_rdf_first,'#skF_6',C2_107)
      | ~ iext(uri_rdf_rest,S1_105,'#skF_6')
      | ~ iext(uri_rdf_first,S1_105,C1_104) ),
    inference(resolution,[status(thm)],[c_42,c_308]) ).

tff(c_312,plain,
    ! [C2_107] : ~ iext(uri_rdf_first,'#skF_6',C2_107),
    inference(splitLeft,[status(thm)],[c_311]) ).

tff(c_44,plain,
    iext(uri_rdf_first,'#skF_6','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_345,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_312,c_44]) ).

tff(c_347,plain,
    ! [C1_113,S1_114] :
      ( icext(C1_113,uri_ex_w)
      | ~ iext(uri_owl_intersectionOf,'#skF_3',S1_114)
      | ~ iext(uri_rdf_rest,S1_114,'#skF_6')
      | ~ iext(uri_rdf_first,S1_114,C1_113) ),
    inference(splitRight,[status(thm)],[c_311]) ).

tff(c_349,plain,
    ! [C1_113] :
      ( icext(C1_113,uri_ex_w)
      | ~ iext(uri_owl_intersectionOf,'#skF_3','#skF_5')
      | ~ iext(uri_rdf_first,'#skF_5',C1_113) ),
    inference(resolution,[status(thm)],[c_46,c_347]) ).

tff(c_353,plain,
    ! [C1_115] :
      ( icext(C1_115,uri_ex_w)
      | ~ iext(uri_rdf_first,'#skF_5',C1_115) ),
    inference(demodulation,[status(thm),theory(equality)],[c_50,c_349]) ).

tff(c_357,plain,
    icext(uri_ex_A,uri_ex_w),
    inference(resolution,[status(thm)],[c_48,c_353]) ).

tff(c_6,plain,
    ! [C_4,X_6,Z_3] :
      ( ~ icext(C_4,X_6)
      | ~ icext(Z_3,X_6)
      | ~ iext(uri_owl_complementOf,Z_3,C_4) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_373,plain,
    ! [Z_116] :
      ( ~ icext(Z_116,uri_ex_w)
      | ~ iext(uri_owl_complementOf,Z_116,uri_ex_A) ),
    inference(resolution,[status(thm)],[c_357,c_6]) ).

tff(c_377,plain,
    ~ icext('#skF_4',uri_ex_w),
    inference(resolution,[status(thm)],[c_40,c_373]) ).

tff(c_194,plain,
    ! [X_70,S1_69,C1_71,Z_67,S2_68,C2_72] :
      ( icext(C2_72,X_70)
      | ~ icext(Z_67,X_70)
      | ~ iext(uri_owl_intersectionOf,Z_67,S1_69)
      | ~ iext(uri_rdf_rest,S2_68,uri_rdf_nil)
      | ~ iext(uri_rdf_first,S2_68,C2_72)
      | ~ iext(uri_rdf_rest,S1_69,S2_68)
      | ~ iext(uri_rdf_first,S1_69,C1_71) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_409,plain,
    ! [C2_122,S1_123,S2_124,C1_125] :
      ( icext(C2_122,uri_ex_w)
      | ~ iext(uri_owl_intersectionOf,'#skF_3',S1_123)
      | ~ iext(uri_rdf_rest,S2_124,uri_rdf_nil)
      | ~ iext(uri_rdf_first,S2_124,C2_122)
      | ~ iext(uri_rdf_rest,S1_123,S2_124)
      | ~ iext(uri_rdf_first,S1_123,C1_125) ),
    inference(resolution,[status(thm)],[c_86,c_194]) ).

tff(c_412,plain,
    ! [C2_122,S1_123,C1_125] :
      ( icext(C2_122,uri_ex_w)
      | ~ iext(uri_owl_intersectionOf,'#skF_3',S1_123)
      | ~ iext(uri_rdf_first,'#skF_6',C2_122)
      | ~ iext(uri_rdf_rest,S1_123,'#skF_6')
      | ~ iext(uri_rdf_first,S1_123,C1_125) ),
    inference(resolution,[status(thm)],[c_42,c_409]) ).

tff(c_433,plain,
    ! [S1_131,C1_132] :
      ( ~ iext(uri_owl_intersectionOf,'#skF_3',S1_131)
      | ~ iext(uri_rdf_rest,S1_131,'#skF_6')
      | ~ iext(uri_rdf_first,S1_131,C1_132) ),
    inference(splitLeft,[status(thm)],[c_412]) ).

tff(c_435,plain,
    ! [C1_132] :
      ( ~ iext(uri_owl_intersectionOf,'#skF_3','#skF_5')
      | ~ iext(uri_rdf_first,'#skF_5',C1_132) ),
    inference(resolution,[status(thm)],[c_46,c_433]) ).

tff(c_438,plain,
    ! [C1_132] : ~ iext(uri_rdf_first,'#skF_5',C1_132),
    inference(demodulation,[status(thm),theory(equality)],[c_50,c_435]) ).

tff(c_440,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_438,c_48]) ).

tff(c_442,plain,
    ! [C2_133] :
      ( icext(C2_133,uri_ex_w)
      | ~ iext(uri_rdf_first,'#skF_6',C2_133) ),
    inference(splitRight,[status(thm)],[c_412]) ).

tff(c_445,plain,
    icext('#skF_4',uri_ex_w),
    inference(resolution,[status(thm)],[c_44,c_442]) ).

tff(c_449,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_377,c_445]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWB029+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/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.12/0.34  % Computer : n014.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Thu Aug  3 18:21:03 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 4.24/2.09  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.24/2.10  
% 4.24/2.10  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.24/2.13  
% 4.24/2.13  Inference rules
% 4.24/2.13  ----------------------
% 4.24/2.13  #Ref     : 0
% 4.24/2.13  #Sup     : 95
% 4.24/2.13  #Fact    : 0
% 4.24/2.13  #Define  : 0
% 4.24/2.13  #Split   : 12
% 4.24/2.13  #Chain   : 0
% 4.24/2.13  #Close   : 0
% 4.24/2.13  
% 4.24/2.13  Ordering : KBO
% 4.24/2.13  
% 4.24/2.13  Simplification rules
% 4.24/2.13  ----------------------
% 4.24/2.13  #Subsume      : 11
% 4.24/2.13  #Demod        : 8
% 4.24/2.13  #Tautology    : 3
% 4.24/2.13  #SimpNegUnit  : 9
% 4.24/2.13  #BackRed      : 8
% 4.24/2.13  
% 4.24/2.13  #Partial instantiations: 0
% 4.24/2.13  #Strategies tried      : 1
% 4.24/2.13  
% 4.24/2.13  Timing (in seconds)
% 4.24/2.13  ----------------------
% 4.24/2.14  Preprocessing        : 0.49
% 4.24/2.14  Parsing              : 0.26
% 4.24/2.14  CNF conversion       : 0.04
% 4.24/2.14  Main loop            : 0.51
% 4.24/2.14  Inferencing          : 0.20
% 4.24/2.14  Reduction            : 0.12
% 4.24/2.14  Demodulation         : 0.08
% 4.24/2.14  BG Simplification    : 0.03
% 4.24/2.14  Subsumption          : 0.13
% 4.24/2.14  Abstraction          : 0.02
% 4.24/2.14  MUC search           : 0.00
% 4.24/2.14  Cooper               : 0.00
% 4.24/2.14  Total                : 1.05
% 4.24/2.14  Index Insertion      : 0.00
% 4.24/2.14  Index Deletion       : 0.00
% 4.24/2.14  Index Matching       : 0.00
% 4.24/2.14  BG Taut test         : 0.00
%------------------------------------------------------------------------------