0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n018.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 : 960 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Aug 9 07:54:00 EDT 2022 0.12/0.34 % CPUTime : 0.45/1.02 ============================== Prover9 =============================== 0.45/1.02 Prover9 (32) version 2009-11A, November 2009. 0.45/1.02 Process 12358 was started by sandbox2 on n018.cluster.edu, 0.45/1.02 Tue Aug 9 07:54:01 2022 0.45/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_12205_n018.cluster.edu". 0.45/1.02 ============================== end of head =========================== 0.45/1.02 0.45/1.02 ============================== INPUT ================================= 0.45/1.02 0.45/1.02 % Reading from file /tmp/Prover9_12205_n018.cluster.edu 0.45/1.02 0.45/1.02 set(prolog_style_variables). 0.45/1.02 set(auto2). 0.45/1.02 % set(auto2) -> set(auto). 0.45/1.02 % set(auto) -> set(auto_inference). 0.45/1.02 % set(auto) -> set(auto_setup). 0.45/1.02 % set(auto_setup) -> set(predicate_elim). 0.45/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.45/1.02 % set(auto) -> set(auto_limits). 0.45/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.45/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.45/1.02 % set(auto) -> set(auto_denials). 0.45/1.02 % set(auto) -> set(auto_process). 0.45/1.02 % set(auto2) -> assign(new_constants, 1). 0.45/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.45/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.45/1.02 % set(auto2) -> assign(max_hours, 1). 0.45/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.45/1.02 % set(auto2) -> assign(max_seconds, 0). 0.45/1.02 % set(auto2) -> assign(max_minutes, 5). 0.45/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.45/1.02 % set(auto2) -> set(sort_initial_sos). 0.45/1.02 % set(auto2) -> assign(sos_limit, -1). 0.45/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.45/1.02 % set(auto2) -> assign(max_megs, 400). 0.45/1.02 % set(auto2) -> assign(stats, some). 0.45/1.02 % set(auto2) -> clear(echo_input). 0.45/1.02 % set(auto2) -> set(quiet). 0.45/1.02 % set(auto2) -> clear(print_initial_clauses). 0.45/1.02 % set(auto2) -> clear(print_given). 0.45/1.02 assign(lrs_ticks,-1). 0.45/1.02 assign(sos_limit,10000). 0.45/1.02 assign(order,kbo). 0.45/1.02 set(lex_order_vars). 0.45/1.02 clear(print_given). 0.45/1.02 0.45/1.02 % formulas(sos). % not echoed (28 formulas) 0.45/1.02 0.45/1.02 ============================== end of input ========================== 0.45/1.02 0.45/1.02 % From the command line: assign(max_seconds, 960). 0.45/1.02 0.45/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.45/1.02 0.45/1.02 % Formulas that are not ordinary clauses: 0.45/1.02 1 (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.45/1.02 2 (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.45/1.02 3 (all P all C (inner_point(P,C) <-> -end_point(P,C) & incident_c(P,C))) # label(inner_point_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.02 4 (all C all P all Q all R (end_point(Q,C) & end_point(R,C) & end_point(P,C) -> P = R | R = Q | Q = P)) # label(c5) # label(axiom) # label(non_clause). [assumption]. 0.45/1.02 5 (all C all C1 all C2 all C3 (part_of(C1,C) & part_of(C3,C) & (exists P (end_point(P,C3) & end_point(P,C2) & end_point(P,C1))) & part_of(C2,C) -> part_of(C3,C2) | part_of(C1,C2) | part_of(C2,C1) | part_of(C1,C3) | part_of(C3,C1) | part_of(C2,C3))) # label(c2) # label(axiom) # label(non_clause). [assumption]. 0.45/1.02 6 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 7 (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.45/1.03 8 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 9 (all P all C all C1 (meet(P,C,C1) <-> incident_c(P,C) & incident_c(P,C1) & (all Q (incident_c(Q,C) & incident_c(Q,C1) -> end_point(Q,C1) & end_point(Q,C))))) # label(meet_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 10 (all C all C1 all C2 all P (meet(P,C1,C2) & sum(C1,C2) = C & closed(C) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 11 (all C all P (end_point(P,C) -> (exists Q (end_point(Q,C) & P != Q)))) # label(c6) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 12 (all C all C1 all C2 (C = sum(C1,C2) <-> (all Q (incident_c(Q,C) <-> incident_c(Q,C2) | incident_c(Q,C1))))) # label(sum_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 13 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 14 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 15 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (meet(P,C1,C2) & sum(C1,C2) = C)))) # label(c4) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 16 (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(C2,C1) | part_of(C1,C2))) <-> end_point(P,C))) # label(end_point_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 17 (all C all P all Q all R (between_c(C,P,Q,R) <-> (exists Cpp (inner_point(Q,Cpp) & end_point(R,Cpp) & end_point(P,Cpp) & part_of(Cpp,C))) & R != P)) # label(between_c_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 18 (all P all O (finish_point(P,O) <-> (all Q (incident_o(Q,O) & Q != P -> ordered_by(O,Q,P))) & incident_o(P,O))) # label(finish_point_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 19 (all P all O (incident_o(P,O) & (all Q (incident_o(Q,O) & P != Q -> ordered_by(O,P,Q))) <-> start_point(P,O))) # label(start_point_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 20 (all P all Q all R all O (between_o(O,P,Q,R) <-> (exists C ((all P (incident_c(P,C) <-> incident_o(P,O))) & between_c(C,P,Q,R))))) # label(o3) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 21 (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.45/1.03 22 (all P all Q all C (P != Q & incident_c(P,C) & incident_c(Q,C) & open(C) -> (exists O (ordered_by(O,P,Q) & (all R (incident_o(R,O) <-> incident_c(R,C))))))) # label(o5) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 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.45/1.03 24 (all O exists P start_point(P,O)) # label(o4) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 25 (all O all P all Q (ordered_by(O,P,Q) -> incident_o(Q,O) & incident_o(P,O))) # label(o1) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 26 (all C all O ((all P (incident_c(P,C) <-> incident_o(P,O))) <-> underlying_curve(O) = C)) # label(underlying_curve_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 27 (all O all P all Q all R (between_o(O,P,Q,R) <-> ordered_by(O,Q,R) & ordered_by(O,P,Q) | ordered_by(O,R,Q) & ordered_by(O,Q,P))) # label(between_o_defn) # label(axiom) # label(non_clause). [assumption]. 0.45/1.03 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.45/1.03 0.45/1.03 ============================== end of process non-clausal formulas === 0.45/1.03 0.45/1.03 ============================== PROCESS INITIAL CLAUSES =============== 0.45/1.03 0.45/1.03 ============================== PREDICATE ELIMINATION ================= 0.45/1.03 29 end_point(f3(A),A) | -open(A) # label(open_defn) # label(axiom). [clausify(6)]. 0.45/1.03 30 open(f19(A)) # label(o2) # label(axiom). [clausify(21)]. 0.45/1.03 31 -end_point(A,B) | open(B) # label(open_defn) # label(axiom). [clausify(6)]. 0.45/1.03 Derived: end_point(f3(f19(A)),f19(A)). [resolve(29,b,30,a)]. 0.45/1.03 Derived: end_point(f3(A),A) | -end_point(B,A). [resolve(29,b,31,b)]. 0.45/1.03 32 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom). [clausify(14)]. 0.45/1.03 Derived: -part_of(A,B) | A = B | end_point(f3(A),A). [resolve(32,c,29,b)]. 0.45/1.03 33 A = B | -incident_c(B,C) | -incident_c(A,C) | -open(C) | ordered_by(f20(B,A,C),B,A) # label(o5) # label(axiom). [clausify(22)]. 0.45/1.03 Derived: A = B | -incident_c(B,f19(C)) | -incident_c(A,f19(C)) | ordered_by(f20(B,A,f19(C)),B,A). [resolve(33,d,30,a)]. 0.45/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | ordered_by(f20(B,A,C),B,A) | -end_point(D,C). [resolve(33,d,31,b)]. 0.45/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | ordered_by(f20(B,A,C),B,A) | -part_of(C,D) | C = D. [resolve(33,d,32,c)]. 0.45/1.03 34 A = B | -incident_c(B,C) | -incident_c(A,C) | -open(C) | -incident_o(D,f20(B,A,C)) | incident_c(D,C) # label(o5) # label(axiom). [clausify(22)]. 0.77/1.03 Derived: A = B | -incident_c(B,f19(C)) | -incident_c(A,f19(C)) | -incident_o(D,f20(B,A,f19(C))) | incident_c(D,f19(C)). [resolve(34,d,30,a)]. 0.77/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | -incident_o(D,f20(B,A,C)) | incident_c(D,C) | -end_point(E,C). [resolve(34,d,31,b)]. 0.77/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | -incident_o(D,f20(B,A,C)) | incident_c(D,C) | -part_of(C,E) | C = E. [resolve(34,d,32,c)]. 0.77/1.03 35 A = B | -incident_c(B,C) | -incident_c(A,C) | -open(C) | incident_o(D,f20(B,A,C)) | -incident_c(D,C) # label(o5) # label(axiom). [clausify(22)]. 0.77/1.03 Derived: A = B | -incident_c(B,f19(C)) | -incident_c(A,f19(C)) | incident_o(D,f20(B,A,f19(C))) | -incident_c(D,f19(C)). [resolve(35,d,30,a)]. 0.77/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | incident_o(D,f20(B,A,C)) | -incident_c(D,C) | -end_point(E,C). [resolve(35,d,31,b)]. 0.77/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | incident_o(D,f20(B,A,C)) | -incident_c(D,C) | -part_of(C,E) | C = E. [resolve(35,d,32,c)]. 0.77/1.03 36 incident_o(A,B) | -start_point(A,B) # label(start_point_defn) # label(axiom). [clausify(19)]. 0.77/1.03 37 start_point(c11,c10) # label(theorem_4_6_1) # label(negated_conjecture). [clausify(28)]. 0.77/1.03 38 start_point(f23(A),A) # label(o4) # label(axiom). [clausify(24)]. 0.77/1.03 Derived: incident_o(c11,c10). [resolve(36,b,37,a)]. 0.77/1.03 Derived: incident_o(f23(A),A). [resolve(36,b,38,a)]. 0.77/1.03 39 -incident_o(A,B) | incident_o(f16(A,B),B) | start_point(A,B) # label(start_point_defn) # label(axiom). [clausify(19)]. 0.77/1.03 40 -incident_o(A,B) | f16(A,B) != A | start_point(A,B) # label(start_point_defn) # label(axiom). [clausify(19)]. 0.77/1.03 41 -incident_o(A,B) | -ordered_by(B,A,f16(A,B)) | start_point(A,B) # label(start_point_defn) # label(axiom). [clausify(19)]. 0.77/1.03 42 -incident_o(A,B) | A = C | ordered_by(B,C,A) | -start_point(C,B) # label(start_point_defn) # label(axiom). [clausify(19)]. 0.77/1.03 Derived: -incident_o(A,c10) | A = c11 | ordered_by(c10,c11,A). [resolve(42,d,37,a)]. 0.77/1.03 Derived: -incident_o(A,B) | A = f23(B) | ordered_by(B,f23(B),A). [resolve(42,d,38,a)]. 0.77/1.03 Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | -incident_o(C,B) | incident_o(f16(C,B),B). [resolve(42,d,39,c)]. 0.77/1.03 Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | -incident_o(C,B) | f16(C,B) != C. [resolve(42,d,40,c)]. 0.77/1.03 Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | -incident_o(C,B) | -ordered_by(B,C,f16(C,B)). [resolve(42,d,41,c)]. 0.77/1.03 43 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.77/1.03 44 inner_point(f9(A),A) # label(c3) # label(axiom). [clausify(13)]. 0.77/1.03 Derived: -end_point(f9(A),A). [resolve(43,a,44,a)]. 0.77/1.03 45 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.77/1.03 Derived: incident_c(f9(A),A). [resolve(45,a,44,a)]. 0.77/1.03 46 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.77/1.03 47 -inner_point(A,B) | meet(A,f10(B,A),f11(B,A)) # label(c4) # label(axiom). [clausify(15)]. 0.77/1.03 Derived: meet(f9(A),f10(A,f9(A)),f11(A,f9(A))). [resolve(47,a,44,a)]. 0.77/1.03 Derived: meet(A,f10(B,A),f11(B,A)) | end_point(A,B) | -incident_c(A,B). [resolve(47,a,46,a)]. 0.77/1.03 48 -inner_point(A,B) | sum(f10(B,A),f11(B,A)) = B # label(c4) # label(axiom). [clausify(15)]. 0.77/1.03 Derived: sum(f10(A,f9(A)),f11(A,f9(A))) = A. [resolve(48,a,44,a)]. 0.77/1.03 Derived: sum(f10(A,B),f11(A,B)) = A | end_point(B,A) | -incident_c(B,A). [resolve(48,a,46,a)]. 0.77/1.03 49 -between_c(A,B,C,D) | inner_point(C,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.77/1.03 Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)). [resolve(49,b,43,a)]. 0.77/1.03 Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)). [resolve(49,b,45,a)]. 0.77/1.03 Derived: -between_c(A,B,C,D) | meet(C,f10(f14(A,B,C,D),C),f11(f14(A,B,C,D),C)). [resolve(49,b,47,a)]. 0.77/1.03 Derived: -between_c(A,B,C,D) | sum(f10(f14(A,B,C,D),C),f11(f14(A,B,C,D),C)) = f14(A,B,C,D). [resolve(49,b,48,a)]. 0.77/1.03 50 between_c(A,B,C,D) | -inner_point(C,E) | -end_point(D,E) | -end_point(B,E) | -part_of(E,A) | D = B # label(between_c_defn) # label(axiom). [clausify(17)]. 0.77/1.04 Derived: between_c(A,B,f9(C),D) | -end_point(D,C) | -end_point(B,C) | -part_of(C,A) | D = B. [resolve(50,b,44,a)]. 0.77/1.04 Derived: between_c(A,B,C,D) | -end_point(D,E) | -end_point(B,E) | -part_of(E,A) | D = B | end_point(C,E) | -incident_c(C,E). [resolve(50,b,46,a)]. 0.77/1.04 Derived: between_c(A,B,C,D) | -end_point(D,f14(E,F,C,V6)) | -end_point(B,f14(E,F,C,V6)) | -part_of(f14(E,F,C,V6),A) | D = B | -between_c(E,F,C,V6). [resolve(50,b,49,b)]. 0.77/1.04 51 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom). [clausify(8)]. 0.77/1.04 52 closed(A) | end_point(f5(A),A) # label(closed_defn) # label(axiom). [clausify(8)]. 0.77/1.04 Derived: -end_point(A,B) | end_point(f5(B),B). [resolve(51,a,52,a)]. 0.77/1.04 53 -meet(A,B,C) | sum(B,C) != D | -closed(D) | -end_point(E,B) | meet(E,B,C) # label(c7) # label(axiom). [clausify(10)]. 0.77/1.04 Derived: -meet(A,B,C) | sum(B,C) != D | -end_point(E,B) | meet(E,B,C) | end_point(f5(D),D). [resolve(53,c,52,a)]. 0.77/1.04 54 finish_point(A,B) | incident_o(f15(A,B),B) | -incident_o(A,B) # label(finish_point_defn) # label(axiom). [clausify(18)]. 0.77/1.04 55 -finish_point(A,B) | incident_o(A,B) # label(finish_point_defn) # label(axiom). [clausify(18)]. 0.77/1.04 56 finish_point(A,B) | f15(A,B) != A | -incident_o(A,B) # label(finish_point_defn) # label(axiom). [clausify(18)]. 0.77/1.04 57 finish_point(A,B) | -ordered_by(B,f15(A,B),A) | -incident_o(A,B) # label(finish_point_defn) # label(axiom). [clausify(18)]. 0.77/1.04 58 -finish_point(A,B) | -incident_o(C,B) | C = A | ordered_by(B,C,A) # label(finish_point_defn) # label(axiom). [clausify(18)]. 0.77/1.04 Derived: -incident_o(A,B) | A = C | ordered_by(B,A,C) | incident_o(f15(C,B),B) | -incident_o(C,B). [resolve(58,a,54,a)]. 0.77/1.04 Derived: -incident_o(A,B) | A = C | ordered_by(B,A,C) | f15(C,B) != C | -incident_o(C,B). [resolve(58,a,56,a)]. 0.77/1.04 Derived: -incident_o(A,B) | A = C | ordered_by(B,A,C) | -ordered_by(B,f15(C,B),C) | -incident_o(C,B). [resolve(58,a,57,a)]. 0.77/1.04 59 between_o(A,B,C,D) | -ordered_by(A,C,D) | -ordered_by(A,B,C) # label(between_o_defn) # label(axiom). [clausify(27)]. 0.77/1.04 60 -between_o(A,B,C,D) | ordered_by(A,C,D) | ordered_by(A,D,C) # label(between_o_defn) # label(axiom). [clausify(27)]. 0.77/1.04 61 -between_o(A,B,C,D) | ordered_by(A,C,D) | ordered_by(A,C,B) # label(between_o_defn) # label(axiom). [clausify(27)]. 0.77/1.04 62 -between_o(A,B,C,D) | ordered_by(A,B,C) | ordered_by(A,D,C) # label(between_o_defn) # label(axiom). [clausify(27)]. 0.77/1.04 63 -between_o(A,B,C,D) | ordered_by(A,B,C) | ordered_by(A,C,B) # label(between_o_defn) # label(axiom). [clausify(27)]. 0.77/1.04 64 between_o(A,B,C,D) | -ordered_by(A,D,C) | -ordered_by(A,C,B) # label(between_o_defn) # label(axiom). [clausify(27)]. 0.77/1.04 65 -between_o(A,B,C,D) | between_c(f17(B,C,D,A),B,C,D) # label(o3) # label(axiom). [clausify(20)]. 0.77/1.04 Derived: between_c(f17(A,B,C,D),A,B,C) | -ordered_by(D,B,C) | -ordered_by(D,A,B). [resolve(65,a,59,a)]. 0.77/1.04 Derived: between_c(f17(A,B,C,D),A,B,C) | -ordered_by(D,C,B) | -ordered_by(D,B,A). [resolve(65,a,64,a)]. 0.77/1.04 66 -between_o(A,B,C,D) | -incident_c(E,f17(B,C,D,A)) | incident_o(E,A) # label(o3) # label(axiom). [clausify(20)]. 0.77/1.04 Derived: -incident_c(A,f17(B,C,D,E)) | incident_o(A,E) | -ordered_by(E,C,D) | -ordered_by(E,B,C). [resolve(66,a,59,a)]. 0.77/1.04 Derived: -incident_c(A,f17(B,C,D,E)) | incident_o(A,E) | -ordered_by(E,D,C) | -ordered_by(E,C,B). [resolve(66,a,64,a)]. 0.77/1.04 67 -between_o(A,B,C,D) | incident_c(E,f17(B,C,D,A)) | -incident_o(E,A) # label(o3) # label(axiom). [clausify(20)]. 0.77/1.04 Derived: incident_c(A,f17(B,C,D,E)) | -incident_o(A,E) | -ordered_by(E,C,D) | -ordered_by(E,B,C). [resolve(67,a,59,a)]. 0.77/1.04 Derived: incident_c(A,f17(B,C,D,E)) | -incident_o(A,E) | -ordered_by(E,D,C) | -ordered_by(E,C,B). [resolve(67,a,64,a)]. 0.77/1.04 68 between_o(A,B,C,D) | incident_c(f18(B,C,D,A,E),E) | incident_o(f18(B,C,D,A,E),A) | -between_c(E,B,C,D) # label(o3) # label(axiom). [clausify(20)]. 0.77/1.04 Derived: incident_c(f18(A,B,C,D,E),E) | incident_o(f18(A,B,C,D,E),D) | -between_c(E,A,B,C) | ordered_by(D,B,C) | ordered_by(D,C,B). [resolve(68,a,60,a)]. 0.77/1.04 Derived: incident_c(f18(A,B,C,D,E),E) | incident_o(f18(A,B,C,D,E),D) | -between_c(E,A,B,C) | ordered_by(Alarm clock 119.57/120.05 Prover9 interrupted 119.57/120.05 EOF