0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.30 % Computer : n023.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % WCLimit : 120 0.09/0.30 % DateTime : Tue Aug 9 03:15:57 EDT 2022 0.09/0.30 % CPUTime : 0.70/1.02 ============================== Prover9 =============================== 0.70/1.02 Prover9 (32) version 2009-11A, November 2009. 0.70/1.02 Process 9661 was started by sandbox on n023.cluster.edu, 0.70/1.02 Tue Aug 9 03:15:58 2022 0.70/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_9503_n023.cluster.edu". 0.70/1.02 ============================== end of head =========================== 0.70/1.02 0.70/1.02 ============================== INPUT ================================= 0.70/1.02 0.70/1.02 % Reading from file /tmp/Prover9_9503_n023.cluster.edu 0.70/1.02 0.70/1.02 set(prolog_style_variables). 0.70/1.02 set(auto2). 0.70/1.02 % set(auto2) -> set(auto). 0.70/1.02 % set(auto) -> set(auto_inference). 0.70/1.02 % set(auto) -> set(auto_setup). 0.70/1.02 % set(auto_setup) -> set(predicate_elim). 0.70/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.70/1.02 % set(auto) -> set(auto_limits). 0.70/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.70/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.70/1.02 % set(auto) -> set(auto_denials). 0.70/1.02 % set(auto) -> set(auto_process). 0.70/1.02 % set(auto2) -> assign(new_constants, 1). 0.70/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.70/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.70/1.02 % set(auto2) -> assign(max_hours, 1). 0.70/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.70/1.02 % set(auto2) -> assign(max_seconds, 0). 0.70/1.02 % set(auto2) -> assign(max_minutes, 5). 0.70/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.70/1.02 % set(auto2) -> set(sort_initial_sos). 0.70/1.02 % set(auto2) -> assign(sos_limit, -1). 0.70/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.70/1.02 % set(auto2) -> assign(max_megs, 400). 0.70/1.02 % set(auto2) -> assign(stats, some). 0.70/1.02 % set(auto2) -> clear(echo_input). 0.70/1.02 % set(auto2) -> set(quiet). 0.70/1.02 % set(auto2) -> clear(print_initial_clauses). 0.70/1.02 % set(auto2) -> clear(print_given). 0.70/1.02 assign(lrs_ticks,-1). 0.70/1.02 assign(sos_limit,10000). 0.70/1.02 assign(order,kbo). 0.70/1.02 set(lex_order_vars). 0.70/1.02 clear(print_given). 0.70/1.02 0.70/1.02 % formulas(sos). % not echoed (18 formulas) 0.70/1.02 0.70/1.02 ============================== end of input ========================== 0.70/1.02 0.70/1.02 % From the command line: assign(max_seconds, 960). 0.70/1.02 0.70/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.70/1.02 0.70/1.02 % Formulas that are not ordinary clauses: 0.70/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.70/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.70/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.70/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.70/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.70/1.02 6 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 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.70/1.02 8 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 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.70/1.02 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.70/1.02 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.70/1.02 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.70/1.02 13 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 14 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 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.70/1.02 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.70/1.02 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.70/1.02 18 -(all C all P all Q all R (between_c(C,P,Q,R) -> between_c(C,R,Q,P))) # label(theorem_3_8_2) # label(negated_conjecture) # label(non_clause). [assumption]. 0.70/1.02 0.70/1.02 ============================== end of process non-clausal formulas === 0.70/1.02 0.70/1.02 ============================== PROCESS INITIAL CLAUSES =============== 0.70/1.02 0.70/1.02 ============================== PREDICATE ELIMINATION ================= 0.70/1.02 19 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.70/1.02 20 inner_point(f9(A),A) # label(c3) # label(axiom). [clausify(13)]. 0.70/1.02 Derived: -end_point(f9(A),A). [resolve(19,a,20,a)]. 0.70/1.02 21 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.70/1.02 Derived: incident_c(f9(A),A). [resolve(21,a,20,a)]. 0.70/1.02 22 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.70/1.02 23 -inner_point(A,B) | meet(A,f10(B,A),f11(B,A)) # label(c4) # label(axiom). [clausify(15)]. 0.70/1.02 Derived: meet(f9(A),f10(A,f9(A)),f11(A,f9(A))). [resolve(23,a,20,a)]. 0.70/1.02 Derived: meet(A,f10(B,A),f11(B,A)) | end_point(A,B) | -incident_c(A,B). [resolve(23,a,22,a)]. 0.70/1.02 24 -inner_point(A,B) | sum(f10(B,A),f11(B,A)) = B # label(c4) # label(axiom). [clausify(15)]. 0.70/1.02 Derived: sum(f10(A,f9(A)),f11(A,f9(A))) = A. [resolve(24,a,20,a)]. 0.70/1.02 Derived: sum(f10(A,B),f11(A,B)) = A | end_point(B,A) | -incident_c(B,A). [resolve(24,a,22,a)]. 0.70/1.02 25 -between_c(A,B,C,D) | inner_point(C,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.70/1.02 Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)). [resolve(25,b,19,a)]. 0.70/1.02 Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)). [resolve(25,b,21,a)]. 0.70/1.02 Derived: -between_c(A,B,C,D) | meet(C,f10(f14(A,B,C,D),C),f11(f14(A,B,C,D),C)). [resolve(25,b,23,a)]. 0.70/1.02 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(25,b,24,a)]. 0.70/1.02 26 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.70/1.02 Derived: between_c(A,B,f9(C),D) | -end_point(D,C) | -end_point(B,C) | -part_of(C,A) | D = B. [resolve(26,b,20,a)]. 0.70/1.02 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(26,b,22,a)]. 0.70/1.02 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(26,b,25,b)]. 0.70/1.02 27 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom). [clausify(8)]. 0.70/1.02 28 closed(A) | end_point(f5(A),A) # label(closed_defn) # label(axiom). [clausify(8)]. 0.70/1.02 Derived: -end_point(A,B) | end_point(f5(B),B). [resolve(27,a,28,a)]. 0.70/1.02 29 -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.70/1.02 Derived: -meet(A,B,C) | sum(B,C) != D | -end_point(E,B) | meet(E,B,C) | end_point(f5(D),D). [resolve(29,c,28,a)]. 0.70/1.02 30 end_point(f3(A),A) | -open(A) # label(open_defn) # label(axiom). [clausify(6)]. 0.70/1.02 31 -end_point(A,B) | open(B) # label(open_defn) # label(axiom). [clausify(6)]. 0.70/1.02 Derived: end_point(f3(A),A) | -end_point(B,A). [resolve(30,b,31,b)]. 0.74/1.05 32 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom). [clausify(14)]. 0.74/1.05 Derived: -part_of(A,B) | A = B | end_point(f3(A),A). [resolve(32,c,30,b)]. 0.74/1.05 0.74/1.05 ============================== end predicate elimination ============= 0.74/1.05 0.74/1.05 Auto_denials: (non-Horn, no changes). 0.74/1.05 0.74/1.05 Term ordering decisions: 0.74/1.05 Function symbol KB weights: c10=1. c11=1. c12=1. c13=1. sum=1. f1=1. f2=1. f4=1. f7=1. f10=1. f11=1. f12=1. f13=1. f3=1. f5=1. f9=1. f6=1. f8=1. f14=1. 0.74/1.05 0.74/1.05 ============================== end of process initial clauses ======== 0.74/1.05 0.74/1.05 ============================== CLAUSES FOR SEARCH ==================== 0.74/1.05 0.74/1.05 ============================== end of clauses for search ============= 0.74/1.05 0.74/1.05 ============================== SEARCH ================================ 0.74/1.05 0.74/1.05 % Starting search at 0.01 seconds. 0.74/1.05 0.74/1.05 ============================== PROOF ================================= 0.74/1.05 % SZS status Theorem 0.74/1.05 % SZS output start Refutation 0.74/1.05 0.74/1.05 % Proof 1 at 0.03 (+ 0.00) seconds. 0.74/1.05 % Length of proof is 16. 0.74/1.05 % Level of proof is 3. 0.74/1.05 % Maximum clause weight is 34.000. 0.74/1.05 % Given clauses 71. 0.74/1.05 0.74/1.05 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.74/1.05 18 -(all C all P all Q all R (between_c(C,P,Q,R) -> between_c(C,R,Q,P))) # label(theorem_3_8_2) # label(negated_conjecture) # label(non_clause). [assumption]. 0.74/1.05 25 -between_c(A,B,C,D) | inner_point(C,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.74/1.05 26 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.74/1.05 33 between_c(c10,c11,c12,c13) # label(theorem_3_8_2) # label(negated_conjecture). [clausify(18)]. 0.74/1.05 37 -between_c(c10,c13,c12,c11) # label(theorem_3_8_2) # label(negated_conjecture). [clausify(18)]. 0.74/1.05 39 -between_c(A,B,C,D) | D != B # label(between_c_defn) # label(axiom). [clausify(17)]. 0.74/1.05 54 -between_c(A,B,C,D) | end_point(D,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.74/1.05 55 -between_c(A,B,C,D) | end_point(B,f14(A,B,C,D)) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.74/1.05 56 -between_c(A,B,C,D) | part_of(f14(A,B,C,D),A) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.74/1.05 83 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(26,b,25,b)]. 0.74/1.05 101 c13 != c11. [resolve(39,a,33,a)]. 0.74/1.05 174 end_point(c13,f14(c10,c11,c12,c13)). [resolve(54,a,33,a)]. 0.74/1.05 175 end_point(c11,f14(c10,c11,c12,c13)). [resolve(55,a,33,a)]. 0.74/1.05 176 part_of(f14(c10,c11,c12,c13),c10). [resolve(56,a,33,a)]. 0.74/1.05 404 $F. [ur(83,a,37,a,b,175,a,c,174,a,e,101,a(flip),f,33,a),unit_del(a,176)]. 0.74/1.05 0.74/1.05 % SZS output end Refutation 0.74/1.05 ============================== end of proof ========================== 0.74/1.05 0.74/1.05 ============================== STATISTICS ============================ 0.74/1.05 0.74/1.05 Given=71. Generated=693. Kept=370. proofs=1. 0.74/1.05 Usable=69. Sos=252. Demods=3. Limbo=4, Disabled=113. Hints=0. 0.74/1.05 Megabytes=0.47. 0.74/1.05 User_CPU=0.03, System_CPU=0.00, Wall_clock=0. 0.74/1.05 0.74/1.05 ============================== end of statistics ===================== 0.74/1.05 0.74/1.05 ============================== end of search ========================= 0.74/1.05 0.74/1.05 THEOREM PROVED 0.74/1.05 % SZS status Theorem 0.74/1.05 0.74/1.05 Exiting with 1 proof. 0.74/1.05 0.74/1.05 Process 9661 exit (max_proofs) Tue Aug 9 03:15:58 2022 0.74/1.05 Prover9 interrupted 0.74/1.05 EOF