0.11/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n012.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	% WCLimit  : 120
0.12/0.33	% DateTime : Tue Aug  9 02:52:29 EDT 2022
0.12/0.33	% CPUTime  : 
0.41/0.98	============================== Prover9 ===============================
0.41/0.98	Prover9 (32) version 2009-11A, November 2009.
0.41/0.98	Process 17172 was started by sandbox2 on n012.cluster.edu,
0.41/0.98	Tue Aug  9 02:52:30 2022
0.41/0.98	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_17015_n012.cluster.edu".
0.41/0.98	============================== end of head ===========================
0.41/0.98	
0.41/0.98	============================== INPUT =================================
0.41/0.98	
0.41/0.98	% Reading from file /tmp/Prover9_17015_n012.cluster.edu
0.41/0.98	
0.41/0.98	set(prolog_style_variables).
0.41/0.98	set(auto2).
0.41/0.98	    % set(auto2) -> set(auto).
0.41/0.98	    % set(auto) -> set(auto_inference).
0.41/0.98	    % set(auto) -> set(auto_setup).
0.41/0.98	    % set(auto_setup) -> set(predicate_elim).
0.41/0.98	    % set(auto_setup) -> assign(eq_defs, unfold).
0.41/0.98	    % set(auto) -> set(auto_limits).
0.41/0.98	    % set(auto_limits) -> assign(max_weight, "100.000").
0.41/0.98	    % set(auto_limits) -> assign(sos_limit, 20000).
0.41/0.98	    % set(auto) -> set(auto_denials).
0.41/0.98	    % set(auto) -> set(auto_process).
0.41/0.98	    % set(auto2) -> assign(new_constants, 1).
0.41/0.98	    % set(auto2) -> assign(fold_denial_max, 3).
0.41/0.98	    % set(auto2) -> assign(max_weight, "200.000").
0.41/0.98	    % set(auto2) -> assign(max_hours, 1).
0.41/0.98	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.41/0.98	    % set(auto2) -> assign(max_seconds, 0).
0.41/0.98	    % set(auto2) -> assign(max_minutes, 5).
0.41/0.98	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.41/0.98	    % set(auto2) -> set(sort_initial_sos).
0.41/0.98	    % set(auto2) -> assign(sos_limit, -1).
0.41/0.98	    % set(auto2) -> assign(lrs_ticks, 3000).
0.41/0.98	    % set(auto2) -> assign(max_megs, 400).
0.41/0.98	    % set(auto2) -> assign(stats, some).
0.41/0.98	    % set(auto2) -> clear(echo_input).
0.41/0.98	    % set(auto2) -> set(quiet).
0.41/0.98	    % set(auto2) -> clear(print_initial_clauses).
0.41/0.98	    % set(auto2) -> clear(print_given).
0.41/0.98	assign(lrs_ticks,-1).
0.41/0.98	assign(sos_limit,10000).
0.41/0.98	assign(order,kbo).
0.41/0.98	set(lex_order_vars).
0.41/0.98	clear(print_given).
0.41/0.98	
0.41/0.98	% formulas(sos).  % not echoed (19 formulas)
0.41/0.98	
0.41/0.98	============================== end of input ==========================
0.41/0.98	
0.41/0.98	% From the command line: assign(max_seconds, 960).
0.41/0.98	
0.41/0.98	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.41/0.98	
0.41/0.98	% Formulas that are not ordinary clauses:
0.41/0.98	1 (all U all V (less_than(V,U) | less_than(U,V))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	2 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	3 (all U all V all W (less_than(V,W) & less_than(U,V) -> less_than(U,W))) # label(transitivity) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	4 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	5 (all U all V (strictly_less_than(U,V) <-> less_than(U,V) & -less_than(V,U))) # label(stricly_smaller_definition) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	6 (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.41/0.98	7 (all U all V all W all X (contains_slb(U,W) & V != W -> insert_slb(remove_slb(U,W),pair(V,X)) = remove_slb(insert_slb(U,pair(V,X)),W))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	8 (all U create_slb = update_slb(create_slb,U)) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	9 (all U all V all W all X (contains_slb(insert_slb(U,pair(V,X)),W) <-> contains_slb(U,W) | W = V)) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	10 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	11 (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].
0.41/0.98	12 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	13 (all U all V all W all X all Y (W = V & Y = X | pair_in_list(U,W,Y) <-> pair_in_list(insert_slb(U,pair(V,X)),W,Y))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.41/0.98	14 (all U all V all W U = remove_slb(insert_slb(U,pair(V,W)),V)) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	15 (all U all V all W all X (less_than(W,X) -> insert_slb(update_slb(U,W),pair(V,X)) = update_slb(insert_slb(U,pair(V,X)),W))) # label(ax30) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	16 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	17 (all U all V all W W = lookup_slb(insert_slb(U,pair(V,W)),V)) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	18 -(all U ((all V all W all X (less_than(X,W) & pair_in_list(U,V,W) -> pair_in_list(update_slb(U,X),V,W))) -> (all Y all Z all X1 all X2 all X3 (pair_in_list(insert_slb(U,pair(X2,X3)),Y,Z) & less_than(X1,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].
3.12/3.39	
3.12/3.39	============================== end of process non-clausal formulas ===
3.12/3.39	
3.12/3.39	============================== PROCESS INITIAL CLAUSES ===============
3.12/3.39	
3.12/3.39	============================== PREDICATE ELIMINATION =================
3.12/3.39	19 strictly_less_than(A,B) | -less_than(A,B) | less_than(B,A) # label(stricly_smaller_definition) # label(axiom).  [clausify(5)].
3.12/3.39	20 -strictly_less_than(A,B) | -less_than(B,A) # label(stricly_smaller_definition) # label(axiom).  [clausify(5)].
3.12/3.39	21 -strictly_less_than(A,B) | less_than(A,B) # label(stricly_smaller_definition) # label(axiom).  [clausify(5)].
3.12/3.39	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(6)].
3.12/3.39	Derived: update_slb(insert_slb(A,pair(B,C)),D) = insert_slb(update_slb(A,D),pair(B,D)) | -less_than(C,D) | less_than(D,C).  [resolve(22,a,19,a)].
3.12/3.39	
3.12/3.39	============================== end predicate elimination =============
3.12/3.39	
3.12/3.39	Auto_denials:  (non-Horn, no changes).
3.12/3.39	
3.12/3.39	Term ordering decisions:
3.12/3.39	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.
3.12/3.39	
3.12/3.39	============================== end of process initial clauses ========
3.12/3.39	
3.12/3.39	============================== CLAUSES FOR SEARCH ====================
3.12/3.39	
3.12/3.39	============================== end of clauses for search =============
3.12/3.39	
3.12/3.39	============================== SEARCH ================================
3.12/3.39	
3.12/3.39	% Starting search at 0.01 seconds.
3.12/3.39	
3.12/3.39	============================== PROOF =================================
3.12/3.39	% SZS status Theorem
3.12/3.39	% SZS output start Refutation
3.12/3.39	
3.12/3.39	% Proof 1 at 2.41 (+ 0.02) seconds.
3.12/3.39	% Length of proof is 40.
3.12/3.39	% Level of proof is 11.
3.12/3.39	% Maximum clause weight is 30.000.
3.12/3.39	% Given clauses 409.
3.12/3.39	
3.12/3.39	1 (all U all V (less_than(V,U) | less_than(U,V))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	5 (all U all V (strictly_less_than(U,V) <-> less_than(U,V) & -less_than(V,U))) # label(stricly_smaller_definition) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	6 (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].
3.12/3.39	13 (all U all V all W all X all Y (W = V & Y = X | pair_in_list(U,W,Y) <-> pair_in_list(insert_slb(U,pair(V,X)),W,Y))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	15 (all U all V all W all X (less_than(W,X) -> insert_slb(update_slb(U,W),pair(V,X)) = update_slb(insert_slb(U,pair(V,X)),W))) # label(ax30) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	17 (all U all V all W W = lookup_slb(insert_slb(U,pair(V,W)),V)) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
3.12/3.39	18 -(all U ((all V all W all X (less_than(X,W) & pair_in_list(U,V,W) -> pair_in_list(update_slb(U,X),V,W))) -> (all Y all Z all X1 all X2 all X3 (pair_in_list(insert_slb(U,pair(X2,X3)),Y,Z) & less_than(X1,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].
3.12/3.39	19 strictly_less_than(A,B) | -less_than(A,B) | less_than(B,A) # label(stricly_smaller_definition) # label(axiom).  [clausify(5)].
3.12/3.39	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(6)].
3.12/3.39	25 less_than(c4,c3) # label(l37_co) # label(negated_conjecture).  [clausify(18)].
3.12/3.39	27 less_than(A,B) | less_than(B,A) # label(totality) # label(axiom).  [clausify(1)].
3.12/3.39	29 pair_in_list(insert_slb(c1,pair(c5,c6)),c2,c3) # label(l37_co) # label(negated_conjecture).  [clausify(18)].
3.12/3.39	31 lookup_slb(insert_slb(A,pair(B,C)),B) = C # label(ax26) # label(axiom).  [clausify(17)].
3.12/3.39	35 -pair_in_list(update_slb(insert_slb(c1,pair(c5,c6)),c4),c2,c3) # label(l37_co) # label(negated_conjecture).  [clausify(18)].
3.12/3.39	39 -pair_in_list(A,B,C) | pair_in_list(insert_slb(A,pair(D,E)),B,C) # label(ax23) # label(axiom).  [clausify(13)].
3.12/3.39	41 -less_than(A,B) | -pair_in_list(c1,C,B) | pair_in_list(update_slb(c1,A),C,B) # label(l37_co) # label(negated_conjecture).  [clausify(18)].
3.12/3.39	42 A != B | C != D | pair_in_list(insert_slb(E,pair(B,D)),A,C) # label(ax23) # label(axiom).  [clausify(13)].
3.12/3.39	43 A = B | pair_in_list(C,A,D) | -pair_in_list(insert_slb(C,pair(B,E)),A,D) # label(ax23) # label(axiom).  [clausify(13)].
3.12/3.39	44 A = B | pair_in_list(C,D,A) | -pair_in_list(insert_slb(C,pair(E,B)),D,A) # label(ax23) # label(axiom).  [clausify(13)].
3.12/3.39	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(15)].
3.12/3.39	48 update_slb(insert_slb(A,pair(B,C)),D) = insert_slb(update_slb(A,D),pair(B,D)) | -less_than(C,D) | less_than(D,C).  [resolve(22,a,19,a)].
3.12/3.39	57 A != B | pair_in_list(insert_slb(C,pair(B,D)),A,D).  [resolve(42,b,31,a),rewrite([31(6)])].
3.12/3.39	58 c5 = c2 | pair_in_list(c1,c2,c3).  [resolve(43,c,29,a),flip(a)].
3.12/3.39	59 c6 = c3 | pair_in_list(c1,c2,c3).  [resolve(44,c,29,a),flip(a)].
3.12/3.39	61 update_slb(insert_slb(A,pair(B,c3)),c4) = insert_slb(update_slb(A,c4),pair(B,c3)).  [resolve(46,a,25,a)].
3.12/3.39	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,b,27,b),merge(c)].
3.12/3.39	77 c5 = c2 | -less_than(A,c3) | pair_in_list(update_slb(c1,A),c2,c3).  [resolve(58,b,41,b)].
3.12/3.39	79 c6 = c3 | -less_than(A,c3) | pair_in_list(update_slb(c1,A),c2,c3).  [resolve(59,b,41,b)].
3.12/3.39	109 c5 = c2 | pair_in_list(update_slb(c1,c4),c2,c3).  [resolve(77,b,25,a)].
3.12/3.39	112 c5 = c2 | pair_in_list(insert_slb(update_slb(c1,c4),pair(A,B)),c2,c3).  [resolve(109,b,39,a)].
3.12/3.39	120 c6 = c3 | pair_in_list(update_slb(c1,c4),c2,c3).  [resolve(79,b,25,a)].
3.12/3.39	123 c6 = c3 | pair_in_list(insert_slb(update_slb(c1,c4),pair(A,B)),c2,c3).  [resolve(120,b,39,a)].
3.12/3.39	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)].
3.12/3.39	730 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))].
3.12/3.39	3518 update_slb(insert_slb(A,pair(B,c6)),c4) = insert_slb(update_slb(A,c4),pair(B,c6)) | c6 = c3.  [resolve(730,b,123,b)].
3.12/3.39	3566 c6 = c3 | -pair_in_list(insert_slb(update_slb(c1,c4),pair(c5,c6)),c2,c3).  [para(3518(a,1),35(a,1))].
3.12/3.39	3609 c6 = c3.  [resolve(3566,b,123,b),merge(b)].
3.12/3.39	4283 -pair_in_list(insert_slb(update_slb(c1,c4),pair(c5,c3)),c2,c3).  [back_rewrite(35),rewrite([3609(3),61(7)])].
3.12/3.39	4299 c5 = c2.  [resolve(4283,a,112,b)].
3.12/3.39	4300 $F.  [ur(57,b,4283,a),rewrite([4299(2)]),xx(a)].
3.12/3.39	
3.12/3.39	% SZS output end Refutation
3.12/3.39	============================== end of proof ==========================
3.12/3.39	
3.12/3.39	============================== STATISTICS ============================
3.12/3.39	
3.12/3.39	Given=409. Generated=34218. Kept=4277. proofs=1.
3.12/3.39	Usable=283. Sos=2344. Demods=8. Limbo=5, Disabled=1675. Hints=0.
3.12/3.39	Megabytes=6.18.
3.12/3.39	User_CPU=2.41, System_CPU=0.02, Wall_clock=2.
3.12/3.39	
3.12/3.39	============================== end of statistics =====================
3.12/3.39	
3.12/3.39	============================== end of search =========================
3.12/3.39	
3.12/3.39	THEOREM PROVED
3.12/3.39	% SZS status Theorem
3.12/3.39	
3.12/3.39	Exiting with 1 proof.
3.12/3.39	
3.12/3.39	Process 17172 exit (max_proofs) Tue Aug  9 02:52:32 2022
3.12/3.39	Prover9 interrupted
3.12/3.39	EOF