0.02/0.07	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.08	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.27	% Computer   : n020.cluster.edu
0.09/0.27	% Model      : x86_64 x86_64
0.09/0.27	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.27	% Memory     : 8042.1875MB
0.09/0.27	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.27	% CPULimit   : 960
0.09/0.27	% DateTime   : Thu Jul  2 08:25:47 EDT 2020
0.09/0.27	% CPUTime    : 
0.62/0.93	============================== Prover9 ===============================
0.62/0.93	Prover9 (32) version 2009-11A, November 2009.
0.62/0.93	Process 32416 was started by sandbox2 on n020.cluster.edu,
0.62/0.93	Thu Jul  2 08:25:48 2020
0.62/0.93	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_32221_n020.cluster.edu".
0.62/0.93	============================== end of head ===========================
0.62/0.93	
0.62/0.93	============================== INPUT =================================
0.62/0.93	
0.62/0.93	% Reading from file /tmp/Prover9_32221_n020.cluster.edu
0.62/0.93	
0.62/0.93	set(prolog_style_variables).
0.62/0.93	set(auto2).
0.62/0.93	    % set(auto2) -> set(auto).
0.62/0.93	    % set(auto) -> set(auto_inference).
0.62/0.93	    % set(auto) -> set(auto_setup).
0.62/0.93	    % set(auto_setup) -> set(predicate_elim).
0.62/0.93	    % set(auto_setup) -> assign(eq_defs, unfold).
0.62/0.93	    % set(auto) -> set(auto_limits).
0.62/0.93	    % set(auto_limits) -> assign(max_weight, "100.000").
0.62/0.93	    % set(auto_limits) -> assign(sos_limit, 20000).
0.62/0.93	    % set(auto) -> set(auto_denials).
0.62/0.93	    % set(auto) -> set(auto_process).
0.62/0.93	    % set(auto2) -> assign(new_constants, 1).
0.62/0.93	    % set(auto2) -> assign(fold_denial_max, 3).
0.62/0.93	    % set(auto2) -> assign(max_weight, "200.000").
0.62/0.93	    % set(auto2) -> assign(max_hours, 1).
0.62/0.93	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.62/0.93	    % set(auto2) -> assign(max_seconds, 0).
0.62/0.93	    % set(auto2) -> assign(max_minutes, 5).
0.62/0.93	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.62/0.93	    % set(auto2) -> set(sort_initial_sos).
0.62/0.93	    % set(auto2) -> assign(sos_limit, -1).
0.62/0.93	    % set(auto2) -> assign(lrs_ticks, 3000).
0.62/0.93	    % set(auto2) -> assign(max_megs, 400).
0.62/0.93	    % set(auto2) -> assign(stats, some).
0.62/0.93	    % set(auto2) -> clear(echo_input).
0.62/0.93	    % set(auto2) -> set(quiet).
0.62/0.93	    % set(auto2) -> clear(print_initial_clauses).
0.62/0.93	    % set(auto2) -> clear(print_given).
0.62/0.93	assign(lrs_ticks,-1).
0.62/0.93	assign(sos_limit,10000).
0.62/0.93	assign(order,kbo).
0.62/0.93	set(lex_order_vars).
0.62/0.93	clear(print_given).
0.62/0.93	
0.62/0.93	% formulas(sos).  % not echoed (12 formulas)
0.62/0.93	
0.62/0.93	============================== end of input ==========================
0.62/0.93	
0.62/0.93	% From the command line: assign(max_seconds, 960).
0.62/0.93	
0.62/0.93	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.62/0.93	
0.62/0.93	% Formulas that are not ordinary clauses:
0.62/0.93	1 (all X16 all X17 exists Y23 all X18 (r4(X16,X17,X18) & X18 = Y23 | -r4(X16,X17,X18) & Y23 != X18)) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	2 (all X6 ((exists Y19 (X6 = Y19 & r1(Y19))) | (exists Y1 exists Y11 (Y11 = X6 & r2(Y1,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	3 (all X11 exists Y21 all X12 (X12 = Y21 & r2(X11,X12) | -r2(X11,X12) & X12 != Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	4 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 (Y2 = Y3 & (exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	5 (exists Y24 all X19 (r1(X19) & Y24 = X19 | Y24 != X19 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	6 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (Y18 = Y8 & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	7 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	8 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	9 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))) & Y4 = Y5)) & (exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	10 (all X3 all X10 (X10 = X3 | (all Y12 (-r2(X10,Y12) | (all Y13 (-r2(X3,Y13) | Y13 != Y12)))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	11 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.62/0.93	12 -(exists Y1 ((exists Y4 ((exists Y7 ((exists Y10 (r1(Y10) & r2(Y10,Y7))) & r2(Y7,Y4))) & (exists Y6 (r3(Y6,Y4,Y1) & (exists Y9 (r1(Y9) & r2(Y9,Y6))))))) & (exists Y2 (Y2 = Y1 & (exists Y3 ((exists Y5 ((exists Y8 (r2(Y8,Y5) & r1(Y8))) & r2(Y5,Y3))) & r2(Y3,Y2))))))) # label(oneplustwoeqthree) # label(negated_conjecture) # label(non_clause).  [assumption].
11.99/12.36	
11.99/12.36	============================== end of process non-clausal formulas ===
11.99/12.36	
11.99/12.36	============================== PROCESS INITIAL CLAUSES ===============
11.99/12.36	
11.99/12.36	============================== PREDICATE ELIMINATION =================
11.99/12.36	13 A = f1(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(1)].
11.99/12.36	14 r4(A,B,f7(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
11.99/12.36	15 r4(A,f11(A),f10(A)) # label(axiom_5a) # label(axiom).  [clausify(6)].
11.99/12.36	16 r4(A,f9(A,B),f8(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
11.99/12.36	17 r4(A,B,C) | C != f1(A,B) # label(axiom_4) # label(axiom).  [clausify(1)].
11.99/12.36	Derived: f7(A,B) = f1(A,B).  [resolve(13,b,14,a)].
11.99/12.36	Derived: f10(A) = f1(A,f11(A)).  [resolve(13,b,15,a)].
11.99/12.36	Derived: f8(A,B) = f1(A,f9(A,B)).  [resolve(13,b,16,a)].
11.99/12.36	18 -r1(A) | -r2(A,B) | -r2(B,C) | -r3(D,C,E) | -r1(F) | -r2(F,D) | V6 != E | -r2(V7,V8) | -r1(V7) | -r2(V8,V9) | -r2(V9,V6) # label(oneplustwoeqthree) # label(negated_conjecture).  [clausify(12)].
11.99/12.36	19 r3(A,B,f17(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
11.99/12.36	20 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
11.99/12.36	21 r3(f7(A,B),A,f6(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
11.99/12.36	22 r3(A,f16(A,B),f15(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
11.99/12.36	Derived: -r1(A) | -r2(A,B) | -r2(B,C) | -r1(D) | -r2(D,E) | F != f17(E,C) | -r2(V6,V7) | -r1(V6) | -r2(V7,V8) | -r2(V8,F).  [resolve(18,d,19,a)].
11.99/12.36	Derived: -r1(A) | -r2(A,B) | -r2(B,f19(C)) | -r1(D) | -r2(D,C) | E != f18(C) | -r2(F,V6) | -r1(F) | -r2(V6,V7) | -r2(V7,E).  [resolve(18,d,20,a)].
11.99/12.36	Derived: -r1(A) | -r2(A,B) | -r2(B,C) | -r1(D) | -r2(D,f7(C,E)) | F != f6(C,E) | -r2(V6,V7) | -r1(V6) | -r2(V7,V8) | -r2(V8,F).  [resolve(18,d,21,a)].
11.99/12.36	Derived: -r1(A) | -r2(A,B) | -r2(B,f16(C,D)) | -r1(E) | -r2(E,C) | F != f15(C,D) | -r2(V6,V7) | -r1(V6) | -r2(V7,V8) | -r2(V8,F).  [resolve(18,d,22,a)].
11.99/12.36	23 -r3(A,B,C) | C = f13(A,B) # label(axiom_3) # label(axiom).  [clausify(7)].
11.99/12.36	Derived: f17(A,B) = f13(A,B).  [resolve(23,a,19,a)].
11.99/12.36	Derived: f18(A) = f13(A,f19(A)).  [resolve(23,a,20,a)].
11.99/12.36	Derived: f6(A,B) = f13(f7(A,B),A).  [resolve(23,a,21,a)].
11.99/12.36	Derived: f15(A,B) = f13(A,f16(A,B)).  [resolve(23,a,22,a)].
11.99/12.36	24 A != f13(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(7)].
11.99/12.36	Derived: A != f13(B,C) | -r1(D) | -r2(D,E) | -r2(E,C) | -r1(F) | -r2(F,B) | V6 != A | -r2(V7,V8) | -r1(V7) | -r2(V8,V9) | -r2(V9,V6).  [resolve(24,b,18,d)].
11.99/12.36	
11.99/12.36	============================== end predicate elimination =============
11.99/12.36	
11.99/12.36	Auto_denials:  (non-Horn, no changes).
11.99/12.36	
11.99/12.36	Term ordering decisions:
11.99/12.36	Function symbol KB weights:  c1=1. f1=1. f6=1. f7=1. f8=1. f9=1. f13=1. f14=1. f15=1. f16=1. f17=1. f2=1. f3=1. f4=1. f5=1. f10=1. f11=1. f12=1. f18=1. f19=1.
11.99/12.36	
11.99/12.36	============================== end of process initial clauses ========
11.99/12.36	
11.99/12.36	============================== CLAUSES FOR SEARCH ====================
11.99/12.36	
11.99/12.36	============================== end of clauses for search =============
11.99/12.36	
11.99/12.36	============================== SEARCH ================================
11.99/12.36	
11.99/12.36	% Starting search at 1.15 seconds.
11.99/12.36	
11.99/12.36	Low Water (keep): wt=31.000, iters=3506
11.99/12.36	
11.99/12.36	Low Water (keep): wt=30.000, iters=3407
11.99/12.36	
11.99/12.36	Low Water (keep): wt=29.000, iters=3335
11.99/12.36	
11.99/12.36	Low Water (keep): wt=28.000, iters=3358
11.99/12.36	
11.99/12.36	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 24 (0.00 of 7.07 sec).
11.99/12.36	
11.99/12.36	Low Water (keep): wt=27.000, iters=3333
11.99/12.36	
11.99/12.36	Low Water (keep): wt=26.000, iters=3335
11.99/12.36	
11.99/12.36	Low Water (displace): id=6519, wt=38.000
11.99/12.36	
11.99/12.36	Low Water (displace): id=6505, wt=37.000
11.99/12.36	
11.99/12.36	Low Water (displace): id=7359, wt=35.000
11.99/12.36	
11.99/12.36	Low Water (displace): id=6645, wt=34.000
11.99/12.36	
11.99/12.36	Low Water (displace): id=7357, wt=33.000
11.99/12.36	
11.99/12.36	Low Water (displace): id=7557, wt=32.000
11.99/12.36	
11.99/12.36	Low Water (displace): id=11693, wt=22.000
11.99/12.36	
11.99/12.36	Low Water (keep): wt=25.000, iters=3354
11.99/12.36	
11.99/12.36	Low Water (keep): wt=24.000, iters=3337
11.99/12.36	
11.99/12.36	============================== PROOF =================================
11.99/12.36	% SZS status Theorem
11.99/12.36	% SZS output start Refutation
11.99/12.36	
11.99/12.36	% Proof 1 at 11.33 (+ 0.08) seconds.
11.99/12.36	% Length of proof is 42.
11.99/12.36	% Level of proof is 7.
11.99/12.36	% Maximum clause weight is 32.000.
11.99/12.36	% Given clauses 795.
11.99/12.36	
11.99/12.36	3 (all X11 exists Y21 all X12 (X12 = Y21 & r2(X11,X12) | -r2(X11,X12) & X12 != Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
11.99/12.36	5 (exists Y24 all X19 (r1(X19) & Y24 = X19 | Y24 != X19 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
11.99/12.36	7 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
11.99/12.36	9 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))) & Y4 = Y5)) & (exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
11.99/12.36	11 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
11.99/12.36	12 -(exists Y1 ((exists Y4 ((exists Y7 ((exists Y10 (r1(Y10) & r2(Y10,Y7))) & r2(Y7,Y4))) & (exists Y6 (r3(Y6,Y4,Y1) & (exists Y9 (r1(Y9) & r2(Y9,Y6))))))) & (exists Y2 (Y2 = Y1 & (exists Y3 ((exists Y5 ((exists Y8 (r2(Y8,Y5) & r1(Y8))) & r2(Y5,Y3))) & r2(Y3,Y2))))))) # label(oneplustwoeqthree) # label(negated_conjecture) # label(non_clause).  [assumption].
11.99/12.36	18 -r1(A) | -r2(A,B) | -r2(B,C) | -r3(D,C,E) | -r1(F) | -r2(F,D) | V6 != E | -r2(V7,V8) | -r1(V7) | -r2(V8,V9) | -r2(V9,V6) # label(oneplustwoeqthree) # label(negated_conjecture).  [clausify(12)].
11.99/12.36	19 r3(A,B,f17(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
11.99/12.36	20 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
11.99/12.36	22 r3(A,f16(A,B),f15(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
11.99/12.36	23 -r3(A,B,C) | C = f13(A,B) # label(axiom_3) # label(axiom).  [clausify(7)].
11.99/12.36	24 A != f13(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(7)].
11.99/12.36	27 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
11.99/12.36	28 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
11.99/12.36	31 r2(A,f16(B,A)) # label(axiom_1a) # label(axiom).  [clausify(9)].
11.99/12.36	34 f15(A,B) = f14(A,B) # label(axiom_1a) # label(axiom).  [clausify(9)].
11.99/12.36	35 r2(f17(A,B),f14(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
11.99/12.36	40 r1(A) | A != c1 # label(axiom_1) # label(axiom).  [clausify(5)].
11.99/12.36	41 r1(A) | c1 != A.  [copy(40),flip(b)].
11.99/12.36	42 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(5)].
11.99/12.36	43 c1 = A | -r1(A).  [copy(42),flip(a)].
11.99/12.36	44 A = f5(B) | -r2(B,A) # label(axiom_2) # label(axiom).  [clausify(3)].
11.99/12.36	45 f5(A) = B | -r2(A,B).  [copy(44),flip(a)].
11.99/12.36	61 f17(A,B) = f13(A,B).  [resolve(23,a,19,a)].
11.99/12.36	62 f18(A) = f13(A,f19(A)).  [resolve(23,a,20,a)].
11.99/12.36	63 f13(A,f19(A)) = A.  [copy(62),rewrite([28(1)]),flip(a)].
11.99/12.36	66 f15(A,B) = f13(A,f16(A,B)).  [resolve(23,a,22,a)].
11.99/12.36	67 f13(A,f16(A,B)) = f14(A,B).  [copy(66),rewrite([34(1)]),flip(a)].
11.99/12.36	68 A != f13(B,C) | -r1(D) | -r2(D,E) | -r2(E,C) | -r1(F) | -r2(F,B) | V6 != A | -r2(V7,V8) | -r1(V7) | -r2(V8,V9) | -r2(V9,V6).  [resolve(24,b,18,d)].
11.99/12.36	69 f13(A,B) != C | -r1(D) | -r2(D,E) | -r2(E,B) | -r1(F) | -r2(F,A) | V6 != C | -r2(V7,V8) | -r1(V7) | -r2(V8,V9) | -r2(V9,V6).  [copy(68),flip(a)].
11.99/12.36	139 r2(f13(A,B),f14(A,B)).  [back_rewrite(35),rewrite([61(1)])].
11.99/12.36	144 f13(A,B) != C | -r1(D) | -r2(D,A) | -r2(A,B) | E != C | -r2(F,V6) | -r1(F) | -r2(V6,V7) | -r2(V7,E).  [factor(69,c,f),merge(e)].
11.99/12.36	516 f13(A,B) != C | -r1(D) | -r2(D,A) | -r2(A,B) | E != C | -r2(A,F) | -r2(F,E).  [factor(144,c,f),merge(f)].
11.99/12.36	1439 r1(c1).  [resolve(41,b,28,a(flip)),rewrite([28(2)])].
11.99/12.36	1441 f19(A) = c1.  [resolve(43,b,27,a),flip(a)].
11.99/12.36	1446 f13(A,c1) = A.  [back_rewrite(63),rewrite([1441(1)])].
11.99/12.36	1452 f16(A,B) = f5(B).  [resolve(45,b,31,a),flip(a)].
11.99/12.36	1618 f13(A,f5(B)) = f14(A,B).  [back_rewrite(67),rewrite([1452(1)])].
11.99/12.36	1620 r2(A,f5(A)).  [back_rewrite(31),rewrite([1452(1)])].
11.99/12.36	11165 r2(A,f14(A,c1)).  [para(1446(a,1),139(a,1))].
11.99/12.36	12653 f14(A,c1) = f5(A).  [resolve(11165,a,45,b),flip(a)].
11.99/12.36	12664 $F.  [ur(516,a,1618,a,b,1439,a,c,1620,a,d,1620,a,e,xx,g,139,a),rewrite([1618(7),12653(6)]),unit_del(a,1620)].
11.99/12.36	
11.99/12.36	% SZS output end Refutation
11.99/12.36	============================== end of proof ==========================
11.99/12.36	
11.99/12.36	============================== STATISTICS ============================
11.99/12.36	
11.99/12.36	Given=795. Generated=101861. Kept=12626. proofs=1.
11.99/12.36	Usable=789. Sos=8969. Demods=19. Limbo=0, Disabled=2912. Hints=0.
11.99/12.36	Megabytes=8.71.
11.99/12.36	User_CPU=11.33, System_CPU=0.09, Wall_clock=11.
11.99/12.36	
11.99/12.36	============================== end of statistics =====================
11.99/12.36	
11.99/12.36	============================== end of search =========================
11.99/12.36	
11.99/12.36	THEOREM PROVED
11.99/12.36	% SZS status Theorem
11.99/12.36	
11.99/12.36	Exiting with 1 proof.
11.99/12.36	
11.99/12.36	Process 32416 exit (max_proofs) Thu Jul  2 08:25:59 2020
11.99/12.36	Prover9 interrupted
11.99/12.36	EOF