0.02/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n027.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	% WCLimit  : 120
0.12/0.33	% DateTime : Tue Aug  9 02:39:06 EDT 2022
0.12/0.33	% CPUTime  : 
0.69/0.99	============================== Prover9 ===============================
0.69/0.99	Prover9 (32) version 2009-11A, November 2009.
0.69/0.99	Process 7635 was started by sandbox on n027.cluster.edu,
0.69/0.99	Tue Aug  9 02:39:06 2022
0.69/0.99	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_7482_n027.cluster.edu".
0.69/0.99	============================== end of head ===========================
0.69/0.99	
0.69/0.99	============================== INPUT =================================
0.69/0.99	
0.69/0.99	% Reading from file /tmp/Prover9_7482_n027.cluster.edu
0.69/0.99	
0.69/0.99	set(prolog_style_variables).
0.69/0.99	set(auto2).
0.69/0.99	    % set(auto2) -> set(auto).
0.69/0.99	    % set(auto) -> set(auto_inference).
0.69/0.99	    % set(auto) -> set(auto_setup).
0.69/0.99	    % set(auto_setup) -> set(predicate_elim).
0.69/0.99	    % set(auto_setup) -> assign(eq_defs, unfold).
0.69/0.99	    % set(auto) -> set(auto_limits).
0.69/0.99	    % set(auto_limits) -> assign(max_weight, "100.000").
0.69/0.99	    % set(auto_limits) -> assign(sos_limit, 20000).
0.69/0.99	    % set(auto) -> set(auto_denials).
0.69/0.99	    % set(auto) -> set(auto_process).
0.69/0.99	    % set(auto2) -> assign(new_constants, 1).
0.69/0.99	    % set(auto2) -> assign(fold_denial_max, 3).
0.69/0.99	    % set(auto2) -> assign(max_weight, "200.000").
0.69/0.99	    % set(auto2) -> assign(max_hours, 1).
0.69/0.99	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.69/0.99	    % set(auto2) -> assign(max_seconds, 0).
0.69/0.99	    % set(auto2) -> assign(max_minutes, 5).
0.69/0.99	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.69/0.99	    % set(auto2) -> set(sort_initial_sos).
0.69/0.99	    % set(auto2) -> assign(sos_limit, -1).
0.69/0.99	    % set(auto2) -> assign(lrs_ticks, 3000).
0.69/0.99	    % set(auto2) -> assign(max_megs, 400).
0.69/0.99	    % set(auto2) -> assign(stats, some).
0.69/0.99	    % set(auto2) -> clear(echo_input).
0.69/0.99	    % set(auto2) -> set(quiet).
0.69/0.99	    % set(auto2) -> clear(print_initial_clauses).
0.69/0.99	    % set(auto2) -> clear(print_given).
0.69/0.99	assign(lrs_ticks,-1).
0.69/0.99	assign(sos_limit,10000).
0.69/0.99	assign(order,kbo).
0.69/0.99	set(lex_order_vars).
0.69/0.99	clear(print_given).
0.69/0.99	
0.69/0.99	% formulas(sos).  % not echoed (9 formulas)
0.69/0.99	
0.69/0.99	============================== end of input ==========================
0.69/0.99	
0.69/0.99	% From the command line: assign(max_seconds, 960).
0.69/0.99	
0.69/0.99	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.69/0.99	
0.69/0.99	% Formulas that are not ordinary clauses:
0.69/0.99	1 (all C all B all A mult(A,mult(mult(B,C),B)) = mult(mult(mult(A,B),C),B)) # label(f07) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	2 (all X0 all X1 all X2 (mult(mult(X0,X2),X1) = mult(mult(X0,X1),X2) & mult(X0,mult(X2,X1)) = mult(X0,mult(X1,X2)) | mult(mult(X0,X1),X2) = mult(X0,mult(X2,X1)) & mult(mult(X0,X2),X1) = mult(X0,mult(X1,X2)))) # label(f08) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	3 (all B all A mult(rd(A,B),B) = A) # label(f03) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	4 (all B all A rd(mult(A,B),B) = A) # label(f04) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	5 (all A mult(unit,A) = A) # label(f06) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	6 (all B all A mult(A,ld(A,B)) = B) # label(f01) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	7 (all B all A B = ld(A,mult(A,B))) # label(f02) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	8 (all A A = mult(A,unit)) # label(f05) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	
0.69/0.99	============================== end of process non-clausal formulas ===
0.69/0.99	
0.69/0.99	============================== PROCESS INITIAL CLAUSES ===============
0.69/0.99	
0.69/0.99	============================== PREDICATE ELIMINATION =================
0.69/0.99	
0.69/0.99	============================== end predicate elimination =============
0.69/0.99	
0.69/0.99	Auto_denials:  (non-Horn, no changes).
0.69/0.99	
0.69/0.99	Term ordering decisions:
0.69/0.99	Function symbol KB weights:  unit=1. a=1. b=1. c=1. mult=1. ld=1. rd=1.
0.69/0.99	
0.69/0.99	============================== end of process initial clauses ========
0.69/0.99	
0.69/0.99	============================== CLAUSES FOR SEARCH ====================
0.69/0.99	
0.69/0.99	============================== end of clauses for search =============
0.69/0.99	
0.69/0.99	============================== SEARCH ================================
0.69/0.99	
0.69/0.99	% Starting search at 0.01 seconds.
0.69/0.99	
0.69/0.99	============================== PROOF =================================
0.69/0.99	% SZS status Theorem
0.69/0.99	% SZS output start Refutation
0.69/0.99	
0.69/0.99	% Proof 1 at 0.04 (+ 0.00) seconds.
0.69/0.99	% Length of proof is 17.
0.69/0.99	% Level of proof is 6.
0.69/0.99	% Maximum clause weight is 30.000.
0.69/0.99	% Given clauses 29.
0.69/0.99	
0.69/0.99	2 (all X0 all X1 all X2 (mult(mult(X0,X2),X1) = mult(mult(X0,X1),X2) & mult(X0,mult(X2,X1)) = mult(X0,mult(X1,X2)) | mult(mult(X0,X1),X2) = mult(X0,mult(X2,X1)) & mult(mult(X0,X2),X1) = mult(X0,mult(X1,X2)))) # label(f08) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	5 (all A mult(unit,A) = A) # label(f06) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	6 (all B all A mult(A,ld(A,B)) = B) # label(f01) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	7 (all B all A B = ld(A,mult(A,B))) # label(f02) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	9 mult(unit,A) = A # label(f06) # label(axiom).  [clausify(5)].
0.69/0.99	13 mult(A,ld(A,B)) = B # label(f01) # label(axiom).  [clausify(6)].
0.69/0.99	14 ld(A,mult(A,B)) = B # label(f02) # label(axiom).  [clausify(7)].
0.69/0.99	17 mult(mult(A,B),C) = mult(mult(A,C),B) | mult(mult(A,B),C) = mult(A,mult(C,B)) # label(f08) # label(axiom).  [clausify(2)].
0.69/0.99	20 mult(a,mult(b,c)) != mult(mult(a,b),c) # label(goals) # label(negated_conjecture).  [assumption].
0.69/0.99	21 mult(mult(a,b),c) != mult(a,mult(b,c)).  [copy(20),flip(a)].
0.69/0.99	64 mult(A,B) = mult(B,A).  [para(9(a,1),17(a,1,1)),rewrite([9(3),9(5),9(7)]),merge(b)].
0.69/0.99	69 mult(A,mult(B,ld(mult(A,B),C))) = C | mult(B,mult(A,ld(mult(A,B),C))) = C.  [para(17(a,1),13(a,1)),rewrite([13(4),64(3),64(9)]),flip(a)].
0.69/0.99	70 mult(A,mult(B,ld(mult(B,A),C))) = mult(B,mult(A,ld(mult(B,A),C))) | mult(A,mult(B,ld(mult(B,A),C))) = C.  [para(17(a,2),13(a,1)),rewrite([64(4),64(13)])].
0.69/0.99	111 mult(c,mult(a,b)) != mult(a,mult(b,c)).  [back_rewrite(21),rewrite([64(5)])].
0.69/0.99	158 mult(A,mult(B,ld(mult(A,B),C))) = C.  [para(70(a,2),69(a,1)),rewrite([64(1),64(6),64(11)]),merge(b),merge(c)].
0.69/0.99	170 mult(A,mult(B,C)) = mult(C,mult(A,B)).  [para(14(a,1),158(a,1,2,2)),rewrite([64(4)])].
0.69/0.99	171 $F.  [resolve(170,a,111,a(flip))].
0.69/0.99	
0.69/0.99	% SZS output end Refutation
0.69/0.99	============================== end of proof ==========================
0.69/0.99	
0.69/0.99	============================== STATISTICS ============================
0.69/0.99	
0.69/0.99	Given=29. Generated=494. Kept=161. proofs=1.
0.69/0.99	Usable=13. Sos=57. Demods=29. Limbo=3, Disabled=99. Hints=0.
0.69/0.99	Megabytes=0.19.
0.69/0.99	User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
0.69/0.99	
0.69/0.99	============================== end of statistics =====================
0.69/0.99	
0.69/0.99	============================== end of search =========================
0.69/0.99	
0.69/0.99	THEOREM PROVED
0.69/0.99	% SZS status Theorem
0.69/0.99	
0.69/0.99	Exiting with 1 proof.
0.69/0.99	
0.69/0.99	Process 7635 exit (max_proofs) Tue Aug  9 02:39:06 2022
0.69/0.99	Prover9 interrupted
0.69/0.99	EOF