0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n020.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 09:46:25 EDT 2019
0.12/0.33	% CPUTime    : 
0.81/1.11	============================== Prover9 ===============================
0.81/1.11	Prover9 (32) version 2009-11A, November 2009.
0.81/1.11	Process 18693 was started by sandbox on n020.cluster.edu,
0.81/1.11	Thu Aug 29 09:46:26 2019
0.81/1.11	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_18540_n020.cluster.edu".
0.81/1.11	============================== end of head ===========================
0.81/1.11	
0.81/1.11	============================== INPUT =================================
0.81/1.11	
0.81/1.11	% Reading from file /tmp/Prover9_18540_n020.cluster.edu
0.81/1.11	
0.81/1.11	set(prolog_style_variables).
0.81/1.11	set(auto2).
0.81/1.11	    % set(auto2) -> set(auto).
0.81/1.11	    % set(auto) -> set(auto_inference).
0.81/1.11	    % set(auto) -> set(auto_setup).
0.81/1.11	    % set(auto_setup) -> set(predicate_elim).
0.81/1.11	    % set(auto_setup) -> assign(eq_defs, unfold).
0.81/1.11	    % set(auto) -> set(auto_limits).
0.81/1.11	    % set(auto_limits) -> assign(max_weight, "100.000").
0.81/1.11	    % set(auto_limits) -> assign(sos_limit, 20000).
0.81/1.11	    % set(auto) -> set(auto_denials).
0.81/1.11	    % set(auto) -> set(auto_process).
0.81/1.11	    % set(auto2) -> assign(new_constants, 1).
0.81/1.11	    % set(auto2) -> assign(fold_denial_max, 3).
0.81/1.11	    % set(auto2) -> assign(max_weight, "200.000").
0.81/1.11	    % set(auto2) -> assign(max_hours, 1).
0.81/1.11	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.81/1.11	    % set(auto2) -> assign(max_seconds, 0).
0.81/1.11	    % set(auto2) -> assign(max_minutes, 5).
0.81/1.11	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.81/1.11	    % set(auto2) -> set(sort_initial_sos).
0.81/1.11	    % set(auto2) -> assign(sos_limit, -1).
0.81/1.11	    % set(auto2) -> assign(lrs_ticks, 3000).
0.81/1.11	    % set(auto2) -> assign(max_megs, 400).
0.81/1.11	    % set(auto2) -> assign(stats, some).
0.81/1.11	    % set(auto2) -> clear(echo_input).
0.81/1.11	    % set(auto2) -> set(quiet).
0.81/1.11	    % set(auto2) -> clear(print_initial_clauses).
0.81/1.11	    % set(auto2) -> clear(print_given).
0.81/1.11	assign(lrs_ticks,-1).
0.81/1.11	assign(sos_limit,10000).
0.81/1.11	assign(order,kbo).
0.81/1.11	set(lex_order_vars).
0.81/1.11	clear(print_given).
0.81/1.11	
0.81/1.11	% formulas(sos).  % not echoed (6 formulas)
0.81/1.11	
0.81/1.11	============================== end of input ==========================
0.81/1.11	
0.81/1.11	% From the command line: assign(max_seconds, 180).
0.81/1.11	
0.81/1.11	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.81/1.11	
0.81/1.11	% Formulas that are not ordinary clauses:
0.81/1.11	1 (all C all B all A mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C)) # label(f03) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	2 (all A A = mult(A,unit)) # label(f01) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	3 (all A mult(i(A),A) = unit) # label(f05) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	4 (all A mult(unit,A) = A) # label(f02) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	5 (all A mult(A,i(A)) = unit) # label(f04) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	6 -(all X6 all X7 all X8 ((mult(X6,X7) = mult(X6,X8) -> X7 = X8) & (mult(X7,X6) = mult(X8,X6) -> X7 = X8))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.81/1.11	
0.81/1.11	============================== end of process non-clausal formulas ===
0.81/1.11	
0.81/1.11	============================== PROCESS INITIAL CLAUSES ===============
0.81/1.11	
0.81/1.11	============================== PREDICATE ELIMINATION =================
0.81/1.11	
0.81/1.11	============================== end predicate elimination =============
0.81/1.11	
0.81/1.11	Auto_denials:  (non-Horn, no changes).
0.81/1.11	
0.81/1.11	Term ordering decisions:
0.81/1.11	
0.81/1.11	% Assigning unary symbol i kb_weight 0 and highest precedence (7).
0.81/1.11	Function symbol KB weights:  unit=1. c1=1. c2=1. c3=1. mult=1. i=0.
0.81/1.11	
0.81/1.11	============================== end of process initial clauses ========
0.81/1.11	
0.81/1.11	============================== CLAUSES FOR SEARCH ====================
0.81/1.11	
0.81/1.11	============================== end of clauses for search =============
0.81/1.11	
0.81/1.11	============================== SEARCH ================================
0.81/1.11	
0.81/1.11	% Starting search at 0.01 seconds.
0.81/1.11	
0.81/1.11	============================== PROOF =================================
0.81/1.11	% SZS status Theorem
0.81/1.11	% SZS output start Refutation
0.81/1.11	
0.81/1.11	% Proof 1 at 0.13 (+ 0.01) seconds.
0.81/1.11	% Length of proof is 47.
0.81/1.11	% Level of proof is 22.
0.81/1.11	% Maximum clause weight is 22.000.
0.81/1.11	% Given clauses 50.
0.81/1.11	
0.81/1.11	1 (all C all B all A mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C)) # label(f03) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	2 (all A A = mult(A,unit)) # label(f01) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	3 (all A mult(i(A),A) = unit) # label(f05) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	4 (all A mult(unit,A) = A) # label(f02) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	5 (all A mult(A,i(A)) = unit) # label(f04) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	6 -(all X6 all X7 all X8 ((mult(X6,X7) = mult(X6,X8) -> X7 = X8) & (mult(X7,X6) = mult(X8,X6) -> X7 = X8))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.81/1.11	7 mult(A,unit) = A # label(f01) # label(axiom).  [clausify(2)].
0.81/1.11	8 mult(unit,A) = A # label(f02) # label(axiom).  [clausify(4)].
0.81/1.11	9 mult(i(A),A) = unit # label(f05) # label(axiom).  [clausify(3)].
0.81/1.11	10 mult(A,i(A)) = unit # label(f04) # label(axiom).  [clausify(5)].
0.81/1.11	11 mult(c1,c3) = mult(c1,c2) | mult(c3,c1) = mult(c2,c1) # label(goals) # label(negated_conjecture).  [clausify(6)].
0.81/1.11	12 mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))) # label(f03) # label(axiom).  [clausify(1)].
0.81/1.11	13 c3 != c2 # label(goals) # label(negated_conjecture).  [clausify(6)].
0.81/1.11	15 mult(mult(A,B),B) = mult(A,mult(B,B)).  [para(12(a,1),7(a,1)),rewrite([7(2)]),flip(a)].
0.81/1.11	16 mult(mult(A,A),B) = mult(A,mult(A,B)).  [para(8(a,1),12(a,1,1,1)),rewrite([8(6)])].
0.81/1.11	17 mult(i(A),mult(A,mult(A,B))) = mult(A,B).  [para(9(a,1),12(a,1,1,1)),rewrite([8(2)]),flip(a)].
0.81/1.11	20 mult(A,mult(B,mult(B,i(mult(A,mult(B,B)))))) = unit.  [para(12(a,1),10(a,1)),rewrite([15(2)])].
0.81/1.11	30 mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))).  [back_rewrite(12),rewrite([15(2)])].
0.81/1.11	36 mult(i(A),mult(A,A)) = A.  [para(9(a,1),15(a,1,1)),rewrite([8(2)]),flip(a)].
0.81/1.11	37 mult(A,mult(i(A),i(A))) = i(A).  [para(10(a,1),15(a,1,1)),rewrite([8(3)]),flip(a)].
0.81/1.11	41 mult(A,mult(A,i(mult(A,A)))) = unit.  [para(16(a,1),10(a,1))].
0.81/1.11	45 mult(A,mult(A,mult(i(mult(A,A)),i(mult(A,A))))) = i(mult(A,A)).  [para(16(a,1),37(a,1))].
0.81/1.11	49 i(i(A)) = A.  [para(36(a,1),17(a,1,2,2)),rewrite([9(4),7(4),36(5)])].
0.81/1.11	54 mult(A,i(mult(A,A))) = i(A).  [para(41(a,1),17(a,1,2)),rewrite([7(3)]),flip(a)].
0.81/1.11	55 mult(A,mult(i(mult(A,A)),i(mult(A,A)))) = mult(i(A),i(mult(A,A))).  [para(54(a,1),15(a,1,1)),flip(a)].
0.81/1.11	57 mult(A,mult(i(A),i(mult(A,A)))) = i(mult(A,A)).  [back_rewrite(45),rewrite([55(6)])].
0.81/1.11	74 i(mult(A,A)) = mult(i(A),i(A)).  [para(57(a,1),17(a,1,2,2)),rewrite([54(4),57(8)]),flip(a)].
0.81/1.11	102 mult(i(A),mult(A,B)) = B.  [para(9(a,1),30(a,1,1)),rewrite([8(2),74(2),16(6),17(5)]),flip(a)].
0.81/1.11	121 mult(c1,c3) = mult(c1,c2) | mult(i(c3),mult(c2,c1)) = c1.  [para(11(b,1),102(a,1,2))].
0.81/1.11	123 mult(i(mult(A,B)),mult(A,mult(B,B))) = B.  [para(15(a,1),102(a,1,2))].
0.81/1.11	124 mult(A,mult(i(A),B)) = B.  [para(49(a,1),102(a,1,1))].
0.81/1.11	125 mult(A,mult(A,i(mult(B,mult(A,A))))) = i(B).  [para(20(a,1),102(a,1,2)),rewrite([7(3)]),flip(a)].
0.81/1.11	173 mult(A,i(mult(B,mult(A,A)))) = mult(i(A),i(B)).  [para(125(a,1),102(a,1,2)),flip(a)].
0.81/1.11	177 mult(A,i(mult(B,mult(A,mult(A,mult(A,A)))))) = mult(i(A),i(mult(B,mult(A,A)))).  [para(15(a,1),173(a,1,2,1)),rewrite([16(3)])].
0.81/1.11	178 i(mult(A,mult(B,B))) = mult(i(B),mult(i(B),i(A))).  [para(173(a,1),16(a,1)),rewrite([74(2),16(5),16(8),177(11),124(11)]),flip(a)].
0.81/1.11	267 i(mult(i(A),mult(i(A),i(B)))) = mult(B,mult(A,A)).  [para(178(a,1),49(a,1,1))].
0.81/1.11	319 i(mult(A,mult(A,i(B)))) = mult(B,mult(i(A),i(A))).  [para(49(a,1),267(a,1,1,1)),rewrite([49(2)])].
0.81/1.11	325 i(mult(A,mult(A,B))) = mult(i(B),mult(i(A),i(A))).  [para(49(a,1),319(a,1,1,2,2))].
0.81/1.11	339 mult(i(mult(A,B)),mult(A,A)) = i(mult(i(A),B)).  [para(102(a,1),325(a,1,1,2)),rewrite([49(7),49(7)]),flip(a)].
0.81/1.11	357 mult(i(mult(i(mult(A,B)),A)),i(mult(i(A),B))) = A.  [para(339(a,1),123(a,1,2))].
0.81/1.11	533 mult(i(mult(i(A),i(B))),i(A)) = B.  [para(102(a,1),357(a,1,2,1)),rewrite([325(3),30(6),9(4),7(4)])].
0.81/1.11	540 mult(c1,c3) = mult(c1,c2) | mult(i(mult(i(mult(c3,mult(c2,c1))),c3)),i(c1)) = c3.  [para(121(b,1),357(a,1,2,1))].
0.81/1.11	615 i(mult(A,i(B))) = mult(B,i(A)).  [para(533(a,1),15(a,1,1)),rewrite([339(10),49(4)]),flip(a)].
0.81/1.11	622 mult(i(mult(A,B)),A) = i(B).  [para(533(a,1),102(a,1,2)),rewrite([615(4),49(2)])].
0.81/1.11	640 mult(mult(A,B),i(B)) = A.  [back_rewrite(533),rewrite([615(4),49(2)])].
0.81/1.11	648 mult(c1,c3) = mult(c1,c2).  [back_rewrite(540),rewrite([622(15),49(12),640(13)]),flip(b),unit_del(b,13)].
0.81/1.11	652 $F.  [para(648(a,1),102(a,1,2)),rewrite([102(6)]),flip(a),unit_del(a,13)].
0.81/1.11	
0.81/1.11	% SZS output end Refutation
0.81/1.11	============================== end of proof ==========================
0.81/1.11	
0.81/1.11	============================== STATISTICS ============================
0.81/1.11	
0.81/1.11	Given=50. Generated=2256. Kept=645. proofs=1.
0.81/1.11	Usable=27. Sos=233. Demods=260. Limbo=1, Disabled=391. Hints=0.
0.81/1.11	Megabytes=1.04.
0.81/1.11	User_CPU=0.13, System_CPU=0.01, Wall_clock=0.
0.81/1.11	
0.81/1.11	============================== end of statistics =====================
0.81/1.11	
0.81/1.11	============================== end of search =========================
0.81/1.11	
0.81/1.11	THEOREM PROVED
0.81/1.11	% SZS status Theorem
0.81/1.11	
0.81/1.11	Exiting with 1 proof.
0.81/1.11	
0.81/1.11	Process 18693 exit (max_proofs) Thu Aug 29 09:46:26 2019
0.81/1.11	Prover9 interrupted
0.81/1.11	EOF