TSTP Solution File: SWB002+3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWB002+3 : 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/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 : n005.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:12 EDT 2023

% Result   : Theorem 6.11s 2.43s
% Output   : CNFRefutation 6.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   89
% Syntax   : Number of formulae    :   94 (   4 unt;  87 typ;   0 def)
%            Number of atoms       :   10 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   4   ~;   1   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   99 (  35   >;  64   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-3 aty)
%            Number of functors    :   76 (  76 usr;  52 con; 0-7 aty)
%            Number of variables   :    5 (;   2   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ iext > icext > lv > ix > ir > ip > ioxp > iodp > ioap > idc > ic > #nlpp > uri_rdfs_subPropertyOf > uri_rdfs_subClassOf > uri_rdfs_seeAlso > uri_rdfs_range > uri_rdfs_member > uri_rdfs_label > uri_rdfs_isDefinedBy > uri_rdfs_domain > uri_rdfs_comment > uri_rdfs_Statement > uri_rdfs_Seq > uri_rdfs_Resource > uri_rdfs_Literal > uri_rdfs_Datatype > uri_rdfs_ContainerMembershipProperty > uri_rdfs_Container > uri_rdfs_Class > uri_rdf_value > uri_rdf_type > uri_rdf_subject > uri_rdf_rest > uri_rdf_predicate > uri_rdf_object > uri_rdf_nil > uri_rdf_first > uri_rdf__3 > uri_rdf__2 > uri_rdf__1 > uri_rdf_XMLLiteral > uri_rdf_Property > uri_rdf_List > uri_rdf_Bag > uri_rdf_Alt > uri_owl_unionOf > uri_owl_someValuesFrom > uri_owl_onProperty > uri_owl_intersectionOf > uri_owl_hasValue > uri_owl_complementOf > uri_owl_allValuesFrom > uri_owl_Thing > uri_owl_Restriction > uri_owl_OntologyProperty > uri_owl_Ontology > uri_owl_Nothing > uri_owl_DatatypeProperty > uri_owl_AnnotationProperty > uri_ex_s > uri_ex_q > uri_ex_p > #skF_9 > #skF_22 > #skF_2 > #skF_24 > #skF_1 > #skF_17 > #skF_20 > #skF_6 > #skF_4 > #skF_5 > #skF_16 > #skF_26 > #skF_18 > #skF_25 > #skF_19 > #skF_11 > #skF_15 > #skF_23 > #skF_3 > #skF_14 > #skF_13 > #skF_7 > #skF_8 > #skF_21 > #skF_12 > #skF_10

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_741,axiom,
    ? [BNODE_o] :
      ( iext(uri_ex_p,uri_ex_s,BNODE_o)
      & iext(uri_ex_q,BNODE_o,uri_ex_s) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).

tff(f_737,negated_conjecture,
    ~ ? [BNODE_x,BNODE_y] :
        ( iext(uri_ex_p,BNODE_x,BNODE_y)
        & iext(uri_ex_q,BNODE_y,BNODE_x) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).

tff(c_536,plain,
    iext(uri_ex_q,'#skF_26',uri_ex_s),
    inference(cnfTransformation,[status(thm)],[f_741]) ).

tff(c_534,plain,
    ! [BNODE_y_219,BNODE_x_218] :
      ( ~ iext(uri_ex_q,BNODE_y_219,BNODE_x_218)
      | ~ iext(uri_ex_p,BNODE_x_218,BNODE_y_219) ),
    inference(cnfTransformation,[status(thm)],[f_737]) ).

tff(c_580,plain,
    ~ iext(uri_ex_p,uri_ex_s,'#skF_26'),
    inference(resolution,[status(thm)],[c_536,c_534]) ).

tff(c_538,plain,
    iext(uri_ex_p,uri_ex_s,'#skF_26'),
    inference(cnfTransformation,[status(thm)],[f_741]) ).

tff(c_586,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_580,c_538]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SWB002+3 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.15  % 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.15/0.37  % Computer : n005.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 18:20:57 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 6.11/2.43  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.17/2.44  
% 6.17/2.44  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.17/2.46  
% 6.17/2.46  Inference rules
% 6.17/2.46  ----------------------
% 6.17/2.46  #Ref     : 0
% 6.17/2.46  #Sup     : 1
% 6.17/2.46  #Fact    : 0
% 6.17/2.46  #Define  : 0
% 6.17/2.46  #Split   : 0
% 6.17/2.46  #Chain   : 0
% 6.17/2.46  #Close   : 0
% 6.17/2.46  
% 6.17/2.46  Ordering : KBO
% 6.17/2.46  
% 6.17/2.46  Simplification rules
% 6.17/2.46  ----------------------
% 6.17/2.46  #Subsume      : 21
% 6.17/2.46  #Demod        : 28
% 6.17/2.46  #Tautology    : 21
% 6.17/2.46  #SimpNegUnit  : 1
% 6.17/2.46  #BackRed      : 0
% 6.17/2.46  
% 6.17/2.46  #Partial instantiations: 0
% 6.17/2.46  #Strategies tried      : 1
% 6.17/2.46  
% 6.17/2.46  Timing (in seconds)
% 6.17/2.46  ----------------------
% 6.17/2.47  Preprocessing        : 0.82
% 6.17/2.47  Parsing              : 0.42
% 6.17/2.47  CNF conversion       : 0.08
% 6.17/2.47  Main loop            : 0.56
% 6.17/2.47  Inferencing          : 0.11
% 6.17/2.47  Reduction            : 0.22
% 6.17/2.47  Demodulation         : 0.15
% 6.17/2.47  BG Simplification    : 0.08
% 6.17/2.47  Subsumption          : 0.15
% 6.17/2.47  Abstraction          : 0.02
% 6.17/2.47  MUC search           : 0.00
% 6.17/2.47  Cooper               : 0.00
% 6.17/2.47  Total                : 1.43
% 6.17/2.47  Index Insertion      : 0.00
% 6.17/2.47  Index Deletion       : 0.00
% 6.17/2.47  Index Matching       : 0.00
% 6.17/2.47  BG Taut test         : 0.00
%------------------------------------------------------------------------------