TSTP Solution File: SWB020+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB020+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:51 EDT 2022
% Result : Theorem 3.86s 4.20s
% Output : Refutation 3.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWB020+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 : n025.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 07:39:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 20267 was started by sandbox2 on n025.cluster.edu,
% 0.42/1.00 Wed Jun 1 07:39:14 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20112_n025.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_20112_n025.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (8 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00 1 (all X all Y (iext(uri_owl_disjointWith,X,Y) -> ic(X) & ic(Y))) # label(owl_prop_disjointwith_ext) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 2 (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.42/1.00 3 (all Z all S1 all C1 all S2 all C2 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S2,uri_rdf_nil) -> (iext(uri_owl_intersectionOf,Z,S1) <-> ic(Z) & ic(C1) & ic(C2) & (all X (icext(Z,X) <-> icext(C1,X) & icext(C2,X)))))) # label(owl_bool_intersectionof_class_002) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 4 (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_unionOf,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_unionof_class_003) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 5 (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.42/1.00 6 (all C1 all C2 (iext(uri_owl_disjointWith,C1,C2) <-> ic(C1) & ic(C2) & (all X -(icext(C1,X) & icext(C2,X))))) # label(owl_eqdis_disjointwith) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 7 (exists BNODE_xs exists BNODE_xc exists BNODE_lu1 exists BNODE_lu2 exists BNODE_lu3 exists BNODE_li1 exists BNODE_li2 (iext(uri_owl_unionOf,uri_ex_c,BNODE_lu1) & iext(uri_rdf_first,BNODE_lu1,uri_ex_c1) & iext(uri_rdf_rest,BNODE_lu1,BNODE_lu2) & iext(uri_rdf_first,BNODE_lu2,uri_ex_c2) & iext(uri_rdf_rest,BNODE_lu2,BNODE_lu3) & iext(uri_rdf_first,BNODE_lu3,uri_ex_c3) & iext(uri_rdf_rest,BNODE_lu3,uri_rdf_nil) & iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) & iext(uri_rdfs_subClassOf,uri_ex_d,BNODE_xs) & iext(uri_owl_intersectionOf,BNODE_xs,BNODE_li1) & iext(uri_rdf_first,BNODE_li1,uri_ex_c) & iext(uri_rdf_rest,BNODE_li1,BNODE_li2) & iext(uri_rdf_first,BNODE_li2,BNODE_xc) & iext(uri_rdf_rest,BNODE_li2,uri_rdf_nil) & iext(uri_owl_complementOf,BNODE_xc,uri_ex_c2))) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom) # label(non_clause). [assumption].
% 3.86/4.20
% 3.86/4.20 ============================== end of process non-clausal formulas ===
% 3.86/4.20
% 3.86/4.20 ============================== PROCESS INITIAL CLAUSES ===============
% 3.86/4.20
% 3.86/4.20 ============================== PREDICATE ELIMINATION =================
% 3.86/4.20
% 3.86/4.20 ============================== end predicate elimination =============
% 3.86/4.20
% 3.86/4.20 Auto_denials: (non-Horn, no changes).
% 3.86/4.20
% 3.86/4.20 Term ordering decisions:
% 3.86/4.20 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_rdf_nil=1. uri_owl_unionOf=1. uri_owl_intersectionOf=1. uri_owl_disjointWith=1. uri_rdfs_subClassOf=1. uri_owl_complementOf=1. uri_ex_c=1. uri_ex_c1=1. uri_ex_c2=1. uri_ex_d=1. uri_ex_c3=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. f3=1. f4=1. f1=1. f2=1.
% 3.86/4.20
% 3.86/4.20 ============================== end of process initial clauses ========
% 3.86/4.20
% 3.86/4.20 ============================== CLAUSES FOR SEARCH ====================
% 3.86/4.20
% 3.86/4.20 ============================== end of clauses for search =============
% 3.86/4.20
% 3.86/4.20 ============================== SEARCH ================================
% 3.86/4.20
% 3.86/4.20 % Starting search at 0.10 seconds.
% 3.86/4.20
% 3.86/4.20 Low Water (keep): wt=48.000, iters=3360
% 3.86/4.20
% 3.86/4.20 ============================== PROOF =================================
% 3.86/4.20 % SZS status Theorem
% 3.86/4.20 % SZS output start Refutation
% 3.86/4.20
% 3.86/4.20 % Proof 1 at 3.19 (+ 0.02) seconds.
% 3.86/4.20 % Length of proof is 57.
% 3.86/4.20 % Level of proof is 11.
% 3.86/4.20 % Maximum clause weight is 40.000.
% 3.86/4.20 % Given clauses 1358.
% 3.86/4.20
% 3.86/4.20 1 (all X all Y (iext(uri_owl_disjointWith,X,Y) -> ic(X) & ic(Y))) # label(owl_prop_disjointwith_ext) # label(axiom) # label(non_clause). [assumption].
% 3.86/4.20 2 (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].
% 3.86/4.20 3 (all Z all S1 all C1 all S2 all C2 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S2,uri_rdf_nil) -> (iext(uri_owl_intersectionOf,Z,S1) <-> ic(Z) & ic(C1) & ic(C2) & (all X (icext(Z,X) <-> icext(C1,X) & icext(C2,X)))))) # label(owl_bool_intersectionof_class_002) # label(axiom) # label(non_clause). [assumption].
% 3.86/4.20 4 (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_unionOf,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_unionof_class_003) # label(axiom) # label(non_clause). [assumption].
% 3.86/4.20 5 (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].
% 3.86/4.20 6 (all C1 all C2 (iext(uri_owl_disjointWith,C1,C2) <-> ic(C1) & ic(C2) & (all X -(icext(C1,X) & icext(C2,X))))) # label(owl_eqdis_disjointwith) # label(axiom) # label(non_clause). [assumption].
% 3.86/4.20 7 (exists BNODE_xs exists BNODE_xc exists BNODE_lu1 exists BNODE_lu2 exists BNODE_lu3 exists BNODE_li1 exists BNODE_li2 (iext(uri_owl_unionOf,uri_ex_c,BNODE_lu1) & iext(uri_rdf_first,BNODE_lu1,uri_ex_c1) & iext(uri_rdf_rest,BNODE_lu1,BNODE_lu2) & iext(uri_rdf_first,BNODE_lu2,uri_ex_c2) & iext(uri_rdf_rest,BNODE_lu2,BNODE_lu3) & iext(uri_rdf_first,BNODE_lu3,uri_ex_c3) & iext(uri_rdf_rest,BNODE_lu3,uri_rdf_nil) & iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) & iext(uri_rdfs_subClassOf,uri_ex_d,BNODE_xs) & iext(uri_owl_intersectionOf,BNODE_xs,BNODE_li1) & iext(uri_rdf_first,BNODE_li1,uri_ex_c) & iext(uri_rdf_rest,BNODE_li1,BNODE_li2) & iext(uri_rdf_first,BNODE_li2,BNODE_xc) & iext(uri_rdf_rest,BNODE_li2,uri_rdf_nil) & iext(uri_owl_complementOf,BNODE_xc,uri_ex_c2))) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom) # label(non_clause). [assumption].
% 3.86/4.20 8 iext(uri_owl_unionOf,uri_ex_c,c3) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 9 iext(uri_rdf_first,c3,uri_ex_c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 10 iext(uri_rdf_rest,c3,c4) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 11 iext(uri_rdf_first,c4,uri_ex_c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 12 iext(uri_rdf_rest,c4,c5) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 13 iext(uri_rdf_first,c5,uri_ex_c3) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 14 iext(uri_rdf_rest,c5,uri_rdf_nil) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 15 iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 16 iext(uri_rdfs_subClassOf,uri_ex_d,c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 17 iext(uri_owl_intersectionOf,c1,c6) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 18 iext(uri_rdf_first,c6,uri_ex_c) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 19 iext(uri_rdf_rest,c6,c7) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 20 iext(uri_rdf_first,c7,c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 21 iext(uri_rdf_rest,c7,uri_rdf_nil) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 22 iext(uri_owl_complementOf,c2,uri_ex_c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(7)].
% 3.86/4.20 23 -iext(uri_rdfs_subClassOf,uri_ex_d,uri_ex_c3) # label(testcase_conclusion_fullish_020_Logical_Complications) # label(negated_conjecture). [assumption].
% 3.86/4.20 24 -iext(uri_owl_complementOf,A,B) | -icext(A,C) | -icext(B,C) # label(owl_bool_complementof_class) # label(axiom). [clausify(2)].
% 3.86/4.20 25 -iext(uri_owl_disjointWith,A,B) | -icext(A,C) | -icext(B,C) # label(owl_eqdis_disjointwith) # label(axiom). [clausify(6)].
% 3.86/4.20 26 -iext(uri_owl_disjointWith,A,B) | ic(A) # label(owl_prop_disjointwith_ext) # label(axiom). [clausify(1)].
% 3.86/4.20 33 -iext(uri_rdfs_subClassOf,A,B) | -icext(A,C) | icext(B,C) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(5)].
% 3.86/4.20 34 iext(uri_rdfs_subClassOf,A,B) | -ic(A) | -ic(B) | icext(A,f3(A,B)) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(5)].
% 3.86/4.20 35 iext(uri_rdfs_subClassOf,A,B) | -ic(A) | -ic(B) | -icext(B,f3(A,B)) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(5)].
% 3.86/4.20 41 -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,A) | -icext(E,F) | icext(B,F) # label(owl_bool_intersectionof_class_002) # label(axiom). [clausify(3)].
% 3.86/4.20 42 -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,A) | -icext(E,F) | icext(D,F) # label(owl_bool_intersectionof_class_002) # label(axiom). [clausify(3)].
% 3.86/4.20 47 -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_unionOf,V6,A) | ic(F) # label(owl_bool_unionof_class_003) # label(axiom). [clausify(4)].
% 3.86/4.20 51 -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_unionOf,V6,A) | -icext(V6,V7) | icext(B,V7) | icext(D,V7) | icext(F,V7) # label(owl_bool_unionof_class_003) # label(axiom). [clausify(4)].
% 3.86/4.20 407 -icext(c2,A) | -icext(uri_ex_c2,A). [resolve(24,a,22,a)].
% 3.86/4.20 408 -icext(uri_ex_d,A) | -icext(uri_ex_c1,A). [resolve(25,a,15,a)].
% 3.86/4.20 409 ic(uri_ex_d). [resolve(26,a,15,a)].
% 3.86/4.20 415 -icext(uri_ex_d,A) | icext(c1,A). [resolve(33,a,16,a)].
% 3.86/4.20 461 -iext(uri_rdf_rest,c6,A) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_owl_intersectionOf,C,c6) | -icext(C,D) | icext(uri_ex_c,D). [resolve(41,a,18,a)].
% 3.86/4.20 478 -iext(uri_rdf_rest,c6,A) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_owl_intersectionOf,C,c6) | -icext(C,D) | icext(B,D). [resolve(42,a,18,a)].
% 3.86/4.20 753 -iext(uri_rdf_rest,c3,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_unionOf,E,c3) | ic(D). [resolve(47,a,9,a)].
% 3.86/4.20 4469 iext(uri_rdfs_subClassOf,uri_ex_d,A) | -ic(A) | icext(uri_ex_d,f3(uri_ex_d,A)). [resolve(409,a,34,b)].
% 3.86/4.20 5057 -iext(uri_owl_intersectionOf,A,c6) | -icext(A,B) | icext(uri_ex_c,B). [resolve(461,b,20,a),unit_del(a,19),unit_del(b,21)].
% 3.86/4.20 5060 -icext(c1,A) | icext(uri_ex_c,A). [resolve(5057,a,17,a)].
% 3.86/4.20 5152 -iext(uri_owl_intersectionOf,A,c6) | -icext(A,B) | icext(c2,B). [resolve(478,b,20,a),unit_del(a,19),unit_del(b,21)].
% 3.86/4.20 5158 -icext(c1,A) | icext(c2,A). [resolve(5152,a,17,a)].
% 3.86/4.20 7665 -iext(uri_rdf_first,c4,A) | -iext(uri_rdf_first,c5,B) | -iext(uri_owl_unionOf,C,c3) | ic(B). [resolve(753,c,12,a),unit_del(a,10),unit_del(d,14)].
% 3.86/4.20 7669 -iext(uri_rdf_first,c5,A) | -iext(uri_owl_unionOf,B,c3) | ic(A). [resolve(7665,a,11,a)].
% 3.86/4.20 7672 -iext(uri_owl_unionOf,A,c3) | ic(uri_ex_c3). [resolve(7669,a,13,a)].
% 3.86/4.20 7674 ic(uri_ex_c3). [resolve(7672,a,8,a)].
% 3.86/4.20 8066 icext(uri_ex_d,f3(uri_ex_d,uri_ex_c3)). [resolve(7674,a,4469,b),unit_del(a,23)].
% 3.86/4.20 8080 -icext(uri_ex_c3,f3(uri_ex_d,uri_ex_c3)). [ur(35,a,23,a,b,409,a,c,7674,a)].
% 3.86/4.20 8102 icext(c1,f3(uri_ex_d,uri_ex_c3)). [resolve(8066,a,415,a)].
% 3.86/4.20 8103 -icext(uri_ex_c1,f3(uri_ex_d,uri_ex_c3)). [resolve(8066,a,408,a)].
% 3.86/4.20 8130 icext(c2,f3(uri_ex_d,uri_ex_c3)). [resolve(8102,a,5158,a)].
% 3.86/4.20 8140 icext(uri_ex_c,f3(uri_ex_d,uri_ex_c3)). [resolve(8102,a,5060,a)].
% 3.86/4.20 8208 -icext(uri_ex_c2,f3(uri_ex_d,uri_ex_c3)). [resolve(8130,a,407,a)].
% 3.86/4.20 8704 $F. [ur(51,b,10,a,c,11,a,d,12,a,e,13,a,f,14,a,g,8,a,h,8140,a,i,8103,a,j,8208,a,k,8080,a),unit_del(a,9)].
% 3.86/4.20
% 3.86/4.20 % SZS output end Refutation
% 3.86/4.20 ============================== end of proof ==========================
% 3.86/4.20
% 3.86/4.20 ============================== STATISTICS ============================
% 3.86/4.20
% 3.86/4.20 Given=1358. Generated=32313. Kept=8696. proofs=1.
% 3.86/4.20 Usable=989. Sos=4143. Demods=0. Limbo=19, Disabled=3598. Hints=0.
% 3.86/4.20 Megabytes=10.29.
% 3.86/4.20 User_CPU=3.19, System_CPU=0.02, Wall_clock=3.
% 3.86/4.20
% 3.86/4.20 ============================== end of statistics =====================
% 3.86/4.20
% 3.86/4.20 ============================== end of search =========================
% 3.86/4.20
% 3.86/4.20 THEOREM PROVED
% 3.86/4.20 % SZS status Theorem
% 3.86/4.20
% 3.86/4.20 Exiting with 1 proof.
% 3.86/4.20
% 3.86/4.20 Process 20267 exit (max_proofs) Wed Jun 1 07:39:17 2022
% 3.86/4.20 Prover9 interrupted
%------------------------------------------------------------------------------