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