0.06/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n024.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.34	% WCLimit  : 120
0.12/0.34	% DateTime : Tue Aug  9 01:55:52 EDT 2022
0.12/0.34	% CPUTime  : 
0.71/1.09	============================== Prover9 ===============================
0.71/1.09	Prover9 (32) version 2009-11A, November 2009.
0.71/1.09	Process 11604 was started by sandbox2 on n024.cluster.edu,
0.71/1.09	Tue Aug  9 01:55:53 2022
0.71/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_11396_n024.cluster.edu".
0.71/1.09	============================== end of head ===========================
0.71/1.09	
0.71/1.09	============================== INPUT =================================
0.71/1.09	
0.71/1.09	% Reading from file /tmp/Prover9_11396_n024.cluster.edu
0.71/1.09	
0.71/1.09	set(prolog_style_variables).
0.71/1.09	set(auto2).
0.71/1.09	    % set(auto2) -> set(auto).
0.71/1.09	    % set(auto) -> set(auto_inference).
0.71/1.09	    % set(auto) -> set(auto_setup).
0.71/1.09	    % set(auto_setup) -> set(predicate_elim).
0.71/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.71/1.09	    % set(auto) -> set(auto_limits).
0.71/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.71/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.71/1.09	    % set(auto) -> set(auto_denials).
0.71/1.09	    % set(auto) -> set(auto_process).
0.71/1.09	    % set(auto2) -> assign(new_constants, 1).
0.71/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.71/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.71/1.09	    % set(auto2) -> assign(max_hours, 1).
0.71/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.71/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.71/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.71/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.71/1.09	    % set(auto2) -> set(sort_initial_sos).
0.71/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.71/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.71/1.09	    % set(auto2) -> assign(max_megs, 400).
0.71/1.09	    % set(auto2) -> assign(stats, some).
0.71/1.09	    % set(auto2) -> clear(echo_input).
0.71/1.09	    % set(auto2) -> set(quiet).
0.71/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.71/1.09	    % set(auto2) -> clear(print_given).
0.71/1.09	assign(lrs_ticks,-1).
0.71/1.09	assign(sos_limit,10000).
0.71/1.09	assign(order,kbo).
0.71/1.09	set(lex_order_vars).
0.71/1.09	clear(print_given).
0.71/1.09	
0.71/1.09	% formulas(sos).  % not echoed (6 formulas)
0.71/1.09	
0.71/1.09	============================== end of input ==========================
0.71/1.09	
0.71/1.09	% From the command line: assign(max_seconds, 960).
0.71/1.09	
0.71/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.71/1.09	
0.71/1.09	% Formulas that are not ordinary clauses:
0.71/1.09	1 (all A mult(A,i(A)) = unit) # label(f04) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	2 (all A mult(unit,A) = A) # label(f02) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	3 (all A A = mult(A,unit)) # label(f01) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	4 (all A mult(i(A),A) = unit) # label(f05) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	5 (all C all B all A mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C)))) # label(f03) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	6 -(all X6 all X7 all X8 ((mult(X6,X7) = mult(X6,X8) -> X8 = X7) & (mult(X8,X6) = mult(X7,X6) -> X8 = X7))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.71/1.09	
0.71/1.09	============================== end of process non-clausal formulas ===
0.71/1.09	
0.71/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.71/1.09	
0.71/1.09	============================== PREDICATE ELIMINATION =================
0.71/1.09	
0.71/1.09	============================== end predicate elimination =============
0.71/1.09	
0.71/1.09	Auto_denials:  (non-Horn, no changes).
0.71/1.09	
0.71/1.09	Term ordering decisions:
0.71/1.09	
0.71/1.09	% Assigning unary symbol i kb_weight 0 and highest precedence (7).
0.71/1.09	Function symbol KB weights:  unit=1. c1=1. c2=1. c3=1. mult=1. i=0.
0.71/1.09	
0.71/1.09	============================== end of process initial clauses ========
0.71/1.09	
0.71/1.09	============================== CLAUSES FOR SEARCH ====================
0.71/1.09	
0.71/1.09	============================== end of clauses for search =============
0.71/1.09	
0.71/1.09	============================== SEARCH ================================
0.71/1.09	
0.71/1.09	% Starting search at 0.01 seconds.
0.71/1.09	
0.71/1.09	============================== PROOF =================================
0.71/1.09	% SZS status Theorem
0.71/1.09	% SZS output start Refutation
0.71/1.09	
0.71/1.09	% Proof 1 at 0.13 (+ 0.01) seconds.
0.71/1.09	% Length of proof is 46.
0.71/1.09	% Level of proof is 21.
0.71/1.09	% Maximum clause weight is 21.000.
0.71/1.09	% Given clauses 50.
0.71/1.09	
0.71/1.09	1 (all A mult(A,i(A)) = unit) # label(f04) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	2 (all A mult(unit,A) = A) # label(f02) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	3 (all A A = mult(A,unit)) # label(f01) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	4 (all A mult(i(A),A) = unit) # label(f05) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	5 (all C all B all A mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C)))) # label(f03) # label(axiom) # label(non_clause).  [assumption].
0.71/1.09	6 -(all X6 all X7 all X8 ((mult(X6,X7) = mult(X6,X8) -> X8 = X7) & (mult(X8,X6) = mult(X7,X6) -> X8 = X7))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
0.71/1.09	7 mult(unit,A) = A # label(f02) # label(axiom).  [clausify(2)].
0.71/1.09	8 mult(A,unit) = A # label(f01) # label(axiom).  [clausify(3)].
0.71/1.09	9 mult(A,i(A)) = unit # label(f04) # label(axiom).  [clausify(1)].
0.71/1.09	10 mult(i(A),A) = unit # label(f05) # label(axiom).  [clausify(4)].
0.71/1.09	11 mult(c1,c3) = mult(c1,c2) | mult(c3,c1) = mult(c2,c1) # label(goals) # label(negated_conjecture).  [clausify(6)].
0.71/1.09	12 mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))) # label(f03) # label(axiom).  [clausify(5)].
0.71/1.09	13 c3 != c2 # label(goals) # label(negated_conjecture).  [clausify(6)].
0.71/1.10	15 mult(mult(A,A),B) = mult(A,mult(A,B)).  [para(7(a,1),12(a,1,1,1)),rewrite([7(6)])].
0.71/1.10	16 mult(mult(A,B),B) = mult(A,mult(B,B)).  [para(12(a,1),8(a,1)),rewrite([8(2)]),flip(a)].
0.71/1.10	17 mult(A,mult(B,mult(B,i(mult(A,mult(B,B)))))) = unit.  [para(12(a,1),9(a,1)),rewrite([16(2)])].
0.71/1.10	20 mult(i(A),mult(A,mult(A,B))) = mult(A,B).  [para(10(a,1),12(a,1,1,1)),rewrite([7(2)]),flip(a)].
0.71/1.10	30 mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))).  [back_rewrite(12),rewrite([16(2)])].
0.71/1.10	36 mult(A,mult(A,i(mult(A,A)))) = unit.  [para(15(a,1),9(a,1))].
0.71/1.10	39 mult(A,mult(i(A),i(A))) = i(A).  [para(9(a,1),16(a,1,1)),rewrite([7(3)]),flip(a)].
0.71/1.10	40 mult(i(A),mult(A,A)) = A.  [para(10(a,1),16(a,1,1)),rewrite([7(2)]),flip(a)].
0.71/1.10	50 mult(A,mult(A,mult(i(mult(A,A)),i(mult(A,A))))) = i(mult(A,A)).  [para(39(a,1),15(a,1)),flip(a)].
0.71/1.10	53 mult(A,i(mult(A,A))) = i(A).  [para(36(a,1),20(a,1,2)),rewrite([8(3)]),flip(a)].
0.71/1.10	56 i(i(A)) = A.  [para(40(a,1),20(a,1,2,2)),rewrite([10(4),8(4),40(5)])].
0.71/1.10	60 mult(A,mult(i(mult(A,A)),i(mult(A,A)))) = mult(i(A),i(mult(A,A))).  [para(53(a,1),16(a,1,1)),flip(a)].
0.71/1.10	61 mult(A,mult(i(A),i(mult(A,A)))) = i(mult(A,A)).  [back_rewrite(50),rewrite([60(6)])].
0.71/1.10	74 i(mult(A,A)) = mult(i(A),i(A)).  [para(61(a,1),20(a,1,2,2)),rewrite([53(4),61(8)]),flip(a)].
0.71/1.10	102 mult(i(A),mult(A,B)) = B.  [para(10(a,1),30(a,1,1)),rewrite([7(2),74(2),15(6),20(5)]),flip(a)].
0.71/1.10	121 mult(c1,c3) = mult(c1,c2) | mult(i(c3),mult(c2,c1)) = c1.  [para(11(b,1),102(a,1,2))].
0.71/1.10	123 mult(i(mult(A,B)),mult(A,mult(B,B))) = B.  [para(16(a,1),102(a,1,2))].
0.71/1.10	124 mult(A,mult(A,i(mult(B,mult(A,A))))) = i(B).  [para(17(a,1),102(a,1,2)),rewrite([8(3)]),flip(a)].
0.71/1.10	173 mult(A,mult(A,i(mult(B,mult(C,mult(C,mult(A,A))))))) = i(mult(B,mult(C,C))).  [para(30(a,1),124(a,1,2,2,1))].
0.71/1.10	174 mult(A,i(mult(B,mult(A,A)))) = mult(i(A),i(B)).  [para(124(a,1),102(a,1,2)),flip(a)].
0.71/1.10	177 i(mult(A,mult(B,B))) = mult(i(B),mult(i(B),i(A))).  [para(174(a,1),15(a,1)),rewrite([74(2),15(5),15(8),173(12)]),flip(a)].
0.71/1.10	267 i(mult(i(A),mult(i(A),i(B)))) = mult(B,mult(A,A)).  [para(177(a,1),56(a,1,1))].
0.71/1.10	319 i(mult(A,mult(A,i(B)))) = mult(B,mult(i(A),i(A))).  [para(56(a,1),267(a,1,1,1)),rewrite([56(2)])].
0.71/1.10	325 i(mult(A,mult(A,B))) = mult(i(B),mult(i(A),i(A))).  [para(56(a,1),319(a,1,1,2,2))].
0.71/1.10	339 mult(i(mult(A,B)),mult(A,A)) = i(mult(i(A),B)).  [para(102(a,1),325(a,1,1,2)),rewrite([56(7),56(7)]),flip(a)].
0.71/1.10	357 mult(i(mult(i(mult(A,B)),A)),i(mult(i(A),B))) = A.  [para(339(a,1),123(a,1,2))].
0.71/1.10	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),10(4),8(4)])].
0.71/1.10	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.71/1.10	580 i(mult(A,i(B))) = mult(B,i(A)).  [para(533(a,1),16(a,1,1)),rewrite([339(10),56(4)]),flip(a)].
0.71/1.10	586 mult(i(mult(A,B)),A) = i(B).  [para(533(a,1),102(a,1,2)),rewrite([580(4),56(2)])].
0.71/1.10	603 mult(mult(A,B),i(B)) = A.  [back_rewrite(533),rewrite([580(4),56(2)])].
0.71/1.10	610 mult(c1,c3) = mult(c1,c2).  [back_rewrite(540),rewrite([586(15),56(12),603(13)]),flip(b),unit_del(b,13)].
0.71/1.10	614 $F.  [para(610(a,1),102(a,1,2)),rewrite([102(6)]),flip(a),unit_del(a,13)].
0.71/1.10	
0.71/1.10	% SZS output end Refutation
0.71/1.10	============================== end of proof ==========================
0.71/1.10	
0.71/1.10	============================== STATISTICS ============================
0.71/1.10	
0.71/1.10	Given=50. Generated=2178. Kept=607. proofs=1.
0.71/1.10	Usable=26. Sos=199. Demods=225. Limbo=1, Disabled=388. Hints=0.
0.71/1.10	Megabytes=0.96.
0.71/1.10	User_CPU=0.13, System_CPU=0.01, Wall_clock=0.
0.71/1.10	
0.71/1.10	============================== end of statistics =====================
0.71/1.10	
0.71/1.10	============================== end of search =========================
0.71/1.10	
0.71/1.10	THEOREM PROVED
0.71/1.10	% SZS status Theorem
0.71/1.10	
0.71/1.10	Exiting with 1 proof.
0.71/1.10	
0.71/1.10	Process 11604 exit (max_proofs) Tue Aug  9 01:55:53 2022
0.71/1.10	Prover9 interrupted
0.71/1.10	EOF