0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.23	% Computer   : n013.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sat Jul 14 05:25:24 CDT 2018
0.03/0.23	% CPUTime    : 
0.06/0.45	============================== Prover9 ===============================
0.06/0.45	Prover9 (32) version 2009-11A, November 2009.
0.06/0.45	Process 5057 was started by sandbox2 on n013.star.cs.uiowa.edu,
0.06/0.45	Sat Jul 14 05:25:25 2018
0.06/0.45	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5025_n013.star.cs.uiowa.edu".
0.06/0.45	============================== end of head ===========================
0.06/0.45	
0.06/0.45	============================== INPUT =================================
0.06/0.45	
0.06/0.45	% Reading from file /tmp/Prover9_5025_n013.star.cs.uiowa.edu
0.06/0.45	
0.06/0.45	set(prolog_style_variables).
0.06/0.45	set(auto2).
0.06/0.45	    % set(auto2) -> set(auto).
0.06/0.45	    % set(auto) -> set(auto_inference).
0.06/0.45	    % set(auto) -> set(auto_setup).
0.06/0.45	    % set(auto_setup) -> set(predicate_elim).
0.06/0.45	    % set(auto_setup) -> assign(eq_defs, unfold).
0.06/0.45	    % set(auto) -> set(auto_limits).
0.06/0.45	    % set(auto_limits) -> assign(max_weight, "100.000").
0.06/0.45	    % set(auto_limits) -> assign(sos_limit, 20000).
0.06/0.45	    % set(auto) -> set(auto_denials).
0.06/0.45	    % set(auto) -> set(auto_process).
0.06/0.45	    % set(auto2) -> assign(new_constants, 1).
0.06/0.45	    % set(auto2) -> assign(fold_denial_max, 3).
0.06/0.45	    % set(auto2) -> assign(max_weight, "200.000").
0.06/0.45	    % set(auto2) -> assign(max_hours, 1).
0.06/0.45	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.06/0.45	    % set(auto2) -> assign(max_seconds, 0).
0.06/0.45	    % set(auto2) -> assign(max_minutes, 5).
0.06/0.45	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.06/0.45	    % set(auto2) -> set(sort_initial_sos).
0.06/0.45	    % set(auto2) -> assign(sos_limit, -1).
0.06/0.45	    % set(auto2) -> assign(lrs_ticks, 3000).
0.06/0.45	    % set(auto2) -> assign(max_megs, 400).
0.06/0.45	    % set(auto2) -> assign(stats, some).
0.06/0.45	    % set(auto2) -> clear(echo_input).
0.06/0.45	    % set(auto2) -> set(quiet).
0.06/0.45	    % set(auto2) -> clear(print_initial_clauses).
0.06/0.45	    % set(auto2) -> clear(print_given).
0.06/0.45	assign(lrs_ticks,-1).
0.06/0.45	assign(sos_limit,10000).
0.06/0.45	assign(order,kbo).
0.06/0.45	set(lex_order_vars).
0.06/0.45	clear(print_given).
0.06/0.45	
0.06/0.45	% formulas(sos).  % not echoed (38 formulas)
0.06/0.45	
0.06/0.45	============================== end of input ==========================
0.06/0.45	
0.06/0.45	% From the command line: assign(max_seconds, 300).
0.06/0.45	
0.06/0.45	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.06/0.45	
0.06/0.45	% Formulas that are not ordinary clauses:
0.06/0.45	1 (all A all B all C (element(C,powerset(cartesian_product2(A,B))) -> relation(C))) # label(cc1_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	2 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	3 (all A all B all C (relation(C) -> (in(ordered_pair(A,B),C) -> in(A,relation_dom(C)) & in(B,relation_rng(C))))) # label(t20_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	4 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	5 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	6 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	7 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	8 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	9 (all A all B all C (relation_of2_as_subset(C,A,B) -> element(C,powerset(cartesian_product2(A,B))))) # label(dt_m2_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	10 (all A all B unordered_pair(B,A) = unordered_pair(A,B)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	11 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	12 (all A all B (element(A,B) -> in(A,B) | empty(B))) # label(t2_subset) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	13 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	14 (all A all B exists C relation_of2(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	15 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	16 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	17 (all A all B all C (element(B,powerset(C)) & in(A,B) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	18 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	19 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	20 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	21 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	22 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	23 (all A all B all C -(empty(C) & element(B,powerset(C)) & in(A,B))) # label(t5_subset) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	24 (all A all B exists C relation_of2_as_subset(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	25 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	26 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	27 (all A (relation(A) -> (all B (B = relation_rng(A) <-> (all C (in(C,B) <-> (exists D in(ordered_pair(D,C),A)))))))) # label(d5_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	28 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	29 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	30 (all A all B all C (relation_of2(C,A,B) -> relation_rng(C) = relation_rng_as_subset(A,B,C))) # label(redefinition_k5_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	31 (all A all B ((all C (in(C,A) <-> in(C,B))) -> B = A)) # label(t2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	32 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	33 (all A all B all C (relation_of2(C,A,B) -> element(relation_rng_as_subset(A,B,C),powerset(B)))) # label(dt_k5_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	34 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	35 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	36 (all A all B all C (relation_of2(C,A,B) <-> relation_of2_as_subset(C,A,B))) # label(redefinition_m2_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.45	37 -(all A all B all C (relation_of2_as_subset(C,A,B) -> ((all D -((all E -in(ordered_pair(E,D),C)) & in(D,B))) <-> relation_rng_as_subset(A,B,C) = B))) # label(t23_relset_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.06/0.45	
0.06/0.45	============================== end of process non-clausal formulas ===
0.06/0.45	
0.06/0.45	============================== PROCESS INITIAL CLAUSES ===============
0.06/0.45	
0.06/0.45	============================== PREDICATE ELIMINATION =================
0.06/0.45	38 element(A,powerset(B)) | -subset(A,B) # label(t3_subset) # label(axiom).  [clausify(16)].
0.06/0.45	39 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom).  [clausify(5)].
0.06/0.45	40 -element(A,powerset(B)) | subset(A,B) # label(t3_subset) # label(axiom).  [clausify(16)].
0.06/0.45	Derived: element(A,powerset(A)).  [resolve(38,b,39,a)].
0.06/0.45	41 relation_of2(A,B,C) | -relation_of2_as_subset(A,B,C) # label(redefinition_m2_relset_1) # label(axiom).  [clausify(36)].
0.06/0.45	42 relation_of2_as_subset(c5,c3,c4) # label(t23_relset_1) # label(negated_conjecture).  [clausify(37)].
0.06/0.45	43 relation_of2_as_subset(f2(A,B),A,B) # label(existence_m2_relset_1) # label(axiom).  [clausify(24)].
0.06/0.45	44 -relation_of2(A,B,C) | relation_of2_as_subset(A,B,C) # label(redefinition_m2_relset_1) # label(axiom).  [clausify(36)].
0.06/0.45	Derived: relation_of2(c5,c3,c4).  [resolve(41,b,42,a)].
0.06/0.45	Derived: relation_of2(f2(A,B),A,B).  [resolve(41,b,43,a)].
0.06/0.45	45 -relation_of2_as_subset(A,B,C) | element(A,powerset(cartesian_product2(B,C))) # label(dt_m2_relset_1) # label(axiom).  [clausify(9)].
0.06/0.45	Derived: element(c5,powerset(cartesian_product2(c3,c4))).  [resolve(45,a,42,a)].
0.06/0.45	Derived: element(f2(A,B),powerset(cartesian_product2(A,B))).  [resolve(45,a,43,a)].
0.06/0.45	Derived: element(A,powerset(cartesian_product2(B,C))) | -relation_of2(A,B,C).  [resolve(45,a,44,b)].
1.33/1.59	46 -relation_of2(A,B,C) | relation_rng_as_subset(B,C,A) = relation_rng(A) # label(redefinition_k5_relset_1) # label(axiom).  [clausify(30)].
1.33/1.59	47 relation_of2(f1(A,B),A,B) # label(existence_m1_relset_1) # label(axiom).  [clausify(14)].
1.33/1.59	Derived: relation_rng_as_subset(A,B,f1(A,B)) = relation_rng(f1(A,B)).  [resolve(46,a,47,a)].
1.33/1.59	48 -relation_of2(A,B,C) | element(relation_rng_as_subset(B,C,A),powerset(C)) # label(dt_k5_relset_1) # label(axiom).  [clausify(33)].
1.33/1.59	Derived: element(relation_rng_as_subset(A,B,f1(A,B)),powerset(B)).  [resolve(48,a,47,a)].
1.33/1.59	49 relation_of2(c5,c3,c4).  [resolve(41,b,42,a)].
1.33/1.59	Derived: relation_rng_as_subset(c3,c4,c5) = relation_rng(c5).  [resolve(49,a,46,a)].
1.33/1.59	Derived: element(relation_rng_as_subset(c3,c4,c5),powerset(c4)).  [resolve(49,a,48,a)].
1.33/1.59	50 relation_of2(f2(A,B),A,B).  [resolve(41,b,43,a)].
1.33/1.59	Derived: relation_rng_as_subset(A,B,f2(A,B)) = relation_rng(f2(A,B)).  [resolve(50,a,46,a)].
1.33/1.59	Derived: element(relation_rng_as_subset(A,B,f2(A,B)),powerset(B)).  [resolve(50,a,48,a)].
1.33/1.59	51 element(A,powerset(cartesian_product2(B,C))) | -relation_of2(A,B,C).  [resolve(45,a,44,b)].
1.33/1.59	Derived: element(f1(A,B),powerset(cartesian_product2(A,B))).  [resolve(51,b,47,a)].
1.33/1.59	Derived: element(c5,powerset(cartesian_product2(c3,c4))).  [resolve(51,b,49,a)].
1.33/1.59	Derived: element(f2(A,B),powerset(cartesian_product2(A,B))).  [resolve(51,b,50,a)].
1.33/1.59	52 -relation(A) | -in(ordered_pair(B,C),A) | in(B,relation_dom(A)) # label(t20_relat_1) # label(axiom).  [clausify(3)].
1.33/1.59	53 -element(A,powerset(cartesian_product2(B,C))) | relation(A) # label(cc1_relset_1) # label(axiom).  [clausify(1)].
1.33/1.59	Derived: -in(ordered_pair(A,B),C) | in(A,relation_dom(C)) | -element(C,powerset(cartesian_product2(D,E))).  [resolve(52,a,53,b)].
1.33/1.59	54 -relation(A) | -in(ordered_pair(B,C),A) | in(C,relation_rng(A)) # label(t20_relat_1) # label(axiom).  [clausify(3)].
1.33/1.59	Derived: -in(ordered_pair(A,B),C) | in(B,relation_rng(C)) | -element(C,powerset(cartesian_product2(D,E))).  [resolve(54,a,53,b)].
1.33/1.59	55 -relation(A) | relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) # label(d5_relat_1) # label(axiom).  [clausify(27)].
1.33/1.59	Derived: relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) | -element(A,powerset(cartesian_product2(E,F))).  [resolve(55,a,53,b)].
1.33/1.59	56 -relation(A) | relation_rng(A) != B | -in(C,B) | in(ordered_pair(f4(A,B,C),C),A) # label(d5_relat_1) # label(axiom).  [clausify(27)].
1.33/1.59	Derived: relation_rng(A) != B | -in(C,B) | in(ordered_pair(f4(A,B,C),C),A) | -element(A,powerset(cartesian_product2(D,E))).  [resolve(56,a,53,b)].
1.33/1.59	57 -relation(A) | relation_rng(A) = B | -in(f5(A,B),B) | -in(ordered_pair(C,f5(A,B)),A) # label(d5_relat_1) # label(axiom).  [clausify(27)].
1.33/1.59	Derived: relation_rng(A) = B | -in(f5(A,B),B) | -in(ordered_pair(C,f5(A,B)),A) | -element(A,powerset(cartesian_product2(D,E))).  [resolve(57,a,53,b)].
1.33/1.59	58 -relation(A) | relation_rng(A) = B | in(f5(A,B),B) | in(ordered_pair(f6(A,B),f5(A,B)),A) # label(d5_relat_1) # label(axiom).  [clausify(27)].
1.33/1.59	Derived: relation_rng(A) = B | in(f5(A,B),B) | in(ordered_pair(f6(A,B),f5(A,B)),A) | -element(A,powerset(cartesian_product2(C,D))).  [resolve(58,a,53,b)].
1.33/1.59	
1.33/1.59	============================== end predicate elimination =============
1.33/1.59	
1.33/1.59	Auto_denials:  (non-Horn, no changes).
1.33/1.59	
1.33/1.59	Term ordering decisions:
1.33/1.59	Function symbol KB weights:  empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. cartesian_product2=1. ordered_pair=1. unordered_pair=1. f1=1. f2=1. f5=1. f6=1. f7=1. powerset=1. relation_rng=1. relation_dom=1. singleton=1. f3=1. f8=1. relation_rng_as_subset=1. f4=1.
1.33/1.59	
1.33/1.59	============================== end of process initial clauses ========
1.33/1.59	
1.33/1.59	============================== CLAUSES FOR SEARCH ====================
1.33/1.59	
1.33/1.59	============================== end of clauses for search =============
1.33/1.59	
1.33/1.59	============================== SEARCH ================================
1.33/1.59	
1.33/1.59	% Starting search at 0.01 seconds.
1.33/1.59	
1.33/1.59	Low Water (keep): wt=187.000, iters=3380
1.33/1.59	
1.33/1.59	Low Water (keep): wt=172.000, iters=3363
1.33/1.59	
1.33/1.59	Low Water (keep): wt=166.000, iters=3352
1.33/1.59	
1.33/1.59	Low Water (keep): wt=56.000, iters=3385
1.33/1.59	
1.33/1.59	Low Water (keep): wt=52Cputime limit exceeded (core dumped)
300.00/300.22	EOF