0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n018.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 : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Mon Jul 3 11:23:31 EDT 2023 0.12/0.33 % CPUTime : 0.43/1.00 ============================== Prover9 =============================== 0.43/1.00 Prover9 (32) version 2009-11A, November 2009. 0.43/1.00 Process 5693 was started by sandbox on n018.cluster.edu, 0.43/1.00 Mon Jul 3 11:23:31 2023 0.43/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_5540_n018.cluster.edu". 0.43/1.00 ============================== end of head =========================== 0.43/1.00 0.43/1.00 ============================== INPUT ================================= 0.43/1.00 0.43/1.00 % Reading from file /tmp/Prover9_5540_n018.cluster.edu 0.43/1.00 0.43/1.00 set(prolog_style_variables). 0.43/1.00 set(auto2). 0.43/1.00 % set(auto2) -> set(auto). 0.43/1.00 % set(auto) -> set(auto_inference). 0.43/1.00 % set(auto) -> set(auto_setup). 0.43/1.00 % set(auto_setup) -> set(predicate_elim). 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold). 0.43/1.00 % set(auto) -> set(auto_limits). 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000"). 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000). 0.43/1.00 % set(auto) -> set(auto_denials). 0.43/1.00 % set(auto) -> set(auto_process). 0.43/1.00 % set(auto2) -> assign(new_constants, 1). 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3). 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000"). 0.43/1.00 % set(auto2) -> assign(max_hours, 1). 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.43/1.00 % set(auto2) -> assign(max_seconds, 0). 0.43/1.00 % set(auto2) -> assign(max_minutes, 5). 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.43/1.00 % set(auto2) -> set(sort_initial_sos). 0.43/1.00 % set(auto2) -> assign(sos_limit, -1). 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000). 0.43/1.00 % set(auto2) -> assign(max_megs, 400). 0.43/1.00 % set(auto2) -> assign(stats, some). 0.43/1.00 % set(auto2) -> clear(echo_input). 0.43/1.00 % set(auto2) -> set(quiet). 0.43/1.00 % set(auto2) -> clear(print_initial_clauses). 0.43/1.00 % set(auto2) -> clear(print_given). 0.43/1.00 assign(lrs_ticks,-1). 0.43/1.00 assign(sos_limit,10000). 0.43/1.00 assign(order,kbo). 0.43/1.00 set(lex_order_vars). 0.43/1.00 clear(print_given). 0.43/1.00 0.43/1.00 % formulas(sos). % not echoed (41 formulas) 0.43/1.00 0.43/1.00 ============================== end of input ========================== 0.43/1.00 0.43/1.00 % From the command line: assign(max_seconds, 1440). 0.43/1.00 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.43/1.00 0.43/1.00 % Formulas that are not ordinary clauses: 0.43/1.00 1 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 2 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 3 (all A all B all C -(in(A,B) & empty(C) & element(B,powerset(C)))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 4 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 5 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 6 (all A (-empty(A) -> (exists B (-empty(B) & element(B,powerset(A)))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 7 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 8 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 9 (all A (relation(A) & function(A) -> (all B all C ((all D (in(apply(A,D),B) & in(D,relation_dom(A)) <-> in(D,C))) <-> C = relation_inverse_image(A,B))))) # label(d13_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 10 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 11 (all A all B all C (in(A,B) & element(B,powerset(C)) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 12 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 13 (all A all B ((all C (in(C,A) <-> in(C,B))) -> B = A)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 14 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 15 (all A (empty(A) -> relation(relation_dom(A)) & empty(relation_dom(A)))) # label(fc7_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 16 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 17 (exists A (relation(A) & function(A) & empty(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 18 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 19 (exists A (-empty(A) & relation(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 20 (exists A (relation_empty_yielding(A) & relation(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 21 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 22 (all A empty_set = set_intersection2(A,empty_set)) # label(t2_boole) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 23 (all A all B -(empty(A) & empty(B) & B != A)) # label(t8_boole) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 24 (all A (empty(A) -> relation(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 25 (all A all B (relation(B) & relation(A) -> relation(set_intersection2(A,B)))) # label(fc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 26 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 27 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 28 (all A (relation(A) & -empty(A) -> -empty(relation_dom(A)))) # label(fc5_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 29 (all A all B all C (set_intersection2(A,B) = C <-> (all D (in(D,B) & in(D,A) <-> in(D,C))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 30 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 31 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 32 (all A (relation(A) & empty(A) & function(A) -> relation(A) & one_to_one(A) & function(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 33 (all A all B A = set_intersection2(A,A)) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 34 (exists A (function(A) & relation(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 35 -(all A all B all C (function(C) & relation(C) -> relation_inverse_image(C,set_intersection2(A,B)) = set_intersection2(relation_inverse_image(C,A),relation_inverse_image(C,B)))) # label(t137_funct_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.43/1.00 0.43/1.00 ============================== end of process non-clausal formulas === 0.43/1.00 0.43/1.00 ============================== PROCESS INITIAL CLAUSES =============== 0.43/1.00 0.43/1.00 ============================== PREDICATE ELIMINATION ================= 0.43/1.00 36 -relation(A) | -empty(A) | -function(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom). [clausify(32)]. 0.43/1.00 37 function(c4) # label(rc3_funct_1) # label(axiom). [clausify(14)]. 0.43/1.00 38 function(c5) # label(rc2_funct_1) # label(axiom). [clausify(17)]. 0.43/1.00 39 function(c8) # label(rc1_funct_1) # label(axiom). [clausify(34)]. 0.43/1.00 40 function(c11) # label(t137_funct_1) # label(negated_conjecture). [clausify(35)]. 0.43/1.00 41 -empty(A) | function(A) # label(cc1_funct_1) # label(axiom). [clausify(7)]. 0.43/1.00 Derived: -relation(c4) | -empty(c4) | one_to_one(c4). [resolve(36,c,37,a)]. 0.43/1.00 Derived: -relation(c5) | -empty(c5) | one_to_one(c5). [resolve(36,c,38,a)]. 0.43/1.00 Derived: -relation(c8) | -empty(c8) | one_to_one(c8). [resolve(36,c,39,a)]. 0.43/1.00 Derived: -relation(c11) | -empty(c11) | one_to_one(c11). [resolve(36,c,40,a)]. 0.43/1.00 Derived: -relation(A) | -empty(A) | one_to_one(A) | -empty(A). [resolve(36,c,41,b)]. 0.43/1.00 42 -relation(A) | -function(A) | in(B,relation_dom(A)) | -in(B,C) | relation_inverse_image(A,D) != C # label(d13_funct_1) # label(axiom). [clausify(9)]. 0.43/1.00 Derived: -relation(c4) | in(A,relation_dom(c4)) | -in(A,B) | relation_inverse_image(c4,C) != B. [resolve(42,b,37,a)]. 0.43/1.00 Derived: -relation(c5) | in(A,relation_dom(c5)) | -in(A,B) | relation_inverse_image(c5,C) != B. [resolve(42,b,38,a)]. 0.43/1.00 Derived: -relation(c8) | in(A,relation_dom(c8)) | -in(A,B) | relation_inverse_image(c8,C) != B. [resolve(42,b,39,a)]. 0.43/1.00 Derived: -relation(c11) | in(A,relation_dom(c11)) | -in(A,B) | relation_inverse_image(c11,C) != B. [resolve(42,b,40,a)]. 0.43/1.00 Derived: -relation(A) | in(B,relation_dom(A)) | -in(B,C) | relation_inverse_image(A,D) != C | -empty(A). [resolve(42,b,41,b)]. 0.43/1.00 43 -relation(A) | -function(A) | in(apply(A,B),C) | -in(B,D) | relation_inverse_image(A,C) != D # label(d13_funct_1) # label(axiom). [clausify(9)]. 0.43/1.00 Derived: -relation(c4) | in(apply(c4,A),B) | -in(A,C) | relation_inverse_image(c4,B) != C. [resolve(43,b,37,a)]. 0.43/1.00 Derived: -relation(c5) | in(apply(c5,A),B) | -in(A,C) | relation_inverse_image(c5,B) != C. [resolve(43,b,38,a)]. 0.43/1.00 Derived: -relation(c8) | in(apply(c8,A),B) | -in(A,C) | relation_inverse_image(c8,B) != C. [resolve(43,b,39,a)]. 0.43/1.00 Derived: -relation(c11) | in(apply(c11,A),B) | -in(A,C) | relation_inverse_image(c11,B) != C. [resolve(43,b,40,a)]. 0.43/1.00 Derived: -relation(A) | in(apply(A,B),C) | -in(B,D) | relation_inverse_image(A,C) != D | -empty(A). [resolve(43,b,41,b)]. 0.43/1.00 44 -relation(A) | -function(A) | -in(apply(A,B),C) | -in(B,relation_dom(A)) | in(B,D) | relation_inverse_image(A,C) != D # label(d13_funct_1) # label(axiom). [clausify(9)]. 0.43/1.00 Derived: -relation(c4) | -in(apply(c4,A),B) | -in(A,relation_dom(c4)) | in(A,C) | relation_inverse_image(c4,B) != C. [resolve(44,b,37,a)]. 0.43/1.00 Derived: -relation(c5) | -in(apply(c5,A),B) | -in(A,relation_dom(c5)) | in(A,C) | relation_inverse_image(c5,B) != C. [resolve(44,b,38,a)]. 0.43/1.00 Derived: -relation(c8) | -in(apply(c8,A),B) | -in(A,relation_dom(c8)) | in(A,C) | relation_inverse_image(c8,B) != C. [resolve(44,b,39,a)]. 0.43/1.00 Derived: -relation(c11) | -in(apply(c11,A),B) | -in(A,relation_dom(c11)) | in(A,C) | relation_inverse_image(c11,B) != C. [resolve(44,b,40,a)]. 0.43/1.00 Derived: -relation(A) | -in(apply(A,B),C) | -in(B,relation_dom(A)) | in(B,D) | relation_inverse_image(A,C) != D | -empty(A). [resolve(44,b,41,b)]. 0.43/1.00 45 -relation(A) | -function(A) | in(f2(A,B,C),relation_dom(A)) | in(f2(A,B,C),C) | relation_inverse_image(A,B) = C # label(d13_funct_1) # label(axiom). [clausify(9)]. 0.43/1.00 Derived: -relation(c4) | in(f2(c4,A,B),relation_dom(c4)) | in(f2(c4,A,B),B) | relation_inverse_image(c4,A) = B. [resolve(45,b,37,a)]. 0.43/1.00 Derived: -relation(c5) | in(f2(c5,A,B),relation_dom(c5)) | in(f2(c5,A,B),B) | relation_inverse_image(c5,A) = B. [resolve(45,b,38,a)]. 0.43/1.00 Derived: -relation(c8) | in(f2(c8,A,B),relation_dom(c8)) | in(f2(c8,A,B),B) | relation_inverse_image(c8,A) = B. [resolve(45,b,39,a)]. 0.43/1.00 Derived: -relation(c11) | in(f2(c11,A,B),relation_dom(c11)) | in(f2(c11,A,B),B) | relation_inverse_image(c11,A) = B. [resolve(45,b,40,a)]. 0.43/1.00 Derived: -relation(A) | in(f2(A,B,C),relation_dom(A)) | in(f2(A,B,C),C) | relation_inverse_image(A,B) = C | -empty(A). [resolve(45,b,41,b)]. 0.43/1.00 46 -relation(A) | -function(A) | in(apply(A,f2(A,B,C)),B) | in(f2(A,B,C),C) | relation_inverse_image(A,B) = C # label(d13_funct_1) # label(axiom). [clausify(9)]. 0.43/1.00 Derived: -relation(c4) | in(apply(c4,f2(c4,A,B)),A) | in(f2(c4,A,B),B) | relation_inverse_image(c4,A) = B. [resolve(46,b,37,a)]. 0.43/1.00 Derived: -relation(c5) | in(apply(c5,f2(c5,A,B)),A) | in(f2(c5,A,B),B) | relation_inverse_image(c5,A) = B. [resolve(46,b,38,a)]. 0.43/1.00 Derived: -relation(c8) | in(apply(c8,f2(c8,A,B)),A) | in(f2(c8,A,B),B) | relation_inverse_image(c8,A) = B. [resolve(46,b,39,a)]. 0.43/1.00 Derived: -relation(c11) | in(apply(c11,f2(c11,A,B)),A) | in(f2(c11,A,B),B) | relation_inverse_image(c11,A) = B. [resolve(46,b,40,a)]. 0.43/1.00 Derived: -relation(A) | in(apply(A,f2(A,B,C)),B) | in(f2(A,B,C),C) | relation_inverse_image(A,B) = C | -empty(A). [resolve(46,b,41,b)]. 0.43/1.00 47 -relation(A) | -function(A) | -in(apply(A,f2(A,B,C)),B) | -in(f2(A,B,C),relation_dom(A)) | -in(f2(A,B,C),C) | relation_inverse_image(A,B) = C # label(d13_funct_1) # label(axiom). [clausify(9)]. 0.43/1.00 Derived: -relation(c4) | -in(apply(c4,f2(c4,A,B)),A) | -in(f2(c4,A,B),relation_dom(c4)) | -in(f2(c4,A,B),B) | relation_inverse_image(c4,A) = B. [resolve(47,b,37,a)].Alarm clock 179.73/180.09 Prover9 interrupted 179.73/180.09 EOF