0.03/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.31	% Computer   : n027.cluster.edu
0.09/0.31	% Model      : x86_64 x86_64
0.09/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.31	% Memory     : 8042.1875MB
0.09/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.31	% CPULimit   : 1200
0.09/0.31	% DateTime   : Tue Jul 13 15:11:40 EDT 2021
0.09/0.31	% CPUTime    : 
0.70/1.04	============================== Prover9 ===============================
0.70/1.04	Prover9 (32) version 2009-11A, November 2009.
0.70/1.04	Process 14897 was started by sandbox2 on n027.cluster.edu,
0.70/1.04	Tue Jul 13 15:11:41 2021
0.70/1.04	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_14743_n027.cluster.edu".
0.70/1.04	============================== end of head ===========================
0.70/1.04	
0.70/1.04	============================== INPUT =================================
0.70/1.04	
0.70/1.04	% Reading from file /tmp/Prover9_14743_n027.cluster.edu
0.70/1.04	
0.70/1.04	set(prolog_style_variables).
0.70/1.04	set(auto2).
0.70/1.04	    % set(auto2) -> set(auto).
0.70/1.04	    % set(auto) -> set(auto_inference).
0.70/1.04	    % set(auto) -> set(auto_setup).
0.70/1.04	    % set(auto_setup) -> set(predicate_elim).
0.70/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.70/1.04	    % set(auto) -> set(auto_limits).
0.70/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.70/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.70/1.04	    % set(auto) -> set(auto_denials).
0.70/1.04	    % set(auto) -> set(auto_process).
0.70/1.04	    % set(auto2) -> assign(new_constants, 1).
0.70/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.70/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.70/1.04	    % set(auto2) -> assign(max_hours, 1).
0.70/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.70/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.70/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.70/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.70/1.04	    % set(auto2) -> set(sort_initial_sos).
0.70/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.70/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.70/1.04	    % set(auto2) -> assign(max_megs, 400).
0.70/1.04	    % set(auto2) -> assign(stats, some).
0.70/1.04	    % set(auto2) -> clear(echo_input).
0.70/1.04	    % set(auto2) -> set(quiet).
0.70/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.70/1.04	    % set(auto2) -> clear(print_given).
0.70/1.04	assign(lrs_ticks,-1).
0.70/1.04	assign(sos_limit,10000).
0.70/1.04	assign(order,kbo).
0.70/1.04	set(lex_order_vars).
0.70/1.04	clear(print_given).
0.70/1.04	
0.70/1.04	% formulas(sos).  % not echoed (9 formulas)
0.70/1.04	
0.70/1.04	============================== end of input ==========================
0.70/1.04	
0.70/1.04	% From the command line: assign(max_seconds, 1200).
0.70/1.04	
0.70/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.70/1.04	
0.70/1.04	% Formulas that are not ordinary clauses:
0.70/1.04	1 (all B all A ld(A,mult(A,B)) = B) # label(f02) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	2 (all B all A A = mult(rd(A,B),B)) # label(f03) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	3 (all A mult(A,unit) = A) # label(f05) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	4 (all X0 all X1 all X2 (mult(X0,mult(X1,X2)) = mult(X0,mult(X2,X1)) & mult(mult(X0,X2),X1) = mult(mult(X0,X1),X2) | mult(X0,mult(X1,X2)) = mult(mult(X0,X2),X1) & mult(X0,mult(X2,X1)) = mult(mult(X0,X1),X2))) # label(f08) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	5 (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.70/1.04	6 (all A mult(unit,A) = A) # label(f06) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	7 (all B all A A = rd(mult(A,B),B)) # label(f04) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	8 (all B all A mult(A,ld(A,B)) = B) # label(f01) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	
0.70/1.04	============================== end of process non-clausal formulas ===
0.70/1.04	
0.70/1.04	============================== PROCESS INITIAL CLAUSES ===============
0.70/1.04	
0.70/1.04	============================== PREDICATE ELIMINATION =================
0.70/1.04	
0.70/1.04	============================== end predicate elimination =============
0.70/1.04	
0.70/1.04	Auto_denials:  (non-Horn, no changes).
0.70/1.04	
0.70/1.04	Term ordering decisions:
0.70/1.04	Function symbol KB weights:  unit=1. a=1. b=1. c=1. mult=1. ld=1. rd=1.
0.70/1.04	
0.70/1.04	============================== end of process initial clauses ========
0.70/1.04	
0.70/1.04	============================== CLAUSES FOR SEARCH ====================
0.70/1.04	
0.70/1.04	============================== end of clauses for search =============
0.70/1.04	
0.70/1.04	============================== SEARCH ================================
0.70/1.04	
0.70/1.04	% Starting search at 0.01 seconds.
0.70/1.04	
0.70/1.04	============================== PROOF =================================
0.70/1.04	% SZS status Theorem
0.70/1.04	% SZS output start Refutation
0.70/1.04	
0.70/1.04	% Proof 1 at 0.05 (+ 0.00) seconds.
0.70/1.04	% Length of proof is 12.
0.70/1.04	% Level of proof is 5.
0.70/1.04	% Maximum clause weight is 22.000.
0.70/1.04	% Given clauses 35.
0.70/1.04	
0.70/1.04	4 (all X0 all X1 all X2 (mult(X0,mult(X1,X2)) = mult(X0,mult(X2,X1)) & mult(mult(X0,X2),X1) = mult(mult(X0,X1),X2) | mult(X0,mult(X1,X2)) = mult(mult(X0,X2),X1) & mult(X0,mult(X2,X1)) = mult(mult(X0,X1),X2))) # label(f08) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	6 (all A mult(unit,A) = A) # label(f06) # label(axiom) # label(non_clause).  [assumption].
0.70/1.04	10 mult(unit,A) = A # label(f06) # label(axiom).  [clausify(6)].
0.70/1.04	16 mult(A,mult(B,C)) = mult(A,mult(C,B)) | mult(mult(A,B),C) = mult(A,mult(C,B)) # label(f08) # label(axiom).  [clausify(4)].
0.70/1.04	19 mult(mult(A,B),C) = mult(mult(A,C),B) | mult(mult(A,C),B) = mult(A,mult(B,C)) # label(f08) # label(axiom).  [clausify(4)].
0.70/1.04	20 mult(a,mult(b,c)) != mult(mult(a,b),c) # label(goals) # label(negated_conjecture).  [assumption].
0.70/1.04	21 mult(mult(a,b),c) != mult(a,mult(b,c)).  [copy(20),flip(a)].
0.70/1.04	37 mult(A,B) = mult(B,A).  [para(10(a,1),16(b,1,1)),rewrite([10(3),10(4),10(7)]),merge(b)].
0.70/1.04	47 mult(c,mult(a,b)) != mult(a,mult(b,c)).  [back_rewrite(21),rewrite([37(5)])].
0.70/1.04	48 mult(A,mult(B,C)) = mult(C,mult(B,A)) | mult(C,mult(B,A)) = mult(B,mult(C,A)).  [back_rewrite(19),rewrite([37(2),37(4),37(7)])].
0.70/1.04	286 mult(A,mult(B,C)) = mult(C,mult(A,B)).  [para(48(b,2),48(a,1)),rewrite([37(3),37(6),37(8),37(11)]),flip(b),merge(b),merge(c)].
0.70/1.04	287 $F.  [resolve(286,a,47,a(flip))].
0.70/1.04	
0.70/1.04	% SZS output end Refutation
0.70/1.04	============================== end of proof ==========================
0.70/1.04	
0.70/1.04	============================== STATISTICS ============================
0.70/1.04	
0.70/1.04	Given=35. Generated=814. Kept=277. proofs=1.
0.70/1.04	Usable=21. Sos=92. Demods=99. Limbo=114, Disabled=61. Hints=0.
0.70/1.04	Megabytes=0.37.
0.70/1.04	User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
0.70/1.04	
0.70/1.04	============================== end of statistics =====================
0.70/1.04	
0.70/1.04	============================== end of search =========================
0.70/1.04	
0.70/1.04	THEOREM PROVED
0.70/1.04	% SZS status Theorem
0.70/1.04	
0.70/1.04	Exiting with 1 proof.
0.70/1.04	
0.70/1.04	Process 14897 exit (max_proofs) Tue Jul 13 15:11:41 2021
0.70/1.04	Prover9 interrupted
0.70/1.04	EOF