0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.32	% Computer   : n028.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 960
0.10/0.32	% DateTime   : Thu Jul  2 07:08:36 EDT 2020
0.10/0.32	% CPUTime    : 
0.77/1.08	============================== Prover9 ===============================
0.77/1.08	Prover9 (32) version 2009-11A, November 2009.
0.77/1.08	Process 25747 was started by sandbox2 on n028.cluster.edu,
0.77/1.08	Thu Jul  2 07:08:37 2020
0.77/1.08	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_25593_n028.cluster.edu".
0.77/1.08	============================== end of head ===========================
0.77/1.08	
0.77/1.08	============================== INPUT =================================
0.77/1.08	
0.77/1.08	% Reading from file /tmp/Prover9_25593_n028.cluster.edu
0.77/1.08	
0.77/1.08	set(prolog_style_variables).
0.77/1.08	set(auto2).
0.77/1.08	    % set(auto2) -> set(auto).
0.77/1.08	    % set(auto) -> set(auto_inference).
0.77/1.08	    % set(auto) -> set(auto_setup).
0.77/1.08	    % set(auto_setup) -> set(predicate_elim).
0.77/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.08	    % set(auto) -> set(auto_limits).
0.77/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.08	    % set(auto) -> set(auto_denials).
0.77/1.08	    % set(auto) -> set(auto_process).
0.77/1.08	    % set(auto2) -> assign(new_constants, 1).
0.77/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.08	    % set(auto2) -> assign(max_hours, 1).
0.77/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.08	    % set(auto2) -> set(sort_initial_sos).
0.77/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.08	    % set(auto2) -> assign(max_megs, 400).
0.77/1.08	    % set(auto2) -> assign(stats, some).
0.77/1.08	    % set(auto2) -> clear(echo_input).
0.77/1.08	    % set(auto2) -> set(quiet).
0.77/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.08	    % set(auto2) -> clear(print_given).
0.77/1.08	assign(lrs_ticks,-1).
0.77/1.08	assign(sos_limit,10000).
0.77/1.08	assign(order,kbo).
0.77/1.08	set(lex_order_vars).
0.77/1.08	clear(print_given).
0.77/1.08	
0.77/1.08	% formulas(sos).  % not echoed (18 formulas)
0.77/1.08	
0.77/1.08	============================== end of input ==========================
0.77/1.08	
0.77/1.08	% From the command line: assign(max_seconds, 960).
0.77/1.08	
0.77/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.08	
0.77/1.08	% Formulas that are not ordinary clauses:
0.77/1.08	1 complete -> (all V1 all V2 (vertex(V1) & V1 != V2 & vertex(V2) -> (exists E (edge(E) & -(head_of(E) = V1 & V2 = tail_of(E) <-> tail_of(E) = V1 & V2 = head_of(E)))))) # label(complete_properties) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	2 (all V1 all V2 all SP (path(V1,V2,SP) & V1 != V2 & (all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))) <-> shortest_path(V1,V2,SP))) # label(shortest_path_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	3 (all E1 all E2 (sequential(E1,E2) <-> edge(E1) & edge(E2) & head_of(E1) = tail_of(E2) & E2 != E1)) # label(sequential_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	4 (all V1 all V2 all P all V (in_path(V,P) & path(V1,V2,P) -> vertex(V) & (exists E (on_path(E,P) & (tail_of(E) = V | head_of(E) = V))))) # label(in_path_properties) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	5 (all V1 all V2 all P (path(V1,V2,P) -> vertex(V1) & (exists E (edge(E) & V1 = tail_of(E) & -((exists TP (path(head_of(E),V2,TP) & P = path_cons(E,TP))) <-> P = path_cons(E,empty) & head_of(E) = V2))) & vertex(V2))) # label(path_properties) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	6 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (on_path(E1,P) & ((exists E3 (precedes(E3,E2,P) & sequential(E1,E3))) | sequential(E1,E2)) & on_path(E2,P) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	7 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> on_path(E2,P) & on_path(E1,P) & -((exists E3 (precedes(E3,E2,P) & sequential(E1,E3))) <-> sequential(E1,E2)))))) # label(precedes_properties) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	8 (all V1 all V2 all P (vertex(V1) & vertex(V2) & (exists E (edge(E) & (head_of(E) = V2 & path_cons(E,empty) = P | (exists TP (path(head_of(E),V2,TP) & P = path_cons(E,TP)))) & V1 = tail_of(E))) -> path(V1,V2,P))) # label(path_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	9 (all V1 all V2 all P all E (path(V1,V2,P) & on_path(E,P) -> in_path(head_of(E),P) & edge(E) & in_path(tail_of(E),P))) # label(on_path_properties) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	10 (all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> -precedes(E2,E1,P) & -(exists E3 (head_of(E3) = head_of(E2) & tail_of(E1) = tail_of(E3))))) # label(shortest_path_properties) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	11 (all E (edge(E) -> vertex(head_of(E)) & vertex(tail_of(E)))) # label(edge_ends_are_vertices) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	12 (all E (edge(E) -> tail_of(E) != head_of(E))) # label(no_loops) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	13 (all V1 all V2 all P (path(V1,V2,P) -> minus(length_of(P),n1) = number_of_in(sequential_pairs,P))) # label(path_length_sequential_pairs) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	14 (all E1 all E2 all E3 (edge(E2) & sequential(E3,E1) & sequential(E2,E3) & sequential(E1,E2) & edge(E3) & edge(E1) <-> triangle(E1,E2,E3))) # label(triangle_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	15 (all P all V1 all V2 ((all E1 all E2 (on_path(E2,P) & sequential(E1,E2) & on_path(E1,P) -> (exists E3 triangle(E1,E2,E3)))) & path(V1,V2,P) -> number_of_in(sequential_pairs,P) = number_of_in(triangles,P))) # label(sequential_pairs_and_triangles) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	16 (all Things all InThese less_or_equal(number_of_in(Things,InThese),number_of_in(Things,graph))) # label(graph_has_them_all) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	17 (all V1 all V2 all P (path(V1,V2,P) -> length_of(P) = number_of_in(edges,P))) # label(length_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	18 -(all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> -(exists E3 (tail_of(E1) = tail_of(E3) & head_of(E3) = head_of(E2))) & head_of(E1) != head_of(E2) & tail_of(E1) != head_of(E2))) # label(shortest_path_properties_lemma) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.08	
0.77/1.08	============================== end of process non-clausal formulas ===
0.77/1.08	
0.77/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.08	
0.77/1.08	============================== PREDICATE ELIMINATION =================
0.77/1.08	19 A != B | -shortest_path(B,A,C) # label(shortest_path_defn) # label(axiom).  [clausify(2)].
0.77/1.08	20 shortest_path(c1,c2,c5) # label(shortest_path_properties_lemma) # label(negated_conjecture).  [clausify(18)].
0.77/1.08	Derived: c2 != c1.  [resolve(19,b,20,a)].
0.77/1.08	21 -shortest_path(A,B,C) | -precedes(D,E,C) | -precedes(E,D,C) # label(shortest_path_properties) # label(axiom).  [clausify(10)].
0.77/1.08	Derived: -precedes(A,B,c5) | -precedes(B,A,c5).  [resolve(21,a,20,a)].
0.77/1.08	22 -shortest_path(A,B,C) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D) # label(shortest_path_properties) # label(axiom).  [clausify(10)].
0.77/1.08	Derived: -precedes(A,B,c5) | head_of(C) != head_of(B) | tail_of(C) != tail_of(A).  [resolve(22,a,20,a)].
0.77/1.08	23 path(A,B,C) | -shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(2)].
0.77/1.08	Derived: path(c1,c2,c5).  [resolve(23,b,20,a)].
0.77/1.08	24 -path(A,B,C) | less_or_equal(length_of(D),length_of(C)) | -shortest_path(A,B,D) # label(shortest_path_defn) # label(axiom).  [clausify(2)].
0.77/1.08	Derived: -path(c1,c2,A) | less_or_equal(length_of(c5),length_of(A)).  [resolve(24,c,20,a)].
0.77/1.08	25 -path(A,B,C) | B = A | path(A,B,f2(A,B,C)) | shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(2)].
0.77/1.08	Derived: -path(A,B,C) | B = A | path(A,B,f2(A,B,C)) | -precedes(D,E,C) | -precedes(E,D,C).  [resolve(25,d,21,a)].
0.77/1.08	Derived: -path(A,B,C) | B = A | path(A,B,f2(A,B,C)) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D).  [resolve(25,d,22,a)].
0.77/1.08	Derived: -path(A,B,C) | B = A | path(A,B,f2(A,B,C)) | -path(A,B,D) | less_or_equal(length_of(C),length_of(D)).  [resolve(25,d,24,c)].
0.77/1.08	26 -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f2(A,B,C))) | shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(2)].
1.25/1.55	Derived: -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f2(A,B,C))) | -precedes(D,E,C) | -precedes(E,D,C).  [resolve(26,d,21,a)].
1.25/1.55	Derived: -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f2(A,B,C))) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D).  [resolve(26,d,22,a)].
1.25/1.55	Derived: -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f2(A,B,C))) | -path(A,B,D) | less_or_equal(length_of(C),length_of(D)).  [resolve(26,d,24,c)].
1.25/1.55	27 -path(A,B,C) | -on_path(D,C) | in_path(head_of(D),C) # label(on_path_properties) # label(axiom).  [clausify(9)].
1.25/1.55	28 -in_path(A,B) | -path(C,D,B) | vertex(A) # label(in_path_properties) # label(axiom).  [clausify(4)].
1.25/1.55	Derived: -path(A,B,C) | -on_path(D,C) | -path(E,F,C) | vertex(head_of(D)).  [resolve(27,c,28,a)].
1.25/1.55	29 -path(A,B,C) | -on_path(D,C) | in_path(tail_of(D),C) # label(on_path_properties) # label(axiom).  [clausify(9)].
1.25/1.55	Derived: -path(A,B,C) | -on_path(D,C) | -path(E,F,C) | vertex(tail_of(D)).  [resolve(29,c,28,a)].
1.25/1.55	30 -in_path(A,B) | -path(C,D,B) | on_path(f3(C,D,B,A),B) # label(in_path_properties) # label(axiom).  [clausify(4)].
1.25/1.55	Derived: -path(A,B,C) | on_path(f3(A,B,C,head_of(D)),C) | -path(E,F,C) | -on_path(D,C).  [resolve(30,a,27,c)].
1.25/1.55	Derived: -path(A,B,C) | on_path(f3(A,B,C,tail_of(D)),C) | -path(E,F,C) | -on_path(D,C).  [resolve(30,a,29,c)].
1.25/1.55	31 -in_path(A,B) | -path(C,D,B) | tail_of(f3(C,D,B,A)) = A | head_of(f3(C,D,B,A)) = A # label(in_path_properties) # label(axiom).  [clausify(4)].
1.25/1.55	Derived: -path(A,B,C) | tail_of(f3(A,B,C,head_of(D))) = head_of(D) | head_of(f3(A,B,C,head_of(D))) = head_of(D) | -path(E,F,C) | -on_path(D,C).  [resolve(31,a,27,c)].
1.25/1.55	Derived: -path(A,B,C) | tail_of(f3(A,B,C,tail_of(D))) = tail_of(D) | head_of(f3(A,B,C,tail_of(D))) = tail_of(D) | -path(E,F,C) | -on_path(D,C).  [resolve(31,a,29,c)].
1.25/1.55	
1.25/1.55	============================== end predicate elimination =============
1.25/1.55	
1.25/1.55	Auto_denials:  (non-Horn, no changes).
1.25/1.55	
1.25/1.55	Term ordering decisions:
1.25/1.55	Function symbol KB weights:  sequential_pairs=1. triangles=1. empty=1. edges=1. graph=1. n1=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. number_of_in=1. path_cons=1. minus=1. f1=1. head_of=1. tail_of=1. length_of=1. f2=1. f4=1. f5=1. f7=1. f8=1. f3=1. f6=1.
1.25/1.55	
1.25/1.55	============================== end of process initial clauses ========
1.25/1.55	
1.25/1.55	============================== CLAUSES FOR SEARCH ====================
1.25/1.55	
1.25/1.55	============================== end of clauses for search =============
1.25/1.55	
1.25/1.55	============================== SEARCH ================================
1.25/1.55	
1.25/1.55	% Starting search at 0.02 seconds.
1.25/1.55	
1.25/1.55	============================== PROOF =================================
1.25/1.55	% SZS status Theorem
1.25/1.55	% SZS output start Refutation
1.25/1.55	
1.25/1.55	% Proof 1 at 0.48 (+ 0.01) seconds.
1.25/1.55	% Length of proof is 49.
1.25/1.55	% Level of proof is 12.
1.25/1.55	% Maximum clause weight is 21.000.
1.25/1.55	% Given clauses 227.
1.25/1.55	
1.25/1.55	2 (all V1 all V2 all SP (path(V1,V2,SP) & V1 != V2 & (all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))) <-> shortest_path(V1,V2,SP))) # label(shortest_path_defn) # label(axiom) # label(non_clause).  [assumption].
1.25/1.55	3 (all E1 all E2 (sequential(E1,E2) <-> edge(E1) & edge(E2) & head_of(E1) = tail_of(E2) & E2 != E1)) # label(sequential_defn) # label(axiom) # label(non_clause).  [assumption].
1.25/1.55	6 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (on_path(E1,P) & ((exists E3 (precedes(E3,E2,P) & sequential(E1,E3))) | sequential(E1,E2)) & on_path(E2,P) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom) # label(non_clause).  [assumption].
1.25/1.55	7 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> on_path(E2,P) & on_path(E1,P) & -((exists E3 (precedes(E3,E2,P) & sequential(E1,E3))) <-> sequential(E1,E2)))))) # label(precedes_properties) # label(axiom) # label(non_clause).  [assumption].
1.25/1.55	9 (all V1 all V2 all P all E (path(V1,V2,P) & on_path(E,P) -> in_path(head_of(E),P) & edge(E) & in_path(tail_of(E),P))) # label(on_path_properties) # label(axiom) # label(non_clause).  [assumption].
1.25/1.55	10 (all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> -precedes(E2,E1,P) & -(exists E3 (head_of(E3) = head_of(E2) & tail_of(E1) = tail_of(E3))))) # label(shortest_path_properties) # label(axiom) # label(non_clause).  [assumption].
1.25/1.55	12 (all E (edge(E) -> tail_of(E) != head_of(E))) # label(no_loops) # label(axiom) # label(non_clause).  [assumption].
1.25/1.55	18 -(all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> -(exists E3 (tail_of(E1) = tail_of(E3) & head_of(E3) = head_of(E2))) & head_of(E1) != head_of(E2) & tail_of(E1) != head_of(E2))) # label(shortest_path_properties_lemma) # label(negated_conjecture) # label(non_clause).  [assumption].
1.25/1.55	20 shortest_path(c1,c2,c5) # label(shortest_path_properties_lemma) # label(negated_conjecture).  [clausify(18)].
1.25/1.55	21 -shortest_path(A,B,C) | -precedes(D,E,C) | -precedes(E,D,C) # label(shortest_path_properties) # label(axiom).  [clausify(10)].
1.25/1.55	22 -shortest_path(A,B,C) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D) # label(shortest_path_properties) # label(axiom).  [clausify(10)].
1.25/1.55	23 path(A,B,C) | -shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(2)].
1.25/1.55	32 precedes(c3,c4,c5) # label(shortest_path_properties_lemma) # label(negated_conjecture).  [clausify(18)].
1.25/1.55	34 tail_of(c6) = tail_of(c3) | head_of(c4) = head_of(c3) | tail_of(c3) = head_of(c4) # label(shortest_path_properties_lemma) # label(negated_conjecture).  [clausify(18)].
1.25/1.55	35 head_of(c6) = head_of(c4) | head_of(c4) = head_of(c3) | tail_of(c3) = head_of(c4) # label(shortest_path_properties_lemma) # label(negated_conjecture).  [clausify(18)].
1.25/1.55	37 -edge(A) | tail_of(A) != head_of(A) # label(no_loops) # label(axiom).  [clausify(12)].
1.25/1.55	54 -path(A,B,C) | -on_path(D,C) | edge(D) # label(on_path_properties) # label(axiom).  [clausify(9)].
1.25/1.55	57 -path(A,B,C) | -precedes(D,E,C) | on_path(E,C) # label(precedes_properties) # label(axiom).  [clausify(7)].
1.25/1.55	58 -path(A,B,C) | -precedes(D,E,C) | on_path(D,C) # label(precedes_properties) # label(axiom).  [clausify(7)].
1.25/1.55	62 sequential(A,B) | -edge(A) | -edge(B) | tail_of(B) != head_of(A) | B = A # label(sequential_defn) # label(axiom).  [clausify(3)].
1.25/1.55	74 -path(A,B,C) | -on_path(D,C) | -precedes(E,F,C) | -sequential(D,E) | -on_path(F,C) | precedes(D,F,C) # label(precedes_defn) # label(axiom).  [clausify(6)].
1.25/1.55	84 -precedes(A,B,c5) | -precedes(B,A,c5).  [resolve(21,a,20,a)].
1.25/1.55	85 -precedes(A,B,c5) | head_of(C) != head_of(B) | tail_of(C) != tail_of(A).  [resolve(22,a,20,a)].
1.25/1.55	86 path(c1,c2,c5).  [resolve(23,b,20,a)].
1.25/1.55	111 -precedes(A,A,c5).  [factor(84,a,b)].
1.25/1.55	126 -path(A,B,c5) | on_path(c4,c5).  [resolve(57,b,32,a)].
1.25/1.55	127 -path(A,B,c5) | on_path(c3,c5).  [resolve(58,b,32,a)].
1.25/1.55	130 -path(A,B,c5) | -on_path(C,c5) | -sequential(C,c3) | -on_path(c4,c5) | precedes(C,c4,c5).  [resolve(74,c,32,a)].
1.25/1.55	131 -path(A,B,c5) | -on_path(c4,c5) | -sequential(c4,c3).  [factor(130,b,d),unit_del(d,111)].
1.25/1.55	133 head_of(c4) != head_of(A) | tail_of(c3) != tail_of(A).  [resolve(85,a,32,a),flip(a),flip(b)].
1.25/1.55	134 head_of(c4) != head_of(c3).  [ur(85,a,32,a,c,xx),flip(a)].
1.25/1.55	136 head_of(c6) = head_of(c4) | tail_of(c3) = head_of(c4).  [back_unit_del(35),unit_del(b,134)].
1.25/1.55	137 tail_of(c6) = tail_of(c3) | tail_of(c3) = head_of(c4).  [back_unit_del(34),unit_del(b,134)].
1.25/1.55	149 -on_path(A,c5) | edge(A).  [resolve(86,a,54,a)].
1.25/1.55	195 -on_path(c4,c5) | -sequential(c4,c3).  [resolve(131,a,86,a)].
1.25/1.55	209 on_path(c4,c5).  [resolve(126,a,86,a)].
1.25/1.55	210 -sequential(c4,c3).  [back_unit_del(195),unit_del(a,209)].
1.25/1.55	214 edge(c4).  [resolve(209,a,149,a)].
1.25/1.55	215 on_path(c3,c5).  [resolve(127,a,86,a)].
1.25/1.55	222 sequential(c4,A) | -edge(A) | tail_of(A) != head_of(c4) | c4 = A.  [resolve(214,a,62,b),flip(d)].
1.25/1.55	250 edge(c3).  [resolve(215,a,149,a)].
1.25/1.55	256 tail_of(c3) != head_of(c3).  [resolve(250,a,37,a)].
1.25/1.55	284 tail_of(c3) = head_of(c4) | head_of(c6) != head_of(c4).  [resolve(137,a,133,b(flip)),flip(b)].
1.25/1.55	806 tail_of(c3) != head_of(c4) | c4 = c3.  [resolve(222,b,250,a),unit_del(a,210)].
1.25/1.55	808 c4 = c3 | head_of(c6) = head_of(c4).  [resolve(806,a,136,b)].
1.25/1.55	809 c4 = c3 | tail_of(c3) = head_of(c4).  [resolve(808,b,284,b)].
1.25/1.55	826 c4 = c3.  [resolve(809,b,806,a),merge(b)].
1.25/1.55	867 head_of(c6) != head_of(c3).  [back_rewrite(284),rewrite([826(3),826(8)]),unit_del(a,256)].
1.25/1.55	874 $F.  [back_rewrite(136),rewrite([826(3),826(8)]),unit_del(a,867),unit_del(b,256)].
1.25/1.55	
1.25/1.55	% SZS output end Refutation
1.25/1.55	============================== end of proof ==========================
1.25/1.55	
1.25/1.55	============================== STATISTICS ============================
1.25/1.55	
1.25/1.55	Given=227. Generated=1462. Kept=841. proofs=1.
1.25/1.55	Usable=163. Sos=292. Demods=6. Limbo=48, Disabled=418. Hints=0.
1.25/1.55	Megabytes=1.61.
1.25/1.55	User_CPU=0.48, System_CPU=0.01, Wall_clock=0.
1.25/1.55	
1.25/1.55	============================== end of statistics =====================
1.25/1.55	
1.25/1.55	============================== end of search =========================
1.25/1.55	
1.25/1.55	THEOREM PROVED
1.25/1.55	% SZS status Theorem
1.25/1.55	
1.25/1.55	Exiting with 1 proof.
1.25/1.55	
1.25/1.55	Process 25747 exit (max_proofs) Thu Jul  2 07:08:37 2020
1.25/1.55	Prover9 interrupted
1.25/1.56	EOF