0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n014.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   : 180
0.12/0.33	% DateTime   : Thu Aug 29 15:24:54 EDT 2019
0.12/0.33	% CPUTime    : 
3.39/3.71	============================== Prover9 ===============================
3.39/3.71	Prover9 (32) version 2009-11A, November 2009.
3.39/3.71	Process 13438 was started by sandbox on n014.cluster.edu,
3.39/3.71	Thu Aug 29 15:24:54 2019
3.39/3.71	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_13285_n014.cluster.edu".
3.39/3.71	============================== end of head ===========================
3.39/3.71	
3.39/3.71	============================== INPUT =================================
3.39/3.71	
3.39/3.71	% Reading from file /tmp/Prover9_13285_n014.cluster.edu
3.39/3.71	
3.39/3.71	set(prolog_style_variables).
3.39/3.71	set(auto2).
3.39/3.71	    % set(auto2) -> set(auto).
3.39/3.71	    % set(auto) -> set(auto_inference).
3.39/3.71	    % set(auto) -> set(auto_setup).
3.39/3.71	    % set(auto_setup) -> set(predicate_elim).
3.39/3.71	    % set(auto_setup) -> assign(eq_defs, unfold).
3.39/3.71	    % set(auto) -> set(auto_limits).
3.39/3.71	    % set(auto_limits) -> assign(max_weight, "100.000").
3.39/3.71	    % set(auto_limits) -> assign(sos_limit, 20000).
3.39/3.71	    % set(auto) -> set(auto_denials).
3.39/3.71	    % set(auto) -> set(auto_process).
3.39/3.71	    % set(auto2) -> assign(new_constants, 1).
3.39/3.71	    % set(auto2) -> assign(fold_denial_max, 3).
3.39/3.71	    % set(auto2) -> assign(max_weight, "200.000").
3.39/3.71	    % set(auto2) -> assign(max_hours, 1).
3.39/3.71	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
3.39/3.71	    % set(auto2) -> assign(max_seconds, 0).
3.39/3.71	    % set(auto2) -> assign(max_minutes, 5).
3.39/3.71	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
3.39/3.71	    % set(auto2) -> set(sort_initial_sos).
3.39/3.71	    % set(auto2) -> assign(sos_limit, -1).
3.39/3.71	    % set(auto2) -> assign(lrs_ticks, 3000).
3.39/3.71	    % set(auto2) -> assign(max_megs, 400).
3.39/3.71	    % set(auto2) -> assign(stats, some).
3.39/3.71	    % set(auto2) -> clear(echo_input).
3.39/3.71	    % set(auto2) -> set(quiet).
3.39/3.71	    % set(auto2) -> clear(print_initial_clauses).
3.39/3.71	    % set(auto2) -> clear(print_given).
3.39/3.71	assign(lrs_ticks,-1).
3.39/3.71	assign(sos_limit,10000).
3.39/3.71	assign(order,kbo).
3.39/3.71	set(lex_order_vars).
3.39/3.71	clear(print_given).
3.39/3.71	
3.39/3.71	% formulas(sos).  % not echoed (8 formulas)
3.39/3.71	
3.39/3.71	============================== end of input ==========================
3.39/3.71	
3.39/3.71	% From the command line: assign(max_seconds, 180).
3.39/3.71	
3.39/3.71	============================== PROCESS NON-CLAUSAL FORMULAS ==========
3.39/3.71	
3.39/3.71	% Formulas that are not ordinary clauses:
3.39/3.71	1 (all C all B all A mult(ld(A,mult(B,A)),ld(A,mult(C,A))) = ld(A,mult(mult(B,C),A))) # label(f07) # label(axiom) # label(non_clause).  [assumption].
3.39/3.71	2 (all B all A B = ld(A,mult(A,B))) # label(f04) # label(axiom) # label(non_clause).  [assumption].
3.39/3.71	3 (all B all A mult(A,ld(A,B)) = B) # label(f03) # label(axiom) # label(non_clause).  [assumption].
3.39/3.71	4 (all B all A mult(A,B) = mult(B,A)) # label(f05) # label(axiom) # label(non_clause).  [assumption].
3.39/3.71	5 (all D all C all B all A ld(mult(A,B),mult(A,mult(B,mult(C,D)))) = mult(ld(mult(A,B),mult(A,mult(B,C))),ld(mult(A,B),mult(A,mult(B,D))))) # label(f06) # label(axiom) # label(non_clause).  [assumption].
3.39/3.71	6 (all A mult(unit,A) = A) # label(f02) # label(axiom) # label(non_clause).  [assumption].
3.39/3.71	7 (all A A = mult(A,unit)) # label(f01) # label(axiom) # label(non_clause).  [assumption].
3.39/3.71	8 -(all X0 all X1 exists X2 mult(mult(X0,X0),mult(X1,X1)) = mult(X2,X2)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
3.39/3.71	
3.39/3.71	============================== end of process non-clausal formulas ===
3.39/3.71	
3.39/3.71	============================== PROCESS INITIAL CLAUSES ===============
3.39/3.71	
3.39/3.71	============================== PREDICATE ELIMINATION =================
3.39/3.71	
3.39/3.71	============================== end predicate elimination =============
3.39/3.71	
3.39/3.71	Auto_denials:
3.39/3.71	  % copying label goals to answer in negative clause
3.39/3.71	
3.39/3.71	Term ordering decisions:
3.39/3.71	Function symbol KB weights:  unit=1. c1=1. c2=1. mult=1. ld=1.
3.39/3.71	
3.39/3.71	============================== end of process initial clauses ========
3.39/3.71	
3.39/3.71	============================== CLAUSES FOR SEARCH ====================
3.39/3.71	
3.39/3.71	============================== end of clauses for search =============
3.39/3.71	
3.39/3.71	============================== SEARCH ================================
3.39/3.71	
3.39/3.71	% Starting search at 0.01 seconds.
3.39/3.71	
3.39/3.71	Low Water (keep): wt=163.000, iters=3390
3.39/3.71	
3.39/3.71	Low Water (keep): wt=147.000, iters=3352
3.39/3.71	
3.39/3.71	Low Water (keep): wt=139.000, iters=3571
3.39/3.71	
3.39/3.71	Low Water (keep): wt=127.000, iters=3436
3.39/3.71	
3.39/3.71	Low Water (keep): wt=115.000, iters=3336
5.26/5.58	
5.26/5.58	Low Water (keep): wt=107.000, iters=3340
5.26/5.58	
5.26/5.58	Low Water (keep): wt=103.000, iters=3395
5.26/5.58	
5.26/5.58	Low Water (keep): wt=99.000, iters=3424
5.26/5.58	
5.26/5.58	Low Water (keep): wt=91.000, iters=3353
5.26/5.58	
5.26/5.58	Low Water (keep): wt=87.000, iters=3532
5.26/5.58	
5.26/5.58	Low Water (keep): wt=79.000, iters=3469
5.26/5.58	
5.26/5.58	Low Water (keep): wt=75.000, iters=3430
5.26/5.58	
5.26/5.58	Low Water (keep): wt=67.000, iters=3385
5.26/5.58	
5.26/5.58	Low Water (keep): wt=65.000, iters=3357
5.26/5.58	
5.26/5.58	Low Water (keep): wt=63.000, iters=3397
5.26/5.58	
5.26/5.58	Low Water (keep): wt=61.000, iters=3388
5.26/5.58	
5.26/5.58	Low Water (keep): wt=59.000, iters=3517
5.26/5.58	
5.26/5.58	Low Water (keep): wt=57.000, iters=3384
5.26/5.58	
5.26/5.58	Low Water (keep): wt=55.000, iters=3378
5.26/5.58	
5.26/5.58	Low Water (keep): wt=53.000, iters=3414
5.26/5.58	
5.26/5.58	Low Water (keep): wt=51.000, iters=3359
5.26/5.58	
5.26/5.58	Low Water (keep): wt=49.000, iters=3355
5.26/5.58	
5.26/5.58	Low Water (keep): wt=47.000, iters=3385
5.26/5.58	
5.26/5.58	Low Water (keep): wt=45.000, iters=3345
5.26/5.58	
5.26/5.58	============================== PROOF =================================
5.26/5.58	% SZS status Theorem
5.26/5.58	% SZS output start Refutation
5.26/5.58	
5.26/5.58	% Proof 1 at 4.57 (+ 0.04) seconds: goals.
5.26/5.58	% Length of proof is 60.
5.26/5.58	% Level of proof is 21.
5.26/5.58	% Maximum clause weight is 37.000.
5.26/5.58	% Given clauses 319.
5.26/5.58	
5.26/5.58	2 (all B all A B = ld(A,mult(A,B))) # label(f04) # label(axiom) # label(non_clause).  [assumption].
5.26/5.58	3 (all B all A mult(A,ld(A,B)) = B) # label(f03) # label(axiom) # label(non_clause).  [assumption].
5.26/5.58	4 (all B all A mult(A,B) = mult(B,A)) # label(f05) # label(axiom) # label(non_clause).  [assumption].
5.26/5.58	5 (all D all C all B all A ld(mult(A,B),mult(A,mult(B,mult(C,D)))) = mult(ld(mult(A,B),mult(A,mult(B,C))),ld(mult(A,B),mult(A,mult(B,D))))) # label(f06) # label(axiom) # label(non_clause).  [assumption].
5.26/5.58	7 (all A A = mult(A,unit)) # label(f01) # label(axiom) # label(non_clause).  [assumption].
5.26/5.58	8 -(all X0 all X1 exists X2 mult(mult(X0,X0),mult(X1,X1)) = mult(X2,X2)) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
5.26/5.58	10 mult(A,unit) = A # label(f01) # label(axiom).  [clausify(7)].
5.26/5.58	11 ld(A,mult(A,B)) = B # label(f04) # label(axiom).  [clausify(2)].
5.26/5.58	12 mult(A,ld(A,B)) = B # label(f03) # label(axiom).  [clausify(3)].
5.26/5.58	13 mult(A,B) = mult(B,A) # label(f05) # label(axiom).  [clausify(4)].
5.26/5.58	15 ld(mult(A,B),mult(A,mult(B,mult(C,D)))) = mult(ld(mult(A,B),mult(A,mult(B,C))),ld(mult(A,B),mult(A,mult(B,D)))) # label(f06) # label(axiom).  [clausify(5)].
5.26/5.58	16 mult(ld(mult(A,B),mult(A,mult(B,C))),ld(mult(A,B),mult(A,mult(B,D)))) = ld(mult(A,B),mult(A,mult(B,mult(C,D)))).  [copy(15),flip(a)].
5.26/5.58	17 mult(mult(c1,c1),mult(c2,c2)) != mult(A,A) # label(goals) # label(negated_conjecture) # answer(goals).  [clausify(8)].
5.26/5.58	18 ld(A,A) = unit.  [para(10(a,1),11(a,1,2))].
5.26/5.58	19 mult(unit,mult(A,B)) = mult(A,B).  [para(10(a,1),16(a,1,1,1)),rewrite([13(2),10(2),11(2),10(2),13(2),10(2),11(2),10(3),11(6)]),flip(a)].
5.26/5.58	20 mult(unit,ld(mult(A,B),mult(A,mult(B,C)))) = ld(mult(A,B),mult(A,mult(B,C))).  [para(10(a,1),16(a,1,1,2,2)),rewrite([18(3),13(9),10(9)])].
5.26/5.58	22 mult(ld(A,mult(B,mult(C,ld(B,A)))),ld(A,mult(B,mult(D,ld(B,A))))) = ld(A,mult(B,mult(ld(B,A),mult(C,D)))).  [para(12(a,1),16(a,1,1,1)),rewrite([13(2),12(6),13(6),12(11)])].
5.26/5.58	23 mult(ld(mult(A,B),mult(A,C)),ld(mult(A,B),mult(A,mult(B,D)))) = ld(mult(A,B),mult(A,mult(B,mult(D,ld(B,C))))).  [para(12(a,1),16(a,1,1,2,2)),rewrite([13(11)])].
5.26/5.58	30 ld(unit,mult(A,B)) = mult(A,B).  [para(19(a,1),11(a,1,2))].
5.26/5.58	31 ld(unit,A) = A.  [para(10(a,1),30(a,1,2)),rewrite([10(4)])].
5.26/5.58	33 mult(unit,ld(mult(A,B),mult(A,C))) = ld(mult(A,B),mult(A,C)).  [para(12(a,1),20(a,1,2,2,2)),rewrite([12(8)])].
5.26/5.58	44 mult(unit,ld(A,mult(B,C))) = ld(A,mult(B,C)).  [para(12(a,1),33(a,1,2,1)),rewrite([12(6)])].
5.26/5.58	49 mult(unit,ld(A,B)) = ld(A,B).  [para(10(a,1),44(a,1,2,2)),rewrite([10(5)])].
5.26/5.58	50 ld(A,mult(B,A)) = B.  [para(11(a,1),44(a,1,2)),rewrite([13(2),10(2),13(1)]),flip(a)].
5.26/5.58	51 ld(ld(A,B),B) = A.  [para(12(a,1),50(a,1,2))].
5.26/5.58	52 ld(A,mult(B,mult(ld(B,A),mult(B,C)))) = mult(B,ld(A,mult(B,mult(C,ld(B,A))))).  [para(12(a,1),22(a,1,1,2,2)),rewrite([13(1),11(2)]),flip(a)].
5.26/5.58	53 ld(A,mult(B,mult(ld(B,A),mult(C,C)))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(22(a,1),17(a,2)),flip(a)].
5.26/5.58	60 ld(mult(A,B),mult(B,mult(A,mult(C,C)))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(50(a,1),53(a,1,2,2,1))].
5.26/5.58	74 mult(A,mult(ld(A,unit),mult(A,B))) = mult(A,mult(A,mult(B,ld(A,unit)))).  [para(52(a,1),31(a,1)),rewrite([31(6)]),flip(a)].
5.26/5.58	83 mult(ld(A,unit),mult(A,B)) = mult(A,mult(B,ld(A,unit))).  [para(74(a,1),11(a,1,2)),rewrite([11(6)]),flip(a)].
5.26/5.58	86 ld(A,mult(B,mult(ld(B,A),mult(ld(B,A),mult(C,ld(ld(B,A),unit)))))) = mult(ld(A,B),ld(A,mult(B,mult(ld(B,A),mult(C,ld(B,A)))))).  [para(74(a,1),22(a,2,2,2)),rewrite([13(5),12(5),10(2),13(3),13(5)]),flip(a)].
5.26/5.58	90 ld(mult(A,B),mult(A,mult(B,mult(C,ld(B,ld(A,D)))))) = mult(ld(mult(A,B),D),ld(mult(A,B),mult(A,mult(B,C)))).  [para(12(a,1),23(a,1,1,2)),flip(a)].
5.26/5.58	93 ld(mult(A,A),mult(A,mult(A,B))) = mult(A,ld(mult(A,A),mult(A,B))).  [para(50(a,1),23(a,1,2)),rewrite([13(4),12(7)]),flip(a)].
5.26/5.58	128 mult(A,mult(ld(A,B),ld(A,unit))) = mult(B,ld(A,unit)).  [para(12(a,1),83(a,1,2)),rewrite([13(3)]),flip(a)].
5.26/5.58	129 mult(mult(A,B),ld(A,unit)) = mult(A,mult(B,ld(A,unit))).  [para(83(a,1),13(a,1)),flip(a)].
5.26/5.58	130 ld(mult(A,B),mult(A,mult(B,ld(A,unit)))) = ld(A,unit).  [para(83(a,1),50(a,1,2))].
5.26/5.58	143 ld(mult(A,ld(B,unit)),mult(B,A)) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(83(a,1),60(a,1,2,2)),rewrite([13(3),12(6),10(5),13(4)])].
5.26/5.58	224 ld(A,mult(B,ld(A,unit))) = mult(ld(A,B),ld(A,unit)).  [para(128(a,1),11(a,1,2))].
5.26/5.58	338 ld(ld(A,unit),mult(A,B)) = mult(A,ld(ld(A,unit),B)).  [para(51(a,1),224(a,1,2,2)),rewrite([13(3),51(11),13(8)])].
5.26/5.58	794 ld(mult(A,A),mult(A,B)) = mult(A,ld(mult(A,A),B)).  [para(12(a,1),93(a,1,2,2)),rewrite([12(6)])].
5.26/5.58	817 mult(A,ld(mult(A,A),unit)) = ld(A,unit).  [para(93(a,1),130(a,1)),rewrite([12(4)])].
5.26/5.58	858 ld(mult(A,A),unit) = ld(A,ld(A,unit)).  [para(817(a,1),11(a,1,2)),flip(a)].
5.26/5.58	859 mult(mult(A,A),mult(ld(A,ld(A,unit)),mult(A,B))) = mult(A,mult(mult(A,A),mult(B,ld(A,ld(A,unit))))).  [para(817(a,1),22(a,1,1,2,2)),rewrite([129(5),12(4),10(3),31(2),858(5),31(8),858(12),31(16)]),flip(a)].
5.26/5.58	906 mult(mult(A,A),mult(ld(mult(A,A),B),ld(A,ld(A,unit)))) = mult(B,ld(A,ld(A,unit))).  [para(858(a,1),128(a,1,2,2)),rewrite([858(11)])].
5.26/5.58	1157 mult(mult(A,B),ld(A,ld(A,unit))) = mult(A,mult(B,ld(A,ld(A,unit)))).  [para(794(a,1),128(a,1,2,1)),rewrite([858(7),13(8),859(9),906(8),858(9)]),flip(a)].
5.26/5.58	3531 mult(A,mult(ld(A,B),ld(A,ld(A,unit)))) = mult(B,ld(A,ld(A,unit))).  [para(12(a,1),1157(a,1,1)),flip(a)].
5.26/5.58	5925 mult(A,mult(ld(A,ld(A,unit)),ld(A,B))) = mult(B,ld(A,ld(A,unit))).  [para(13(a,1),3531(a,1,2))].
5.26/5.58	8814 mult(ld(A,B),ld(A,mult(B,mult(ld(B,A),ld(B,A))))) = unit.  [para(49(a,1),86(a,1,2,2,2,2)),rewrite([12(6),13(3),49(3),12(2),18(1),49(6)]),flip(a)].
5.26/5.58	8931 ld(A,mult(B,ld(ld(B,A),unit))) = mult(ld(A,B),ld(A,B)).  [para(5925(a,1),86(a,1,2,2,2)),rewrite([49(8),12(7),13(14),12(14),12(11),10(8)])].
5.26/5.58	9041 mult(ld(mult(A,B),B),ld(mult(A,B),mult(B,mult(A,A)))) = unit.  [para(50(a,1),8814(a,1,2,2,2,1)),rewrite([50(5)])].
5.26/5.58	9123 mult(A,mult(ld(A,B),ld(A,B))) = mult(B,ld(ld(B,A),unit)).  [para(8931(a,1),12(a,1,2))].
5.26/5.58	9292 ld(mult(A,B),mult(B,mult(A,A))) = ld(ld(mult(A,B),B),unit).  [para(9041(a,1),11(a,1,2)),flip(a)].
5.26/5.58	9614 mult(mult(A,B),ld(ld(mult(A,B),A),unit)) = mult(A,mult(B,B)).  [para(11(a,1),9123(a,1,2,1)),rewrite([11(2)]),flip(a)].
5.26/5.58	9844 mult(mult(A,B),ld(ld(mult(A,B),B),unit)) = mult(B,mult(A,A)).  [para(9292(a,1),12(a,1,2))].
5.26/5.58	9845 ld(mult(A,B),mult(A,mult(B,B))) = ld(ld(mult(A,B),A),unit).  [para(13(a,1),9292(a,1,1)),rewrite([13(5)])].
5.26/5.58	10104 mult(ld(mult(A,B),C),ld(ld(mult(A,B),A),unit)) = ld(mult(A,B),mult(A,mult(B,ld(A,C)))).  [para(12(a,1),90(a,1,2,2,2)),rewrite([9845(11)]),flip(a)].
5.26/5.58	10315 mult(A,ld(ld(A,unit),mult(B,B))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(9614(a,1),143(a,1,2)),rewrite([13(8),10104(8),130(6),338(5)])].
5.26/5.58	10991 mult(ld(A,unit),ld(A,mult(B,B))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(51(a,1),10315(a,1,2,1))].
5.26/5.58	11024 mult(A,ld(ld(A,mult(B,B)),unit)) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(51(a,1),10991(a,1,2)),rewrite([13(5)])].
5.26/5.58	11025 $F # answer(goals).  [resolve(11024,a,9844,a)].
5.26/5.58	
5.26/5.58	% SZS output end Refutation
5.26/5.58	============================== end of proof ==========================
5.26/5.58	
5.26/5.58	============================== STATISTICS ============================
5.26/5.58	
5.26/5.58	Given=319. Generated=48237. Kept=11014. proofs=1.
5.26/5.58	Usable=264. Sos=8978. Demods=5082. Limbo=1, Disabled=1778. Hints=0.
5.26/5.58	Megabytes=27.17.
5.26/5.58	User_CPU=4.57, System_CPU=0.04, Wall_clock=5.
5.26/5.58	
5.26/5.58	============================== end of statistics =====================
5.26/5.58	
5.26/5.58	============================== end of search =========================
5.26/5.58	
5.26/5.58	THEOREM PROVED
5.26/5.58	% SZS status Theorem
5.26/5.58	
5.26/5.58	Exiting with 1 proof.
5.26/5.58	
5.26/5.58	Process 13438 exit (max_proofs) Thu Aug 29 15:24:59 2019
5.26/5.58	Prover9 interrupted
5.26/5.59	EOF