TSTP Solution File: GEO117+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO117+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:07 EDT 2022
% Result : Theorem 0.90s 1.16s
% Output : Refutation 0.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO117+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 15:01:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.00 ============================== Prover9 ===============================
% 0.43/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00 Process 22928 was started by sandbox on n028.cluster.edu,
% 0.43/1.00 Sat Jun 18 15:01:45 2022
% 0.43/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22775_n028.cluster.edu".
% 0.43/1.00 ============================== end of head ===========================
% 0.43/1.00
% 0.43/1.00 ============================== INPUT =================================
% 0.43/1.00
% 0.43/1.00 % Reading from file /tmp/Prover9_22775_n028.cluster.edu
% 0.43/1.00
% 0.43/1.00 set(prolog_style_variables).
% 0.43/1.00 set(auto2).
% 0.43/1.00 % set(auto2) -> set(auto).
% 0.43/1.00 % set(auto) -> set(auto_inference).
% 0.43/1.00 % set(auto) -> set(auto_setup).
% 0.43/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00 % set(auto) -> set(auto_limits).
% 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00 % set(auto) -> set(auto_denials).
% 0.43/1.00 % set(auto) -> set(auto_process).
% 0.43/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00 % set(auto2) -> assign(stats, some).
% 0.43/1.00 % set(auto2) -> clear(echo_input).
% 0.43/1.00 % set(auto2) -> set(quiet).
% 0.43/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00 % set(auto2) -> clear(print_given).
% 0.43/1.00 assign(lrs_ticks,-1).
% 0.43/1.00 assign(sos_limit,10000).
% 0.43/1.00 assign(order,kbo).
% 0.43/1.00 set(lex_order_vars).
% 0.43/1.00 clear(print_given).
% 0.43/1.00
% 0.43/1.00 % formulas(sos). % not echoed (28 formulas)
% 0.43/1.00
% 0.43/1.00 ============================== end of input ==========================
% 0.43/1.00
% 0.43/1.00 % From the command line: assign(max_seconds, 300).
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00
% 0.43/1.00 % Formulas that are not ordinary clauses:
% 0.43/1.00 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.43/1.00 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.43/1.00 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.43/1.00 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.43/1.00 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.43/1.00 6 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 7 (all C (open(C) <-> (exists P end_point(P,C)))) # label(open_defn) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 8 (all C all C1 (part_of(C1,C) & C1 != C -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 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.43/1.00 10 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 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.43/1.00 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 24 (all O exists P start_point(P,O)) # label(o4) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 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.43/1.01 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.43/1.01 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.43/1.01 28 -(all O all P -ordered_by(O,P,P)) # label(theorem_4_4) # 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 -open(A) | end_point(f7(A),A) # label(open_defn) # label(axiom). [clausify(7)].
% 0.43/1.01 30 open(f17(A)) # label(o2) # label(axiom). [clausify(22)].
% 0.43/1.01 31 open(A) | -end_point(B,A) # label(open_defn) # label(axiom). [clausify(7)].
% 0.43/1.01 Derived: end_point(f7(f17(A)),f17(A)). [resolve(29,a,30,a)].
% 0.43/1.01 Derived: end_point(f7(A),A) | -end_point(B,A). [resolve(29,a,31,a)].
% 0.43/1.01 32 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom). [clausify(8)].
% 0.43/1.01 Derived: -part_of(A,B) | A = B | end_point(f7(A),A). [resolve(32,c,29,a)].
% 0.43/1.01 33 -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.43/1.01 Derived: A = B | -incident_c(B,f17(C)) | -incident_c(A,f17(C)) | ordered_by(f21(B,A,f17(C)),B,A). [resolve(33,a,30,a)].
% 0.43/1.01 Derived: A = B | -incident_c(B,C) | -incident_c(A,C) | ordered_by(f21(B,A,C),B,A) | -end_point(D,C). [resolve(33,a,31,a)].
% 0.43/1.01 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(33,a,32,c)].
% 0.43/1.01 34 -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.43/1.01 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(34,a,30,a)].
% 0.43/1.01 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(34,a,31,a)].
% 0.43/1.01 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(34,a,32,c)].
% 0.43/1.01 35 -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.43/1.01 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(35,a,30,a)].
% 0.43/1.01 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(35,a,31,a)].
% 0.43/1.01 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(35,a,32,c)].
% 0.43/1.01 36 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.43/1.01 37 inner_point(f8(A),A) # label(c3) # label(axiom). [clausify(10)].
% 0.43/1.01 Derived: -end_point(f8(A),A). [resolve(36,a,37,a)].
% 0.43/1.01 38 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.43/1.01 Derived: incident_c(f8(A),A). [resolve(38,a,37,a)].
% 0.43/1.01 39 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.43/1.01 40 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom). [clausify(11)].
% 0.43/1.01 Derived: meet(f8(A),f9(A,f8(A)),f10(A,f8(A))). [resolve(40,a,37,a)].
% 0.43/1.01 Derived: meet(A,f9(B,A),f10(B,A)) | -incident_c(A,B) | end_point(A,B). [resolve(40,a,39,a)].
% 0.43/1.01 41 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom). [clausify(11)].
% 0.43/1.01 Derived: sum(f9(A,f8(A)),f10(A,f8(A))) = A. [resolve(41,a,37,a)].
% 0.43/1.01 Derived: sum(f9(A,B),f10(A,B)) = A | -incident_c(B,A) | end_point(B,A). [resolve(41,a,39,a)].
% 0.43/1.01 42 -between_c(A,B,C,D) | inner_point(C,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)].
% 0.43/1.01 Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)). [resolve(42,b,36,a)].
% 0.43/1.01 Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)). [resolve(42,b,38,a)].
% 0.43/1.01 Derived: -between_c(A,B,C,D) | meet(C,f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)). [resolve(42,b,40,a)].
% 0.43/1.01 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(42,b,41,a)].
% 0.43/1.01 43 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.43/1.01 Derived: between_c(A,B,f8(C),D) | D = B | -part_of(C,A) | -end_point(B,C) | -end_point(D,C). [resolve(43,f,37,a)].
% 0.43/1.01 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(43,f,39,a)].
% 0.43/1.01 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(43,f,42,b)].
% 0.43/1.01 44 -start_point(A,B) | incident_o(A,B) # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.43/1.01 45 start_point(f20(A),A) # label(o4) # label(axiom). [clausify(24)].
% 0.43/1.01 Derived: incident_o(f20(A),A). [resolve(44,a,45,a)].
% 0.43/1.01 46 start_point(A,B) | -incident_o(A,B) | f15(A,B) != A # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.43/1.01 47 start_point(A,B) | -incident_o(A,B) | incident_o(f15(A,B),B) # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.43/1.01 48 start_point(A,B) | -incident_o(A,B) | -ordered_by(B,A,f15(A,B)) # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.43/1.01 49 -start_point(A,B) | C = A | -incident_o(C,B) | ordered_by(B,A,C) # label(start_point_defn) # label(axiom). [clausify(19)].
% 0.43/1.01 Derived: A = f20(B) | -incident_o(A,B) | ordered_by(B,f20(B),A). [resolve(49,a,45,a)].
% 0.43/1.01 Derived: A = B | -incident_o(A,C) | ordered_by(C,B,A) | -incident_o(B,C) | f15(B,C) != B. [resolve(49,a,46,a)].
% 0.43/1.01 Derived: A = B | -incident_o(A,C) | ordered_by(C,B,A) | -incident_o(B,C) | incident_o(f15(B,C),C). [resolve(49,a,47,a)].
% 0.43/1.01 Derived: A = B | -incident_o(A,C) | ordered_by(C,B,A) | -incident_o(B,C) | -ordered_by(C,B,f15(B,C)). [resolve(49,a,48,a)].
% 0.43/1.01 50 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom). [clausify(6)].
% 0.43/1.01 51 closed(A) | end_point(f6(A),A) # label(closed_defn) # label(axiom). [clausify(6)].
% 0.43/1.01 Derived: -end_point(A,B) | end_point(f6(B),B). [resolve(50,a,51,a)].
% 0.43/1.01 52 -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.43/1.01 Derived: -meet(A,B,C) | sum(B,C) != D | -end_point(E,B) | meet(E,B,C) | end_point(f6(D),D). [resolve(52,a,51,a)].
% 0.43/1.01 53 finish_point(A,B) | -incident_o(A,B) | f16(A,B) != A # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.43/1.01 54 -finish_point(A,B) | incident_o(A,B) # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.43/1.01 55 finish_point(A,B) | -incident_o(A,B) | incident_o(f16(A,B),B) # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.43/1.01 56 finish_point(A,B) | -incident_o(A,B) | -ordered_by(B,f16(A,B),A) # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.43/1.01 57 -finish_point(A,B) | C = A | -incident_o(C,B) | ordered_by(B,C,A) # label(finish_point_defn) # label(axiom). [clausify(20)].
% 0.43/1.01 Derived: A = B | -incident_o(A,C) | ordered_by(C,A,B) | -incident_o(B,C) | f16(B,C) != B. [resolve(57,a,53,a)].
% 0.43/1.01 Derived: A = B | -incident_o(A,C) | ordered_by(C,A,B) | -incident_o(B,C) | incident_o(f16(B,C),C). [resolve(57,a,55,a)].
% 0.43/1.01 Derived: A = B | -incident_o(A,C) | ordered_by(C,A,B) | -incident_o(B,C) | -ordered_by(C,f16(B,C),B). [resolve(57,a,56,a)].
% 0.43/1.01 58 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.43/1.01 59 -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.43/1.01 60 -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.43/1.01 61 -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.43/1.01 62 -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.43/1.01 63 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.43/1.01 64 -between_o(A,B,C,D) | between_c(f18(B,C,D,A),B,C,D) # label(o3) # label(axiom). [clausify(23)].
% 0.43/1.01 Derived: between_c(f18(A,B,C,D),A,B,C) | -ordered_by(D,A,B) | -ordered_by(D,B,C). [resolve(64,a,58,a)].
% 0.43/1.01 Derived: between_c(f18(A,B,C,D),A,B,C) | -ordered_by(D,C,B) | -ordered_by(D,B,A). [resolve(64,a,63,a)].
% 0.43/1.01 65 -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.43/1.01 Derived: -incident_o(A,B) | incident_c(A,f18(C,D,E,B)) | -ordered_by(B,C,D) | -ordered_by(B,D,E). [resolve(65,a,58,a)].
% 0.43/1.01 Derived: -incident_o(A,B) | incident_c(A,f18(C,D,E,B)) | -ordered_by(B,E,D) | -ordered_by(B,D,C). [resolve(65,a,63,a)].
% 0.43/1.01 66 -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.43/1.01 Derived: incident_o(A,B) | -incident_c(A,f18(C,D,E,B)) | -ordered_by(B,C,D) | -ordered_by(B,D,E). [resolve(66,a,58,a)].
% 0.43/1.01 Derived: incident_o(A,B) | -incident_c(A,f18(C,D,E,B)) | -ordered_by(B,E,D) | -ordered_by(B,D,C). [resolve(66,a,63,a)].
% 0.43/1.01 67 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.43/1.01 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(67,a,59,a)].
% 0.43/1.01 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(67,a,60,a)].
% 0.43/1.01 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(67,a,61,a)].
% 0.43/1.01 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(67,a,62,a)].
% 0.90/1.16 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(67,a,64,a)].
% 0.90/1.16 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(67,a,65,a)].
% 0.90/1.16 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(67,a,66,a)].
% 0.90/1.16 68 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.90/1.16 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(68,a,59,a)].
% 0.90/1.16 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(68,a,60,a)].
% 0.90/1.16 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(68,a,61,a)].
% 0.90/1.16 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(68,a,62,a)].
% 0.90/1.16 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(68,a,64,a)].
% 0.90/1.16 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(68,a,65,a)].
% 0.90/1.16 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(68,a,66,a)].
% 0.90/1.16
% 0.90/1.16 ============================== end predicate elimination =============
% 0.90/1.16
% 0.90/1.16 Auto_denials: (non-Horn, no changes).
% 0.90/1.16
% 0.90/1.16 Term ordering decisions:
% 0.90/1.16 Function symbol KB weights: c10=1. c11=1. sum=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. underlying_curve=1. f6=1. f7=1. f8=1. f17=1. f20=1. f2=1. f5=1. f21=1. f14=1. f18=1. f19=1.
% 0.90/1.16
% 0.90/1.16 ============================== end of process initial clauses ========
% 0.90/1.16
% 0.90/1.16 ============================== CLAUSES FOR SEARCH ====================
% 0.90/1.16
% 0.90/1.16 ============================== end of clauses for search =============
% 0.90/1.16
% 0.90/1.16 ============================== SEARCH ================================
% 0.90/1.16
% 0.90/1.16 % Starting search at 0.04 seconds.
% 0.90/1.16
% 0.90/1.16 ============================== PROOF =================================
% 0.90/1.16 % SZS status Theorem
% 0.90/1.16 % SZS output start Refutation
% 0.90/1.16
% 0.90/1.16 % Proof 1 at 0.16 (+ 0.01) seconds.
% 0.90/1.16 % Length of proof is 17.
% 0.90/1.16 % Level of proof is 6.
% 0.90/1.16 % Maximum clause weight is 17.000.
% 0.90/1.16 % Given clauses 183.
% 0.90/1.16
% 0.90/1.16 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.90/1.16 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.90/1.16 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.90/1.16 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.90/1.16 28 -(all O all P -ordered_by(O,P,P)) # label(theorem_4_4) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.90/1.16 36 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(4)].
% 0.90/1.16 42 -between_c(A,B,C,D) | inner_point(C,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)].
% 0.90/1.16 58 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.90/1.16 64 -between_o(A,B,C,D) | between_c(f18(B,C,D,A),B,C,D) # label(o3) # label(axiom). [clausify(23)].
% 0.90/1.16 69 ordered_by(c10,c11,c11) # label(theorem_4_4) # label(negated_conjecture). [clausify(28)].
% 0.90/1.16 99 -between_c(A,B,C,D) | end_point(D,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)].
% 0.90/1.16 134 -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)). [resolve(42,b,36,a)].
% 0.90/1.16 152 between_c(f18(A,B,C,D),A,B,C) | -ordered_by(D,A,B) | -ordered_by(D,B,C). [resolve(64,a,58,a)].
% 0.90/1.16 193 between_c(f18(A,A,A,B),A,A,A) | -ordered_by(B,A,A). [factor(152,b,c)].
% 0.90/1.16 697 between_c(f18(c11,c11,c11,c10),c11,c11,c11). [resolve(193,b,69,a)].
% 0.90/1.16 1384 -end_point(c11,f14(f18(c11,c11,c11,c10),c11,c11,c11)). [resolve(697,a,134,a)].
% 0.90/1.16 1385 $F. [resolve(697,a,99,a),unit_del(a,1384)].
% 0.90/1.16
% 0.90/1.16 % SZS output end Refutation
% 0.90/1.16 ============================== end of proof ==========================
% 0.90/1.16
% 0.90/1.16 ============================== STATISTICS ============================
% 0.90/1.16
% 0.90/1.16 Given=183. Generated=1991. Kept=1314. proofs=1.
% 0.90/1.16 Usable=181. Sos=1054. Demods=3. Limbo=15, Disabled=205. Hints=0.
% 0.90/1.16 Megabytes=1.88.
% 0.90/1.16 User_CPU=0.16, System_CPU=0.01, Wall_clock=0.
% 0.90/1.16
% 0.90/1.16 ============================== end of statistics =====================
% 0.90/1.16
% 0.90/1.16 ============================== end of search =========================
% 0.90/1.16
% 0.90/1.16 THEOREM PROVED
% 0.90/1.16 % SZS status Theorem
% 0.90/1.16
% 0.90/1.16 Exiting with 1 proof.
% 0.90/1.16
% 0.90/1.16 Process 22928 exit (max_proofs) Sat Jun 18 15:01:45 2022
% 0.90/1.16 Prover9 interrupted
%------------------------------------------------------------------------------