TSTP Solution File: SWB022+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB022+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:52 EDT 2022
% Result : Theorem 1.53s 1.83s
% Output : Refutation 1.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWB022+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 1 11:33:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/0.99 ============================== Prover9 ===============================
% 0.68/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.99 Process 21848 was started by sandbox on n026.cluster.edu,
% 0.68/0.99 Wed Jun 1 11:33:27 2022
% 0.68/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21685_n026.cluster.edu".
% 0.68/0.99 ============================== end of head ===========================
% 0.68/0.99
% 0.68/0.99 ============================== INPUT =================================
% 0.68/0.99
% 0.68/0.99 % Reading from file /tmp/Prover9_21685_n026.cluster.edu
% 0.68/0.99
% 0.68/0.99 set(prolog_style_variables).
% 0.68/0.99 set(auto2).
% 0.68/0.99 % set(auto2) -> set(auto).
% 0.68/0.99 % set(auto) -> set(auto_inference).
% 0.68/0.99 % set(auto) -> set(auto_setup).
% 0.68/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.99 % set(auto) -> set(auto_limits).
% 0.68/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.99 % set(auto) -> set(auto_denials).
% 0.68/0.99 % set(auto) -> set(auto_process).
% 0.68/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.99 % set(auto2) -> assign(stats, some).
% 0.68/0.99 % set(auto2) -> clear(echo_input).
% 0.68/0.99 % set(auto2) -> set(quiet).
% 0.68/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.99 % set(auto2) -> clear(print_given).
% 0.68/0.99 assign(lrs_ticks,-1).
% 0.68/0.99 assign(sos_limit,10000).
% 0.68/0.99 assign(order,kbo).
% 0.68/0.99 set(lex_order_vars).
% 0.68/0.99 clear(print_given).
% 0.68/0.99
% 0.68/0.99 % formulas(sos). % not echoed (4 formulas)
% 0.68/0.99
% 0.68/0.99 ============================== end of input ==========================
% 0.68/0.99
% 0.68/0.99 % From the command line: assign(max_seconds, 300).
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.99
% 0.68/0.99 % Formulas that are not ordinary clauses:
% 0.68/0.99 1 (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.68/0.99 2 (all P all S1 all P1 all S2 all P2 (iext(uri_rdf_first,S1,P1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,P2) & iext(uri_rdf_rest,S2,uri_rdf_nil) -> (iext(uri_owl_propertyChainAxiom,P,S1) <-> ip(P) & ip(P1) & ip(P2) & (all Y0 all Y1 all Y2 (iext(P1,Y0,Y1) & iext(P2,Y1,Y2) -> iext(P,Y0,Y2)))))) # label(owl_chain_002) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 3 (exists BNODE_pL exists BNODE_l11 exists BNODE_l12 exists BNODE_l21 exists BNODE_l22 exists BNODE_l31 exists BNODE_l32 exists BNODE_l33 (iext(uri_rdfs_subPropertyOf,uri_skos_memberList,BNODE_pL) & iext(uri_owl_propertyChainAxiom,uri_skos_member,BNODE_l11) & iext(uri_rdf_first,BNODE_l11,BNODE_pL) & iext(uri_rdf_rest,BNODE_l11,BNODE_l12) & iext(uri_rdf_first,BNODE_l12,uri_rdf_first) & iext(uri_rdf_rest,BNODE_l12,uri_rdf_nil) & iext(uri_owl_propertyChainAxiom,BNODE_pL,BNODE_l21) & iext(uri_rdf_first,BNODE_l21,BNODE_pL) & iext(uri_rdf_rest,BNODE_l21,BNODE_l22) & iext(uri_rdf_first,BNODE_l22,uri_rdf_rest) & iext(uri_rdf_rest,BNODE_l22,uri_rdf_nil) & iext(uri_rdf_type,uri_ex_MyOrderedCollection,uri_skos_OrderedCollection) & iext(uri_skos_memberList,uri_ex_MyOrderedCollection,BNODE_l31) & iext(uri_rdf_first,BNODE_l31,uri_ex_X) & iext(uri_rdf_rest,BNODE_l31,BNODE_l32) & iext(uri_rdf_first,BNODE_l32,uri_ex_Y) & iext(uri_rdf_rest,BNODE_l32,BNODE_l33) & iext(uri_rdf_first,BNODE_l33,uri_ex_Z) & iext(uri_rdf_rest,BNODE_l33,uri_rdf_nil))) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 4 -(iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_X) & iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Y) & iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Z)) # label(testcase_conclusion_fullish_022_List_Member_Access) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.53/1.83
% 1.53/1.83 ============================== end of process non-clausal formulas ===
% 1.53/1.83
% 1.53/1.83 ============================== PROCESS INITIAL CLAUSES ===============
% 1.53/1.83
% 1.53/1.83 ============================== PREDICATE ELIMINATION =================
% 1.53/1.83
% 1.53/1.83 ============================== end predicate elimination =============
% 1.53/1.83
% 1.53/1.83 Auto_denials: (non-Horn, no changes).
% 1.53/1.83
% 1.53/1.83 Term ordering decisions:
% 1.53/1.83 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_rdf_nil=1. uri_owl_propertyChainAxiom=1. uri_rdfs_subPropertyOf=1. uri_ex_MyOrderedCollection=1. uri_skos_memberList=1. uri_ex_X=1. uri_ex_Y=1. uri_ex_Z=1. uri_rdf_type=1. uri_skos_OrderedCollection=1. uri_skos_member=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. f1=1. f2=1. f3=1.
% 1.53/1.83
% 1.53/1.83 ============================== end of process initial clauses ========
% 1.53/1.83
% 1.53/1.83 ============================== CLAUSES FOR SEARCH ====================
% 1.53/1.83
% 1.53/1.83 ============================== end of clauses for search =============
% 1.53/1.83
% 1.53/1.83 ============================== SEARCH ================================
% 1.53/1.83
% 1.53/1.83 % Starting search at 0.03 seconds.
% 1.53/1.83
% 1.53/1.83 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 23 (0.00 of 0.65 sec).
% 1.53/1.83
% 1.53/1.83 ============================== PROOF =================================
% 1.53/1.83 % SZS status Theorem
% 1.53/1.83 % SZS output start Refutation
% 1.53/1.83
% 1.53/1.83 % Proof 1 at 0.84 (+ 0.01) seconds.
% 1.53/1.83 % Length of proof is 44.
% 1.53/1.83 % Level of proof is 12.
% 1.53/1.83 % Maximum clause weight is 32.000.
% 1.53/1.83 % Given clauses 588.
% 1.53/1.83
% 1.53/1.83 1 (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].
% 1.53/1.83 2 (all P all S1 all P1 all S2 all P2 (iext(uri_rdf_first,S1,P1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,P2) & iext(uri_rdf_rest,S2,uri_rdf_nil) -> (iext(uri_owl_propertyChainAxiom,P,S1) <-> ip(P) & ip(P1) & ip(P2) & (all Y0 all Y1 all Y2 (iext(P1,Y0,Y1) & iext(P2,Y1,Y2) -> iext(P,Y0,Y2)))))) # label(owl_chain_002) # label(axiom) # label(non_clause). [assumption].
% 1.53/1.83 3 (exists BNODE_pL exists BNODE_l11 exists BNODE_l12 exists BNODE_l21 exists BNODE_l22 exists BNODE_l31 exists BNODE_l32 exists BNODE_l33 (iext(uri_rdfs_subPropertyOf,uri_skos_memberList,BNODE_pL) & iext(uri_owl_propertyChainAxiom,uri_skos_member,BNODE_l11) & iext(uri_rdf_first,BNODE_l11,BNODE_pL) & iext(uri_rdf_rest,BNODE_l11,BNODE_l12) & iext(uri_rdf_first,BNODE_l12,uri_rdf_first) & iext(uri_rdf_rest,BNODE_l12,uri_rdf_nil) & iext(uri_owl_propertyChainAxiom,BNODE_pL,BNODE_l21) & iext(uri_rdf_first,BNODE_l21,BNODE_pL) & iext(uri_rdf_rest,BNODE_l21,BNODE_l22) & iext(uri_rdf_first,BNODE_l22,uri_rdf_rest) & iext(uri_rdf_rest,BNODE_l22,uri_rdf_nil) & iext(uri_rdf_type,uri_ex_MyOrderedCollection,uri_skos_OrderedCollection) & iext(uri_skos_memberList,uri_ex_MyOrderedCollection,BNODE_l31) & iext(uri_rdf_first,BNODE_l31,uri_ex_X) & iext(uri_rdf_rest,BNODE_l31,BNODE_l32) & iext(uri_rdf_first,BNODE_l32,uri_ex_Y) & iext(uri_rdf_rest,BNODE_l32,BNODE_l33) & iext(uri_rdf_first,BNODE_l33,uri_ex_Z) & iext(uri_rdf_rest,BNODE_l33,uri_rdf_nil))) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom) # label(non_clause). [assumption].
% 1.53/1.83 4 -(iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_X) & iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Y) & iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Z)) # label(testcase_conclusion_fullish_022_List_Member_Access) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.53/1.83 5 iext(uri_rdfs_subPropertyOf,uri_skos_memberList,c1) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 6 iext(uri_owl_propertyChainAxiom,uri_skos_member,c2) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 7 iext(uri_rdf_first,c2,c1) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 8 iext(uri_rdf_rest,c2,c3) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 9 iext(uri_rdf_first,c3,uri_rdf_first) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 10 iext(uri_rdf_rest,c3,uri_rdf_nil) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 11 iext(uri_owl_propertyChainAxiom,c1,c4) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 12 iext(uri_rdf_first,c4,c1) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 13 iext(uri_rdf_rest,c4,c5) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 14 iext(uri_rdf_first,c5,uri_rdf_rest) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 15 iext(uri_rdf_rest,c5,uri_rdf_nil) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 17 iext(uri_skos_memberList,uri_ex_MyOrderedCollection,c6) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 18 iext(uri_rdf_first,c6,uri_ex_X) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 19 iext(uri_rdf_rest,c6,c7) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 20 iext(uri_rdf_first,c7,uri_ex_Y) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 21 iext(uri_rdf_rest,c7,c8) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 22 iext(uri_rdf_first,c8,uri_ex_Z) # label(testcase_premise_fullish_022_List_Member_Access) # label(axiom). [clausify(3)].
% 1.53/1.83 24 -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_X) | -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Y) | -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Z) # label(testcase_conclusion_fullish_022_List_Member_Access) # label(negated_conjecture). [clausify(4)].
% 1.53/1.83 27 -iext(uri_rdfs_subPropertyOf,A,B) | -iext(A,C,D) | iext(B,C,D) # label(rdfs_subpropertyof_main) # label(axiom). [clausify(1)].
% 1.53/1.83 31 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_first,C,D) | -iext(uri_rdf_rest,C,uri_rdf_nil) | -iext(uri_owl_propertyChainAxiom,E,A) | -iext(B,F,V6) | -iext(D,V6,V7) | iext(E,F,V7) # label(owl_chain_002) # label(axiom). [clausify(2)].
% 1.53/1.83 152 -iext(uri_skos_memberList,A,B) | iext(c1,A,B). [resolve(27,a,5,a)].
% 1.53/1.83 246 -iext(uri_rdf_rest,c4,A) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_owl_propertyChainAxiom,C,c4) | -iext(c1,D,E) | -iext(B,E,F) | iext(C,D,F). [resolve(31,a,12,a)].
% 1.53/1.83 248 -iext(uri_rdf_rest,c2,A) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_owl_propertyChainAxiom,C,c2) | -iext(c1,D,E) | -iext(B,E,F) | iext(C,D,F). [resolve(31,a,7,a)].
% 1.53/1.83 1339 iext(c1,uri_ex_MyOrderedCollection,c6). [resolve(152,a,17,a)].
% 1.53/1.83 1789 -iext(uri_owl_propertyChainAxiom,A,c4) | -iext(c1,B,C) | -iext(uri_rdf_rest,C,D) | iext(A,B,D). [resolve(246,b,14,a),unit_del(a,13),unit_del(b,15)].
% 1.53/1.83 1914 -iext(uri_owl_propertyChainAxiom,A,c2) | -iext(c1,B,C) | -iext(uri_rdf_first,C,D) | iext(A,B,D). [resolve(248,b,9,a),unit_del(a,8),unit_del(b,10)].
% 1.53/1.83 3305 -iext(c1,A,B) | -iext(uri_rdf_rest,B,C) | iext(c1,A,C). [resolve(1789,a,11,a)].
% 1.53/1.83 3312 -iext(uri_rdf_rest,c6,A) | iext(c1,uri_ex_MyOrderedCollection,A). [resolve(3305,a,1339,a)].
% 1.53/1.83 3314 -iext(c1,A,c7) | iext(c1,A,c8). [resolve(3305,b,21,a)].
% 1.53/1.83 3322 iext(c1,uri_ex_MyOrderedCollection,c7). [resolve(3312,a,19,a)].
% 1.53/1.83 3426 iext(c1,uri_ex_MyOrderedCollection,c8). [resolve(3314,a,3322,a)].
% 1.53/1.83 3669 -iext(c1,A,B) | -iext(uri_rdf_first,B,C) | iext(uri_skos_member,A,C). [resolve(1914,a,6,a)].
% 1.53/1.83 3682 -iext(uri_rdf_first,c8,A) | iext(uri_skos_member,uri_ex_MyOrderedCollection,A). [resolve(3669,a,3426,a)].
% 1.53/1.83 3683 -iext(uri_rdf_first,c7,A) | iext(uri_skos_member,uri_ex_MyOrderedCollection,A). [resolve(3669,a,3322,a)].
% 1.53/1.83 3684 -iext(uri_rdf_first,c6,A) | iext(uri_skos_member,uri_ex_MyOrderedCollection,A). [resolve(3669,a,1339,a)].
% 1.53/1.83 3690 iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Z). [resolve(3682,a,22,a)].
% 1.53/1.83 3691 -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_X) | -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Y). [back_unit_del(24),unit_del(c,3690)].
% 1.53/1.83 3782 iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Y). [resolve(3683,a,20,a)].
% 1.53/1.83 3783 -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_X). [back_unit_del(3691),unit_del(b,3782)].
% 1.53/1.83 3874 $F. [resolve(3684,a,18,a),unit_del(a,3783)].
% 1.53/1.83
% 1.53/1.83 % SZS output end Refutation
% 1.53/1.83 ============================== end of proof ==========================
% 1.53/1.83
% 1.53/1.83 ============================== STATISTICS ============================
% 1.53/1.83
% 1.53/1.83 Given=588. Generated=6813. Kept=3869. proofs=1.
% 1.53/1.83 Usable=550. Sos=3128. Demods=0. Limbo=0, Disabled=221. Hints=0.
% 1.53/1.83 Megabytes=5.27.
% 1.53/1.83 User_CPU=0.84, System_CPU=0.01, Wall_clock=1.
% 1.53/1.83
% 1.53/1.83 ============================== end of statistics =====================
% 1.53/1.83
% 1.53/1.83 ============================== end of search =========================
% 1.53/1.83
% 1.53/1.83 THEOREM PROVED
% 1.53/1.83 % SZS status Theorem
% 1.53/1.83
% 1.53/1.83 Exiting with 1 proof.
% 1.53/1.83
% 1.53/1.83 Process 21848 exit (max_proofs) Wed Jun 1 11:33:28 2022
% 1.53/1.83 Prover9 interrupted
%------------------------------------------------------------------------------