TSTP Solution File: SWB012+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB012+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:48 EDT 2022
% Result : Theorem 1.99s 2.26s
% Output : Refutation 1.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWB012+2 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 1 05:43:06 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.50/1.04 ============================== Prover9 ===============================
% 0.50/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.50/1.04 Process 14050 was started by sandbox on n024.cluster.edu,
% 0.50/1.04 Wed Jun 1 05:43:06 2022
% 0.50/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13896_n024.cluster.edu".
% 0.50/1.04 ============================== end of head ===========================
% 0.50/1.04
% 0.50/1.04 ============================== INPUT =================================
% 0.50/1.04
% 0.50/1.04 % Reading from file /tmp/Prover9_13896_n024.cluster.edu
% 0.50/1.04
% 0.50/1.04 set(prolog_style_variables).
% 0.50/1.04 set(auto2).
% 0.50/1.04 % set(auto2) -> set(auto).
% 0.50/1.04 % set(auto) -> set(auto_inference).
% 0.50/1.04 % set(auto) -> set(auto_setup).
% 0.50/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.50/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/1.04 % set(auto) -> set(auto_limits).
% 0.50/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/1.04 % set(auto) -> set(auto_denials).
% 0.50/1.04 % set(auto) -> set(auto_process).
% 0.50/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.50/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.50/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.50/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.50/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.50/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.50/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.50/1.04 % set(auto2) -> assign(stats, some).
% 0.50/1.04 % set(auto2) -> clear(echo_input).
% 0.50/1.04 % set(auto2) -> set(quiet).
% 0.50/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.50/1.04 % set(auto2) -> clear(print_given).
% 0.50/1.04 assign(lrs_ticks,-1).
% 0.50/1.04 assign(sos_limit,10000).
% 0.50/1.04 assign(order,kbo).
% 0.50/1.04 set(lex_order_vars).
% 0.50/1.04 clear(print_given).
% 0.50/1.04
% 0.50/1.04 % formulas(sos). % not echoed (6 formulas)
% 0.50/1.04
% 0.50/1.04 ============================== end of input ==========================
% 0.50/1.04
% 0.50/1.04 % From the command line: assign(max_seconds, 300).
% 0.50/1.04
% 0.50/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/1.04
% 0.50/1.04 % Formulas that are not ordinary clauses:
% 0.50/1.04 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.50/1.04 2 (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.50/1.04 3 (all Z all S1 all C1 all S2 all C2 all S3 all C3 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S2,S3) & iext(uri_rdf_first,S3,C3) & iext(uri_rdf_rest,S3,uri_rdf_nil) -> (iext(uri_owl_intersectionOf,Z,S1) <-> ic(Z) & ic(C1) & ic(C2) & ic(C3) & (all X (icext(Z,X) <-> icext(C1,X) & icext(C2,X) & icext(C3,X)))))) # label(owl_bool_intersectionof_class_003) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.04 4 (all Z all P all A (iext(uri_owl_hasValue,Z,A) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> iext(P,X,A))))) # label(owl_restrict_hasvalue) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.04 5 (exists BNODE_l1 exists BNODE_l2 exists BNODE_l3 exists BNODE_r (iext(uri_rdf_type,uri_foaf_Person,uri_owl_Class) & iext(uri_owl_intersectionOf,uri_ex_PersonAttribute,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_owl_DatatypeProperty) & iext(uri_rdf_rest,BNODE_l1,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,uri_owl_FunctionalProperty) & iext(uri_rdf_rest,BNODE_l2,BNODE_l3) & iext(uri_rdf_first,BNODE_l3,BNODE_r) & iext(uri_rdf_rest,BNODE_l3,uri_rdf_nil) & iext(uri_rdf_type,BNODE_r,uri_owl_Restriction) & iext(uri_owl_onProperty,BNODE_r,uri_rdfs_domain) & iext(uri_owl_hasValue,BNODE_r,uri_foaf_Person) & iext(uri_rdf_type,uri_ex_name,uri_ex_PersonAttribute) & iext(uri_ex_name,uri_ex_alice,literal_plain(dat_str_alice)))) # label(testcase_premise_fullish_012_Template_Class) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.04 6 -(iext(uri_rdf_type,uri_ex_name,uri_owl_FunctionalProperty) & iext(uri_rdf_type,uri_ex_alice,uri_foaf_Person)) # label(testcase_conclusion_fullish_012_Template_Class) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.99/2.26
% 1.99/2.26 ============================== end of process non-clausal formulas ===
% 1.99/2.26
% 1.99/2.26 ============================== PROCESS INITIAL CLAUSES ===============
% 1.99/2.26
% 1.99/2.26 ============================== PREDICATE ELIMINATION =================
% 1.99/2.26
% 1.99/2.26 ============================== end predicate elimination =============
% 1.99/2.26
% 1.99/2.26 Auto_denials: (non-Horn, no changes).
% 1.99/2.26
% 1.99/2.26 Term ordering decisions:
% 1.99/2.26
% 1.99/2.26 % Assigning unary symbol literal_plain kb_weight 0 and highest precedence (26).
% 1.99/2.26 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_owl_intersectionOf=1. uri_rdf_nil=1. uri_rdf_type=1. uri_owl_hasValue=1. uri_owl_onProperty=1. uri_ex_PersonAttribute=1. uri_ex_name=1. uri_foaf_Person=1. uri_rdfs_domain=1. dat_str_alice=1. uri_ex_alice=1. uri_owl_Class=1. uri_owl_DatatypeProperty=1. uri_owl_FunctionalProperty=1. uri_owl_Restriction=1. c1=1. c2=1. c3=1. c4=1. f1=1. literal_plain=0.
% 1.99/2.26
% 1.99/2.26 ============================== end of process initial clauses ========
% 1.99/2.26
% 1.99/2.26 ============================== CLAUSES FOR SEARCH ====================
% 1.99/2.26
% 1.99/2.26 ============================== end of clauses for search =============
% 1.99/2.26
% 1.99/2.26 ============================== SEARCH ================================
% 1.99/2.26
% 1.99/2.26 % Starting search at 0.14 seconds.
% 1.99/2.26
% 1.99/2.26 ============================== PROOF =================================
% 1.99/2.26 % SZS status Theorem
% 1.99/2.26 % SZS output start Refutation
% 1.99/2.26
% 1.99/2.26 % Proof 1 at 1.22 (+ 0.02) seconds.
% 1.99/2.26 % Length of proof is 41.
% 1.99/2.26 % Level of proof is 14.
% 1.99/2.26 % Maximum clause weight is 34.000.
% 1.99/2.26 % Given clauses 655.
% 1.99/2.26
% 1.99/2.26 1 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 1.99/2.26 2 (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].
% 1.99/2.26 3 (all Z all S1 all C1 all S2 all C2 all S3 all C3 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S2,S3) & iext(uri_rdf_first,S3,C3) & iext(uri_rdf_rest,S3,uri_rdf_nil) -> (iext(uri_owl_intersectionOf,Z,S1) <-> ic(Z) & ic(C1) & ic(C2) & ic(C3) & (all X (icext(Z,X) <-> icext(C1,X) & icext(C2,X) & icext(C3,X)))))) # label(owl_bool_intersectionof_class_003) # label(axiom) # label(non_clause). [assumption].
% 1.99/2.26 4 (all Z all P all A (iext(uri_owl_hasValue,Z,A) & iext(uri_owl_onProperty,Z,P) -> (all X (icext(Z,X) <-> iext(P,X,A))))) # label(owl_restrict_hasvalue) # label(axiom) # label(non_clause). [assumption].
% 1.99/2.26 5 (exists BNODE_l1 exists BNODE_l2 exists BNODE_l3 exists BNODE_r (iext(uri_rdf_type,uri_foaf_Person,uri_owl_Class) & iext(uri_owl_intersectionOf,uri_ex_PersonAttribute,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_owl_DatatypeProperty) & iext(uri_rdf_rest,BNODE_l1,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,uri_owl_FunctionalProperty) & iext(uri_rdf_rest,BNODE_l2,BNODE_l3) & iext(uri_rdf_first,BNODE_l3,BNODE_r) & iext(uri_rdf_rest,BNODE_l3,uri_rdf_nil) & iext(uri_rdf_type,BNODE_r,uri_owl_Restriction) & iext(uri_owl_onProperty,BNODE_r,uri_rdfs_domain) & iext(uri_owl_hasValue,BNODE_r,uri_foaf_Person) & iext(uri_rdf_type,uri_ex_name,uri_ex_PersonAttribute) & iext(uri_ex_name,uri_ex_alice,literal_plain(dat_str_alice)))) # label(testcase_premise_fullish_012_Template_Class) # label(axiom) # label(non_clause). [assumption].
% 1.99/2.26 6 -(iext(uri_rdf_type,uri_ex_name,uri_owl_FunctionalProperty) & iext(uri_rdf_type,uri_ex_alice,uri_foaf_Person)) # label(testcase_conclusion_fullish_012_Template_Class) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.99/2.26 8 iext(uri_owl_intersectionOf,uri_ex_PersonAttribute,c1) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 9 iext(uri_rdf_first,c1,uri_owl_DatatypeProperty) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 10 iext(uri_rdf_rest,c1,c2) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 11 iext(uri_rdf_first,c2,uri_owl_FunctionalProperty) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 12 iext(uri_rdf_rest,c2,c3) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 13 iext(uri_rdf_first,c3,c4) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 14 iext(uri_rdf_rest,c3,uri_rdf_nil) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 16 iext(uri_owl_onProperty,c4,uri_rdfs_domain) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 17 iext(uri_owl_hasValue,c4,uri_foaf_Person) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 18 iext(uri_rdf_type,uri_ex_name,uri_ex_PersonAttribute) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 19 iext(uri_ex_name,uri_ex_alice,literal_plain(dat_str_alice)) # label(testcase_premise_fullish_012_Template_Class) # label(axiom). [clausify(5)].
% 1.99/2.26 20 -iext(uri_rdf_type,uri_ex_name,uri_owl_FunctionalProperty) | -iext(uri_rdf_type,uri_ex_alice,uri_foaf_Person) # label(testcase_conclusion_fullish_012_Template_Class) # label(negated_conjecture). [clausify(6)].
% 1.99/2.26 21 -iext(uri_rdf_type,A,B) | icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 1.99/2.26 22 iext(uri_rdf_type,A,B) | -icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(1)].
% 1.99/2.26 23 -iext(uri_rdfs_domain,A,B) | -iext(A,C,D) | icext(B,C) # label(rdfs_domain_main) # label(axiom). [clausify(2)].
% 1.99/2.26 24 -iext(uri_owl_hasValue,A,B) | -iext(uri_owl_onProperty,A,C) | -icext(A,D) | iext(C,D,B) # label(owl_restrict_hasvalue) # label(axiom). [clausify(4)].
% 1.99/2.26 31 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_first,C,D) | -iext(uri_rdf_rest,C,E) | -iext(uri_rdf_first,E,F) | -iext(uri_rdf_rest,E,uri_rdf_nil) | -iext(uri_owl_intersectionOf,V6,A) | -icext(V6,V7) | icext(D,V7) # label(owl_bool_intersectionof_class_003) # label(axiom). [clausify(3)].
% 1.99/2.26 32 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_first,C,D) | -iext(uri_rdf_rest,C,E) | -iext(uri_rdf_first,E,F) | -iext(uri_rdf_rest,E,uri_rdf_nil) | -iext(uri_owl_intersectionOf,V6,A) | -icext(V6,V7) | icext(F,V7) # label(owl_bool_intersectionof_class_003) # label(axiom). [clausify(3)].
% 1.99/2.26 345 icext(uri_ex_PersonAttribute,uri_ex_name). [resolve(21,a,18,a)].
% 1.99/2.26 348 -iext(uri_rdfs_domain,uri_ex_name,A) | icext(A,uri_ex_alice). [resolve(23,b,19,a)].
% 1.99/2.26 361 -iext(uri_owl_onProperty,c4,A) | -icext(c4,B) | iext(A,B,uri_foaf_Person). [resolve(24,a,17,a)].
% 1.99/2.26 621 -iext(uri_rdf_rest,c1,A) | -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_intersectionOf,E,c1) | -icext(E,F) | icext(B,F). [resolve(31,a,9,a)].
% 1.99/2.26 2695 -icext(c4,A) | iext(uri_rdfs_domain,A,uri_foaf_Person). [resolve(361,a,16,a)].
% 1.99/2.26 4056 -iext(uri_rdf_first,c2,A) | -iext(uri_rdf_first,c3,B) | -iext(uri_owl_intersectionOf,C,c1) | -icext(C,D) | icext(A,D). [resolve(621,c,12,a),unit_del(a,10),unit_del(d,14)].
% 1.99/2.26 4062 -iext(uri_rdf_first,c3,A) | -iext(uri_owl_intersectionOf,B,c1) | -icext(B,C) | icext(uri_owl_FunctionalProperty,C). [resolve(4056,a,11,a)].
% 1.99/2.26 4065 -iext(uri_owl_intersectionOf,A,c1) | -icext(A,B) | icext(uri_owl_FunctionalProperty,B). [resolve(4062,a,13,a)].
% 1.99/2.26 4067 -icext(uri_ex_PersonAttribute,A) | icext(uri_owl_FunctionalProperty,A). [resolve(4065,a,8,a)].
% 1.99/2.26 4073 icext(uri_owl_FunctionalProperty,uri_ex_name). [resolve(4067,a,345,a)].
% 1.99/2.26 4074 iext(uri_rdf_type,uri_ex_name,uri_owl_FunctionalProperty). [resolve(4073,a,22,b)].
% 1.99/2.26 4075 -iext(uri_rdf_type,uri_ex_alice,uri_foaf_Person). [back_unit_del(20),unit_del(a,4074)].
% 1.99/2.26 4079 -icext(uri_foaf_Person,uri_ex_alice). [ur(22,a,4075,a)].
% 1.99/2.26 4080 -iext(uri_rdfs_domain,uri_ex_name,uri_foaf_Person). [ur(348,b,4079,a)].
% 1.99/2.26 4081 -icext(c4,uri_ex_name). [ur(2695,b,4080,a)].
% 1.99/2.26 4085 -iext(uri_rdf_first,c1,A). [ur(32,b,10,a,c,11,a,d,12,a,e,13,a,f,14,a,g,8,a,h,345,a,i,4081,a)].
% 1.99/2.26 4086 $F. [resolve(4085,a,9,a)].
% 1.99/2.26
% 1.99/2.26 % SZS output end Refutation
% 1.99/2.26 ============================== end of proof ==========================
% 1.99/2.26
% 1.99/2.26 ============================== STATISTICS ============================
% 1.99/2.26
% 1.99/2.26 Given=655. Generated=18630. Kept=4079. proofs=1.
% 1.99/2.26 Usable=510. Sos=1784. Demods=0. Limbo=3, Disabled=1812. Hints=0.
% 1.99/2.26 Megabytes=5.16.
% 1.99/2.26 User_CPU=1.22, System_CPU=0.02, Wall_clock=2.
% 1.99/2.26
% 1.99/2.26 ============================== end of statistics =====================
% 1.99/2.26
% 1.99/2.26 ============================== end of search =========================
% 1.99/2.26
% 1.99/2.26 THEOREM PROVED
% 1.99/2.26 % SZS status Theorem
% 1.99/2.26
% 1.99/2.26 Exiting with 1 proof.
% 1.99/2.26
% 1.99/2.26 Process 14050 exit (max_proofs) Wed Jun 1 05:43:08 2022
% 1.99/2.27 Prover9 interrupted
%------------------------------------------------------------------------------