0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n029.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 960 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Aug 9 02:07:54 EDT 2022 0.12/0.34 % CPUTime : 0.76/1.26 ============================== Prover9 =============================== 0.76/1.26 Prover9 (32) version 2009-11A, November 2009. 0.76/1.26 Process 853 was started by sandbox2 on n029.cluster.edu, 0.76/1.26 Tue Aug 9 02:07:55 2022 0.76/1.26 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_691_n029.cluster.edu". 0.76/1.26 ============================== end of head =========================== 0.76/1.26 0.76/1.26 ============================== INPUT ================================= 0.76/1.26 0.76/1.26 % Reading from file /tmp/Prover9_691_n029.cluster.edu 0.76/1.26 0.76/1.26 set(prolog_style_variables). 0.76/1.26 set(auto2). 0.76/1.26 % set(auto2) -> set(auto). 0.76/1.26 % set(auto) -> set(auto_inference). 0.76/1.26 % set(auto) -> set(auto_setup). 0.76/1.26 % set(auto_setup) -> set(predicate_elim). 0.76/1.26 % set(auto_setup) -> assign(eq_defs, unfold). 0.76/1.26 % set(auto) -> set(auto_limits). 0.76/1.26 % set(auto_limits) -> assign(max_weight, "100.000"). 0.76/1.26 % set(auto_limits) -> assign(sos_limit, 20000). 0.76/1.26 % set(auto) -> set(auto_denials). 0.76/1.26 % set(auto) -> set(auto_process). 0.76/1.26 % set(auto2) -> assign(new_constants, 1). 0.76/1.26 % set(auto2) -> assign(fold_denial_max, 3). 0.76/1.26 % set(auto2) -> assign(max_weight, "200.000"). 0.76/1.26 % set(auto2) -> assign(max_hours, 1). 0.76/1.26 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.76/1.26 % set(auto2) -> assign(max_seconds, 0). 0.76/1.26 % set(auto2) -> assign(max_minutes, 5). 0.76/1.26 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.76/1.26 % set(auto2) -> set(sort_initial_sos). 0.76/1.26 % set(auto2) -> assign(sos_limit, -1). 0.76/1.26 % set(auto2) -> assign(lrs_ticks, 3000). 0.76/1.26 % set(auto2) -> assign(max_megs, 400). 0.76/1.26 % set(auto2) -> assign(stats, some). 0.76/1.26 % set(auto2) -> clear(echo_input). 0.76/1.26 % set(auto2) -> set(quiet). 0.76/1.26 % set(auto2) -> clear(print_initial_clauses). 0.76/1.26 % set(auto2) -> clear(print_given). 0.76/1.26 assign(lrs_ticks,-1). 0.76/1.26 assign(sos_limit,10000). 0.76/1.26 assign(order,kbo). 0.76/1.26 set(lex_order_vars). 0.76/1.26 clear(print_given). 0.76/1.26 0.76/1.26 % formulas(sos). % not echoed (17 formulas) 0.76/1.26 0.76/1.26 ============================== end of input ========================== 0.76/1.26 0.76/1.26 % From the command line: assign(max_seconds, 960). 0.76/1.26 0.76/1.26 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.76/1.26 0.76/1.26 % Formulas that are not ordinary clauses: 0.76/1.26 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.76/1.26 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.76/1.26 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.76/1.26 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.76/1.26 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.76/1.26 6 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause). [assumption]. 0.76/1.26 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.76/1.26 8 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause). [assumption]. 0.76/1.26 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.76/1.26 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.76/1.26 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.76/1.26 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.82/1.33 13 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause). [assumption]. 0.82/1.33 14 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.33 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.82/1.33 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.82/1.33 17 -(all C1 all C2 (part_of(C2,C1) & part_of(C1,C2) -> C1 = C2)) # label(part_of_antisymmetry) # label(negated_conjecture) # label(non_clause). [assumption]. 0.82/1.33 0.82/1.33 ============================== end of process non-clausal formulas === 0.82/1.33 0.82/1.33 ============================== PROCESS INITIAL CLAUSES =============== 0.82/1.33 0.82/1.33 ============================== PREDICATE ELIMINATION ================= 0.82/1.33 18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.82/1.33 19 inner_point(f9(A),A) # label(c3) # label(axiom). [clausify(13)]. 0.82/1.33 Derived: -end_point(f9(A),A). [resolve(18,a,19,a)]. 0.82/1.33 20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.82/1.33 Derived: incident_c(f9(A),A). [resolve(20,a,19,a)]. 0.82/1.33 21 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom). [clausify(3)]. 0.82/1.33 22 -inner_point(A,B) | meet(A,f10(B,A),f11(B,A)) # label(c4) # label(axiom). [clausify(15)]. 0.82/1.33 Derived: meet(f9(A),f10(A,f9(A)),f11(A,f9(A))). [resolve(22,a,19,a)]. 0.82/1.33 Derived: meet(A,f10(B,A),f11(B,A)) | end_point(A,B) | -incident_c(A,B). [resolve(22,a,21,a)]. 0.82/1.33 23 -inner_point(A,B) | sum(f10(B,A),f11(B,A)) = B # label(c4) # label(axiom). [clausify(15)]. 0.82/1.33 Derived: sum(f10(A,f9(A)),f11(A,f9(A))) = A. [resolve(23,a,19,a)]. 0.82/1.33 Derived: sum(f10(A,B),f11(A,B)) = A | end_point(B,A) | -incident_c(B,A). [resolve(23,a,21,a)]. 0.82/1.33 24 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom). [clausify(8)]. 0.82/1.33 25 closed(A) | end_point(f5(A),A) # label(closed_defn) # label(axiom). [clausify(8)]. 0.82/1.33 Derived: -end_point(A,B) | end_point(f5(B),B). [resolve(24,a,25,a)]. 0.82/1.33 26 -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.82/1.33 Derived: -meet(A,B,C) | sum(B,C) != D | -end_point(E,B) | meet(E,B,C) | end_point(f5(D),D). [resolve(26,c,25,a)]. 0.82/1.33 27 end_point(f3(A),A) | -open(A) # label(open_defn) # label(axiom). [clausify(6)]. 0.82/1.33 28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom). [clausify(6)]. 0.82/1.33 Derived: end_point(f3(A),A) | -end_point(B,A). [resolve(27,b,28,b)]. 0.82/1.33 29 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom). [clausify(14)]. 0.82/1.33 Derived: -part_of(A,B) | A = B | end_point(f3(A),A). [resolve(29,c,27,b)]. 0.82/1.33 0.82/1.33 ============================== end predicate elimination ============= 0.82/1.33 0.82/1.33 Auto_denials: (non-Horn, no changes). 0.82/1.33 0.82/1.33 Term ordering decisions: 0.82/1.33 Function symbol KB weights: c10=1. c11=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. 0.82/1.33 0.82/1.33 ============================== end of process initial clauses ======== 0.82/1.33 0.82/1.33 ============================== CLAUSES FOR SEARCH ==================== 0.82/1.33 0.82/1.33 ============================== end of clauses for search ============= 0.82/1.33 0.82/1.33 ============================== SEARCH ================================ 0.82/1.33 0.82/1.33 % Starting search at 0.02 seconds. 0.82/1.33 0.82/1.33 ============================== PROOF ================================= 0.82/1.33 % SZS status Theorem 0.82/1.33 % SZS output start Refutation 0.82/1.33 0.82/1.33 % Proof 1 at 0.08 (+ 0.00) seconds. 0.82/1.33 % Length of proof is 16. 0.82/1.33 % Level of proof is 5. 0.82/1.33 % Maximum clause weight is 13.000. 0.82/1.33 % Given clauses 87. 0.82/1.33 0.82/1.33 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.82/1.33 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.82/1.33 17 -(all C1 all C2 (part_of(C2,C1) & part_of(C1,C2) -> C1 = C2)) # label(part_of_antisymmetry) # label(negated_conjecture) # label(non_clause). [assumption]. 0.82/1.33 30 part_of(c11,c10) # label(part_of_antisymmetry) # label(negated_conjecture). [clausify(17)]. 0.82/1.33 31 part_of(c10,c11) # label(part_of_antisymmetry) # label(negated_conjecture). [clausify(17)]. 0.82/1.33 33 incident_c(f4(A,B),A) | incident_c(f4(A,B),B) | B = A # label(c9) # label(axiom). [clausify(7)]. 0.82/1.33 35 c11 != c10 # label(part_of_antisymmetry) # label(negated_conjecture). [clausify(17)]. 0.82/1.33 42 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C) # label(part_of_defn) # label(axiom). [clausify(1)]. 0.82/1.33 51 -incident_c(f4(A,B),A) | -incident_c(f4(A,B),B) | B = A # label(c9) # label(axiom). [clausify(7)]. 0.82/1.33 89 -incident_c(A,c10) | incident_c(A,c11). [resolve(42,c,31,a)]. 0.82/1.33 90 -incident_c(A,c11) | incident_c(A,c10). [resolve(42,c,30,a)]. 0.82/1.33 423 incident_c(f4(A,c10),c11) | incident_c(f4(A,c10),A) | c10 = A. [resolve(89,a,33,b)]. 0.82/1.33 435 incident_c(f4(c11,c10),c11). [factor(423,a,b),flip(b),unit_del(b,35)]. 0.82/1.33 488 incident_c(f4(c11,A),c10) | incident_c(f4(c11,A),A) | c11 = A. [resolve(90,a,33,a),flip(c)]. 0.82/1.33 500 incident_c(f4(c11,c10),c10). [factor(488,a,b),unit_del(b,35)]. 0.82/1.33 620 $F. [resolve(435,a,51,a),flip(b),unit_del(a,500),unit_del(b,35)]. 0.82/1.33 0.82/1.33 % SZS output end Refutation 0.82/1.33 ============================== end of proof ========================== 0.82/1.33 0.82/1.33 ============================== STATISTICS ============================ 0.82/1.33 0.82/1.33 Given=87. Generated=998. Kept=589. proofs=1. 0.82/1.33 Usable=85. Sos=448. Demods=2. Limbo=9, Disabled=103. Hints=0. 0.82/1.33 Megabytes=0.60. 0.82/1.33 User_CPU=0.08, System_CPU=0.00, Wall_clock=0. 0.82/1.33 0.82/1.33 ============================== end of statistics ===================== 0.82/1.33 0.82/1.33 ============================== end of search ========================= 0.82/1.33 0.82/1.33 THEOREM PROVED 0.82/1.33 % SZS status Theorem 0.82/1.33 0.82/1.33 Exiting with 1 proof. 0.82/1.33 0.82/1.33 Process 853 exit (max_proofs) Tue Aug 9 02:07:55 2022 0.82/1.33 Prover9 interrupted 0.82/1.33 EOF