0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.03/0.24 % Computer : n017.star.cs.uiowa.edu 0.03/0.24 % Model : x86_64 x86_64 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.24 % Memory : 32218.625MB 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.24 % CPULimit : 300 0.03/0.24 % DateTime : Sat Jul 14 05:39:10 CDT 2018 0.03/0.24 % CPUTime : 0.07/0.45 ============================== Prover9 =============================== 0.07/0.45 Prover9 (32) version 2009-11A, November 2009. 0.07/0.45 Process 62817 was started by sandbox2 on n017.star.cs.uiowa.edu, 0.07/0.45 Sat Jul 14 05:39:10 2018 0.07/0.45 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_62785_n017.star.cs.uiowa.edu". 0.07/0.45 ============================== end of head =========================== 0.07/0.45 0.07/0.45 ============================== INPUT ================================= 0.07/0.45 0.07/0.45 % Reading from file /tmp/Prover9_62785_n017.star.cs.uiowa.edu 0.07/0.45 0.07/0.45 set(prolog_style_variables). 0.07/0.45 set(auto2). 0.07/0.45 % set(auto2) -> set(auto). 0.07/0.45 % set(auto) -> set(auto_inference). 0.07/0.45 % set(auto) -> set(auto_setup). 0.07/0.45 % set(auto_setup) -> set(predicate_elim). 0.07/0.45 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.45 % set(auto) -> set(auto_limits). 0.07/0.45 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.45 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.45 % set(auto) -> set(auto_denials). 0.07/0.45 % set(auto) -> set(auto_process). 0.07/0.45 % set(auto2) -> assign(new_constants, 1). 0.07/0.45 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.45 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.45 % set(auto2) -> assign(max_hours, 1). 0.07/0.45 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.45 % set(auto2) -> assign(max_seconds, 0). 0.07/0.45 % set(auto2) -> assign(max_minutes, 5). 0.07/0.45 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.45 % set(auto2) -> set(sort_initial_sos). 0.07/0.45 % set(auto2) -> assign(sos_limit, -1). 0.07/0.45 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.45 % set(auto2) -> assign(max_megs, 400). 0.07/0.45 % set(auto2) -> assign(stats, some). 0.07/0.45 % set(auto2) -> clear(echo_input). 0.07/0.45 % set(auto2) -> set(quiet). 0.07/0.45 % set(auto2) -> clear(print_initial_clauses). 0.07/0.45 % set(auto2) -> clear(print_given). 0.07/0.45 assign(lrs_ticks,-1). 0.07/0.45 assign(sos_limit,10000). 0.07/0.45 assign(order,kbo). 0.07/0.45 set(lex_order_vars). 0.07/0.45 clear(print_given). 0.07/0.45 0.07/0.45 % formulas(sos). % not echoed (19 formulas) 0.07/0.45 0.07/0.45 ============================== end of input ========================== 0.07/0.45 0.07/0.45 % From the command line: assign(max_seconds, 300). 0.07/0.45 0.07/0.45 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.45 0.07/0.45 % Formulas that are not ordinary clauses: 0.07/0.45 1 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 2 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 3 (all U all V (strictly_less_than(U,V) <-> -less_than(V,U) & less_than(U,V))) # label(stricly_smaller_definition) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 4 (all U all V all W (less_than(U,V) & less_than(V,W) -> less_than(U,W))) # label(transitivity) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 5 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 6 (all U all V all W remove_slb(insert_slb(U,pair(V,W)),V) = U) # label(ax24) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 7 (all U all V all W all X (less_than(W,X) -> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,X)))) # label(ax30) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 8 (all U all V all W all X all Y (pair_in_list(U,W,Y) | Y = X & W = V <-> pair_in_list(insert_slb(U,pair(V,X)),W,Y))) # label(ax23) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 9 (all U all V all W all X (strictly_less_than(X,W) -> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,W)))) # label(ax29) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 10 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 11 (all U all V all W all X (W != V & contains_slb(U,W) -> remove_slb(insert_slb(U,pair(V,X)),W) = insert_slb(remove_slb(U,W),pair(V,X)))) # label(ax25) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 12 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 13 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 14 (all U all V all W lookup_slb(insert_slb(U,pair(V,W)),V) = W) # label(ax26) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 15 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 16 (all U all V all W all X (contains_slb(U,W) | W = V <-> contains_slb(insert_slb(U,pair(V,X)),W))) # label(ax21) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 17 (all U all V all W all X (W != V & contains_slb(U,W) -> lookup_slb(U,W) = lookup_slb(insert_slb(U,pair(V,X)),W))) # label(ax27) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 18 -(all U ((all V all W all X (pair_in_list(U,V,W) & less_than(X,W) -> pair_in_list(update_slb(U,X),V,W))) -> (all Y all Z all X1 all X2 all X3 (less_than(X1,Z) & pair_in_list(insert_slb(U,pair(X2,X3)),Y,Z) -> pair_in_list(update_slb(insert_slb(U,pair(X2,X3)),X1),Y,Z))))) # label(l37_co) # label(negated_conjecture) # label(non_clause). [assumption]. 4.01/4.25 4.01/4.25 ============================== end of process non-clausal formulas === 4.01/4.25 4.01/4.25 ============================== PROCESS INITIAL CLAUSES =============== 4.01/4.25 4.01/4.25 ============================== PREDICATE ELIMINATION ================= 4.01/4.25 19 strictly_less_than(A,B) | less_than(B,A) | -less_than(A,B) # label(stricly_smaller_definition) # label(axiom). [clausify(3)]. 4.01/4.25 20 -strictly_less_than(A,B) | -less_than(B,A) # label(stricly_smaller_definition) # label(axiom). [clausify(3)]. 4.01/4.25 21 -strictly_less_than(A,B) | less_than(A,B) # label(stricly_smaller_definition) # label(axiom). [clausify(3)]. 4.01/4.25 22 -strictly_less_than(A,B) | update_slb(insert_slb(C,pair(D,A)),B) = insert_slb(update_slb(C,B),pair(D,B)) # label(ax29) # label(axiom). [clausify(9)]. 4.01/4.25 Derived: update_slb(insert_slb(A,pair(B,C)),D) = insert_slb(update_slb(A,D),pair(B,D)) | less_than(D,C) | -less_than(C,D). [resolve(22,a,19,a)]. 4.01/4.25 4.01/4.25 ============================== end predicate elimination ============= 4.01/4.25 4.01/4.25 Auto_denials: (non-Horn, no changes). 4.01/4.25 4.01/4.25 Term ordering decisions: 4.01/4.25 Function symbol KB weights: create_slb=1. bottom=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. insert_slb=1. pair=1. update_slb=1. lookup_slb=1. remove_slb=1. 4.01/4.25 4.01/4.25 ============================== end of process initial clauses ======== 4.01/4.25 4.01/4.25 ============================== CLAUSES FOR SEARCH ==================== 4.01/4.25 4.01/4.25 ============================== end of clauses for search ============= 4.01/4.25 4.01/4.25 ============================== SEARCH ================================ 4.01/4.25 4.01/4.25 % Starting search at 0.01 seconds. 4.01/4.25 4.01/4.25 ============================== PROOF ================================= 4.01/4.25 % SZS status Theorem 4.01/4.25 % SZS output start Refutation 4.01/4.25 4.01/4.25 % Proof 1 at 3.79 (+ 0.02) seconds. 4.01/4.25 % Length of proof is 43. 4.01/4.25 % Level of proof is 12. 4.01/4.25 % Maximum clause weight is 30.000. 4.01/4.25 % Given clauses 412. 4.01/4.25 4.01/4.25 3 (all U all V (strictly_less_than(U,V) <-> -less_than(V,U) & less_than(U,V))) # label(stricly_smaller_definition) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 5 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 7 (all U all V all W all X (less_than(W,X) -> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,X)))) # label(ax30) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 8 (all U all V all W all X all Y (pair_in_list(U,W,Y) | Y = X & W = V <-> pair_in_list(insert_slb(U,pair(V,X)),W,Y))) # label(ax23) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 9 (all U all V all W all X (strictly_less_than(X,W) -> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,W)))) # label(ax29) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 14 (all U all V all W lookup_slb(insert_slb(U,pair(V,W)),V) = W) # label(ax26) # label(axiom) # label(non_clause). [assumption]. 4.01/4.25 18 -(all U ((all V all W all X (pair_in_list(U,V,W) & less_than(X,W) -> pair_in_list(update_slb(U,X),V,W))) -> (all Y all Z all X1 all X2 all X3 (less_than(X1,Z) & pair_in_list(insert_slb(U,pair(X2,X3)),Y,Z) -> pair_in_list(update_slb(insert_slb(U,pair(X2,X3)),X1),Y,Z))))) # label(l37_co) # label(negated_conjecture) # label(non_clause). [assumption]. 4.01/4.25 19 strictly_less_than(A,B) | less_than(B,A) | -less_than(A,B) # label(stricly_smaller_definition) # label(axiom). [clausify(3)]. 4.01/4.25 22 -strictly_less_than(A,B) | update_slb(insert_slb(C,pair(D,A)),B) = insert_slb(update_slb(C,B),pair(D,B)) # label(ax29) # label(axiom). [clausify(9)]. 4.01/4.25 25 less_than(c4,c3) # label(l37_co) # label(negated_conjecture). [clausify(18)]. 4.01/4.25 27 less_than(A,B) | less_than(B,A) # label(totality) # label(axiom). [clausify(5)]. 4.01/4.25 29 pair_in_list(insert_slb(c1,pair(c5,c6)),c2,c3) # label(l37_co) # label(negated_conjecture). [clausify(18)]. 4.01/4.25 31 lookup_slb(insert_slb(A,pair(B,C)),B) = C # label(ax26) # label(axiom). [clausify(14)]. 4.01/4.25 35 -pair_in_list(update_slb(insert_slb(c1,pair(c5,c6)),c4),c2,c3) # label(l37_co) # label(negated_conjecture). [clausify(18)]. 4.01/4.25 39 -pair_in_list(A,B,C) | pair_in_list(insert_slb(A,pair(D,E)),B,C) # label(ax23) # label(axiom). [clausify(8)]. 4.01/4.25 41 -pair_in_list(c1,A,B) | -less_than(C,B) | pair_in_list(update_slb(c1,C),A,B) # label(l37_co) # label(negated_conjecture). [clausify(18)]. 4.01/4.25 42 A != B | C != D | pair_in_list(insert_slb(E,pair(D,B)),C,A) # label(ax23) # label(axiom). [clausify(8)]. 4.01/4.25 43 pair_in_list(A,B,C) | C = D | -pair_in_list(insert_slb(A,pair(E,D)),B,C) # label(ax23) # label(axiom). [clausify(8)]. 4.01/4.25 44 pair_in_list(A,B,C) | B = D | -pair_in_list(insert_slb(A,pair(D,E)),B,C) # label(ax23) # label(axiom). [clausify(8)]. 4.01/4.25 46 -less_than(A,B) | update_slb(insert_slb(C,pair(D,B)),A) = insert_slb(update_slb(C,A),pair(D,B)) # label(ax30) # label(axiom). [clausify(7)]. 4.01/4.25 48 update_slb(insert_slb(A,pair(B,C)),D) = insert_slb(update_slb(A,D),pair(B,D)) | less_than(D,C) | -less_than(C,D). [resolve(22,a,19,a)]. 4.01/4.25 56 A != B | pair_in_list(insert_slb(C,pair(B,D)),A,D). [resolve(42,a,31,a),rewrite([31(6)])]. 4.01/4.25 58 pair_in_list(c1,c2,c3) | c6 = c3. [resolve(43,c,29,a),flip(b)]. 4.01/4.25 59 pair_in_list(c1,c2,c3) | c5 = c2. [resolve(44,c,29,a),flip(b)]. 4.01/4.25 61 update_slb(insert_slb(A,pair(B,c3)),c4) = insert_slb(update_slb(A,c4),pair(B,c3)). [resolve(46,a,25,a)]. 4.01/4.25 64 update_slb(insert_slb(A,pair(B,C)),D) = insert_slb(update_slb(A,D),pair(B,D)) | less_than(D,C). [resolve(48,c,27,b),merge(c)]. 4.01/4.25 77 c6 = c3 | -less_than(A,c3) | pair_in_list(update_slb(c1,A),c2,c3). [resolve(58,a,41,a)]. 4.01/4.25 79 c5 = c2 | -less_than(A,c3) | pair_in_list(update_slb(c1,A),c2,c3). [resolve(59,a,41,a)]. 4.01/4.25 94 pair_in_list(insert_slb(A,pair(B,C)),B,C). [resolve(56,a,31,a),rewrite([31(5)])]. 4.01/4.25 109 c6 = c3 | pair_in_list(update_slb(c1,c4),c2,c3). [resolve(77,b,25,a)]. 4.01/4.25 112 c6 = c3 | pair_in_list(insert_slb(update_slb(c1,c4),pair(A,B)),c2,c3). [resolve(109,b,39,a)]. 4.01/4.25 120 c5 = c2 | pair_in_list(update_slb(c1,c4),c2,c3). [resolve(79,b,25,a)]. 4.01/4.25 123 c5 = c2 | pair_in_list(insert_slb(update_slb(c1,c4),pair(A,B)),c2,c3). [resolve(120,b,39,a)]. 4.01/4.25 159 update_slb(insert_slb(A,pair(B,C)),D) = insert_slb(update_slb(A,D),pair(B,D)) | update_slb(insert_slb(E,pair(F,C)),D) = insert_slb(update_slb(E,D),pair(F,C)). [resolve(64,b,46,a)]. 4.01/4.25 732 update_slb(insert_slb(A,pair(B,c6)),c4) = insert_slb(update_slb(A,c4),pair(B,c6)) | -pair_in_list(insert_slb(update_slb(c1,c4),pair(c5,c4)),c2,c3). [para(159(a,1),35(a,1))]. 4.01/4.25 3518 update_slb(insert_slb(A,pair(B,c6)),c4) = insert_slb(update_slb(A,c4),pair(B,c6)) | c5 = c2. [resolve(732,b,123,b)]. 4.01/4.25 3519 update_slb(insert_slb(A,pair(B,c6)),c4) = insert_slb(update_slb(A,c4),pair(B,c6)) | c6 = c3. [resolve(732,b,112,b)]. 4.01/4.25 3566 c5 = c2 | -pair_in_list(insert_slb(update_slb(c1,c4),pair(c5,c6)),c2,c3). [para(3518(a,1),35(a,1))]. 4.01/4.25 3611 c5 = c2. [resolve(3566,b,123,b),merge(b)]. 4.01/4.25 3622 -pair_in_list(update_slb(insert_slb(c1,pair(c2,c6)),c4),c2,c3). [back_rewrite(35),rewrite([3611(2)])]. 4.01/4.25 3676 c6 = c3 | -pair_in_list(insert_slb(update_slb(c1,c4),pair(c2,c6)),c2,c3). [para(3519(a,1),3622(a,1))]. 4.01/4.25 3698 c6 = c3. [resolve(3676,b,112,b),merge(b)]. 4.01/4.25 3699 $F. [back_rewrite(3622),rewrite([3698(3),61(7)]),unit_del(a,94)]. 4.01/4.25 4.01/4.25 % SZS output end Refutation 4.01/4.25 ============================== end of proof ========================== 4.01/4.25 4.01/4.25 ============================== STATISTICS ============================ 4.01/4.25 4.01/4.25 Given=412. Generated=33304. Kept=3676. proofs=1. 4.01/4.25 Usable=229. Sos=1581. Demods=8. Limbo=1, Disabled=1895. Hints=0. 4.01/4.25 Megabytes=5.76. 4.01/4.25 User_CPU=3.79, System_CPU=0.02, Wall_clock=4. 4.01/4.26 4.01/4.26 ============================== end of statistics ===================== 4.01/4.26 4.01/4.26 ============================== end of search ========================= 4.01/4.26 4.01/4.26 THEOREM PROVED 4.01/4.26 % SZS status Theorem 4.01/4.26 4.01/4.26 Exiting with 1 proof. 4.01/4.26 4.01/4.26 Process 62817 exit (max_proofs) Sat Jul 14 05:39:14 2018 4.01/4.26 Prover9 interrupted 4.01/4.27 EOF