TSTP Solution File: SEU363+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU363+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:31:16 EDT 2022
% Result : Theorem 6.95s 7.26s
% Output : Refutation 6.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU363+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n003.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 : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 23:12:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.99 ============================== Prover9 ===============================
% 0.69/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.99 Process 15149 was started by sandbox2 on n003.cluster.edu,
% 0.69/0.99 Sun Jun 19 23:12:30 2022
% 0.69/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14891_n003.cluster.edu".
% 0.69/0.99 ============================== end of head ===========================
% 0.69/0.99
% 0.69/0.99 ============================== INPUT =================================
% 0.69/0.99
% 0.69/0.99 % Reading from file /tmp/Prover9_14891_n003.cluster.edu
% 0.69/0.99
% 0.69/0.99 set(prolog_style_variables).
% 0.69/0.99 set(auto2).
% 0.69/0.99 % set(auto2) -> set(auto).
% 0.69/0.99 % set(auto) -> set(auto_inference).
% 0.69/0.99 % set(auto) -> set(auto_setup).
% 0.69/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.99 % set(auto) -> set(auto_limits).
% 0.69/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.99 % set(auto) -> set(auto_denials).
% 0.69/0.99 % set(auto) -> set(auto_process).
% 0.69/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.99 % set(auto2) -> assign(stats, some).
% 0.69/0.99 % set(auto2) -> clear(echo_input).
% 0.69/0.99 % set(auto2) -> set(quiet).
% 0.69/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.99 % set(auto2) -> clear(print_given).
% 0.69/0.99 assign(lrs_ticks,-1).
% 0.69/0.99 assign(sos_limit,10000).
% 0.69/0.99 assign(order,kbo).
% 0.69/0.99 set(lex_order_vars).
% 0.69/0.99 clear(print_given).
% 0.69/0.99
% 0.69/0.99 % formulas(sos). % not echoed (47 formulas)
% 0.69/0.99
% 0.69/0.99 ============================== end of input ==========================
% 0.69/0.99
% 0.69/0.99 % From the command line: assign(max_seconds, 300).
% 0.69/0.99
% 0.69/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.99
% 0.69/0.99 % Formulas that are not ordinary clauses:
% 0.69/0.99 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 2 (all A (empty(A) -> finite(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 3 (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.69/0.99 4 (all A (finite(A) -> (all B (element(B,powerset(A)) -> finite(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 5 (all A (rel_str(A) -> (all B (subrelstr(B,A) -> (full_subrelstr(B,A) <-> the_InternalRel(B) = relation_restriction_as_relation_of(the_InternalRel(A),the_carrier(B))))))) # label(d14_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 6 (all A (rel_str(A) -> (all B (element(B,the_carrier(A)) -> (all C (element(C,the_carrier(A)) -> (related(A,B,C) <-> in(ordered_pair(B,C),the_InternalRel(A))))))))) # label(d9_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 7 (all A all B (relation(A) -> relation_of2_as_subset(relation_restriction_as_relation_of(A,B),B,B))) # label(dt_k1_toler_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 9 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 10 (all A all B (relation(A) -> relation(relation_restriction(A,B)))) # label(dt_k2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 11 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 12 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 13 (all A (rel_str(A) -> one_sorted_str(A))) # label(dt_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 14 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 15 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 16 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 17 (all A (rel_str(A) -> (all B (subrelstr(B,A) -> rel_str(B))))) # label(dt_m1_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 18 (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.69/0.99 19 (all A (rel_str(A) -> relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)))) # label(dt_u1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 20 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 21 (exists A rel_str(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 22 (exists A one_sorted_str(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 23 (all A all B exists C relation_of2(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 24 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 25 (all A (rel_str(A) -> (exists B subrelstr(B,A)))) # label(existence_m1_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 26 (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.69/0.99 27 (all A all B (finite(A) & finite(B) -> finite(cartesian_product2(A,B)))) # label(fc14_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 28 (exists A (-empty(A) & finite(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 29 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 30 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 31 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc3_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 32 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc4_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 33 (all A all B (relation(A) -> relation_restriction_as_relation_of(A,B) = relation_restriction(A,B))) # label(redefinition_k1_toler_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 34 (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.69/0.99 35 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 36 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(t106_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 37 (all A all B all C (relation(C) -> (in(A,relation_restriction(C,B)) <-> in(A,C) & in(A,cartesian_product2(B,B))))) # label(t16_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 38 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 39 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 40 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 41 (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.69/0.99 42 (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.69/0.99 43 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 44 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 45 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 46 -(all A (rel_str(A) -> (all B (full_subrelstr(B,A) & subrelstr(B,A) -> (all C (element(C,the_carrier(A)) -> (all D (element(D,the_carrier(A)) -> (all E (element(E,the_carrier(B)) -> (all F (element(F,the_carrier(B)) -> (E = C & F = D & related(A,C,D) & in(E,the_carrier(B)) & in(F,the_carrier(B)) -> related(B,E,F)))))))))))))) # label(t61_yellow_0) # label(negated_conjecture) # label(non_clause). [assumption].
% 6.95/7.26
% 6.95/7.26 ============================== end of process non-clausal formulas ===
% 6.95/7.26
% 6.95/7.26 ============================== PROCESS INITIAL CLAUSES ===============
% 6.95/7.26
% 6.95/7.26 ============================== PREDICATE ELIMINATION =================
% 6.95/7.26 47 element(A,powerset(B)) | -subset(A,B) # label(t3_subset) # label(axiom). [clausify(40)].
% 6.95/7.26 48 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(35)].
% 6.95/7.26 49 -element(A,powerset(B)) | subset(A,B) # label(t3_subset) # label(axiom). [clausify(40)].
% 6.95/7.26 Derived: element(A,powerset(A)). [resolve(47,b,48,a)].
% 6.95/7.26 50 -rel_str(A) | -subrelstr(B,A) | -full_subrelstr(B,A) | relation_restriction_as_relation_of(the_InternalRel(A),the_carrier(B)) = the_InternalRel(B) # label(d14_yellow_0) # label(axiom). [clausify(5)].
% 6.95/7.26 51 full_subrelstr(c7,c6) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 Derived: -rel_str(c6) | -subrelstr(c7,c6) | relation_restriction_as_relation_of(the_InternalRel(c6),the_carrier(c7)) = the_InternalRel(c7). [resolve(50,c,51,a)].
% 6.95/7.26 52 -rel_str(A) | -subrelstr(B,A) | full_subrelstr(B,A) | relation_restriction_as_relation_of(the_InternalRel(A),the_carrier(B)) != the_InternalRel(B) # label(d14_yellow_0) # label(axiom). [clausify(5)].
% 6.95/7.26 53 relation_of2_as_subset(A,B,C) | -relation_of2(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(34)].
% 6.95/7.26 54 relation_of2(f1(A,B),A,B) # label(existence_m1_relset_1) # label(axiom). [clausify(23)].
% 6.95/7.26 55 -relation_of2_as_subset(A,B,C) | relation_of2(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(34)].
% 6.95/7.26 Derived: relation_of2_as_subset(f1(A,B),A,B). [resolve(53,b,54,a)].
% 6.95/7.26 56 -relation_of2_as_subset(A,B,C) | element(A,powerset(cartesian_product2(B,C))) # label(dt_m2_relset_1) # label(axiom). [clausify(18)].
% 6.95/7.26 57 relation_of2_as_subset(f4(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(26)].
% 6.95/7.26 58 -relation(A) | relation_of2_as_subset(relation_restriction_as_relation_of(A,B),B,B) # label(dt_k1_toler_1) # label(axiom). [clausify(7)].
% 6.95/7.26 59 -rel_str(A) | relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)) # label(dt_u1_orders_2) # label(axiom). [clausify(19)].
% 6.95/7.26 Derived: element(f4(A,B),powerset(cartesian_product2(A,B))). [resolve(56,a,57,a)].
% 6.95/7.26 Derived: element(relation_restriction_as_relation_of(A,B),powerset(cartesian_product2(B,B))) | -relation(A). [resolve(56,a,58,b)].
% 6.95/7.26 Derived: element(the_InternalRel(A),powerset(cartesian_product2(the_carrier(A),the_carrier(A)))) | -rel_str(A). [resolve(56,a,59,b)].
% 6.95/7.26 60 relation_of2_as_subset(f1(A,B),A,B). [resolve(53,b,54,a)].
% 6.95/7.26 Derived: element(f1(A,B),powerset(cartesian_product2(A,B))). [resolve(60,a,56,a)].
% 6.95/7.26
% 6.95/7.26 ============================== end predicate elimination =============
% 6.95/7.26
% 6.95/7.26 Auto_denials: (non-Horn, no changes).
% 6.95/7.26
% 6.95/7.26 Term ordering decisions:
% 6.95/7.26 Function symbol KB weights: empty_set=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. cartesian_product2=1. ordered_pair=1. relation_restriction=1. relation_restriction_as_relation_of=1. f1=1. f4=1. the_carrier=1. powerset=1. the_InternalRel=1. f2=1. f3=1. f5=1. f6=1.
% 6.95/7.26
% 6.95/7.26 ============================== end of process initial clauses ========
% 6.95/7.26
% 6.95/7.26 ============================== CLAUSES FOR SEARCH ====================
% 6.95/7.26
% 6.95/7.26 ============================== end of clauses for search =============
% 6.95/7.26
% 6.95/7.26 ============================== SEARCH ================================
% 6.95/7.26
% 6.95/7.26 % Starting search at 0.02 seconds.
% 6.95/7.26
% 6.95/7.26 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.18 sec).
% 6.95/7.26
% 6.95/7.26 Low Water (keep): wt=12.000, iters=3447
% 6.95/7.26
% 6.95/7.26 Low Water (keep): wt=11.000, iters=3343
% 6.95/7.26
% 6.95/7.26 Low Water (keep): wt=10.000, iters=3528
% 6.95/7.26
% 6.95/7.26 Low Water (displace): id=8000, wt=17.000
% 6.95/7.26
% 6.95/7.26 Low Water (displace): id=9050, wt=16.000
% 6.95/7.26
% 6.95/7.26 Low Water (displace): id=9748, wt=15.000
% 6.95/7.26
% 6.95/7.26 ============================== PROOF =================================
% 6.95/7.26 % SZS status Theorem
% 6.95/7.26 % SZS output start Refutation
% 6.95/7.26
% 6.95/7.26 % Proof 1 at 5.93 (+ 0.36) seconds.
% 6.95/7.26 % Length of proof is 54.
% 6.95/7.26 % Level of proof is 7.
% 6.95/7.26 % Maximum clause weight is 20.000.
% 6.95/7.26 % Given clauses 7225.
% 6.95/7.26
% 6.95/7.26 3 (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].
% 6.95/7.26 5 (all A (rel_str(A) -> (all B (subrelstr(B,A) -> (full_subrelstr(B,A) <-> the_InternalRel(B) = relation_restriction_as_relation_of(the_InternalRel(A),the_carrier(B))))))) # label(d14_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 6.95/7.26 6 (all A (rel_str(A) -> (all B (element(B,the_carrier(A)) -> (all C (element(C,the_carrier(A)) -> (related(A,B,C) <-> in(ordered_pair(B,C),the_InternalRel(A))))))))) # label(d9_orders_2) # label(axiom) # label(non_clause). [assumption].
% 6.95/7.26 17 (all A (rel_str(A) -> (all B (subrelstr(B,A) -> rel_str(B))))) # label(dt_m1_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 6.95/7.26 18 (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].
% 6.95/7.26 19 (all A (rel_str(A) -> relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)))) # label(dt_u1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 6.95/7.26 33 (all A all B (relation(A) -> relation_restriction_as_relation_of(A,B) = relation_restriction(A,B))) # label(redefinition_k1_toler_1) # label(axiom) # label(non_clause). [assumption].
% 6.95/7.26 36 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(t106_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 6.95/7.26 37 (all A all B all C (relation(C) -> (in(A,relation_restriction(C,B)) <-> in(A,C) & in(A,cartesian_product2(B,B))))) # label(t16_wellord1) # label(axiom) # label(non_clause). [assumption].
% 6.95/7.26 46 -(all A (rel_str(A) -> (all B (full_subrelstr(B,A) & subrelstr(B,A) -> (all C (element(C,the_carrier(A)) -> (all D (element(D,the_carrier(A)) -> (all E (element(E,the_carrier(B)) -> (all F (element(F,the_carrier(B)) -> (E = C & F = D & related(A,C,D) & in(E,the_carrier(B)) & in(F,the_carrier(B)) -> related(B,E,F)))))))))))))) # label(t61_yellow_0) # label(negated_conjecture) # label(non_clause). [assumption].
% 6.95/7.26 50 -rel_str(A) | -subrelstr(B,A) | -full_subrelstr(B,A) | relation_restriction_as_relation_of(the_InternalRel(A),the_carrier(B)) = the_InternalRel(B) # label(d14_yellow_0) # label(axiom). [clausify(5)].
% 6.95/7.26 51 full_subrelstr(c7,c6) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 56 -relation_of2_as_subset(A,B,C) | element(A,powerset(cartesian_product2(B,C))) # label(dt_m2_relset_1) # label(axiom). [clausify(18)].
% 6.95/7.26 59 -rel_str(A) | relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)) # label(dt_u1_orders_2) # label(axiom). [clausify(19)].
% 6.95/7.26 65 rel_str(c6) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 66 subrelstr(c7,c6) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 67 c10 = c8 # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 68 c11 = c9 # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 70 element(c8,the_carrier(c6)) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 71 element(c9,the_carrier(c6)) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 72 element(c10,the_carrier(c7)) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 73 element(c8,the_carrier(c7)). [copy(72),rewrite([67(1)])].
% 6.95/7.26 74 element(c11,the_carrier(c7)) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 75 element(c9,the_carrier(c7)). [copy(74),rewrite([68(1)])].
% 6.95/7.26 76 related(c6,c8,c9) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 77 in(c10,the_carrier(c7)) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 78 in(c8,the_carrier(c7)). [copy(77),rewrite([67(1)])].
% 6.95/7.26 79 in(c11,the_carrier(c7)) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 80 in(c9,the_carrier(c7)). [copy(79),rewrite([68(1)])].
% 6.95/7.26 87 -related(c7,c10,c11) # label(t61_yellow_0) # label(negated_conjecture). [clausify(46)].
% 6.95/7.26 88 -related(c7,c8,c9). [copy(87),rewrite([67(2),68(3)])].
% 6.95/7.26 99 -rel_str(A) | -subrelstr(B,A) | rel_str(B) # label(dt_m1_yellow_0) # label(axiom). [clausify(17)].
% 6.95/7.26 101 -element(A,powerset(cartesian_product2(B,C))) | relation(A) # label(cc1_relset_1) # label(axiom). [clausify(3)].
% 6.95/7.26 105 -relation(A) | relation_restriction(A,B) = relation_restriction_as_relation_of(A,B) # label(redefinition_k1_toler_1) # label(axiom). [clausify(33)].
% 6.95/7.26 106 -relation(A) | relation_restriction_as_relation_of(A,B) = relation_restriction(A,B). [copy(105),flip(b)].
% 6.95/7.26 112 in(ordered_pair(A,B),cartesian_product2(C,D)) | -in(A,C) | -in(B,D) # label(t106_zfmisc_1) # label(axiom). [clausify(36)].
% 6.95/7.26 113 -relation(A) | in(B,relation_restriction(A,C)) | -in(B,A) | -in(B,cartesian_product2(C,C)) # label(t16_wellord1) # label(axiom). [clausify(37)].
% 6.95/7.26 114 -rel_str(A) | -element(B,the_carrier(A)) | -element(C,the_carrier(A)) | -related(A,B,C) | in(ordered_pair(B,C),the_InternalRel(A)) # label(d9_orders_2) # label(axiom). [clausify(6)].
% 6.95/7.26 115 -rel_str(A) | -element(B,the_carrier(A)) | -element(C,the_carrier(A)) | related(A,B,C) | -in(ordered_pair(B,C),the_InternalRel(A)) # label(d9_orders_2) # label(axiom). [clausify(6)].
% 6.95/7.26 117 -rel_str(c6) | -subrelstr(c7,c6) | relation_restriction_as_relation_of(the_InternalRel(c6),the_carrier(c7)) = the_InternalRel(c7). [resolve(50,c,51,a)].
% 6.95/7.26 118 relation_restriction_as_relation_of(the_InternalRel(c6),the_carrier(c7)) = the_InternalRel(c7). [copy(117),unit_del(a,65),unit_del(b,66)].
% 6.95/7.26 121 element(the_InternalRel(A),powerset(cartesian_product2(the_carrier(A),the_carrier(A)))) | -rel_str(A). [resolve(56,a,59,b)].
% 6.95/7.26 148 rel_str(c7). [resolve(99,b,66,a),unit_del(a,65)].
% 6.95/7.26 167 in(ordered_pair(c8,A),cartesian_product2(the_carrier(c7),B)) | -in(A,B). [resolve(112,b,78,a)].
% 6.95/7.26 172 in(ordered_pair(c8,c9),the_InternalRel(c6)). [resolve(114,d,76,a),unit_del(a,65),unit_del(b,70),unit_del(c,71)].
% 6.95/7.26 179 element(the_InternalRel(c6),powerset(cartesian_product2(the_carrier(c6),the_carrier(c6)))). [resolve(121,b,65,a)].
% 6.95/7.26 212 -in(ordered_pair(c8,c9),the_InternalRel(c7)). [ur(115,a,148,a,b,73,a,c,75,a,d,88,a)].
% 6.95/7.26 373 -relation(the_InternalRel(c6)) | in(ordered_pair(c8,c9),relation_restriction(the_InternalRel(c6),A)) | -in(ordered_pair(c8,c9),cartesian_product2(A,A)). [resolve(172,a,113,c)].
% 6.95/7.26 1085 in(ordered_pair(c8,c9),cartesian_product2(the_carrier(c7),the_carrier(c7))). [resolve(167,b,80,a)].
% 6.95/7.26 1558 relation(the_InternalRel(c6)). [resolve(179,a,101,a)].
% 6.95/7.26 1560 in(ordered_pair(c8,c9),relation_restriction(the_InternalRel(c6),A)) | -in(ordered_pair(c8,c9),cartesian_product2(A,A)). [back_unit_del(373),unit_del(a,1558)].
% 6.95/7.26 1578 relation_restriction_as_relation_of(the_InternalRel(c6),A) = relation_restriction(the_InternalRel(c6),A). [resolve(1558,a,106,a)].
% 6.95/7.26 1583 relation_restriction(the_InternalRel(c6),the_carrier(c7)) = the_InternalRel(c7). [back_rewrite(118),rewrite([1578(5)])].
% 6.95/7.26 17364 $F. [resolve(1560,b,1085,a),rewrite([1583(8)]),unit_del(a,212)].
% 6.95/7.26
% 6.95/7.26 % SZS output end Refutation
% 6.95/7.26 ============================== end of proof ==========================
% 6.95/7.26
% 6.95/7.26 ============================== STATISTICS ============================
% 6.95/7.26
% 6.95/7.26 Given=7225. Generated=679113. Kept=17296. proofs=1.
% 6.95/7.26 Usable=7220. Sos=9612. Demods=23. Limbo=0, Disabled=535. Hints=0.
% 6.95/7.26 Megabytes=11.21.
% 6.95/7.26 User_CPU=5.93, System_CPU=0.36, Wall_clock=6.
% 6.95/7.26
% 6.95/7.26 ============================== end of statistics =====================
% 6.95/7.26
% 6.95/7.26 ============================== end of search =========================
% 6.95/7.26
% 6.95/7.26 THEOREM PROVED
% 6.95/7.26 % SZS status Theorem
% 6.95/7.26
% 6.95/7.26 Exiting with 1 proof.
% 6.95/7.26
% 6.95/7.26 Process 15149 exit (max_proofs) Sun Jun 19 23:12:36 2022
% 6.95/7.26 Prover9 interrupted
%------------------------------------------------------------------------------