TSTP Solution File: KRS140+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS140+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Sun Jul 17 03:25:05 EDT 2022
% Result : Theorem 0.69s 1.02s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS140+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 15:01:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/0.98 ============================== Prover9 ===============================
% 0.69/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.98 Process 3564 was started by sandbox on n021.cluster.edu,
% 0.69/0.98 Tue Jun 7 15:01:52 2022
% 0.69/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3411_n021.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_3411_n021.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 (15 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 A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 2 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 3 (all A all B all C (A = B & rsymProp(A,C) -> rsymProp(B,C))) # label(rsymProp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 4 (all A all B all C (A = B & rsymProp(C,A) -> rsymProp(C,B))) # label(rsymProp_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 5 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 6 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 7 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 8 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 9 (all X all Y (rsymProp(X,Y) -> Y = ia | Y = ib)) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 10 (all X all Y (rsymProp(X,Y) -> rsymProp(Y,X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 11 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X all Y all Z (rsymProp(X,Y) & rsymProp(Y,Z) -> rsymProp(X,Z))) & (exists X (rsymProp(ia,X) & cowlThing(X)))) # label(the_axiom) # label(negated_conjecture) # 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
% 0.69/0.98 ============================== end predicate elimination =============
% 0.69/0.98
% 0.69/0.98 Auto_denials: (non-Horn, no changes).
% 0.69/0.98
% 0.69/0.98 Term ordering decisions:
% 0.69/1.02 Function symbol KB weights: ia=1. ib=1. c1=1. c2=1. c3=1. c4=1. c5=1.
% 0.69/1.02
% 0.69/1.02 ============================== end of process initial clauses ========
% 0.69/1.02
% 0.69/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.02
% 0.69/1.02 ============================== end of clauses for search =============
% 0.69/1.02
% 0.69/1.02 ============================== SEARCH ================================
% 0.69/1.02
% 0.69/1.02 % Starting search at 0.01 seconds.
% 0.69/1.02
% 0.69/1.02 ============================== PROOF =================================
% 0.69/1.02 % SZS status Theorem
% 0.69/1.02 % SZS output start Refutation
% 0.69/1.02
% 0.69/1.02 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.69/1.02 % Length of proof is 117.
% 0.69/1.02 % Level of proof is 40.
% 0.69/1.02 % Maximum clause weight is 11.000.
% 0.69/1.02 % Given clauses 288.
% 0.69/1.02
% 0.69/1.02 3 (all A all B all C (A = B & rsymProp(A,C) -> rsymProp(B,C))) # label(rsymProp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/1.02 4 (all A all B all C (A = B & rsymProp(C,A) -> rsymProp(C,B))) # label(rsymProp_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/1.02 7 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/1.02 8 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/1.02 9 (all X all Y (rsymProp(X,Y) -> Y = ia | Y = ib)) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/1.02 10 (all X all Y (rsymProp(X,Y) -> rsymProp(Y,X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.69/1.02 11 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X all Y all Z (rsymProp(X,Y) & rsymProp(Y,Z) -> rsymProp(X,Z))) & (exists X (rsymProp(ia,X) & cowlThing(X)))) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/1.02 12 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(7)].
% 0.69/1.02 13 rsymProp(ia,ia) # label(axiom_5) # label(axiom). [assumption].
% 0.69/1.02 14 rsymProp(ib,ib) # label(axiom_7) # label(axiom). [assumption].
% 0.69/1.02 15 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(8)].
% 0.69/1.02 16 -cowlNothing(A) # label(axiom_0) # label(axiom). [clausify(7)].
% 0.69/1.02 17 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(8)].
% 0.69/1.02 18 -rsymProp(A,B) | rsymProp(B,A) # label(axiom_3) # label(axiom). [clausify(10)].
% 0.69/1.02 23 A != B | -rsymProp(B,C) | rsymProp(A,C) # label(rsymProp_substitution_1) # label(axiom). [clausify(3)].
% 0.69/1.02 24 A != B | -rsymProp(C,B) | rsymProp(C,A) # label(rsymProp_substitution_2) # label(axiom). [clausify(4)].
% 0.69/1.02 25 -rsymProp(A,B) | ia = B | ib = B # label(axiom_2) # label(axiom). [clausify(9)].
% 0.69/1.02 26 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rsymProp(c3,c4) | -rsymProp(ia,A) | -cowlThing(A) # label(the_axiom) # label(negated_conjecture). [clausify(11)].
% 0.69/1.02 27 xsd_string(c2) | -xsd_integer(c2) | rsymProp(c3,c4) | -rsymProp(ia,A). [copy(26),unit_del(a,12),unit_del(b,16),unit_del(g,12)].
% 0.69/1.02 28 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rsymProp(c4,c5) | -rsymProp(ia,A) | -cowlThing(A) # label(the_axiom) # label(negated_conjecture). [clausify(11)].
% 0.69/1.02 29 xsd_string(c2) | -xsd_integer(c2) | rsymProp(c4,c5) | -rsymProp(ia,A). [copy(28),unit_del(a,12),unit_del(b,16),unit_del(g,12)].
% 0.69/1.02 30 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rsymProp(c3,c5) | -rsymProp(ia,A) | -cowlThing(A) # label(the_axiom) # label(negated_conjecture). [clausify(11)].
% 0.69/1.02 31 xsd_string(c2) | -xsd_integer(c2) | -rsymProp(c3,c5) | -rsymProp(ia,A). [copy(30),unit_del(a,12),unit_del(b,16),unit_del(g,12)].
% 0.69/1.02 32 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rsymProp(c3,c4) | -rsymProp(ia,A) | -cowlThing(A) # label(the_axiom) # label(negated_conjecture). [clausify(11)].
% 0.69/1.02 33 -xsd_string(c2) | xsd_integer(c2) | rsymProp(c3,c4) | -rsymProp(ia,A). [copy(32),unit_del(a,12),unit_del(b,16),unit_del(g,12)].
% 0.69/1.02 34 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rsymProp(c4,c5) | -rsymProp(ia,A) | -cowlThing(A) # label(the_axiom) # label(negated_conjecture). [clausify(11)].
% 0.69/1.02 35 -xsd_string(c2) | xsd_integer(c2) | rsymProp(c4,c5) | -rsymProp(ia,A). [copy(34),unit_del(a,12),unit_del(b,16),unit_del(g,12)].
% 0.69/1.02 36 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rsymProp(c3,c5) | -rsymProp(ia,A) | -cowlThing(A) # label(the_axiom) # label(negated_conjecture). [clausify(11)].
% 0.69/1.02 37 -xsd_string(c2) | xsd_integer(c2) | -rsymProp(c3,c5) | -rsymProp(ia,A). [copy(36),unit_del(a,12),unit_del(b,16),unit_del(g,12)].
% 0.69/1.02 43 xsd_string(c2) | -xsd_integer(c2) | rsymProp(c3,c4). [resolve(27,d,13,a)].
% 0.69/1.02 44 xsd_string(c2) | -xsd_integer(c2) | rsymProp(c4,c5). [resolve(29,d,13,a)].
% 0.69/1.02 45 xsd_string(c2) | -xsd_integer(c2) | -rsymProp(c3,c5). [resolve(31,d,13,a)].
% 0.69/1.02 46 -xsd_string(c2) | xsd_integer(c2) | rsymProp(c3,c4). [resolve(33,d,13,a)].
% 0.69/1.02 47 -xsd_string(c2) | xsd_integer(c2) | rsymProp(c4,c5). [resolve(35,d,13,a)].
% 0.69/1.02 48 -xsd_string(c2) | xsd_integer(c2) | -rsymProp(c3,c5). [resolve(37,d,13,a)].
% 0.69/1.02 49 xsd_integer(c2) | rsymProp(c3,c4). [resolve(46,a,15,a),merge(c)].
% 0.69/1.02 50 xsd_integer(c2) | c4 = ia | c4 = ib. [resolve(49,b,25,a),flip(b),flip(c)].
% 0.69/1.02 51 xsd_integer(c2) | c4 != A | rsymProp(c3,A). [resolve(49,b,24,b),flip(b)].
% 0.69/1.02 52 xsd_integer(c2) | c3 != A | rsymProp(A,c4). [resolve(49,b,23,b),flip(b)].
% 0.69/1.02 53 xsd_integer(c2) | rsymProp(c4,c3). [resolve(49,b,18,a)].
% 0.69/1.02 54 xsd_integer(c2) | rsymProp(c4,c5). [resolve(47,a,15,a),merge(c)].
% 0.69/1.02 55 xsd_integer(c2) | c3 = ia | c3 = ib. [resolve(53,b,25,a),flip(b),flip(c)].
% 0.69/1.02 58 xsd_integer(c2) | c5 = ia | c5 = ib. [resolve(54,b,25,a),flip(b),flip(c)].
% 0.69/1.02 60 xsd_integer(c2) | c4 != A | rsymProp(A,c5). [resolve(54,b,23,b),flip(b)].
% 0.69/1.02 65 c4 = ia | c4 = ib | xsd_string(c2) | rsymProp(c3,c4). [resolve(50,a,43,b)].
% 0.69/1.02 68 c3 = ia | c3 = ib | xsd_string(c2) | rsymProp(c3,c4). [resolve(55,a,43,b)].
% 0.69/1.02 70 c5 = ia | c5 = ib | xsd_string(c2) | rsymProp(c4,c5). [resolve(58,a,44,b)].
% 0.69/1.02 77 c4 = ia | c4 = ib | xsd_string(c2). [resolve(65,d,25,a),flip(d),flip(e),merge(d),merge(e)].
% 0.69/1.02 79 c4 = ia | c4 = ib | -xsd_integer(c2). [resolve(77,c,17,a)].
% 0.69/1.02 82 c4 = ia | c4 = ib. [resolve(79,c,50,a),merge(c),merge(d)].
% 0.69/1.02 88 c4 = ia | xsd_integer(c2) | rsymProp(ib,c5). [resolve(82,b,60,b)].
% 0.69/1.02 90 c4 = ia | xsd_integer(c2) | rsymProp(c3,ib). [resolve(82,b,51,b)].
% 0.69/1.02 108 c3 = ia | c3 = ib | xsd_string(c2) | rsymProp(c4,c3). [resolve(68,d,18,a)].
% 0.69/1.02 116 c5 = ia | c5 = ib | xsd_string(c2). [resolve(70,d,25,a),flip(d),flip(e),merge(d),merge(e)].
% 0.69/1.02 118 c5 = ia | c5 = ib | -xsd_integer(c2). [resolve(116,c,17,a)].
% 0.69/1.02 119 c5 = ia | c5 = ib. [resolve(118,c,58,a),merge(c),merge(d)].
% 0.69/1.02 126 c5 = ia | xsd_string(c2) | -xsd_integer(c2) | -rsymProp(c3,ib). [para(119(b,1),45(c,2))].
% 0.69/1.02 127 c5 = ia | -xsd_string(c2) | xsd_integer(c2) | -rsymProp(c3,ib). [para(119(b,1),48(c,2))].
% 0.69/1.02 163 c5 = ia | -xsd_string(c2) | xsd_integer(c2) | c4 = ia. [resolve(127,d,90,c),merge(e)].
% 0.69/1.02 169 c5 = ia | xsd_integer(c2) | c4 = ia. [resolve(163,b,15,a),merge(d)].
% 0.69/1.02 170 c5 = ia | c4 = ia | xsd_string(c2) | rsymProp(c3,c4). [resolve(169,b,43,b)].
% 0.69/1.02 175 c3 = ia | c3 = ib | xsd_string(c2). [resolve(108,d,25,a),flip(d),flip(e),merge(d),merge(e)].
% 0.69/1.02 177 c3 = ia | c3 = ib | -xsd_integer(c2). [resolve(175,c,17,a)].
% 0.69/1.02 179 c3 = ia | c3 = ib. [resolve(177,c,55,a),merge(c),merge(d)].
% 0.69/1.02 181 c3 = ia | xsd_integer(c2) | rsymProp(ib,c4). [resolve(179,b,52,b)].
% 0.69/1.02 195 c3 = ia | xsd_string(c2) | -xsd_integer(c2) | -rsymProp(ib,c5). [para(179(b,1),45(c,1))].
% 0.69/1.02 196 c3 = ia | -xsd_string(c2) | xsd_integer(c2) | -rsymProp(ib,c5). [para(179(b,1),48(c,1))].
% 0.69/1.02 199 c3 = ia | c5 = ia | xsd_string(c2) | -xsd_integer(c2). [para(179(b,1),126(d,1)),unit_del(e,14)].
% 0.69/1.02 200 c3 = ia | c5 = ia | -xsd_string(c2) | xsd_integer(c2). [para(179(b,1),127(d,1)),unit_del(e,14)].
% 0.69/1.02 210 c3 = ia | xsd_integer(c2) | c4 != A | rsymProp(ib,A). [resolve(181,c,24,b),flip(c)].
% 0.69/1.02 226 c3 = ia | -xsd_string(c2) | xsd_integer(c2) | c4 = ia. [resolve(196,d,88,c),merge(e)].
% 0.69/1.02 228 c3 = ia | c5 = ia | xsd_integer(c2). [resolve(200,c,15,a),merge(d)].
% 0.69/1.02 229 c3 = ia | c5 = ia | xsd_string(c2). [resolve(228,c,199,d),merge(c),merge(d)].
% 0.69/1.02 232 c3 = ia | c5 = ia | -xsd_integer(c2). [resolve(229,c,17,a)].
% 0.69/1.02 233 c3 = ia | c5 = ia. [resolve(232,c,228,c),merge(c),merge(d)].
% 0.69/1.02 242 c3 = ia | xsd_string(c2) | -xsd_integer(c2) | -rsymProp(c3,ia). [para(233(b,1),45(c,2))].
% 0.69/1.03 249 c3 = ia | -xsd_string(c2) | xsd_integer(c2) | -rsymProp(ib,ia). [para(233(b,1),196(d,2)),merge(b)].
% 0.69/1.03 265 c3 = ia | xsd_integer(c2) | c4 = ia. [resolve(226,b,15,a),merge(d)].
% 0.69/1.03 266 c3 = ia | c4 = ia | xsd_string(c2) | rsymProp(c4,c5). [resolve(265,b,44,b)].
% 0.69/1.03 271 c4 = ia | c5 = ia | xsd_string(c2) | rsymProp(c3,ib). [para(82(b,1),170(d,2)),merge(c)].
% 0.69/1.03 278 c4 = ia | c3 = ia | xsd_string(c2) | rsymProp(ib,c5). [para(82(b,1),266(d,1)),merge(c)].
% 0.69/1.03 283 c4 = ia | c5 = ia | xsd_string(c2) | -xsd_integer(c2). [resolve(271,d,126,d),merge(d),merge(e)].
% 0.69/1.03 286 c4 = ia | c5 = ia | xsd_string(c2). [resolve(283,d,169,b),merge(d),merge(e)].
% 0.69/1.03 288 c4 = ia | c5 = ia | -xsd_integer(c2). [resolve(286,c,17,a)].
% 0.69/1.03 289 c4 = ia | c5 = ia. [resolve(288,c,169,b),merge(c),merge(d)].
% 0.69/1.03 298 c4 = ia | xsd_string(c2) | -xsd_integer(c2) | -rsymProp(c3,ia). [para(289(b,1),45(c,2))].
% 0.69/1.03 299 c4 = ia | -xsd_string(c2) | xsd_integer(c2) | -rsymProp(c3,ia). [para(289(b,1),48(c,2))].
% 0.69/1.03 326 c4 = ia | c3 = ia | xsd_string(c2) | -xsd_integer(c2). [resolve(278,d,195,d),merge(d),merge(e)].
% 0.69/1.03 329 c4 = ia | c3 = ia | xsd_string(c2). [resolve(326,d,265,b),merge(d),merge(e)].
% 0.69/1.03 331 c4 = ia | c3 = ia | -xsd_integer(c2). [resolve(329,c,17,a)].
% 0.69/1.03 332 c4 = ia | c3 = ia. [resolve(331,c,265,b),merge(c),merge(d)].
% 0.69/1.03 333 c3 = ia | xsd_integer(c2) | rsymProp(ib,ia). [resolve(332,a,210,c),merge(b)].
% 0.69/1.03 363 c3 = ia | xsd_integer(c2) | -xsd_string(c2). [resolve(333,c,249,d),merge(c),merge(e)].
% 0.69/1.03 365 c3 = ia | xsd_integer(c2). [resolve(363,c,15,a),merge(c)].
% 0.69/1.03 366 c3 = ia | xsd_string(c2) | rsymProp(c3,c4). [resolve(365,b,43,b)].
% 0.69/1.03 372 c3 = ia | xsd_string(c2) | rsymProp(c3,ia). [para(332(a,1),366(c,2)),merge(b)].
% 0.69/1.03 380 c3 = ia | xsd_string(c2) | -xsd_integer(c2). [resolve(372,c,242,d),merge(c),merge(d)].
% 0.69/1.03 383 c3 = ia | xsd_string(c2). [resolve(380,c,365,b),merge(c)].
% 0.69/1.03 385 c3 = ia | -xsd_integer(c2). [resolve(383,b,17,a)].
% 0.69/1.03 386 c3 = ia. [resolve(385,b,365,b),merge(b)].
% 0.69/1.03 387 c4 = ia | -xsd_string(c2) | xsd_integer(c2). [back_rewrite(299),rewrite([386(8)]),unit_del(d,13)].
% 0.69/1.03 388 c4 = ia | xsd_string(c2) | -xsd_integer(c2). [back_rewrite(298),rewrite([386(8)]),unit_del(d,13)].
% 0.69/1.03 397 -xsd_string(c2) | xsd_integer(c2) | -rsymProp(ia,c5). [back_rewrite(48),rewrite([386(5)])].
% 0.69/1.03 398 xsd_string(c2) | -xsd_integer(c2) | -rsymProp(ia,c5). [back_rewrite(45),rewrite([386(5)])].
% 0.69/1.03 400 c4 = ia | xsd_integer(c2). [resolve(387,b,15,a),merge(c)].
% 0.69/1.03 403 c4 = ia | xsd_string(c2). [resolve(388,c,400,b),merge(c)].
% 0.69/1.03 405 c4 = ia | -xsd_integer(c2). [resolve(403,b,17,a)].
% 0.69/1.03 406 c4 = ia. [resolve(405,b,400,b),merge(b)].
% 0.69/1.03 418 xsd_integer(c2) | rsymProp(ia,c5). [back_rewrite(54),rewrite([406(3)])].
% 0.69/1.03 419 xsd_string(c2) | -xsd_integer(c2) | rsymProp(ia,c5). [back_rewrite(44),rewrite([406(5)])].
% 0.69/1.03 420 -xsd_string(c2) | xsd_integer(c2). [resolve(397,c,418,b),merge(c)].
% 0.69/1.03 421 xsd_integer(c2). [resolve(420,a,15,a),merge(b)].
% 0.69/1.03 422 xsd_string(c2) | rsymProp(ia,c5). [back_unit_del(419),unit_del(b,421)].
% 0.69/1.03 423 xsd_string(c2) | -rsymProp(ia,c5). [back_unit_del(398),unit_del(b,421)].
% 0.69/1.03 426 -xsd_string(c2). [ur(17,b,421,a)].
% 0.69/1.03 428 -rsymProp(ia,c5). [back_unit_del(423),unit_del(a,426)].
% 0.69/1.03 429 $F. [back_unit_del(422),unit_del(a,426),unit_del(b,428)].
% 0.69/1.03
% 0.69/1.03 % SZS output end Refutation
% 0.69/1.03 ============================== end of proof ==========================
% 0.69/1.03
% 0.69/1.03 ============================== STATISTICS ============================
% 0.69/1.03
% 0.69/1.03 Given=288. Generated=1192. Kept=409. proofs=1.
% 0.69/1.03 Usable=37. Sos=1. Demods=2. Limbo=3, Disabled=390. Hints=0.
% 0.69/1.03 Megabytes=0.25.
% 0.69/1.03 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.69/1.03
% 0.69/1.03 ============================== end of statistics =====================
% 0.69/1.03
% 0.69/1.03 ============================== end of search =========================
% 0.69/1.03
% 0.69/1.03 THEOREM PROVED
% 0.69/1.03 % SZS status Theorem
% 0.69/1.03
% 0.69/1.03 Exiting with 1 proof.
% 0.69/1.03
% 0.69/1.03 Process 3564 exit (max_proofs) Tue Jun 7 15:01:52 2022
% 0.69/1.03 Prover9 interrupted
%------------------------------------------------------------------------------