TSTP Solution File: SWW449-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWW449-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n023.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 : Thu Jul 21 01:17:02 EDT 2022

% Result   : Unsatisfiable 9.52s 9.89s
% Output   : Refutation 9.61s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SWW449-1 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.15  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.36  % Computer : n023.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sun Jun  5 15:13:54 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 9.52/9.89  ============================== Prover9 ===============================
% 9.52/9.89  Prover9 (32) version 2009-11A, November 2009.
% 9.52/9.89  Process 13419 was started by sandbox2 on n023.cluster.edu,
% 9.52/9.89  Sun Jun  5 15:13:55 2022
% 9.52/9.89  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13265_n023.cluster.edu".
% 9.52/9.89  ============================== end of head ===========================
% 9.52/9.89  
% 9.52/9.89  ============================== INPUT =================================
% 9.52/9.89  
% 9.52/9.89  % Reading from file /tmp/Prover9_13265_n023.cluster.edu
% 9.52/9.89  
% 9.52/9.89  set(prolog_style_variables).
% 9.52/9.89  set(auto2).
% 9.52/9.89      % set(auto2) -> set(auto).
% 9.52/9.89      % set(auto) -> set(auto_inference).
% 9.52/9.89      % set(auto) -> set(auto_setup).
% 9.52/9.89      % set(auto_setup) -> set(predicate_elim).
% 9.52/9.89      % set(auto_setup) -> assign(eq_defs, unfold).
% 9.52/9.89      % set(auto) -> set(auto_limits).
% 9.52/9.89      % set(auto_limits) -> assign(max_weight, "100.000").
% 9.52/9.89      % set(auto_limits) -> assign(sos_limit, 20000).
% 9.52/9.89      % set(auto) -> set(auto_denials).
% 9.52/9.89      % set(auto) -> set(auto_process).
% 9.52/9.89      % set(auto2) -> assign(new_constants, 1).
% 9.52/9.89      % set(auto2) -> assign(fold_denial_max, 3).
% 9.52/9.89      % set(auto2) -> assign(max_weight, "200.000").
% 9.52/9.89      % set(auto2) -> assign(max_hours, 1).
% 9.52/9.89      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 9.52/9.89      % set(auto2) -> assign(max_seconds, 0).
% 9.52/9.89      % set(auto2) -> assign(max_minutes, 5).
% 9.52/9.89      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 9.52/9.89      % set(auto2) -> set(sort_initial_sos).
% 9.52/9.89      % set(auto2) -> assign(sos_limit, -1).
% 9.52/9.89      % set(auto2) -> assign(lrs_ticks, 3000).
% 9.52/9.89      % set(auto2) -> assign(max_megs, 400).
% 9.52/9.89      % set(auto2) -> assign(stats, some).
% 9.52/9.89      % set(auto2) -> clear(echo_input).
% 9.52/9.89      % set(auto2) -> set(quiet).
% 9.52/9.89      % set(auto2) -> clear(print_initial_clauses).
% 9.52/9.89      % set(auto2) -> clear(print_given).
% 9.52/9.89  assign(lrs_ticks,-1).
% 9.52/9.89  assign(sos_limit,10000).
% 9.52/9.89  assign(order,kbo).
% 9.52/9.89  set(lex_order_vars).
% 9.52/9.89  clear(print_given).
% 9.52/9.89  
% 9.52/9.89  % formulas(sos).  % not echoed (13 formulas)
% 9.52/9.89  
% 9.52/9.89  ============================== end of input ==========================
% 9.52/9.89  
% 9.52/9.89  % From the command line: assign(max_seconds, 300).
% 9.52/9.89  
% 9.52/9.89  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 9.52/9.89  
% 9.52/9.89  % Formulas that are not ordinary clauses:
% 9.52/9.89  
% 9.52/9.89  ============================== end of process non-clausal formulas ===
% 9.52/9.89  
% 9.52/9.89  ============================== PROCESS INITIAL CLAUSES ===============
% 9.52/9.89  
% 9.52/9.89  ============================== PREDICATE ELIMINATION =================
% 9.52/9.89  
% 9.52/9.89  ============================== end predicate elimination =============
% 9.52/9.89  
% 9.52/9.89  Auto_denials:  (non-Horn, no changes).
% 9.52/9.89  
% 9.52/9.89  Term ordering decisions:
% 9.52/9.89  Function symbol KB weights:  x11=1. nil=1. x1=1. x3=1. x2=1. x6=1. x9=1. emp=1. x10=1. x4=1. x5=1. x7=1. x8=1. sep=1. lseg=1. next=1.
% 9.52/9.89  
% 9.52/9.89  ============================== end of process initial clauses ========
% 9.52/9.89  
% 9.52/9.89  ============================== CLAUSES FOR SEARCH ====================
% 9.52/9.89  
% 9.52/9.89  ============================== end of clauses for search =============
% 9.52/9.89  
% 9.52/9.89  ============================== SEARCH ================================
% 9.52/9.89  
% 9.52/9.89  % Starting search at 0.01 seconds.
% 9.52/9.89  
% 9.52/9.89  Low Water (keep): wt=40.000, iters=3452
% 9.52/9.89  
% 9.52/9.89  Low Water (keep): wt=38.000, iters=3334
% 9.52/9.89  
% 9.52/9.89  Low Water (keep): wt=36.000, iters=3336
% 9.52/9.89  
% 9.52/9.89  Low Water (keep): wt=34.000, iters=3334
% 9.52/9.89  
% 9.52/9.89  Low Water (keep): wt=32.000, iters=3334
% 9.52/9.89  
% 9.52/9.89  Low Water (keep): wt=30.000, iters=3334
% 9.52/9.89  
% 9.52/9.89  ============================== PROOF =================================
% 9.52/9.89  % SZS status Unsatisfiable
% 9.52/9.89  % SZS output start Refutation
% 9.52/9.89  
% 9.52/9.89  % Proof 1 at 8.78 (+ 0.06) seconds.
% 9.52/9.89  % Length of proof is 70.
% 9.52/9.89  % Level of proof is 33.
% 9.52/9.89  % Maximum clause weight is 58.000.
% 9.52/9.89  % Given clauses 2255.
% 9.52/9.89  
% 9.52/9.89  1 sep(lseg(A,A),B) = B # label(normalization) # label(axiom).  [assumption].
% 9.52/9.89  2 sep(A,sep(B,C)) = sep(B,sep(A,C)) # label(associative_commutative) # label(axiom).  [assumption].
% 9.52/9.89  3 heap(sep(next(x1,x11),sep(next(x3,x1),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x8,x3),sep(next(x5,x11),sep(lseg(x7,x9),sep(next(x11,x3),sep(next(x2,x11),sep(lseg(x10,x11),emp)))))))))))) # label(premise_1) # label(hypothesis).  [assumption].
% 9.52/9.89  4 heap(sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x11,x3),sep(next(x1,x11),sep(next(x3,x1),sep(next(x2,x11),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))).  [copy(3),rewrite([2(36),2(37),2(38),2(39),2(38),2(37),2(36),2(40),2(39),2(38),2(37),2(36),2(41),2(40),2(39),2(38),2(42),2(41),2(40),2(39),2(43),2(42),2(41),2(40),2(44),2(43),2(42),2(45),2(44),2(43)])].
% 9.52/9.89  6 -heap(sep(next(A,B),sep(next(A,C),D))) # label(wellformedness_3) # label(axiom).  [assumption].
% 9.52/9.89  7 -heap(sep(lseg(x8,x3),sep(lseg(x7,x9),sep(lseg(x3,x1),sep(lseg(x4,x1),sep(lseg(x9,x11),sep(lseg(x10,x11),sep(lseg(x5,x11),sep(lseg(x1,x3),emp))))))))) # label(conclusion_1) # label(negated_conjecture).  [assumption].
% 9.52/9.89  8 -heap(sep(lseg(x1,x3),sep(lseg(x3,x1),sep(lseg(x9,x11),sep(lseg(x10,x11),sep(lseg(x4,x1),sep(lseg(x5,x11),sep(lseg(x7,x9),sep(lseg(x8,x3),emp))))))))).  [copy(7),rewrite([2(27),2(28),2(29),2(30),2(29),2(28),2(31),2(32),2(31),2(30),2(29),2(28),2(27),2(33),2(32),2(31),2(30),2(29),2(28),2(27)])].
% 9.52/9.89  14 -heap(sep(next(A,B),sep(lseg(B,C),D))) | A = B | heap(sep(lseg(A,C),D)) # label(unfolding_2) # label(axiom).  [assumption].
% 9.52/9.89  16 -heap(sep(lseg(A,B),sep(lseg(B,C),sep(lseg(C,D),E)))) | C = D | heap(sep(lseg(A,C),sep(lseg(C,D),E))) # label(unfolding_5) # label(axiom).  [assumption].
% 9.52/9.89  19 -heap(sep(A,sep(next(B,C),sep(next(B,D),E)))).  [para(2(a,1),6(a,1,2)),rewrite([2(5)])].
% 9.52/9.89  27 -heap(sep(next(A,B),C)) | A = B | heap(sep(lseg(A,B),C)).  [para(1(a,1),14(a,1,2))].
% 9.52/9.89  34 -heap(sep(lseg(A,B),sep(lseg(C,D),sep(lseg(B,C),E)))) | C = D | heap(sep(lseg(A,C),sep(lseg(C,D),E))).  [para(2(a,1),16(a,1,2))].
% 9.52/9.89  35 -heap(sep(lseg(A,B),sep(lseg(C,A),sep(lseg(B,D),E)))) | B = D | heap(sep(lseg(C,B),sep(lseg(B,D),E))).  [para(2(a,1),16(a,1))].
% 9.52/9.89  43 -heap(sep(A,sep(B,sep(next(C,D),sep(next(C,E),F))))).  [para(2(a,1),19(a,1,2,2)),rewrite([2(5)])].
% 9.52/9.89  49 -heap(sep(A,sep(B,sep(C,sep(next(D,E),sep(next(D,F),V6)))))).  [para(2(a,1),43(a,1,2,2,2)),rewrite([2(5)])].
% 9.52/9.89  61 -heap(sep(A,sep(B,sep(C,sep(D,sep(next(E,F),sep(next(E,V6),V7))))))).  [para(2(a,1),49(a,1,2,2,2,2)),rewrite([2(5)])].
% 9.52/9.89  67 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(next(F,V6),sep(next(F,V7),V8)))))))).  [para(2(a,1),61(a,1,2,2,2,2,2)),rewrite([2(5)])].
% 9.52/9.89  68 -heap(sep(A,sep(next(B,C),D))) | B = C | heap(sep(A,sep(lseg(B,C),D))).  [para(2(a,1),27(a,1)),rewrite([2(8)])].
% 9.52/9.89  78 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(next(V6,V7),sep(next(V6,V8),V9))))))))).  [para(2(a,1),67(a,1,2,2,2,2,2,2)),rewrite([2(5)])].
% 9.52/9.89  84 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(next(V7,V8),sep(next(V7,V9),V10)))))))))).  [para(2(a,1),78(a,1,2,2,2,2,2,2,2)),rewrite([2(5)])].
% 9.52/9.89  97 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(V7,sep(next(V8,V9),sep(next(V8,V10),V11))))))))))).  [para(2(a,1),84(a,1,2,2,2,2,2,2,2,2)),rewrite([2(5)])].
% 9.52/9.89  105 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(V7,sep(V8,sep(next(V9,V10),sep(next(V9,V11),V12)))))))))))).  [para(2(a,1),97(a,1,2,2,2,2,2,2,2,2,2)),rewrite([2(5)])].
% 9.52/9.89  107 -heap(sep(A,sep(B,sep(next(C,D),E)))) | C = D | heap(sep(A,sep(B,sep(lseg(C,D),E)))).  [para(2(a,1),68(a,1,2)),rewrite([2(9)])].
% 9.52/9.89  201 x3 = x11 | heap(sep(lseg(x11,x3),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x3,x1),sep(next(x2,x11),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))).  [resolve(107,a,4,a),rewrite([2(47),2(48)]),flip(a)].
% 9.52/9.89  202 -heap(sep(A,sep(B,sep(C,sep(next(D,E),F))))) | D = E | heap(sep(A,sep(B,sep(C,sep(lseg(D,E),F))))).  [para(2(a,1),107(a,1,2,2)),rewrite([2(10)])].
% 9.52/9.89  207 -heap(sep(lseg(A,B),sep(lseg(C,D),sep(lseg(D,A),E)))) | A = B | heap(sep(lseg(C,A),sep(lseg(A,B),E))).  [para(2(a,1),34(a,1))].
% 9.52/9.89  243 -heap(sep(lseg(A,B),sep(lseg(B,C),sep(lseg(D,A),E)))) | B = C | heap(sep(lseg(D,B),sep(lseg(B,C),E))).  [para(2(a,1),35(a,1,2))].
% 9.52/9.89  335 -heap(sep(A,sep(B,sep(C,sep(D,sep(next(E,F),V6)))))) | E = F | heap(sep(A,sep(B,sep(C,sep(D,sep(lseg(E,F),V6)))))).  [para(2(a,1),202(a,1,2,2,2)),rewrite([2(11)])].
% 9.52/9.89  373 -heap(sep(lseg(A,B),sep(lseg(C,A),sep(lseg(D,C),E)))) | A = B | heap(sep(lseg(D,A),sep(lseg(A,B),E))).  [para(2(a,1),207(a,1,2))].
% 9.52/9.89  543 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(next(F,V6),V7))))))) | F = V6 | heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(lseg(F,V6),V7))))))).  [para(2(a,1),335(a,1,2,2,2,2)),rewrite([2(12)])].
% 9.52/9.89  544 x3 = x11 | x3 = x1 | heap(sep(lseg(x11,x3),sep(lseg(x3,x1),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x2,x11),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))).  [resolve(201,b,335,a),rewrite([2(48),2(49),2(50)])].
% 9.52/9.89  832 x2 = x11 | heap(sep(lseg(x11,x3),sep(lseg(x2,x11),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x3,x1),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))) | x3 = x11.  [resolve(543,a,201,b),rewrite([2(44),2(45),2(46),2(47)])].
% 9.52/9.89  833 x2 = x11 | heap(sep(lseg(x2,x11),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x11,x3),sep(next(x1,x11),sep(next(x3,x1),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))).  [resolve(543,a,4,a),rewrite([2(44),2(45),2(46),2(47),2(48)])].
% 9.52/9.89  834 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(next(V6,V7),V8)))))))) | V6 = V7 | heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(lseg(V6,V7),V8)))))))).  [para(2(a,1),543(a,1,2,2,2,2,2)),rewrite([2(13)])].
% 9.52/9.89  1274 x6 = x2 | heap(sep(lseg(x6,x2),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x11,x3),sep(next(x1,x11),sep(next(x3,x1),sep(next(x2,x11),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))).  [resolve(834,a,4,a),rewrite([2(43),2(44),2(45),2(46),2(47),2(48)])].
% 9.52/9.89  1275 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(next(V7,V8),V9))))))))) | V7 = V8 | heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(lseg(V7,V8),V9))))))))).  [para(2(a,1),834(a,1,2,2,2,2,2,2)),rewrite([2(14)])].
% 9.52/9.89  1665 x9 = x6 | heap(sep(lseg(x9,x6),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x11,x3),sep(next(x1,x11),sep(next(x3,x1),sep(next(x2,x11),sep(next(x6,x2),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))).  [resolve(1275,a,4,a),rewrite([2(42),2(43),2(44),2(45),2(46),2(47),2(48)])].
% 9.52/9.89  1666 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(V7,sep(next(V8,V9),V10)))))))))) | V8 = V9 | heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(V7,sep(lseg(V8,V9),V10)))))))))).  [para(2(a,1),1275(a,1,2,2,2,2,2,2,2)),rewrite([2(15)])].
% 9.52/9.89  2062 x4 = x1 | heap(sep(lseg(x10,x11),sep(lseg(x4,x1),sep(lseg(x7,x9),sep(next(x11,x3),sep(next(x1,x11),sep(next(x3,x1),sep(next(x2,x11),sep(next(x6,x2),sep(next(x9,x6),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))).  [resolve(1666,a,4,a),rewrite([2(41),2(42),2(43),2(44),2(45),2(46),2(47)])].
% 9.52/9.89  2063 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(V7,sep(V8,sep(next(V9,V10),V11))))))))))) | V9 = V10 | heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(V7,sep(V8,sep(lseg(V9,V10),V11))))))))))).  [para(2(a,1),1666(a,1,2,2,2,2,2,2,2,2)),rewrite([2(16)])].
% 9.52/9.89  2441 x3 = x11 | x3 = x1 | heap(sep(lseg(x3,x1),sep(lseg(x10,x3),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x2,x11),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp))))))))))).  [resolve(544,c,243,a),rewrite([2(50)]),merge(c)].
% 9.52/9.89  2674 x5 = x11 | heap(sep(lseg(x10,x11),sep(lseg(x5,x11),sep(lseg(x7,x9),sep(next(x11,x3),sep(next(x1,x11),sep(next(x3,x1),sep(next(x2,x11),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x8,x3),emp)))))))))))).  [resolve(2063,a,4,a),rewrite([2(40),2(41),2(42),2(43),2(44),2(45),2(46),2(47)])].
% 9.52/9.89  2675 -heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(V7,sep(V8,sep(V9,sep(next(V10,V11),V12)))))))))))) | V10 = V11 | heap(sep(A,sep(B,sep(C,sep(D,sep(E,sep(F,sep(V6,sep(V7,sep(V8,sep(V9,sep(lseg(V10,V11),V12)))))))))))).  [para(2(a,1),2063(a,1,2,2,2,2,2,2,2,2,2)),rewrite([2(17)])].
% 9.52/9.89  3000 x2 = x11 | x3 = x11 | x6 = x2 | heap(sep(lseg(x11,x3),sep(lseg(x2,x11),sep(lseg(x6,x2),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x3,x1),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))))).  [resolve(832,b,834,a),rewrite([2(49),2(50),2(51),2(52)])].
% 9.52/9.89  7017 x8 = x3 | heap(sep(lseg(x10,x11),sep(lseg(x7,x9),sep(lseg(x8,x3),sep(next(x11,x3),sep(next(x1,x11),sep(next(x3,x1),sep(next(x2,x11),sep(next(x6,x2),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),emp)))))))))))).  [resolve(2675,a,4,a),rewrite([2(39),2(40),2(41),2(42),2(43),2(44),2(45),2(46)])].
% 9.52/9.89  7192 x2 = x11 | x3 = x11 | x6 = x2 | heap(sep(lseg(x11,x3),sep(lseg(x6,x11),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x3,x1),sep(next(x9,x6),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp))))))))))).  [resolve(3000,d,373,a),rewrite([2(53)]),flip(d),merge(d)].
% 9.52/9.89  7224 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | heap(sep(lseg(x11,x3),sep(lseg(x6,x11),sep(lseg(x9,x6),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x3,x1),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp))))))))))).  [resolve(7192,d,834,a),rewrite([2(48),2(49),2(50),2(51)])].
% 9.52/9.89  7274 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | heap(sep(lseg(x11,x3),sep(lseg(x9,x11),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x3,x1),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))).  [resolve(7224,e,373,a),rewrite([2(52)]),flip(e),merge(e)].
% 9.52/9.89  7278 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | heap(sep(lseg(x11,x3),sep(lseg(x3,x1),sep(lseg(x9,x11),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x1,x11),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))).  [resolve(7274,e,543,a),rewrite([2(48),2(49),2(50),2(51)])].
% 9.52/9.89  7343 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | x1 = x11 | heap(sep(lseg(x11,x3),sep(lseg(x1,x11),sep(lseg(x3,x1),sep(lseg(x9,x11),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp)))))))))).  [resolve(7278,f,543,a),rewrite([2(51),2(52),2(53),2(54)])].
% 9.52/9.89  9270 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | x1 = x11 | heap(sep(lseg(x1,x3),sep(lseg(x3,x1),sep(lseg(x9,x11),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(next(x4,x1),sep(next(x5,x11),sep(next(x8,x3),emp))))))))).  [resolve(7343,g,35,a),merge(g)].
% 9.52/9.89  9294 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | x1 = x11 | x8 = x3 | heap(sep(lseg(x1,x3),sep(lseg(x3,x1),sep(lseg(x9,x11),sep(lseg(x10,x11),sep(lseg(x7,x9),sep(lseg(x8,x3),sep(next(x4,x1),sep(next(x5,x11),emp))))))))).  [resolve(9270,g,1275,a),rewrite([2(48),2(49)])].
% 9.52/9.89  9307 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | x1 = x11 | x8 = x3 | x5 = x11 | heap(sep(lseg(x1,x3),sep(lseg(x3,x1),sep(lseg(x9,x11),sep(lseg(x10,x11),sep(lseg(x5,x11),sep(lseg(x7,x9),sep(lseg(x8,x3),sep(next(x4,x1),emp))))))))).  [resolve(9294,h,1275,a),rewrite([2(51),2(52),2(53)])].
% 9.52/9.89  10168 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | x1 = x11 | x8 = x3 | x5 = x11 | x4 = x1.  [resolve(9307,i,1275,a),rewrite([2(54),2(55),2(56)]),unit_del(j,8)].
% 9.52/9.89  10176 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | x1 = x11 | x5 = x11 | x4 = x1.  [para(10168(g,1),4(a,1,2,2,2,2,2,2,2,2,2,2,1,1)),rewrite([2(60),2(61),2(62),2(63),2(64)]),unit_del(i,61)].
% 9.52/9.89  10177 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | x1 = x11 | x4 = x1.  [para(10176(g,1),4(a,1,2,2,2,2,2,2,2,2,2,1,1)),rewrite([2(58),2(59),2(60),2(61),2(62),2(63),2(64)]),unit_del(h,43)].
% 9.52/9.89  10178 x2 = x11 | x3 = x11 | x6 = x2 | x9 = x6 | x3 = x1 | x1 = x11.  [para(10177(g,1),4(a,1,2,2,2,2,2,2,2,2,1,1)),rewrite([2(56),2(57),2(58),2(59)]),unit_del(g,49)].
% 9.52/9.89  10180 x2 = x11 | x3 = x11 | x6 = x2 | x3 = x1 | x1 = x11.  [para(10178(d,1),4(a,1,2,2,2,2,2,2,2,1,1)),unit_del(f,78)].
% 9.52/9.89  10189 x2 = x11 | x3 = x11 | x3 = x1 | x1 = x11.  [para(10180(c,1),4(a,1,2,2,2,2,2,2,1,1)),unit_del(e,67)].
% 9.52/9.89  10190 x3 = x11 | x3 = x1 | x1 = x11.  [para(10189(a,1),4(a,1,2,2,2,2,2,1,1)),rewrite([2(50),2(51),2(52)]),unit_del(d,43)].
% 9.52/9.89  10192 x3 = x11 | x1 = x11.  [para(10190(b,1),4(a,1,2,2,2,2,1,1)),unit_del(c,49)].
% 9.52/9.89  10194 x1 = x11.  [para(10192(a,1),4(a,1,2,2,2,2,1,1)),rewrite([2(45),2(46)]),unit_del(b,43)].
% 9.52/9.89  10278 x8 = x3.  [back_rewrite(7017),rewrite([10194(16),10194(20),10194(32),2(45)]),unit_del(b,49)].
% 9.52/9.89  10314 x5 = x11.  [back_rewrite(2674),rewrite([10194(16),10194(20),10194(32),10278(34),2(39),2(40),2(41),2(42),2(45)]),unit_del(b,67)].
% 9.52/9.89  10319 x3 = x11.  [back_rewrite(2441),rewrite([10194(5),10194(8),10194(16),10194(29),10314(31),10278(34),2(40),2(39),2(41),2(40),2(42),2(41),2(43),2(42)]),merge(b),unit_del(b,49)].
% 9.52/9.89  10326 x4 = x11.  [back_rewrite(2062),rewrite([10194(2),10194(8),10319(14),10194(16),10319(19),10194(20),10314(31),10278(34),10319(34),10319(35),2(40),2(39),2(41),2(40),2(42),2(41)]),unit_del(b,78)].
% 9.61/9.89  10327 x9 = x6.  [back_rewrite(1665),rewrite([10319(14),10194(16),10319(19),10194(20),10326(28),10194(29),10314(31),10278(34),10319(34),10319(35),2(41),2(40),2(39),2(42),2(41),2(40)]),unit_del(b,84)].
% 9.61/9.89  10328 x6 = x2.  [back_rewrite(1274),rewrite([10327(11),10319(14),10194(16),10319(19),10194(20),10327(25),10326(28),10194(29),10314(31),10278(34),10319(34),10319(35),2(41),2(40),2(39),2(42),2(41),2(40)]),unit_del(b,84)].
% 9.61/9.89  10329 x2 = x11.  [back_rewrite(833),rewrite([10327(11),10328(11),10319(14),10194(16),10319(19),10194(20),10328(22),10327(25),10328(25),10328(26),10326(28),10194(29),10314(31),10278(34),10319(34),10319(35),2(41),2(40),2(39),2(42),2(41),2(40)]),unit_del(b,105)].
% 9.61/9.89  10331 $F.  [back_rewrite(4),rewrite([10327(5),10328(5),10329(5),10319(8),10194(10),10319(13),10194(14),10329(16),10328(19),10329(19),10329(20),10327(22),10328(22),10329(22),10328(23),10329(23),10326(25),10194(26),10314(28),10278(31),10319(31),10319(32)]),unit_del(a,105)].
% 9.61/9.89  
% 9.61/9.89  % SZS output end Refutation
% 9.61/9.89  ============================== end of proof ==========================
% 9.61/9.89  
% 9.61/9.89  ============================== STATISTICS ============================
% 9.61/9.89  
% 9.61/9.89  Given=2255. Generated=99858. Kept=10327. proofs=1.
% 9.61/9.89  Usable=1346. Sos=4656. Demods=10. Limbo=137, Disabled=4201. Hints=0.
% 9.61/9.89  Megabytes=14.25.
% 9.61/9.89  User_CPU=8.78, System_CPU=0.06, Wall_clock=9.
% 9.61/9.89  
% 9.61/9.89  ============================== end of statistics =====================
% 9.61/9.89  
% 9.61/9.89  ============================== end of search =========================
% 9.61/9.89  
% 9.61/9.89  THEOREM PROVED
% 9.61/9.89  % SZS status Unsatisfiable
% 9.61/9.89  
% 9.61/9.89  Exiting with 1 proof.
% 9.61/9.89  
% 9.61/9.89  Process 13419 exit (max_proofs) Sun Jun  5 15:14:04 2022
% 9.61/9.89  Prover9 interrupted
%------------------------------------------------------------------------------