0.03/0.11	% 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   : 960
0.12/0.33	% DateTime   : Thu Jul  2 08:58:55 EDT 2020
0.12/0.33	% CPUTime    : 
4.51/4.84	============================== Prover9 ===============================
4.51/4.84	Prover9 (32) version 2009-11A, November 2009.
4.51/4.84	Process 4645 was started by sandbox2 on n014.cluster.edu,
4.51/4.84	Thu Jul  2 08:58:56 2020
4.51/4.84	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_4492_n014.cluster.edu".
4.51/4.84	============================== end of head ===========================
4.51/4.84	
4.51/4.84	============================== INPUT =================================
4.51/4.84	
4.51/4.84	% Reading from file /tmp/Prover9_4492_n014.cluster.edu
4.51/4.84	
4.51/4.84	set(prolog_style_variables).
4.51/4.84	set(auto2).
4.51/4.84	    % set(auto2) -> set(auto).
4.51/4.84	    % set(auto) -> set(auto_inference).
4.51/4.84	    % set(auto) -> set(auto_setup).
4.51/4.84	    % set(auto_setup) -> set(predicate_elim).
4.51/4.84	    % set(auto_setup) -> assign(eq_defs, unfold).
4.51/4.84	    % set(auto) -> set(auto_limits).
4.51/4.84	    % set(auto_limits) -> assign(max_weight, "100.000").
4.51/4.84	    % set(auto_limits) -> assign(sos_limit, 20000).
4.51/4.84	    % set(auto) -> set(auto_denials).
4.51/4.84	    % set(auto) -> set(auto_process).
4.51/4.84	    % set(auto2) -> assign(new_constants, 1).
4.51/4.84	    % set(auto2) -> assign(fold_denial_max, 3).
4.51/4.84	    % set(auto2) -> assign(max_weight, "200.000").
4.51/4.84	    % set(auto2) -> assign(max_hours, 1).
4.51/4.84	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
4.51/4.84	    % set(auto2) -> assign(max_seconds, 0).
4.51/4.84	    % set(auto2) -> assign(max_minutes, 5).
4.51/4.84	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
4.51/4.84	    % set(auto2) -> set(sort_initial_sos).
4.51/4.84	    % set(auto2) -> assign(sos_limit, -1).
4.51/4.84	    % set(auto2) -> assign(lrs_ticks, 3000).
4.51/4.84	    % set(auto2) -> assign(max_megs, 400).
4.51/4.84	    % set(auto2) -> assign(stats, some).
4.51/4.84	    % set(auto2) -> clear(echo_input).
4.51/4.84	    % set(auto2) -> set(quiet).
4.51/4.84	    % set(auto2) -> clear(print_initial_clauses).
4.51/4.84	    % set(auto2) -> clear(print_given).
4.51/4.84	assign(lrs_ticks,-1).
4.51/4.84	assign(sos_limit,10000).
4.51/4.84	assign(order,kbo).
4.51/4.84	set(lex_order_vars).
4.51/4.84	clear(print_given).
4.51/4.84	
4.51/4.84	% formulas(sos).  % not echoed (8 formulas)
4.51/4.84	
4.51/4.84	============================== end of input ==========================
4.51/4.84	
4.51/4.84	% From the command line: assign(max_seconds, 960).
4.51/4.84	
4.51/4.84	============================== PROCESS NON-CLAUSAL FORMULAS ==========
4.51/4.85	
4.51/4.85	% Formulas that are not ordinary clauses:
4.51/4.85	1 (all B all A ld(A,mult(A,B)) = B) # label(f04) # label(axiom) # label(non_clause).  [assumption].
4.51/4.85	2 (all A mult(A,unit) = A) # label(f01) # label(axiom) # label(non_clause).  [assumption].
4.51/4.85	3 (all A A = mult(unit,A)) # label(f02) # label(axiom) # label(non_clause).  [assumption].
4.51/4.85	4 (all B all A mult(A,B) = mult(B,A)) # label(f05) # label(axiom) # label(non_clause).  [assumption].
4.51/4.85	5 (all B all A mult(A,ld(A,B)) = B) # label(f03) # label(axiom) # label(non_clause).  [assumption].
4.51/4.85	6 (all C all B all A ld(A,mult(mult(B,C),A)) = mult(ld(A,mult(B,A)),ld(A,mult(C,A)))) # label(f07) # label(axiom) # label(non_clause).  [assumption].
4.51/4.85	7 (all D all C all B all A 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))))) # label(f06) # label(axiom) # label(non_clause).  [assumption].
4.51/4.85	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].
4.51/4.85	
4.51/4.85	============================== end of process non-clausal formulas ===
4.51/4.85	
4.51/4.85	============================== PROCESS INITIAL CLAUSES ===============
4.51/4.85	
4.51/4.85	============================== PREDICATE ELIMINATION =================
4.51/4.85	
4.51/4.85	============================== end predicate elimination =============
4.51/4.85	
4.51/4.85	Auto_denials:
4.51/4.85	  % copying label goals to answer in negative clause
4.51/4.85	
4.51/4.85	Term ordering decisions:
4.51/4.85	Function symbol KB weights:  unit=1. c1=1. c2=1. mult=1. ld=1.
4.51/4.85	
4.51/4.85	============================== end of process initial clauses ========
4.51/4.85	
4.51/4.85	============================== CLAUSES FOR SEARCH ====================
4.51/4.85	
4.51/4.85	============================== end of clauses for search =============
4.51/4.85	
4.51/4.85	============================== SEARCH ================================
4.51/4.85	
4.51/4.85	% Starting search at 0.01 seconds.
4.51/4.85	
4.51/4.85	Low Water (keep): wt=163.000, iters=3440
4.51/4.85	
4.51/4.85	Low Water (keep): wt=139.000, iters=3336
4.51/4.85	
4.51/4.85	Low Water (keep): wt=133.000, iters=3423
4.51/4.85	
4.51/4.85	Low Water (keep): wt=109.000, iters=3434
4.51/4.85	
4.51/4.85	Low Water (keep): wt=95.000, iters=3458
10.64/11.00	
10.64/11.00	Low Water (keep): wt=79.000, iters=3389
10.64/11.00	
10.64/11.00	Low Water (keep): wt=71.000, iters=3354
10.64/11.00	
10.64/11.00	Low Water (keep): wt=67.000, iters=3387
10.64/11.00	
10.64/11.00	Low Water (keep): wt=65.000, iters=3339
10.64/11.00	
10.64/11.00	Low Water (keep): wt=63.000, iters=3409
10.64/11.00	
10.64/11.00	Low Water (keep): wt=59.000, iters=3373
10.64/11.00	
10.64/11.00	Low Water (keep): wt=57.000, iters=3350
10.64/11.00	
10.64/11.00	Low Water (keep): wt=55.000, iters=3371
10.64/11.00	
10.64/11.00	Low Water (keep): wt=53.000, iters=3504
10.64/11.00	
10.64/11.00	Low Water (keep): wt=47.000, iters=3484
10.64/11.00	
10.64/11.00	Low Water (keep): wt=45.000, iters=3463
10.64/11.00	
10.64/11.00	Low Water (keep): wt=43.000, iters=3395
10.64/11.00	
10.64/11.00	Low Water (keep): wt=41.000, iters=3367
10.64/11.00	
10.64/11.00	Low Water (keep): wt=39.000, iters=3358
10.64/11.00	
10.64/11.00	Low Water (keep): wt=37.000, iters=3334
10.64/11.00	
10.64/11.00	Low Water (displace): id=3100, wt=199.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=8441, wt=195.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=8444, wt=157.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=2560, wt=149.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=6263, wt=147.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=8440, wt=139.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=8455, wt=123.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=7901, wt=121.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=7903, wt=119.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=7936, wt=117.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=8810, wt=115.000
10.64/11.00	
10.64/11.00	Low Water (keep): wt=35.000, iters=3340
10.64/11.00	
10.64/11.00	Low Water (displace): id=12338, wt=31.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=12339, wt=29.000
10.64/11.00	
10.64/11.00	Low Water (displace): id=12910, wt=27.000
10.64/11.00	
10.64/11.00	Low Water (keep): wt=33.000, iters=3381
10.64/11.00	
10.64/11.00	============================== PROOF =================================
10.64/11.00	% SZS status Theorem
10.64/11.00	% SZS output start Refutation
10.64/11.00	
10.64/11.00	% Proof 1 at 9.81 (+ 0.06) seconds: goals.
10.64/11.00	% Length of proof is 55.
10.64/11.00	% Level of proof is 23.
10.64/11.00	% Maximum clause weight is 31.000.
10.64/11.00	% Given clauses 430.
10.64/11.00	
10.64/11.00	1 (all B all A ld(A,mult(A,B)) = B) # label(f04) # label(axiom) # label(non_clause).  [assumption].
10.64/11.00	2 (all A mult(A,unit) = A) # label(f01) # label(axiom) # label(non_clause).  [assumption].
10.64/11.00	4 (all B all A mult(A,B) = mult(B,A)) # label(f05) # label(axiom) # label(non_clause).  [assumption].
10.64/11.00	5 (all B all A mult(A,ld(A,B)) = B) # label(f03) # label(axiom) # label(non_clause).  [assumption].
10.64/11.00	7 (all D all C all B all A 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))))) # label(f06) # label(axiom) # label(non_clause).  [assumption].
10.64/11.00	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].
10.64/11.00	9 mult(A,unit) = A # label(f01) # label(axiom).  [clausify(2)].
10.64/11.00	11 ld(A,mult(A,B)) = B # label(f04) # label(axiom).  [clausify(1)].
10.64/11.00	12 mult(A,B) = mult(B,A) # label(f05) # label(axiom).  [clausify(4)].
10.64/11.00	13 mult(A,ld(A,B)) = B # label(f03) # label(axiom).  [clausify(5)].
10.64/11.00	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(7)].
10.64/11.00	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)].
10.64/11.00	17 mult(mult(c1,c1),mult(c2,c2)) != mult(A,A) # label(goals) # label(negated_conjecture) # answer(goals).  [clausify(8)].
10.64/11.00	18 ld(A,A) = unit.  [para(9(a,1),11(a,1,2))].
10.64/11.00	19 mult(unit,mult(A,B)) = mult(A,B).  [para(9(a,1),16(a,1,1,1)),rewrite([12(2),9(2),11(2),9(2),12(2),9(2),11(2),9(3),11(6)]),flip(a)].
10.64/11.00	20 mult(unit,ld(mult(A,B),mult(A,mult(B,C)))) = ld(mult(A,B),mult(A,mult(B,C))).  [para(9(a,1),16(a,1,1,2,2)),rewrite([18(3),12(9),9(9)])].
10.64/11.00	22 mult(ld(mult(A,B),mult(B,mult(A,C))),ld(mult(A,B),mult(B,mult(A,D)))) = ld(mult(A,B),mult(B,mult(A,mult(C,D)))).  [para(12(a,1),16(a,1,1,1)),rewrite([12(5),12(10)])].
10.64/11.00	23 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(13(a,1),16(a,1,1,1)),rewrite([12(2),13(6),12(6),13(11)])].
10.64/11.00	24 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(13(a,1),16(a,1,1,2,2)),rewrite([12(11)])].
10.64/11.00	30 ld(unit,mult(A,B)) = mult(A,B).  [para(19(a,1),11(a,1,2))].
10.64/11.00	31 ld(unit,A) = A.  [para(9(a,1),30(a,1,2)),rewrite([9(4)])].
10.64/11.00	34 mult(unit,ld(mult(A,B),mult(A,C))) = ld(mult(A,B),mult(A,C)).  [para(13(a,1),20(a,1,2,2,2)),rewrite([13(8)])].
10.64/11.00	45 mult(unit,ld(A,mult(B,C))) = ld(A,mult(B,C)).  [para(13(a,1),34(a,1,2,1)),rewrite([13(6)])].
10.64/11.00	50 mult(unit,ld(A,B)) = ld(A,B).  [para(9(a,1),45(a,1,2,2)),rewrite([9(5)])].
10.64/11.00	51 ld(A,mult(B,A)) = B.  [para(11(a,1),45(a,1,2)),rewrite([12(2),9(2),12(1)]),flip(a)].
10.64/11.00	52 ld(ld(A,B),B) = A.  [para(13(a,1),51(a,1,2))].
10.64/11.00	56 ld(mult(A,B),mult(B,mult(A,mult(C,C)))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(22(a,1),17(a,2)),flip(a)].
10.64/11.00	57 ld(mult(A,B),mult(A,mult(B,mult(A,C)))) = mult(A,ld(mult(A,B),mult(A,mult(B,C)))).  [para(51(a,1),22(a,1,1)),rewrite([12(1),12(6)]),flip(a)].
10.64/11.00	69 ld(A,mult(B,mult(ld(B,A),mult(B,C)))) = mult(B,ld(A,mult(B,mult(C,ld(B,A))))).  [para(13(a,1),57(a,1,1)),rewrite([13(7),12(7)])].
10.64/11.00	76 mult(mult(A,mult(B,ld(A,unit))),mult(A,mult(C,ld(A,unit)))) = mult(A,mult(ld(A,unit),mult(B,C))).  [para(31(a,1),23(a,1,1)),rewrite([31(10),31(16)])].
10.64/11.00	78 ld(mult(A,B),mult(B,mult(A,ld(C,mult(D,mult(ld(D,C),mult(E,E))))))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(23(a,1),56(a,1,2,2,2))].
10.64/11.00	130 mult(A,mult(ld(A,unit),mult(A,B))) = mult(A,mult(A,mult(B,ld(A,unit)))).  [para(69(a,1),31(a,1)),rewrite([31(6)]),flip(a)].
10.64/11.00	140 mult(ld(A,unit),mult(A,B)) = mult(A,mult(B,ld(A,unit))).  [para(130(a,1),11(a,1,2)),rewrite([11(6)]),flip(a)].
10.64/11.00	199 ld(ld(A,unit),mult(A,mult(B,ld(A,unit)))) = mult(A,B).  [para(140(a,1),11(a,1,2))].
10.64/11.00	201 mult(A,mult(ld(A,B),ld(A,unit))) = mult(B,ld(A,unit)).  [para(13(a,1),140(a,1,2)),rewrite([12(3)]),flip(a)].
10.64/11.00	221 ld(ld(A,unit),A) = mult(A,A).  [para(13(a,1),199(a,1,2,2)),rewrite([9(4)])].
10.64/11.00	228 mult(ld(A,unit),ld(A,unit)) = ld(A,ld(A,unit)).  [para(52(a,1),221(a,1,1)),flip(a)].
10.64/11.00	303 mult(ld(mult(A,B),A),ld(mult(A,B),A)) = ld(mult(A,B),mult(A,ld(B,unit))).  [para(228(a,1),24(a,2,2,2,2)),rewrite([9(3),13(6),9(5),13(10)])].
10.64/11.00	325 ld(A,mult(B,ld(A,unit))) = mult(ld(A,B),ld(A,unit)).  [para(201(a,1),11(a,1,2))].
10.64/11.00	326 mult(A,mult(ld(A,unit),ld(A,B))) = mult(B,ld(A,unit)).  [para(12(a,1),201(a,1,2))].
10.64/11.00	6131 mult(ld(A,unit),mult(B,mult(ld(B,A),mult(C,C)))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(326(a,1),78(a,1,2)),rewrite([12(3),13(3),12(8),31(9)])].
10.64/11.00	10002 mult(ld(A,unit),mult(B,ld(ld(B,A),unit))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(201(a,1),6131(a,1,2,2)),rewrite([50(7)])].
10.64/11.00	10080 mult(ld(A,unit),mult(ld(B,A),ld(B,unit))) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(52(a,1),10002(a,1,2,2,1))].
10.64/11.00	10971 ld(A,mult(B,ld(ld(B,A),unit))) = mult(ld(A,B),ld(A,B)).  [para(13(a,1),303(a,1,1,1)),rewrite([13(3),13(5)]),flip(a)].
10.64/11.00	11263 mult(A,mult(ld(A,B),ld(A,B))) = mult(B,ld(ld(B,A),unit)).  [para(10971(a,1),13(a,1,2))].
10.64/11.00	11425 mult(mult(A,B),ld(ld(mult(A,B),A),unit)) = mult(A,mult(B,B)).  [para(11(a,1),11263(a,1,2,1)),rewrite([11(2)]),flip(a)].
10.64/11.00	11439 mult(ld(A,mult(B,C)),ld(ld(A,B),unit)) = ld(A,mult(B,mult(C,ld(B,A)))).  [para(11263(a,1),24(a,1,2,2)),rewrite([13(2),13(4),11(7),13(8),13(11),12(8)])].
10.64/11.00	11496 mult(A,mult(B,ld(ld(B,ld(A,unit)),unit))) = mult(mult(A,B),mult(A,B)).  [para(11263(a,1),76(a,2,2)),rewrite([12(6),13(6),12(7),13(7)]),flip(a)].
10.64/11.00	11676 mult(mult(A,B),ld(ld(mult(A,B),B),unit)) = mult(B,mult(A,A)).  [para(12(a,1),11425(a,1,1)),rewrite([12(2)])].
10.64/11.00	13326 ld(A,mult(mult(A,B),mult(A,B))) = mult(B,ld(ld(B,ld(A,unit)),unit)).  [para(11496(a,1),11(a,1,2))].
10.64/11.00	13433 mult(ld(A,B),ld(ld(ld(A,B),ld(A,unit)),unit)) = ld(A,mult(B,B)).  [para(13(a,1),13326(a,1,2,1)),rewrite([13(2)]),flip(a)].
10.64/11.00	13954 ld(ld(ld(A,B),ld(A,unit)),unit) = ld(ld(A,B),ld(A,mult(B,B))).  [para(13433(a,1),11(a,1,2)),flip(a)].
10.64/11.00	14722 mult(ld(ld(A,B),unit),ld(ld(ld(A,B),ld(A,unit)),unit)) = A.  [para(13954(a,2),325(a,2,1)),rewrite([11439(7),13(3),12(2),11(3),52(2),12(10)]),flip(a)].
10.64/11.00	14817 mult(A,ld(ld(A,mult(B,B)),unit)) != mult(mult(c1,c1),mult(c2,c2)) # answer(goals).  [para(13954(a,2),10080(a,1,2,1)),rewrite([12(14),14722(14),12(5)])].
10.64/11.00	14818 $F # answer(goals).  [resolve(14817,a,11676,a)].
10.64/11.00	
10.64/11.00	% SZS output end Refutation
10.64/11.00	============================== end of proof ==========================
10.64/11.00	
10.64/11.00	============================== STATISTICS ============================
10.64/11.00	
10.64/11.00	Given=430. Generated=84117. Kept=14807. proofs=1.
10.64/11.00	Usable=357. Sos=9999. Demods=5451. Limbo=118, Disabled=4340. Hints=0.
10.64/11.00	Megabytes=29.12.
10.64/11.00	User_CPU=9.82, System_CPU=0.06, Wall_clock=10.
10.64/11.00	
10.64/11.00	============================== end of statistics =====================
10.64/11.00	
10.64/11.00	============================== end of search =========================
10.64/11.00	
10.64/11.00	THEOREM PROVED
10.64/11.00	% SZS status Theorem
10.64/11.00	
10.64/11.00	Exiting with 1 proof.
10.64/11.00	
10.64/11.00	Process 4645 exit (max_proofs) Thu Jul  2 08:59:06 2020
10.64/11.00	Prover9 interrupted
10.64/11.01	EOF