0.05/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n029.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	% DateTime   : Wed Jul  1 17:27:45 EDT 2020
0.12/0.33	% CPUTime    : 
0.46/1.01	============================== Prover9 ===============================
0.46/1.01	Prover9 (32) version 2009-11A, November 2009.
0.46/1.01	Process 32081 was started by sandbox on n029.cluster.edu,
0.46/1.01	Wed Jul  1 17:27:46 2020
0.46/1.01	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_31779_n029.cluster.edu".
0.46/1.01	============================== end of head ===========================
0.46/1.01	
0.46/1.01	============================== INPUT =================================
0.46/1.01	
0.46/1.01	% Reading from file /tmp/Prover9_31779_n029.cluster.edu
0.46/1.01	
0.46/1.01	set(prolog_style_variables).
0.46/1.01	set(auto2).
0.46/1.01	    % set(auto2) -> set(auto).
0.46/1.01	    % set(auto) -> set(auto_inference).
0.46/1.01	    % set(auto) -> set(auto_setup).
0.46/1.01	    % set(auto_setup) -> set(predicate_elim).
0.46/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.46/1.01	    % set(auto) -> set(auto_limits).
0.46/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.46/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.46/1.01	    % set(auto) -> set(auto_denials).
0.46/1.01	    % set(auto) -> set(auto_process).
0.46/1.01	    % set(auto2) -> assign(new_constants, 1).
0.46/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.46/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.46/1.01	    % set(auto2) -> assign(max_hours, 1).
0.46/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.46/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.46/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.46/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.46/1.01	    % set(auto2) -> set(sort_initial_sos).
0.46/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.46/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.46/1.01	    % set(auto2) -> assign(max_megs, 400).
0.46/1.01	    % set(auto2) -> assign(stats, some).
0.46/1.01	    % set(auto2) -> clear(echo_input).
0.46/1.01	    % set(auto2) -> set(quiet).
0.46/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.46/1.01	    % set(auto2) -> clear(print_given).
0.46/1.01	assign(lrs_ticks,-1).
0.46/1.01	assign(sos_limit,10000).
0.46/1.01	assign(order,kbo).
0.46/1.01	set(lex_order_vars).
0.46/1.01	clear(print_given).
0.46/1.01	
0.46/1.01	% formulas(sos).  % not echoed (8 formulas)
0.46/1.01	
0.46/1.01	============================== end of input ==========================
0.46/1.01	
0.46/1.01	% From the command line: assign(max_seconds, 960).
0.46/1.01	
0.46/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.46/1.01	
0.46/1.01	% Formulas that are not ordinary clauses:
0.46/1.01	1 (all A all B (A = B -> reflexive_rewrite(A,B))) # label(equal_in_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	2 (all A all B all C (rewrite(A,B) & rewrite(A,C) -> (exists D (rewrite(C,D) & rewrite(B,D))))) # label(rewrite_diamond) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	3 (all A (reflexive_rewrite(c,A) & reflexive_rewrite(b,A) -> goal)) # label(goal_ax) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	4 (all A all B (rewrite(A,B) -> reflexive_rewrite(A,B))) # label(rewrite_in_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	5 (all A all B (reflexive_rewrite(A,B) -> rewrite(A,B) | B = A)) # label(equal_or_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	
0.46/1.01	============================== end of process non-clausal formulas ===
0.46/1.01	
0.46/1.01	============================== PROCESS INITIAL CLAUSES ===============
0.46/1.01	
0.46/1.01	============================== PREDICATE ELIMINATION =================
0.46/1.01	
0.46/1.01	============================== end predicate elimination =============
0.46/1.01	
0.46/1.01	Auto_denials:  (non-Horn, no changes).
0.46/1.01	
0.46/1.01	Term ordering decisions:
0.46/1.01	Function symbol KB weights:  a=1. b=1. c=1. f1=1.
0.46/1.01	
0.46/1.01	============================== end of process initial clauses ========
0.46/1.01	
0.46/1.01	============================== CLAUSES FOR SEARCH ====================
0.46/1.01	
0.46/1.01	============================== end of clauses for search =============
0.46/1.01	
0.46/1.01	============================== SEARCH ================================
0.46/1.01	
0.46/1.01	% Starting search at 0.01 seconds.
0.46/1.01	
0.46/1.01	============================== PROOF =================================
0.46/1.01	% SZS status Theorem
0.46/1.01	% SZS output start Refutation
0.46/1.01	
0.46/1.01	% Proof 1 at 0.01 (+ 0.00) seconds.
0.46/1.01	% Length of proof is 30.
0.46/1.01	% Level of proof is 9.
0.46/1.01	% Maximum clause weight is 12.000.
0.46/1.01	% Given clauses 43.
0.46/1.01	
0.46/1.01	1 (all A all B (A = B -> reflexive_rewrite(A,B))) # label(equal_in_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	2 (all A all B all C (rewrite(A,B) & rewrite(A,C) -> (exists D (rewrite(C,D) & rewrite(B,D))))) # label(rewrite_diamond) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	3 (all A (reflexive_rewrite(c,A) & reflexive_rewrite(b,A) -> goal)) # label(goal_ax) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	4 (all A all B (rewrite(A,B) -> reflexive_rewrite(A,B))) # label(rewrite_in_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	5 (all A all B (reflexive_rewrite(A,B) -> rewrite(A,B) | B = A)) # label(equal_or_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.01	6 reflexive_rewrite(a,b) # label(assumption_AndLHS) # label(axiom).  [assumption].
0.46/1.01	7 reflexive_rewrite(a,c) # label(assumption_AndRHS) # label(axiom).  [assumption].
0.46/1.01	8 -goal # label(goal_to_be_proved) # label(negated_conjecture).  [assumption].
0.46/1.01	9 A != B | reflexive_rewrite(B,A) # label(equal_in_reflexive_rewrite) # label(axiom).  [clausify(1)].
0.46/1.01	10 -rewrite(A,B) | reflexive_rewrite(A,B) # label(rewrite_in_reflexive_rewrite) # label(axiom).  [clausify(4)].
0.46/1.01	11 -reflexive_rewrite(c,A) | -reflexive_rewrite(b,A) | goal # label(goal_ax) # label(axiom).  [clausify(3)].
0.46/1.01	12 -reflexive_rewrite(c,A) | -reflexive_rewrite(b,A).  [copy(11),unit_del(c,8)].
0.46/1.01	13 -reflexive_rewrite(A,B) | rewrite(A,B) | B = A # label(equal_or_rewrite) # label(axiom).  [clausify(5)].
0.46/1.01	14 -rewrite(A,B) | -rewrite(A,C) | rewrite(C,f1(A,B,C)) # label(rewrite_diamond) # label(axiom).  [clausify(2)].
0.46/1.01	15 -rewrite(A,B) | -rewrite(A,C) | rewrite(B,f1(A,B,C)) # label(rewrite_diamond) # label(axiom).  [clausify(2)].
0.46/1.01	17 reflexive_rewrite(A,A).  [xx_res(9,a)].
0.46/1.01	18 rewrite(a,c) | c = a.  [resolve(13,a,7,a)].
0.46/1.01	19 rewrite(a,b) | b = a.  [resolve(13,a,6,a)].
0.46/1.01	20 -reflexive_rewrite(b,c).  [resolve(17,a,12,a)].
0.46/1.01	21 -reflexive_rewrite(c,b).  [ur(12,b,17,a)].
0.46/1.01	27 c = a | -rewrite(a,A) | rewrite(c,f1(a,c,A)).  [resolve(18,a,15,a)].
0.46/1.01	29 c = a | -rewrite(a,A) | rewrite(A,f1(a,c,A)).  [resolve(18,a,14,a)].
0.46/1.01	49 c = a | rewrite(c,f1(a,c,b)) | b = a.  [resolve(27,b,19,a)].
0.46/1.01	51 c = a | rewrite(b,f1(a,c,b)) | b = a.  [resolve(29,b,19,a)].
0.46/1.01	63 c = a | b = a | reflexive_rewrite(c,f1(a,c,b)).  [resolve(49,b,10,a)].
0.46/1.01	81 c = a | b = a | reflexive_rewrite(b,f1(a,c,b)).  [resolve(51,b,10,a)].
0.46/1.01	82 c = a | b = a | -reflexive_rewrite(b,f1(a,c,b)).  [resolve(63,c,12,a)].
0.46/1.01	86 c = a | b = a.  [resolve(82,c,81,c),merge(c),merge(d)].
0.46/1.01	90 b = a.  [para(86(a,1),21(a,1)),unit_del(b,6)].
0.46/1.01	96 $F.  [back_rewrite(20),rewrite([90(1)]),unit_del(a,7)].
0.46/1.01	
0.46/1.01	% SZS output end Refutation
0.46/1.01	============================== end of proof ==========================
0.46/1.01	
0.46/1.01	============================== STATISTICS ============================
0.46/1.01	
0.46/1.01	Given=43. Generated=140. Kept=89. proofs=1.
0.46/1.01	Usable=20. Sos=9. Demods=1. Limbo=6, Disabled=63. Hints=0.
0.46/1.01	Megabytes=0.10.
0.46/1.01	User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
0.46/1.01	
0.46/1.01	============================== end of statistics =====================
0.46/1.01	
0.46/1.01	============================== end of search =========================
0.46/1.01	
0.46/1.01	THEOREM PROVED
0.46/1.01	% SZS status Theorem
0.46/1.01	
0.46/1.01	Exiting with 1 proof.
0.46/1.01	
0.46/1.01	Process 32081 exit (max_proofs) Wed Jul  1 17:27:46 2020
0.46/1.01	Prover9 interrupted
0.46/1.02	EOF