TSTP Solution File: SWB009+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB009+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:47 EDT 2022
% Result : Theorem 0.40s 0.96s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWB009+2 : TPTP v8.1.0. Released v5.2.0.
% 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 08:50:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/0.96 ============================== Prover9 ===============================
% 0.40/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.40/0.96 Process 27237 was started by sandbox on n028.cluster.edu,
% 0.40/0.96 Wed Jun 1 08:50:37 2022
% 0.40/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27066_n028.cluster.edu".
% 0.40/0.96 ============================== end of head ===========================
% 0.40/0.96
% 0.40/0.96 ============================== INPUT =================================
% 0.40/0.96
% 0.40/0.96 % Reading from file /tmp/Prover9_27066_n028.cluster.edu
% 0.40/0.96
% 0.40/0.96 set(prolog_style_variables).
% 0.40/0.96 set(auto2).
% 0.40/0.96 % set(auto2) -> set(auto).
% 0.40/0.96 % set(auto) -> set(auto_inference).
% 0.40/0.96 % set(auto) -> set(auto_setup).
% 0.40/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.40/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/0.96 % set(auto) -> set(auto_limits).
% 0.40/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/0.96 % set(auto) -> set(auto_denials).
% 0.40/0.96 % set(auto) -> set(auto_process).
% 0.40/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.40/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.40/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.40/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.40/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.40/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.40/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.40/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.40/0.96 % set(auto2) -> assign(stats, some).
% 0.40/0.96 % set(auto2) -> clear(echo_input).
% 0.40/0.96 % set(auto2) -> set(quiet).
% 0.40/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.40/0.96 % set(auto2) -> clear(print_given).
% 0.40/0.96 assign(lrs_ticks,-1).
% 0.40/0.96 assign(sos_limit,10000).
% 0.40/0.96 assign(order,kbo).
% 0.40/0.96 set(lex_order_vars).
% 0.40/0.96 clear(print_given).
% 0.40/0.96
% 0.40/0.96 % formulas(sos). % not echoed (4 formulas)
% 0.40/0.96
% 0.40/0.96 ============================== end of input ==========================
% 0.40/0.96
% 0.40/0.96 % From the command line: assign(max_seconds, 300).
% 0.40/0.96
% 0.40/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/0.96
% 0.40/0.96 % Formulas that are not ordinary clauses:
% 0.40/0.96 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/0.96 2 (all Z all P all C (iext(uri_owl_someValuesFrom,Z,C) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> (exists Y (iext(P,X,Y) & icext(C,Y))))))) # label(owl_restrict_somevaluesfrom) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.96 3 (exists BNODE_z (iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty) & iext(uri_rdf_type,uri_ex_c,uri_owl_Class) & iext(uri_rdf_type,uri_ex_s,BNODE_z) & iext(uri_rdf_type,BNODE_z,uri_owl_Restriction) & iext(uri_owl_onProperty,BNODE_z,uri_ex_p) & iext(uri_owl_someValuesFrom,BNODE_z,uri_ex_c))) # label(testcase_premise_fullish_009_Existential_Restriction_Entailments) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.96 4 -(exists BNODE_x (iext(uri_ex_p,uri_ex_s,BNODE_x) & iext(uri_rdf_type,BNODE_x,uri_ex_c))) # label(testcase_conclusion_fullish_009_Existential_Restriction_Entailments) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.40/0.96
% 0.40/0.96 ============================== end of process non-clausal formulas ===
% 0.40/0.96
% 0.40/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.40/0.96
% 0.40/0.96 ============================== PREDICATE ELIMINATION =================
% 0.40/0.96
% 0.40/0.96 ============================== end predicate elimination =============
% 0.40/0.96
% 0.40/0.96 Auto_denials:
% 0.40/0.96 % copying label testcase_conclusion_fullish_009_Existential_Restriction_Entailments to answer in negative clause
% 0.40/0.96
% 0.40/0.96 Term ordering decisions:
% 0.40/0.96 Function symbol KB weights: uri_rdf_type=1. uri_owl_onProperty=1. uri_owl_someValuesFrom=1. uri_ex_c=1. uri_ex_p=1. uri_ex_s=1. uri_owl_Class=1. uri_owl_ObjectProperty=1. uri_owl_Restriction=1. c1=1. f1=1.
% 0.40/0.96
% 0.40/0.96 ============================== end of process initial clauses ========
% 0.40/0.96
% 0.40/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.40/0.96
% 0.40/0.96 ============================== end of clauses for search =============
% 0.40/0.96
% 0.40/0.96 ============================== SEARCH ================================
% 0.40/0.96
% 0.40/0.96 % Starting search at 0.01 seconds.
% 0.40/0.96
% 0.40/0.96 ============================== PROOF =================================
% 0.40/0.96 % SZS status Theorem
% 0.40/0.96 % SZS output start Refutation
% 0.40/0.96
% 0.40/0.96 % Proof 1 at 0.01 (+ 0.00) seconds: testcase_conclusion_fullish_009_Existential_Restriction_Entailments.
% 0.40/0.96 % Length of proof is 17.
% 0.40/0.96 % Level of proof is 5.
% 0.40/0.96 % Maximum clause weight is 19.000.
% 0.40/0.96 % Given clauses 16.
% 0.40/0.96
% 0.40/0.96 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/0.96 2 (all Z all P all C (iext(uri_owl_someValuesFrom,Z,C) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> (exists Y (iext(P,X,Y) & icext(C,Y))))))) # label(owl_restrict_somevaluesfrom) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.96 3 (exists BNODE_z (iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty) & iext(uri_rdf_type,uri_ex_c,uri_owl_Class) & iext(uri_rdf_type,uri_ex_s,BNODE_z) & iext(uri_rdf_type,BNODE_z,uri_owl_Restriction) & iext(uri_owl_onProperty,BNODE_z,uri_ex_p) & iext(uri_owl_someValuesFrom,BNODE_z,uri_ex_c))) # label(testcase_premise_fullish_009_Existential_Restriction_Entailments) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.96 4 -(exists BNODE_x (iext(uri_ex_p,uri_ex_s,BNODE_x) & iext(uri_rdf_type,BNODE_x,uri_ex_c))) # label(testcase_conclusion_fullish_009_Existential_Restriction_Entailments) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.40/0.96 7 iext(uri_rdf_type,uri_ex_s,c1) # label(testcase_premise_fullish_009_Existential_Restriction_Entailments) # label(axiom). [clausify(3)].
% 0.40/0.96 9 iext(uri_owl_onProperty,c1,uri_ex_p) # label(testcase_premise_fullish_009_Existential_Restriction_Entailments) # label(axiom). [clausify(3)].
% 0.40/0.96 10 iext(uri_owl_someValuesFrom,c1,uri_ex_c) # label(testcase_premise_fullish_009_Existential_Restriction_Entailments) # label(axiom). [clausify(3)].
% 0.40/0.96 11 -iext(uri_ex_p,uri_ex_s,A) | -iext(uri_rdf_type,A,uri_ex_c) # label(testcase_conclusion_fullish_009_Existential_Restriction_Entailments) # label(negated_conjecture) # answer(testcase_conclusion_fullish_009_Existential_Restriction_Entailments). [clausify(4)].
% 0.40/0.96 12 -iext(uri_rdf_type,A,B) | icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 0.40/0.96 13 iext(uri_rdf_type,A,B) | -icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 0.40/0.96 14 -iext(uri_owl_someValuesFrom,A,B) | -iext(uri_owl_onProperty,A,C) | -icext(A,D) | icext(B,f1(A,C,B,D)) # label(owl_restrict_somevaluesfrom) # label(axiom). [clausify(2)].
% 0.40/0.96 16 -iext(uri_owl_someValuesFrom,A,B) | -iext(uri_owl_onProperty,A,C) | -icext(A,D) | iext(C,D,f1(A,C,B,D)) # label(owl_restrict_somevaluesfrom) # label(axiom). [clausify(2)].
% 0.40/0.96 18 icext(c1,uri_ex_s). [ur(12,a,7,a)].
% 0.40/0.96 21 -icext(uri_ex_c,A) | -iext(uri_ex_p,uri_ex_s,A) # answer(testcase_conclusion_fullish_009_Existential_Restriction_Entailments). [resolve(13,a,11,b)].
% 0.40/0.96 25 -icext(uri_ex_c,f1(A,uri_ex_p,B,uri_ex_s)) | -iext(uri_owl_someValuesFrom,A,B) | -iext(uri_owl_onProperty,A,uri_ex_p) | -icext(A,uri_ex_s) # answer(testcase_conclusion_fullish_009_Existential_Restriction_Entailments). [resolve(21,b,16,d)].
% 0.40/0.96 29 -icext(uri_ex_c,f1(c1,uri_ex_p,uri_ex_c,uri_ex_s)) # answer(testcase_conclusion_fullish_009_Existential_Restriction_Entailments). [resolve(25,b,10,a),unit_del(b,9),unit_del(c,18)].
% 0.40/0.96 34 $F # answer(testcase_conclusion_fullish_009_Existential_Restriction_Entailments). [resolve(29,a,14,d),unit_del(a,10),unit_del(b,9),unit_del(c,18)].
% 0.40/0.96
% 0.40/0.96 % SZS output end Refutation
% 0.40/0.96 ============================== end of proof ==========================
% 0.40/0.96
% 0.40/0.96 ============================== STATISTICS ============================
% 0.40/0.96
% 0.40/0.96 Given=16. Generated=33. Kept=29. proofs=1.
% 0.40/0.96 Usable=16. Sos=12. Demods=0. Limbo=1, Disabled=12. Hints=0.
% 0.40/0.96 Megabytes=0.07.
% 0.40/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.40/0.96
% 0.40/0.96 ============================== end of statistics =====================
% 0.40/0.96
% 0.40/0.96 ============================== end of search =========================
% 0.40/0.96
% 0.40/0.96 THEOREM PROVED
% 0.40/0.96 % SZS status Theorem
% 0.40/0.96
% 0.40/0.96 Exiting with 1 proof.
% 0.40/0.96
% 0.40/0.96 Process 27237 exit (max_proofs) Wed Jun 1 08:50:37 2022
% 0.40/0.96 Prover9 interrupted
%------------------------------------------------------------------------------