0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer   : n012.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% DateTime   : Tue Jul 13 17:14:46 EDT 2021
0.13/0.35	% CPUTime    : 
0.48/1.15	============================== Prover9 ===============================
0.48/1.15	Prover9 (32) version 2009-11A, November 2009.
0.48/1.15	Process 31233 was started by sandbox on n012.cluster.edu,
0.48/1.15	Tue Jul 13 17:14:47 2021
0.48/1.15	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_31070_n012.cluster.edu".
0.48/1.15	============================== end of head ===========================
0.48/1.15	
0.48/1.15	============================== INPUT =================================
0.48/1.15	
0.48/1.15	% Reading from file /tmp/Prover9_31070_n012.cluster.edu
0.48/1.15	
0.48/1.15	set(prolog_style_variables).
0.48/1.15	set(auto2).
0.48/1.15	    % set(auto2) -> set(auto).
0.48/1.15	    % set(auto) -> set(auto_inference).
0.48/1.15	    % set(auto) -> set(auto_setup).
0.48/1.15	    % set(auto_setup) -> set(predicate_elim).
0.48/1.15	    % set(auto_setup) -> assign(eq_defs, unfold).
0.48/1.15	    % set(auto) -> set(auto_limits).
0.48/1.15	    % set(auto_limits) -> assign(max_weight, "100.000").
0.48/1.15	    % set(auto_limits) -> assign(sos_limit, 20000).
0.48/1.15	    % set(auto) -> set(auto_denials).
0.48/1.15	    % set(auto) -> set(auto_process).
0.48/1.15	    % set(auto2) -> assign(new_constants, 1).
0.48/1.15	    % set(auto2) -> assign(fold_denial_max, 3).
0.48/1.15	    % set(auto2) -> assign(max_weight, "200.000").
0.48/1.15	    % set(auto2) -> assign(max_hours, 1).
0.48/1.15	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.48/1.15	    % set(auto2) -> assign(max_seconds, 0).
0.48/1.15	    % set(auto2) -> assign(max_minutes, 5).
0.48/1.15	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.48/1.15	    % set(auto2) -> set(sort_initial_sos).
0.48/1.15	    % set(auto2) -> assign(sos_limit, -1).
0.48/1.15	    % set(auto2) -> assign(lrs_ticks, 3000).
0.48/1.15	    % set(auto2) -> assign(max_megs, 400).
0.48/1.15	    % set(auto2) -> assign(stats, some).
0.48/1.15	    % set(auto2) -> clear(echo_input).
0.48/1.15	    % set(auto2) -> set(quiet).
0.48/1.15	    % set(auto2) -> clear(print_initial_clauses).
0.48/1.15	    % set(auto2) -> clear(print_given).
0.48/1.15	assign(lrs_ticks,-1).
0.48/1.15	assign(sos_limit,10000).
0.48/1.15	assign(order,kbo).
0.48/1.15	set(lex_order_vars).
0.48/1.15	clear(print_given).
0.48/1.15	
0.48/1.15	% formulas(sos).  % not echoed (10 formulas)
0.48/1.15	
0.48/1.15	============================== end of input ==========================
0.48/1.15	
0.48/1.15	% From the command line: assign(max_seconds, 1200).
0.48/1.15	
0.48/1.15	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.48/1.15	
0.48/1.15	% Formulas that are not ordinary clauses:
0.48/1.15	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.48/1.15	2 (all X ir(X)) # label(simple_ir) # label(axiom) # label(non_clause).  [assumption].
0.48/1.15	3 (all P all A1 all A2 (ir(A1) & ip(P) & ir(A2) & -iext(P,A1,A2) -> (exists Z (iext(uri_owl_sourceIndividual,Z,A1) & iext(uri_owl_targetIndividual,Z,A2) & iext(uri_owl_assertionProperty,Z,P))))) # label(owl_npa_object_fi) # label(axiom) # label(non_clause).  [assumption].
0.48/1.15	4 (all Z all S1 all A1 (iext(uri_rdf_rest,S1,uri_rdf_nil) & iext(uri_rdf_first,S1,A1) -> (ic(Z) & (all X (X = A1 <-> icext(Z,X))) <-> iext(uri_owl_oneOf,Z,S1)))) # label(owl_enum_class_001) # label(axiom) # label(non_clause).  [assumption].
0.48/1.15	5 (exists BNODE_x1 exists BNODE_x2 exists BNODE_x3 exists BNODE_x4 (iext(uri_rdf_type,uri_ex_s,BNODE_x1) & iext(uri_owl_allValuesFrom,BNODE_x1,BNODE_x2) & iext(uri_owl_oneOf,BNODE_x3,BNODE_x4) & iext(uri_rdf_first,BNODE_x4,uri_ex_o) & iext(uri_rdf_rest,BNODE_x4,uri_rdf_nil) & iext(uri_owl_complementOf,BNODE_x2,BNODE_x3) & iext(uri_owl_onProperty,BNODE_x1,uri_ex_p) & iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty))) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom) # label(non_clause).  [assumption].
0.48/1.15	6 (all Z all P all C (iext(uri_owl_onProperty,Z,P) & iext(uri_owl_allValuesFrom,Z,C) -> (all X (icext(Z,X) <-> (all Y (iext(P,X,Y) -> icext(C,Y))))))) # label(owl_restrict_allvaluesfrom) # label(axiom) # label(non_clause).  [assumption].
0.48/1.15	7 (all X all Y (iext(uri_owl_sourceIndividual,X,Y) -> icext(uri_owl_NegativePropertyAssertion,X) & ir(Y))) # label(owl_prop_sourceindividual_ext) # label(axiom) # label(non_clause).  [assumption].
0.48/1.15	8 (all Z all C (iext(uri_owl_complementOf,Z,C) -> ic(Z) & ic(C) & (all X (icext(Z,X) <-> -icext(C,X))))) # label(owl_bool_complementof_class) # label(axiom) # label(non_clause).  [assumption].
0.48/1.15	9 (all X all Y (iext(uri_owl_onProperty,X,Y) -> icext(uri_owl_Restriction,X) & ip(Y))) # label(owl_prop_onproperty_ext) # label(axiom) # label(non_clause).  [assumption].
0.48/1.16	10 -(exists BNODE_z (iext(uri_owl_sourceIndividual,BNODE_z,uri_ex_s) & iext(uri_owl_targetIndividual,BNODE_z,uri_ex_o) & iext(uri_owl_assertionProperty,BNODE_z,uri_ex_p) & iext(uri_rdf_type,BNODE_z,uri_owl_NegativePropertyAssertion))) # label(testcase_conclusion_fullish_010_Negative_Property_Assertions) # label(negated_conjecture) # label(non_clause).  [assumption].
0.48/1.16	
0.48/1.16	============================== end of process non-clausal formulas ===
0.48/1.16	
0.48/1.16	============================== PROCESS INITIAL CLAUSES ===============
0.48/1.16	
0.48/1.16	============================== PREDICATE ELIMINATION =================
0.48/1.16	11 -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | -ic(C) | B = f2(C,A,B) | icext(C,f2(C,A,B)) | iext(uri_owl_oneOf,C,A) # label(owl_enum_class_001) # label(axiom).  [clausify(4)].
0.48/1.16	12 -iext(uri_owl_complementOf,A,B) | ic(A) # label(owl_bool_complementof_class) # label(axiom).  [clausify(8)].
0.48/1.16	13 -iext(uri_owl_complementOf,A,B) | ic(B) # label(owl_bool_complementof_class) # label(axiom).  [clausify(8)].
0.48/1.16	14 -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | ic(C) | -iext(uri_owl_oneOf,C,A) # label(owl_enum_class_001) # label(axiom).  [clausify(4)].
0.48/1.16	Derived: -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | B = f2(C,A,B) | icext(C,f2(C,A,B)) | iext(uri_owl_oneOf,C,A) | -iext(uri_owl_complementOf,C,D).  [resolve(11,c,12,b)].
0.48/1.16	Derived: -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | B = f2(C,A,B) | icext(C,f2(C,A,B)) | iext(uri_owl_oneOf,C,A) | -iext(uri_owl_complementOf,D,C).  [resolve(11,c,13,b)].
0.48/1.16	Derived: -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | B = f2(C,A,B) | icext(C,f2(C,A,B)) | iext(uri_owl_oneOf,C,A) | -iext(uri_rdf_rest,D,uri_rdf_nil) | -iext(uri_rdf_first,D,E) | -iext(uri_owl_oneOf,C,D).  [resolve(11,c,14,c)].
0.48/1.16	15 -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | -ic(C) | B != f2(C,A,B) | -icext(C,f2(C,A,B)) | iext(uri_owl_oneOf,C,A) # label(owl_enum_class_001) # label(axiom).  [clausify(4)].
0.48/1.16	Derived: -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | B != f2(C,A,B) | -icext(C,f2(C,A,B)) | iext(uri_owl_oneOf,C,A) | -iext(uri_owl_complementOf,C,D).  [resolve(15,c,12,b)].
0.48/1.16	Derived: -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | B != f2(C,A,B) | -icext(C,f2(C,A,B)) | iext(uri_owl_oneOf,C,A) | -iext(uri_owl_complementOf,D,C).  [resolve(15,c,13,b)].
0.48/1.16	Derived: -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | B != f2(C,A,B) | -icext(C,f2(C,A,B)) | iext(uri_owl_oneOf,C,A) | -iext(uri_rdf_rest,D,uri_rdf_nil) | -iext(uri_rdf_first,D,E) | -iext(uri_owl_oneOf,C,D).  [resolve(15,c,14,c)].
0.48/1.16	16 -ir(A) | -ip(B) | -ir(C) | iext(B,A,C) | iext(uri_owl_sourceIndividual,f1(B,A,C),A) # label(owl_npa_object_fi) # label(axiom).  [clausify(3)].
0.48/1.16	17 -iext(uri_owl_onProperty,A,B) | ip(B) # label(owl_prop_onproperty_ext) # label(axiom).  [clausify(9)].
0.48/1.16	Derived: -ir(A) | -ir(B) | iext(C,A,B) | iext(uri_owl_sourceIndividual,f1(C,A,B),A) | -iext(uri_owl_onProperty,D,C).  [resolve(16,b,17,b)].
0.48/1.16	18 -ir(A) | -ip(B) | -ir(C) | iext(B,A,C) | iext(uri_owl_targetIndividual,f1(B,A,C),C) # label(owl_npa_object_fi) # label(axiom).  [clausify(3)].
0.48/1.16	Derived: -ir(A) | -ir(B) | iext(C,A,B) | iext(uri_owl_targetIndividual,f1(C,A,B),B) | -iext(uri_owl_onProperty,D,C).  [resolve(18,b,17,b)].
0.48/1.16	19 -ir(A) | -ip(B) | -ir(C) | iext(B,A,C) | iext(uri_owl_assertionProperty,f1(B,A,C),B) # label(owl_npa_object_fi) # label(axiom).  [clausify(3)].
0.48/1.16	Derived: -ir(A) | -ir(B) | iext(C,A,B) | iext(uri_owl_assertionProperty,f1(C,A,B),C) | -iext(uri_owl_onProperty,D,C).  [resolve(19,b,17,b)].
0.48/1.16	
0.48/1.16	============================== end predicate elimination =============
0.48/1.16	
0.48/1.16	Auto_denials:  (non-Horn, no changes).
0.48/1.16	
0.48/1.16	Term ordering decisions:
0.48/1.16	Function symbol KB weights:  uri_owl_oneOf=1. uri_rdf_first=1. uri_rdf_nil=1. uri_rdf_rest=1. uri_owl_onProperty=1. uri_owl_complementOf=1. uri_owl_allValuesFrom=1. uri_rdf_type=1. uri_owl_sourceIndividual=1. uri_ex_p=1. uri_ex_o=1. uri_ex_s=1. uri_owl_NegativePropertyAssertion=1. uri_owl_ObjectProperty=1. uri_owl_Restriction=1. uri_owl_assertionProperty=1. uri_owl_targetIndividual=1. c1=1. c2=1. c3=1. c4=1. f1=1. f2=1. f3=1.
0.48/1.17	
0.48/1.17	============================== end of process initial clauses ========
0.48/1.17	
0.48/1.17	============================== CLAUSES FOR SEARCH ====================
0.48/1.17	
0.48/1.17	============================== end of clauses for search =============
0.48/1.17	
0.48/1.17	============================== SEARCH ================================
0.48/1.17	
0.48/1.17	% Starting search at 0.01 seconds.
0.48/1.17	
0.48/1.17	============================== PROOF =================================
0.48/1.17	% SZS status Theorem
0.48/1.17	% SZS output start Refutation
0.48/1.17	
0.48/1.17	% Proof 1 at 0.02 (+ 0.00) seconds.
0.48/1.17	% Length of proof is 51.
0.48/1.17	% Level of proof is 9.
0.48/1.17	% Maximum clause weight is 25.000.
0.48/1.17	% Given clauses 156.
0.48/1.17	
0.48/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.48/1.17	2 (all X ir(X)) # label(simple_ir) # label(axiom) # label(non_clause).  [assumption].
0.48/1.17	3 (all P all A1 all A2 (ir(A1) & ip(P) & ir(A2) & -iext(P,A1,A2) -> (exists Z (iext(uri_owl_sourceIndividual,Z,A1) & iext(uri_owl_targetIndividual,Z,A2) & iext(uri_owl_assertionProperty,Z,P))))) # label(owl_npa_object_fi) # label(axiom) # label(non_clause).  [assumption].
0.48/1.17	4 (all Z all S1 all A1 (iext(uri_rdf_rest,S1,uri_rdf_nil) & iext(uri_rdf_first,S1,A1) -> (ic(Z) & (all X (X = A1 <-> icext(Z,X))) <-> iext(uri_owl_oneOf,Z,S1)))) # label(owl_enum_class_001) # label(axiom) # label(non_clause).  [assumption].
0.48/1.17	5 (exists BNODE_x1 exists BNODE_x2 exists BNODE_x3 exists BNODE_x4 (iext(uri_rdf_type,uri_ex_s,BNODE_x1) & iext(uri_owl_allValuesFrom,BNODE_x1,BNODE_x2) & iext(uri_owl_oneOf,BNODE_x3,BNODE_x4) & iext(uri_rdf_first,BNODE_x4,uri_ex_o) & iext(uri_rdf_rest,BNODE_x4,uri_rdf_nil) & iext(uri_owl_complementOf,BNODE_x2,BNODE_x3) & iext(uri_owl_onProperty,BNODE_x1,uri_ex_p) & iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty))) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom) # label(non_clause).  [assumption].
0.48/1.17	6 (all Z all P all C (iext(uri_owl_onProperty,Z,P) & iext(uri_owl_allValuesFrom,Z,C) -> (all X (icext(Z,X) <-> (all Y (iext(P,X,Y) -> icext(C,Y))))))) # label(owl_restrict_allvaluesfrom) # label(axiom) # label(non_clause).  [assumption].
0.48/1.17	7 (all X all Y (iext(uri_owl_sourceIndividual,X,Y) -> icext(uri_owl_NegativePropertyAssertion,X) & ir(Y))) # label(owl_prop_sourceindividual_ext) # label(axiom) # label(non_clause).  [assumption].
0.48/1.17	8 (all Z all C (iext(uri_owl_complementOf,Z,C) -> ic(Z) & ic(C) & (all X (icext(Z,X) <-> -icext(C,X))))) # label(owl_bool_complementof_class) # label(axiom) # label(non_clause).  [assumption].
0.48/1.17	9 (all X all Y (iext(uri_owl_onProperty,X,Y) -> icext(uri_owl_Restriction,X) & ip(Y))) # label(owl_prop_onproperty_ext) # label(axiom) # label(non_clause).  [assumption].
0.48/1.17	10 -(exists BNODE_z (iext(uri_owl_sourceIndividual,BNODE_z,uri_ex_s) & iext(uri_owl_targetIndividual,BNODE_z,uri_ex_o) & iext(uri_owl_assertionProperty,BNODE_z,uri_ex_p) & iext(uri_rdf_type,BNODE_z,uri_owl_NegativePropertyAssertion))) # label(testcase_conclusion_fullish_010_Negative_Property_Assertions) # label(negated_conjecture) # label(non_clause).  [assumption].
0.48/1.17	16 -ir(A) | -ip(B) | -ir(C) | iext(B,A,C) | iext(uri_owl_sourceIndividual,f1(B,A,C),A) # label(owl_npa_object_fi) # label(axiom).  [clausify(3)].
0.48/1.17	17 -iext(uri_owl_onProperty,A,B) | ip(B) # label(owl_prop_onproperty_ext) # label(axiom).  [clausify(9)].
0.48/1.17	18 -ir(A) | -ip(B) | -ir(C) | iext(B,A,C) | iext(uri_owl_targetIndividual,f1(B,A,C),C) # label(owl_npa_object_fi) # label(axiom).  [clausify(3)].
0.48/1.17	19 -ir(A) | -ip(B) | -ir(C) | iext(B,A,C) | iext(uri_owl_assertionProperty,f1(B,A,C),B) # label(owl_npa_object_fi) # label(axiom).  [clausify(3)].
0.48/1.17	20 ir(A) # label(simple_ir) # label(axiom).  [clausify(2)].
0.48/1.17	21 iext(uri_rdf_type,uri_ex_s,c1) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom).  [clausify(5)].
0.48/1.17	22 iext(uri_owl_allValuesFrom,c1,c2) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom).  [clausify(5)].
0.48/1.17	23 iext(uri_owl_oneOf,c3,c4) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom).  [clausify(5)].
0.48/1.17	24 iext(uri_rdf_first,c4,uri_ex_o) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom).  [clausify(5)].
0.48/1.17	25 iext(uri_rdf_rest,c4,uri_rdf_nil) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom).  [clausify(5)].
0.48/1.17	26 iext(uri_owl_complementOf,c2,c3) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom).  [clausify(5)].
0.48/1.17	27 iext(uri_owl_onProperty,c1,uri_ex_p) # label(testcase_premise_fullish_010_Negative_Property_Assertions) # label(axiom).  [clausify(5)].
0.48/1.17	29 -iext(uri_owl_complementOf,A,B) | -icext(A,C) | -icext(B,C) # label(owl_bool_complementof_class) # label(axiom).  [clausify(8)].
0.48/1.17	30 -iext(uri_owl_sourceIndividual,A,uri_ex_s) | -iext(uri_owl_targetIndividual,A,uri_ex_o) | -iext(uri_owl_assertionProperty,A,uri_ex_p) | -iext(uri_rdf_type,A,uri_owl_NegativePropertyAssertion) # label(testcase_conclusion_fullish_010_Negative_Property_Assertions) # label(negated_conjecture).  [clausify(10)].
0.48/1.17	31 -iext(uri_rdf_type,A,B) | icext(B,A) # label(rdfs_cext_def) # label(axiom).  [clausify(1)].
0.48/1.17	32 iext(uri_rdf_type,A,B) | -icext(B,A) # label(rdfs_cext_def) # label(axiom).  [clausify(1)].
0.48/1.17	33 -iext(uri_owl_sourceIndividual,A,B) | icext(uri_owl_NegativePropertyAssertion,A) # label(owl_prop_sourceindividual_ext) # label(axiom).  [clausify(7)].
0.48/1.17	36 -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | B != C | icext(D,C) | -iext(uri_owl_oneOf,D,A) # label(owl_enum_class_001) # label(axiom).  [clausify(4)].
0.48/1.17	38 -iext(uri_owl_onProperty,A,B) | -iext(uri_owl_allValuesFrom,A,C) | -icext(A,D) | -iext(B,D,E) | icext(C,E) # label(owl_restrict_allvaluesfrom) # label(axiom).  [clausify(6)].
0.48/1.17	53 -ir(A) | -ir(B) | iext(C,A,B) | iext(uri_owl_sourceIndividual,f1(C,A,B),A) | -iext(uri_owl_onProperty,D,C).  [resolve(16,b,17,b)].
0.48/1.17	54 iext(A,B,C) | iext(uri_owl_sourceIndividual,f1(A,B,C),B) | -iext(uri_owl_onProperty,D,A).  [copy(53),unit_del(a,20),unit_del(b,20)].
0.48/1.17	55 -ir(A) | -ir(B) | iext(C,A,B) | iext(uri_owl_targetIndividual,f1(C,A,B),B) | -iext(uri_owl_onProperty,D,C).  [resolve(18,b,17,b)].
0.48/1.17	56 iext(A,B,C) | iext(uri_owl_targetIndividual,f1(A,B,C),C) | -iext(uri_owl_onProperty,D,A).  [copy(55),unit_del(a,20),unit_del(b,20)].
0.48/1.17	57 -ir(A) | -ir(B) | iext(C,A,B) | iext(uri_owl_assertionProperty,f1(C,A,B),C) | -iext(uri_owl_onProperty,D,C).  [resolve(19,b,17,b)].
0.48/1.17	58 iext(A,B,C) | iext(uri_owl_assertionProperty,f1(A,B,C),A) | -iext(uri_owl_onProperty,D,A).  [copy(57),unit_del(a,20),unit_del(b,20)].
0.48/1.17	63 -icext(c2,A) | -icext(c3,A).  [resolve(29,a,26,a)].
0.48/1.17	65 icext(c1,uri_ex_s).  [resolve(31,a,21,a)].
0.48/1.17	69 uri_ex_o != A | icext(B,A) | -iext(uri_owl_oneOf,B,c4).  [resolve(36,b,24,a),unit_del(a,25)].
0.48/1.17	109 iext(uri_ex_p,A,B) | iext(uri_owl_sourceIndividual,f1(uri_ex_p,A,B),A).  [resolve(54,c,27,a)].
0.48/1.17	110 iext(uri_ex_p,A,B) | iext(uri_owl_targetIndividual,f1(uri_ex_p,A,B),B).  [resolve(56,c,27,a)].
0.48/1.17	111 iext(uri_ex_p,A,B) | iext(uri_owl_assertionProperty,f1(uri_ex_p,A,B),uri_ex_p).  [resolve(58,c,27,a)].
0.48/1.17	121 uri_ex_o != A | icext(c3,A).  [resolve(69,c,23,a)].
0.48/1.17	122 icext(c3,uri_ex_o).  [xx_res(121,a)].
0.48/1.17	123 -icext(c2,uri_ex_o).  [resolve(122,a,63,b)].
0.48/1.17	128 -iext(uri_ex_p,uri_ex_s,uri_ex_o).  [ur(38,a,27,a,b,22,a,c,65,a,e,123,a)].
0.48/1.17	137 iext(uri_ex_p,A,B) | icext(uri_owl_NegativePropertyAssertion,f1(uri_ex_p,A,B)).  [resolve(109,b,33,a)].
0.48/1.17	139 icext(uri_owl_NegativePropertyAssertion,f1(uri_ex_p,uri_ex_s,uri_ex_o)).  [resolve(137,a,128,a)].
0.48/1.17	155 iext(uri_rdf_type,f1(uri_ex_p,uri_ex_s,uri_ex_o),uri_owl_NegativePropertyAssertion).  [resolve(139,a,32,b)].
0.48/1.17	161 iext(uri_ex_p,A,uri_ex_o) | -iext(uri_owl_sourceIndividual,f1(uri_ex_p,A,uri_ex_o),uri_ex_s) | -iext(uri_owl_assertionProperty,f1(uri_ex_p,A,uri_ex_o),uri_ex_p) | -iext(uri_rdf_type,f1(uri_ex_p,A,uri_ex_o),uri_owl_NegativePropertyAssertion).  [resolve(110,b,30,b)].
0.48/1.17	189 iext(uri_ex_p,A,uri_ex_o) | -iext(uri_owl_sourceIndividual,f1(uri_ex_p,A,uri_ex_o),uri_ex_s) | -iext(uri_rdf_type,f1(uri_ex_p,A,uri_ex_o),uri_owl_NegativePropertyAssertion).  [resolve(161,c,111,b),merge(d)].
0.48/1.17	190 $F.  [resolve(189,b,109,b),merge(c),unit_del(a,128),unit_del(b,155)].
0.48/1.17	
0.48/1.17	% SZS output end Refutation
0.48/1.17	============================== end of proof ==========================
0.48/1.17	
0.48/1.17	============================== STATISTICS ============================
0.48/1.17	
0.48/1.17	Given=156. Generated=285. Kept=161. proofs=1.
0.48/1.17	Usable=155. Sos=3. Demods=0. Limbo=0, Disabled=43. Hints=0.
0.48/1.17	Megabytes=0.31.
0.48/1.17	User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
0.48/1.17	
0.48/1.17	============================== end of statistics =====================
0.48/1.17	
0.48/1.17	============================== end of search =========================
0.48/1.17	
0.48/1.17	THEOREM PROVED
0.48/1.17	% SZS status Theorem
0.48/1.17	
0.48/1.17	Exiting with 1 proof.
0.48/1.17	
0.48/1.17	Process 31233 exit (max_proofs) Tue Jul 13 17:14:47 2021
0.48/1.17	Prover9 interrupted
0.48/1.17	EOF