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 : n007.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 : 1200 0.12/0.33 % DateTime : Tue Jul 13 12:42:04 EDT 2021 0.12/0.34 % CPUTime : 0.44/1.02 ============================== Prover9 =============================== 0.44/1.02 Prover9 (32) version 2009-11A, November 2009. 0.44/1.02 Process 30994 was started by sandbox2 on n007.cluster.edu, 0.44/1.02 Tue Jul 13 12:42:04 2021 0.44/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_30834_n007.cluster.edu". 0.44/1.02 ============================== end of head =========================== 0.44/1.02 0.44/1.02 ============================== INPUT ================================= 0.44/1.02 0.44/1.02 % Reading from file /tmp/Prover9_30834_n007.cluster.edu 0.44/1.02 0.44/1.02 set(prolog_style_variables). 0.44/1.02 set(auto2). 0.44/1.02 % set(auto2) -> set(auto). 0.44/1.02 % set(auto) -> set(auto_inference). 0.44/1.02 % set(auto) -> set(auto_setup). 0.44/1.02 % set(auto_setup) -> set(predicate_elim). 0.44/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.44/1.02 % set(auto) -> set(auto_limits). 0.44/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.44/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.44/1.02 % set(auto) -> set(auto_denials). 0.44/1.02 % set(auto) -> set(auto_process). 0.44/1.02 % set(auto2) -> assign(new_constants, 1). 0.44/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.44/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.44/1.02 % set(auto2) -> assign(max_hours, 1). 0.44/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.44/1.02 % set(auto2) -> assign(max_seconds, 0). 0.44/1.02 % set(auto2) -> assign(max_minutes, 5). 0.44/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.44/1.02 % set(auto2) -> set(sort_initial_sos). 0.44/1.02 % set(auto2) -> assign(sos_limit, -1). 0.44/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.44/1.02 % set(auto2) -> assign(max_megs, 400). 0.44/1.02 % set(auto2) -> assign(stats, some). 0.44/1.02 % set(auto2) -> clear(echo_input). 0.44/1.02 % set(auto2) -> set(quiet). 0.44/1.02 % set(auto2) -> clear(print_initial_clauses). 0.44/1.02 % set(auto2) -> clear(print_given). 0.44/1.02 assign(lrs_ticks,-1). 0.44/1.02 assign(sos_limit,10000). 0.44/1.02 assign(order,kbo). 0.44/1.02 set(lex_order_vars). 0.44/1.02 clear(print_given). 0.44/1.02 0.44/1.02 % formulas(sos). % not echoed (17 formulas) 0.44/1.02 0.44/1.02 ============================== end of input ========================== 0.44/1.02 0.44/1.02 % From the command line: assign(max_seconds, 1200). 0.44/1.02 0.44/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.44/1.02 0.44/1.02 % Formulas that are not ordinary clauses: 0.44/1.02 1 (all C all C1 all C2 all C3 (part_of(C1,C) & (exists P (end_point(P,C2) & end_point(P,C3) & end_point(P,C1))) & part_of(C3,C) & part_of(C2,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.44/1.02 2 (all P all C ((all C1 all C2 (part_of(C1,C) & part_of(C2,C) & incident_c(P,C1) & incident_c(P,C2) -> 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.44/1.02 3 (all C all C1 (C1 != C & part_of(C1,C) -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.02 4 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption]. 0.44/1.02 5 (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.44/1.02 6 (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.44/1.02 7 (all C all C1 all C2 all P (closed(C) & C = sum(C1,C2) & meet(P,C1,C2) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause). [assumption]. 0.44/1.02 8 (all C all P (end_point(P,C) -> (exists Q (P != Q & end_point(Q,C))))) # label(c6) # label(axiom) # label(non_clause). [assumption]. 0.44/1.02 9 (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.44/1.02 10 (all C all P all Q all R (end_point(R,C) & end_point(Q,C) & end_point(P,C) -> Q = P | Q = R | P = R)) # label(c5) # label(axiom) # label(non_clause). [assumption]. 0.44/1.02 11 (all C all C1 all C2 ((all Q (incident_c(Q,C) <-> incident_c(Q,C2) | incident_c(Q,C1))) <-> C = sum(C1,C2))) # label(sum_defn) # label(axiom) # label(non_clause). [assumption]. 0.44/1.02 12 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption]. 14.97/15.27 13 (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]. 14.97/15.27 14 (all C all C1 ((all P (incident_c(P,C) <-> incident_c(P,C1))) -> C1 = C)) # label(c9) # label(axiom) # label(non_clause). [assumption]. 14.97/15.27 15 (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]. 14.97/15.27 16 (all C (open(C) <-> (exists P end_point(P,C)))) # label(open_defn) # label(axiom) # label(non_clause). [assumption]. 14.97/15.27 17 -(all C all C1 all C2 all P (open(C) & part_of(C2,C) & meet(P,C1,C2) & part_of(C1,C) -> open(sum(C1,C2)))) # label(proposition_2_14_2) # label(negated_conjecture) # label(non_clause). [assumption]. 14.97/15.27 14.97/15.27 ============================== end of process non-clausal formulas === 14.97/15.27 14.97/15.27 ============================== PROCESS INITIAL CLAUSES =============== 14.97/15.27 14.97/15.27 ============================== PREDICATE ELIMINATION ================= 14.97/15.27 18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(6)]. 14.97/15.27 19 inner_point(f8(A),A) # label(c3) # label(axiom). [clausify(12)]. 14.97/15.27 Derived: -end_point(f8(A),A). [resolve(18,a,19,a)]. 14.97/15.27 20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(6)]. 14.97/15.27 Derived: incident_c(f8(A),A). [resolve(20,a,19,a)]. 14.97/15.27 21 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(6)]. 14.97/15.27 22 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom). [clausify(13)]. 14.97/15.27 Derived: meet(f8(A),f9(A,f8(A)),f10(A,f8(A))). [resolve(22,a,19,a)]. 14.97/15.27 Derived: meet(A,f9(B,A),f10(B,A)) | end_point(A,B) | -incident_c(A,B). [resolve(22,a,21,a)]. 14.97/15.27 23 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom). [clausify(13)]. 14.97/15.27 Derived: sum(f9(A,f8(A)),f10(A,f8(A))) = A. [resolve(23,a,19,a)]. 14.97/15.27 Derived: sum(f9(A,B),f10(A,B)) = A | end_point(B,A) | -incident_c(B,A). [resolve(23,a,21,a)]. 14.97/15.27 24 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom). [clausify(4)]. 14.97/15.27 25 end_point(f3(A),A) | closed(A) # label(closed_defn) # label(axiom). [clausify(4)]. 14.97/15.27 Derived: -end_point(A,B) | end_point(f3(B),B). [resolve(24,b,25,b)]. 14.97/15.27 26 -closed(A) | sum(B,C) != A | -meet(D,B,C) | -end_point(E,B) | meet(E,B,C) # label(c7) # label(axiom). [clausify(7)]. 14.97/15.27 Derived: sum(A,B) != C | -meet(D,A,B) | -end_point(E,A) | meet(E,A,B) | end_point(f3(C),C). [resolve(26,a,25,b)]. 14.97/15.27 14.97/15.27 ============================== end predicate elimination ============= 14.97/15.27 14.97/15.27 Auto_denials: (non-Horn, no changes). 14.97/15.27 14.97/15.27 Term ordering decisions: 14.97/15.27 Function symbol KB weights: c10=1. c11=1. c12=1. c13=1. sum=1. f1=1. f2=1. f4=1. f5=1. f6=1. f9=1. f10=1. f11=1. f3=1. f8=1. f13=1. f7=1. f12=1. 14.97/15.27 14.97/15.27 ============================== end of process initial clauses ======== 14.97/15.27 14.97/15.27 ============================== CLAUSES FOR SEARCH ==================== 14.97/15.27 14.97/15.27 ============================== end of clauses for search ============= 14.97/15.27 14.97/15.27 ============================== SEARCH ================================ 14.97/15.27 14.97/15.27 % Starting search at 0.02 seconds. 14.97/15.27 14.97/15.27 Low Water (keep): wt=31.000, iters=3340 14.97/15.27 14.97/15.27 Low Water (keep): wt=29.000, iters=3336 14.97/15.27 14.97/15.27 Low Water (keep): wt=28.000, iters=3339 14.97/15.27 14.97/15.27 Low Water (keep): wt=26.000, iters=3370 14.97/15.27 14.97/15.27 Low Water (keep): wt=25.000, iters=3361 14.97/15.27 14.97/15.27 Low Water (keep): wt=24.000, iters=3372 14.97/15.27 14.97/15.27 Low Water (keep): wt=23.000, iters=3334 14.97/15.27 14.97/15.27 Low Water (keep): wt=22.000, iters=3358 14.97/15.27 14.97/15.27 Low Water (keep): wt=21.000, iters=3407 14.97/15.27 14.97/15.27 Low Water (keep): wt=20.000, iters=3342 14.97/15.27 14.97/15.27 Low Water (keep): wt=19.000, iters=3379 14.97/15.27 14.97/15.27 Low Water (keep): wt=18.000, iters=3345 14.97/15.27 14.97/15.27 Low Water (keep): wt=17.000, iters=3384 14.97/15.27 14.97/15.27 Low Water (keep): wt=15.000, iters=3385 14.97/15.27 14.97/15.27 Low Water (keep): wt=14.000, iters=3747 14.97/15.27 14.97/15.27 Low Water (keep): wt=13.000, iters=3339 14.97/15.27 14.97/15.27 Low Water (displace): id=5161, wt=31.000 14.97/15.27 14.97/15.27 Low Water (displace): id=6341, wt=27.000 14.97/15.27 14.97/15.27 Low Water (displace): id=13832, wt=24.000 14.97/15.27 14.97/15.27 Low Water (displace): id=6339, wt=23.000 14.97/15.27 14.97/15.27 Low Water (displace): id=10658, wt=19.000 14.97/15.27 14.97/15.27 Low Water (displacAlarm clock 119.74/120.05 Prover9 interrupted 119.74/120.05 EOF