0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n014.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.33 % CPULimit : 960 0.12/0.33 % DateTime : Thu Jul 2 15:25:55 EDT 2020 0.12/0.33 % CPUTime : 0.43/1.03 ============================== Prover9 =============================== 0.43/1.03 Prover9 (32) version 2009-11A, November 2009. 0.43/1.03 Process 6541 was started by sandbox on n014.cluster.edu, 0.43/1.03 Thu Jul 2 15:25:55 2020 0.43/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_6260_n014.cluster.edu". 0.43/1.03 ============================== end of head =========================== 0.43/1.03 0.43/1.03 ============================== INPUT ================================= 0.43/1.03 0.43/1.03 % Reading from file /tmp/Prover9_6260_n014.cluster.edu 0.43/1.03 0.43/1.03 set(prolog_style_variables). 0.43/1.03 set(auto2). 0.43/1.03 % set(auto2) -> set(auto). 0.43/1.03 % set(auto) -> set(auto_inference). 0.43/1.03 % set(auto) -> set(auto_setup). 0.43/1.03 % set(auto_setup) -> set(predicate_elim). 0.43/1.03 % set(auto_setup) -> assign(eq_defs, unfold). 0.43/1.03 % set(auto) -> set(auto_limits). 0.43/1.03 % set(auto_limits) -> assign(max_weight, "100.000"). 0.43/1.03 % set(auto_limits) -> assign(sos_limit, 20000). 0.43/1.03 % set(auto) -> set(auto_denials). 0.43/1.03 % set(auto) -> set(auto_process). 0.43/1.03 % set(auto2) -> assign(new_constants, 1). 0.43/1.03 % set(auto2) -> assign(fold_denial_max, 3). 0.43/1.03 % set(auto2) -> assign(max_weight, "200.000"). 0.43/1.03 % set(auto2) -> assign(max_hours, 1). 0.43/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.43/1.03 % set(auto2) -> assign(max_seconds, 0). 0.43/1.03 % set(auto2) -> assign(max_minutes, 5). 0.43/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.43/1.03 % set(auto2) -> set(sort_initial_sos). 0.43/1.03 % set(auto2) -> assign(sos_limit, -1). 0.43/1.03 % set(auto2) -> assign(lrs_ticks, 3000). 0.43/1.03 % set(auto2) -> assign(max_megs, 400). 0.43/1.03 % set(auto2) -> assign(stats, some). 0.43/1.03 % set(auto2) -> clear(echo_input). 0.43/1.03 % set(auto2) -> set(quiet). 0.43/1.03 % set(auto2) -> clear(print_initial_clauses). 0.43/1.03 % set(auto2) -> clear(print_given). 0.43/1.03 assign(lrs_ticks,-1). 0.43/1.03 assign(sos_limit,10000). 0.43/1.03 assign(order,kbo). 0.43/1.03 set(lex_order_vars). 0.43/1.03 clear(print_given). 0.43/1.03 0.43/1.03 % formulas(sos). % not echoed (18 formulas) 0.43/1.03 0.43/1.03 ============================== end of input ========================== 0.43/1.03 0.43/1.03 % From the command line: assign(max_seconds, 960). 0.43/1.03 0.43/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.43/1.03 0.43/1.03 % Formulas that are not ordinary clauses: 0.43/1.03 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.43/1.03 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.43/1.03 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.43/1.03 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.43/1.03 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.43/1.03 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.43/1.03 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.43/1.03 8 (all C all C1 (part_of(C1,C) & C1 != C -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.03 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.43/1.03 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.43/1.03 11 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.03 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.43/1.03 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.43/1.03 14 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption]. 0.43/1.03 15 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.03 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.43/1.03 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.43/1.03 18 -(all C all P (open(C) -> (end_point(P,C) <-> -(exists Q exists R between_c(C,Q,P,R)) & incident_c(P,C)))) # label(theorem_3_6) # label(negated_conjecture) # label(non_clause). [assumption]. 0.43/1.03 0.43/1.03 ============================== end of process non-clausal formulas === 0.43/1.03 0.43/1.03 ============================== PROCESS INITIAL CLAUSES =============== 0.43/1.03 0.43/1.03 ============================== PREDICATE ELIMINATION ================= 0.43/1.03 19 end_point(f13(A),A) | -open(A) # label(open_defn) # label(axiom). [clausify(15)]. 0.43/1.03 20 open(c10) # label(theorem_3_6) # label(negated_conjecture). [clausify(18)]. 0.43/1.03 21 -end_point(A,B) | open(B) # label(open_defn) # label(axiom). [clausify(15)]. 0.43/1.03 Derived: end_point(f13(c10),c10). [resolve(19,b,20,a)]. 0.43/1.03 Derived: end_point(f13(A),A) | -end_point(B,A). [resolve(19,b,21,b)]. 0.43/1.03 22 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom). [clausify(8)]. 0.43/1.03 Derived: -part_of(A,B) | A = B | end_point(f13(A),A). [resolve(22,c,19,b)]. 0.43/1.03 23 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(16)]. 0.43/1.03 24 inner_point(f12(A),A) # label(c3) # label(axiom). [clausify(14)]. 0.43/1.03 Derived: -end_point(f12(A),A). [resolve(23,a,24,a)]. 0.43/1.03 25 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(16)]. 0.43/1.03 Derived: incident_c(f12(A),A). [resolve(25,a,24,a)]. 0.43/1.03 26 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(16)]. 0.43/1.03 27 -inner_point(A,B) | meet(A,f4(B,A),f5(B,A)) # label(c4) # label(axiom). [clausify(4)]. 0.43/1.03 Derived: meet(f12(A),f4(A,f12(A)),f5(A,f12(A))). [resolve(27,a,24,a)]. 0.43/1.03 Derived: meet(A,f4(B,A),f5(B,A)) | -incident_c(A,B) | end_point(A,B). [resolve(27,a,26,a)]. 0.43/1.03 28 -inner_point(A,B) | sum(f4(B,A),f5(B,A)) = B # label(c4) # label(axiom). [clausify(4)]. 0.43/1.03 Derived: sum(f4(A,f12(A)),f5(A,f12(A))) = A. [resolve(28,a,24,a)]. 0.43/1.03 Derived: sum(f4(A,B),f5(A,B)) = A | -incident_c(B,A) | end_point(B,A). [resolve(28,a,26,a)]. 0.43/1.03 29 inner_point(A,f14(B,C,A,D)) | -between_c(B,C,A,D) # label(between_c_defn) # label(axiom). [clausify(17)]. 0.43/1.03 Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)). [resolve(29,a,23,a)]. 0.43/1.03 Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)). [resolve(29,a,25,a)]. 0.43/1.03 Derived: -between_c(A,B,C,D) | meet(C,f4(f14(A,B,C,D),C),f5(f14(A,B,C,D),C)). [resolve(29,a,27,a)]. 0.43/1.03 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(29,a,28,a)]. 0.43/1.03 30 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.43/1.03 Derived: A = B | -end_point(B,C) | -end_point(A,C) | -part_of(C,D) | between_c(D,B,f12(C),A). [resolve(30,c,24,a)]. 0.43/1.03 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(30,c,26,a)]. 0.43/1.03 Derived: A = B | -end_point(B,f14(C,D,E,F)) | -end_point(A,f14(C,D,E,F)) | -part_of(f14(C,D,E,F),V6) | between_c(V6,B,E,A) | -between_c(C,D,E,F). [resolve(30,c,29,a)]. 0.43/1.03 31 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom). [clausify(11)]. 0.43/1.03 32 closed(A) | end_point(f9(A),A) # label(closed_defn) # laAlarm clock 119.77/120.04 Prover9 interrupted 119.77/120.04 EOF