0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n022.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 180
0.13/0.34	% DateTime   : Thu Aug 29 12:20:28 EDT 2019
0.13/0.34	% CPUTime    : 
0.46/1.03	============================== Prover9 ===============================
0.46/1.03	Prover9 (32) version 2009-11A, November 2009.
0.46/1.03	Process 20863 was started by sandbox2 on n022.cluster.edu,
0.46/1.03	Thu Aug 29 12:20:29 2019
0.46/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_20710_n022.cluster.edu".
0.46/1.03	============================== end of head ===========================
0.46/1.03	
0.46/1.03	============================== INPUT =================================
0.46/1.03	
0.46/1.03	% Reading from file /tmp/Prover9_20710_n022.cluster.edu
0.46/1.03	
0.46/1.03	set(prolog_style_variables).
0.46/1.03	set(auto2).
0.46/1.03	    % set(auto2) -> set(auto).
0.46/1.03	    % set(auto) -> set(auto_inference).
0.46/1.03	    % set(auto) -> set(auto_setup).
0.46/1.03	    % set(auto_setup) -> set(predicate_elim).
0.46/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.46/1.03	    % set(auto) -> set(auto_limits).
0.46/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.46/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.46/1.03	    % set(auto) -> set(auto_denials).
0.46/1.03	    % set(auto) -> set(auto_process).
0.46/1.03	    % set(auto2) -> assign(new_constants, 1).
0.46/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.46/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.46/1.03	    % set(auto2) -> assign(max_hours, 1).
0.46/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.46/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.46/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.46/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.46/1.03	    % set(auto2) -> set(sort_initial_sos).
0.46/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.46/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.46/1.03	    % set(auto2) -> assign(max_megs, 400).
0.46/1.03	    % set(auto2) -> assign(stats, some).
0.46/1.03	    % set(auto2) -> clear(echo_input).
0.46/1.03	    % set(auto2) -> set(quiet).
0.46/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.46/1.03	    % set(auto2) -> clear(print_given).
0.46/1.03	assign(lrs_ticks,-1).
0.46/1.03	assign(sos_limit,10000).
0.46/1.03	assign(order,kbo).
0.46/1.03	set(lex_order_vars).
0.46/1.03	clear(print_given).
0.46/1.03	
0.46/1.03	% formulas(sos).  % not echoed (10 formulas)
0.46/1.03	
0.46/1.03	============================== end of input ==========================
0.46/1.03	
0.46/1.03	% From the command line: assign(max_seconds, 180).
0.46/1.03	
0.46/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.46/1.03	
0.46/1.03	% Formulas that are not ordinary clauses:
0.46/1.03	1 (all A all B (B = A -> transitive_reflexive_rewrite(A,B))) # label(equality_in_transitive_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.03	2 (all A (transitive_reflexive_rewrite(b,A) & transitive_reflexive_rewrite(c,A) -> goal)) # label(found) # label(axiom) # label(non_clause).  [assumption].
0.46/1.03	3 (all A all B all C (transitive_reflexive_rewrite(A,B) & transitive_reflexive_rewrite(B,C) -> transitive_reflexive_rewrite(A,C))) # label(transitivity_of_transitive_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.03	4 (all A all B (rewrite(A,B) -> transitive_reflexive_rewrite(A,B))) # label(rewrite_in_transitive_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.03	5 (all A all B all C (rewrite(a,A) & transitive_reflexive_rewrite(A,B) & transitive_reflexive_rewrite(A,C) -> (exists D (transitive_reflexive_rewrite(B,D) & transitive_reflexive_rewrite(C,D))))) # label(ih_cfl) # label(axiom) # label(non_clause).  [assumption].
0.46/1.03	6 (all A all B (transitive_reflexive_rewrite(A,B) -> (exists C (transitive_reflexive_rewrite(C,B) & rewrite(A,C))) | B = A)) # label(equal_or_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.46/1.03	7 (all A all B all C (rewrite(A,B) & rewrite(A,C) -> (exists D (transitive_reflexive_rewrite(C,D) & transitive_reflexive_rewrite(B,D))))) # label(lo_cfl) # label(axiom) # label(non_clause).  [assumption].
0.46/1.03	
0.46/1.03	============================== end of process non-clausal formulas ===
0.46/1.03	
0.46/1.03	============================== PROCESS INITIAL CLAUSES ===============
0.46/1.03	
0.46/1.03	============================== PREDICATE ELIMINATION =================
0.46/1.03	
0.46/1.03	============================== end predicate elimination =============
0.46/1.03	
0.46/1.03	Auto_denials:  (non-Horn, no changes).
0.46/1.03	
0.46/1.03	Term ordering decisions:
0.46/1.03	Function symbol KB weights:  a=1. b=1. c=1. f2=1. f1=1. f3=1.
0.46/1.03	
0.46/1.03	============================== end of process initial clauses ========
0.46/1.03	
0.46/1.03	============================== CLAUSES FOR SEARCH ====================
0.46/1.03	
0.46/1.03	============================== end of clauses for search =============
12.02/12.32	
12.02/12.32	============================== SEARCH ================================
12.02/12.32	
12.02/12.32	% Starting search at 0.01 seconds.
12.02/12.32	
12.02/12.32	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.29 sec).
12.02/12.32	
12.02/12.32	Low Water (keep): wt=67.000, iters=3503
12.02/12.32	
12.02/12.32	Low Water (keep): wt=63.000, iters=3498
12.02/12.32	
12.02/12.32	Low Water (keep): wt=48.000, iters=3380
12.02/12.32	
12.02/12.32	Low Water (keep): wt=43.000, iters=3340
12.02/12.32	
12.02/12.32	Low Water (keep): wt=42.000, iters=3415
12.02/12.32	
12.02/12.32	Low Water (keep): wt=41.000, iters=3463
12.02/12.32	
12.02/12.32	Low Water (keep): wt=39.000, iters=3340
12.02/12.32	
12.02/12.32	Low Water (keep): wt=38.000, iters=3351
12.02/12.32	
12.02/12.32	Low Water (keep): wt=37.000, iters=3400
12.02/12.32	
12.02/12.32	Low Water (keep): wt=36.000, iters=3342
12.02/12.32	
12.02/12.32	Low Water (keep): wt=35.000, iters=3566
12.02/12.32	
12.02/12.32	Low Water (keep): wt=34.000, iters=3487
12.02/12.32	
12.02/12.32	Low Water (keep): wt=33.000, iters=3348
12.02/12.32	
12.02/12.32	Low Water (keep): wt=32.000, iters=3333
12.02/12.32	
12.02/12.32	Low Water (keep): wt=31.000, iters=3350
12.02/12.32	
12.02/12.32	Low Water (keep): wt=30.000, iters=3370
12.02/12.32	
12.02/12.32	Low Water (keep): wt=29.000, iters=3335
12.02/12.32	
12.02/12.32	Low Water (displace): id=10751, wt=35.000
12.02/12.32	
12.02/12.32	Low Water (displace): id=10897, wt=34.000
12.02/12.32	
12.02/12.32	Low Water (displace): id=9274, wt=33.000
12.02/12.32	
12.02/12.32	Low Water (displace): id=11170, wt=32.000
12.02/12.32	
12.02/12.32	Low Water (displace): id=11427, wt=31.000
12.02/12.32	
12.02/12.32	Low Water (displace): id=11477, wt=30.000
12.02/12.32	
12.02/12.32	Low Water (keep): wt=27.000, iters=3333
12.02/12.32	
12.02/12.32	Low Water (displace): id=12862, wt=29.000
12.02/12.32	
12.02/12.32	Low Water (displace): id=14285, wt=28.000
12.02/12.32	
12.02/12.32	Low Water (displace): id=14982, wt=27.000
12.02/12.32	
12.02/12.32	============================== PROOF =================================
12.02/12.32	% SZS status Theorem
12.02/12.32	% SZS output start Refutation
12.02/12.32	
12.02/12.32	% Proof 1 at 11.24 (+ 0.06) seconds.
12.02/12.32	% Length of proof is 55.
12.02/12.32	% Level of proof is 13.
12.02/12.32	% Maximum clause weight is 32.000.
12.02/12.32	% Given clauses 4532.
12.02/12.32	
12.02/12.32	1 (all A all B (B = A -> transitive_reflexive_rewrite(A,B))) # label(equality_in_transitive_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
12.02/12.32	2 (all A (transitive_reflexive_rewrite(b,A) & transitive_reflexive_rewrite(c,A) -> goal)) # label(found) # label(axiom) # label(non_clause).  [assumption].
12.02/12.32	3 (all A all B all C (transitive_reflexive_rewrite(A,B) & transitive_reflexive_rewrite(B,C) -> transitive_reflexive_rewrite(A,C))) # label(transitivity_of_transitive_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
12.02/12.32	5 (all A all B all C (rewrite(a,A) & transitive_reflexive_rewrite(A,B) & transitive_reflexive_rewrite(A,C) -> (exists D (transitive_reflexive_rewrite(B,D) & transitive_reflexive_rewrite(C,D))))) # label(ih_cfl) # label(axiom) # label(non_clause).  [assumption].
12.02/12.32	6 (all A all B (transitive_reflexive_rewrite(A,B) -> (exists C (transitive_reflexive_rewrite(C,B) & rewrite(A,C))) | B = A)) # label(equal_or_rewrite) # label(axiom) # label(non_clause).  [assumption].
12.02/12.32	7 (all A all B all C (rewrite(A,B) & rewrite(A,C) -> (exists D (transitive_reflexive_rewrite(C,D) & transitive_reflexive_rewrite(B,D))))) # label(lo_cfl) # label(axiom) # label(non_clause).  [assumption].
12.02/12.32	8 transitive_reflexive_rewrite(a,c) # label(assumption_AndLHS) # label(axiom).  [assumption].
12.02/12.32	9 transitive_reflexive_rewrite(a,b) # label(assumption_AndRHS) # label(axiom).  [assumption].
12.02/12.32	10 -goal # label(goal_to_be_proved) # label(negated_conjecture).  [assumption].
12.02/12.32	11 A != B | transitive_reflexive_rewrite(B,A) # label(equality_in_transitive_reflexive_rewrite) # label(axiom).  [clausify(1)].
12.02/12.32	13 -transitive_reflexive_rewrite(b,A) | -transitive_reflexive_rewrite(c,A) | goal # label(found) # label(axiom).  [clausify(2)].
12.02/12.32	14 -transitive_reflexive_rewrite(b,A) | -transitive_reflexive_rewrite(c,A).  [copy(13),unit_del(c,10)].
12.02/12.32	15 -transitive_reflexive_rewrite(A,B) | -transitive_reflexive_rewrite(B,C) | transitive_reflexive_rewrite(A,C) # label(transitivity_of_transitive_reflexive_rewrite) # label(axiom).  [clausify(3)].
12.02/12.32	16 -transitive_reflexive_rewrite(A,B) | transitive_reflexive_rewrite(f2(A,B),B) | B = A # label(equal_or_rewrite) # label(axiom).  [clausify(6)].
12.02/12.32	17 -transitive_reflexive_rewrite(A,B) | rewrite(A,f2(A,B)) | B = A # label(equal_or_rewrite) # label(axiom).  [clausify(6)].
12.02/12.32	18 -rewrite(A,B) | -rewrite(A,C) | transitive_reflexive_rewrite(C,f3(A,B,C)) # label(lo_cfl) # label(axiom).  [clausify(7)].
12.02/12.32	19 -rewrite(A,B) | -rewrite(A,C) | transitive_reflexive_rewrite(B,f3(A,B,C)) # label(lo_cfl) # label(axiom).  [clausify(7)].
12.02/12.32	20 -rewrite(a,A) | -transitive_reflexive_rewrite(A,B) | -transitive_reflexive_rewrite(A,C) | transitive_reflexive_rewrite(B,f1(A,B,C)) # label(ih_cfl) # label(axiom).  [clausify(5)].
12.02/12.32	21 -rewrite(a,A) | -transitive_reflexive_rewrite(A,B) | -transitive_reflexive_rewrite(A,C) | transitive_reflexive_rewrite(C,f1(A,B,C)) # label(ih_cfl) # label(axiom).  [clausify(5)].
12.02/12.32	24 transitive_reflexive_rewrite(A,A).  [xx_res(11,a)].
12.02/12.32	29 transitive_reflexive_rewrite(f2(a,b),b) | b = a.  [resolve(16,a,9,a)].
12.02/12.32	30 transitive_reflexive_rewrite(f2(a,c),c) | c = a.  [resolve(16,a,8,a)].
12.02/12.32	31 rewrite(a,f2(a,b)) | b = a.  [resolve(17,a,9,a)].
12.02/12.32	32 rewrite(a,f2(a,c)) | c = a.  [resolve(17,a,8,a)].
12.02/12.32	33 -transitive_reflexive_rewrite(b,c).  [resolve(24,a,14,b)].
12.02/12.32	34 -transitive_reflexive_rewrite(c,b).  [ur(14,a,24,a)].
12.02/12.32	35 -transitive_reflexive_rewrite(b,a).  [ur(15,b,8,a,c,33,a)].
12.02/12.32	38 -transitive_reflexive_rewrite(c,a).  [ur(15,b,9,a,c,34,a)].
12.02/12.32	41 b != a.  [ur(11,b,35,a),flip(a)].
12.02/12.32	42 rewrite(a,f2(a,b)).  [back_unit_del(31),unit_del(b,41)].
12.02/12.32	43 transitive_reflexive_rewrite(f2(a,b),b).  [back_unit_del(29),unit_del(b,41)].
12.02/12.32	46 -transitive_reflexive_rewrite(f2(a,b),A) | -transitive_reflexive_rewrite(f2(a,b),B) | transitive_reflexive_rewrite(B,f1(f2(a,b),A,B)).  [resolve(42,a,21,a)].
12.02/12.32	47 -transitive_reflexive_rewrite(f2(a,b),A) | -transitive_reflexive_rewrite(f2(a,b),B) | transitive_reflexive_rewrite(A,f1(f2(a,b),A,B)).  [resolve(42,a,20,a)].
12.02/12.32	48 -rewrite(a,A) | transitive_reflexive_rewrite(A,f3(a,A,f2(a,b))).  [resolve(42,a,19,b)].
12.02/12.32	63 c != a.  [ur(11,b,38,a),flip(a)].
12.02/12.32	64 rewrite(a,f2(a,c)).  [back_unit_del(32),unit_del(b,63)].
12.02/12.32	65 transitive_reflexive_rewrite(f2(a,c),c).  [back_unit_del(30),unit_del(b,63)].
12.02/12.32	68 -transitive_reflexive_rewrite(f2(a,c),A) | -transitive_reflexive_rewrite(f2(a,c),B) | transitive_reflexive_rewrite(B,f1(f2(a,c),A,B)).  [resolve(64,a,21,a)].
12.02/12.32	69 -transitive_reflexive_rewrite(f2(a,c),A) | -transitive_reflexive_rewrite(f2(a,c),B) | transitive_reflexive_rewrite(A,f1(f2(a,c),A,B)).  [resolve(64,a,20,a)].
12.02/12.32	73 -rewrite(a,A) | transitive_reflexive_rewrite(A,f3(a,f2(a,c),A)).  [resolve(64,a,18,a)].
12.02/12.32	121 -transitive_reflexive_rewrite(f2(a,b),A) | transitive_reflexive_rewrite(A,f1(f2(a,b),b,A)).  [resolve(46,a,43,a)].
12.02/12.32	148 transitive_reflexive_rewrite(f2(a,c),f3(a,f2(a,c),f2(a,b))).  [resolve(48,a,64,a)].
12.02/12.32	153 -transitive_reflexive_rewrite(f2(a,b),A) | transitive_reflexive_rewrite(b,f1(f2(a,b),b,A)).  [resolve(47,a,43,a)].
12.02/12.32	162 transitive_reflexive_rewrite(f2(a,b),f3(a,f2(a,c),f2(a,b))).  [resolve(73,a,42,a)].
12.02/12.32	225 -transitive_reflexive_rewrite(f3(a,f2(a,c),f2(a,b)),A) | transitive_reflexive_rewrite(f2(a,c),A).  [resolve(148,a,15,a)].
12.02/12.32	300 -transitive_reflexive_rewrite(f2(a,c),A) | transitive_reflexive_rewrite(A,f1(f2(a,c),c,A)).  [resolve(68,a,65,a)].
12.02/12.32	339 -transitive_reflexive_rewrite(f2(a,c),A) | transitive_reflexive_rewrite(c,f1(f2(a,c),c,A)).  [resolve(69,a,65,a)].
12.02/12.32	381 transitive_reflexive_rewrite(f3(a,f2(a,c),f2(a,b)),f1(f2(a,b),b,f3(a,f2(a,c),f2(a,b)))).  [resolve(121,a,162,a)].
12.02/12.32	491 transitive_reflexive_rewrite(b,f1(f2(a,b),b,f3(a,f2(a,c),f2(a,b)))).  [resolve(153,a,162,a)].
12.02/12.32	1256 -transitive_reflexive_rewrite(f1(f2(a,b),b,f3(a,f2(a,c),f2(a,b))),A) | transitive_reflexive_rewrite(b,A).  [resolve(491,a,15,a)].
12.02/12.32	7492 transitive_reflexive_rewrite(f2(a,c),f1(f2(a,b),b,f3(a,f2(a,c),f2(a,b)))).  [resolve(381,a,225,a)].
12.02/12.32	8262 transitive_reflexive_rewrite(c,f1(f2(a,c),c,f1(f2(a,b),b,f3(a,f2(a,c),f2(a,b))))).  [resolve(7492,a,339,a)].
12.02/12.32	8267 transitive_reflexive_rewrite(f1(f2(a,b),b,f3(a,f2(a,c),f2(a,b))),f1(f2(a,c),c,f1(f2(a,b),b,f3(a,f2(a,c),f2(a,b))))).  [resolve(7492,a,300,a)].
12.02/12.32	14340 -transitive_reflexive_rewrite(b,f1(f2(a,c),c,f1(f2(a,b),b,f3(a,f2(a,c),f2(a,b))))).  [resolve(8262,a,14,b)].
12.02/12.32	17119 $F.  [ur(1256,b,14340,a),unit_del(a,8267)].
12.02/12.32	
12.02/12.32	% SZS output end Refutation
12.02/12.32	============================== end of proof ==========================
12.02/12.32	
12.02/12.32	============================== STATISTICS ============================
12.02/12.32	
12.02/12.32	Given=4532. Generated=62712. Kept=17110. proofs=1.
12.02/12.32	Usable=4464. Sos=9999. Demods=0. Limbo=0, Disabled=2660. Hints=0.
12.02/12.32	Megabytes=19.41.
12.02/12.32	User_CPU=11.24, System_CPU=0.06, Wall_clock=11.
12.02/12.32	
12.02/12.32	============================== end of statistics =====================
12.02/12.32	
12.02/12.32	============================== end of search =========================
12.02/12.32	
12.02/12.32	THEOREM PROVED
12.02/12.32	% SZS status Theorem
12.02/12.32	
12.02/12.32	Exiting with 1 proof.
12.02/12.32	
12.02/12.32	Process 20863 exit (max_proofs) Thu Aug 29 12:20:40 2019
12.02/12.32	Prover9 interrupted
12.02/12.32	EOF