0.02/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.02/0.23	% Computer   : n006.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 04:35:39 CDT 2018
0.02/0.23	% CPUTime    : 
0.07/0.45	============================== Prover9 ===============================
0.07/0.45	Prover9 (32) version 2009-11A, November 2009.
0.07/0.45	Process 55615 was started by sandbox on n006.star.cs.uiowa.edu,
0.07/0.45	Sat Jul 14 04:35:40 2018
0.07/0.45	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_55583_n006.star.cs.uiowa.edu".
0.07/0.45	============================== end of head ===========================
0.07/0.45	
0.07/0.45	============================== INPUT =================================
0.07/0.45	
0.07/0.45	% Reading from file /tmp/Prover9_55583_n006.star.cs.uiowa.edu
0.07/0.45	
0.07/0.45	set(prolog_style_variables).
0.07/0.45	set(auto2).
0.07/0.45	    % set(auto2) -> set(auto).
0.07/0.45	    % set(auto) -> set(auto_inference).
0.07/0.45	    % set(auto) -> set(auto_setup).
0.07/0.45	    % set(auto_setup) -> set(predicate_elim).
0.07/0.45	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.45	    % set(auto) -> set(auto_limits).
0.07/0.45	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.45	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.45	    % set(auto) -> set(auto_denials).
0.07/0.45	    % set(auto) -> set(auto_process).
0.07/0.45	    % set(auto2) -> assign(new_constants, 1).
0.07/0.45	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.45	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.45	    % set(auto2) -> assign(max_hours, 1).
0.07/0.45	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.45	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.45	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.45	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.45	    % set(auto2) -> set(sort_initial_sos).
0.07/0.45	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.45	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.45	    % set(auto2) -> assign(max_megs, 400).
0.07/0.45	    % set(auto2) -> assign(stats, some).
0.07/0.45	    % set(auto2) -> clear(echo_input).
0.07/0.45	    % set(auto2) -> set(quiet).
0.07/0.45	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.45	    % set(auto2) -> clear(print_given).
0.07/0.45	assign(lrs_ticks,-1).
0.07/0.45	assign(sos_limit,10000).
0.07/0.45	assign(order,kbo).
0.07/0.45	set(lex_order_vars).
0.07/0.45	clear(print_given).
0.07/0.45	
0.07/0.45	% formulas(sos).  % not echoed (3 formulas)
0.07/0.45	
0.07/0.45	============================== end of input ==========================
0.07/0.45	
0.07/0.45	% From the command line: assign(max_seconds, 300).
0.07/0.45	
0.07/0.45	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.45	
0.07/0.45	% Formulas that are not ordinary clauses:
0.07/0.45	1 (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.07/0.45	2 (all B (element(B) <-> (exists C (times(B,B) = C & B = times(B,C))))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	3 -(all A all B all C (element(A) & element(B) & C = times(A,B) -> element(C))) # label(conjecture_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.45	
0.07/0.45	============================== end of process non-clausal formulas ===
0.07/0.45	
0.07/0.45	============================== PROCESS INITIAL CLAUSES ===============
0.07/0.45	
0.07/0.45	============================== PREDICATE ELIMINATION =================
0.07/0.45	
0.07/0.45	============================== end predicate elimination =============
0.07/0.45	
0.07/0.45	Auto_denials:
0.07/0.45	  % copying label conjecture_1 to answer in negative clause
0.07/0.45	
0.07/0.45	Term ordering decisions:
0.07/0.45	
0.07/0.45	% Assigning unary symbol f1 kb_weight 0 and highest precedence (7).
0.07/0.45	Function symbol KB weights:  c1=1. c2=1. c3=1. times=1. f1=0.
0.07/0.45	
0.07/0.45	============================== end of process initial clauses ========
0.07/0.45	
0.07/0.45	============================== CLAUSES FOR SEARCH ====================
0.07/0.45	
0.07/0.45	============================== end of clauses for search =============
0.07/0.45	
0.07/0.45	============================== SEARCH ================================
0.07/0.45	
0.07/0.45	% Starting search at 0.01 seconds.
0.07/0.45	
0.07/0.45	============================== PROOF =================================
0.07/0.45	% SZS status Theorem
0.07/0.45	% SZS output start Refutation
0.07/0.45	
0.07/0.45	% Proof 1 at 0.03 (+ 0.00) seconds: conjecture_1.
0.07/0.45	% Length of proof is 31.
0.07/0.45	% Level of proof is 8.
0.07/0.45	% Maximum clause weight is 15.000.
0.07/0.45	% Given clauses 40.
0.07/0.45	
0.07/0.45	1 (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.07/0.45	2 (all B (element(B) <-> (exists C (times(B,B) = C & B = times(B,C))))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	3 -(all A all B all C (element(A) & element(B) & C = times(A,B) -> element(C))) # label(conjecture_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.45	4 element(c1) # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.07/0.45	5 element(c2) # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.07/0.45	6 times(c1,c2) = c3 # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.07/0.45	7 c3 = times(c1,c2).  [copy(6),flip(a)].
0.07/0.45	8 times(times(A,B),C) = times(B,times(C,A)) # label(axiom_1) # label(axiom).  [clausify(1)].
0.07/0.45	9 -element(c3) # label(conjecture_1) # label(negated_conjecture) # answer(conjecture_1).  [clausify(3)].
0.07/0.45	10 -element(times(c1,c2)) # answer(conjecture_1).  [copy(9),rewrite([7(1)])].
0.07/0.45	11 -element(A) | times(A,A) = f1(A) # label(axiom_2) # label(axiom).  [clausify(2)].
0.07/0.45	12 -element(A) | times(A,f1(A)) = A # label(axiom_2) # label(axiom).  [clausify(2)].
0.07/0.45	13 element(A) | times(A,A) != B | times(A,B) != A # label(axiom_2) # label(axiom).  [clausify(2)].
0.07/0.45	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.07/0.45	15 times(c2,c2) = f1(c2).  [hyper(11,a,5,a)].
0.07/0.45	16 times(c1,c1) = f1(c1).  [hyper(11,a,4,a)].
0.07/0.45	17 times(c2,f1(c2)) = c2.  [hyper(12,a,5,a)].
0.07/0.45	18 times(c1,f1(c1)) = c1.  [hyper(12,a,4,a)].
0.07/0.45	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),16(8),8(10),8(9),8(9),8(8)])].
0.07/0.45	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.07/0.45	32 times(c1,times(c2,times(f1(c2),f1(c1)))) != times(c1,c2) # answer(conjecture_1).  [para(14(a,1),29(a,1)),rewrite([15(8),8(8)])].
0.07/0.45	33 times(c2,times(A,c2)) = times(f1(c2),A).  [para(15(a,1),8(a,1,1)),flip(a)].
0.07/0.45	35 times(c1,times(A,c1)) = times(f1(c1),A).  [para(16(a,1),8(a,1,1)),flip(a)].
0.07/0.45	37 times(f1(c2),times(A,c2)) = times(c2,A).  [para(17(a,1),8(a,1,1)),flip(a)].
0.07/0.45	39 times(f1(c1),times(A,c1)) = times(c1,A).  [para(18(a,1),8(a,1,1)),flip(a)].
0.07/0.45	59 times(f1(c2),times(f1(c1),times(c1,c2))) != times(c1,c2) # answer(conjecture_1).  [para(14(a,1),32(a,1))].
0.07/0.45	64 times(f1(c2),c2) = c2.  [para(15(a,1),33(a,1,2)),rewrite([17(4)]),flip(a)].
0.07/0.45	119 times(f1(c1),c1) = c1.  [para(16(a,1),35(a,1,2)),rewrite([18(4)]),flip(a)].
0.07/0.45	327 times(A,times(c2,B)) = times(B,times(c2,A)).  [para(37(a,1),8(a,2,2)),rewrite([8(3),8(6),64(5),8(3)])].
0.07/0.45	350 times(A,times(c1,B)) = times(B,times(c1,A)).  [para(39(a,1),8(a,2,2)),rewrite([8(3),8(6),119(5),8(3)])].
0.07/0.45	371 $F # answer(conjecture_1).  [back_rewrite(59),rewrite([350(8),18(7),327(6),17(5)]),xx(a)].
0.07/0.45	
0.07/0.45	% SZS output end Refutation
0.07/0.45	============================== end of proof ==========================
0.07/0.45	
0.07/0.45	============================== STATISTICS ============================
0.07/0.45	
0.07/0.45	Given=40. Generated=642. Kept=365. proofs=1.
0.07/0.45	Usable=34. Sos=289. Demods=64. Limbo=21, Disabled=29. Hints=0.
0.07/0.45	Megabytes=0.45.
0.07/0.45	User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
0.07/0.45	
0.07/0.45	============================== end of statistics =====================
0.07/0.45	
0.07/0.45	============================== end of search =========================
0.07/0.45	
0.07/0.45	THEOREM PROVED
0.07/0.45	% SZS status Theorem
0.07/0.45	
0.07/0.45	Exiting with 1 proof.
0.07/0.45	
0.07/0.45	Process 55615 exit (max_proofs) Sat Jul 14 04:35:40 2018
0.07/0.45	Prover9 interrupted
0.07/0.46	EOF