0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.32 % Computer : n015.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 1440 0.12/0.32 % WCLimit : 180 0.12/0.32 % DateTime : Mon Jul 3 04:41:54 EDT 2023 0.12/0.32 % CPUTime : 0.71/1.01 ============================== Prover9 =============================== 0.71/1.01 Prover9 (32) version 2009-11A, November 2009. 0.71/1.01 Process 5154 was started by sandbox on n015.cluster.edu, 0.71/1.01 Mon Jul 3 04:41:55 2023 0.71/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_4994_n015.cluster.edu". 0.71/1.01 ============================== end of head =========================== 0.71/1.01 0.71/1.01 ============================== INPUT ================================= 0.71/1.01 0.71/1.01 % Reading from file /tmp/Prover9_4994_n015.cluster.edu 0.71/1.01 0.71/1.01 set(prolog_style_variables). 0.71/1.01 set(auto2). 0.71/1.01 % set(auto2) -> set(auto). 0.71/1.01 % set(auto) -> set(auto_inference). 0.71/1.01 % set(auto) -> set(auto_setup). 0.71/1.01 % set(auto_setup) -> set(predicate_elim). 0.71/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.71/1.01 % set(auto) -> set(auto_limits). 0.71/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.71/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.71/1.01 % set(auto) -> set(auto_denials). 0.71/1.01 % set(auto) -> set(auto_process). 0.71/1.01 % set(auto2) -> assign(new_constants, 1). 0.71/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.71/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.71/1.01 % set(auto2) -> assign(max_hours, 1). 0.71/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.71/1.01 % set(auto2) -> assign(max_seconds, 0). 0.71/1.01 % set(auto2) -> assign(max_minutes, 5). 0.71/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.71/1.01 % set(auto2) -> set(sort_initial_sos). 0.71/1.01 % set(auto2) -> assign(sos_limit, -1). 0.71/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.71/1.01 % set(auto2) -> assign(max_megs, 400). 0.71/1.01 % set(auto2) -> assign(stats, some). 0.71/1.01 % set(auto2) -> clear(echo_input). 0.71/1.01 % set(auto2) -> set(quiet). 0.71/1.01 % set(auto2) -> clear(print_initial_clauses). 0.71/1.01 % set(auto2) -> clear(print_given). 0.71/1.01 assign(lrs_ticks,-1). 0.71/1.01 assign(sos_limit,10000). 0.71/1.01 assign(order,kbo). 0.71/1.01 set(lex_order_vars). 0.71/1.01 clear(print_given). 0.71/1.01 0.71/1.01 % formulas(sos). % not echoed (18 formulas) 0.71/1.01 0.71/1.01 ============================== end of input ========================== 0.71/1.01 0.71/1.01 % From the command line: assign(max_seconds, 1440). 0.71/1.01 0.71/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.71/1.01 0.71/1.01 % Formulas that are not ordinary clauses: 0.71/1.01 1 (all V1 all V2 all E1 all E2 all P (precedes(E1,E2,P) & shortest_path(V1,V2,P) -> -(exists E3 (head_of(E2) = head_of(E3) & tail_of(E1) = tail_of(E3))) & -precedes(E2,E1,P))) # label(shortest_path_properties) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 2 (all E (edge(E) -> tail_of(E) != head_of(E))) # label(no_loops) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 3 (all E (edge(E) -> vertex(head_of(E)) & vertex(tail_of(E)))) # label(edge_ends_are_vertices) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 4 (all V1 all V2 all P (vertex(V1) & (exists E (edge(E) & ((exists TP (path_cons(E,TP) = P & path(head_of(E),V2,TP))) | head_of(E) = V2 & P = path_cons(E,empty)) & tail_of(E) = V1)) & vertex(V2) -> path(V1,V2,P))) # label(path_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 5 (all V1 all V2 all P all V (in_path(V,P) & path(V1,V2,P) -> (exists E (on_path(E,P) & (head_of(E) = V | V = tail_of(E)))) & vertex(V))) # label(in_path_properties) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 6 (all V1 all V2 all SP ((all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))) & V1 != V2 & path(V1,V2,SP) <-> shortest_path(V1,V2,SP))) # label(shortest_path_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 7 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (on_path(E1,P) & on_path(E2,P) & ((exists E3 (sequential(E1,E3) & precedes(E3,E2,P))) | sequential(E1,E2)) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 8 complete -> (all V1 all V2 (vertex(V1) & V1 != V2 & vertex(V2) -> (exists E (-(tail_of(E) = V1 & V2 = head_of(E) <-> V2 = tail_of(E) & head_of(E) = V1) & edge(E))))) # label(complete_properties) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 9 (all E1 all E2 (sequential(E1,E2) <-> edge(E2) & tail_of(E2) = head_of(E1) & E1 != E2 & edge(E1))) # label(sequential_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 10 (all V1 all V2 all P (path(V1,V2,P) -> vertex(V1) & (exists E (-((exists TP (P = path_cons(E,TP) & path(head_of(E),V2,TP))) <-> P = path_cons(E,empty) & head_of(E) = V2) & V1 = tail_of(E) & edge(E))) & vertex(V2))) # label(path_properties) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 11 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> on_path(E2,P) & -((exists E3 (sequential(E1,E3) & precedes(E3,E2,P))) <-> sequential(E1,E2)) & on_path(E1,P))))) # label(precedes_properties) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 12 (all V1 all V2 all P all E (on_path(E,P) & path(V1,V2,P) -> edge(E) & in_path(tail_of(E),P) & in_path(head_of(E),P))) # label(on_path_properties) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 13 (all V1 all V2 all P (path(V1,V2,P) -> number_of_in(sequential_pairs,P) = minus(length_of(P),n1))) # label(path_length_sequential_pairs) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 14 (all P all V1 all V2 ((all E1 all E2 (on_path(E1,P) & on_path(E2,P) & sequential(E1,E2) -> (exists E3 triangle(E1,E2,E3)))) & path(V1,V2,P) -> number_of_in(triangles,P) = number_of_in(sequential_pairs,P))) # label(sequential_pairs_and_triangles) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 15 (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.71/1.01 16 (all E1 all E2 all E3 (triangle(E1,E2,E3) <-> edge(E1) & edge(E2) & edge(E3) & sequential(E1,E2) & sequential(E2,E3) & sequential(E3,E1))) # label(triangle_defn) # label(axiom) # label(non_clause). [assumption]. 0.71/1.01 17 (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.71/1.01 18 -(all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> head_of(E1) != head_of(E2) & tail_of(E1) != head_of(E2) & -(exists E3 (tail_of(E3) = tail_of(E1) & head_of(E2) = head_of(E3))))) # label(shortest_path_properties_lemma) # label(negated_conjecture) # label(non_clause). [assumption]. 0.71/1.01 0.71/1.01 ============================== end of process non-clausal formulas === 0.71/1.01 0.71/1.01 ============================== PROCESS INITIAL CLAUSES =============== 0.71/1.01 0.71/1.01 ============================== PREDICATE ELIMINATION ================= 0.71/1.01 19 A != B | -shortest_path(B,A,C) # label(shortest_path_defn) # label(axiom). [clausify(6)]. 0.71/1.01 20 shortest_path(c1,c2,c5) # label(shortest_path_properties_lemma) # label(negated_conjecture). [clausify(18)]. 0.71/1.01 Derived: c2 != c1. [resolve(19,b,20,a)]. 0.71/1.01 21 -precedes(A,B,C) | -shortest_path(D,E,C) | -precedes(B,A,C) # label(shortest_path_properties) # label(axiom). [clausify(1)]. 0.71/1.01 Derived: -precedes(A,B,c5) | -precedes(B,A,c5). [resolve(21,b,20,a)]. 0.71/1.01 22 -precedes(A,B,C) | -shortest_path(D,E,C) | head_of(F) != head_of(B) | tail_of(F) != tail_of(A) # label(shortest_path_properties) # label(axiom). [clausify(1)]. 0.71/1.01 Derived: -precedes(A,B,c5) | head_of(C) != head_of(B) | tail_of(C) != tail_of(A). [resolve(22,b,20,a)]. 0.71/1.01 23 path(A,B,C) | -shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom). [clausify(6)]. 0.71/1.01 Derived: path(c1,c2,c5). [resolve(23,b,20,a)]. 0.71/1.01 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(6)]. 0.71/1.01 Derived: -path(c1,c2,A) | less_or_equal(length_of(c5),length_of(A)). [resolve(24,c,20,a)]. 0.71/1.01 25 path(A,B,f2(A,B,C)) | B = A | -path(A,B,C) | shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom). [clausify(6)]. 0.71/1.01 Derived: path(A,B,f2(A,B,C)) | B = A | -path(A,B,C) | -precedes(D,E,C) | -precedes(E,D,C). [resolve(25,d,21,b)]. 0.71/1.01 Derived: path(A,B,f2(A,B,C)) | B = A | -path(A,B,C) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D). [resolve(25,d,22,b)]. 0.71/1.01 Derived: path(A,B,f2(A,B,C)) | B = A | -path(A,B,C) | -path(A,B,D) | less_or_equal(length_of(C),length_of(D)). [resolve(25,d,24,c)]. 0.71/1.01 26 -less_or_equal(length_of(A),length_of(f2(B,C,A))) | C = B | -path(B,C,A) | shortest_path(B,C,A) # label(shortest_path_defn) # label(axiom). [clausify(6)]. 1.00/1.27 Derived: -less_or_equal(length_of(A),length_of(f2(B,C,A))) | C = B | -path(B,C,A) | -precedes(D,E,A) | -precedes(E,D,A). [resolve(26,d,21,b)]. 1.00/1.27 Derived: -less_or_equal(length_of(A),length_of(f2(B,C,A))) | C = B | -path(B,C,A) | -precedes(D,E,A) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D). [resolve(26,d,22,b)]. 1.00/1.27 Derived: -less_or_equal(length_of(A),length_of(f2(B,C,A))) | C = B | -path(B,C,A) | -path(B,C,D) | less_or_equal(length_of(A),length_of(D)). [resolve(26,d,24,c)]. 1.00/1.27 27 -on_path(A,B) | -path(C,D,B) | in_path(tail_of(A),B) # label(on_path_properties) # label(axiom). [clausify(12)]. 1.00/1.27 28 -in_path(A,B) | -path(C,D,B) | vertex(A) # label(in_path_properties) # label(axiom). [clausify(5)]. 1.00/1.27 Derived: -on_path(A,B) | -path(C,D,B) | -path(E,F,B) | vertex(tail_of(A)). [resolve(27,c,28,a)]. 1.00/1.27 29 -on_path(A,B) | -path(C,D,B) | in_path(head_of(A),B) # label(on_path_properties) # label(axiom). [clausify(12)]. 1.00/1.27 Derived: -on_path(A,B) | -path(C,D,B) | -path(E,F,B) | vertex(head_of(A)). [resolve(29,c,28,a)]. 1.00/1.27 30 -in_path(A,B) | -path(C,D,B) | on_path(f1(C,D,B,A),B) # label(in_path_properties) # label(axiom). [clausify(5)]. 1.00/1.27 Derived: -path(A,B,C) | on_path(f1(A,B,C,tail_of(D)),C) | -on_path(D,C) | -path(E,F,C). [resolve(30,a,27,c)]. 1.00/1.27 Derived: -path(A,B,C) | on_path(f1(A,B,C,head_of(D)),C) | -on_path(D,C) | -path(E,F,C). [resolve(30,a,29,c)]. 1.00/1.27 31 -in_path(A,B) | -path(C,D,B) | head_of(f1(C,D,B,A)) = A | tail_of(f1(C,D,B,A)) = A # label(in_path_properties) # label(axiom). [clausify(5)]. 1.00/1.27 Derived: -path(A,B,C) | head_of(f1(A,B,C,tail_of(D))) = tail_of(D) | tail_of(f1(A,B,C,tail_of(D))) = tail_of(D) | -on_path(D,C) | -path(E,F,C). [resolve(31,a,27,c)]. 1.00/1.27 Derived: -path(A,B,C) | head_of(f1(A,B,C,head_of(D))) = head_of(D) | tail_of(f1(A,B,C,head_of(D))) = head_of(D) | -on_path(D,C) | -path(E,F,C). [resolve(31,a,29,c)]. 1.00/1.27 1.00/1.27 ============================== end predicate elimination ============= 1.00/1.27 1.00/1.27 Auto_denials: (non-Horn, no changes). 1.00/1.27 1.00/1.27 Term ordering decisions: 1.00/1.27 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. f3=1. head_of=1. tail_of=1. length_of=1. f2=1. f4=1. f5=1. f7=1. f8=1. f1=1. f6=1. 1.00/1.27 1.00/1.27 ============================== end of process initial clauses ======== 1.00/1.27 1.00/1.27 ============================== CLAUSES FOR SEARCH ==================== 1.00/1.27 1.00/1.27 ============================== end of clauses for search ============= 1.00/1.27 1.00/1.27 ============================== SEARCH ================================ 1.00/1.27 1.00/1.27 % Starting search at 0.02 seconds. 1.00/1.27 1.00/1.27 ============================== PROOF ================================= 1.00/1.27 % SZS status Theorem 1.00/1.27 % SZS output start Refutation 1.00/1.27 1.00/1.27 % Proof 1 at 0.27 (+ 0.01) seconds. 1.00/1.27 % Length of proof is 49. 1.00/1.27 % Level of proof is 12. 1.00/1.27 % Maximum clause weight is 21.000. 1.00/1.27 % Given clauses 224. 1.00/1.27 1.00/1.27 1 (all V1 all V2 all E1 all E2 all P (precedes(E1,E2,P) & shortest_path(V1,V2,P) -> -(exists E3 (head_of(E2) = head_of(E3) & tail_of(E1) = tail_of(E3))) & -precedes(E2,E1,P))) # label(shortest_path_properties) # label(axiom) # label(non_clause). [assumption]. 1.00/1.27 2 (all E (edge(E) -> tail_of(E) != head_of(E))) # label(no_loops) # label(axiom) # label(non_clause). [assumption]. 1.00/1.27 6 (all V1 all V2 all SP ((all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))) & V1 != V2 & path(V1,V2,SP) <-> shortest_path(V1,V2,SP))) # label(shortest_path_defn) # label(axiom) # label(non_clause). [assumption]. 1.00/1.27 7 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (on_path(E1,P) & on_path(E2,P) & ((exists E3 (sequential(E1,E3) & precedes(E3,E2,P))) | sequential(E1,E2)) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom) # label(non_clause). [assumption]. 1.00/1.27 9 (all E1 all E2 (sequential(E1,E2) <-> edge(E2) & tail_of(E2) = head_of(E1) & E1 != E2 & edge(E1))) # label(sequential_defn) # label(axiom) # label(non_clause). [assumption]. 1.00/1.27 11 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> on_path(E2,P) & -((exists E3 (sequential(E1,E3) & precedes(E3,E2,P))) <-> sequential(E1,E2)) & on_path(E1,P))))) # label(precedes_properties) # label(axiom) # label(non_clause). [assumption]. 1.00/1.27 12 (all V1 all V2 all P all E (on_path(E,P) & path(V1,V2,P) -> edge(E) & in_path(tail_of(E),P) & in_path(head_of(E),P))) # label(on_path_properties) # label(axiom) # label(non_clause). [assumption]. 1.00/1.27 18 -(all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> head_of(E1) != head_of(E2) & tail_of(E1) != head_of(E2) & -(exists E3 (tail_of(E3) = tail_of(E1) & head_of(E2) = head_of(E3))))) # label(shortest_path_properties_lemma) # label(negated_conjecture) # label(non_clause). [assumption]. 1.00/1.27 20 shortest_path(c1,c2,c5) # label(shortest_path_properties_lemma) # label(negated_conjecture). [clausify(18)]. 1.00/1.27 21 -precedes(A,B,C) | -shortest_path(D,E,C) | -precedes(B,A,C) # label(shortest_path_properties) # label(axiom). [clausify(1)]. 1.00/1.27 22 -precedes(A,B,C) | -shortest_path(D,E,C) | head_of(F) != head_of(B) | tail_of(F) != tail_of(A) # label(shortest_path_properties) # label(axiom). [clausify(1)]. 1.00/1.27 23 path(A,B,C) | -shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom). [clausify(6)]. 1.00/1.27 32 precedes(c3,c4,c5) # label(shortest_path_properties_lemma) # label(negated_conjecture). [clausify(18)]. 1.00/1.27 34 head_of(c4) = head_of(c3) | tail_of(c3) = head_of(c4) | tail_of(c6) = tail_of(c3) # label(shortest_path_properties_lemma) # label(negated_conjecture). [clausify(18)]. 1.00/1.27 35 head_of(c4) = head_of(c3) | tail_of(c3) = head_of(c4) | head_of(c6) = head_of(c4) # label(shortest_path_properties_lemma) # label(negated_conjecture). [clausify(18)]. 1.00/1.27 37 -edge(A) | tail_of(A) != head_of(A) # label(no_loops) # label(axiom). [clausify(2)]. 1.00/1.27 54 -on_path(A,B) | -path(C,D,B) | edge(A) # label(on_path_properties) # label(axiom). [clausify(12)]. 1.00/1.27 57 -path(A,B,C) | -precedes(D,E,C) | on_path(E,C) # label(precedes_properties) # label(axiom). [clausify(11)]. 1.00/1.27 58 -path(A,B,C) | -precedes(D,E,C) | on_path(D,C) # label(precedes_properties) # label(axiom). [clausify(11)]. 1.00/1.27 61 sequential(A,B) | -edge(B) | tail_of(B) != head_of(A) | B = A | -edge(A) # label(sequential_defn) # label(axiom). [clausify(9)]. 1.00/1.27 73 -path(A,B,C) | -on_path(D,C) | -on_path(E,C) | -sequential(D,F) | -precedes(F,E,C) | precedes(D,E,C) # label(precedes_defn) # label(axiom). [clausify(7)]. 1.00/1.27 83 -precedes(A,B,c5) | -precedes(B,A,c5). [resolve(21,b,20,a)]. 1.00/1.27 84 -precedes(A,B,c5) | head_of(C) != head_of(B) | tail_of(C) != tail_of(A). [resolve(22,b,20,a)]. 1.00/1.27 85 path(c1,c2,c5). [resolve(23,b,20,a)]. 1.00/1.27 110 -precedes(A,A,c5). [factor(83,a,b)]. 1.00/1.27 125 -path(A,B,c5) | on_path(c4,c5). [resolve(57,b,32,a)]. 1.00/1.27 126 -path(A,B,c5) | on_path(c3,c5). [resolve(58,b,32,a)]. 1.00/1.27 129 -path(A,B,c5) | -on_path(C,c5) | -on_path(c4,c5) | -sequential(C,c3) | precedes(C,c4,c5). [resolve(73,e,32,a)]. 1.00/1.27 130 -path(A,B,c5) | -on_path(c4,c5) | -sequential(c4,c3). [factor(129,b,c),unit_del(d,110)]. 1.00/1.27 132 head_of(c4) != head_of(A) | tail_of(c3) != tail_of(A). [resolve(84,a,32,a),flip(a),flip(b)]. 1.00/1.27 133 head_of(c4) != head_of(c3). [ur(84,a,32,a,c,xx),flip(a)]. 1.00/1.27 135 tail_of(c3) = head_of(c4) | head_of(c6) = head_of(c4). [back_unit_del(35),unit_del(a,133)]. 1.00/1.27 136 tail_of(c3) = head_of(c4) | tail_of(c6) = tail_of(c3). [back_unit_del(34),unit_del(a,133)]. 1.00/1.27 148 -on_path(A,c5) | edge(A). [resolve(85,a,54,b)]. 1.00/1.27 194 -on_path(c4,c5) | -sequential(c4,c3). [resolve(130,a,85,a)]. 1.00/1.27 208 on_path(c4,c5). [resolve(125,a,85,a)]. 1.00/1.27 209 -sequential(c4,c3). [back_unit_del(194),unit_del(a,208)]. 1.00/1.27 213 edge(c4). [resolve(208,a,148,a)]. 1.00/1.27 214 on_path(c3,c5). [resolve(126,a,85,a)]. 1.00/1.27 220 sequential(c4,A) | -edge(A) | tail_of(A) != head_of(c4) | c4 = A. [resolve(213,a,61,e),flip(d)]. 1.00/1.27 249 edge(c3). [resolve(214,a,148,a)]. 1.00/1.27 255 tail_of(c3) != head_of(c3). [resolve(249,a,37,a)]. 1.00/1.27 283 tail_of(c3) = head_of(c4) | head_of(c6) != head_of(c4). [resolve(136,b,132,b(flip)),flip(b)]. 1.00/1.27 786 tail_of(c3) != head_of(c4) | c4 = c3. [resolve(220,b,249,a),unit_del(a,209)]. 1.00/1.27 802 c4 = c3 | head_of(c6) = head_of(c4). [resolve(786,a,135,a)]. 1.00/1.27 803 c4 = c3 | tail_of(c3) = head_of(c4). [resolve(802,b,283,b)]. 1.00/1.27 806 c4 = c3. [resolve(803,b,786,a),merge(b)]. 1.00/1.27 841 head_of(c6) != head_of(c3). [back_rewrite(283),rewrite([806(3),806(8)]),unit_del(a,255)]. 1.00/1.27 848 $F. [back_rewrite(135),rewrite([806(3),806(8)]),unit_del(a,255),unit_del(b,841)]. 1.00/1.27 1.00/1.27 % SZS output end Refutation 1.00/1.27 ============================== end of proof ========================== 1.00/1.27 1.00/1.27 ============================== STATISTICS ============================ 1.00/1.27 1.00/1.27 Given=224. Generated=1423. Kept=816. proofs=1. 1.00/1.27 Usable=162. Sos=285. Demods=6. Limbo=42, Disabled=407. Hints=0. 1.00/1.27 Megabytes=1.56. 1.00/1.27 User_CPU=0.27, System_CPU=0.01, Wall_clock=0. 1.00/1.27 1.00/1.27 ============================== end of statistics ===================== 1.00/1.27 1.00/1.27 ============================== end of search ========================= 1.00/1.27 1.00/1.27 THEOREM PROVED 1.00/1.27 % SZS status Theorem 1.00/1.27 1.00/1.27 Exiting with 1 proof. 1.00/1.27 1.00/1.27 Process 5154 exit (max_proofs) Mon Jul 3 04:41:55 2023 1.00/1.27 Prover9 interrupted 1.00/1.27 EOF