TSTP Solution File: SWB001+4 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWB001+4 : 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 : n028.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 2.69s 1.60s
% Output   : CNFRefutation 3.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   48
% Syntax   : Number of formulae    :   52 (   3 unt;  46 typ;   0 def)
%            Number of atoms       :   11 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :    8 (   3   ~;   1   |;   4   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   6   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   40 (  40 usr;  40 con; 0-0 aty)
%            Number of variables   :    0 (;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ iext > icext > lv > ir > ip > 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_someValuesFrom > uri_owl_onProperty > uri_owl_Restriction > uri_ex_r > uri_ex_p > uri_ex_d > uri_ex_c

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(uri_rdfs_Datatype,type,
    uri_rdfs_Datatype: $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(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(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_rdf_first,type,
    uri_rdf_first: $i ).

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

tff(uri_ex_c,type,
    uri_ex_c: $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(uri_rdfs_Statement,type,
    uri_rdfs_Statement: $i ).

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

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

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

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

tff(uri_owl_Restriction,type,
    uri_owl_Restriction: $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_rdfs_subClassOf,type,
    uri_rdfs_subClassOf: $i ).

tff(uri_rdf_object,type,
    uri_rdf_object: $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_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_ex_r,type,
    uri_ex_r: $i ).

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

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

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

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

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

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

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

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

tff(f_267,axiom,
    ( iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_r)
    & iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)
    & iext(uri_owl_onProperty,uri_ex_r,uri_ex_p)
    & iext(uri_owl_someValuesFrom,uri_ex_r,uri_ex_d) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_001_Subgraph_Entailment) ).

tff(f_260,negated_conjecture,
    ~ ( iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)
      & iext(uri_owl_onProperty,uri_ex_r,uri_ex_p) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_001_Subgraph_Entailment) ).

tff(c_186,plain,
    iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction),
    inference(cnfTransformation,[status(thm)],[f_267]) ).

tff(c_184,plain,
    iext(uri_owl_onProperty,uri_ex_r,uri_ex_p),
    inference(cnfTransformation,[status(thm)],[f_267]) ).

tff(c_180,plain,
    ( ~ iext(uri_owl_onProperty,uri_ex_r,uri_ex_p)
    | ~ iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction) ),
    inference(cnfTransformation,[status(thm)],[f_260]) ).

tff(c_190,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_186,c_184,c_180]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWB001+4 : TPTP v8.1.2. Released v5.2.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.13/0.34  % Computer : n028.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 18:35:54 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 2.69/1.60  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.69/1.60  
% 2.69/1.60  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.11/1.64  
% 3.11/1.64  Inference rules
% 3.11/1.64  ----------------------
% 3.11/1.64  #Ref     : 0
% 3.11/1.64  #Sup     : 0
% 3.11/1.64  #Fact    : 0
% 3.11/1.64  #Define  : 0
% 3.11/1.64  #Split   : 0
% 3.11/1.64  #Chain   : 0
% 3.11/1.64  #Close   : 0
% 3.11/1.64  
% 3.11/1.64  Ordering : KBO
% 3.11/1.64  
% 3.11/1.64  Simplification rules
% 3.11/1.64  ----------------------
% 3.11/1.64  #Subsume      : 93
% 3.11/1.64  #Demod        : 2
% 3.11/1.64  #Tautology    : 0
% 3.11/1.64  #SimpNegUnit  : 0
% 3.11/1.64  #BackRed      : 0
% 3.11/1.64  
% 3.11/1.64  #Partial instantiations: 0
% 3.11/1.64  #Strategies tried      : 1
% 3.11/1.64  
% 3.11/1.64  Timing (in seconds)
% 3.11/1.64  ----------------------
% 3.11/1.65  Preprocessing        : 0.56
% 3.11/1.65  Parsing              : 0.31
% 3.11/1.65  CNF conversion       : 0.04
% 3.11/1.65  Main loop            : 0.05
% 3.11/1.65  Inferencing          : 0.00
% 3.11/1.65  Reduction            : 0.02
% 3.11/1.65  Demodulation         : 0.02
% 3.11/1.65  BG Simplification    : 0.03
% 3.11/1.65  Subsumption          : 0.02
% 3.11/1.65  Abstraction          : 0.01
% 3.11/1.65  MUC search           : 0.00
% 3.11/1.65  Cooper               : 0.00
% 3.11/1.65  Total                : 0.67
% 3.11/1.65  Index Insertion      : 0.00
% 3.11/1.65  Index Deletion       : 0.00
% 3.11/1.65  Index Matching       : 0.00
% 3.11/1.65  BG Taut test         : 0.00
%------------------------------------------------------------------------------