0.11/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 : n007.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.34	% CPULimit : 1440
0.12/0.34	% WCLimit  : 180
0.12/0.34	% DateTime : Mon Jul  3 04:01:42 EDT 2023
0.19/0.34	% CPUTime  : 
0.44/1.00	============================== Prover9 ===============================
0.44/1.00	Prover9 (32) version 2009-11A, November 2009.
0.44/1.00	Process 26060 was started by sandbox on n007.cluster.edu,
0.44/1.00	Mon Jul  3 04:01:43 2023
0.44/1.00	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_25907_n007.cluster.edu".
0.44/1.00	============================== end of head ===========================
0.44/1.00	
0.44/1.00	============================== INPUT =================================
0.44/1.00	
0.44/1.00	% Reading from file /tmp/Prover9_25907_n007.cluster.edu
0.44/1.00	
0.44/1.00	set(prolog_style_variables).
0.44/1.00	set(auto2).
0.44/1.00	    % set(auto2) -> set(auto).
0.44/1.00	    % set(auto) -> set(auto_inference).
0.44/1.00	    % set(auto) -> set(auto_setup).
0.44/1.00	    % set(auto_setup) -> set(predicate_elim).
0.44/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.00	    % set(auto) -> set(auto_limits).
0.44/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.00	    % set(auto) -> set(auto_denials).
0.44/1.00	    % set(auto) -> set(auto_process).
0.44/1.00	    % set(auto2) -> assign(new_constants, 1).
0.44/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.00	    % set(auto2) -> assign(max_hours, 1).
0.44/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.00	    % set(auto2) -> set(sort_initial_sos).
0.44/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.00	    % set(auto2) -> assign(max_megs, 400).
0.44/1.00	    % set(auto2) -> assign(stats, some).
0.44/1.00	    % set(auto2) -> clear(echo_input).
0.44/1.00	    % set(auto2) -> set(quiet).
0.44/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.00	    % set(auto2) -> clear(print_given).
0.44/1.00	assign(lrs_ticks,-1).
0.44/1.00	assign(sos_limit,10000).
0.44/1.00	assign(order,kbo).
0.44/1.00	set(lex_order_vars).
0.44/1.00	clear(print_given).
0.44/1.00	
0.44/1.00	% formulas(sos).  % not echoed (3 formulas)
0.44/1.00	
0.44/1.00	============================== end of input ==========================
0.44/1.00	
0.44/1.00	% From the command line: assign(max_seconds, 1440).
0.44/1.00	
0.44/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.00	
0.44/1.00	% Formulas that are not ordinary clauses:
0.44/1.00	1 (all B ((exists C (B = times(B,C) & C = times(B,B))) <-> element(B))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.00	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.44/1.00	3 -(all A all B (element(B) & element(A) -> element(times(A,B)))) # label(conjecture_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.00	
0.44/1.00	============================== end of process non-clausal formulas ===
0.44/1.00	
0.44/1.00	============================== PROCESS INITIAL CLAUSES ===============
0.44/1.00	
0.44/1.00	============================== PREDICATE ELIMINATION =================
0.44/1.00	
0.44/1.00	============================== end predicate elimination =============
0.44/1.00	
0.44/1.00	Auto_denials:
0.44/1.00	  % copying label conjecture_1 to answer in negative clause
0.44/1.00	
0.44/1.00	Term ordering decisions:
0.44/1.00	
0.44/1.00	% Assigning unary symbol f1 kb_weight 0 and highest precedence (6).
0.44/1.00	Function symbol KB weights:  c1=1. c2=1. times=1. f1=0.
0.44/1.00	
0.44/1.00	============================== end of process initial clauses ========
0.44/1.00	
0.44/1.00	============================== CLAUSES FOR SEARCH ====================
0.44/1.00	
0.44/1.00	============================== end of clauses for search =============
0.44/1.00	
0.44/1.00	============================== SEARCH ================================
0.44/1.00	
0.44/1.00	% Starting search at 0.01 seconds.
0.44/1.00	
0.44/1.00	============================== PROOF =================================
0.44/1.00	% SZS status Theorem
0.44/1.00	% SZS output start Refutation
0.44/1.00	
0.44/1.00	% Proof 1 at 0.02 (+ 0.00) seconds: conjecture_1.
0.44/1.00	% Length of proof is 21.
0.44/1.00	% Level of proof is 5.
0.44/1.00	% Maximum clause weight is 22.000.
0.44/1.00	% Given clauses 28.
0.44/1.00	
0.44/1.00	1 (all B ((exists C (B = times(B,C) & C = times(B,B))) <-> element(B))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.00	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.44/1.00	3 -(all A all B (element(B) & element(A) -> element(times(A,B)))) # label(conjecture_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.00	4 element(c2) # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.44/1.00	5 element(c1) # label(conjecture_1) # label(negated_conjecture).  [clausify(3)].
0.44/1.00	6 times(times(A,B),C) = times(B,times(C,A)) # label(axiom_1) # label(axiom).  [clausify(2)].
0.44/1.00	7 -element(times(c1,c2)) # label(conjecture_1) # label(negated_conjecture) # answer(conjecture_1).  [clausify(3)].
0.44/1.00	8 times(A,f1(A)) = A | -element(A) # label(axiom_2) # label(axiom).  [clausify(1)].
0.44/1.00	9 times(A,A) = f1(A) | -element(A) # label(axiom_2) # label(axiom).  [clausify(1)].
0.44/1.00	10 times(A,B) != A | times(A,A) != B | element(A) # label(axiom_2) # label(axiom).  [clausify(1)].
0.44/1.00	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.44/1.00	12 times(c1,f1(c1)) = c1.  [hyper(8,b,5,a)].
0.44/1.00	13 times(c2,f1(c2)) = c2.  [hyper(8,b,4,a)].
0.44/1.00	14 times(c1,c1) = f1(c1).  [hyper(9,b,5,a)].
0.44/1.00	15 times(c2,c2) = f1(c2).  [hyper(9,b,4,a)].
0.44/1.00	17 times(A,times(B,C)) != times(C,A) | times(A,times(A,times(C,C))) != B | element(times(C,A)).  [para(6(a,1),10(a,1)),rewrite([6(7),6(6)])].
0.44/1.00	18 times(A,times(B,times(C,times(D,E)))) = times(D,times(B,times(E,times(A,C)))).  [para(11(a,1),6(a,1,1)),rewrite([6(4),6(4),6(3),6(4),6(3),6(3),6(2),6(8),6(7),6(8),6(7),6(7),6(6)])].
0.44/1.00	30 times(f1(c1),times(A,c1)) = times(c1,A).  [para(12(a,1),6(a,1,1)),flip(a)].
0.44/1.00	32 times(f1(c2),times(A,c2)) = times(c2,A).  [para(13(a,1),6(a,1,1)),flip(a)].
0.44/1.00	89 times(c2,times(A,times(f1(c2),times(B,C)))) = times(B,times(A,times(C,c2))).  [para(13(a,1),18(a,1,2,2,2)),flip(a)].
0.44/1.00	107 $F # answer(conjecture_1).  [ur(17,b,32,a(flip),c,7,a),rewrite([14(7),6(9),15(8),6(11),6(11),6(10),89(12),32(8),30(6)]),xx(a)].
0.44/1.00	
0.44/1.00	% SZS output end Refutation
0.44/1.00	============================== end of proof ==========================
0.44/1.00	
0.44/1.00	============================== STATISTICS ============================
0.44/1.00	
0.44/1.00	Given=28. Generated=211. Kept=103. proofs=1.
0.44/1.00	Usable=26. Sos=70. Demods=26. Limbo=0, Disabled=14. Hints=0.
0.44/1.00	Megabytes=0.15.
0.44/1.00	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.44/1.00	
0.44/1.00	============================== end of statistics =====================
0.44/1.00	
0.44/1.00	============================== end of search =========================
0.44/1.00	
0.44/1.00	THEOREM PROVED
0.44/1.00	% SZS status Theorem
0.44/1.00	
0.44/1.00	Exiting with 1 proof.
0.44/1.00	
0.44/1.00	Process 26060 exit (max_proofs) Mon Jul  3 04:01:43 2023
0.44/1.00	Prover9 interrupted
0.75/1.00	EOF