0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n008.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.33	% CPULimit   : 1200
0.12/0.33	% DateTime   : Tue Jul 13 13:07:29 EDT 2021
0.12/0.33	% CPUTime    : 
0.43/1.03	============================== Prover9 ===============================
0.43/1.03	Prover9 (32) version 2009-11A, November 2009.
0.43/1.03	Process 13469 was started by sandbox on n008.cluster.edu,
0.43/1.03	Tue Jul 13 13:07:30 2021
0.43/1.03	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_13136_n008.cluster.edu".
0.43/1.03	============================== end of head ===========================
0.43/1.03	
0.43/1.03	============================== INPUT =================================
0.43/1.03	
0.43/1.03	% Reading from file /tmp/Prover9_13136_n008.cluster.edu
0.43/1.03	
0.43/1.03	set(prolog_style_variables).
0.43/1.03	set(auto2).
0.43/1.03	    % set(auto2) -> set(auto).
0.43/1.03	    % set(auto) -> set(auto_inference).
0.43/1.03	    % set(auto) -> set(auto_setup).
0.43/1.03	    % set(auto_setup) -> set(predicate_elim).
0.43/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/1.03	    % set(auto) -> set(auto_limits).
0.43/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/1.03	    % set(auto) -> set(auto_denials).
0.43/1.03	    % set(auto) -> set(auto_process).
0.43/1.03	    % set(auto2) -> assign(new_constants, 1).
0.43/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.43/1.03	    % set(auto2) -> assign(max_hours, 1).
0.43/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.43/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.43/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/1.03	    % set(auto2) -> set(sort_initial_sos).
0.43/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.43/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/1.03	    % set(auto2) -> assign(max_megs, 400).
0.43/1.03	    % set(auto2) -> assign(stats, some).
0.43/1.03	    % set(auto2) -> clear(echo_input).
0.43/1.03	    % set(auto2) -> set(quiet).
0.43/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.43/1.03	    % set(auto2) -> clear(print_given).
0.43/1.03	assign(lrs_ticks,-1).
0.43/1.03	assign(sos_limit,10000).
0.43/1.03	assign(order,kbo).
0.43/1.03	set(lex_order_vars).
0.43/1.03	clear(print_given).
0.43/1.03	
0.43/1.03	% formulas(sos).  % not echoed (8 formulas)
0.43/1.03	
0.43/1.03	============================== end of input ==========================
0.43/1.03	
0.43/1.03	% From the command line: assign(max_seconds, 1200).
0.43/1.03	
0.43/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/1.03	
0.43/1.03	% Formulas that are not ordinary clauses:
0.43/1.03	1 (all X all Y (iext(uri_owl_disjointWith,X,Y) -> ic(Y) & ic(X))) # label(owl_prop_disjointwith_ext) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	2 (all Z all S1 all C1 all S2 all C2 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S2,uri_rdf_nil) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S1,S2) -> (iext(uri_owl_intersectionOf,Z,S1) <-> ic(Z) & ic(C1) & ic(C2) & (all X (icext(C1,X) & icext(C2,X) <-> icext(Z,X)))))) # label(owl_bool_intersectionof_class_002) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	3 (exists BNODE_xs exists BNODE_xc exists BNODE_lu1 exists BNODE_lu2 exists BNODE_lu3 exists BNODE_li1 exists BNODE_li2 (iext(uri_rdf_rest,BNODE_lu1,BNODE_lu2) & iext(uri_rdf_rest,BNODE_lu2,BNODE_lu3) & iext(uri_rdf_first,BNODE_lu3,uri_ex_c3) & iext(uri_rdf_rest,BNODE_lu3,uri_rdf_nil) & iext(uri_rdfs_subClassOf,uri_ex_d,BNODE_xs) & iext(uri_owl_intersectionOf,BNODE_xs,BNODE_li1) & iext(uri_rdf_first,BNODE_li1,uri_ex_c) & iext(uri_rdf_rest,BNODE_li1,BNODE_li2) & iext(uri_rdf_first,BNODE_li2,BNODE_xc) & iext(uri_rdf_rest,BNODE_li2,uri_rdf_nil) & iext(uri_owl_complementOf,BNODE_xc,uri_ex_c2) & iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) & iext(uri_rdf_first,BNODE_lu2,uri_ex_c2) & iext(uri_rdf_first,BNODE_lu1,uri_ex_c1) & iext(uri_owl_unionOf,uri_ex_c,BNODE_lu1))) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	4 (all Z all S1 all C1 all S2 all C2 all S3 all C3 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S2,S3) & iext(uri_rdf_rest,S3,uri_rdf_nil) & iext(uri_rdf_first,S3,C3) -> (ic(Z) & (all X (icext(C3,X) | icext(C2,X) | icext(C1,X) <-> icext(Z,X))) & ic(C3) & ic(C2) & ic(C1) <-> iext(uri_owl_unionOf,Z,S1)))) # label(owl_bool_unionof_class_003) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	5 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> (all X (icext(C1,X) -> icext(C2,X))) & ic(C2) & ic(C1))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	6 (all C1 all C2 (ic(C2) & (all X -(icext(C2,X) & icext(C1,X))) & ic(C1) <-> iext(uri_owl_disjointWith,C1,C2))) # label(owl_eqdis_disjointwith) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	7 (all Z all C (iext(uri_owl_complementOf,Z,C) -> ic(Z) & ic(C) & (all X (icext(Z,X) <-> -icext(C,X))))) # label(owl_bool_complementof_class) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	
3.99/4.34	============================== end of process non-clausal formulas ===
3.99/4.34	
3.99/4.34	============================== PROCESS INITIAL CLAUSES ===============
3.99/4.34	
3.99/4.34	============================== PREDICATE ELIMINATION =================
3.99/4.34	
3.99/4.34	============================== end predicate elimination =============
3.99/4.34	
3.99/4.34	Auto_denials:  (non-Horn, no changes).
3.99/4.34	
3.99/4.34	Term ordering decisions:
3.99/4.34	Function symbol KB weights:  uri_rdf_first=1. uri_rdf_rest=1. uri_rdf_nil=1. uri_owl_unionOf=1. uri_owl_intersectionOf=1. uri_owl_disjointWith=1. uri_rdfs_subClassOf=1. uri_owl_complementOf=1. uri_ex_c=1. uri_ex_c1=1. uri_ex_c2=1. uri_ex_d=1. uri_ex_c3=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. f3=1. f4=1. f1=1. f2=1.
3.99/4.34	
3.99/4.34	============================== end of process initial clauses ========
3.99/4.34	
3.99/4.34	============================== CLAUSES FOR SEARCH ====================
3.99/4.34	
3.99/4.34	============================== end of clauses for search =============
3.99/4.34	
3.99/4.34	============================== SEARCH ================================
3.99/4.34	
3.99/4.34	% Starting search at 0.19 seconds.
3.99/4.34	
3.99/4.34	Low Water (keep): wt=48.000, iters=3352
3.99/4.34	
3.99/4.34	============================== PROOF =================================
3.99/4.34	% SZS status Theorem
3.99/4.34	% SZS output start Refutation
3.99/4.34	
3.99/4.34	% Proof 1 at 3.30 (+ 0.02) seconds.
3.99/4.34	% Length of proof is 57.
3.99/4.34	% Level of proof is 11.
3.99/4.34	% Maximum clause weight is 40.000.
3.99/4.34	% Given clauses 1248.
3.99/4.34	
3.99/4.34	1 (all X all Y (iext(uri_owl_disjointWith,X,Y) -> ic(Y) & ic(X))) # label(owl_prop_disjointwith_ext) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	2 (all Z all S1 all C1 all S2 all C2 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S2,uri_rdf_nil) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S1,S2) -> (iext(uri_owl_intersectionOf,Z,S1) <-> ic(Z) & ic(C1) & ic(C2) & (all X (icext(C1,X) & icext(C2,X) <-> icext(Z,X)))))) # label(owl_bool_intersectionof_class_002) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	3 (exists BNODE_xs exists BNODE_xc exists BNODE_lu1 exists BNODE_lu2 exists BNODE_lu3 exists BNODE_li1 exists BNODE_li2 (iext(uri_rdf_rest,BNODE_lu1,BNODE_lu2) & iext(uri_rdf_rest,BNODE_lu2,BNODE_lu3) & iext(uri_rdf_first,BNODE_lu3,uri_ex_c3) & iext(uri_rdf_rest,BNODE_lu3,uri_rdf_nil) & iext(uri_rdfs_subClassOf,uri_ex_d,BNODE_xs) & iext(uri_owl_intersectionOf,BNODE_xs,BNODE_li1) & iext(uri_rdf_first,BNODE_li1,uri_ex_c) & iext(uri_rdf_rest,BNODE_li1,BNODE_li2) & iext(uri_rdf_first,BNODE_li2,BNODE_xc) & iext(uri_rdf_rest,BNODE_li2,uri_rdf_nil) & iext(uri_owl_complementOf,BNODE_xc,uri_ex_c2) & iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) & iext(uri_rdf_first,BNODE_lu2,uri_ex_c2) & iext(uri_rdf_first,BNODE_lu1,uri_ex_c1) & iext(uri_owl_unionOf,uri_ex_c,BNODE_lu1))) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	4 (all Z all S1 all C1 all S2 all C2 all S3 all C3 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S2,S3) & iext(uri_rdf_rest,S3,uri_rdf_nil) & iext(uri_rdf_first,S3,C3) -> (ic(Z) & (all X (icext(C3,X) | icext(C2,X) | icext(C1,X) <-> icext(Z,X))) & ic(C3) & ic(C2) & ic(C1) <-> iext(uri_owl_unionOf,Z,S1)))) # label(owl_bool_unionof_class_003) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	5 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> (all X (icext(C1,X) -> icext(C2,X))) & ic(C2) & ic(C1))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	6 (all C1 all C2 (ic(C2) & (all X -(icext(C2,X) & icext(C1,X))) & ic(C1) <-> iext(uri_owl_disjointWith,C1,C2))) # label(owl_eqdis_disjointwith) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	7 (all Z all C (iext(uri_owl_complementOf,Z,C) -> ic(Z) & ic(C) & (all X (icext(Z,X) <-> -icext(C,X))))) # label(owl_bool_complementof_class) # label(axiom) # label(non_clause).  [assumption].
3.99/4.34	8 iext(uri_rdf_rest,c3,c4) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	9 iext(uri_rdf_rest,c4,c5) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	10 iext(uri_rdf_first,c5,uri_ex_c3) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	11 iext(uri_rdf_rest,c5,uri_rdf_nil) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	12 iext(uri_rdfs_subClassOf,uri_ex_d,c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	13 iext(uri_owl_intersectionOf,c1,c6) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	14 iext(uri_rdf_first,c6,uri_ex_c) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	15 iext(uri_rdf_rest,c6,c7) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	16 iext(uri_rdf_first,c7,c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	17 iext(uri_rdf_rest,c7,uri_rdf_nil) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	18 iext(uri_owl_complementOf,c2,uri_ex_c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	19 iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	20 iext(uri_rdf_first,c4,uri_ex_c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	21 iext(uri_rdf_first,c3,uri_ex_c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	22 iext(uri_owl_unionOf,uri_ex_c,c3) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom).  [clausify(3)].
3.99/4.34	23 -iext(uri_rdfs_subClassOf,uri_ex_d,uri_ex_c3) # label(testcase_conclusion_fullish_020_Logical_Complications) # label(negated_conjecture).  [assumption].
3.99/4.34	24 -icext(A,B) | -icext(C,B) | -iext(uri_owl_disjointWith,C,A) # label(owl_eqdis_disjointwith) # label(axiom).  [clausify(6)].
3.99/4.34	25 -iext(uri_owl_complementOf,A,B) | -icext(A,C) | -icext(B,C) # label(owl_bool_complementof_class) # label(axiom).  [clausify(7)].
3.99/4.34	27 -iext(uri_owl_disjointWith,A,B) | ic(A) # label(owl_prop_disjointwith_ext) # label(axiom).  [clausify(1)].
3.99/4.34	32 -iext(uri_rdfs_subClassOf,A,B) | -icext(A,C) | icext(B,C) # label(owl_rdfsext_subclassof) # label(axiom).  [clausify(5)].
3.99/4.34	34 iext(uri_rdfs_subClassOf,A,B) | icext(A,f3(A,B)) | -ic(B) | -ic(A) # label(owl_rdfsext_subclassof) # label(axiom).  [clausify(5)].
3.99/4.34	35 iext(uri_rdfs_subClassOf,A,B) | -icext(B,f3(A,B)) | -ic(B) | -ic(A) # label(owl_rdfsext_subclassof) # label(axiom).  [clausify(5)].
3.99/4.34	41 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,C,uri_rdf_nil) | -iext(uri_rdf_first,C,D) | -iext(uri_rdf_rest,A,C) | -iext(uri_owl_intersectionOf,E,A) | icext(B,F) | -icext(E,F) # label(owl_bool_intersectionof_class_002) # label(axiom).  [clausify(2)].
3.99/4.34	42 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,C,uri_rdf_nil) | -iext(uri_rdf_first,C,D) | -iext(uri_rdf_rest,A,C) | -iext(uri_owl_intersectionOf,E,A) | icext(D,F) | -icext(E,F) # label(owl_bool_intersectionof_class_002) # label(axiom).  [clausify(2)].
3.99/4.34	45 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_first,C,D) | -iext(uri_rdf_rest,C,E) | -iext(uri_rdf_rest,E,uri_rdf_nil) | -iext(uri_rdf_first,E,F) | ic(F) | -iext(uri_owl_unionOf,V6,A) # label(owl_bool_unionof_class_003) # label(axiom).  [clausify(4)].
3.99/4.34	51 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_first,C,D) | -iext(uri_rdf_rest,C,E) | -iext(uri_rdf_rest,E,uri_rdf_nil) | -iext(uri_rdf_first,E,F) | icext(F,V6) | icext(D,V6) | icext(B,V6) | -icext(V7,V6) | -iext(uri_owl_unionOf,V7,A) # label(owl_bool_unionof_class_003) # label(axiom).  [clausify(4)].
3.99/4.34	407 -icext(uri_ex_c1,A) | -icext(uri_ex_d,A).  [resolve(24,c,19,a)].
3.99/4.34	408 -icext(c2,A) | -icext(uri_ex_c2,A).  [resolve(25,a,18,a)].
3.99/4.34	410 ic(uri_ex_d).  [resolve(27,a,19,a)].
3.99/4.34	414 -icext(uri_ex_d,A) | icext(c1,A).  [resolve(32,a,12,a)].
3.99/4.34	467 -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,c6,A) | -iext(uri_owl_intersectionOf,C,c6) | icext(uri_ex_c,D) | -icext(C,D).  [resolve(41,a,14,a)].
3.99/4.34	486 -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,c6,A) | -iext(uri_owl_intersectionOf,C,c6) | icext(B,D) | -icext(C,D).  [resolve(42,a,14,a)].
3.99/4.34	622 -iext(uri_rdf_rest,c3,A) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_rest,C,uri_rdf_nil) | -iext(uri_rdf_first,C,D) | ic(D) | -iext(uri_owl_unionOf,E,c3).  [resolve(45,a,21,a)].
3.99/4.34	4485 iext(uri_rdfs_subClassOf,uri_ex_d,A) | icext(uri_ex_d,f3(uri_ex_d,A)) | -ic(A).  [resolve(410,a,34,d)].
3.99/4.34	5093 -iext(uri_owl_intersectionOf,A,c6) | icext(uri_ex_c,B) | -icext(A,B).  [resolve(467,b,16,a),unit_del(a,17),unit_del(b,15)].
3.99/4.34	5097 icext(uri_ex_c,A) | -icext(c1,A).  [resolve(5093,a,13,a)].
3.99/4.34	5184 -iext(uri_owl_intersectionOf,A,c6) | icext(c2,B) | -icext(A,B).  [resolve(486,b,16,a),unit_del(a,17),unit_del(b,15)].
3.99/4.34	5187 icext(c2,A) | -icext(c1,A).  [resolve(5184,a,13,a)].
3.99/4.34	6939 -iext(uri_rdf_first,c4,A) | -iext(uri_rdf_first,c5,B) | ic(B) | -iext(uri_owl_unionOf,C,c3).  [resolve(622,c,9,a),unit_del(a,8),unit_del(c,11)].
3.99/4.34	7100 -iext(uri_rdf_first,c5,A) | ic(A) | -iext(uri_owl_unionOf,B,c3).  [resolve(6939,a,20,a)].
3.99/4.34	7103 ic(uri_ex_c3) | -iext(uri_owl_unionOf,A,c3).  [resolve(7100,a,10,a)].
3.99/4.34	7109 ic(uri_ex_c3).  [resolve(7103,b,22,a)].
3.99/4.34	7496 icext(uri_ex_d,f3(uri_ex_d,uri_ex_c3)).  [resolve(7109,a,4485,c),unit_del(a,23)].
3.99/4.34	7515 -icext(uri_ex_c3,f3(uri_ex_d,uri_ex_c3)).  [ur(35,a,23,a,c,7109,a,d,410,a)].
3.99/4.34	7534 icext(c1,f3(uri_ex_d,uri_ex_c3)).  [resolve(7496,a,414,a)].
3.99/4.34	7535 -icext(uri_ex_c1,f3(uri_ex_d,uri_ex_c3)).  [resolve(7496,a,407,b)].
3.99/4.34	7567 icext(c2,f3(uri_ex_d,uri_ex_c3)).  [resolve(7534,a,5187,b)].
3.99/4.34	7573 icext(uri_ex_c,f3(uri_ex_d,uri_ex_c3)).  [resolve(7534,a,5097,b)].
3.99/4.34	7641 -icext(uri_ex_c2,f3(uri_ex_d,uri_ex_c3)).  [resolve(7567,a,408,a)].
3.99/4.34	8069 $F.  [ur(51,b,8,a,c,20,a,d,9,a,e,11,a,f,10,a,g,7515,a,h,7641,a,i,7535,a,j,7573,a,k,22,a),unit_del(a,21)].
3.99/4.34	
3.99/4.34	% SZS output end Refutation
3.99/4.34	============================== end of proof ==========================
3.99/4.34	
3.99/4.34	============================== STATISTICS ============================
3.99/4.34	
3.99/4.34	Given=1248. Generated=30886. Kept=8061. proofs=1.
3.99/4.34	Usable=954. Sos=3998. Demods=0. Limbo=19, Disabled=3143. Hints=0.
3.99/4.34	Megabytes=9.68.
3.99/4.34	User_CPU=3.30, System_CPU=0.02, Wall_clock=3.
3.99/4.34	
3.99/4.34	============================== end of statistics =====================
3.99/4.34	
3.99/4.34	============================== end of search =========================
3.99/4.34	
3.99/4.34	THEOREM PROVED
3.99/4.34	% SZS status Theorem
3.99/4.34	
3.99/4.34	Exiting with 1 proof.
3.99/4.34	
3.99/4.34	Process 13469 exit (max_proofs) Tue Jul 13 13:07:33 2021
3.99/4.34	Prover9 interrupted
3.99/4.34	EOF