TSTP Solution File: SWB024+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB024+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:53 EDT 2022
% Result : Theorem 0.71s 0.99s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWB024+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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 01:00:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 15318 was started by sandbox2 on n024.cluster.edu,
% 0.71/0.99 Wed Jun 1 01:00:51 2022
% 0.71/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15165_n024.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_15165_n024.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99 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.71/0.99 2 (all Z all P (iext(uri_owl_minCardinality,Z,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> (exists Y iext(P,X,Y)))))) # label(owl_restrict_mincard_001) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 3 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) -> icext(C2,X))))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 4 (all P (icext(uri_owl_TransitiveProperty,P) <-> ip(P) & (all X all Y all Z (iext(P,X,Y) & iext(P,Y,Z) -> iext(P,X,Z))))) # label(owl_char_transitive) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 5 (exists BNODE_z (iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty) & iext(uri_rdfs_subClassOf,uri_ex_Person,BNODE_z) & iext(uri_rdf_type,BNODE_z,uri_owl_Restriction) & iext(uri_owl_onProperty,BNODE_z,uri_ex_hasAncestor) & iext(uri_owl_minCardinality,BNODE_z,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) & iext(uri_rdf_type,uri_ex_alice,uri_ex_Person) & iext(uri_rdf_type,uri_ex_bob,uri_ex_Person) & iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob))) # label(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 6 -(exists BNODE_x (iext(uri_ex_hasAncestor,uri_ex_bob,BNODE_x) & iext(uri_ex_hasAncestor,uri_ex_alice,BNODE_x))) # label(testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99 7 icext(uri_owl_TransitiveProperty,A) | -ip(A) | iext(A,f3(A),f4(A)) # label(owl_char_transitive) # label(axiom). [clausify(4)].
% 0.71/0.99 8 -icext(uri_owl_TransitiveProperty,A) | ip(A) # label(owl_char_transitive) # label(axiom). [clausify(4)].
% 0.71/0.99 9 icext(uri_owl_TransitiveProperty,A) | -ip(A) | iext(A,f4(A),f5(A)) # label(owl_char_transitive) # label(axiom). [clausify(4)].
% 0.71/0.99 10 icext(uri_owl_TransitiveProperty,A) | -ip(A) | -iext(A,f3(A),f5(A)) # label(owl_char_transitive) # label(axiom). [clausify(4)].
% 0.71/0.99
% 0.71/0.99 ============================== end predicate elimination =============
% 0.71/0.99
% 0.71/0.99 Auto_denials: (non-Horn, no changes).
% 0.71/0.99
% 0.71/0.99 Term ordering decisions:
% 0.71/0.99 Function symbol KB weights: uri_rdf_type=1. uri_rdfs_subClassOf=1. dat_str_1=1. uri_ex_Person=1. uri_ex_hasAncestor=1. uri_owl_minCardinality=1. uri_owl_onProperty=1. uri_xsd_nonNegativeInteger=1. uri_ex_alice=1. uri_ex_bob=1. uri_owl_TransitiveProperty=1. uri_owl_Restriction=1. c1=1. literal_typed=1. f2=1. f1=1.
% 0.71/0.99
% 0.71/0.99 ============================== end of process initial clauses ========
% 0.71/0.99
% 0.71/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99
% 0.71/0.99 ============================== end of clauses for search =============
% 0.71/0.99
% 0.71/0.99 ============================== SEARCH ================================
% 0.71/0.99
% 0.71/0.99 % Starting search at 0.01 seconds.
% 0.71/0.99
% 0.71/0.99 ============================== PROOF =================================
% 0.71/0.99 % SZS status Theorem
% 0.71/0.99 % SZS output start Refutation
% 0.71/0.99
% 0.71/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.71/0.99 % Length of proof is 26.
% 0.71/0.99 % Level of proof is 6.
% 0.71/0.99 % Maximum clause weight is 20.000.
% 0.71/0.99 % Given clauses 47.
% 0.71/0.99
% 0.71/0.99 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.71/0.99 2 (all Z all P (iext(uri_owl_minCardinality,Z,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> (exists Y iext(P,X,Y)))))) # label(owl_restrict_mincard_001) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 3 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) -> icext(C2,X))))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 4 (all P (icext(uri_owl_TransitiveProperty,P) <-> ip(P) & (all X all Y all Z (iext(P,X,Y) & iext(P,Y,Z) -> iext(P,X,Z))))) # label(owl_char_transitive) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 5 (exists BNODE_z (iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty) & iext(uri_rdfs_subClassOf,uri_ex_Person,BNODE_z) & iext(uri_rdf_type,BNODE_z,uri_owl_Restriction) & iext(uri_owl_onProperty,BNODE_z,uri_ex_hasAncestor) & iext(uri_owl_minCardinality,BNODE_z,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) & iext(uri_rdf_type,uri_ex_alice,uri_ex_Person) & iext(uri_rdf_type,uri_ex_bob,uri_ex_Person) & iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob))) # label(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 6 -(exists BNODE_x (iext(uri_ex_hasAncestor,uri_ex_bob,BNODE_x) & iext(uri_ex_hasAncestor,uri_ex_alice,BNODE_x))) # label(testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.99 11 iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty) # label(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(axiom). [clausify(5)].
% 0.71/0.99 12 iext(uri_rdfs_subClassOf,uri_ex_Person,c1) # label(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(axiom). [clausify(5)].
% 0.71/0.99 14 iext(uri_owl_onProperty,c1,uri_ex_hasAncestor) # label(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(axiom). [clausify(5)].
% 0.71/0.99 16 iext(uri_rdf_type,uri_ex_bob,uri_ex_Person) # label(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(axiom). [clausify(5)].
% 0.71/0.99 17 iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob) # label(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(axiom). [clausify(5)].
% 0.71/0.99 18 iext(uri_owl_minCardinality,c1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) # label(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(axiom). [clausify(5)].
% 0.71/0.99 19 -iext(uri_ex_hasAncestor,uri_ex_bob,A) | -iext(uri_ex_hasAncestor,uri_ex_alice,A) # label(testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties) # label(negated_conjecture). [clausify(6)].
% 0.71/0.99 22 -iext(uri_rdf_type,A,B) | icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 0.71/0.99 24 -iext(uri_rdfs_subClassOf,A,B) | -icext(A,C) | icext(B,C) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(3)].
% 0.71/0.99 27 -icext(uri_owl_TransitiveProperty,A) | -iext(A,B,C) | -iext(A,C,D) | iext(A,B,D) # label(owl_char_transitive) # label(axiom). [clausify(4)].
% 0.71/0.99 29 -iext(uri_owl_minCardinality,A,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) | -iext(uri_owl_onProperty,A,B) | -icext(A,C) | iext(B,C,f1(A,B,C)) # label(owl_restrict_mincard_001) # label(axiom). [clausify(2)].
% 0.71/0.99 37 icext(uri_ex_Person,uri_ex_bob). [resolve(22,a,16,a)].
% 0.71/0.99 40 icext(uri_owl_TransitiveProperty,uri_ex_hasAncestor). [resolve(22,a,11,a)].
% 0.71/0.99 41 -icext(uri_ex_Person,A) | icext(c1,A). [resolve(24,a,12,a)].
% 0.71/0.99 43 -iext(uri_ex_hasAncestor,uri_ex_bob,A) | iext(uri_ex_hasAncestor,uri_ex_alice,A). [resolve(27,b,17,a),unit_del(a,40)].
% 0.71/0.99 70 -icext(c1,A) | iext(uri_ex_hasAncestor,A,f1(c1,uri_ex_hasAncestor,A)). [resolve(29,b,14,a),unit_del(a,18)].
% 0.71/0.99 80 icext(c1,uri_ex_bob). [resolve(41,a,37,a)].
% 0.71/0.99 88 iext(uri_ex_hasAncestor,uri_ex_bob,f1(c1,uri_ex_hasAncestor,uri_ex_bob)). [resolve(70,a,80,a)].
% 0.71/0.99 90 iext(uri_ex_hasAncestor,uri_ex_alice,f1(c1,uri_ex_hasAncestor,uri_ex_bob)). [resolve(88,a,43,a)].
% 0.71/0.99 94 $F. [resolve(88,a,19,a),unit_del(a,90)].
% 0.71/0.99
% 0.71/0.99 % SZS output end Refutation
% 0.71/0.99 ============================== end of proof ==========================
% 0.71/0.99
% 0.71/0.99 ============================== STATISTICS ============================
% 0.71/0.99
% 0.71/0.99 Given=47. Generated=108. Kept=83. proofs=1.
% 0.71/0.99 Usable=47. Sos=32. Demods=0. Limbo=4, Disabled=23. Hints=0.
% 0.71/0.99 Megabytes=0.13.
% 0.71/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99
% 0.71/0.99 ============================== end of statistics =====================
% 0.71/0.99
% 0.71/0.99 ============================== end of search =========================
% 0.71/0.99
% 0.71/0.99 THEOREM PROVED
% 0.71/0.99 % SZS status Theorem
% 0.71/0.99
% 0.71/0.99 Exiting with 1 proof.
% 0.71/0.99
% 0.71/0.99 Process 15318 exit (max_proofs) Wed Jun 1 01:00:51 2022
% 0.71/0.99 Prover9 interrupted
%------------------------------------------------------------------------------