0.00/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 : 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.33	% WCLimit  : 120
0.12/0.33	% DateTime : Tue Aug  9 02:21:22 EDT 2022
0.12/0.33	% CPUTime  : 
0.45/1.07	============================== Prover9 ===============================
0.45/1.07	Prover9 (32) version 2009-11A, November 2009.
0.45/1.07	Process 29501 was started by sandbox2 on n024.cluster.edu,
0.45/1.07	Tue Aug  9 02:21:23 2022
0.45/1.07	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_29145_n024.cluster.edu".
0.45/1.07	============================== end of head ===========================
0.45/1.07	
0.45/1.07	============================== INPUT =================================
0.45/1.07	
0.45/1.07	% Reading from file /tmp/Prover9_29145_n024.cluster.edu
0.45/1.07	
0.45/1.07	set(prolog_style_variables).
0.45/1.07	set(auto2).
0.45/1.07	    % set(auto2) -> set(auto).
0.45/1.07	    % set(auto) -> set(auto_inference).
0.45/1.07	    % set(auto) -> set(auto_setup).
0.45/1.07	    % set(auto_setup) -> set(predicate_elim).
0.45/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.45/1.07	    % set(auto) -> set(auto_limits).
0.45/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.45/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.45/1.07	    % set(auto) -> set(auto_denials).
0.45/1.07	    % set(auto) -> set(auto_process).
0.45/1.07	    % set(auto2) -> assign(new_constants, 1).
0.45/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.45/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.45/1.07	    % set(auto2) -> assign(max_hours, 1).
0.45/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.45/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.45/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.45/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.45/1.07	    % set(auto2) -> set(sort_initial_sos).
0.45/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.45/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.45/1.07	    % set(auto2) -> assign(max_megs, 400).
0.45/1.07	    % set(auto2) -> assign(stats, some).
0.45/1.07	    % set(auto2) -> clear(echo_input).
0.45/1.07	    % set(auto2) -> set(quiet).
0.45/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.45/1.07	    % set(auto2) -> clear(print_given).
0.45/1.07	assign(lrs_ticks,-1).
0.45/1.07	assign(sos_limit,10000).
0.45/1.07	assign(order,kbo).
0.45/1.07	set(lex_order_vars).
0.45/1.07	clear(print_given).
0.45/1.07	
0.45/1.07	% formulas(sos).  % not echoed (3 formulas)
0.45/1.07	
0.45/1.07	============================== end of input ==========================
0.45/1.07	
0.45/1.07	% From the command line: assign(max_seconds, 960).
0.45/1.07	
0.45/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.45/1.07	
0.45/1.07	% Formulas that are not ordinary clauses:
0.45/1.07	1 (all B (element(B) <-> (exists C (C = times(B,B) & times(B,C) = B)))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	2 (all A all B all C times(times(A,B),C) = times(B,times(C,A))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	3 -(all A all B all C (element(B) & times(A,B) = C & element(A) -> element(C))) # label(conjecture_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.45/1.07	
0.45/1.07	============================== end of process non-clausal formulas ===
0.45/1.07	
0.45/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.45/1.07	
0.45/1.07	============================== PREDICATE ELIMINATION =================
0.45/1.07	
0.45/1.07	============================== end predicate elimination =============
0.45/1.07	
0.45/1.07	Auto_denials:
0.45/1.07	  % copying label conjecture_1 to answer in negative clause
0.45/1.07	
0.45/1.07	Term ordering decisions:
0.45/1.07	
0.45/1.07	% Assigning unary symbol f1 kb_weight 0 and highest precedence (7).
0.45/1.07	Function symbol KB weights:  c1=1. c2=1. c3=1. times=1. f1=0.
0.45/1.07	
0.45/1.07	============================== end of process initial clauses ========
0.45/1.07	
0.45/1.07	============================== CLAUSES FOR SEARCH ====================
0.45/1.07	
0.45/1.07	============================== end of clauses for search =============
0.45/1.07	
0.45/1.07	============================== SEARCH ================================
0.45/1.07	
0.45/1.07	% Starting search at 0.01 seconds.
0.45/1.07	
0.45/1.07	============================== PROOF =================================
0.45/1.07	% SZS status Theorem
0.45/1.07	% SZS output start Refutation
0.45/1.07	
0.45/1.07	% Proof 1 at 0.05 (+ 0.00) seconds: conjecture_1.
0.45/1.07	% Length of proof is 32.
0.45/1.07	% Level of proof is 9.
0.45/1.07	% Maximum clause weight is 15.000.
0.45/1.07	% Given clauses 40.
0.45/1.07	
0.45/1.07	1 (all B (element(B) <-> (exists C (C = times(B,B) & times(B,C) = B)))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	2 (all A all B all C times(times(A,B),C) = times(B,times(C,A))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	3 -(all A all B all C (element(B) & times(A,B) = C & element(A) -> element(C))) # label(conjecture_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.45/1.07	4 element(c2) # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.45/1.07	5 element(c1) # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.45/1.07	6 times(c1,c2) = c3 # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.45/1.07	7 c3 = times(c1,c2).  [copy(6),flip(a)].
0.45/1.07	8 times(times(A,B),C) = times(B,times(C,A)) # label(axiom_1) # label(axiom).  [clausify(2)].
0.45/1.07	9 -element(c3) # label(conjecture_1) # label(negated_conjecture) # answer(conjecture_1).  [clausify(3)].
0.45/1.07	10 -element(times(c1,c2)) # answer(conjecture_1).  [copy(9),rewrite([7(1)])].
0.45/1.07	11 -element(A) | times(A,A) = f1(A) # label(axiom_2) # label(axiom).  [clausify(1)].
0.45/1.07	12 -element(A) | times(A,f1(A)) = A # label(axiom_2) # label(axiom).  [clausify(1)].
0.45/1.07	13 element(A) | times(A,A) != B | times(A,B) != A # label(axiom_2) # label(axiom).  [clausify(1)].
0.45/1.07	14 times(A,times(B,times(C,D))) = times(C,times(D,times(A,B))).  [para(8(a,1),8(a,1,1)),rewrite([8(3),8(3),8(2)])].
0.45/1.07	15 times(c1,c1) = f1(c1).  [hyper(11,a,5,a)].
0.45/1.07	16 times(c2,c2) = f1(c2).  [hyper(11,a,4,a)].
0.45/1.07	17 times(c1,f1(c1)) = c1.  [hyper(12,a,5,a)].
0.45/1.07	18 times(c2,f1(c2)) = c2.  [hyper(12,a,4,a)].
0.45/1.07	19 times(c2,times(f1(c1),times(c2,times(c2,c1)))) != times(c1,c2) # answer(conjecture_1).  [ur(13,a,10,a,b,8,a),rewrite([8(9),15(8),8(10),8(9),8(9),8(8)])].
0.45/1.07	29 times(c2,times(c2,times(c1,times(f1(c1),c2)))) != times(c1,c2) # answer(conjecture_1).  [para(14(a,1),19(a,1,2))].
0.45/1.07	32 times(c1,times(c2,times(f1(c2),f1(c1)))) != times(c1,c2) # answer(conjecture_1).  [para(14(a,1),29(a,1)),rewrite([16(8),8(8)])].
0.45/1.07	33 times(c1,times(A,c1)) = times(f1(c1),A).  [para(15(a,1),8(a,1,1)),flip(a)].
0.45/1.07	35 times(c2,times(A,c2)) = times(f1(c2),A).  [para(16(a,1),8(a,1,1)),flip(a)].
0.45/1.07	37 times(f1(c1),times(A,c1)) = times(c1,A).  [para(17(a,1),8(a,1,1)),flip(a)].
0.45/1.07	39 times(f1(c2),times(A,c2)) = times(c2,A).  [para(18(a,1),8(a,1,1)),flip(a)].
0.45/1.07	59 times(f1(c2),times(f1(c1),times(c1,c2))) != times(c1,c2) # answer(conjecture_1).  [para(14(a,1),32(a,1))].
0.45/1.07	64 times(f1(c1),c1) = c1.  [para(15(a,1),33(a,1,2)),rewrite([17(4)]),flip(a)].
0.45/1.07	119 times(f1(c2),c2) = c2.  [para(16(a,1),35(a,1,2)),rewrite([18(4)]),flip(a)].
0.45/1.07	326 times(A,times(c1,B)) = times(B,times(c1,A)).  [para(37(a,1),8(a,2,2)),rewrite([8(3),8(6),64(5),8(3)])].
0.45/1.07	347 times(f1(c2),times(c2,c1)) != times(c1,c2) # answer(conjecture_1).  [back_rewrite(59),rewrite([326(8),17(7)])].
0.45/1.07	351 times(A,times(c2,B)) = times(B,times(c2,A)).  [para(39(a,1),8(a,2,2)),rewrite([8(3),8(6),119(5),8(3)])].
0.45/1.07	371 $F # answer(conjecture_1).  [back_rewrite(347),rewrite([351(6),18(5)]),xx(a)].
0.45/1.07	
0.45/1.07	% SZS output end Refutation
0.45/1.07	============================== end of proof ==========================
0.45/1.07	
0.45/1.07	============================== STATISTICS ============================
0.45/1.07	
0.45/1.07	Given=40. Generated=643. Kept=365. proofs=1.
0.45/1.07	Usable=34. Sos=290. Demods=65. Limbo=20, Disabled=29. Hints=0.
0.45/1.07	Megabytes=0.45.
0.45/1.07	User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
0.45/1.07	
0.45/1.07	============================== end of statistics =====================
0.45/1.07	
0.45/1.07	============================== end of search =========================
0.45/1.07	
0.45/1.07	THEOREM PROVED
0.45/1.07	% SZS status Theorem
0.45/1.07	
0.45/1.07	Exiting with 1 proof.
0.45/1.07	
0.45/1.07	Process 29501 exit (max_proofs) Tue Aug  9 02:21:23 2022
0.45/1.07	Prover9 interrupted
0.45/1.07	EOF