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.13/0.35	% Computer   : n023.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 960
0.13/0.35	% DateTime   : Wed Jul  1 17:21:29 EDT 2020
0.13/0.35	% CPUTime    : 
0.80/1.06	============================== Prover9 ===============================
0.80/1.06	Prover9 (32) version 2009-11A, November 2009.
0.80/1.06	Process 20379 was started by sandbox on n023.cluster.edu,
0.80/1.06	Wed Jul  1 17:21:29 2020
0.80/1.06	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_20009_n023.cluster.edu".
0.80/1.06	============================== end of head ===========================
0.80/1.06	
0.80/1.06	============================== INPUT =================================
0.80/1.06	
0.80/1.06	% Reading from file /tmp/Prover9_20009_n023.cluster.edu
0.80/1.06	
0.80/1.06	set(prolog_style_variables).
0.80/1.06	set(auto2).
0.80/1.06	    % set(auto2) -> set(auto).
0.80/1.06	    % set(auto) -> set(auto_inference).
0.80/1.06	    % set(auto) -> set(auto_setup).
0.80/1.06	    % set(auto_setup) -> set(predicate_elim).
0.80/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.80/1.06	    % set(auto) -> set(auto_limits).
0.80/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.80/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.80/1.06	    % set(auto) -> set(auto_denials).
0.80/1.06	    % set(auto) -> set(auto_process).
0.80/1.06	    % set(auto2) -> assign(new_constants, 1).
0.80/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.80/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.80/1.06	    % set(auto2) -> assign(max_hours, 1).
0.80/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.80/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.80/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.80/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.80/1.06	    % set(auto2) -> set(sort_initial_sos).
0.80/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.80/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.80/1.06	    % set(auto2) -> assign(max_megs, 400).
0.80/1.06	    % set(auto2) -> assign(stats, some).
0.80/1.06	    % set(auto2) -> clear(echo_input).
0.80/1.06	    % set(auto2) -> set(quiet).
0.80/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.80/1.06	    % set(auto2) -> clear(print_given).
0.80/1.06	assign(lrs_ticks,-1).
0.80/1.06	assign(sos_limit,10000).
0.80/1.06	assign(order,kbo).
0.80/1.06	set(lex_order_vars).
0.80/1.06	clear(print_given).
0.80/1.06	
0.80/1.06	% formulas(sos).  % not echoed (37 formulas)
0.80/1.06	
0.80/1.06	============================== end of input ==========================
0.80/1.06	
0.80/1.06	% From the command line: assign(max_seconds, 960).
0.80/1.06	
0.80/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.80/1.06	
0.80/1.06	% Formulas that are not ordinary clauses:
0.80/1.06	1 (all C all C1 ((all P (incident_c(P,C1) <-> incident_c(P,C))) -> C1 = C)) # label(c9) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	2 (all P all C all C1 (incident_c(P,C1) & (all Q (incident_c(Q,C1) & incident_c(Q,C) -> end_point(Q,C) & end_point(Q,C1))) & incident_c(P,C) <-> meet(P,C,C1))) # label(meet_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	3 (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.80/1.06	4 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (sum(C1,C2) = C & meet(P,C1,C2))))) # label(c4) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	5 (all P all C ((all C1 all C2 (part_of(C1,C) & incident_c(P,C2) & part_of(C2,C) & incident_c(P,C1) -> part_of(C2,C1) | part_of(C1,C2))) & incident_c(P,C) <-> end_point(P,C))) # label(end_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	6 (all C all C1 all C2 all C3 ((exists P (end_point(P,C1) & end_point(P,C2) & end_point(P,C3))) & part_of(C3,C) & part_of(C2,C) & part_of(C1,C) -> part_of(C1,C2) | part_of(C1,C3) | part_of(C3,C1) | part_of(C2,C1) | part_of(C3,C2) | part_of(C2,C3))) # label(c2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	7 (all C all P all Q all R (end_point(P,C) & end_point(Q,C) & end_point(R,C) -> Q = R | P = R | Q = P)) # label(c5) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	8 (all C all C1 (part_of(C1,C) & C1 != C -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	9 (all C all C1 all C2 all P (closed(C) & meet(P,C1,C2) & sum(C1,C2) = C -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	10 (all C all P (end_point(P,C) -> (exists Q (Q != P & end_point(Q,C))))) # label(c6) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	11 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.06	12 (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.80/1.07	13 (all C all C1 all C2 ((all Q (incident_c(Q,C1) | incident_c(Q,C2) <-> incident_c(Q,C))) <-> sum(C1,C2) = C)) # label(sum_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	14 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	15 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	16 (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.80/1.07	17 (all C all P all Q all R (R != P & (exists Cpp (end_point(P,Cpp) & inner_point(Q,Cpp) & end_point(R,Cpp) & part_of(Cpp,C))) <-> between_c(C,P,Q,R))) # label(between_c_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	18 (all P all O (incident_o(P,O) & (all Q (P != Q & incident_o(Q,O) -> ordered_by(O,P,Q))) <-> start_point(P,O))) # label(start_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	19 (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.80/1.07	20 (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.80/1.07	21 (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.80/1.07	22 (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.80/1.07	23 (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.80/1.07	24 (all P all O (finish_point(P,O) <-> (all Q (incident_o(Q,O) & P != Q -> ordered_by(O,Q,P))) & incident_o(P,O))) # label(finish_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	25 (all O exists P start_point(P,O)) # label(o4) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	26 (all P all Q all C (open(C) & incident_c(Q,C) & incident_c(P,C) & P != Q -> (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.80/1.07	27 (all O all P all Q all R (between_o(O,P,Q,R) <-> ordered_by(O,R,Q) & ordered_by(O,Q,P) | ordered_by(O,P,Q) & ordered_by(O,Q,R))) # label(between_o_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	28 (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.80/1.07	29 (all X exists O trajectory_of(X) = O) # label(trajectories_are_oriented_curves) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	30 (all X all Y all P (once(at_the_same_time(at(X,P),at(Y,P))) <-> connect(X,Y,P))) # label(connect_defn) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	31 (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.80/1.07	32 (all A all B (once(at_the_same_time(A,B)) -> once(B) & once(A))) # label(conjunction_at_the_same_time) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	33 (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.80/1.07	34 (all A all B (once(at_the_same_time(B,A)) <-> once(at_the_same_time(A,B)))) # label(symmetry_of_at_the_same_time) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	35 (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.80/1.07	36 (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.80/1.07	37 -(all X all Y all P (connect(X,Y,P) <-> connect(Y,X,P))) # label(t12) # label(negated_conjecture) # label(non_clause).  [assumption].
0.80/1.07	
0.80/1.07	============================== end of process non-clausal formulas ===
0.80/1.07	
0.80/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.80/1.07	
0.80/1.07	============================== PREDICATE ELIMINATION =================
0.80/1.07	38 inner_point(f12(A),A) # label(c3) # label(axiom).  [clausify(14)].
0.80/1.07	39 -inner_point(A,B) | sum(f4(B,A),f5(B,A)) = B # label(c4) # label(axiom).  [clausify(4)].
0.80/1.07	40 -inner_point(A,B) | meet(A,f4(B,A),f5(B,A)) # label(c4) # label(axiom).  [clausify(4)].
0.80/1.07	Derived: sum(f4(A,f12(A)),f5(A,f12(A))) = A.  [resolve(38,a,39,a)].
0.80/1.07	Derived: meet(f12(A),f4(A,f12(A)),f5(A,f12(A))).  [resolve(38,a,40,a)].
0.80/1.07	41 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
0.80/1.07	Derived: incident_c(f12(A),A).  [resolve(41,a,38,a)].
0.80/1.07	42 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
0.80/1.07	Derived: -end_point(f12(A),A).  [resolve(42,a,38,a)].
0.80/1.07	43 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
0.80/1.07	Derived: -incident_c(A,B) | end_point(A,B) | sum(f4(B,A),f5(B,A)) = B.  [resolve(43,a,39,a)].
0.80/1.07	Derived: -incident_c(A,B) | end_point(A,B) | meet(A,f4(B,A),f5(B,A)).  [resolve(43,a,40,a)].
0.80/1.07	44 A = B | -end_point(B,C) | -inner_point(D,C) | -end_point(A,C) | -part_of(C,E) | between_c(E,B,D,A) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.80/1.07	Derived: A = B | -end_point(B,C) | -end_point(A,C) | -part_of(C,D) | between_c(D,B,f12(C),A).  [resolve(44,c,38,a)].
0.80/1.07	Derived: A = B | -end_point(B,C) | -end_point(A,C) | -part_of(C,D) | between_c(D,B,E,A) | -incident_c(E,C) | end_point(E,C).  [resolve(44,c,43,a)].
0.80/1.07	45 inner_point(A,f14(B,C,A,D)) | -between_c(B,C,A,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.80/1.07	Derived: -between_c(A,B,C,D) | sum(f4(f14(A,B,C,D),C),f5(f14(A,B,C,D),C)) = f14(A,B,C,D).  [resolve(45,a,39,a)].
0.80/1.07	Derived: -between_c(A,B,C,D) | meet(C,f4(f14(A,B,C,D),C),f5(f14(A,B,C,D),C)).  [resolve(45,a,40,a)].
0.80/1.07	Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)).  [resolve(45,a,41,a)].
0.80/1.07	Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)).  [resolve(45,a,42,a)].
0.80/1.07	Derived: -between_c(A,B,C,D) | E = F | -end_point(F,f14(A,B,C,D)) | -end_point(E,f14(A,B,C,D)) | -part_of(f14(A,B,C,D),V6) | between_c(V6,F,C,E).  [resolve(45,a,44,c)].
0.80/1.07	46 end_point(f13(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(15)].
0.80/1.07	47 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom).  [clausify(8)].
0.80/1.07	48 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(15)].
0.80/1.07	Derived: end_point(f13(A),A) | -part_of(A,B) | A = B.  [resolve(46,b,47,c)].
0.80/1.07	Derived: end_point(f13(A),A) | -end_point(B,A).  [resolve(46,b,48,b)].
0.80/1.07	49 open(f16(A)) # label(o2) # label(axiom).  [clausify(19)].
0.80/1.07	Derived: end_point(f13(f16(A)),f16(A)).  [resolve(49,a,46,b)].
0.80/1.07	50 -open(A) | -incident_c(B,A) | -incident_c(C,A) | B = C | -incident_o(D,f24(C,B,A)) | incident_c(D,A) # label(o5) # label(axiom).  [clausify(26)].
0.80/1.07	Derived: -incident_c(A,B) | -incident_c(C,B) | A = C | -incident_o(D,f24(C,A,B)) | incident_c(D,B) | -part_of(B,E) | B = E.  [resolve(50,a,47,c)].
0.80/1.07	Derived: -incident_c(A,B) | -incident_c(C,B) | A = C | -incident_o(D,f24(C,A,B)) | incident_c(D,B) | -end_point(E,B).  [resolve(50,a,48,b)].
0.80/1.07	Derived: -incident_c(A,f16(B)) | -incident_c(C,f16(B)) | A = C | -incident_o(D,f24(C,A,f16(B))) | incident_c(D,f16(B)).  [resolve(50,a,49,a)].
0.80/1.07	51 -open(A) | -incident_c(B,A) | -incident_c(C,A) | B = C | incident_o(D,f24(C,B,A)) | -incident_c(D,A) # label(o5) # label(axiom).  [clausify(26)].
0.80/1.07	Derived: -incident_c(A,B) | -incident_c(C,B) | A = C | incident_o(D,f24(C,A,B)) | -incident_c(D,B) | -part_of(B,E) | B = E.  [resolve(51,a,47,c)].
0.80/1.07	Derived: -incident_c(A,B) | -incident_c(C,B) | A = C | incident_o(D,f24(C,A,B)) | -incident_c(D,B) | -end_point(E,B).  [resolve(51,a,48,b)].
0.80/1.07	Derived: -incident_c(A,f16(B)) | -incident_c(C,f16(B)) | A = C | incident_o(D,f24(C,A,f16(B))) | -incident_c(D,f16(B)).  [resolve(51,a,49,a)].
0.80/1.07	52 -open(A) | -incident_c(B,A) | -incident_c(C,A) | B = C | ordered_by(f24(C,B,A),C,B) # label(o5) # label(axiom).  [clausify(26)].
0.80/1.07	Derived: -incident_c(A,B) | -incident_c(C,B) | A = C | ordered_by(f24(C,A,B),C,A) | -part_of(B,D) | B = D.  [resolve(52,a,47,c)].
0.80/1.07	Derived: -incident_c(A,B) | -incident_c(C,B) | A = C | ordered_by(f24(C,A,B),C,A) | -end_point(D,B).  [resolve(52,a,48,b)].
0.80/1.07	Derived: -incident_c(A,f16(B)) | -incident_c(C,f16(B)) | A = C | ordered_by(f24(C,A,f16(B)),C,A).  [resolve(52,a,49,a)].
0.80/1.07	53 closed(A) | end_point(f9(A),A) # label(closed_defn) # label(axiom).  [clausify(11)].
0.80/1.07	54 -closed(A) | -meet(B,C,D) | sum(C,D) != A | -end_point(E,C) | meet(E,C,D) # label(c7) # label(axiom).  [clausify(9)].
0.80/1.07	55 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom).  [clausify(11)].
0.80/1.07	Derived: end_point(f9(A),A) | -meet(B,C,D) | sum(C,D) != A | -end_point(E,C) | meet(E,C,D).  [resolve(53,a,54,a)].
0.80/1.07	Derived: end_point(f9(A),A) | -end_point(B,A).  [resolve(53,a,55,a)].
0.80/1.07	56 incident_o(A,B) | -start_point(A,B) # label(start_point_defn) # label(axiom).  [clausify(18)].
0.80/1.07	57 -incident_o(A,B) | f15(A,B) != A | start_point(A,B) # label(start_point_defn) # label(axiom).  [clausify(18)].
0.80/1.07	58 -incident_o(A,B) | incident_o(f15(A,B),B) | start_point(A,B) # label(start_point_defn) # label(axiom).  [clausify(18)].
0.80/1.07	59 -incident_o(A,B) | -ordered_by(B,A,f15(A,B)) | start_point(A,B) # label(start_point_defn) # label(axiom).  [clausify(18)].
0.80/1.07	60 A = B | -incident_o(A,C) | ordered_by(C,B,A) | -start_point(B,C) # label(start_point_defn) # label(axiom).  [clausify(18)].
0.80/1.07	Derived: A = B | -incident_o(A,C) | ordered_by(C,B,A) | -incident_o(B,C) | f15(B,C) != B.  [resolve(60,d,57,c)].
0.80/1.07	Derived: A = B | -incident_o(A,C) | ordered_by(C,B,A) | -incident_o(B,C) | incident_o(f15(B,C),C).  [resolve(60,d,58,c)].
0.80/1.07	Derived: A = B | -incident_o(A,C) | ordered_by(C,B,A) | -incident_o(B,C) | -ordered_by(C,B,f15(B,C)).  [resolve(60,d,59,c)].
0.80/1.07	61 start_point(f23(A),A) # label(o4) # label(axiom).  [clausify(25)].
0.80/1.07	Derived: incident_o(f23(A),A).  [resolve(61,a,56,b)].
0.80/1.07	Derived: A = f23(B) | -incident_o(A,B) | ordered_by(B,f23(B),A).  [resolve(61,a,60,d)].
0.80/1.07	62 between_o(A,B,C,D) | incident_c(f20(B,C,D,A,E),E) | incident_o(f20(B,C,D,A,E),A) | -between_c(E,B,C,D) # label(o3) # label(axiom).  [clausify(21)].
0.80/1.07	63 -between_o(A,B,C,D) | -incident_c(E,f19(B,C,D,A)) | incident_o(E,A) # label(o3) # label(axiom).  [clausify(21)].
0.80/1.07	64 -between_o(A,B,C,D) | incident_c(E,f19(B,C,D,A)) | -incident_o(E,A) # label(o3) # label(axiom).  [clausify(21)].
0.80/1.07	65 -between_o(A,B,C,D) | between_c(f19(B,C,D,A),B,C,D) # label(o3) # label(axiom).  [clausify(21)].
0.80/1.07	Derived: incident_c(f20(A,B,C,D,E),E) | incident_o(f20(A,B,C,D,E),D) | -between_c(E,A,B,C) | -incident_c(F,f19(A,B,C,D)) | incident_o(F,D).  [resolve(62,a,63,a)].
0.80/1.07	Derived: incident_c(f20(A,B,C,D,E),E) | incident_o(f20(A,B,C,D,E),D) | -between_c(E,A,B,C) | incident_c(F,f19(A,B,C,D)) | -incident_o(F,D).  [resolve(62,a,64,a)].
0.80/1.07	Derived: incident_c(f20(A,B,C,D,E),E) | incident_o(f20(A,B,C,D,E),D) | -between_c(E,A,B,C) | between_c(f19(A,B,C,D),A,B,C).  [resolve(62,a,65,a)].
0.80/1.07	66 between_o(A,B,C,D) | -incident_c(f20(B,C,D,A,E),E) | -incident_o(f20(B,C,D,A,E),A) | -between_c(E,B,C,D) # label(o3) # label(axiom).  [clausify(21)].
0.80/1.07	Derived: -incident_c(f20(A,B,C,D,E),E) | -incident_o(f20(A,B,C,D,E),D) | -between_c(E,A,B,C) | -incident_c(F,f19(A,B,C,D)) | incident_o(F,D).  [resolve(66,a,63,a)].
0.80/1.07	Derived: -incident_c(f20(A,B,C,D,E),E) | -incident_o(f20(A,B,C,D,E),D) | -between_c(E,A,B,C) | incident_c(F,f19(A,B,C,D)) | -incident_o(F,D).  [resolve(66,a,64,a)].
0.80/1.07	Derived: -incident_c(f20(A,B,C,D,E),E) | -incident_o(f20(A,B,C,D,E),D) | -between_c(E,A,B,C) | between_c(f19(A,B,C,D),A,B,C).  [resolve(66,a,65,a)].
0.80/1.07	67 -between_o(A,B,C,D) | ordered_by(A,D,C) | ordered_by(A,B,C) # label(between_o_defn) # label(axiom).  [clausify(27)].
0.80/1.07	Derived: ordered_by(A,B,C) | ordered_by(A,D,C) | incident_c(f20(D,C,B,A,E),E) | incident_o(f20(D,C,B,A,E),A) | -between_c(E,D,C,B).  [resolve(67,a,62,a)].
0.80/1.09	Derived: ordered_by(A,B,C) | ordered_by(A,D,C) | -incident_c(f20(D,C,B,A,E),E) | -incident_o(f20(D,C,B,A,E),A) | -between_c(E,D,C,B).  [resolve(67,a,66,a)].
0.80/1.09	68 -between_o(A,B,C,D) | ordered_by(A,D,C) | ordered_by(A,C,D) # label(between_o_defn) # label(axiom).  [clausify(27)].
0.80/1.09	Derived: ordered_by(A,B,C) | ordered_by(A,C,B) | incident_c(f20(D,C,B,A,E),E) | incident_o(f20(D,C,B,A,E),A) | -between_c(E,D,C,B).  [resolve(68,a,62,a)].
0.80/1.09	Derived: ordered_by(A,B,C) | ordered_by(A,C,B) | -incident_c(f20(D,C,B,A,E),E) | -incident_o(f20(D,C,B,A,E),A) | -between_c(E,D,C,B).  [resolve(68,a,66,a)].
0.80/1.09	69 -between_o(A,B,C,D) | ordered_by(A,C,B) | ordered_by(A,B,C) # label(between_o_defn) # label(axiom).  [clausify(27)].
0.80/1.09	Derived: ordered_by(A,B,C) | ordered_by(A,C,B) | incident_c(f20(C,B,D,A,E),E) | incident_o(f20(C,B,D,A,E),A) | -between_c(E,C,B,D).  [resolve(69,a,62,a)].
0.80/1.09	Derived: ordered_by(A,B,C) | ordered_by(A,C,B) | -incident_c(f20(C,B,D,A,E),E) | -incident_o(f20(C,B,D,A,E),A) | -between_c(E,C,B,D).  [resolve(69,a,66,a)].
0.80/1.09	70 -between_o(A,B,C,D) | ordered_by(A,C,B) | ordered_by(A,C,D) # label(between_o_defn) # label(axiom).  [clausify(27)].
0.80/1.09	Derived: ordered_by(A,B,C) | ordered_by(A,B,D) | incident_c(f20(C,B,D,A,E),E) | incident_o(f20(C,B,D,A,E),A) | -between_c(E,C,B,D).  [resolve(70,a,62,a)].
0.80/1.09	Derived: ordered_by(A,B,C) | ordered_by(A,B,D) | -incident_c(f20(C,B,D,A,E),E) | -incident_o(f20(C,B,D,A,E),A) | -between_c(E,C,B,D).  [resolve(70,a,66,a)].
0.80/1.09	71 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.80/1.09	Derived: -ordered_by(A,B,C) | -ordered_by(A,C,D) | -incident_c(E,f19(D,C,B,A)) | incident_o(E,A).  [resolve(71,a,63,a)].
0.80/1.09	Derived: -ordered_by(A,B,C) | -ordered_by(A,C,D) | incident_c(E,f19(D,C,B,A)) | -incident_o(E,A).  [resolve(71,a,64,a)].
0.80/1.09	Derived: -ordered_by(A,B,C) | -ordered_by(A,C,D) | between_c(f19(D,C,B,A),D,C,B).  [resolve(71,a,65,a)].
0.80/1.09	72 between_o(A,B,C,D) | -ordered_by(A,B,C) | -ordered_by(A,C,D) # label(between_o_defn) # label(axiom).  [clausify(27)].
0.80/1.09	Derived: -ordered_by(A,B,C) | -ordered_by(A,C,D) | -incident_c(E,f19(B,C,D,A)) | incident_o(E,A).  [resolve(72,a,63,a)].
0.80/1.09	Derived: -ordered_by(A,B,C) | -ordered_by(A,C,D) | incident_c(E,f19(B,C,D,A)) | -incident_o(E,A).  [resolve(72,a,64,a)].
0.80/1.09	Derived: -ordered_by(A,B,C) | -ordered_by(A,C,D) | between_c(f19(B,C,D,A),B,C,D).  [resolve(72,a,65,a)].
0.80/1.09	73 finish_point(A,B) | incident_o(f22(A,B),B) | -incident_o(A,B) # label(finish_point_defn) # label(axiom).  [clausify(24)].
0.80/1.09	74 -finish_point(A,B) | -incident_o(C,B) | C = A | ordered_by(B,C,A) # label(finish_point_defn) # label(axiom).  [clausify(24)].
0.80/1.09	75 -finish_point(A,B) | incident_o(A,B) # label(finish_point_defn) # label(axiom).  [clausify(24)].
0.80/1.09	Derived: incident_o(f22(A,B),B) | -incident_o(A,B) | -incident_o(C,B) | C = A | ordered_by(B,C,A).  [resolve(73,a,74,a)].
0.80/1.09	76 finish_point(A,B) | f22(A,B) != A | -incident_o(A,B) # label(finish_point_defn) # label(axiom).  [clausify(24)].
0.80/1.09	Derived: f22(A,B) != A | -incident_o(A,B) | -incident_o(C,B) | C = A | ordered_by(B,C,A).  [resolve(76,a,74,a)].
0.80/1.09	77 finish_point(A,B) | -ordered_by(B,f22(A,B),A) | -incident_o(A,B) # label(finish_point_defn) # label(axiom).  [clausify(24)].
0.80/1.09	Derived: -ordered_by(A,f22(B,A),B) | -incident_o(B,A) | -incident_o(C,A) | C = B | ordered_by(A,C,B).  [resolve(77,a,74,a)].
0.80/1.09	
0.80/1.09	============================== end predicate elimination =============
0.80/1.09	
0.80/1.09	Auto_denials:  (non-Horn, no changes).
0.80/1.09	
0.80/1.09	Term ordering decisions:
0.80/1.09	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. f5=1. f6=1. f7=1. f8=1. f10=1. f15=1. f17=1. f18=1. f21=1. f22=1. f26=1. underlying_curve=1. trajectory_of=1. f9=1. f12=1. f13=1. f16=1. f23=1. f25=1. f2=1. f11=1. f24=1. f14=1. f19=1. f20=1.
0.80/1.09	
0.80/1.09	============================== end of process initial clauses ========
0.80/1.09	
0.80/1.09	============================== CLAUSES FOR SEARCH ====================
0.80/1.09	
0.80/1.09	============================== end of clauses for search =============
0.80/1.09	
0.80/1.09	============================== SEARCH ================================
3.35/3.65	
3.35/3.65	% Starting search at 0.04 seconds.
3.35/3.65	
3.35/3.65	Low Water (keep): wt=39.000, iters=3637
3.35/3.65	
3.35/3.65	Low Water (keep): wt=38.000, iters=3613
3.35/3.65	
3.35/3.65	Low Water (keep): wt=36.000, iters=3393
3.35/3.65	
3.35/3.65	Low Water (keep): wt=35.000, iters=3396
3.35/3.65	
3.35/3.65	Low Water (keep): wt=34.000, iters=3355
3.35/3.65	
3.35/3.65	Low Water (keep): wt=33.000, iters=3348
3.35/3.65	
3.35/3.65	Low Water (keep): wt=32.000, iters=3336
3.35/3.65	
3.35/3.65	Low Water (keep): wt=31.000, iters=3388
3.35/3.65	
3.35/3.65	Low Water (keep): wt=29.000, iters=5144
3.35/3.65	
3.35/3.65	Low Water (keep): wt=28.000, iters=4746
3.35/3.65	
3.35/3.65	Low Water (keep): wt=25.000, iters=3429
3.35/3.65	
3.35/3.65	Low Water (keep): wt=24.000, iters=3339
3.35/3.65	
3.35/3.65	Low Water (displace): id=13217, wt=29.000
3.35/3.65	
3.35/3.65	Low Water (displace): id=13222, wt=25.000
3.35/3.65	
3.35/3.65	Low Water (displace): id=13253, wt=23.000
3.35/3.65	
3.35/3.65	Low Water (displace): id=13376, wt=22.000
3.35/3.65	
3.35/3.65	Low Water (displace): id=13393, wt=21.000
3.35/3.65	
3.35/3.65	Low Water (displace): id=13449, wt=18.000
3.35/3.65	
3.35/3.65	Low Water (displace): id=13488, wt=16.000
3.35/3.65	
3.35/3.65	Low Water (displace): id=13918, wt=15.000
3.35/3.65	
3.35/3.65	============================== PROOF =================================
3.35/3.65	% SZS status Theorem
3.35/3.65	% SZS output start Refutation
3.35/3.65	
3.35/3.65	% Proof 1 at 2.55 (+ 0.05) seconds.
3.35/3.65	% Length of proof is 15.
3.35/3.65	% Level of proof is 7.
3.35/3.65	% Maximum clause weight is 16.000.
3.35/3.65	% Given clauses 1994.
3.35/3.65	
3.35/3.65	30 (all X all Y all P (once(at_the_same_time(at(X,P),at(Y,P))) <-> connect(X,Y,P))) # label(connect_defn) # label(axiom) # label(non_clause).  [assumption].
3.35/3.65	34 (all A all B (once(at_the_same_time(B,A)) <-> once(at_the_same_time(A,B)))) # label(symmetry_of_at_the_same_time) # label(axiom) # label(non_clause).  [assumption].
3.35/3.65	37 -(all X all Y all P (connect(X,Y,P) <-> connect(Y,X,P))) # label(t12) # label(negated_conjecture) # label(non_clause).  [assumption].
3.35/3.65	126 -once(at_the_same_time(at(A,B),at(C,B))) | connect(A,C,B) # label(connect_defn) # label(axiom).  [clausify(30)].
3.35/3.65	127 once(at_the_same_time(at(A,B),at(C,B))) | -connect(A,C,B) # label(connect_defn) # label(axiom).  [clausify(30)].
3.35/3.65	135 -once(at_the_same_time(A,B)) | once(at_the_same_time(B,A)) # label(symmetry_of_at_the_same_time) # label(axiom).  [clausify(34)].
3.35/3.65	139 connect(c10,c11,c12) | connect(c11,c10,c12) # label(t12) # label(negated_conjecture).  [clausify(37)].
3.35/3.65	140 -connect(c10,c11,c12) | -connect(c11,c10,c12) # label(t12) # label(negated_conjecture).  [clausify(37)].
3.35/3.65	422 connect(c10,c11,c12) | once(at_the_same_time(at(c11,c12),at(c10,c12))).  [resolve(139,b,127,b)].
3.35/3.65	3209 once(at_the_same_time(at(c11,c12),at(c10,c12))) | once(at_the_same_time(at(c10,c12),at(c11,c12))).  [resolve(422,a,127,b)].
3.35/3.65	16143 once(at_the_same_time(at(c10,c12),at(c11,c12))).  [resolve(3209,a,135,a),merge(b)].
3.35/3.65	16145 once(at_the_same_time(at(c11,c12),at(c10,c12))).  [resolve(16143,a,135,a)].
3.35/3.65	16149 connect(c10,c11,c12).  [resolve(16143,a,126,a)].
3.35/3.65	16150 -connect(c11,c10,c12).  [back_unit_del(140),unit_del(a,16149)].
3.35/3.65	16246 $F.  [resolve(16145,a,126,a),unit_del(a,16150)].
3.35/3.65	
3.35/3.65	% SZS output end Refutation
3.35/3.65	============================== end of proof ==========================
3.35/3.65	
3.35/3.65	============================== STATISTICS ============================
3.35/3.65	
3.35/3.65	Given=1994. Generated=75886. Kept=16164. proofs=1.
3.35/3.65	Usable=1741. Sos=9841. Demods=13. Limbo=2, Disabled=4736. Hints=0.
3.35/3.65	Megabytes=19.37.
3.35/3.65	User_CPU=2.55, System_CPU=0.05, Wall_clock=3.
3.35/3.65	
3.35/3.65	============================== end of statistics =====================
3.35/3.65	
3.35/3.65	============================== end of search =========================
3.35/3.65	
3.35/3.65	THEOREM PROVED
3.35/3.65	% SZS status Theorem
3.35/3.65	
3.35/3.65	Exiting with 1 proof.
3.35/3.65	
3.35/3.65	Process 20379 exit (max_proofs) Wed Jul  1 17:21:32 2020
3.35/3.65	Prover9 interrupted
3.35/3.65	EOF