0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n021.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% DateTime   : Thu Jul  2 06:54:37 EDT 2020
0.13/0.34	% CPUTime    : 
0.76/1.03	============================== Prover9 ===============================
0.76/1.03	Prover9 (32) version 2009-11A, November 2009.
0.76/1.03	Process 7244 was started by sandbox2 on n021.cluster.edu,
0.76/1.03	Thu Jul  2 06:54:38 2020
0.76/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_7091_n021.cluster.edu".
0.76/1.03	============================== end of head ===========================
0.76/1.03	
0.76/1.03	============================== INPUT =================================
0.76/1.03	
0.76/1.03	% Reading from file /tmp/Prover9_7091_n021.cluster.edu
0.76/1.03	
0.76/1.03	set(prolog_style_variables).
0.76/1.03	set(auto2).
0.76/1.03	    % set(auto2) -> set(auto).
0.76/1.03	    % set(auto) -> set(auto_inference).
0.76/1.03	    % set(auto) -> set(auto_setup).
0.76/1.03	    % set(auto_setup) -> set(predicate_elim).
0.76/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.76/1.03	    % set(auto) -> set(auto_limits).
0.76/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.76/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.76/1.03	    % set(auto) -> set(auto_denials).
0.76/1.03	    % set(auto) -> set(auto_process).
0.76/1.03	    % set(auto2) -> assign(new_constants, 1).
0.76/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.76/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.76/1.03	    % set(auto2) -> assign(max_hours, 1).
0.76/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.76/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.76/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.76/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.76/1.03	    % set(auto2) -> set(sort_initial_sos).
0.76/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.76/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.76/1.03	    % set(auto2) -> assign(max_megs, 400).
0.76/1.03	    % set(auto2) -> assign(stats, some).
0.76/1.03	    % set(auto2) -> clear(echo_input).
0.76/1.03	    % set(auto2) -> set(quiet).
0.76/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.76/1.03	    % set(auto2) -> clear(print_given).
0.76/1.03	assign(lrs_ticks,-1).
0.76/1.03	assign(sos_limit,10000).
0.76/1.03	assign(order,kbo).
0.76/1.03	set(lex_order_vars).
0.76/1.03	clear(print_given).
0.76/1.03	
0.76/1.03	% formulas(sos).  % not echoed (19 formulas)
0.76/1.03	
0.76/1.03	============================== end of input ==========================
0.76/1.03	
0.76/1.03	% From the command line: assign(max_seconds, 960).
0.76/1.03	
0.76/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.76/1.03	
0.76/1.03	% Formulas that are not ordinary clauses:
0.76/1.03	1 (all X26 all X27 (-id(X26,X27) | -r1(X27) & -r1(X26) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	2 (all X16 all X17 exists Y23 all X18 (-r4(X16,X17,X18) & -id(X18,Y23) | r4(X16,X17,X18) & id(X18,Y23))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	3 (all X2 all X9 exists Y2 ((exists Y3 (id(Y3,Y2) & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))) & (exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	4 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X39,X42) | r4(X38,X39,X40) & r4(X41,X42,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | -id(X40,X43) | -id(X38,X41))) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	5 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -id(X19,Y24) & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	6 (all X6 ((exists Y19 (r1(Y19) & id(X6,Y19))) | (exists Y1 exists Y11 (r2(Y1,Y11) & id(X6,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	7 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	8 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | -id(Y13,Y12))) | -r2(X10,Y12))) | id(X3,X10))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	9 (all X7 all Y10 ((all Y20 (-id(Y20,Y10) | -r1(Y20))) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	10 (all X28 all X29 all X30 all X31 (-r2(X30,X31) & -r2(X28,X29) | r2(X28,X29) & r2(X30,X31) | -id(X29,X31) | -id(X28,X30))) # label(axiom_9) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	11 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & id(Y8,Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	12 (all X11 exists Y21 all X12 (-id(X12,Y21) & -r2(X11,X12) | id(X12,Y21) & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	13 (all X32 all X33 all X34 all X35 all X36 all X37 (r3(X32,X33,X34) & r3(X35,X36,X37) | -r3(X35,X36,X37) & -r3(X32,X33,X34) | -id(X32,X35) | -id(X33,X36) | -id(X34,X37))) # label(axiom_10) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	14 (all X13 all X14 exists Y22 all X15 (id(X15,Y22) & r3(X13,X14,X15) | -id(X15,Y22) & -r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	15 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	16 (all X23 all X24 all X25 (-id(X24,X25) | id(X23,X25) | -id(X23,X24))) # label(axiom_7) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	17 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	18 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	19 -(exists Y1 ((exists Y2 ((exists Y5 (r1(Y5) & r2(Y5,Y2))) & (exists Y4 (r3(Y2,Y4,Y1) & r1(Y4))))) & (exists Y3 (id(Y1,Y3) & (exists Y6 (r1(Y6) & r2(Y6,Y3))))))) # label(onepluszeroidone) # label(negated_conjecture) # label(non_clause).  [assumption].
0.76/1.04	
0.76/1.04	============================== end of process non-clausal formulas ===
0.76/1.04	
0.76/1.04	============================== PROCESS INITIAL CLAUSES ===============
0.76/1.04	
0.76/1.04	============================== PREDICATE ELIMINATION =================
0.76/1.04	
0.76/1.04	============================== end predicate elimination =============
0.76/1.04	
0.76/1.04	Auto_denials:  (non-Horn, no changes).
0.76/1.04	
0.76/1.04	Term ordering decisions:
0.76/1.04	Function symbol KB weights:  c1=1. f1=1. f2=1. f3=1. f4=1. f5=1. f13=1. f16=1. f17=1. f18=1. f19=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f14=1. f15=1.
0.76/1.04	
0.76/1.04	============================== end of process initial clauses ========
0.76/1.04	
0.76/1.04	============================== CLAUSES FOR SEARCH ====================
0.76/1.04	
0.76/1.04	============================== end of clauses for search =============
0.76/1.04	
0.76/1.04	============================== SEARCH ================================
0.76/1.04	
0.76/1.04	% Starting search at 0.02 seconds.
0.76/1.04	
0.76/1.04	============================== PROOF =================================
0.76/1.04	% SZS status Theorem
0.76/1.04	% SZS output start Refutation
0.76/1.04	
0.76/1.04	% Proof 1 at 0.02 (+ 0.00) seconds.
0.76/1.04	% Length of proof is 9.
0.76/1.04	% Level of proof is 2.
0.76/1.04	% Maximum clause weight is 19.000.
0.76/1.04	% Given clauses 24.
0.76/1.04	
0.76/1.04	17 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	18 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	19 -(exists Y1 ((exists Y2 ((exists Y5 (r1(Y5) & r2(Y5,Y2))) & (exists Y4 (r3(Y2,Y4,Y1) & r1(Y4))))) & (exists Y3 (id(Y1,Y3) & (exists Y6 (r1(Y6) & r2(Y6,Y3))))))) # label(onepluszeroidone) # label(negated_conjecture) # label(non_clause).  [assumption].
0.76/1.04	23 r1(f15(A)) # label(axiom_4a) # label(axiom).  [clausify(17)].
0.76/1.04	24 id(f14(A),A) # label(axiom_4a) # label(axiom).  [clausify(17)].
0.76/1.04	27 r2(A,f19(B,A)) # label(axiom_1a) # label(axiom).  [clausify(18)].
0.76/1.04	30 r3(A,f15(A),f14(A)) # label(axiom_4a) # label(axiom).  [clausify(17)].
0.76/1.04	43 -r1(A) | -r2(A,B) | -r3(B,C,D) | -r1(C) | -id(D,E) | -r1(F) | -r2(F,E) # label(onepluszeroidone) # label(negated_conjecture).  [clausify(19)].
0.76/1.04	114 $F.  [ur(43,b,27,a,c,30,a,d,23,a,e,24,a,f,23,a,g,27,a),unit_del(a,23)].
0.76/1.04	
0.76/1.04	% SZS output end Refutation
0.76/1.04	============================== end of proof ==========================
0.76/1.04	
0.76/1.04	============================== STATISTICS ============================
0.76/1.04	
0.76/1.04	Given=24. Generated=112. Kept=94. proofs=1.
0.76/1.04	Usable=24. Sos=67. Demods=0. Limbo=3, Disabled=43. Hints=0.
0.76/1.04	Megabytes=0.16.
0.76/1.04	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.76/1.04	
0.76/1.04	============================== end of statistics =====================
0.76/1.04	
0.76/1.04	============================== end of search =========================
0.76/1.04	
0.76/1.04	THEOREM PROVED
0.76/1.04	% SZS status Theorem
0.76/1.04	
0.76/1.04	Exiting with 1 proof.
0.76/1.04	
0.76/1.04	Process 7244 exit (max_proofs) Thu Jul  2 06:54:38 2020
0.76/1.04	Prover9 interrupted
0.76/1.04	EOF