TSTP Solution File: SWB003+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWB003+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/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 : 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 11:00:13 EDT 2023
% Result : Theorem 3.32s 1.78s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 45
% Syntax : Number of formulae : 48 ( 5 unt; 43 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 7 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 37 ( 37 usr; 36 con; 0-1 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > icext > lv > ir > ip > ic > #nlpp > literal_plain > 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_ex_s > uri_ex_p > dat_str_foo
%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_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_ex_s,type,
uri_ex_s: $i ).
tff(uri_rdf_first,type,
uri_rdf_first: $i ).
tff(uri_rdf_predicate,type,
uri_rdf_predicate: $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(dat_str_foo,type,
dat_str_foo: $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_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_rdfs_comment,type,
uri_rdfs_comment: $i ).
tff(uri_rdfs_Literal,type,
uri_rdfs_Literal: $i ).
tff(uri_rdf_Alt,type,
uri_rdf_Alt: $i ).
tff(uri_rdf_nil,type,
uri_rdf_nil: $i ).
tff(literal_plain,type,
literal_plain: $i > $i ).
tff(uri_rdfs_isDefinedBy,type,
uri_rdfs_isDefinedBy: $i ).
tff(uri_rdfs_domain,type,
uri_rdfs_domain: $i ).
tff(f_259,negated_conjecture,
~ ? [BNODE_x] : iext(uri_ex_p,uri_ex_s,BNODE_x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
tff(f_260,axiom,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
tff(c_180,plain,
! [BNODE_x_41] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x_41),
inference(cnfTransformation,[status(thm)],[f_259]) ).
tff(c_182,plain,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
inference(cnfTransformation,[status(thm)],[f_260]) ).
tff(c_183,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_180,c_182]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWB003+4 : TPTP v8.1.2. Released v5.2.0.
% 0.13/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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:20:52 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.32/1.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.32/1.79
% 3.32/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.47/1.83
% 3.47/1.83 Inference rules
% 3.47/1.83 ----------------------
% 3.47/1.83 #Ref : 0
% 3.47/1.83 #Sup : 0
% 3.47/1.83 #Fact : 0
% 3.47/1.83 #Define : 0
% 3.47/1.83 #Split : 0
% 3.47/1.83 #Chain : 0
% 3.47/1.83 #Close : 0
% 3.47/1.83
% 3.47/1.83 Ordering : KBO
% 3.47/1.83
% 3.47/1.83 Simplification rules
% 3.47/1.83 ----------------------
% 3.47/1.83 #Subsume : 90
% 3.47/1.83 #Demod : 0
% 3.47/1.83 #Tautology : 0
% 3.47/1.83 #SimpNegUnit : 1
% 3.47/1.83 #BackRed : 0
% 3.47/1.83
% 3.47/1.83 #Partial instantiations: 0
% 3.47/1.83 #Strategies tried : 1
% 3.47/1.83
% 3.47/1.83 Timing (in seconds)
% 3.47/1.83 ----------------------
% 3.47/1.83 Preprocessing : 0.57
% 3.47/1.83 Parsing : 0.32
% 3.47/1.83 CNF conversion : 0.04
% 3.47/1.83 Main loop : 0.06
% 3.47/1.83 Inferencing : 0.00
% 3.47/1.83 Reduction : 0.03
% 3.47/1.83 Demodulation : 0.02
% 3.47/1.83 BG Simplification : 0.03
% 3.47/1.83 Subsumption : 0.03
% 3.47/1.83 Abstraction : 0.01
% 3.47/1.83 MUC search : 0.00
% 3.47/1.83 Cooper : 0.00
% 3.47/1.83 Total : 0.69
% 3.47/1.83 Index Insertion : 0.00
% 3.47/1.83 Index Deletion : 0.00
% 3.47/1.83 Index Matching : 0.00
% 3.47/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------