TSTP Solution File: SWB002+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB002+4 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 : 600s
% DateTime : Tue Jul 19 19:18:44 EDT 2022
% Result : Theorem 0.83s 1.10s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWB002+4 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 1 12:38:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.83/1.09 ============================== Prover9 ===============================
% 0.83/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.09 Process 32290 was started by sandbox2 on n023.cluster.edu,
% 0.83/1.09 Wed Jun 1 12:38:42 2022
% 0.83/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32136_n023.cluster.edu".
% 0.83/1.09 ============================== end of head ===========================
% 0.83/1.09
% 0.83/1.09 ============================== INPUT =================================
% 0.83/1.09
% 0.83/1.09 % Reading from file /tmp/Prover9_32136_n023.cluster.edu
% 0.83/1.09
% 0.83/1.09 set(prolog_style_variables).
% 0.83/1.09 set(auto2).
% 0.83/1.09 % set(auto2) -> set(auto).
% 0.83/1.09 % set(auto) -> set(auto_inference).
% 0.83/1.09 % set(auto) -> set(auto_setup).
% 0.83/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.83/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.83/1.09 % set(auto) -> set(auto_limits).
% 0.83/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.83/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.83/1.09 % set(auto) -> set(auto_denials).
% 0.83/1.09 % set(auto) -> set(auto_process).
% 0.83/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.83/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.83/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.83/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.83/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.83/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.83/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.83/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.83/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.83/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.83/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.83/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.83/1.09 % set(auto2) -> assign(stats, some).
% 0.83/1.09 % set(auto2) -> clear(echo_input).
% 0.83/1.09 % set(auto2) -> set(quiet).
% 0.83/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.83/1.09 % set(auto2) -> clear(print_given).
% 0.83/1.09 assign(lrs_ticks,-1).
% 0.83/1.09 assign(sos_limit,10000).
% 0.83/1.09 assign(order,kbo).
% 0.83/1.09 set(lex_order_vars).
% 0.83/1.09 clear(print_given).
% 0.83/1.09
% 0.83/1.09 % formulas(sos). % not echoed (82 formulas)
% 0.83/1.09
% 0.83/1.09 ============================== end of input ==========================
% 0.83/1.09
% 0.83/1.09 % From the command line: assign(max_seconds, 300).
% 0.83/1.09
% 0.83/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.83/1.09
% 0.83/1.09 % Formulas that are not ordinary clauses:
% 0.83/1.09 1 (all S all P all O (iext(P,S,O) -> ip(P))) # label(simple_iext_property) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 2 (all X ir(X)) # label(simple_ir) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 3 (all X (lv(X) -> ir(X))) # label(simple_lv) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 4 (all P (iext(uri_rdf_type,P,uri_rdf_Property) <-> ip(P))) # label(rdf_type_ip) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 5 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 6 (all C (ic(C) -> iext(uri_rdfs_subClassOf,C,uri_rdfs_Resource))) # label(rdfs_class_instsub_resource) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 7 (all P (icext(uri_rdfs_ContainerMembershipProperty,P) -> iext(uri_rdfs_subPropertyOf,P,uri_rdfs_member))) # label(rdfs_container_containermembershipproperty_instsub_member) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 8 (all D (icext(uri_rdfs_Datatype,D) -> iext(uri_rdfs_subClassOf,D,uri_rdfs_Literal))) # label(rdfs_datatype_instsub_literal) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 9 (all P all C all X all Y (iext(uri_rdfs_domain,P,C) & iext(P,X,Y) -> icext(C,X))) # label(rdfs_domain_main) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 10 (all X (ic(X) <-> icext(uri_rdfs_Class,X))) # label(rdfs_ic_def) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 11 (all X (ir(X) <-> icext(uri_rdfs_Resource,X))) # label(rdfs_ir_def) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 12 (all X (lv(X) <-> icext(uri_rdfs_Literal,X))) # label(rdfs_lv_def) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 13 (all P all C all X all Y (iext(uri_rdfs_range,P,C) & iext(P,X,Y) -> icext(C,Y))) # label(rdfs_range_main) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 14 (all C all D (iext(uri_rdfs_subClassOf,C,D) -> ic(C) & ic(D) & (all X (icext(C,X) -> icext(D,X))))) # label(rdfs_subclassof_main) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 15 (all C (ic(C) -> iext(uri_rdfs_subClassOf,C,C))) # label(rdfs_subclassof_reflex) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 16 (all C all D all E (iext(uri_rdfs_subClassOf,C,D) & iext(uri_rdfs_subClassOf,D,E) -> iext(uri_rdfs_subClassOf,C,E))) # label(rdfs_subclassof_trans) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 17 (all P all Q (iext(uri_rdfs_subPropertyOf,P,Q) -> ip(P) & ip(Q) & (all X all Y (iext(P,X,Y) -> iext(Q,X,Y))))) # label(rdfs_subpropertyof_main) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 18 (all P (ip(P) -> iext(uri_rdfs_subPropertyOf,P,P))) # label(rdfs_subpropertyof_reflex) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 19 (all P all Q all R (iext(uri_rdfs_subPropertyOf,P,Q) & iext(uri_rdfs_subPropertyOf,Q,R) -> iext(uri_rdfs_subPropertyOf,P,R))) # label(rdfs_subpropertyof_trans) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 20 (exists BNODE_o (iext(uri_ex_p,uri_ex_s,BNODE_o) & iext(uri_ex_q,BNODE_o,uri_ex_s))) # label(testcase_premise_fullish_002_Existential_Blank_Nodes) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 21 -(exists BNODE_x exists BNODE_y (iext(uri_ex_p,BNODE_x,BNODE_y) & iext(uri_ex_q,BNODE_y,BNODE_x))) # label(testcase_conclusion_fullish_002_Existential_Blank_Nodes) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.09
% 0.83/1.09 ============================== end of process non-clausal formulas ===
% 0.83/1.09
% 0.83/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.09
% 0.83/1.09 ============================== PREDICATE ELIMINATION =================
% 0.83/1.09 22 -ir(A) | icext(uri_rdfs_Resource,A) # label(rdfs_ir_def) # label(axiom). [clausify(11)].
% 0.83/1.09 23 ir(A) # label(simple_ir) # label(axiom). [clausify(2)].
% 0.83/1.09 24 -lv(A) | ir(A) # label(simple_lv) # label(axiom). [clausify(3)].
% 0.83/1.09 Derived: icext(uri_rdfs_Resource,A). [resolve(22,a,23,a)].
% 0.83/1.09 25 ir(A) | -icext(uri_rdfs_Resource,A) # label(rdfs_ir_def) # label(axiom). [clausify(11)].
% 0.83/1.09 26 ic(A) | -icext(uri_rdfs_Class,A) # label(rdfs_ic_def) # label(axiom). [clausify(10)].
% 0.83/1.09 27 -ic(A) | icext(uri_rdfs_Class,A) # label(rdfs_ic_def) # label(axiom). [clausify(10)].
% 0.83/1.09 28 -ic(A) | iext(uri_rdfs_subClassOf,A,uri_rdfs_Resource) # label(rdfs_class_instsub_resource) # label(axiom). [clausify(6)].
% 0.83/1.09 Derived: iext(uri_rdfs_subClassOf,A,uri_rdfs_Resource) | -icext(uri_rdfs_Class,A). [resolve(28,a,26,a)].
% 0.83/1.09 29 -iext(uri_rdfs_subClassOf,A,B) | ic(A) # label(rdfs_subclassof_main) # label(axiom). [clausify(14)].
% 0.83/1.09 Derived: -iext(uri_rdfs_subClassOf,A,B) | icext(uri_rdfs_Class,A). [resolve(29,b,27,a)].
% 0.83/1.09 Derived: -iext(uri_rdfs_subClassOf,A,B) | iext(uri_rdfs_subClassOf,A,uri_rdfs_Resource). [resolve(29,b,28,a)].
% 0.83/1.09 30 -iext(uri_rdfs_subClassOf,A,B) | ic(B) # label(rdfs_subclassof_main) # label(axiom). [clausify(14)].
% 0.83/1.09 Derived: -iext(uri_rdfs_subClassOf,A,B) | icext(uri_rdfs_Class,B). [resolve(30,b,27,a)].
% 0.83/1.09 Derived: -iext(uri_rdfs_subClassOf,A,B) | iext(uri_rdfs_subClassOf,B,uri_rdfs_Resource). [resolve(30,b,28,a)].
% 0.83/1.09 31 -ic(A) | iext(uri_rdfs_subClassOf,A,A) # label(rdfs_subclassof_reflex) # label(axiom). [clausify(15)].
% 0.83/1.09 Derived: iext(uri_rdfs_subClassOf,A,A) | -icext(uri_rdfs_Class,A). [resolve(31,a,26,a)].
% 0.83/1.09 Derived: iext(uri_rdfs_subClassOf,A,A) | -iext(uri_rdfs_subClassOf,A,B). [resolve(31,a,29,b)].
% 0.83/1.09 Derived: iext(uri_rdfs_subClassOf,A,A) | -iext(uri_rdfs_subClassOf,B,A). [resolve(31,a,30,b)].
% 0.83/1.09 32 lv(A) | -icext(uri_rdfs_Literal,A) # label(rdfs_lv_def) # label(axiom). [clausify(12)].
% 0.83/1.09 33 -lv(A) | icext(uri_rdfs_Literal,A) # label(rdfs_lv_def) # label(axiom). [clausify(12)].
% 0.83/1.09 34 iext(uri_rdf_type,A,uri_rdf_Property) | -ip(A) # label(rdf_type_ip) # label(axiom). [clausify(4)].
% 0.83/1.09 35 -iext(A,B,C) | ip(A) # label(simple_iext_property) # label(axiom). [clausify(1)].
% 0.83/1.09 36 -iext(uri_rdf_type,A,uri_rdf_Property) | ip(A) # label(rdf_type_ip) # label(axiom). [clausify(4)].
% 0.83/1.09 Derived: iext(uri_rdf_type,A,uri_rdf_Property) | -iext(A,B,C). [resolve(34,b,35,b)].
% 0.83/1.09 37 -iext(uri_rdfs_subPropertyOf,A,B) | ip(A) # label(rdfs_subpropertyof_main) # label(axiom). [clausify(17)].
% 0.83/1.09 Derived: -iext(uri_rdfs_subPropertyOf,A,B) | iext(uri_rdf_type,A,uri_rdf_Property). [resolve(37,b,34,b)].
% 0.83/1.10 38 -iext(uri_rdfs_subPropertyOf,A,B) | ip(B) # label(rdfs_subpropertyof_main) # label(axiom). [clausify(17)].
% 0.83/1.10 Derived: -iext(uri_rdfs_subPropertyOf,A,B) | iext(uri_rdf_type,B,uri_rdf_Property). [resolve(38,b,34,b)].
% 0.83/1.10 39 -ip(A) | iext(uri_rdfs_subPropertyOf,A,A) # label(rdfs_subpropertyof_reflex) # label(axiom). [clausify(18)].
% 0.83/1.10 Derived: iext(uri_rdfs_subPropertyOf,A,A) | -iext(A,B,C). [resolve(39,a,35,b)].
% 0.83/1.10 Derived: iext(uri_rdfs_subPropertyOf,A,A) | -iext(uri_rdf_type,A,uri_rdf_Property). [resolve(39,a,36,b)].
% 0.83/1.10 Derived: iext(uri_rdfs_subPropertyOf,A,A) | -iext(uri_rdfs_subPropertyOf,A,B). [resolve(39,a,37,b)].
% 0.83/1.10 Derived: iext(uri_rdfs_subPropertyOf,A,A) | -iext(uri_rdfs_subPropertyOf,B,A). [resolve(39,a,38,b)].
% 0.83/1.10
% 0.83/1.10 ============================== end predicate elimination =============
% 0.83/1.10
% 0.83/1.10 Auto_denials:
% 0.83/1.10 % copying label testcase_conclusion_fullish_002_Existential_Blank_Nodes to answer in negative clause
% 0.83/1.10
% 0.83/1.10 Term ordering decisions:
% 0.83/1.10 Function symbol KB weights: uri_rdf_type=1. uri_rdfs_Resource=1. uri_rdfs_subClassOf=1. uri_rdfs_domain=1. uri_rdfs_range=1. uri_rdf_Property=1. uri_rdfs_subPropertyOf=1. uri_rdfs_Class=1. uri_rdfs_ContainerMembershipProperty=1. uri_rdf_List=1. uri_rdf__1=1. uri_rdf__2=1. uri_rdf__3=1. uri_rdfs_Literal=1. uri_rdf_first=1. uri_rdf_predicate=1. uri_rdf_rest=1. uri_rdf_subject=1. uri_rdf_value=1. uri_rdfs_Container=1. uri_rdfs_Datatype=1. uri_rdfs_Statement=1. uri_rdfs_isDefinedBy=1. uri_rdfs_member=1. uri_rdfs_seeAlso=1. uri_ex_s=1. uri_rdf_XMLLiteral=1. uri_rdf_object=1. uri_rdfs_comment=1. uri_rdfs_label=1. uri_ex_p=1. uri_ex_q=1. uri_rdf_Alt=1. uri_rdf_Bag=1. uri_rdf_nil=1. uri_rdfs_Seq=1. c1=1.
% 0.83/1.10
% 0.83/1.10 ============================== end of process initial clauses ========
% 0.83/1.10
% 0.83/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.10
% 0.83/1.10 ============================== end of clauses for search =============
% 0.83/1.10
% 0.83/1.10 ============================== SEARCH ================================
% 0.83/1.10
% 0.83/1.10 % Starting search at 0.02 seconds.
% 0.83/1.10
% 0.83/1.10 ============================== PROOF =================================
% 0.83/1.10 % SZS status Theorem
% 0.83/1.10 % SZS output start Refutation
% 0.83/1.10
% 0.83/1.10 % Proof 1 at 0.02 (+ 0.00) seconds: testcase_conclusion_fullish_002_Existential_Blank_Nodes.
% 0.83/1.10 % Length of proof is 6.
% 0.83/1.10 % Level of proof is 2.
% 0.83/1.10 % Maximum clause weight is 8.000.
% 0.83/1.10 % Given clauses 62.
% 0.83/1.10
% 0.83/1.10 20 (exists BNODE_o (iext(uri_ex_p,uri_ex_s,BNODE_o) & iext(uri_ex_q,BNODE_o,uri_ex_s))) # label(testcase_premise_fullish_002_Existential_Blank_Nodes) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.10 21 -(exists BNODE_x exists BNODE_y (iext(uri_ex_p,BNODE_x,BNODE_y) & iext(uri_ex_q,BNODE_y,BNODE_x))) # label(testcase_conclusion_fullish_002_Existential_Blank_Nodes) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.10 99 iext(uri_ex_p,uri_ex_s,c1) # label(testcase_premise_fullish_002_Existential_Blank_Nodes) # label(axiom). [clausify(20)].
% 0.83/1.10 100 iext(uri_ex_q,c1,uri_ex_s) # label(testcase_premise_fullish_002_Existential_Blank_Nodes) # label(axiom). [clausify(20)].
% 0.83/1.10 101 -iext(uri_ex_p,A,B) | -iext(uri_ex_q,B,A) # label(testcase_conclusion_fullish_002_Existential_Blank_Nodes) # label(negated_conjecture) # answer(testcase_conclusion_fullish_002_Existential_Blank_Nodes). [clausify(21)].
% 0.83/1.10 128 $F # answer(testcase_conclusion_fullish_002_Existential_Blank_Nodes). [resolve(101,a,99,a),unit_del(a,100)].
% 0.83/1.10
% 0.83/1.10 % SZS output end Refutation
% 0.83/1.10 ============================== end of proof ==========================
% 0.83/1.10
% 0.83/1.10 ============================== STATISTICS ============================
% 0.83/1.10
% 0.83/1.10 Given=62. Generated=91. Kept=88. proofs=1.
% 0.83/1.10 Usable=62. Sos=26. Demods=0. Limbo=0, Disabled=108. Hints=0.
% 0.83/1.10 Megabytes=0.14.
% 0.83/1.10 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.83/1.10
% 0.83/1.10 ============================== end of statistics =====================
% 0.83/1.10
% 0.83/1.10 ============================== end of search =========================
% 0.83/1.10
% 0.83/1.10 THEOREM PROVED
% 0.83/1.10 % SZS status Theorem
% 0.83/1.10
% 0.83/1.10 Exiting with 1 proof.
% 0.83/1.10
% 0.83/1.10 Process 32290 exit (max_proofs) Wed Jun 1 12:38:42 2022
% 0.83/1.10 Prover9 interrupted
%------------------------------------------------------------------------------