TSTP Solution File: SWB026+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB026+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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.69s 0.99s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWB026+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 04:35:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.98 ============================== Prover9 ===============================
% 0.69/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.98 Process 16185 was started by sandbox on n027.cluster.edu,
% 0.69/0.98 Wed Jun 1 04:35:03 2022
% 0.69/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16032_n027.cluster.edu".
% 0.69/0.98 ============================== end of head ===========================
% 0.69/0.98
% 0.69/0.98 ============================== INPUT =================================
% 0.69/0.98
% 0.69/0.98 % Reading from file /tmp/Prover9_16032_n027.cluster.edu
% 0.69/0.98
% 0.69/0.98 set(prolog_style_variables).
% 0.69/0.98 set(auto2).
% 0.69/0.98 % set(auto2) -> set(auto).
% 0.69/0.98 % set(auto) -> set(auto_inference).
% 0.69/0.98 % set(auto) -> set(auto_setup).
% 0.69/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.98 % set(auto) -> set(auto_limits).
% 0.69/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.98 % set(auto) -> set(auto_denials).
% 0.69/0.98 % set(auto) -> set(auto_process).
% 0.69/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.98 % set(auto2) -> assign(stats, some).
% 0.69/0.98 % set(auto2) -> clear(echo_input).
% 0.69/0.98 % set(auto2) -> set(quiet).
% 0.69/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.98 % set(auto2) -> clear(print_given).
% 0.69/0.98 assign(lrs_ticks,-1).
% 0.69/0.98 assign(sos_limit,10000).
% 0.69/0.98 assign(order,kbo).
% 0.69/0.98 set(lex_order_vars).
% 0.69/0.98 clear(print_given).
% 0.69/0.98
% 0.69/0.98 % formulas(sos). % not echoed (8 formulas)
% 0.69/0.98
% 0.69/0.98 ============================== end of input ==========================
% 0.69/0.98
% 0.69/0.98 % From the command line: assign(max_seconds, 300).
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.98
% 0.69/0.98 % Formulas that are not ordinary clauses:
% 0.69/0.98 1 (all P (iext(uri_rdf_type,P,uri_rdf_Property) <-> ip(P))) # label(rdf_type_ip) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 2 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 3 (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.69/0.98 4 (all Z all S1 all A1 (iext(uri_rdf_first,S1,A1) & iext(uri_rdf_rest,S1,uri_rdf_nil) -> (iext(uri_owl_oneOf,Z,S1) <-> ic(Z) & (all X (icext(Z,X) <-> X = A1))))) # label(owl_enum_class_001) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 5 (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.69/0.98 6 (exists BNODE_x1 exists BNODE_x2 exists BNODE_l1 exists BNODE_l2 (iext(uri_rdfs_domain,uri_ex_p,BNODE_x1) & iext(uri_owl_oneOf,BNODE_x1,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_ex_w) & iext(uri_rdf_rest,BNODE_l1,uri_rdf_nil) & iext(uri_rdfs_range,uri_ex_p,BNODE_x2) & iext(uri_owl_oneOf,BNODE_x2,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,uri_ex_u) & iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil))) # label(testcase_premise_fullish_026_Inferred_Property_Characteristics_I) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98
% 0.69/0.98 ============================== end of process non-clausal formulas ===
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.98
% 0.69/0.98 ============================== PREDICATE ELIMINATION =================
% 0.69/0.98 7 iext(uri_rdf_type,A,uri_rdf_Property) | -ip(A) # label(rdf_type_ip) # label(axiom). [clausify(1)].
% 0.69/0.98 8 -icext(uri_owl_InverseFunctionalProperty,A) | ip(A) # label(owl_char_inversefunctional) # label(axiom). [clausify(5)].
% 0.69/0.98 9 -iext(uri_rdf_type,A,uri_rdf_Property) | ip(A) # label(rdf_type_ip) # label(axiom). [clausify(1)].
% 0.69/0.98 Derived: iext(uri_rdf_type,A,uri_rdf_Property) | -icext(uri_owl_InverseFunctionalProperty,A). [resolve(7,b,8,b)].
% 0.69/0.99 10 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | f3(A) != f2(A) # label(owl_char_inversefunctional) # label(axiom). [clausify(5)].
% 0.69/0.99 Derived: icext(uri_owl_InverseFunctionalProperty,A) | f3(A) != f2(A) | -iext(uri_rdf_type,A,uri_rdf_Property). [resolve(10,b,9,b)].
% 0.69/0.99 11 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | iext(A,f2(A),f4(A)) # label(owl_char_inversefunctional) # label(axiom). [clausify(5)].
% 0.69/0.99 Derived: icext(uri_owl_InverseFunctionalProperty,A) | iext(A,f2(A),f4(A)) | -iext(uri_rdf_type,A,uri_rdf_Property). [resolve(11,b,9,b)].
% 0.69/0.99 12 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | iext(A,f3(A),f4(A)) # label(owl_char_inversefunctional) # label(axiom). [clausify(5)].
% 0.69/0.99 Derived: icext(uri_owl_InverseFunctionalProperty,A) | iext(A,f3(A),f4(A)) | -iext(uri_rdf_type,A,uri_rdf_Property). [resolve(12,b,9,b)].
% 0.69/0.99 13 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | iext(uri_owl_oneOf,C,A) | -ic(C) | icext(C,f1(C,A,B)) | B = f1(C,A,B) # label(owl_enum_class_001) # label(axiom). [clausify(4)].
% 0.69/0.99 14 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_owl_oneOf,C,A) | ic(C) # label(owl_enum_class_001) # label(axiom). [clausify(4)].
% 0.69/0.99 Derived: -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | iext(uri_owl_oneOf,C,A) | icext(C,f1(C,A,B)) | B = f1(C,A,B) | -iext(uri_rdf_first,D,E) | -iext(uri_rdf_rest,D,uri_rdf_nil) | -iext(uri_owl_oneOf,C,D). [resolve(13,d,14,d)].
% 0.69/0.99 15 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | iext(uri_owl_oneOf,C,A) | -ic(C) | -icext(C,f1(C,A,B)) | B != f1(C,A,B) # label(owl_enum_class_001) # label(axiom). [clausify(4)].
% 0.69/0.99 Derived: -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | iext(uri_owl_oneOf,C,A) | -icext(C,f1(C,A,B)) | B != f1(C,A,B) | -iext(uri_rdf_first,D,E) | -iext(uri_rdf_rest,D,uri_rdf_nil) | -iext(uri_owl_oneOf,C,D). [resolve(15,d,14,d)].
% 0.69/0.99
% 0.69/0.99 ============================== end predicate elimination =============
% 0.69/0.99
% 0.69/0.99 Auto_denials: (non-Horn, no changes).
% 0.69/0.99
% 0.69/0.99 Term ordering decisions:
% 0.69/0.99 Function symbol KB weights: uri_owl_oneOf=1. uri_rdf_first=1. uri_rdf_nil=1. uri_rdf_rest=1. uri_rdf_type=1. uri_owl_InverseFunctionalProperty=1. uri_rdf_Property=1. uri_rdfs_domain=1. uri_ex_p=1. uri_ex_u=1. uri_ex_w=1. uri_rdfs_range=1. c1=1. c2=1. c3=1. c4=1. f2=1. f3=1. f4=1. f1=1.
% 0.69/0.99
% 0.69/0.99 ============================== end of process initial clauses ========
% 0.69/0.99
% 0.69/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.99
% 0.69/0.99 ============================== end of clauses for search =============
% 0.69/0.99
% 0.69/0.99 ============================== SEARCH ================================
% 0.69/0.99
% 0.69/0.99 % Starting search at 0.01 seconds.
% 0.69/0.99
% 0.69/0.99 ============================== PROOF =================================
% 0.69/0.99 % SZS status Theorem
% 0.69/0.99 % SZS output start Refutation
% 0.69/0.99
% 0.69/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.69/0.99 % Length of proof is 37.
% 0.69/0.99 % Level of proof is 8.
% 0.69/0.99 % Maximum clause weight is 18.000.
% 0.69/0.99 % Given clauses 79.
% 0.69/0.99
% 0.69/0.99 1 (all P (iext(uri_rdf_type,P,uri_rdf_Property) <-> ip(P))) # label(rdf_type_ip) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 2 (all X all C (iext(uri_rdf_type,X,C) <-> icext(C,X))) # label(rdfs_cext_def) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 3 (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.69/0.99 4 (all Z all S1 all A1 (iext(uri_rdf_first,S1,A1) & iext(uri_rdf_rest,S1,uri_rdf_nil) -> (iext(uri_owl_oneOf,Z,S1) <-> ic(Z) & (all X (icext(Z,X) <-> X = A1))))) # label(owl_enum_class_001) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 5 (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.69/0.99 6 (exists BNODE_x1 exists BNODE_x2 exists BNODE_l1 exists BNODE_l2 (iext(uri_rdfs_domain,uri_ex_p,BNODE_x1) & iext(uri_owl_oneOf,BNODE_x1,BNODE_l1) & iext(uri_rdf_first,BNODE_l1,uri_ex_w) & iext(uri_rdf_rest,BNODE_l1,uri_rdf_nil) & iext(uri_rdfs_range,uri_ex_p,BNODE_x2) & iext(uri_owl_oneOf,BNODE_x2,BNODE_l2) & iext(uri_rdf_first,BNODE_l2,uri_ex_u) & iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil))) # label(testcase_premise_fullish_026_Inferred_Property_Characteristics_I) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 9 -iext(uri_rdf_type,A,uri_rdf_Property) | ip(A) # label(rdf_type_ip) # label(axiom). [clausify(1)].
% 0.69/0.99 10 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | f3(A) != f2(A) # label(owl_char_inversefunctional) # label(axiom). [clausify(5)].
% 0.69/0.99 11 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | iext(A,f2(A),f4(A)) # label(owl_char_inversefunctional) # label(axiom). [clausify(5)].
% 0.69/0.99 12 icext(uri_owl_InverseFunctionalProperty,A) | -ip(A) | iext(A,f3(A),f4(A)) # label(owl_char_inversefunctional) # label(axiom). [clausify(5)].
% 0.69/0.99 16 iext(uri_rdfs_domain,uri_rdfs_domain,uri_rdf_Property) # label(rdfs_domain_domain) # label(axiom). [assumption].
% 0.69/0.99 17 iext(uri_rdfs_domain,uri_ex_p,c1) # label(testcase_premise_fullish_026_Inferred_Property_Characteristics_I) # label(axiom). [clausify(6)].
% 0.69/0.99 18 iext(uri_owl_oneOf,c1,c3) # label(testcase_premise_fullish_026_Inferred_Property_Characteristics_I) # label(axiom). [clausify(6)].
% 0.69/0.99 19 iext(uri_rdf_first,c3,uri_ex_w) # label(testcase_premise_fullish_026_Inferred_Property_Characteristics_I) # label(axiom). [clausify(6)].
% 0.69/0.99 20 iext(uri_rdf_rest,c3,uri_rdf_nil) # label(testcase_premise_fullish_026_Inferred_Property_Characteristics_I) # label(axiom). [clausify(6)].
% 0.69/0.99 25 -iext(uri_rdf_type,uri_ex_p,uri_owl_InverseFunctionalProperty) # label(testcase_conclusion_fullish_026_Inferred_Property_Characteristics_I) # label(negated_conjecture). [assumption].
% 0.69/0.99 27 iext(uri_rdf_type,A,B) | -icext(B,A) # label(rdfs_cext_def) # label(axiom). [clausify(2)].
% 0.69/0.99 28 -iext(uri_rdfs_domain,A,B) | -iext(A,C,D) | icext(B,C) # label(rdfs_domain_main) # label(axiom). [clausify(3)].
% 0.69/0.99 30 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_owl_oneOf,C,A) | -icext(C,D) | B = D # label(owl_enum_class_001) # label(axiom). [clausify(4)].
% 0.69/0.99 33 icext(uri_owl_InverseFunctionalProperty,A) | f3(A) != f2(A) | -iext(uri_rdf_type,A,uri_rdf_Property). [resolve(10,b,9,b)].
% 0.69/0.99 34 icext(uri_owl_InverseFunctionalProperty,A) | iext(A,f2(A),f4(A)) | -iext(uri_rdf_type,A,uri_rdf_Property). [resolve(11,b,9,b)].
% 0.69/0.99 35 icext(uri_owl_InverseFunctionalProperty,A) | iext(A,f3(A),f4(A)) | -iext(uri_rdf_type,A,uri_rdf_Property). [resolve(12,b,9,b)].
% 0.69/0.99 41 -icext(uri_owl_InverseFunctionalProperty,uri_ex_p). [ur(27,a,25,a)].
% 0.69/0.99 42 -iext(uri_ex_p,A,B) | icext(c1,A). [resolve(28,a,17,a)].
% 0.69/0.99 43 -iext(uri_rdfs_domain,A,B) | icext(uri_rdf_Property,A). [resolve(28,a,16,a)].
% 0.69/0.99 62 -iext(uri_owl_oneOf,A,c3) | -icext(A,B) | uri_ex_w = B. [resolve(30,a,19,a),unit_del(a,20)].
% 0.69/0.99 98 icext(uri_rdf_Property,uri_ex_p). [resolve(43,a,17,a)].
% 0.69/0.99 99 iext(uri_rdf_type,uri_ex_p,uri_rdf_Property). [resolve(98,a,27,b)].
% 0.69/0.99 100 iext(uri_ex_p,f3(uri_ex_p),f4(uri_ex_p)). [resolve(99,a,35,c),unit_del(a,41)].
% 0.69/0.99 101 iext(uri_ex_p,f2(uri_ex_p),f4(uri_ex_p)). [resolve(99,a,34,c),unit_del(a,41)].
% 0.69/0.99 102 f3(uri_ex_p) != f2(uri_ex_p). [resolve(99,a,33,c),unit_del(a,41)].
% 0.69/0.99 106 icext(c1,f3(uri_ex_p)). [resolve(100,a,42,a)].
% 0.69/0.99 109 -iext(uri_rdf_first,c3,f2(uri_ex_p)). [ur(30,b,20,a,c,18,a,d,106,a,e,102,a(flip))].
% 0.69/0.99 112 icext(c1,f2(uri_ex_p)). [resolve(101,a,42,a)].
% 0.69/0.99 138 -icext(c1,A) | uri_ex_w = A. [resolve(62,a,18,a)].
% 0.69/0.99 139 f2(uri_ex_p) = uri_ex_w. [resolve(138,a,112,a),flip(a)].
% 0.69/0.99 145 $F. [back_rewrite(109),rewrite([139(4)]),unit_del(a,19)].
% 0.69/0.99
% 0.69/0.99 % SZS output end Refutation
% 0.69/0.99 ============================== end of proof ==========================
% 0.69/0.99
% 0.69/0.99 ============================== STATISTICS ============================
% 0.69/0.99
% 0.69/0.99 Given=79. Generated=200. Kept=127. proofs=1.
% 0.69/0.99 Usable=74. Sos=38. Demods=2. Limbo=6, Disabled=40. Hints=0.
% 0.69/0.99 Megabytes=0.20.
% 0.69/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.69/0.99
% 0.69/0.99 ============================== end of statistics =====================
% 0.69/0.99
% 0.69/0.99 ============================== end of search =========================
% 0.69/0.99
% 0.69/0.99 THEOREM PROVED
% 0.69/0.99 % SZS status Theorem
% 0.69/0.99
% 0.69/0.99 Exiting with 1 proof.
% 0.69/0.99
% 0.69/0.99 Process 16185 exit (max_proofs) Wed Jun 1 04:35:03 2022
% 0.69/0.99 Prover9 interrupted
%------------------------------------------------------------------------------