TSTP Solution File: GEO150+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO150+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 : Sat Jul 16 05:54:24 EDT 2022
% Result : Timeout 300.01s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GEO150+1 : TPTP v8.1.0. Released v2.4.0.
% 0.05/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Fri Jun 17 16:38:46 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.71/1.02 ============================== Prover9 ===============================
% 0.71/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.02 Process 9309 was started by sandbox2 on n032.cluster.edu,
% 0.71/1.02 Fri Jun 17 16:38:46 2022
% 0.71/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9156_n032.cluster.edu".
% 0.71/1.02 ============================== end of head ===========================
% 0.71/1.02
% 0.71/1.02 ============================== INPUT =================================
% 0.71/1.02
% 0.71/1.02 % Reading from file /tmp/Prover9_9156_n032.cluster.edu
% 0.71/1.02
% 0.71/1.02 set(prolog_style_variables).
% 0.71/1.02 set(auto2).
% 0.71/1.02 % set(auto2) -> set(auto).
% 0.71/1.02 % set(auto) -> set(auto_inference).
% 0.71/1.02 % set(auto) -> set(auto_setup).
% 0.71/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.02 % set(auto) -> set(auto_limits).
% 0.71/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.02 % set(auto) -> set(auto_denials).
% 0.71/1.02 % set(auto) -> set(auto_process).
% 0.71/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.02 % set(auto2) -> assign(stats, some).
% 0.71/1.02 % set(auto2) -> clear(echo_input).
% 0.71/1.02 % set(auto2) -> set(quiet).
% 0.71/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.02 % set(auto2) -> clear(print_given).
% 0.71/1.02 assign(lrs_ticks,-1).
% 0.71/1.02 assign(sos_limit,10000).
% 0.71/1.02 assign(order,kbo).
% 0.71/1.02 set(lex_order_vars).
% 0.71/1.02 clear(print_given).
% 0.71/1.02
% 0.71/1.02 % formulas(sos). % not echoed (37 formulas)
% 0.71/1.02
% 0.71/1.02 ============================== end of input ==========================
% 0.71/1.02
% 0.71/1.02 % From the command line: assign(max_seconds, 300).
% 0.71/1.02
% 0.71/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.02
% 0.71/1.02 % Formulas that are not ordinary clauses:
% 0.71/1.02 1 (all C all C1 (part_of(C1,C) <-> (all P (incident_c(P,C1) -> incident_c(P,C))))) # label(part_of_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 2 (all C all C1 all C2 (C = sum(C1,C2) <-> (all Q (incident_c(Q,C) <-> incident_c(Q,C1) | incident_c(Q,C2))))) # label(sum_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 3 (all P all C (end_point(P,C) <-> incident_c(P,C) & (all C1 all C2 (part_of(C1,C) & part_of(C2,C) & incident_c(P,C1) & incident_c(P,C2) -> part_of(C1,C2) | part_of(C2,C1))))) # label(end_point_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 4 (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.71/1.02 5 (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,C) & end_point(Q,C1))))) # label(meet_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 6 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 7 (all C (open(C) <-> (exists P end_point(P,C)))) # label(open_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 8 (all C all C1 (part_of(C1,C) & C1 != C -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 9 (all C all C1 all C2 all C3 (part_of(C1,C) & part_of(C2,C) & part_of(C3,C) & (exists P (end_point(P,C1) & end_point(P,C2) & end_point(P,C3))) -> part_of(C2,C3) | part_of(C3,C2) | part_of(C1,C2) | part_of(C2,C1) | part_of(C1,C3) | part_of(C3,C1))) # label(c2) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 10 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 11 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (meet(P,C1,C2) & C = sum(C1,C2))))) # label(c4) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 12 (all C all P all Q all R (end_point(P,C) & end_point(Q,C) & end_point(R,C) -> P = Q | P = R | Q = R)) # label(c5) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 13 (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.71/1.02 14 (all C all C1 all C2 all P (closed(C) & meet(P,C1,C2) & C = sum(C1,C2) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 15 (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.71/1.02 16 (all C all C1 ((all P (incident_c(P,C) <-> incident_c(P,C1))) -> C = C1)) # label(c9) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 17 (all C all P all Q all R (between_c(C,P,Q,R) <-> P != R & (exists Cpp (part_of(Cpp,C) & end_point(P,Cpp) & end_point(R,Cpp) & inner_point(Q,Cpp))))) # label(between_c_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 18 (all O all P all Q all R (between_o(O,P,Q,R) <-> ordered_by(O,P,Q) & ordered_by(O,Q,R) | ordered_by(O,R,Q) & ordered_by(O,Q,P))) # label(between_o_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 19 (all P all O (start_point(P,O) <-> incident_o(P,O) & (all Q (P != Q & incident_o(Q,O) -> ordered_by(O,P,Q))))) # label(start_point_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 20 (all P all O (finish_point(P,O) <-> incident_o(P,O) & (all Q (P != Q & incident_o(Q,O) -> ordered_by(O,Q,P))))) # label(finish_point_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 21 (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.71/1.02 22 (all O exists C (open(C) & (all P (incident_o(P,O) <-> incident_c(P,C))))) # label(o2) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 23 (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.71/1.02 24 (all O exists P start_point(P,O)) # label(o4) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 25 (all P all Q all C (open(C) & P != Q & incident_c(P,C) & incident_c(Q,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.71/1.02 26 (all O1 all O2 ((all P all Q (ordered_by(O1,P,Q) <-> ordered_by(O2,P,Q))) -> O1 = O2)) # label(o6) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 27 (all C all O (C = underlying_curve(O) <-> (all P (incident_o(P,O) <-> incident_c(P,C))))) # label(underlying_curve_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 28 (all X all Y all P (connect(X,Y,P) <-> once(at_the_same_time(at(X,P),at(Y,P))))) # label(connect_defn) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 29 (all A all B (once(at_the_same_time(A,B)) <-> once(at_the_same_time(B,A)))) # label(symmetry_of_at_the_same_time) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 30 (all A all B all C (once(at_the_same_time(at_the_same_time(A,B),C)) <-> once(at_the_same_time(A,at_the_same_time(B,C))))) # label(assciativity_of_at_the_same_time) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 31 (all A (once(A) -> once(at_the_same_time(A,A)))) # label(idempotence_of_at_the_same_time) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 32 (all A all B (once(at_the_same_time(A,B)) -> once(A) & once(B))) # label(conjunction_at_the_same_time) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 33 (all X all P (once(at(X,P)) <-> incident_o(P,trajectory_of(X)))) # label(at_on_trajectory) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 34 (all X exists O trajectory_of(X) = O) # label(trajectories_are_oriented_curves) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 35 (all P1 all P2 all Q1 all Q2 all X all Y (once(at_the_same_time(at(X,P1),at(Y,P2))) & once(at_the_same_time(at(X,Q1),at(Y,Q2))) -> -(ordered_by(trajectory_of(X),P1,Q1) & ordered_by(trajectory_of(Y),Q2,P2)))) # label(homogeneous_behaviour) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.02 36 (all A (once(A) -> (all X exists P once(at_the_same_time(A,at(X,P)))))) # label(localization) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.03 37 -(all P all Q all X (once(at_the_same_time(at(X,P),at(X,Q))) -> P = Q)) # label(t16) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/1.03
% 0.71/1.03 ============================== end of process non-clausal formulas ===
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.03
% 0.71/1.03 ============================== PREDICATE ELIMINATION =================
% 0.71/1.03 38 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.71/1.03 39 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.71/1.03 40 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.71/1.03 41 inner_point(f8(A),A) # label(c3) # label(axiom). [clausify(10)].
% 0.71/1.03 Derived: incident_c(f8(A),A). [resolve(41,a,39,a)].
% 0.71/1.03 Derived: -end_point(f8(A),A). [resolve(41,a,40,a)].
% 0.71/1.03 42 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom). [clausify(11)].
% 0.71/1.03 Derived: meet(A,f9(B,A),f10(B,A)) | -incident_c(A,B) | end_point(A,B). [resolve(42,a,38,a)].
% 0.71/1.03 Derived: meet(f8(A),f9(A,f8(A)),f10(A,f8(A))). [resolve(42,a,41,a)].
% 0.71/1.03 43 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom). [clausify(11)].
% 0.71/1.03 Derived: sum(f9(A,B),f10(A,B)) = A | -incident_c(B,A) | end_point(B,A). [resolve(43,a,38,a)].
% 0.71/1.03 Derived: sum(f9(A,f8(A)),f10(A,f8(A))) = A. [resolve(43,a,41,a)].
% 0.71/1.03 44 -between_c(A,B,C,D) | inner_point(C,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)].
% 0.71/1.03 Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)). [resolve(44,b,39,a)].
% 0.71/1.03 Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)). [resolve(44,b,40,a)].
% 0.71/1.03 Derived: -between_c(A,B,C,D) | meet(C,f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)). [resolve(44,b,42,a)].
% 0.71/1.03 Derived: -between_c(A,B,C,D) | sum(f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)) = f14(A,B,C,D). [resolve(44,b,43,a)].
% 0.71/1.03 45 between_c(A,B,C,D) | D = B | -part_of(E,A) | -end_point(B,E) | -end_point(D,E) | -inner_point(C,E) # label(between_c_defn) # label(axiom). [clausify(17)].
% 0.71/1.03 Derived: between_c(A,B,C,D) | D = B | -part_of(E,A) | -end_point(B,E) | -end_point(D,E) | -incident_c(C,E) | end_point(C,E). [resolve(45,f,38,a)].
% 0.71/1.03 Derived: between_c(A,B,f8(C),D) | D = B | -part_of(C,A) | -end_point(B,C) | -end_point(D,C). [resolve(45,f,41,a)].
% 0.71/1.03 Derived: between_c(A,B,C,D) | D = B | -part_of(f14(E,F,C,V6),A) | -end_point(B,f14(E,F,C,V6)) | -end_point(D,f14(E,F,C,V6)) | -between_c(E,F,C,V6). [resolve(45,f,44,b)].
% 0.71/1.03 46 closed(A) | end_point(f6(A),A) # label(closed_defn) # label(axiom). [clausify(6)].
% 0.71/1.03 47 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom). [clausify(6)].
% 0.71/1.03 Derived: end_point(f6(A),A) | -end_point(B,A). [resolve(46,a,47,a)].
% 0.71/1.03 48 -closed(A) | -meet(B,C,D) | sum(C,D) != A | -end_point(E,C) | meet(E,C,D) # label(c7) # label(axiom). [clausify(14)].
% 0.71/1.03 Derived: -meet(A,B,C) | sum(B,C) != D | -end_point(E,B) | meet(E,B,C) | end_point(f6(D),D). [resolve(48,a,46,a)].
% 0.71/1.03 49 open(A) | -end_point(B,A) # label(open_defn) # label(axiom). [clausify(7)].
% 0.71/1.03 50 -open(A) | end_point(f7(A),A) # label(open_defn) # label(axiom). [clausify(7)].
% 0.71/1.03 Derived: -end_point(A,B) | end_point(f7(B),B). [resolve(49,a,50,a)].
% 0.71/1.03 51 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom). [clausify(8)].
% 0.71/1.03 Derived: -part_of(A,B) | A = B | end_point(f7(A),A). [resolve(51,c,50,a)].
% 0.71/1.03 52 open(f17(A)) # label(o2) # label(axiom). [clausify(22)].
% 0.71/1.03 Derived: end_point(f7(f17(A)),f17(A)). [resolve(52,a,50,a)].
% 0.71/1.03 53 -open(A) | B = C | -incident_c(C,A) | -incident_c(B,A) | -incident_o(D,f21(C,B,A)) | incident_c(D,A) # label(o5) # label(axiom). [clausify(25)].
% 0.71/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | -incident_o(D,f21(B,A,C)) | incident_c(D,C) | -end_point(E,C). [resolve(53,a,49,a)].
% 0.71/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | -incident_o(D,f21(B,A,C)) | incident_c(D,C) | -part_of(C,E) | C = E. [resolve(53,a,51,c)].
% 0.71/1.03 Derived: A = B | -incident_c(B,f17(C)) | -incident_c(A,f17(C)) | -incident_o(D,f21(B,A,f17(C))) | incident_c(D,f17(C)). [resolve(53,a,52,a)].
% 0.71/1.03 54 -open(A) | B = C | -incident_c(C,A) | -incident_c(B,A) | incident_o(D,f21(C,B,A)) | -incident_c(D,A) # label(o5) # label(axiom). [clausify(25)].
% 0.71/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | incident_o(D,f21(B,A,C)) | -incident_c(D,C) | -end_point(E,C). [resolve(54,a,49,a)].
% 0.71/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | incident_o(D,f21(B,A,C)) | -incident_c(D,C) | -part_of(C,E) | C = E. [resolve(54,a,51,c)].
% 0.71/1.03 Derived: A = B | -incident_c(B,f17(C)) | -incident_c(A,f17(C)) | incident_o(D,f21(B,A,f17(C))) | -incident_c(D,f17(C)). [resolve(54,a,52,a)].
% 0.71/1.03 55 -open(A) | B = C | -incident_c(C,A) | -incident_c(B,A) | ordered_by(f21(C,B,A),C,B) # label(o5) # label(axiom). [clausify(25)].
% 0.71/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | ordered_by(f21(B,A,C),B,A) | -end_point(D,C). [resolve(55,a,49,a)].
% 0.71/1.03 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | ordered_by(f21(B,A,C),B,A) | -part_of(C,D) | C = D. [resolve(55,a,51,c)].
% 0.71/1.03 Derived: A = B | -incident_c(B,f17(C)) | -incident_c(A,f17(C)) | ordered_by(f21(B,A,f17(C)),B,A). [resolve(55,a,52,a)].
% 0.71/1.03 56 between_o(A,B,C,D) | -ordered_by(A,B,C) | -ordered_by(A,C,D) # label(between_o_defn) # label(axiom). [clausify(18)].
% 0.71/1.03 57 -between_o(A,B,C,D) | ordered_by(A,B,C) | ordered_by(A,D,C) # label(between_o_defn) # label(axiom). [clausify(18)].
% 0.71/1.03 58 -between_o(A,B,C,D) | ordered_by(A,B,C) | ordered_by(A,C,B) # label(between_o_defn) # label(axiom). [clausify(18)].
% 0.71/1.03 59 -between_o(A,B,C,D) | ordered_by(A,C,D) | ordered_by(A,D,C) # label(between_o_defn) # label(axiom). [clausify(18)].
% 0.71/1.03 60 -between_o(A,B,C,D) | ordered_by(A,C,D) | ordered_by(A,C,B) # label(between_o_defn) # label(axiom). [clausify(18)].
% 0.71/1.03 61 between_o(A,B,C,D) | -ordered_by(A,D,C) | -ordered_by(A,C,B) # label(between_o_defn) # label(axiom). [clausify(18)].
% 0.71/1.03 62 -between_o(A,B,C,D) | -incident_o(E,A) | incident_c(E,f18(B,C,D,A)) # label(o3) # label(axiom). [clausify(23)].
% 0.71/1.03 Derived: -incident_o(A,B) | incident_c(A,f18(C,D,E,B)) | -ordered_by(B,C,D) | -ordered_by(B,D,E). [resolve(62,a,56,a)].
% 0.71/1.03 Derived: -incident_o(A,B) | incident_c(A,f18(C,D,E,B)) | -ordered_by(B,E,D) | -ordered_by(B,D,C). [resolve(62,a,61,a)].
% 0.71/1.03 63 -between_o(A,B,C,D) | incident_o(E,A) | -incident_c(E,f18(B,C,D,A)) # label(o3) # label(axiom). [clausify(23)].
% 0.71/1.03 Derived: incident_o(A,B) | -incident_c(A,f18(C,D,E,B)) | -ordered_by(B,C,D) | -ordered_by(B,D,E). [resolve(63,a,56,a)].
% 0.71/1.03 Derived: incident_o(A,B) | -incident_c(A,f18(C,D,E,B)) | -ordered_by(B,E,D) | -ordered_by(B,D,C). [resolve(63,a,61,a)].
% 0.71/1.03 64 -between_o(A,B,C,D) | between_c(f18(B,C,D,A),B,C,D) # label(o3) # label(axiom). [clausify(23)].
% 0.71/1.03 Derived: between_c(f18(A,B,C,D),A,B,C) | -ordered_by(D,A,B) | -ordered_by(D,B,C). [resolve(64,a,56,a)].
% 0.71/1.03 Derived: between_c(f18(A,B,C,D),A,B,C) | -ordered_by(D,C,B) | -ordered_by(D,B,A). [resolve(64,a,61,a)].
% 0.71/1.03 65 between_o(A,B,C,D) | incident_o(f19(B,C,D,A,E),A) | incident_c(f19(B,C,D,A,E),E) | -between_c(E,B,C,D) # label(o3) # label(axiom). [clausify(23)].
% 0.71/1.03 Derived: incident_o(f19(A,B,C,D,E),D) | incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,A,B) | ordered_by(D,C,B). [resolve(65,a,57,a)].
% 0.71/1.03 Derived: incident_o(f19(A,B,C,D,E),D) | incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,A,B) | ordered_by(D,B,A). [resolve(65,a,58,a)].
% 0.71/1.03 Derived: incident_o(f19(A,B,C,D,E),D) | incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,B,C) | ordered_by(D,C,B). [resolve(65,a,59,a)].
% 0.71/1.03 Derived: incident_o(f19(A,B,C,D,E),D) | incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,B,C) | ordered_by(D,B,A). [resolve(65,a,60,a)].
% 0.71/1.03 Derived: incident_o(f19(A,B,C,D,E),D) | incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | -incident_o(F,D) | incident_c(F,f18(A,B,C,D)). [resolve(65,a,62,a)].
% 0.71/1.03 Derived: incident_o(f19(A,B,C,D,E),D) | incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | incident_o(F,D) | -incident_c(F,f18(A,B,C,D)). [resolve(65,a,63,a)].
% 0.71/1.03 Derived: incident_o(f19(A,B,C,D,E),D) | incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | between_c(f18(A,B,C,D),A,B,C). [resolve(65,a,64,a)].
% 0.75/1.05 66 between_o(A,B,C,D) | -incident_o(f19(B,C,D,A,E),A) | -incident_c(f19(B,C,D,A,E),E) | -between_c(E,B,C,D) # label(o3) # label(axiom). [clausify(23)].
% 0.75/1.05 Derived: -incident_o(f19(A,B,C,D,E),D) | -incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,A,B) | ordered_by(D,C,B). [resolve(66,a,57,a)].
% 0.75/1.05 Derived: -incident_o(f19(A,B,C,D,E),D) | -incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,A,B) | ordered_by(D,B,A). [resolve(66,a,58,a)].
% 0.75/1.05 Derived: -incident_o(f19(A,B,C,D,E),D) | -incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,B,C) | ordered_by(D,C,B). [resolve(66,a,59,a)].
% 0.75/1.05 Derived: -incident_o(f19(A,B,C,D,E),D) | -incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | ordered_by(D,B,C) | ordered_by(D,B,A). [resolve(66,a,60,a)].
% 0.75/1.05 Derived: -incident_o(f19(A,B,C,D,E),D) | -incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | -incident_o(F,D) | incident_c(F,f18(A,B,C,D)). [resolve(66,a,62,a)].
% 0.75/1.05 Derived: -incident_o(f19(A,B,C,D,E),D) | -incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | incident_o(F,D) | -incident_c(F,f18(A,B,C,D)). [resolve(66,a,63,a)].
% 0.75/1.05 Derived: -incident_o(f19(A,B,C,D,E),D) | -incident_c(f19(A,B,C,D,E),E) | -between_c(E,A,B,C) | between_c(f18(A,B,C,D),A,B,C). [resolve(66,a,64,a)].
% 0.75/1.05 67 start_point(A,B) | -incident_o(A,B) | f15(A,B) != A # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.75/1.05 68 -start_point(A,B) | incident_o(A,B) # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.75/1.05 69 -start_point(A,B) | C = A | -incident_o(C,B) | ordered_by(B,A,C) # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.75/1.05 Derived: -incident_o(A,B) | f15(A,B) != A | C = A | -incident_o(C,B) | ordered_by(B,A,C). [resolve(67,a,69,a)].
% 0.75/1.05 70 start_point(A,B) | -incident_o(A,B) | incident_o(f15(A,B),B) # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.75/1.05 Derived: -incident_o(A,B) | incident_o(f15(A,B),B) | C = A | -incident_o(C,B) | ordered_by(B,A,C). [resolve(70,a,69,a)].
% 0.75/1.05 71 start_point(A,B) | -incident_o(A,B) | -ordered_by(B,A,f15(A,B)) # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.75/1.05 Derived: -incident_o(A,B) | -ordered_by(B,A,f15(A,B)) | C = A | -incident_o(C,B) | ordered_by(B,A,C). [resolve(71,a,69,a)].
% 0.75/1.05 72 start_point(f20(A),A) # label(o4) # label(axiom). [clausify(24)].
% 0.75/1.05 Derived: incident_o(f20(A),A). [resolve(72,a,68,a)].
% 0.75/1.05 Derived: A = f20(B) | -incident_o(A,B) | ordered_by(B,f20(B),A). [resolve(72,a,69,a)].
% 0.75/1.05 73 finish_point(A,B) | -incident_o(A,B) | f16(A,B) != A # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.75/1.05 74 -finish_point(A,B) | incident_o(A,B) # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.75/1.05 75 -finish_point(A,B) | C = A | -incident_o(C,B) | ordered_by(B,C,A) # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.75/1.05 Derived: -incident_o(A,B) | f16(A,B) != A | C = A | -incident_o(C,B) | ordered_by(B,C,A). [resolve(73,a,75,a)].
% 0.75/1.05 76 finish_point(A,B) | -incident_o(A,B) | incident_o(f16(A,B),B) # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.75/1.05 Derived: -incident_o(A,B) | incident_o(f16(A,B),B) | C = A | -incident_o(C,B) | ordered_by(B,C,A). [resolve(76,a,75,a)].
% 0.75/1.05 77 finish_point(A,B) | -incident_o(A,B) | -ordered_by(B,f16(A,B),A) # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.75/1.05 Derived: -incident_o(A,B) | -ordered_by(B,f16(A,B),A) | C = A | -incident_o(C,B) | ordered_by(B,C,A). [resolve(77,a,75,a)].
% 0.75/1.05 78 connect(A,B,C) | -once(at_the_same_time(at(A,C),at(B,C))) # label(connect_defn) # label(axiom). [clausify(28)].
% 0.75/1.05 79 -connect(A,B,C) | once(at_the_same_time(at(A,C),at(B,C))) # label(connect_defn) # label(axiom). [clausify(28)].
% 0.75/1.05
% 0.75/1.05 ============================== end predicate elimination =============
% 0.75/1.05
% 0.75/1.05 Auto_denials: (non-Horn, no changes).
% 0.75/1.05
% 0.75/1.05 Term ordering decisions:
% 0.75/1.05 Function symbol KB weights: c10=1. c11=1. c12=1. at_the_same_time=1. sum=1. at=1. f1=1. f3=1. f4=1. f9=1. f10=1. f11=1. f12=1. f13=1. f15=1. f16=1. f22=1. f23=1. f24=1. f26=1. underlying_curve=1. trajectory_of=1. f6=1. f7=1. f8=1. f17=1. f20=1. f25=1. f2=1. f5=1. f21=1. f14=1. f18=1. f19=1.
% 0.75/1.05
% 0.75/1.05 ==========================Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------