TSTP Solution File: KRS162+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : KRS162+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 03:25:15 EDT 2022

% Result   : Theorem 0.96s 1.24s
% Output   : Refutation 0.96s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : KRS162+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n024.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 : Tue Jun  7 20:09:04 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.71/1.00  ============================== Prover9 ===============================
% 0.71/1.00  Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.00  Process 23299 was started by sandbox2 on n024.cluster.edu,
% 0.71/1.00  Tue Jun  7 20:09:05 2022
% 0.71/1.00  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23146_n024.cluster.edu".
% 0.71/1.00  ============================== end of head ===========================
% 0.71/1.00  
% 0.71/1.00  ============================== INPUT =================================
% 0.71/1.00  
% 0.71/1.00  % Reading from file /tmp/Prover9_23146_n024.cluster.edu
% 0.71/1.00  
% 0.71/1.00  set(prolog_style_variables).
% 0.71/1.00  set(auto2).
% 0.71/1.00      % set(auto2) -> set(auto).
% 0.71/1.00      % set(auto) -> set(auto_inference).
% 0.71/1.00      % set(auto) -> set(auto_setup).
% 0.71/1.00      % set(auto_setup) -> set(predicate_elim).
% 0.71/1.00      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.00      % set(auto) -> set(auto_limits).
% 0.71/1.00      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.00      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.00      % set(auto) -> set(auto_denials).
% 0.71/1.00      % set(auto) -> set(auto_process).
% 0.71/1.00      % set(auto2) -> assign(new_constants, 1).
% 0.71/1.00      % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.00      % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.00      % set(auto2) -> assign(max_hours, 1).
% 0.71/1.00      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.00      % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.00      % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.00      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.00      % set(auto2) -> set(sort_initial_sos).
% 0.71/1.00      % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.00      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.00      % set(auto2) -> assign(max_megs, 400).
% 0.71/1.00      % set(auto2) -> assign(stats, some).
% 0.71/1.00      % set(auto2) -> clear(echo_input).
% 0.71/1.00      % set(auto2) -> set(quiet).
% 0.71/1.00      % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.00      % set(auto2) -> clear(print_given).
% 0.71/1.00  assign(lrs_ticks,-1).
% 0.71/1.00  assign(sos_limit,10000).
% 0.71/1.00  assign(order,kbo).
% 0.71/1.00  set(lex_order_vars).
% 0.71/1.00  clear(print_given).
% 0.71/1.00  
% 0.71/1.00  % formulas(sos).  % not echoed (20 formulas)
% 0.71/1.00  
% 0.71/1.00  ============================== end of input ==========================
% 0.71/1.00  
% 0.71/1.00  % From the command line: assign(max_seconds, 300).
% 0.71/1.00  
% 0.71/1.00  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.00  
% 0.71/1.00  % Formulas that are not ordinary clauses:
% 0.71/1.00  1 (all A all B (A = B & cA(A) -> cA(B))) # label(cA_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  2 (all A all B (A = B & cB(A) -> cB(B))) # label(cB_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  3 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  4 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  5 (all A all B all C (A = B & rp(A,C) -> rp(B,C))) # label(rp_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  6 (all A all B all C (A = B & rp(C,A) -> rp(C,B))) # label(rp_substitution_2) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  7 (all A all B all C (A = B & rq(A,C) -> rq(B,C))) # label(rq_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  8 (all A all B all C (A = B & rq(C,A) -> rq(C,B))) # label(rq_substitution_2) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  9 (all A all B all C (A = B & rr(A,C) -> rr(B,C))) # label(rr_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  10 (all A all B all C (A = B & rr(C,A) -> rr(C,B))) # label(rr_substitution_2) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  11 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  12 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  13 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  14 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  15 (all X all Y (rp(X,Y) -> cA(Y))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
% 0.71/1.00  16 (all X all Y (rq(X,Y) -> cB(Y))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  17 (all X -(cB(X) & cA(X))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  18 (all X all Y (rq(X,Y) -> rr(X,Y))) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  19 (all X all Y (rp(X,Y) -> rr(X,Y))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  20 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X ((exists Y0 exists Y1 (rp(X,Y0) & rp(X,Y1) & Y0 != Y1)) & (exists Y0 exists Y1 exists Y2 (rq(X,Y0) & rq(X,Y1) & rq(X,Y2) & Y0 != Y1 & Y0 != Y2 & Y1 != Y2)) -> (exists Y0 exists Y1 exists Y2 exists Y3 exists Y4 (rr(X,Y0) & rr(X,Y1) & rr(X,Y2) & rr(X,Y3) & rr(X,Y4) & Y0 != Y1 & Y0 != Y2 & Y0 != Y3 & Y0 != Y4 & Y1 != Y2 & Y1 != Y3 & Y1 != Y4 & Y2 != Y3 & Y2 != Y4 & Y3 != Y4))))) # label(the_axiom) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.96/1.24  
% 0.96/1.24  ============================== end of process non-clausal formulas ===
% 0.96/1.24  
% 0.96/1.24  ============================== PROCESS INITIAL CLAUSES ===============
% 0.96/1.24  
% 0.96/1.24  ============================== PREDICATE ELIMINATION =================
% 0.96/1.24  
% 0.96/1.24  ============================== end predicate elimination =============
% 0.96/1.24  
% 0.96/1.24  Auto_denials:  (non-Horn, no changes).
% 0.96/1.24  
% 0.96/1.24  Term ordering decisions:
% 0.96/1.24  Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1.
% 0.96/1.24  
% 0.96/1.24  ============================== end of process initial clauses ========
% 0.96/1.24  
% 0.96/1.24  ============================== CLAUSES FOR SEARCH ====================
% 0.96/1.24  
% 0.96/1.24  ============================== end of clauses for search =============
% 0.96/1.24  
% 0.96/1.24  ============================== SEARCH ================================
% 0.96/1.24  
% 0.96/1.24  % Starting search at 0.02 seconds.
% 0.96/1.24  
% 0.96/1.24  ============================== PROOF =================================
% 0.96/1.24  % SZS status Theorem
% 0.96/1.24  % SZS output start Refutation
% 0.96/1.24  
% 0.96/1.24  % Proof 1 at 0.23 (+ 0.01) seconds.
% 0.96/1.24  % Length of proof is 193.
% 0.96/1.24  % Level of proof is 94.
% 0.96/1.24  % Maximum clause weight is 76.000.
% 0.96/1.24  % Given clauses 378.
% 0.96/1.24  
% 0.96/1.24  1 (all A all B (A = B & cA(A) -> cA(B))) # label(cA_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  13 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  14 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  15 (all X all Y (rp(X,Y) -> cA(Y))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  16 (all X all Y (rq(X,Y) -> cB(Y))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  17 (all X -(cB(X) & cA(X))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  18 (all X all Y (rq(X,Y) -> rr(X,Y))) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  19 (all X all Y (rp(X,Y) -> rr(X,Y))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
% 0.96/1.24  20 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X ((exists Y0 exists Y1 (rp(X,Y0) & rp(X,Y1) & Y0 != Y1)) & (exists Y0 exists Y1 exists Y2 (rq(X,Y0) & rq(X,Y1) & rq(X,Y2) & Y0 != Y1 & Y0 != Y2 & Y1 != Y2)) -> (exists Y0 exists Y1 exists Y2 exists Y3 exists Y4 (rr(X,Y0) & rr(X,Y1) & rr(X,Y2) & rr(X,Y3) & rr(X,Y4) & Y0 != Y1 & Y0 != Y2 & Y0 != Y3 & Y0 != Y4 & Y1 != Y2 & Y1 != Y3 & Y1 != Y4 & Y2 != Y3 & Y2 != Y4 & Y3 != Y4))))) # label(the_axiom) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.96/1.24  21 cowlThing(A) # label(axiom_0) # label(axiom).  [clausify(13)].
% 0.96/1.24  22 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom).  [clausify(14)].
% 0.96/1.24  23 -cowlNothing(A) # label(axiom_0) # label(axiom).  [clausify(13)].
% 0.96/1.24  24 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom).  [clausify(14)].
% 0.96/1.24  25 -cB(A) | -cA(A) # label(axiom_4) # label(axiom).  [clausify(17)].
% 0.96/1.24  26 -rp(A,B) | cA(B) # label(axiom_2) # label(axiom).  [clausify(15)].
% 0.96/1.24  27 -rq(A,B) | cB(B) # label(axiom_3) # label(axiom).  [clausify(16)].
% 0.96/1.24  28 -rq(A,B) | rr(A,B) # label(axiom_5) # label(axiom).  [clausify(18)].
% 0.96/1.24  29 -rp(A,B) | rr(A,B) # label(axiom_6) # label(axiom).  [clausify(19)].
% 0.96/1.24  30 A != B | -cA(B) | cA(A) # label(cA_substitution_1) # label(axiom).  [clausify(1)].
% 0.96/1.24  42 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rp(c3,c4) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  43 xsd_string(c2) | -xsd_integer(c2) | rp(c3,c4).  [copy(42),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  44 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rp(c3,c5) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  45 xsd_string(c2) | -xsd_integer(c2) | rp(c3,c5).  [copy(44),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  46 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | c5 != c4 # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  47 xsd_string(c2) | -xsd_integer(c2) | c5 != c4.  [copy(46),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  48 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rq(c3,c6) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  49 xsd_string(c2) | -xsd_integer(c2) | rq(c3,c6).  [copy(48),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  50 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rq(c3,c7) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  51 xsd_string(c2) | -xsd_integer(c2) | rq(c3,c7).  [copy(50),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  52 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | rq(c3,c8) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  53 xsd_string(c2) | -xsd_integer(c2) | rq(c3,c8).  [copy(52),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  54 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | c7 != c6 # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  55 xsd_string(c2) | -xsd_integer(c2) | c7 != c6.  [copy(54),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  56 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | c8 != c6 # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  57 xsd_string(c2) | -xsd_integer(c2) | c8 != c6.  [copy(56),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  58 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | c8 != c7 # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  59 xsd_string(c2) | -xsd_integer(c2) | c8 != c7.  [copy(58),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  60 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rp(c3,c4) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  61 -xsd_string(c2) | xsd_integer(c2) | rp(c3,c4).  [copy(60),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  62 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rp(c3,c5) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  63 -xsd_string(c2) | xsd_integer(c2) | rp(c3,c5).  [copy(62),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  64 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | c5 != c4 # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  65 -xsd_string(c2) | xsd_integer(c2) | c5 != c4.  [copy(64),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  66 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rq(c3,c6) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  67 -xsd_string(c2) | xsd_integer(c2) | rq(c3,c6).  [copy(66),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  68 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rq(c3,c7) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  69 -xsd_string(c2) | xsd_integer(c2) | rq(c3,c7).  [copy(68),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  70 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | rq(c3,c8) # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  71 -xsd_string(c2) | xsd_integer(c2) | rq(c3,c8).  [copy(70),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  72 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | c7 != c6 # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  73 -xsd_string(c2) | xsd_integer(c2) | c7 != c6.  [copy(72),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  74 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | c8 != c6 # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  75 -xsd_string(c2) | xsd_integer(c2) | c8 != c6.  [copy(74),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  76 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | c8 != c7 # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  77 -xsd_string(c2) | xsd_integer(c2) | c8 != c7.  [copy(76),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  78 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rr(c3,A) | -rr(c3,B) | -rr(c3,C) | -rr(c3,D) | -rr(c3,E) | B = A | C = A | D = A | E = A | C = B | D = B | E = B | D = C | E = C | E = D # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  79 xsd_string(c2) | -xsd_integer(c2) | -rr(c3,A) | -rr(c3,B) | -rr(c3,C) | -rr(c3,D) | -rr(c3,E) | B = A | C = A | D = A | E = A | C = B | D = B | E = B | D = C | E = C | E = D.  [copy(78),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  80 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rr(c3,A) | -rr(c3,B) | -rr(c3,C) | -rr(c3,D) | -rr(c3,E) | B = A | C = A | D = A | E = A | C = B | D = B | E = B | D = C | E = C | E = D # label(the_axiom) # label(negated_conjecture).  [clausify(20)].
% 0.96/1.24  81 -xsd_string(c2) | xsd_integer(c2) | -rr(c3,A) | -rr(c3,B) | -rr(c3,C) | -rr(c3,D) | -rr(c3,E) | B = A | C = A | D = A | E = A | C = B | D = B | E = B | D = C | E = C | E = D.  [copy(80),unit_del(a,21),unit_del(b,23)].
% 0.96/1.24  83 xsd_integer(c2) | rp(c3,c4).  [resolve(61,a,22,a),merge(c)].
% 0.96/1.24  84 xsd_integer(c2) | rp(c3,c5).  [resolve(63,a,22,a),merge(c)].
% 0.96/1.24  85 xsd_integer(c2) | c5 != c4.  [resolve(65,a,22,a),merge(c)].
% 0.96/1.24  86 xsd_integer(c2) | rq(c3,c6).  [resolve(67,a,22,a),merge(c)].
% 0.96/1.24  87 xsd_integer(c2) | rq(c3,c7).  [resolve(69,a,22,a),merge(c)].
% 0.96/1.24  88 xsd_integer(c2) | rq(c3,c8).  [resolve(71,a,22,a),merge(c)].
% 0.96/1.24  89 xsd_integer(c2) | c7 != c6.  [resolve(73,a,22,a),merge(c)].
% 0.96/1.24  90 xsd_integer(c2) | c8 != c6.  [resolve(75,a,22,a),merge(c)].
% 0.96/1.24  91 xsd_integer(c2) | c8 != c7.  [resolve(77,a,22,a),merge(c)].
% 0.96/1.24  94 xsd_integer(c2) | rr(c3,c4).  [resolve(83,b,29,a)].
% 0.96/1.24  95 xsd_integer(c2) | cA(c4).  [resolve(83,b,26,a)].
% 0.96/1.24  96 xsd_integer(c2) | c4 != A | cA(A).  [resolve(95,b,30,b),flip(b)].
% 0.96/1.24  99 xsd_integer(c2) | rr(c3,c5).  [resolve(84,b,29,a)].
% 0.96/1.24  100 xsd_integer(c2) | cA(c5).  [resolve(84,b,26,a)].
% 0.96/1.24  101 xsd_integer(c2) | c5 != A | cA(A).  [resolve(100,b,30,b),flip(b)].
% 0.96/1.24  104 xsd_integer(c2) | rr(c3,c6).  [resolve(86,b,28,a)].
% 0.96/1.24  105 xsd_integer(c2) | cB(c6).  [resolve(86,b,27,a)].
% 0.96/1.24  107 xsd_integer(c2) | -cA(c6).  [resolve(105,b,25,a)].
% 0.96/1.24  110 xsd_integer(c2) | rr(c3,c7).  [resolve(87,b,28,a)].
% 0.96/1.24  111 xsd_integer(c2) | cB(c7).  [resolve(87,b,27,a)].
% 0.96/1.24  114 xsd_integer(c2) | rr(c3,c8).  [resolve(88,b,28,a)].
% 0.96/1.24  115 xsd_integer(c2) | cB(c8).  [resolve(88,b,27,a)].
% 0.96/1.24  117 xsd_integer(c2) | -cA(c7).  [resolve(111,b,25,a)].
% 0.96/1.24  119 xsd_integer(c2) | -cA(c8).  [resolve(115,b,25,a)].
% 0.96/1.24  120 xsd_integer(c2) | -xsd_string(c2) | -rr(c3,A) | -rr(c3,B) | -rr(c3,C) | -rr(c3,D) | B = A | C = A | D = A | c4 = A | C = B | D = B | c4 = B | D = C | c4 = C | c4 = D.  [resolve(94,b,81,g),merge(c)].
% 0.96/1.24  135 xsd_integer(c2) | -xsd_string(c2) | -rr(c3,A) | -rr(c3,B) | -rr(c3,C) | c8 = A | c8 = B | c8 = C | c8 = c4 | B = A | C = A | c4 = A | C = B | c4 = B | c4 = C.  [resolve(120,c,114,b),flip(f),flip(g),flip(h),flip(i),merge(p)].
% 0.96/1.24  144 xsd_integer(c2) | -xsd_string(c2) | -rr(c3,A) | -rr(c3,B) | c8 = c7 | c8 = A | c8 = B | c8 = c4 | c7 = A | c7 = B | c7 = c4 | B = A | c4 = A | c4 = B.  [resolve(135,c,110,b),flip(i),flip(j),flip(k),merge(o)].
% 0.96/1.24  147 xsd_integer(c2) | -xsd_string(c2) | -rr(c3,A) | c8 = c7 | c8 = c6 | c8 = A | c8 = c4 | c7 = c6 | c7 = A | c7 = c4 | c6 = A | c6 = c4 | c4 = A.  [resolve(144,c,104,b),flip(k),flip(l),merge(n)].
% 0.96/1.24  149 xsd_integer(c2) | -xsd_string(c2) | c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(147,c,99,b),flip(l),merge(m)].
% 0.96/1.24  150 xsd_integer(c2) | c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(149,b,22,a),merge(l)].
% 0.96/1.24  152 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rq(c3,c8).  [resolve(150,a,53,b)].
% 0.96/1.24  153 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rq(c3,c7).  [resolve(150,a,51,b)].
% 0.96/1.24  154 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rq(c3,c6).  [resolve(150,a,49,b)].
% 0.96/1.24  155 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rp(c3,c5).  [resolve(150,a,45,b)].
% 0.96/1.24  156 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rp(c3,c4).  [resolve(150,a,43,b)].
% 0.96/1.24  160 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rr(c3,c8).  [resolve(152,l,28,a)].
% 0.96/1.24  166 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rr(c3,c7).  [resolve(153,l,28,a)].
% 0.96/1.24  172 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rr(c3,c6).  [resolve(154,l,28,a)].
% 0.96/1.24  180 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rr(c3,c5).  [resolve(155,l,29,a)].
% 0.96/1.24  186 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rr(c3,c4).  [resolve(156,l,29,a)].
% 0.96/1.24  189 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -xsd_integer(c2) | -rr(c3,A) | -rr(c3,B) | -rr(c3,C) | -rr(c3,D) | B = A | C = A | D = A | c8 = A | C = B | D = B | c8 = B | D = C | c8 = C | c8 = D.  [resolve(160,l,79,g),merge(l)].
% 0.96/1.24  276 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -xsd_integer(c2) | -rr(c3,A) | -rr(c3,B) | -rr(c3,C) | c4 = A | c4 = B | c4 = C | B = A | C = A | c8 = A | C = B | c8 = B | c8 = C.  [resolve(189,m,186,l),flip(p),flip(q),flip(r),merge(s),merge(z),merge(A),merge(B),merge(C),merge(D),merge(E),merge(F),merge(G),merge(H),merge(I),merge(J)].
% 0.96/1.24  280 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -xsd_integer(c2) | -rr(c3,c7) | -rr(c3,A) | -rr(c3,B) | c4 = A | c4 = B | c7 = A | c7 = B | B = A | c8 = A | c8 = B.  [factor(276,a,u),flip(p),flip(s),flip(t),merge(p)].
% 0.96/1.24  304 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -xsd_integer(c2) | -rr(c3,c7) | -rr(c3,c5) | -rr(c3,c6).  [factor(280,h,t),flip(p),flip(q),merge(p),merge(q),merge(r),merge(s),merge(t),merge(u)].
% 0.96/1.24  329 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -xsd_integer(c2) | -rr(c3,c5) | -rr(c3,c6).  [resolve(304,m,166,l),merge(o),merge(p),merge(q),merge(r),merge(s),merge(t),merge(u),merge(v),merge(w),merge(x),merge(y)].
% 0.96/1.24  330 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -xsd_integer(c2) | -rr(c3,c5).  [resolve(329,n,172,l),merge(n),merge(o),merge(p),merge(q),merge(r),merge(s),merge(t),merge(u),merge(v),merge(w),merge(x)].
% 0.96/1.24  331 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -xsd_integer(c2).  [resolve(330,m,180,l),merge(m),merge(n),merge(o),merge(p),merge(q),merge(r),merge(s),merge(t),merge(u),merge(v),merge(w)].
% 0.96/1.24  332 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(331,l,150,a),merge(l),merge(m),merge(n),merge(o),merge(p),merge(q),merge(r),merge(s),merge(t),merge(u)].
% 0.96/1.24  334 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(332,k,24,a)].
% 0.96/1.24  335 c8 = c7 | c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(334,k,150,a),merge(k),merge(l),merge(m),merge(n),merge(o),merge(p),merge(q),merge(r),merge(s),merge(t)].
% 0.96/1.24  336 c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2).  [resolve(335,a,91,b)].
% 0.96/1.24  339 c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | c8 != c7.  [resolve(336,j,59,b)].
% 0.96/1.24  350 c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(339,k,335,a),merge(k),merge(l),merge(m),merge(n),merge(o),merge(p),merge(q),merge(r),merge(s)].
% 0.96/1.24  352 c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(350,j,24,a)].
% 0.96/1.24  353 c8 = c6 | c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(352,j,336,j),merge(j),merge(k),merge(l),merge(m),merge(n),merge(o),merge(p),merge(q),merge(r)].
% 0.96/1.24  354 c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2).  [resolve(353,a,90,b)].
% 0.96/1.24  358 c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | c8 != c6.  [resolve(354,i,57,b)].
% 0.96/1.24  369 c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(358,j,353,a),merge(j),merge(k),merge(l),merge(m),merge(n),merge(o),merge(p),merge(q)].
% 0.96/1.24  371 c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(369,i,24,a)].
% 0.96/1.24  372 c8 = c5 | c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(371,i,354,i),merge(i),merge(j),merge(k),merge(l),merge(m),merge(n),merge(o),merge(p)].
% 0.96/1.24  376 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2) | cA(c8).  [resolve(372,a,101,b(flip))].
% 0.96/1.24  385 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2).  [resolve(376,i,119,b),merge(i)].
% 0.96/1.24  388 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rq(c3,c8).  [resolve(385,h,53,b)].
% 0.96/1.24  391 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rp(c3,c5).  [resolve(385,h,45,b)].
% 0.96/1.24  400 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | cB(c8).  [resolve(388,i,27,a)].
% 0.96/1.24  403 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c8).  [resolve(400,i,25,a)].
% 0.96/1.24  405 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c5).  [para(372(a,1),403(i,1)),merge(h),merge(i),merge(j),merge(k),merge(l),merge(m),merge(n)].
% 0.96/1.24  422 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | cA(c5).  [resolve(391,i,26,a)].
% 0.96/1.24  423 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(422,i,405,i),merge(i),merge(j),merge(k),merge(l),merge(m),merge(n),merge(o),merge(p)].
% 0.96/1.24  425 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(423,h,24,a)].
% 0.96/1.24  426 c8 = c4 | c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(425,h,385,h),merge(h),merge(i),merge(j),merge(k),merge(l),merge(m),merge(n)].
% 0.96/1.24  430 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2) | cA(c8).  [resolve(426,a,96,b(flip))].
% 0.96/1.24  438 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2).  [resolve(430,h,119,b),merge(h)].
% 0.96/1.24  441 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rq(c3,c8).  [resolve(438,g,53,b)].
% 0.96/1.24  445 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rp(c3,c4).  [resolve(438,g,43,b)].
% 0.96/1.24  453 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | cB(c8).  [resolve(441,h,27,a)].
% 0.96/1.24  456 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c8).  [resolve(453,h,25,a)].
% 0.96/1.24  458 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c4).  [para(426(a,1),456(h,1)),merge(g),merge(h),merge(i),merge(j),merge(k),merge(l)].
% 0.96/1.24  480 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | cA(c4).  [resolve(445,h,26,a)].
% 0.96/1.24  481 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(480,h,458,h),merge(h),merge(i),merge(j),merge(k),merge(l),merge(m),merge(n)].
% 0.96/1.24  483 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(481,g,24,a)].
% 0.96/1.24  484 c7 = c6 | c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(483,g,438,g),merge(g),merge(h),merge(i),merge(j),merge(k),merge(l)].
% 0.96/1.24  485 c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2).  [resolve(484,a,89,b)].
% 0.96/1.24  490 c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | c7 != c6.  [resolve(485,f,55,b)].
% 0.96/1.24  501 c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(490,g,484,a),merge(g),merge(h),merge(i),merge(j),merge(k)].
% 0.96/1.24  503 c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(501,f,24,a)].
% 0.96/1.24  504 c7 = c5 | c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(503,f,485,f),merge(f),merge(g),merge(h),merge(i),merge(j)].
% 0.96/1.24  508 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2) | cA(c7).  [resolve(504,a,101,b(flip))].
% 0.96/1.24  517 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2).  [resolve(508,f,117,b),merge(f)].
% 0.96/1.24  522 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rq(c3,c7).  [resolve(517,e,51,b)].
% 0.96/1.24  524 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rp(c3,c5).  [resolve(517,e,45,b)].
% 0.96/1.24  540 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | cB(c7).  [resolve(522,f,27,a)].
% 0.96/1.24  543 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c7).  [resolve(540,f,25,a)].
% 0.96/1.24  545 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c5).  [para(504(a,1),543(f,1)),merge(e),merge(f),merge(g),merge(h)].
% 0.96/1.24  556 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | cA(c5).  [resolve(524,f,26,a)].
% 0.96/1.24  557 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(556,f,545,f),merge(f),merge(g),merge(h),merge(i),merge(j)].
% 0.96/1.24  559 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(557,e,24,a)].
% 0.96/1.24  560 c7 = c4 | c6 = c5 | c6 = c4 | c5 = c4.  [resolve(559,e,517,e),merge(e),merge(f),merge(g),merge(h)].
% 0.96/1.24  564 c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2) | cA(c7).  [resolve(560,a,96,b(flip))].
% 0.96/1.24  574 c6 = c5 | c6 = c4 | c5 = c4 | xsd_integer(c2).  [resolve(564,e,117,b),merge(e)].
% 0.96/1.24  579 c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rq(c3,c7).  [resolve(574,d,51,b)].
% 0.96/1.24  582 c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | rp(c3,c4).  [resolve(574,d,43,b)].
% 0.96/1.24  597 c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | cB(c7).  [resolve(579,e,27,a)].
% 0.96/1.24  604 c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c7).  [resolve(597,e,25,a)].
% 0.96/1.24  608 c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c4).  [para(560(a,1),604(e,1)),merge(d),merge(e),merge(f)].
% 0.96/1.24  618 c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2) | cA(c4).  [resolve(582,e,26,a)].
% 0.96/1.24  619 c6 = c5 | c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(618,e,608,e),merge(e),merge(f),merge(g),merge(h)].
% 0.96/1.24  621 c6 = c5 | c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(619,d,24,a)].
% 0.96/1.24  622 c6 = c5 | c6 = c4 | c5 = c4.  [resolve(621,d,574,d),merge(d),merge(e),merge(f)].
% 0.96/1.24  626 c6 = c4 | c5 = c4 | xsd_integer(c2) | cA(c6).  [resolve(622,a,101,b(flip))].
% 0.96/1.24  636 c6 = c4 | c5 = c4 | xsd_integer(c2).  [resolve(626,d,107,b),merge(d)].
% 0.96/1.24  642 c6 = c4 | c5 = c4 | xsd_string(c2) | rq(c3,c6).  [resolve(636,c,49,b)].
% 0.96/1.24  643 c6 = c4 | c5 = c4 | xsd_string(c2) | rp(c3,c5).  [resolve(636,c,45,b)].
% 0.96/1.24  664 c6 = c4 | c5 = c4 | xsd_string(c2) | cB(c6).  [resolve(642,d,27,a)].
% 0.96/1.24  669 c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c6).  [resolve(664,d,25,a)].
% 0.96/1.24  671 c6 = c4 | c5 = c4 | xsd_string(c2) | -cA(c5).  [para(622(a,1),669(d,1)),merge(c),merge(d)].
% 0.96/1.24  675 c6 = c4 | c5 = c4 | xsd_string(c2) | cA(c5).  [resolve(643,d,26,a)].
% 0.96/1.24  677 c6 = c4 | c5 = c4 | xsd_string(c2).  [resolve(675,d,671,d),merge(d),merge(e),merge(f)].
% 0.96/1.24  679 c6 = c4 | c5 = c4 | -xsd_integer(c2).  [resolve(677,c,24,a)].
% 0.96/1.24  680 c6 = c4 | c5 = c4.  [resolve(679,c,636,c),merge(c),merge(d)].
% 0.96/1.24  684 c5 = c4 | xsd_integer(c2) | cA(c6).  [resolve(680,a,96,b(flip))].
% 0.96/1.24  695 c5 = c4 | xsd_integer(c2).  [resolve(684,c,107,b),merge(c)].
% 0.96/1.24  701 c5 = c4 | xsd_string(c2) | rq(c3,c6).  [resolve(695,b,49,b)].
% 0.96/1.24  703 c5 = c4 | xsd_string(c2) | rp(c3,c4).  [resolve(695,b,43,b)].
% 0.96/1.24  725 c5 = c4 | xsd_string(c2) | cB(c6).  [resolve(701,c,27,a)].
% 0.96/1.24  728 c5 = c4 | xsd_string(c2) | -cA(c6).  [resolve(725,c,25,a)].
% 0.96/1.24  730 c5 = c4 | xsd_string(c2) | -cA(c4).  [para(680(a,1),728(c,1)),merge(b)].
% 0.96/1.24  740 c5 = c4 | xsd_string(c2) | cA(c4).  [resolve(703,c,26,a)].
% 0.96/1.24  741 c5 = c4 | xsd_string(c2).  [resolve(740,c,730,c),merge(c),merge(d)].
% 0.96/1.24  743 c5 = c4 | -xsd_integer(c2).  [resolve(741,b,24,a)].
% 0.96/1.24  744 c5 = c4.  [resolve(743,b,695,b),merge(b)].
% 0.96/1.24  745 xsd_integer(c2).  [back_rewrite(85),rewrite([744(3)]),xx(b)].
% 0.96/1.24  746 xsd_string(c2).  [back_rewrite(47),rewrite([744(5)]),xx(c),unit_del(b,745)].
% 0.96/1.24  748 $F.  [ur(24,b,745,a),unit_del(a,746)].
% 0.96/1.24  
% 0.96/1.24  % SZS output end Refutation
% 0.96/1.24  ============================== end of proof ==========================
% 0.96/1.24  
% 0.96/1.24  ============================== STATISTICS ============================
% 0.96/1.24  
% 0.96/1.24  Given=378. Generated=6730. Kept=705. proofs=1.
% 0.96/1.24  Usable=21. Sos=2. Demods=1. Limbo=1, Disabled=722. Hints=0.
% 0.96/1.24  Megabytes=0.79.
% 0.96/1.24  User_CPU=0.24, System_CPU=0.01, Wall_clock=0.
% 0.96/1.24  
% 0.96/1.24  ============================== end of statistics =====================
% 0.96/1.24  
% 0.96/1.24  ============================== end of search =========================
% 0.96/1.24  
% 0.96/1.24  THEOREM PROVED
% 0.96/1.24  % SZS status Theorem
% 0.96/1.24  
% 0.96/1.24  Exiting with 1 proof.
% 0.96/1.24  
% 0.96/1.24  Process 23299 exit (max_proofs) Tue Jun  7 20:09:05 2022
% 0.96/1.24  Prover9 interrupted
%------------------------------------------------------------------------------