0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n004.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 1440 0.12/0.34 % WCLimit : 180 0.12/0.34 % DateTime : Mon Jul 3 11:54:30 EDT 2023 0.12/0.34 % CPUTime : 0.43/1.01 ============================== Prover9 =============================== 0.43/1.01 Prover9 (32) version 2009-11A, November 2009. 0.43/1.01 Process 31634 was started by sandbox on n004.cluster.edu, 0.43/1.01 Mon Jul 3 11:54:31 2023 0.43/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_31481_n004.cluster.edu". 0.43/1.01 ============================== end of head =========================== 0.43/1.01 0.43/1.01 ============================== INPUT ================================= 0.43/1.01 0.43/1.01 % Reading from file /tmp/Prover9_31481_n004.cluster.edu 0.43/1.01 0.43/1.01 set(prolog_style_variables). 0.43/1.01 set(auto2). 0.43/1.01 % set(auto2) -> set(auto). 0.43/1.01 % set(auto) -> set(auto_inference). 0.43/1.01 % set(auto) -> set(auto_setup). 0.43/1.01 % set(auto_setup) -> set(predicate_elim). 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.43/1.01 % set(auto) -> set(auto_limits). 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.43/1.01 % set(auto) -> set(auto_denials). 0.43/1.01 % set(auto) -> set(auto_process). 0.43/1.01 % set(auto2) -> assign(new_constants, 1). 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.43/1.01 % set(auto2) -> assign(max_hours, 1). 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.43/1.01 % set(auto2) -> assign(max_seconds, 0). 0.43/1.01 % set(auto2) -> assign(max_minutes, 5). 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.43/1.01 % set(auto2) -> set(sort_initial_sos). 0.43/1.01 % set(auto2) -> assign(sos_limit, -1). 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.43/1.01 % set(auto2) -> assign(max_megs, 400). 0.43/1.01 % set(auto2) -> assign(stats, some). 0.43/1.01 % set(auto2) -> clear(echo_input). 0.43/1.01 % set(auto2) -> set(quiet). 0.43/1.01 % set(auto2) -> clear(print_initial_clauses). 0.43/1.01 % set(auto2) -> clear(print_given). 0.43/1.01 assign(lrs_ticks,-1). 0.43/1.01 assign(sos_limit,10000). 0.43/1.01 assign(order,kbo). 0.43/1.01 set(lex_order_vars). 0.43/1.01 clear(print_given). 0.43/1.01 0.43/1.01 % formulas(sos). % not echoed (28 formulas) 0.43/1.01 0.43/1.01 ============================== end of input ========================== 0.43/1.01 0.43/1.01 % From the command line: assign(max_seconds, 1440). 0.43/1.01 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.43/1.01 0.43/1.01 % Formulas that are not ordinary clauses: 0.43/1.01 1 (all C1 all C2 ((exists P meet(P,C1,C2)) -> (exists C C = sum(C1,C2)))) # label(c8) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 2 (all C all C1 all C2 all P (C = sum(C1,C2) & meet(P,C1,C2) & closed(C) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 3 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 4 (all C all C1 ((all P (incident_c(P,C1) -> incident_c(P,C))) <-> part_of(C1,C))) # label(part_of_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 5 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 6 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 7 (all P all C (inner_point(P,C) <-> incident_c(P,C) & -end_point(P,C))) # label(inner_point_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 8 (all C all P (end_point(P,C) -> (exists Q (end_point(Q,C) & Q != P)))) # label(c6) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 9 (all P all C all C1 (meet(P,C,C1) <-> incident_c(P,C) & (all Q (incident_c(Q,C1) & incident_c(Q,C) -> end_point(Q,C1) & end_point(Q,C))) & incident_c(P,C1))) # label(meet_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 10 (all C all P all Q all R (end_point(P,C) & end_point(R,C) & end_point(Q,C) -> R = P | R = Q | Q = P)) # label(c5) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 11 (all P all C (incident_c(P,C) & (all C1 all C2 (part_of(C1,C) & incident_c(P,C2) & incident_c(P,C1) & part_of(C2,C) -> part_of(C1,C2) | part_of(C2,C1))) <-> end_point(P,C))) # label(end_point_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 12 (all C all C1 ((all P (incident_c(P,C) <-> incident_c(P,C1))) -> C1 = C)) # label(c9) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 13 (all C all C1 all C2 ((all Q (incident_c(Q,C1) | incident_c(Q,C2) <-> incident_c(Q,C))) <-> C = sum(C1,C2))) # label(sum_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 14 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (C = sum(C1,C2) & meet(P,C1,C2))))) # label(c4) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 15 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 16 (all C all C1 all C2 all C3 (part_of(C3,C) & (exists P (end_point(P,C3) & end_point(P,C2) & end_point(P,C1))) & part_of(C2,C) & part_of(C1,C) -> part_of(C2,C3) | part_of(C1,C2) | part_of(C3,C1) | part_of(C1,C3) | part_of(C2,C1) | part_of(C3,C2))) # label(c2) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 17 (all C all P all Q all R ((exists Cpp (end_point(P,Cpp) & inner_point(Q,Cpp) & end_point(R,Cpp) & part_of(Cpp,C))) & P != R <-> between_c(C,P,Q,R))) # label(between_c_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 18 (all P all Q all R all O (between_o(O,P,Q,R) <-> (exists C ((all P (incident_o(P,O) <-> incident_c(P,C))) & between_c(C,P,Q,R))))) # label(o3) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 19 (all P all O (finish_point(P,O) <-> incident_o(P,O) & (all Q (incident_o(Q,O) & Q != P -> ordered_by(O,Q,P))))) # label(finish_point_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 20 (all O all P all Q (ordered_by(O,P,Q) -> incident_o(P,O) & incident_o(Q,O))) # label(o1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 21 (all O all P all Q all R (between_o(O,P,Q,R) <-> ordered_by(O,Q,P) & ordered_by(O,R,Q) | ordered_by(O,P,Q) & ordered_by(O,Q,R))) # label(between_o_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 22 (all O exists P start_point(P,O)) # label(o4) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 23 (all O1 all O2 ((all P all Q (ordered_by(O1,P,Q) <-> ordered_by(O2,P,Q))) -> O2 = O1)) # label(o6) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 24 (all P all Q all C (open(C) & P != Q & incident_c(Q,C) & incident_c(P,C) -> (exists O ((all R (incident_o(R,O) <-> incident_c(R,C))) & ordered_by(O,P,Q))))) # label(o5) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 25 (all P all O (start_point(P,O) <-> (all Q (incident_o(Q,O) & Q != P -> ordered_by(O,P,Q))) & incident_o(P,O))) # label(start_point_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 26 (all O exists C ((all P (incident_o(P,O) <-> incident_c(P,C))) & open(C))) # label(o2) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 27 (all C all O ((all P (incident_o(P,O) <-> incident_c(P,C))) <-> C = underlying_curve(O))) # label(underlying_curve_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.01 28 -(all O all P (start_point(P,O) -> end_point(P,underlying_curve(O)))) # label(theorem_4_6_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.43/1.01 0.43/1.01 ============================== end of process non-clausal formulas === 0.43/1.01 0.43/1.01 ============================== PROCESS INITIAL CLAUSES =============== 0.43/1.01 0.43/1.01 ============================== PREDICATE ELIMINATION ================= 0.43/1.01 29 end_point(f4(A),A) | -open(A) # label(open_defn) # label(axiom). [clausify(5)]. 0.75/1.01 30 open(f23(A)) # label(o2) # label(axiom). [clausify(26)]. 0.75/1.01 31 -end_point(A,B) | open(B) # label(open_defn) # label(axiom). [clausify(5)]. 0.75/1.01 Derived: end_point(f4(f23(A)),f23(A)). [resolve(29,b,30,a)]. 0.75/1.01 Derived: end_point(f4(A),A) | -end_point(B,A). [resolve(29,b,31,b)]. 0.75/1.01 32 -part_of(A,B) | B = A | open(A) # label(c1) # label(axiom). [clausify(6)]. 0.75/1.01 Derived: -part_of(A,B) | B = A | end_point(f4(A),A). [resolve(32,c,29,b)]. 0.75/1.01 33 -open(A) | B = C | -incident_c(B,A) | -incident_c(C,A) | ordered_by(f21(C,B,A),C,B) # label(o5) # label(axiom). [clausify(24)]. 0.75/1.01 Derived: A = B | -incident_c(A,f23(C)) | -incident_c(B,f23(C)) | ordered_by(f21(B,A,f23(C)),B,A). [resolve(33,a,30,a)]. 0.75/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | ordered_by(f21(B,A,C),B,A) | -end_point(D,C). [resolve(33,a,31,b)]. 0.75/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | ordered_by(f21(B,A,C),B,A) | -part_of(C,D) | D = C. [resolve(33,a,32,c)]. 0.75/1.01 34 -open(A) | B = C | -incident_c(B,A) | -incident_c(C,A) | -incident_o(D,f21(C,B,A)) | incident_c(D,A) # label(o5) # label(axiom). [clausify(24)]. 0.75/1.01 Derived: A = B | -incident_c(A,f23(C)) | -incident_c(B,f23(C)) | -incident_o(D,f21(B,A,f23(C))) | incident_c(D,f23(C)). [resolve(34,a,30,a)]. 0.75/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | -incident_o(D,f21(B,A,C)) | incident_c(D,C) | -end_point(E,C). [resolve(34,a,31,b)]. 0.75/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | -incident_o(D,f21(B,A,C)) | incident_c(D,C) | -part_of(C,E) | E = C. [resolve(34,a,32,c)]. 0.75/1.01 35 -open(A) | B = C | -incident_c(B,A) | -incident_c(C,A) | incident_o(D,f21(C,B,A)) | -incident_c(D,A) # label(o5) # label(axiom). [clausify(24)]. 0.75/1.01 Derived: A = B | -incident_c(A,f23(C)) | -incident_c(B,f23(C)) | incident_o(D,f21(B,A,f23(C))) | -incident_c(D,f23(C)). [resolve(35,a,30,a)]. 0.75/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | incident_o(D,f21(B,A,C)) | -incident_c(D,C) | -end_point(E,C). [resolve(35,a,31,b)]. 0.75/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | incident_o(D,f21(B,A,C)) | -incident_c(D,C) | -part_of(C,E) | E = C. [resolve(35,a,32,c)]. 0.75/1.01 36 -start_point(A,B) | incident_o(A,B) # label(start_point_defn) # label(axiom). [clausify(25)]. 0.75/1.01 37 start_point(c11,c10) # label(theorem_4_6_1) # label(negated_conjecture). [clausify(28)]. 0.75/1.01 38 start_point(f18(A),A) # label(o4) # label(axiom). [clausify(22)]. 0.75/1.01 Derived: incident_o(c11,c10). [resolve(36,a,37,a)]. 0.75/1.01 Derived: incident_o(f18(A),A). [resolve(36,a,38,a)]. 0.75/1.01 39 start_point(A,B) | incident_o(f22(A,B),B) | -incident_o(A,B) # label(start_point_defn) # label(axiom). [clausify(25)]. 0.75/1.01 40 start_point(A,B) | f22(A,B) != A | -incident_o(A,B) # label(start_point_defn) # label(axiom). [clausify(25)]. 0.75/1.01 41 start_point(A,B) | -ordered_by(B,A,f22(A,B)) | -incident_o(A,B) # label(start_point_defn) # label(axiom). [clausify(25)]. 0.75/1.01 42 -start_point(A,B) | -incident_o(C,B) | C = A | ordered_by(B,A,C) # label(start_point_defn) # label(axiom). [clausify(25)]. 0.75/1.01 Derived: -incident_o(A,c10) | A = c11 | ordered_by(c10,c11,A). [resolve(42,a,37,a)]. 0.75/1.01 Derived: -incident_o(A,B) | A = f18(B) | ordered_by(B,f18(B),A). [resolve(42,a,38,a)]. 0.75/1.01 Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | incident_o(f22(C,B),B) | -incident_o(C,B). [resolve(42,a,39,a)]. 0.75/1.01 Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | f22(C,B) != C | -incident_o(C,B). [resolve(42,a,40,a)]. 0.75/1.01 Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | -ordered_by(B,C,f22(C,B)) | -incident_o(C,B). [resolve(42,a,41,a)]. 0.75/1.01 43 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(7)]. 0.75/1.01 44 inner_point(f2(A),A) # label(c3) # label(axiom). [clausify(3)]. 0.75/1.01 Derived: -end_point(f2(A),A). [resolve(43,a,44,a)]. 0.75/1.01 45 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(7)]. 0.75/1.01 Derived: incident_c(f2(A),A). [resolve(45,a,44,a)]. 0.75/1.01 46 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(7)]. 0.75/1.01 47 -inner_point(A,B) | meet(A,f11(B,A),f12(B,A)) # label(c4) # label(axiom). [clausify(14)]. 0.75/1.01 Derived: meet(f2(A),f11(A,f2(A)),f12(A,f2(A))). [resolve(47,a,44,a)]. 0.75/1.01 Derived: meet(A,f11(B,A),f12(B,A)) | -incident_c(A,B) | end_point(A,B). [resolve(47,a,46,a)]. 0.75/1.01 48 -inner_point(A,B) | sum(f11(B,A),f12(B,A)) = B # label(c4) # label(axiom). [clausify(14)]. 0.75/1.01 Derived: sum(f11(A,f2(A)),f12(A,f2(A))) = A. [resolve(48,a,44,a)]. 0.75/1.01 Derived: sum(f11(A,B),f12(A,B)) = A | -incident_c(B,A) | end_point(B,A). [resolve(48,a,46,a)]. 0.75/1.01 49 inner_point(A,f14(B,C,A,D)) | -between_c(B,C,A,D) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.75/1.01 Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)). [resolve(49,a,43,a)]. 0.75/1.01 Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)). [resolve(49,a,45,a)]. 0.75/1.01 Derived: -between_c(A,B,C,D) | meet(C,f11(f14(A,B,C,D),C),f12(f14(A,B,C,D),C)). [resolve(49,a,47,a)]. 0.75/1.01 Derived: -between_c(A,B,C,D) | sum(f11(f14(A,B,C,D),C),f12(f14(A,B,C,D),C)) = f14(A,B,C,D). [resolve(49,a,48,a)]. 0.75/1.01 50 -end_point(A,B) | -inner_point(C,B) | -end_point(D,B) | -part_of(B,E) | D = A | between_c(E,A,C,D) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.75/1.02 Derived: -end_point(A,B) | -end_point(C,B) | -part_of(B,D) | C = A | between_c(D,A,f2(B),C). [resolve(50,b,44,a)]. 0.75/1.02 Derived: -end_point(A,B) | -end_point(C,B) | -part_of(B,D) | C = A | between_c(D,A,E,C) | -incident_c(E,B) | end_point(E,B). [resolve(50,b,46,a)]. 0.75/1.02 Derived: -end_point(A,f14(B,C,D,E)) | -end_point(F,f14(B,C,D,E)) | -part_of(f14(B,C,D,E),V6) | F = A | between_c(V6,A,D,F) | -between_c(B,C,D,E). [resolve(50,b,49,a)]. 0.75/1.02 51 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom). [clausify(15)]. 0.75/1.02 52 end_point(f13(A),A) | closed(A) # label(closed_defn) # label(axiom). [clausify(15)]. 0.75/1.02 Derived: -end_point(A,B) | end_point(f13(B),B). [resolve(51,b,52,b)]. 0.75/1.02 53 sum(A,B) != C | -meet(D,A,B) | -closed(C) | -end_point(E,A) | meet(E,A,B) # label(c7) # label(axiom). [clausify(2)]. 0.75/1.02 Derived: sum(A,B) != C | -meet(D,A,B) | -end_point(E,A) | meet(E,A,B) | end_point(f13(C),C). [resolve(53,c,52,b)]. 0.75/1.02 54 finish_point(A,B) | -incident_o(A,B) | incident_o(f17(A,B),B) # label(finish_point_defn) # label(axiom). [clausify(19)]. 0.75/1.02 55 -finish_point(A,B) | incident_o(A,B) # label(finish_point_defn) # label(axiom). [clausify(19)]. 0.75/1.02 56 finish_point(A,B) | -incident_o(A,B) | f17(A,B) != A # label(finish_point_defn) # label(axiom). [clausify(19)]. 0.75/1.02 57 finish_point(A,B) | -incident_o(A,B) | -ordered_by(B,f17(A,B),A) # label(finish_point_defn) # label(axiom). [clausify(19)]. 0.75/1.02 58 -finish_point(A,B) | -incident_o(C,B) | C = A | ordered_by(B,C,A) # label(finish_point_defn) # label(axiom). [clausify(19)]. 0.75/1.02 Derived: -incident_o(A,B) | A = C | ordered_by(B,A,C) | -incident_o(C,B) | incident_o(f17(C,B),B). [resolve(58,a,54,a)]. 0.75/1.02 Derived: -incident_o(A,B) | A = C | ordered_by(B,A,C) | -incident_o(C,B) | f17(C,B) != C. [resolve(58,a,56,a)]. 0.75/1.02 Derived: -incident_o(A,B) | A = C | ordered_by(B,A,C) | -incident_o(C,B) | -ordered_by(B,f17(C,B),C). [resolve(58,a,57,a)]. 0.75/1.02 59 between_o(A,B,C,D) | -ordered_by(A,C,B) | -ordered_by(A,D,C) # label(between_o_defn) # label(axiom). [clausify(21)]. 0.75/1.02 60 -between_o(A,B,C,D) | ordered_by(A,C,B) | ordered_by(A,B,C) # label(between_o_defn) # label(axiom). [clausify(21)]. 0.75/1.02 61 -between_o(A,B,C,D) | ordered_by(A,C,B) | ordered_by(A,C,D) # label(between_o_defn) # label(axiom). [clausify(21)]. 0.75/1.02 62 -between_o(A,B,C,D) | ordered_by(A,D,C) | ordered_by(A,B,C) # label(between_o_defn) # label(axiom). [clausify(21)]. 0.75/1.02 63 -between_o(A,B,C,D) | ordered_by(A,D,C) | ordered_by(A,C,D) # label(between_o_defn) # label(axiom). [clausify(21)]. 0.75/1.02 64 between_o(A,B,C,D) | -ordered_by(A,B,C) | -ordered_by(A,C,D) # label(between_o_defn) # label(axiom). [clausify(21)]. 0.75/1.02 65 -between_o(A,B,C,D) | between_c(f15(B,C,D,A),B,C,D) # label(o3) # label(axiom). [clausify(18)]. 0.75/1.02 Derived: between_c(f15(A,B,C,D),A,B,C) | -ordered_by(D,B,A) | -ordered_by(D,C,B). [resolve(65,a,59,a)]. 0.75/1.02 Derived: between_c(f15(A,B,C,D),A,B,C) | -ordered_by(D,A,B) | -ordered_by(D,B,C). [resolve(65,a,64,a)]. 0.75/1.02 66 -between_o(A,B,C,D) | -incident_o(E,A) | incident_c(E,f15(B,C,D,A)) # label(o3) # label(axiom). [clausify(18)]. 0.75/1.02 Derived: -incident_o(A,B) | incident_c(A,f15(C,D,E,B)) | -ordered_by(B,D,C) | -ordered_by(B,E,D). [resolve(66,a,59,a)]. 0.75/1.02 Derived: -incident_o(A,B) | incident_c(A,f15(C,D,E,B)) | -ordered_by(B,C,D) | -ordered_by(B,D,E). [resolve(66,a,64,a)]. 0.75/1.02 67 -between_o(A,B,C,D) | incident_o(E,A) | -incident_c(E,f15(B,C,D,A)) # label(o3) # label(axiom). [clausify(18)]. 0.75/1.02 Derived: incident_o(A,B) | -incident_c(A,f15(C,D,E,B)) | -ordered_by(B,D,C) | -ordered_by(B,E,D). [resolve(67,a,59,a)]. 0.75/1.02 Derived: incident_o(A,B) | -incident_c(A,f15(C,D,E,B)) | -ordered_by(B,C,D) | -ordered_by(B,D,E). [resolve(67,a,64,a)]. 0.75/1.02 68 between_o(A,B,C,D) | incident_o(f16(B,C,D,A,E),A) | incident_c(f16(B,C,D,A,E),E) | -between_c(E,B,C,D) # label(o3) # label(axiom). [clausify(18)]. 0.75/1.02 Derived: incident_o(f16(A,B,C,D,E),D) | incident_c(f16(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,B,A) | ordered_by(D,A,B). [resolve(68,a,60,a)]. 0.75/1.02 Derived: incident_o(f16(A,B,C,D,E),D) | incident_c(f16(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(Alarm clock 179.79/180.08 Prover9 interrupted 179.79/180.08 EOF