0.02/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.32	% Computer   : n023.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 960
0.10/0.32	% DateTime   : Thu Jul  2 06:52:58 EDT 2020
0.10/0.32	% CPUTime    : 
0.39/1.00	============================== Prover9 ===============================
0.39/1.00	Prover9 (32) version 2009-11A, November 2009.
0.39/1.00	Process 14442 was started by sandbox2 on n023.cluster.edu,
0.39/1.00	Thu Jul  2 06:52:59 2020
0.39/1.00	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_14283_n023.cluster.edu".
0.39/1.00	============================== end of head ===========================
0.39/1.00	
0.39/1.00	============================== INPUT =================================
0.39/1.00	
0.39/1.00	% Reading from file /tmp/Prover9_14283_n023.cluster.edu
0.39/1.00	
0.39/1.00	set(prolog_style_variables).
0.39/1.00	set(auto2).
0.39/1.00	    % set(auto2) -> set(auto).
0.39/1.00	    % set(auto) -> set(auto_inference).
0.39/1.00	    % set(auto) -> set(auto_setup).
0.39/1.00	    % set(auto_setup) -> set(predicate_elim).
0.39/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.39/1.00	    % set(auto) -> set(auto_limits).
0.39/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.39/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.39/1.00	    % set(auto) -> set(auto_denials).
0.39/1.00	    % set(auto) -> set(auto_process).
0.39/1.00	    % set(auto2) -> assign(new_constants, 1).
0.39/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.39/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.39/1.00	    % set(auto2) -> assign(max_hours, 1).
0.39/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.39/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.39/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.39/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.39/1.00	    % set(auto2) -> set(sort_initial_sos).
0.39/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.39/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.39/1.00	    % set(auto2) -> assign(max_megs, 400).
0.39/1.00	    % set(auto2) -> assign(stats, some).
0.39/1.00	    % set(auto2) -> clear(echo_input).
0.39/1.00	    % set(auto2) -> set(quiet).
0.39/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.39/1.00	    % set(auto2) -> clear(print_given).
0.39/1.00	assign(lrs_ticks,-1).
0.39/1.00	assign(sos_limit,10000).
0.39/1.00	assign(order,kbo).
0.39/1.00	set(lex_order_vars).
0.39/1.00	clear(print_given).
0.39/1.00	
0.39/1.00	% formulas(sos).  % not echoed (42 formulas)
0.39/1.00	
0.39/1.00	============================== end of input ==========================
0.39/1.00	
0.39/1.00	% From the command line: assign(max_seconds, 960).
0.39/1.00	
0.39/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.39/1.00	
0.39/1.00	% Formulas that are not ordinary clauses:
0.39/1.00	1 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	2 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	3 (all U all V (-less_than(V,U) & less_than(U,V) <-> strictly_less_than(U,V))) # label(stricly_smaller_definition) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	4 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	5 (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.39/1.00	6 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	7 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	8 (all U all V all W all X all Y (pair_in_list(insert_slb(U,pair(V,X)),W,Y) <-> Y = X & W = V | pair_in_list(U,W,Y))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	9 (all U all V all W all X (V = W | contains_slb(U,W) <-> contains_slb(insert_slb(U,pair(V,X)),W))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	10 (all U all V all W lookup_slb(insert_slb(U,pair(V,W)),V) = W) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	11 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	12 (all U all V all W all X (strictly_less_than(X,W) -> insert_slb(update_slb(U,W),pair(V,W)) = update_slb(insert_slb(U,pair(V,X)),W))) # label(ax29) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	13 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.39/1.00	14 (all U all V all W all X (V != W & 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.39/1.01	15 (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.39/1.01	16 (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.39/1.01	17 (all U all V all W all X (V != W & contains_slb(U,W) -> lookup_slb(insert_slb(U,pair(V,X)),W) = lookup_slb(U,W))) # label(ax27) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	18 (all U all V check_cpq(triple(U,create_slb,V))) # label(ax36) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	19 (all U all V all W all X (contains_cpq(triple(U,V,W),X) <-> contains_slb(V,X))) # label(ax39) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	20 (all U all V (succ_cpq(U,V) -> succ_cpq(U,findmin_cpq_eff(V)))) # label(ax34) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	21 (all U all V all W (succ_cpq(U,V) -> succ_cpq(U,insert_cpq(V,W)))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	22 (all U findmin_cpq_res(U) = removemin_cpq_res(U)) # label(ax53) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	23 (all U all V all W all X (contains_slb(V,findmin_pqp_res(U)) & less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) & create_slb != V -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),W))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	24 (all U all V ($F <-> ok(triple(U,V,bad)))) # label(ax40) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	25 (all U all V all W all X (contains_slb(V,X) & less_than(lookup_slb(V,X),X) -> remove_cpq(triple(U,V,W),X) = triple(remove_pqp(U,X),remove_slb(V,X),W))) # label(ax44) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	26 (all U all V all W (succ_cpq(U,V) -> succ_cpq(U,remove_cpq(V,W)))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	27 (all U all V all W all X all Y (less_than(Y,X) -> (check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) <-> check_cpq(triple(U,V,W))))) # label(ax37) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	28 (all U all V all W (-ok(triple(U,V,W)) -> W = bad)) # label(ax41) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	29 (all U succ_cpq(U,U)) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	30 (all U all V all W all X (-contains_slb(V,X) -> triple(U,V,bad) = remove_cpq(triple(U,V,W),X))) # label(ax43) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	31 (all U all V all W all X triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W) = insert_cpq(triple(U,V,W),X)) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	32 (all U all V all W all X (create_slb != V & strictly_less_than(findmin_pqp_res(U),lookup_slb(V,findmin_pqp_res(U))) & contains_slb(V,findmin_pqp_res(U)) -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad))) # label(ax48) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	33 (all U all V bottom = findmin_cpq_res(triple(U,create_slb,V))) # label(ax50) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	34 (all U all V triple(U,create_slb,bad) = findmin_cpq_eff(triple(U,create_slb,V))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	35 (all U all V all W all X all Y (strictly_less_than(X,Y) -> (check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) <-> $F))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	36 (all U all V (succ_cpq(U,V) -> succ_cpq(U,removemin_cpq_eff(V)))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	37 (all U removemin_cpq_eff(U) = remove_cpq(findmin_cpq_eff(U),findmin_cpq_res(U))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	38 (all U all V all W all X (V != create_slb -> findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	39 (all U all V all W all X (-contains_slb(V,findmin_pqp_res(U)) & V != create_slb -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad))) # label(ax47) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	40 (all U all V all W all X (contains_slb(V,X) & strictly_less_than(X,lookup_slb(V,X)) -> remove_cpq(triple(U,V,W),X) = triple(remove_pqp(U,X),remove_slb(V,X),bad))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	41 -(all U all V all W all X (-ok(triple(U,V,W)) -> -ok(insert_cpq(triple(U,V,W),X)))) # label(l13_co) # label(negated_conjecture) # label(non_clause).  [assumption].
0.39/1.01	
0.39/1.01	============================== end of process non-clausal formulas ===
0.39/1.01	
0.39/1.01	============================== PROCESS INITIAL CLAUSES ===============
0.39/1.01	
0.39/1.01	============================== PREDICATE ELIMINATION =================
0.39/1.01	
0.39/1.01	============================== end predicate elimination =============
0.39/1.01	
0.39/1.01	Auto_denials:  (non-Horn, no changes).
0.39/1.01	
0.39/1.01	Term ordering decisions:
0.39/1.01	Function symbol KB weights:  create_slb=1. bad=1. bottom=1. c1=1. c2=1. c3=1. c4=1. insert_slb=1. pair=1. update_slb=1. lookup_slb=1. remove_cpq=1. remove_slb=1. insert_cpq=1. remove_pqp=1. insert_pqp=1. findmin_pqp_res=1. findmin_cpq_eff=1. findmin_cpq_res=1. removemin_cpq_eff=1. removemin_cpq_res=1. triple=1.
0.39/1.01	
0.39/1.01	============================== end of process initial clauses ========
0.39/1.01	
0.39/1.01	============================== CLAUSES FOR SEARCH ====================
0.39/1.01	
0.39/1.01	============================== end of clauses for search =============
0.39/1.01	
0.39/1.01	============================== SEARCH ================================
0.39/1.01	
0.39/1.01	% Starting search at 0.01 seconds.
0.39/1.01	
0.39/1.01	============================== PROOF =================================
0.39/1.01	% SZS status Theorem
0.39/1.01	% SZS output start Refutation
0.39/1.01	
0.39/1.01	% Proof 1 at 0.01 (+ 0.00) seconds.
0.39/1.01	% Length of proof is 13.
0.39/1.01	% Level of proof is 4.
0.39/1.01	% Maximum clause weight is 17.000.
0.39/1.01	% Given clauses 24.
0.39/1.01	
0.39/1.01	24 (all U all V ($F <-> ok(triple(U,V,bad)))) # label(ax40) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	28 (all U all V all W (-ok(triple(U,V,W)) -> W = bad)) # label(ax41) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	31 (all U all V all W all X triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W) = insert_cpq(triple(U,V,W),X)) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.39/1.01	41 -(all U all V all W all X (-ok(triple(U,V,W)) -> -ok(insert_cpq(triple(U,V,W),X)))) # label(l13_co) # label(negated_conjecture) # label(non_clause).  [assumption].
0.39/1.01	51 ok(insert_cpq(triple(c1,c2,c3),c4)) # label(l13_co) # label(negated_conjecture).  [clausify(41)].
0.39/1.01	52 ok(triple(A,B,C)) | bad = C # label(ax41) # label(axiom).  [clausify(28)].
0.39/1.01	60 insert_cpq(triple(A,B,C),D) = triple(insert_pqp(A,D),insert_slb(B,pair(D,bottom)),C) # label(ax42) # label(axiom).  [clausify(31)].
0.39/1.01	61 triple(insert_pqp(A,B),insert_slb(C,pair(B,bottom)),D) = insert_cpq(triple(A,C,D),B).  [copy(60),flip(a)].
0.39/1.01	66 -ok(triple(A,B,bad)) # label(ax40) # label(axiom).  [clausify(24)].
0.39/1.01	67 -ok(triple(c1,c2,c3)) # label(l13_co) # label(negated_conjecture).  [clausify(41)].
0.39/1.01	104 -ok(insert_cpq(triple(A,B,bad),C)).  [para(61(a,1),66(a,1))].
0.39/1.01	105 c3 = bad.  [resolve(67,a,52,a),flip(a)].
0.39/1.01	106 $F.  [back_rewrite(51),rewrite([105(3)]),unit_del(a,104)].
0.39/1.01	
0.39/1.01	% SZS output end Refutation
0.39/1.01	============================== end of proof ==========================
0.39/1.01	
0.39/1.01	============================== STATISTICS ============================
0.39/1.01	
0.39/1.01	Given=24. Generated=81. Kept=59. proofs=1.
0.39/1.01	Usable=22. Sos=34. Demods=10. Limbo=1, Disabled=54. Hints=0.
0.39/1.01	Megabytes=0.19.
0.39/1.01	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.39/1.01	
0.39/1.01	============================== end of statistics =====================
0.39/1.01	
0.39/1.01	============================== end of search =========================
0.39/1.01	
0.39/1.01	THEOREM PROVED
0.39/1.01	% SZS status Theorem
0.39/1.01	
0.39/1.01	Exiting with 1 proof.
0.39/1.01	
0.39/1.01	Process 14442 exit (max_proofs) Thu Jul  2 06:52:59 2020
0.39/1.01	Prover9 interrupted
0.39/1.01	EOF