TSTP Solution File: SEU266+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU266+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 13:30:30 EDT 2022
% Result : Timeout 300.02s 300.27s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU266+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n005.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 03:42:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 4179 was started by sandbox2 on n005.cluster.edu,
% 0.43/1.01 Mon Jun 20 03:42:54 2022
% 0.43/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4026_n005.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_4026_n005.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (38 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 2 (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.43/1.01 3 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 4 (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.43/1.01 5 (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.43/1.01 6 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 7 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 9 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 10 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 11 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 12 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 13 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 14 (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.43/1.01 15 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 16 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 17 (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.43/1.01 18 (all A all B exists C relation_of2(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 19 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 20 (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.43/1.01 21 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 22 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 23 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 24 (all A all B all C (relation_of2(C,A,B) -> relation_rng_as_subset(A,B,C) = relation_rng(C))) # label(redefinition_k5_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 25 (all A all B all C (relation_of2_as_subset(C,A,B) <-> relation_of2(C,A,B))) # label(redefinition_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 26 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 27 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 28 (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.43/1.01 29 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 30 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 31 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 32 (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.01 33 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 34 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 35 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 36 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 37 -(all A all B all C (relation_of2_as_subset(C,A,B) -> ((all D -(in(D,B) & (all E -in(ordered_pair(E,D),C)))) <-> relation_rng_as_subset(A,B,C) = B))) # label(t23_relset_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01 38 element(A,powerset(B)) | -subset(A,B) # label(t3_subset) # label(axiom). [clausify(31)].
% 0.43/1.01 39 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(26)].
% 0.43/1.01 40 -element(A,powerset(B)) | subset(A,B) # label(t3_subset) # label(axiom). [clausify(31)].
% 0.43/1.01 Derived: element(A,powerset(A)). [resolve(38,b,39,a)].
% 0.43/1.01 41 -relation_of2_as_subset(A,B,C) | relation_of2(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(25)].
% 0.43/1.01 42 relation_of2_as_subset(c5,c3,c4) # label(t23_relset_1) # label(negated_conjecture). [clausify(37)].
% 0.43/1.01 43 relation_of2_as_subset(f6(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(20)].
% 0.43/1.01 Derived: relation_of2(c5,c3,c4). [resolve(41,a,42,a)].
% 0.43/1.01 Derived: relation_of2(f6(A,B),A,B). [resolve(41,a,43,a)].
% 0.43/1.01 44 relation_of2_as_subset(A,B,C) | -relation_of2(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(25)].
% 0.43/1.01 45 -relation_of2_as_subset(A,B,C) | element(A,powerset(cartesian_product2(B,C))) # label(dt_m2_relset_1) # label(axiom). [clausify(17)].
% 0.43/1.01 Derived: element(c5,powerset(cartesian_product2(c3,c4))). [resolve(45,a,42,a)].
% 0.43/1.01 Derived: element(f6(A,B),powerset(cartesian_product2(A,B))). [resolve(45,a,43,a)].
% 0.43/1.01 Derived: element(A,powerset(cartesian_product2(B,C))) | -relation_of2(A,B,C). [resolve(45,a,44,a)].
% 1.73/2.04 46 -relation_of2(A,B,C) | element(relation_rng_as_subset(B,C,A),powerset(C)) # label(dt_k5_relset_1) # label(axiom). [clausify(14)].
% 1.73/2.04 47 relation_of2(f4(A,B),A,B) # label(existence_m1_relset_1) # label(axiom). [clausify(18)].
% 1.73/2.04 Derived: element(relation_rng_as_subset(A,B,f4(A,B)),powerset(B)). [resolve(46,a,47,a)].
% 1.73/2.04 48 -relation_of2(A,B,C) | relation_rng_as_subset(B,C,A) = relation_rng(A) # label(redefinition_k5_relset_1) # label(axiom). [clausify(24)].
% 1.73/2.04 Derived: relation_rng_as_subset(A,B,f4(A,B)) = relation_rng(f4(A,B)). [resolve(48,a,47,a)].
% 1.73/2.04 49 relation_of2(c5,c3,c4). [resolve(41,a,42,a)].
% 1.73/2.04 Derived: element(relation_rng_as_subset(c3,c4,c5),powerset(c4)). [resolve(49,a,46,a)].
% 1.73/2.04 Derived: relation_rng_as_subset(c3,c4,c5) = relation_rng(c5). [resolve(49,a,48,a)].
% 1.73/2.04 50 relation_of2(f6(A,B),A,B). [resolve(41,a,43,a)].
% 1.73/2.04 Derived: element(relation_rng_as_subset(A,B,f6(A,B)),powerset(B)). [resolve(50,a,46,a)].
% 1.73/2.04 Derived: relation_rng_as_subset(A,B,f6(A,B)) = relation_rng(f6(A,B)). [resolve(50,a,48,a)].
% 1.73/2.04 51 element(A,powerset(cartesian_product2(B,C))) | -relation_of2(A,B,C). [resolve(45,a,44,a)].
% 1.73/2.04 Derived: element(f4(A,B),powerset(cartesian_product2(A,B))). [resolve(51,b,47,a)].
% 1.73/2.04 Derived: element(c5,powerset(cartesian_product2(c3,c4))). [resolve(51,b,49,a)].
% 1.73/2.04 Derived: element(f6(A,B),powerset(cartesian_product2(A,B))). [resolve(51,b,50,a)].
% 1.73/2.04 52 -relation(A) | -in(ordered_pair(B,C),A) | in(B,relation_dom(A)) # label(t20_relat_1) # label(axiom). [clausify(28)].
% 1.73/2.04 53 -element(A,powerset(cartesian_product2(B,C))) | relation(A) # label(cc1_relset_1) # label(axiom). [clausify(2)].
% 1.73/2.04 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.73/2.04 54 -relation(A) | -in(ordered_pair(B,C),A) | in(C,relation_rng(A)) # label(t20_relat_1) # label(axiom). [clausify(28)].
% 1.73/2.04 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.73/2.04 55 -relation(A) | relation_rng(A) != B | in(C,B) | -in(ordered_pair(D,C),A) # label(d5_relat_1) # label(axiom). [clausify(4)].
% 1.73/2.04 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.73/2.04 56 -relation(A) | relation_rng(A) != B | -in(C,B) | in(ordered_pair(f1(A,B,C),C),A) # label(d5_relat_1) # label(axiom). [clausify(4)].
% 1.73/2.04 Derived: relation_rng(A) != B | -in(C,B) | in(ordered_pair(f1(A,B,C),C),A) | -element(A,powerset(cartesian_product2(D,E))). [resolve(56,a,53,b)].
% 1.73/2.04 57 -relation(A) | relation_rng(A) = B | -in(f2(A,B),B) | -in(ordered_pair(C,f2(A,B)),A) # label(d5_relat_1) # label(axiom). [clausify(4)].
% 1.73/2.04 Derived: relation_rng(A) = B | -in(f2(A,B),B) | -in(ordered_pair(C,f2(A,B)),A) | -element(A,powerset(cartesian_product2(D,E))). [resolve(57,a,53,b)].
% 1.73/2.04 58 -relation(A) | relation_rng(A) = B | in(f2(A,B),B) | in(ordered_pair(f3(A,B),f2(A,B)),A) # label(d5_relat_1) # label(axiom). [clausify(4)].
% 1.73/2.04 Derived: relation_rng(A) = B | in(f2(A,B),B) | in(ordered_pair(f3(A,B),f2(A,B)),A) | -element(A,powerset(cartesian_product2(C,D))). [resolve(58,a,53,b)].
% 1.73/2.04
% 1.73/2.04 ============================== end predicate elimination =============
% 1.73/2.04
% 1.73/2.04 Auto_denials: (non-Horn, no changes).
% 1.73/2.04
% 1.73/2.04 Term ordering decisions:
% 1.73/2.04 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. f2=1. f3=1. f4=1. f6=1. f7=1. powerset=1. relation_rng=1. relation_dom=1. singleton=1. f5=1. f8=1. relation_rng_as_subset=1. f1=1.
% 1.73/2.04
% 1.73/2.04 ============================== end of process initial clauses ========
% 1.73/2.04
% 1.73/2.04 ============================== CLAUSES FOR SEARCH ====================
% 1.73/2.04
% 1.73/2.04 ============================== end of clauses for search =============
% 1.73/2.04
% 1.73/2.04 ============================== SEARCH ================================
% 1.73/2.04
% 1.73/2.04 % Starting search at 0.02 seconds.
% 1.73/2.04
% 1.73/2.04 Low Water (keep): wt=187.000, iters=3380
% 1.73/2.04
% 1.73/2.04 Low Water (keep): wt=172.000, iters=3363
% 1.73/2.04
% 1.73/2.04 Low Water (keep): wt=166.000, iters=3352
% 1.73/2.04
% 1.73/2.04 Low Water (keep): wt=56.000, iters=3440
% 1.73/2.04
% 1.73/2.04 Low Water (keep): wt=55.000, iters=3469
% 1.73/2.04
% 300.02/300.27 Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------