TSTP Solution File: SWB027+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB027+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %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 : 600s
% DateTime : Tue Jul 19 19:18:54 EDT 2022
% Result : Theorem 0.86s 1.17s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWB027+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.31 % Computer : n028.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Wed Jun 1 13:50:37 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.40/1.01 ============================== Prover9 ===============================
% 0.40/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.40/1.01 Process 8589 was started by sandbox on n028.cluster.edu,
% 0.40/1.01 Wed Jun 1 13:50:38 2022
% 0.40/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8436_n028.cluster.edu".
% 0.40/1.01 ============================== end of head ===========================
% 0.40/1.01
% 0.40/1.01 ============================== INPUT =================================
% 0.40/1.01
% 0.40/1.01 % Reading from file /tmp/Prover9_8436_n028.cluster.edu
% 0.40/1.01
% 0.40/1.01 set(prolog_style_variables).
% 0.40/1.01 set(auto2).
% 0.40/1.01 % set(auto2) -> set(auto).
% 0.40/1.01 % set(auto) -> set(auto_inference).
% 0.40/1.01 % set(auto) -> set(auto_setup).
% 0.40/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.40/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/1.01 % set(auto) -> set(auto_limits).
% 0.40/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/1.01 % set(auto) -> set(auto_denials).
% 0.40/1.01 % set(auto) -> set(auto_process).
% 0.40/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.40/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.40/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.40/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.40/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.40/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.40/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.40/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.40/1.01 % set(auto2) -> assign(stats, some).
% 0.40/1.01 % set(auto2) -> clear(echo_input).
% 0.40/1.01 % set(auto2) -> set(quiet).
% 0.40/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.40/1.01 % set(auto2) -> clear(print_given).
% 0.40/1.01 assign(lrs_ticks,-1).
% 0.40/1.01 assign(sos_limit,10000).
% 0.40/1.01 assign(order,kbo).
% 0.40/1.01 set(lex_order_vars).
% 0.40/1.01 clear(print_given).
% 0.40/1.01
% 0.40/1.01 % formulas(sos). % not echoed (7 formulas)
% 0.40/1.01
% 0.40/1.01 ============================== end of input ==========================
% 0.40/1.01
% 0.40/1.01 % From the command line: assign(max_seconds, 300).
% 0.40/1.01
% 0.40/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/1.01
% 0.40/1.01 % Formulas that are not ordinary clauses:
% 0.40/1.01 1 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 2 (all X all Y (iext(uri_owl_sameAs,X,Y) <-> X = Y)) # label(owl_eqdis_sameas) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 3 (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.40/1.01 4 (all P (icext(uri_owl_InverseFunctionalProperty,P) <-> ip(P) & (all X1 all X2 all Y (iext(P,X1,Y) & iext(P,X2,Y) -> X1 = X2)))) # label(owl_char_inversefunctional) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 5 (all P1 all P2 (iext(uri_owl_inverseOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) <-> iext(P2,Y,X))))) # label(owl_inv) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 6 (exists BNODE_l1 exists BNODE_l2 exists BNODE_v (iext(uri_owl_propertyChainAxiom,uri_owl_sameAs,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_ex_p) & iext(uri_rdf_rest,BNODE_l1,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,BNODE_v) & iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil) & iext(uri_owl_inverseOf,BNODE_v,uri_ex_p))) # label(testcase_premise_fullish_027_Inferred_Property_Characteristics_II) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01
% 0.40/1.01 ============================== end of process non-clausal formulas ===
% 0.40/1.01
% 0.40/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.40/1.01
% 0.40/1.01 ============================== PREDICATE ELIMINATION =================
% 0.40/1.01
% 0.40/1.01 ============================== end predicate elimination =============
% 0.40/1.01
% 0.40/1.01 Auto_denials: (non-Horn, no changes).
% 0.40/1.01
% 0.40/1.01 Term ordering decisions:
% 0.40/1.01 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_owl_propertyChainAxiom=1. uri_rdf_nil=1. uri_owl_inverseOf=1. uri_owl_InverseFunctionalProperty=1. uri_owl_sameAs=1. uri_ex_p=1. uri_rdf_type=1. c1=1. c2=1. c3=1. f7=1. f8=1. f4=1. f5=1. f6=1. f1=1. f2=1. f3=1.
% 0.86/1.17
% 0.86/1.17 ============================== end of process initial clauses ========
% 0.86/1.17
% 0.86/1.17 ============================== CLAUSES FOR SEARCH ====================
% 0.86/1.17
% 0.86/1.17 ============================== end of clauses for search =============
% 0.86/1.17
% 0.86/1.17 ============================== SEARCH ================================
% 0.86/1.17
% 0.86/1.17 % Starting search at 0.03 seconds.
% 0.86/1.17
% 0.86/1.17 ============================== PROOF =================================
% 0.86/1.17 % SZS status Theorem
% 0.86/1.17 % SZS output start Refutation
% 0.86/1.17
% 0.86/1.17 % Proof 1 at 0.18 (+ 0.00) seconds.
% 0.86/1.17 % Length of proof is 29.
% 0.86/1.17 % Level of proof is 6.
% 0.86/1.17 % Maximum clause weight is 32.000.
% 0.86/1.17 % Given clauses 156.
% 0.86/1.17
% 0.86/1.17 1 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 2 (all X all Y (iext(uri_owl_sameAs,X,Y) <-> X = Y)) # label(owl_eqdis_sameas) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 3 (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.86/1.17 4 (all P (icext(uri_owl_InverseFunctionalProperty,P) <-> ip(P) & (all X1 all X2 all Y (iext(P,X1,Y) & iext(P,X2,Y) -> X1 = X2)))) # label(owl_char_inversefunctional) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 5 (all P1 all P2 (iext(uri_owl_inverseOf,P1,P2) <-> ip(P1) & ip(P2) & (all X all Y (iext(P1,X,Y) <-> iext(P2,Y,X))))) # label(owl_inv) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 6 (exists BNODE_l1 exists BNODE_l2 exists BNODE_v (iext(uri_owl_propertyChainAxiom,uri_owl_sameAs,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_ex_p) & iext(uri_rdf_rest,BNODE_l1,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,BNODE_v) & iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil) & iext(uri_owl_inverseOf,BNODE_v,uri_ex_p))) # label(testcase_premise_fullish_027_Inferred_Property_Characteristics_II) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.17 7 iext(uri_owl_propertyChainAxiom,uri_owl_sameAs,c1) # label(testcase_premise_fullish_027_Inferred_Property_Characteristics_II) # label(axiom). [clausify(6)].
% 0.86/1.17 8 iext(uri_rdf_first,c1,uri_ex_p) # label(testcase_premise_fullish_027_Inferred_Property_Characteristics_II) # label(axiom). [clausify(6)].
% 0.86/1.17 9 iext(uri_rdf_rest,c1,c2) # label(testcase_premise_fullish_027_Inferred_Property_Characteristics_II) # label(axiom). [clausify(6)].
% 0.86/1.17 10 iext(uri_rdf_first,c2,c3) # label(testcase_premise_fullish_027_Inferred_Property_Characteristics_II) # label(axiom). [clausify(6)].
% 0.86/1.17 11 iext(uri_rdf_rest,c2,uri_rdf_nil) # label(testcase_premise_fullish_027_Inferred_Property_Characteristics_II) # label(axiom). [clausify(6)].
% 0.86/1.17 12 iext(uri_owl_inverseOf,c3,uri_ex_p) # label(testcase_premise_fullish_027_Inferred_Property_Characteristics_II) # label(axiom). [clausify(6)].
% 0.86/1.17 13 -iext(uri_rdf_type,uri_ex_p,uri_owl_InverseFunctionalProperty) # label(testcase_conclusion_fullish_027_Inferred_Property_Characteristics_II) # label(negated_conjecture). [assumption].
% 0.86/1.17 16 -iext(uri_owl_inverseOf,A,B) | ip(B) # label(owl_inv) # label(axiom). [clausify(5)].
% 0.86/1.17 18 iext(uri_rdf_type,A,B) | -icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 0.86/1.17 19 -iext(uri_owl_sameAs,A,B) | B = A # label(owl_eqdis_sameas) # label(axiom). [clausify(2)].
% 0.86/1.17 21 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | f5(A) != f4(A) # label(owl_char_inversefunctional) # label(axiom). [clausify(4)].
% 0.86/1.17 22 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | iext(A,f4(A),f6(A)) # label(owl_char_inversefunctional) # label(axiom). [clausify(4)].
% 0.86/1.17 23 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | iext(A,f5(A),f6(A)) # label(owl_char_inversefunctional) # label(axiom). [clausify(4)].
% 0.86/1.17 25 -iext(uri_owl_inverseOf,A,B) | iext(A,C,D) | -iext(B,D,C) # label(owl_inv) # label(axiom). [clausify(5)].
% 0.86/1.17 32 -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(3)].
% 0.86/1.17 155 ip(uri_ex_p). [resolve(16,a,12,a)].
% 0.86/1.17 156 -icext(uri_owl_InverseFunctionalProperty,uri_ex_p). [ur(18,a,13,a)].
% 0.86/1.17 546 iext(uri_ex_p,f5(uri_ex_p),f6(uri_ex_p)). [resolve(155,a,23,b),unit_del(a,156)].
% 0.86/1.17 547 iext(uri_ex_p,f4(uri_ex_p),f6(uri_ex_p)). [resolve(155,a,22,b),unit_del(a,156)].
% 0.86/1.17 548 f5(uri_ex_p) != f4(uri_ex_p). [resolve(155,a,21,b),unit_del(a,156)].
% 0.86/1.17 609 -iext(uri_owl_sameAs,f4(uri_ex_p),f5(uri_ex_p)). [ur(19,b,548,a)].
% 0.86/1.17 611 -iext(c3,f6(uri_ex_p),f5(uri_ex_p)). [ur(32,a,8,a,b,9,a,c,10,a,d,11,a,e,7,a,f,547,a,h,609,a)].
% 0.86/1.17 613 $F. [ur(25,b,611,a,c,546,a),unit_del(a,12)].
% 0.86/1.17
% 0.86/1.17 % SZS output end Refutation
% 0.86/1.17 ============================== end of proof ==========================
% 0.86/1.17
% 0.86/1.17 ============================== STATISTICS ============================
% 0.86/1.17
% 0.86/1.17 Given=156. Generated=1298. Kept=606. proofs=1.
% 0.86/1.17 Usable=156. Sos=448. Demods=0. Limbo=0, Disabled=31. Hints=0.
% 0.86/1.17 Megabytes=0.94.
% 0.86/1.17 User_CPU=0.18, System_CPU=0.00, Wall_clock=0.
% 0.86/1.17
% 0.86/1.17 ============================== end of statistics =====================
% 0.86/1.17
% 0.86/1.17 ============================== end of search =========================
% 0.86/1.17
% 0.86/1.17 THEOREM PROVED
% 0.86/1.17 % SZS status Theorem
% 0.86/1.17
% 0.86/1.17 Exiting with 1 proof.
% 0.86/1.17
% 0.86/1.17 Process 8589 exit (max_proofs) Wed Jun 1 13:50:38 2022
% 0.86/1.17 Prover9 interrupted
%------------------------------------------------------------------------------