0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.30	% Computer   : n020.cluster.edu
0.10/0.30	% Model      : x86_64 x86_64
0.10/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	% Memory     : 8042.1875MB
0.10/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.30	% CPULimit   : 960
0.10/0.30	% DateTime   : Thu Jul  2 07:08:47 EDT 2020
0.10/0.30	% CPUTime    : 
0.71/1.02	============================== Prover9 ===============================
0.71/1.02	Prover9 (32) version 2009-11A, November 2009.
0.71/1.02	Process 15178 was started by sandbox2 on n020.cluster.edu,
0.71/1.02	Thu Jul  2 07:08:48 2020
0.71/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_14995_n020.cluster.edu".
0.71/1.02	============================== end of head ===========================
0.71/1.02	
0.71/1.02	============================== INPUT =================================
0.71/1.02	
0.71/1.02	% Reading from file /tmp/Prover9_14995_n020.cluster.edu
0.71/1.02	
0.71/1.02	set(prolog_style_variables).
0.71/1.02	set(auto2).
0.71/1.02	    % set(auto2) -> set(auto).
0.71/1.02	    % set(auto) -> set(auto_inference).
0.71/1.02	    % set(auto) -> set(auto_setup).
0.71/1.02	    % set(auto_setup) -> set(predicate_elim).
0.71/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.71/1.02	    % set(auto) -> set(auto_limits).
0.71/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.71/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.71/1.02	    % set(auto) -> set(auto_denials).
0.71/1.02	    % set(auto) -> set(auto_process).
0.71/1.02	    % set(auto2) -> assign(new_constants, 1).
0.71/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.71/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.71/1.02	    % set(auto2) -> assign(max_hours, 1).
0.71/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.71/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.71/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.71/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.71/1.02	    % set(auto2) -> set(sort_initial_sos).
0.71/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.71/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.71/1.02	    % set(auto2) -> assign(max_megs, 400).
0.71/1.02	    % set(auto2) -> assign(stats, some).
0.71/1.02	    % set(auto2) -> clear(echo_input).
0.71/1.02	    % set(auto2) -> set(quiet).
0.71/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.71/1.02	    % set(auto2) -> clear(print_given).
0.71/1.02	assign(lrs_ticks,-1).
0.71/1.02	assign(sos_limit,10000).
0.71/1.02	assign(order,kbo).
0.71/1.02	set(lex_order_vars).
0.71/1.02	clear(print_given).
0.71/1.02	
0.71/1.02	% formulas(sos).  % not echoed (3 formulas)
0.71/1.02	
0.71/1.02	============================== end of input ==========================
0.71/1.02	
0.71/1.02	% From the command line: assign(max_seconds, 960).
0.71/1.02	
0.71/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.71/1.02	
0.71/1.02	% Formulas that are not ordinary clauses:
0.71/1.02	1 (all B (element(B) <-> (exists C (times(B,B) = C & times(B,C) = B)))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.71/1.02	2 (all A all B all C times(B,times(C,A)) = times(times(A,B),C)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.71/1.02	3 -(all A all B (element(B) & element(A) -> element(times(A,B)))) # label(conjecture_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.71/1.02	
0.71/1.02	============================== end of process non-clausal formulas ===
0.71/1.02	
0.71/1.02	============================== PROCESS INITIAL CLAUSES ===============
0.71/1.02	
0.71/1.02	============================== PREDICATE ELIMINATION =================
0.71/1.02	
0.71/1.02	============================== end predicate elimination =============
0.71/1.02	
0.71/1.02	Auto_denials:
0.71/1.02	  % copying label conjecture_1 to answer in negative clause
0.71/1.02	
0.71/1.02	Term ordering decisions:
0.71/1.02	
0.71/1.02	% Assigning unary symbol f1 kb_weight 0 and highest precedence (6).
0.71/1.02	Function symbol KB weights:  c1=1. c2=1. times=1. f1=0.
0.71/1.02	
0.71/1.02	============================== end of process initial clauses ========
0.71/1.02	
0.71/1.02	============================== CLAUSES FOR SEARCH ====================
0.71/1.02	
0.71/1.02	============================== end of clauses for search =============
0.71/1.02	
0.71/1.02	============================== SEARCH ================================
0.71/1.02	
0.71/1.02	% Starting search at 0.01 seconds.
0.71/1.02	
0.71/1.02	============================== PROOF =================================
0.71/1.02	% SZS status Theorem
0.71/1.02	% SZS output start Refutation
0.71/1.02	
0.71/1.02	% Proof 1 at 0.04 (+ 0.00) seconds: conjecture_1.
0.71/1.02	% Length of proof is 29.
0.71/1.02	% Level of proof is 8.
0.71/1.02	% Maximum clause weight is 15.000.
0.71/1.02	% Given clauses 39.
0.71/1.02	
0.71/1.02	1 (all B (element(B) <-> (exists C (times(B,B) = C & times(B,C) = B)))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.71/1.02	2 (all A all B all C times(B,times(C,A)) = times(times(A,B),C)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.71/1.02	3 -(all A all B (element(B) & element(A) -> element(times(A,B)))) # label(conjecture_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.71/1.02	4 element(c2) # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.71/1.02	5 element(c1) # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.71/1.02	6 times(times(A,B),C) = times(B,times(C,A)) # label(axiom_1) # label(axiom).  [clausify(2)].
0.71/1.02	7 -element(times(c1,c2)) # label(conjecture_1) # label(negated_conjecture) # answer(conjecture_1).  [clausify(3)].
0.71/1.02	8 -element(A) | times(A,A) = f1(A) # label(axiom_2) # label(axiom).  [clausify(1)].
0.71/1.02	9 -element(A) | times(A,f1(A)) = A # label(axiom_2) # label(axiom).  [clausify(1)].
0.71/1.02	10 element(A) | times(A,A) != B | times(A,B) != A # label(axiom_2) # label(axiom).  [clausify(1)].
0.71/1.02	11 times(A,times(B,times(C,D))) = times(C,times(D,times(A,B))).  [para(6(a,1),6(a,1,1)),rewrite([6(3),6(3),6(2)])].
0.71/1.02	12 times(c1,c1) = f1(c1).  [hyper(8,a,5,a)].
0.71/1.02	13 times(c2,c2) = f1(c2).  [hyper(8,a,4,a)].
0.71/1.02	14 times(c1,f1(c1)) = c1.  [hyper(9,a,5,a)].
0.71/1.02	15 times(c2,f1(c2)) = c2.  [hyper(9,a,4,a)].
0.71/1.02	16 times(c2,times(f1(c1),times(c2,times(c2,c1)))) != times(c1,c2) # answer(conjecture_1).  [ur(10,a,7,a,b,6,a),rewrite([6(9),12(8),6(10),6(9),6(9),6(8)])].
0.71/1.02	26 times(c2,times(c2,times(c1,times(f1(c1),c2)))) != times(c1,c2) # answer(conjecture_1).  [para(11(a,1),16(a,1,2))].
0.71/1.02	29 times(c1,times(c2,times(f1(c2),f1(c1)))) != times(c1,c2) # answer(conjecture_1).  [para(11(a,1),26(a,1)),rewrite([13(8),6(8)])].
0.71/1.02	30 times(c1,times(A,c1)) = times(f1(c1),A).  [para(12(a,1),6(a,1,1)),flip(a)].
0.71/1.02	32 times(c2,times(A,c2)) = times(f1(c2),A).  [para(13(a,1),6(a,1,1)),flip(a)].
0.71/1.02	34 times(f1(c1),times(A,c1)) = times(c1,A).  [para(14(a,1),6(a,1,1)),flip(a)].
0.71/1.02	36 times(f1(c2),times(A,c2)) = times(c2,A).  [para(15(a,1),6(a,1,1)),flip(a)].
0.71/1.02	56 times(f1(c2),times(f1(c1),times(c1,c2))) != times(c1,c2) # answer(conjecture_1).  [para(11(a,1),29(a,1))].
0.71/1.02	61 times(f1(c1),c1) = c1.  [para(12(a,1),30(a,1,2)),rewrite([14(4)]),flip(a)].
0.71/1.02	116 times(f1(c2),c2) = c2.  [para(13(a,1),32(a,1,2)),rewrite([15(4)]),flip(a)].
0.71/1.02	323 times(A,times(c1,B)) = times(B,times(c1,A)).  [para(34(a,1),6(a,2,2)),rewrite([6(3),6(6),61(5),6(3)])].
0.71/1.02	344 times(f1(c2),times(c2,c1)) != times(c1,c2) # answer(conjecture_1).  [back_rewrite(56),rewrite([323(8),14(7)])].
0.71/1.02	348 times(A,times(c2,B)) = times(B,times(c2,A)).  [para(36(a,1),6(a,2,2)),rewrite([6(3),6(6),116(5),6(3)])].
0.71/1.02	368 $F # answer(conjecture_1).  [back_rewrite(344),rewrite([348(6),15(5)]),xx(a)].
0.71/1.02	
0.71/1.02	% SZS output end Refutation
0.71/1.02	============================== end of proof ==========================
0.71/1.02	
0.71/1.02	============================== STATISTICS ============================
0.71/1.02	
0.71/1.02	Given=39. Generated=641. Kept=364. proofs=1.
0.71/1.02	Usable=33. Sos=290. Demods=64. Limbo=20, Disabled=28. Hints=0.
0.71/1.02	Megabytes=0.45.
0.71/1.02	User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
0.71/1.02	
0.71/1.02	============================== end of statistics =====================
0.71/1.02	
0.71/1.02	============================== end of search =========================
0.71/1.02	
0.71/1.02	THEOREM PROVED
0.71/1.02	% SZS status Theorem
0.71/1.02	
0.71/1.02	Exiting with 1 proof.
0.71/1.02	
0.71/1.02	Process 15178 exit (max_proofs) Thu Jul  2 07:08:48 2020
0.71/1.02	Prover9 interrupted
0.71/1.02	EOF