0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.02/0.24 % Computer : n130.star.cs.uiowa.edu 0.02/0.24 % Model : x86_64 x86_64 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.24 % Memory : 32218.625MB 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.24 % CPULimit : 300 0.02/0.24 % DateTime : Sat Jul 14 04:31:27 CDT 2018 0.02/0.24 % CPUTime : 0.06/0.46 ============================== Prover9 =============================== 0.06/0.46 Prover9 (32) version 2009-11A, November 2009. 0.06/0.46 Process 16306 was started by sandbox2 on n130.star.cs.uiowa.edu, 0.06/0.46 Sat Jul 14 04:31:27 2018 0.06/0.46 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16274_n130.star.cs.uiowa.edu". 0.06/0.46 ============================== end of head =========================== 0.06/0.46 0.06/0.46 ============================== INPUT ================================= 0.06/0.46 0.06/0.46 % Reading from file /tmp/Prover9_16274_n130.star.cs.uiowa.edu 0.06/0.46 0.06/0.46 set(prolog_style_variables). 0.06/0.46 set(auto2). 0.06/0.46 % set(auto2) -> set(auto). 0.06/0.46 % set(auto) -> set(auto_inference). 0.06/0.46 % set(auto) -> set(auto_setup). 0.06/0.46 % set(auto_setup) -> set(predicate_elim). 0.06/0.46 % set(auto_setup) -> assign(eq_defs, unfold). 0.06/0.46 % set(auto) -> set(auto_limits). 0.06/0.46 % set(auto_limits) -> assign(max_weight, "100.000"). 0.06/0.46 % set(auto_limits) -> assign(sos_limit, 20000). 0.06/0.46 % set(auto) -> set(auto_denials). 0.06/0.46 % set(auto) -> set(auto_process). 0.06/0.46 % set(auto2) -> assign(new_constants, 1). 0.06/0.46 % set(auto2) -> assign(fold_denial_max, 3). 0.06/0.46 % set(auto2) -> assign(max_weight, "200.000"). 0.06/0.46 % set(auto2) -> assign(max_hours, 1). 0.06/0.46 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.06/0.46 % set(auto2) -> assign(max_seconds, 0). 0.06/0.46 % set(auto2) -> assign(max_minutes, 5). 0.06/0.46 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.06/0.46 % set(auto2) -> set(sort_initial_sos). 0.06/0.46 % set(auto2) -> assign(sos_limit, -1). 0.06/0.46 % set(auto2) -> assign(lrs_ticks, 3000). 0.06/0.46 % set(auto2) -> assign(max_megs, 400). 0.06/0.46 % set(auto2) -> assign(stats, some). 0.06/0.46 % set(auto2) -> clear(echo_input). 0.06/0.46 % set(auto2) -> set(quiet). 0.06/0.46 % set(auto2) -> clear(print_initial_clauses). 0.06/0.46 % set(auto2) -> clear(print_given). 0.06/0.46 assign(lrs_ticks,-1). 0.06/0.46 assign(sos_limit,10000). 0.06/0.46 assign(order,kbo). 0.06/0.46 set(lex_order_vars). 0.06/0.46 clear(print_given). 0.06/0.46 0.06/0.46 % formulas(sos). % not echoed (17 formulas) 0.06/0.46 0.06/0.46 ============================== end of input ========================== 0.06/0.46 0.06/0.46 % From the command line: assign(max_seconds, 300). 0.06/0.46 0.06/0.46 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.06/0.46 0.06/0.46 % Formulas that are not ordinary clauses: 0.06/0.46 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.06/0.46 2 (all C all C1 all C2 (sum(C1,C2) = C <-> (all Q (incident_c(Q,C1) | incident_c(Q,C2) <-> incident_c(Q,C))))) # label(sum_defn) # label(axiom) # label(non_clause). [assumption]. 0.06/0.46 3 (all C all P all Q all R (end_point(P,C) & end_point(R,C) & end_point(Q,C) -> P = R | R = Q | P = Q)) # label(c5) # label(axiom) # label(non_clause). [assumption]. 0.06/0.46 4 (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.06/0.46 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.06/0.46 6 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption]. 0.06/0.46 7 (all C all C1 all C2 all C3 (part_of(C1,C) & part_of(C3,C) & (exists P (end_point(P,C2) & end_point(P,C3) & end_point(P,C1))) & part_of(C2,C) -> part_of(C2,C3) | part_of(C3,C2) | part_of(C1,C2) | part_of(C3,C1) | part_of(C1,C3) | part_of(C2,C1))) # label(c2) # label(axiom) # label(non_clause). [assumption]. 0.06/0.46 8 (all P all C all C1 (incident_c(P,C) & incident_c(P,C1) & (all Q (incident_c(Q,C1) & incident_c(Q,C) -> end_point(Q,C1) & end_point(Q,C))) <-> meet(P,C,C1))) # label(meet_defn) # label(axiom) # label(non_clause). [assumption]. 0.06/0.46 9 (all C all C1 (C1 != C & part_of(C1,C) -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption]. 0.06/0.46 10 (all C all C1 all C2 all P (C = sum(C1,C2) & meet(P,C1,C2) & closed(C) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause). [assumption]. 0.06/0.46 11 (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.06/0.46 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]. 1.60/1.81 13 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause). [assumption]. 1.60/1.81 14 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (C = sum(C1,C2) & meet(P,C1,C2))))) # label(c4) # label(axiom) # label(non_clause). [assumption]. 1.60/1.81 15 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption]. 1.60/1.81 16 (all P all C (incident_c(P,C) & (all C1 all C2 (part_of(C1,C) & incident_c(P,C1) & incident_c(P,C2) & 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]. 1.60/1.81 17 -(all C1 all C2 all C3 all P (meet(P,C1,C2) & meet(P,C1,C3) & part_of(C2,C3) -> part_of(sum(C1,C2),sum(C1,C3)))) # label(corollary_2_6_1) # label(negated_conjecture) # label(non_clause). [assumption]. 1.60/1.81 1.60/1.81 ============================== end of process non-clausal formulas === 1.60/1.81 1.60/1.81 ============================== PROCESS INITIAL CLAUSES =============== 1.60/1.81 1.60/1.81 ============================== PREDICATE ELIMINATION ================= 1.60/1.81 18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(11)]. 1.60/1.81 19 inner_point(f5(A),A) # label(c3) # label(axiom). [clausify(6)]. 1.60/1.81 Derived: -end_point(f5(A),A). [resolve(18,a,19,a)]. 1.60/1.81 20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(11)]. 1.60/1.81 Derived: incident_c(f5(A),A). [resolve(20,a,19,a)]. 1.60/1.81 21 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(11)]. 1.60/1.81 22 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom). [clausify(14)]. 1.60/1.81 Derived: meet(f5(A),f9(A,f5(A)),f10(A,f5(A))). [resolve(22,a,19,a)]. 1.60/1.81 Derived: meet(A,f9(B,A),f10(B,A)) | end_point(A,B) | -incident_c(A,B). [resolve(22,a,21,a)]. 1.60/1.81 23 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom). [clausify(14)]. 1.60/1.81 Derived: sum(f9(A,f5(A)),f10(A,f5(A))) = A. [resolve(23,a,19,a)]. 1.60/1.81 Derived: sum(f9(A,B),f10(A,B)) = A | end_point(B,A) | -incident_c(B,A). [resolve(23,a,21,a)]. 1.60/1.81 24 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom). [clausify(15)]. 1.60/1.81 25 closed(A) | end_point(f11(A),A) # label(closed_defn) # label(axiom). [clausify(15)]. 1.60/1.81 Derived: -end_point(A,B) | end_point(f11(B),B). [resolve(24,a,25,a)]. 1.60/1.81 26 sum(A,B) != C | -meet(D,A,B) | -closed(C) | -end_point(E,A) | meet(E,A,B) # label(c7) # label(axiom). [clausify(10)]. 1.60/1.81 Derived: sum(A,B) != C | -meet(D,A,B) | -end_point(E,A) | meet(E,A,B) | end_point(f11(C),C). [resolve(26,c,25,a)]. 1.60/1.81 27 end_point(f8(A),A) | -open(A) # label(open_defn) # label(axiom). [clausify(13)]. 1.60/1.81 28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom). [clausify(13)]. 1.60/1.81 Derived: end_point(f8(A),A) | -end_point(B,A). [resolve(27,b,28,b)]. 1.60/1.81 29 A = B | -part_of(A,B) | open(A) # label(c1) # label(axiom). [clausify(9)]. 1.60/1.81 Derived: A = B | -part_of(A,B) | end_point(f8(A),A). [resolve(29,c,27,b)]. 1.60/1.81 1.60/1.81 ============================== end predicate elimination ============= 1.60/1.81 1.60/1.81 Auto_denials: (non-Horn, no changes). 1.60/1.81 1.60/1.81 Term ordering decisions: 1.60/1.81 Function symbol KB weights: c10=1. c11=1. c12=1. c13=1. sum=1. f1=1. f3=1. f4=1. f7=1. f9=1. f10=1. f12=1. f13=1. f5=1. f8=1. f11=1. f2=1. f6=1. 1.60/1.81 1.60/1.81 ============================== end of process initial clauses ======== 1.60/1.81 1.60/1.81 ============================== CLAUSES FOR SEARCH ==================== 1.60/1.81 1.60/1.81 ============================== end of clauses for search ============= 1.60/1.81 1.60/1.81 ============================== SEARCH ================================ 1.60/1.81 1.60/1.81 % Starting search at 0.01 seconds. 1.60/1.81 1.60/1.81 Low Water (keep): wt=43.000, iters=3349 1.60/1.81 1.60/1.81 Low Water (keep): wt=34.000, iters=3379 1.60/1.81 1.60/1.81 Low Water (keep): wt=31.000, iters=3381 1.60/1.81 1.60/1.81 Low Water (keep): wt=28.000, iters=3335 1.60/1.81 1.60/1.81 Low Water (keep): wt=26.000, iters=3372 1.60/1.81 1.60/1.81 Low Water (keep): wt=25.000, iters=3497 1.60/1.81 1.60/1.81 Low Water (keep): wt=24.000, iters=3370 1.60/1.81 1.60/1.81 Low Water (keep): wt=23.000, iters=3344 1.60/1.81 1.60/1.81 Low Water (keep): wt=22.000, iters=3471 1.60/1.81 1.60/1.81 Low Water (keep): wt=15.000, iters=3417 1.60/1.81 1.60/1.81 Low Water (keep): wt=14.000, iters=3403 1.60/1.81 1.60/1.81 Low Water (keep): wt=13.000, iters=3363 8.19/8.41 8.19/8.41 ============================== PROOF ================================= 8.19/8.41 % SZS status Theorem 8.19/8.41 % SZS output start Refutation 8.19/8.41 8.19/8.41 % Proof 1 at 7.93 (+ 0.03) seconds. 8.19/8.41 % Length of proof is 19. 8.19/8.41 % Level of proof is 5. 8.19/8.41 % Maximum clause weight is 25.000. 8.19/8.41 % Given clauses 1852. 8.19/8.41 8.19/8.41 2 (all C all C1 all C2 (sum(C1,C2) = C <-> (all Q (incident_c(Q,C1) | incident_c(Q,C2) <-> incident_c(Q,C))))) # label(sum_defn) # label(axiom) # label(non_clause). [assumption]. 8.19/8.41 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]. 8.19/8.41 17 -(all C1 all C2 all C3 all P (meet(P,C1,C2) & meet(P,C1,C3) & part_of(C2,C3) -> part_of(sum(C1,C2),sum(C1,C3)))) # label(corollary_2_6_1) # label(negated_conjecture) # label(non_clause). [assumption]. 8.19/8.41 30 part_of(c11,c12) # label(corollary_2_6_1) # label(negated_conjecture). [clausify(17)]. 8.19/8.41 33 incident_c(f7(A,B),B) | part_of(B,A) # label(part_of_defn) # label(axiom). [clausify(12)]. 8.19/8.41 36 -part_of(sum(c10,c11),sum(c10,c12)) # label(corollary_2_6_1) # label(negated_conjecture). [clausify(17)]. 8.19/8.41 42 -incident_c(f7(A,B),A) | part_of(B,A) # label(part_of_defn) # label(axiom). [clausify(12)]. 8.19/8.41 43 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C) # label(part_of_defn) # label(axiom). [clausify(12)]. 8.19/8.41 44 sum(A,B) != C | -incident_c(D,A) | incident_c(D,C) # label(sum_defn) # label(axiom). [clausify(2)]. 8.19/8.41 45 sum(A,B) != C | -incident_c(D,B) | incident_c(D,C) # label(sum_defn) # label(axiom). [clausify(2)]. 8.19/8.41 57 sum(A,B) != C | incident_c(D,A) | incident_c(D,B) | -incident_c(D,C) # label(sum_defn) # label(axiom). [clausify(2)]. 8.19/8.41 89 incident_c(f7(sum(c10,c12),sum(c10,c11)),sum(c10,c11)). [resolve(36,a,33,b)]. 8.19/8.41 93 -incident_c(f7(sum(c10,c12),sum(c10,c11)),sum(c10,c12)). [ur(42,b,36,a)]. 8.19/8.41 95 -incident_c(A,c11) | incident_c(A,c12). [resolve(43,c,30,a)]. 8.19/8.41 383 sum(c10,c11) != sum(A,B) | incident_c(f7(sum(c10,c12),sum(c10,c11)),A) | incident_c(f7(sum(c10,c12),sum(c10,c11)),B). [resolve(89,a,57,d),flip(a)]. 8.19/8.41 478 -incident_c(f7(sum(c10,c12),sum(c10,c11)),c12). [ur(45,a,xx,c,93,a)]. 8.19/8.41 481 -incident_c(f7(sum(c10,c12),sum(c10,c11)),c10). [ur(44,a,xx,c,93,a)]. 8.19/8.41 14290 incident_c(f7(sum(c10,c12),sum(c10,c11)),c11). [xx_res(383,a),unit_del(a,481)]. 8.19/8.41 14338 $F. [resolve(14290,a,95,a),unit_del(a,478)]. 8.19/8.41 8.19/8.41 % SZS output end Refutation 8.19/8.41 ============================== end of proof ========================== 8.19/8.41 8.19/8.41 ============================== STATISTICS ============================ 8.19/8.41 8.19/8.41 Given=1852. Generated=52577. Kept=14307. proofs=1. 8.19/8.41 Usable=1631. Sos=8715. Demods=18. Limbo=6, Disabled=4012. Hints=0. 8.19/8.41 Megabytes=11.27. 8.19/8.41 User_CPU=7.93, System_CPU=0.03, Wall_clock=8. 8.19/8.41 8.19/8.41 ============================== end of statistics ===================== 8.19/8.41 8.19/8.41 ============================== end of search ========================= 8.19/8.41 8.19/8.41 THEOREM PROVED 8.19/8.41 % SZS status Theorem 8.19/8.41 8.19/8.41 Exiting with 1 proof. 8.19/8.41 8.19/8.41 Process 16306 exit (max_proofs) Sat Jul 14 04:31:35 2018 8.19/8.41 Prover9 interrupted 8.19/8.41 EOF