0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n013.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% DateTime   : Tue Jul 13 10:43:33 EDT 2021
0.12/0.34	% CPUTime    : 
0.73/1.07	============================== Prover9 ===============================
0.73/1.07	Prover9 (32) version 2009-11A, November 2009.
0.73/1.07	Process 23439 was started by sandbox2 on n013.cluster.edu,
0.73/1.07	Tue Jul 13 10:43:34 2021
0.73/1.07	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_23266_n013.cluster.edu".
0.73/1.07	============================== end of head ===========================
0.73/1.07	
0.73/1.07	============================== INPUT =================================
0.73/1.07	
0.73/1.07	% Reading from file /tmp/Prover9_23266_n013.cluster.edu
0.73/1.07	
0.73/1.07	set(prolog_style_variables).
0.73/1.07	set(auto2).
0.73/1.07	    % set(auto2) -> set(auto).
0.73/1.07	    % set(auto) -> set(auto_inference).
0.73/1.07	    % set(auto) -> set(auto_setup).
0.73/1.07	    % set(auto_setup) -> set(predicate_elim).
0.73/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.73/1.07	    % set(auto) -> set(auto_limits).
0.73/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.73/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.73/1.07	    % set(auto) -> set(auto_denials).
0.73/1.07	    % set(auto) -> set(auto_process).
0.73/1.07	    % set(auto2) -> assign(new_constants, 1).
0.73/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.73/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.73/1.07	    % set(auto2) -> assign(max_hours, 1).
0.73/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.73/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.73/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.73/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.73/1.07	    % set(auto2) -> set(sort_initial_sos).
0.73/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.73/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.73/1.07	    % set(auto2) -> assign(max_megs, 400).
0.73/1.07	    % set(auto2) -> assign(stats, some).
0.73/1.07	    % set(auto2) -> clear(echo_input).
0.73/1.07	    % set(auto2) -> set(quiet).
0.73/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.73/1.07	    % set(auto2) -> clear(print_given).
0.73/1.07	assign(lrs_ticks,-1).
0.73/1.07	assign(sos_limit,10000).
0.73/1.07	assign(order,kbo).
0.73/1.07	set(lex_order_vars).
0.73/1.07	clear(print_given).
0.73/1.07	
0.73/1.07	% formulas(sos).  % not echoed (12 formulas)
0.73/1.07	
0.73/1.07	============================== end of input ==========================
0.73/1.07	
0.73/1.07	% From the command line: assign(max_seconds, 1200).
0.73/1.07	
0.73/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.73/1.07	
0.73/1.07	% Formulas that are not ordinary clauses:
0.73/1.07	1 (all A all B (equalish(A,B) -> transitive_reflexive_rewrite(A,B))) # label(equality_in_transitive_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.73/1.07	2 (all A all B all C (rewrite(A,B) & rewrite(A,C) -> (exists D (transitive_reflexive_rewrite(B,D) & transitive_reflexive_rewrite(C,D))))) # label(lo_cfl) # label(axiom) # label(non_clause).  [assumption].
0.73/1.07	3 (all A all B (transitive_reflexive_rewrite(A,B) -> (exists C (transitive_reflexive_rewrite(C,B) & rewrite(A,C))) | equalish(A,B))) # label(equalish_or_rewrite) # label(axiom) # label(non_clause).  [assumption].
0.73/1.07	4 (all A all B all C (transitive_reflexive_rewrite(A,B) & transitive_reflexive_rewrite(A,C) & rewrite(a,A) -> (exists D (transitive_reflexive_rewrite(C,D) & transitive_reflexive_rewrite(B,D))))) # label(ih_cfl) # label(axiom) # label(non_clause).  [assumption].
0.73/1.07	5 (all A all B (equalish(A,B) -> equalish(B,A))) # label(symmetry) # label(axiom) # label(non_clause).  [assumption].
0.73/1.07	6 (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.73/1.07	7 (all A (transitive_reflexive_rewrite(b,A) & transitive_reflexive_rewrite(c,A) -> goal)) # label(found) # label(axiom) # label(non_clause).  [assumption].
0.73/1.07	8 (all A equalish(A,A)) # label(reflexivity) # label(axiom) # label(non_clause).  [assumption].
0.73/1.07	9 (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.73/1.07	
0.73/1.07	============================== end of process non-clausal formulas ===
0.73/1.07	
0.73/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.73/1.07	
0.73/1.07	============================== PREDICATE ELIMINATION =================
0.73/1.07	
0.73/1.07	============================== end predicate elimination =============
0.73/1.07	
0.73/1.07	Auto_denials:  (non-Horn, no changes).
0.73/1.07	
0.73/1.07	Term ordering decisions:
13.99/14.37	Function symbol KB weights:  a=1. b=1. c=1. f2=1. f1=1. f3=1.
13.99/14.37	
13.99/14.37	============================== end of process initial clauses ========
13.99/14.37	
13.99/14.37	============================== CLAUSES FOR SEARCH ====================
13.99/14.37	
13.99/14.37	============================== end of clauses for search =============
13.99/14.37	
13.99/14.37	============================== SEARCH ================================
13.99/14.37	
13.99/14.37	% Starting search at 0.01 seconds.
13.99/14.37	
13.99/14.37	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 431 (0.00 of 0.14 sec).
13.99/14.37	
13.99/14.37	Low Water (keep): wt=53.000, iters=3412
13.99/14.37	
13.99/14.37	Low Water (keep): wt=49.000, iters=3495
13.99/14.37	
13.99/14.37	Low Water (keep): wt=47.000, iters=3429
13.99/14.37	
13.99/14.37	Low Water (keep): wt=43.000, iters=3415
13.99/14.37	
13.99/14.37	Low Water (keep): wt=40.000, iters=3366
13.99/14.37	
13.99/14.37	Low Water (keep): wt=38.000, iters=3350
13.99/14.37	
13.99/14.37	Low Water (keep): wt=36.000, iters=3345
13.99/14.37	
13.99/14.37	Low Water (keep): wt=35.000, iters=3335
13.99/14.37	
13.99/14.37	Low Water (keep): wt=34.000, iters=3478
13.99/14.37	
13.99/14.37	Low Water (keep): wt=33.000, iters=3345
13.99/14.37	
13.99/14.37	Low Water (keep): wt=32.000, iters=3333
13.99/14.37	
13.99/14.37	Low Water (keep): wt=31.000, iters=3434
13.99/14.37	
13.99/14.37	Low Water (keep): wt=30.000, iters=3345
13.99/14.37	
13.99/14.37	Low Water (keep): wt=29.000, iters=3346
13.99/14.37	
13.99/14.37	Low Water (displace): id=3595, wt=79.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=11061, wt=34.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=11063, wt=33.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=11632, wt=32.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=11698, wt=31.000
13.99/14.37	
13.99/14.37	Low Water (keep): wt=27.000, iters=3340
13.99/14.37	
13.99/14.37	Low Water (displace): id=12129, wt=30.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=12558, wt=29.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=13391, wt=28.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=14126, wt=27.000
13.99/14.37	
13.99/14.37	Low Water (keep): wt=26.000, iters=3335
13.99/14.37	
13.99/14.37	Low Water (keep): wt=25.000, iters=3336
13.99/14.37	
13.99/14.37	Low Water (displace): id=21595, wt=26.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=21931, wt=24.000
13.99/14.37	
13.99/14.37	Low Water (displace): id=24585, wt=22.000
13.99/14.37	
13.99/14.37	============================== PROOF =================================
13.99/14.37	% SZS status Theorem
13.99/14.37	% SZS output start Refutation
13.99/14.37	
13.99/14.37	% Proof 1 at 13.26 (+ 0.05) seconds.
13.99/14.37	% Length of proof is 60.
13.99/14.37	% Level of proof is 13.
13.99/14.37	% Maximum clause weight is 32.000.
13.99/14.37	% Given clauses 5394.
13.99/14.37	
13.99/14.37	1 (all A all B (equalish(A,B) -> transitive_reflexive_rewrite(A,B))) # label(equality_in_transitive_reflexive_rewrite) # label(axiom) # label(non_clause).  [assumption].
13.99/14.37	2 (all A all B all C (rewrite(A,B) & rewrite(A,C) -> (exists D (transitive_reflexive_rewrite(B,D) & transitive_reflexive_rewrite(C,D))))) # label(lo_cfl) # label(axiom) # label(non_clause).  [assumption].
13.99/14.37	3 (all A all B (transitive_reflexive_rewrite(A,B) -> (exists C (transitive_reflexive_rewrite(C,B) & rewrite(A,C))) | equalish(A,B))) # label(equalish_or_rewrite) # label(axiom) # label(non_clause).  [assumption].
13.99/14.37	4 (all A all B all C (transitive_reflexive_rewrite(A,B) & transitive_reflexive_rewrite(A,C) & rewrite(a,A) -> (exists D (transitive_reflexive_rewrite(C,D) & transitive_reflexive_rewrite(B,D))))) # label(ih_cfl) # label(axiom) # label(non_clause).  [assumption].
13.99/14.37	5 (all A all B (equalish(A,B) -> equalish(B,A))) # label(symmetry) # label(axiom) # label(non_clause).  [assumption].
13.99/14.37	7 (all A (transitive_reflexive_rewrite(b,A) & transitive_reflexive_rewrite(c,A) -> goal)) # label(found) # label(axiom) # label(non_clause).  [assumption].
13.99/14.37	8 (all A equalish(A,A)) # label(reflexivity) # label(axiom) # label(non_clause).  [assumption].
13.99/14.37	9 (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].
13.99/14.37	10 equalish(A,A) # label(reflexivity) # label(axiom).  [clausify(8)].
13.99/14.37	11 transitive_reflexive_rewrite(a,b) # label(assumption_AndLHS) # label(axiom).  [assumption].
13.99/14.37	12 transitive_reflexive_rewrite(a,c) # label(assumption_AndRHS) # label(axiom).  [assumption].
13.99/14.37	13 -goal # label(goal_to_be_proved) # label(negated_conjecture).  [assumption].
13.99/14.37	14 -equalish(A,B) | transitive_reflexive_rewrite(A,B) # label(equality_in_transitive_reflexive_rewrite) # label(axiom).  [clausify(1)].
13.99/14.37	15 -equalish(A,B) | equalish(B,A) # label(symmetry) # label(axiom).  [clausify(5)].
13.99/14.37	17 -transitive_reflexive_rewrite(b,A) | -transitive_reflexive_rewrite(c,A) | goal # label(found) # label(axiom).  [clausify(7)].
13.99/14.37	18 -transitive_reflexive_rewrite(b,A) | -transitive_reflexive_rewrite(c,A).  [copy(17),unit_del(c,13)].
13.99/14.37	19 -transitive_reflexive_rewrite(A,B) | -transitive_reflexive_rewrite(B,C) | transitive_reflexive_rewrite(A,C) # label(transitivity_of_transitive_reflexive_rewrite) # label(axiom).  [clausify(9)].
13.99/14.37	20 -transitive_reflexive_rewrite(A,B) | transitive_reflexive_rewrite(f2(A,B),B) | equalish(A,B) # label(equalish_or_rewrite) # label(axiom).  [clausify(3)].
13.99/14.37	21 -transitive_reflexive_rewrite(A,B) | rewrite(A,f2(A,B)) | equalish(A,B) # label(equalish_or_rewrite) # label(axiom).  [clausify(3)].
13.99/14.37	22 -rewrite(A,B) | -rewrite(A,C) | transitive_reflexive_rewrite(B,f1(A,B,C)) # label(lo_cfl) # label(axiom).  [clausify(2)].
13.99/14.37	23 -rewrite(A,B) | -rewrite(A,C) | transitive_reflexive_rewrite(C,f1(A,B,C)) # label(lo_cfl) # label(axiom).  [clausify(2)].
13.99/14.37	24 -transitive_reflexive_rewrite(A,B) | -transitive_reflexive_rewrite(A,C) | -rewrite(a,A) | transitive_reflexive_rewrite(C,f3(A,B,C)) # label(ih_cfl) # label(axiom).  [clausify(4)].
13.99/14.37	25 -transitive_reflexive_rewrite(A,B) | -transitive_reflexive_rewrite(A,C) | -rewrite(a,A) | transitive_reflexive_rewrite(B,f3(A,B,C)) # label(ih_cfl) # label(axiom).  [clausify(4)].
13.99/14.37	28 transitive_reflexive_rewrite(A,A).  [resolve(14,a,10,a)].
13.99/14.37	33 transitive_reflexive_rewrite(f2(a,c),c) | equalish(a,c).  [resolve(20,a,12,a)].
13.99/14.37	34 transitive_reflexive_rewrite(f2(a,b),b) | equalish(a,b).  [resolve(20,a,11,a)].
13.99/14.37	35 rewrite(a,f2(a,c)) | equalish(a,c).  [resolve(21,a,12,a)].
13.99/14.37	36 rewrite(a,f2(a,b)) | equalish(a,b).  [resolve(21,a,11,a)].
13.99/14.37	37 -transitive_reflexive_rewrite(b,c).  [resolve(28,a,18,b)].
13.99/14.37	38 -transitive_reflexive_rewrite(c,b).  [ur(18,a,28,a)].
13.99/14.37	39 -transitive_reflexive_rewrite(b,a).  [ur(19,b,12,a,c,37,a)].
13.99/14.37	42 -transitive_reflexive_rewrite(c,a).  [ur(19,b,11,a,c,38,a)].
13.99/14.37	46 -equalish(b,a).  [ur(14,b,39,a)].
13.99/14.37	47 transitive_reflexive_rewrite(f2(a,c),c) | equalish(c,a).  [resolve(33,b,15,a)].
13.99/14.37	49 -equalish(c,a).  [ur(14,b,42,a)].
13.99/14.37	50 transitive_reflexive_rewrite(f2(a,c),c).  [back_unit_del(47),unit_del(b,49)].
13.99/14.37	56 transitive_reflexive_rewrite(f2(a,b),b).  [resolve(34,b,15,a),unit_del(b,46)].
13.99/14.37	62 rewrite(a,f2(a,c)).  [resolve(35,b,15,a),unit_del(b,49)].
13.99/14.37	63 rewrite(a,f2(a,b)).  [resolve(36,b,15,a),unit_del(b,46)].
13.99/14.37	68 -transitive_reflexive_rewrite(f2(a,c),A) | -transitive_reflexive_rewrite(f2(a,c),B) | transitive_reflexive_rewrite(A,f3(f2(a,c),A,B)).  [resolve(62,a,25,c)].
13.99/14.37	69 -transitive_reflexive_rewrite(f2(a,c),A) | -transitive_reflexive_rewrite(f2(a,c),B) | transitive_reflexive_rewrite(B,f3(f2(a,c),A,B)).  [resolve(62,a,24,c)].
13.99/14.37	71 -rewrite(a,A) | transitive_reflexive_rewrite(A,f1(a,f2(a,c),A)).  [resolve(62,a,23,a)].
13.99/14.37	77 -transitive_reflexive_rewrite(f2(a,b),A) | -transitive_reflexive_rewrite(f2(a,b),B) | transitive_reflexive_rewrite(A,f3(f2(a,b),A,B)).  [resolve(63,a,25,c)].
13.99/14.37	78 -transitive_reflexive_rewrite(f2(a,b),A) | -transitive_reflexive_rewrite(f2(a,b),B) | transitive_reflexive_rewrite(B,f3(f2(a,b),A,B)).  [resolve(63,a,24,c)].
13.99/14.37	81 -rewrite(a,A) | transitive_reflexive_rewrite(A,f1(a,A,f2(a,b))).  [resolve(63,a,22,b)].
13.99/14.37	101 transitive_reflexive_rewrite(f2(a,b),f1(a,f2(a,c),f2(a,b))).  [resolve(71,a,63,a)].
13.99/14.37	104 transitive_reflexive_rewrite(f2(a,c),f1(a,f2(a,c),f2(a,b))).  [resolve(81,a,62,a)].
13.99/14.37	152 -transitive_reflexive_rewrite(f2(a,c),A) | transitive_reflexive_rewrite(A,f3(f2(a,c),A,c)).  [resolve(68,b,50,a)].
13.99/14.37	167 -transitive_reflexive_rewrite(f2(a,c),A) | transitive_reflexive_rewrite(c,f3(f2(a,c),A,c)).  [resolve(69,b,50,a)].
13.99/14.37	198 -transitive_reflexive_rewrite(f1(a,f2(a,c),f2(a,b)),A) | transitive_reflexive_rewrite(f2(a,b),A).  [resolve(101,a,19,a)].
13.99/14.37	269 -transitive_reflexive_rewrite(f2(a,b),A) | transitive_reflexive_rewrite(A,f3(f2(a,b),A,b)).  [resolve(77,b,56,a)].
13.99/14.37	289 -transitive_reflexive_rewrite(f2(a,b),A) | transitive_reflexive_rewrite(b,f3(f2(a,b),A,b)).  [resolve(78,b,56,a)].
13.99/14.37	417 transitive_reflexive_rewrite(f1(a,f2(a,c),f2(a,b)),f3(f2(a,c),f1(a,f2(a,c),f2(a,b)),c)).  [resolve(152,a,104,a)].
13.99/14.37	474 transitive_reflexive_rewrite(c,f3(f2(a,c),f1(a,f2(a,c),f2(a,b)),c)).  [resolve(167,a,104,a)].
13.99/14.37	1199 -transitive_reflexive_rewrite(f3(f2(a,c),f1(a,f2(a,c),f2(a,b)),c),A) | transitive_reflexive_rewrite(c,A).  [resolve(474,a,19,a)].
13.99/14.37	7070 transitive_reflexive_rewrite(f2(a,b),f3(f2(a,c),f1(a,f2(a,c),f2(a,b)),c)).  [resolve(417,a,198,a)].
13.99/14.37	7883 transitive_reflexive_rewrite(b,f3(f2(a,b),f3(f2(a,c),f1(a,f2(a,c),f2(a,b)),c),b)).  [resolve(7070,a,289,a)].
13.99/14.37	7886 transitive_reflexive_rewrite(f3(f2(a,c),f1(a,f2(a,c),f2(a,b)),c),f3(f2(a,b),f3(f2(a,c),f1(a,f2(a,c),f2(a,b)),c),b)).  [resolve(7070,a,269,a)].
13.99/14.37	13780 -transitive_reflexive_rewrite(c,f3(f2(a,b),f3(f2(a,c),f1(a,f2(a,c),f2(a,b)),c),b)).  [ur(18,a,7883,a)].
13.99/14.37	27456 $F.  [ur(1199,b,13780,a),unit_del(a,7886)].
13.99/14.37	
13.99/14.37	% SZS output end Refutation
13.99/14.37	============================== end of proof ==========================
13.99/14.37	
13.99/14.37	============================== STATISTICS ============================
13.99/14.37	
13.99/14.37	Given=5394. Generated=71513. Kept=27445. proofs=1.
13.99/14.37	Usable=5330. Sos=9999. Demods=0. Limbo=23, Disabled=12108. Hints=0.
13.99/14.37	Megabytes=29.43.
13.99/14.37	User_CPU=13.26, System_CPU=0.05, Wall_clock=13.
13.99/14.37	
13.99/14.37	============================== end of statistics =====================
13.99/14.37	
13.99/14.37	============================== end of search =========================
13.99/14.37	
13.99/14.37	THEOREM PROVED
13.99/14.37	% SZS status Theorem
13.99/14.37	
13.99/14.37	Exiting with 1 proof.
13.99/14.37	
13.99/14.37	Process 23439 exit (max_proofs) Tue Jul 13 10:43:47 2021
13.99/14.37	Prover9 interrupted
13.99/14.38	EOF