TSTP Solution File: SET103+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET103+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 04:27:18 EDT 2022
% Result : Theorem 6.01s 6.31s
% Output : Refutation 6.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET103+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 Jul 10 17:22:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.03 ============================== Prover9 ===============================
% 0.70/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.03 Process 28574 was started by sandbox on n023.cluster.edu,
% 0.70/1.03 Sun Jul 10 17:22:11 2022
% 0.70/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28211_n023.cluster.edu".
% 0.70/1.03 ============================== end of head ===========================
% 0.70/1.03
% 0.70/1.03 ============================== INPUT =================================
% 0.70/1.03
% 0.70/1.03 % Reading from file /tmp/Prover9_28211_n023.cluster.edu
% 0.70/1.03
% 0.70/1.03 set(prolog_style_variables).
% 0.70/1.03 set(auto2).
% 0.70/1.03 % set(auto2) -> set(auto).
% 0.70/1.03 % set(auto) -> set(auto_inference).
% 0.70/1.03 % set(auto) -> set(auto_setup).
% 0.70/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.03 % set(auto) -> set(auto_limits).
% 0.70/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.03 % set(auto) -> set(auto_denials).
% 0.70/1.03 % set(auto) -> set(auto_process).
% 0.70/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.03 % set(auto2) -> assign(stats, some).
% 0.70/1.03 % set(auto2) -> clear(echo_input).
% 0.70/1.03 % set(auto2) -> set(quiet).
% 0.70/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.03 % set(auto2) -> clear(print_given).
% 0.70/1.03 assign(lrs_ticks,-1).
% 0.70/1.03 assign(sos_limit,10000).
% 0.70/1.03 assign(order,kbo).
% 0.70/1.03 set(lex_order_vars).
% 0.70/1.03 clear(print_given).
% 0.70/1.03
% 0.70/1.03 % formulas(sos). % not echoed (44 formulas)
% 0.70/1.03
% 0.70/1.03 ============================== end of input ==========================
% 0.70/1.03
% 0.70/1.03 % From the command line: assign(max_seconds, 300).
% 0.70/1.03
% 0.70/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.03
% 0.70/1.03 % Formulas that are not ordinary clauses:
% 0.70/1.03 1 (all X all Y (subclass(X,Y) <-> (all U (member(U,X) -> member(U,Y))))) # label(subclass_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 2 (all X subclass(X,universal_class)) # label(class_elements_are_sets) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 3 (all X all Y (X = Y <-> subclass(X,Y) & subclass(Y,X))) # label(extensionality) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 4 (all U all X all Y (member(U,unordered_pair(X,Y)) <-> member(U,universal_class) & (U = X | U = Y))) # label(unordered_pair_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 5 (all X all Y member(unordered_pair(X,Y),universal_class)) # label(unordered_pair) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 6 (all X singleton(X) = unordered_pair(X,X)) # label(singleton_set_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 7 (all X all Y ordered_pair(X,Y) = unordered_pair(singleton(X),unordered_pair(X,singleton(Y)))) # label(ordered_pair_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 8 (all U all V all X all Y (member(ordered_pair(U,V),cross_product(X,Y)) <-> member(U,X) & member(V,Y))) # label(cross_product_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 9 (all X all Y (member(X,universal_class) & member(Y,universal_class) -> first(ordered_pair(X,Y)) = X & second(ordered_pair(X,Y)) = Y)) # label(first_second) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 10 (all X all Y all Z (member(Z,cross_product(X,Y)) -> Z = ordered_pair(first(Z),second(Z)))) # label(cross_product) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 11 (all X all Y (member(ordered_pair(X,Y),element_relation) <-> member(Y,universal_class) & member(X,Y))) # label(element_relation_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 12 (all X all Y all Z (member(Z,intersection(X,Y)) <-> member(Z,X) & member(Z,Y))) # label(intersection) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 13 (all X all Z (member(Z,complement(X)) <-> member(Z,universal_class) & -member(Z,X))) # label(complement) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 14 (all X all XR all Y restrict(XR,X,Y) = intersection(XR,cross_product(X,Y))) # label(restrict_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 15 (all X -member(X,null_class)) # label(null_class_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 16 (all X all Z (member(Z,domain_of(X)) <-> member(Z,universal_class) & restrict(X,singleton(Z),universal_class) != null_class)) # label(domain_of) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 17 (all X all U all V all W (member(ordered_pair(ordered_pair(U,V),W),rotate(X)) <-> member(ordered_pair(ordered_pair(U,V),W),cross_product(cross_product(universal_class,universal_class),universal_class)) & member(ordered_pair(ordered_pair(V,W),U),X))) # label(rotate_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 18 (all X subclass(rotate(X),cross_product(cross_product(universal_class,universal_class),universal_class))) # label(rotate) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 19 (all U all V all W all X (member(ordered_pair(ordered_pair(U,V),W),flip(X)) <-> member(ordered_pair(ordered_pair(U,V),W),cross_product(cross_product(universal_class,universal_class),universal_class)) & member(ordered_pair(ordered_pair(V,U),W),X))) # label(flip_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 20 (all X subclass(flip(X),cross_product(cross_product(universal_class,universal_class),universal_class))) # label(flip) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 21 (all X all Y all Z (member(Z,union(X,Y)) <-> member(Z,X) | member(Z,Y))) # label(union_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 22 (all X successor(X) = union(X,singleton(X))) # label(successor_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 23 (all X all Y (member(ordered_pair(X,Y),successor_relation) <-> member(X,universal_class) & member(Y,universal_class) & successor(X) = Y)) # label(successor_relation_defn2) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 24 (all Y inverse(Y) = domain_of(flip(cross_product(Y,universal_class)))) # label(inverse_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 25 (all Z range_of(Z) = domain_of(inverse(Z))) # label(range_of_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 26 (all X all XR image(XR,X) = range_of(restrict(XR,X,universal_class))) # label(image_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 27 (all X (inductive(X) <-> member(null_class,X) & subclass(image(successor_relation,X),X))) # label(inductive_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 28 (exists X (member(X,universal_class) & inductive(X) & (all Y (inductive(Y) -> subclass(X,Y))))) # label(infinity) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 29 (all U all X (member(U,sum_class(X)) <-> (exists Y (member(U,Y) & member(Y,X))))) # label(sum_class_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 30 (all X (member(X,universal_class) -> member(sum_class(X),universal_class))) # label(sum_class) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 31 (all U all X (member(U,power_class(X)) <-> member(U,universal_class) & subclass(U,X))) # label(power_class_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 32 (all U (member(U,universal_class) -> member(power_class(U),universal_class))) # label(power_class) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 33 (all XR all YR subclass(compose(YR,XR),cross_product(universal_class,universal_class))) # label(compose_defn1) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 34 (all XR all YR all U all V (member(ordered_pair(U,V),compose(YR,XR)) <-> member(U,universal_class) & member(V,image(YR,image(XR,singleton(U)))))) # label(compose_defn2) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 35 (all Z (member(Z,identity_relation) <-> (exists X (member(X,universal_class) & Z = ordered_pair(X,X))))) # label(identity_relation) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.03 36 (all XF (function(XF) <-> subclass(XF,cross_product(universal_class,universal_class)) & subclass(compose(XF,inverse(XF)),identity_relation))) # label(function_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.04 37 (all X all XF (member(X,universal_class) & function(XF) -> member(image(XF,X),universal_class))) # label(replacement) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.04 38 (all X all Y (disjoint(X,Y) <-> (all U -(member(U,X) & member(U,Y))))) # label(disjoint_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.04 39 (all X (X != null_class -> (exists U (member(U,universal_class) & member(U,X) & disjoint(U,X))))) # label(regularity) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.04 40 (all XF all Y apply(XF,Y) = sum_class(image(XF,singleton(Y)))) # label(apply_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.04 41 (exists XF (function(XF) & (all Y (member(Y,universal_class) -> Y = null_class | member(apply(XF,Y),Y))))) # label(choice) # label(axiom) # label(non_clause). [assumption].
% 0.70/1.04 42 -(all X all Y (unordered_pair(singleton(X),unordered_pair(X,null_class)) = ordered_pair(X,Y) | member(Y,universal_class))) # label(property_1_of_ordered_pair) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.70/1.04
% 0.70/1.04 ============================== end of process non-clausal formulas ===
% 0.70/1.04
% 0.70/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.04
% 0.70/1.04 ============================== PREDICATE ELIMINATION =================
% 0.70/1.04 43 -inductive(A) | member(null_class,A) # label(inductive_defn) # label(axiom). [clausify(27)].
% 0.70/1.04 44 inductive(c1) # label(infinity) # label(axiom). [clausify(28)].
% 0.70/1.04 Derived: member(null_class,c1). [resolve(43,a,44,a)].
% 0.70/1.04 45 -inductive(A) | subclass(c1,A) # label(infinity) # label(axiom). [clausify(28)].
% 0.70/1.04 Derived: subclass(c1,c1). [resolve(45,a,44,a)].
% 0.70/1.04 46 -inductive(A) | subclass(image(successor_relation,A),A) # label(inductive_defn) # label(axiom). [clausify(27)].
% 0.70/1.04 Derived: subclass(image(successor_relation,c1),c1). [resolve(46,a,44,a)].
% 0.70/1.04 47 inductive(A) | -member(null_class,A) | -subclass(image(successor_relation,A),A) # label(inductive_defn) # label(axiom). [clausify(27)].
% 0.70/1.04 Derived: -member(null_class,A) | -subclass(image(successor_relation,A),A) | subclass(c1,A). [resolve(47,a,45,a)].
% 0.70/1.04 48 -function(A) | subclass(A,cross_product(universal_class,universal_class)) # label(function_defn) # label(axiom). [clausify(36)].
% 0.70/1.04 49 function(c2) # label(choice) # label(axiom). [clausify(41)].
% 0.70/1.04 Derived: subclass(c2,cross_product(universal_class,universal_class)). [resolve(48,a,49,a)].
% 0.70/1.04 50 -function(A) | subclass(compose(A,inverse(A)),identity_relation) # label(function_defn) # label(axiom). [clausify(36)].
% 0.70/1.04 Derived: subclass(compose(c2,inverse(c2)),identity_relation). [resolve(50,a,49,a)].
% 0.70/1.04 51 -member(A,universal_class) | -function(B) | member(image(B,A),universal_class) # label(replacement) # label(axiom). [clausify(37)].
% 0.70/1.04 Derived: -member(A,universal_class) | member(image(c2,A),universal_class). [resolve(51,b,49,a)].
% 0.70/1.04 52 function(A) | -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) # label(function_defn) # label(axiom). [clausify(36)].
% 0.70/1.04 Derived: -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) | -member(B,universal_class) | member(image(A,B),universal_class). [resolve(52,a,51,b)].
% 0.70/1.04 53 -disjoint(A,B) | -member(C,A) | -member(C,B) # label(disjoint_defn) # label(axiom). [clausify(38)].
% 0.70/1.04 54 null_class = A | disjoint(f5(A),A) # label(regularity) # label(axiom). [clausify(39)].
% 0.70/1.04 55 disjoint(A,B) | member(f4(A,B),A) # label(disjoint_defn) # label(axiom). [clausify(38)].
% 0.70/1.04 56 disjoint(A,B) | member(f4(A,B),B) # label(disjoint_defn) # label(axiom). [clausify(38)].
% 0.70/1.04 Derived: -member(A,f5(B)) | -member(A,B) | null_class = B. [resolve(53,a,54,b)].
% 0.70/1.04 Derived: -member(A,B) | -member(A,C) | member(f4(B,C),B). [resolve(53,a,55,a)].
% 0.70/1.04 Derived: -member(A,B) | -member(A,C) | member(f4(B,C),C). [resolve(53,a,56,a)].
% 0.70/1.04
% 0.70/1.04 ============================== end predicate elimination =============
% 0.70/1.04
% 0.70/1.04 Auto_denials: (non-Horn, no changes).
% 0.70/1.04
% 0.70/1.04 Term ordering decisions:
% 0.70/1.04 Function symbol KB weights: universal_class=1. null_class=1. successor_relation=1. identity_relation=1. element_relation=1. c1=1. c2=1. c3=1. c4=1. ordered_pair=1. cross_product=1. image=1. unordered_pair=1. compose=1. intersection=1. union=1. apply=1. f1=1. f2=1. f4=1. singleton=1. flip=1. sum_class=1. domain_of=1. inverse=1. power_class=1. rotate=1. successor=1. complement=1. first=1. range_of=1. second=1. f3=1. f5=1. restrict=1.
% 6.01/6.31
% 6.01/6.31 ============================== end of process initial clauses ========
% 6.01/6.31
% 6.01/6.31 ============================== CLAUSES FOR SEARCH ====================
% 6.01/6.31
% 6.01/6.31 ============================== end of clauses for search =============
% 6.01/6.31
% 6.01/6.31 ============================== SEARCH ================================
% 6.01/6.31
% 6.01/6.31 % Starting search at 0.03 seconds.
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=45.000, iters=3404
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=39.000, iters=3359
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=30.000, iters=3355
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=27.000, iters=3354
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=25.000, iters=3340
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=23.000, iters=3339
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=22.000, iters=3360
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=20.000, iters=3371
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=19.000, iters=3333
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=18.000, iters=3448
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=17.000, iters=3498
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=15.000, iters=3349
% 6.01/6.31
% 6.01/6.31 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 110 (0.00 of 0.59 sec).
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=14.000, iters=3408
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=9.000, iters=3339
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=8.000, iters=3345
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=2605, wt=87.000
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=6791, wt=39.000
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=6769, wt=38.000
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=3963, wt=37.000
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=3957, wt=36.000
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=11270, wt=9.000
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=11271, wt=8.000
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=11301, wt=7.000
% 6.01/6.31
% 6.01/6.31 Low Water (displace): id=11340, wt=6.000
% 6.01/6.31
% 6.01/6.31 Low Water (keep): wt=7.000, iters=3334
% 6.01/6.31
% 6.01/6.31 ============================== PROOF =================================
% 6.01/6.31 % SZS status Theorem
% 6.01/6.31 % SZS output start Refutation
% 6.01/6.31
% 6.01/6.31 % Proof 1 at 5.11 (+ 0.18) seconds.
% 6.01/6.31 % Length of proof is 30.
% 6.01/6.31 % Level of proof is 6.
% 6.01/6.31 % Maximum clause weight is 27.000.
% 6.01/6.31 % Given clauses 3928.
% 6.01/6.31
% 6.01/6.31 1 (all X all Y (subclass(X,Y) <-> (all U (member(U,X) -> member(U,Y))))) # label(subclass_defn) # label(axiom) # label(non_clause). [assumption].
% 6.01/6.31 2 (all X subclass(X,universal_class)) # label(class_elements_are_sets) # label(axiom) # label(non_clause). [assumption].
% 6.01/6.31 4 (all U all X all Y (member(U,unordered_pair(X,Y)) <-> member(U,universal_class) & (U = X | U = Y))) # label(unordered_pair_defn) # label(axiom) # label(non_clause). [assumption].
% 6.01/6.31 5 (all X all Y member(unordered_pair(X,Y),universal_class)) # label(unordered_pair) # label(axiom) # label(non_clause). [assumption].
% 6.01/6.31 6 (all X singleton(X) = unordered_pair(X,X)) # label(singleton_set_defn) # label(axiom) # label(non_clause). [assumption].
% 6.01/6.31 7 (all X all Y ordered_pair(X,Y) = unordered_pair(singleton(X),unordered_pair(X,singleton(Y)))) # label(ordered_pair_defn) # label(axiom) # label(non_clause). [assumption].
% 6.01/6.31 39 (all X (X != null_class -> (exists U (member(U,universal_class) & member(U,X) & disjoint(U,X))))) # label(regularity) # label(axiom) # label(non_clause). [assumption].
% 6.01/6.31 42 -(all X all Y (unordered_pair(singleton(X),unordered_pair(X,null_class)) = ordered_pair(X,Y) | member(Y,universal_class))) # label(property_1_of_ordered_pair) # label(negated_conjecture) # label(non_clause). [assumption].
% 6.01/6.31 57 subclass(A,universal_class) # label(class_elements_are_sets) # label(axiom). [clausify(2)].
% 6.01/6.31 59 member(unordered_pair(A,B),universal_class) # label(unordered_pair) # label(axiom). [clausify(5)].
% 6.01/6.31 62 singleton(A) = unordered_pair(A,A) # label(singleton_set_defn) # label(axiom). [clausify(6)].
% 6.01/6.31 67 null_class = A | member(f5(A),universal_class) # label(regularity) # label(axiom). [clausify(39)].
% 6.01/6.31 68 null_class = A | member(f5(A),A) # label(regularity) # label(axiom). [clausify(39)].
% 6.01/6.31 78 ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,singleton(B))) # label(ordered_pair_defn) # label(axiom). [clausify(7)].
% 6.01/6.31 79 ordered_pair(A,B) = unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B))). [copy(78),rewrite([62(2),62(3)])].
% 6.01/6.31 81 -member(c4,universal_class) # label(property_1_of_ordered_pair) # label(negated_conjecture). [clausify(42)].
% 6.01/6.31 83 ordered_pair(c3,c4) != unordered_pair(singleton(c3),unordered_pair(c3,null_class)) # label(property_1_of_ordered_pair) # label(negated_conjecture). [clausify(42)].
% 6.01/6.31 84 unordered_pair(unordered_pair(c3,c3),unordered_pair(c3,unordered_pair(c4,c4))) != unordered_pair(unordered_pair(c3,c3),unordered_pair(c3,null_class)). [copy(83),rewrite([79(3),62(11)])].
% 6.01/6.31 110 -subclass(A,B) | -member(C,A) | member(C,B) # label(subclass_defn) # label(axiom). [clausify(1)].
% 6.01/6.31 127 -member(A,unordered_pair(B,C)) | A = B | A = C # label(unordered_pair_defn) # label(axiom). [clausify(4)].
% 6.01/6.31 129 member(A,unordered_pair(B,C)) | -member(A,universal_class) | A != C # label(unordered_pair_defn) # label(axiom). [clausify(4)].
% 6.01/6.31 252 -member(c4,A). [ur(110,a,57,a,c,81,a)].
% 6.01/6.31 286 f5(unordered_pair(A,B)) = A | f5(unordered_pair(A,B)) = B | unordered_pair(A,B) = null_class. [resolve(127,a,68,b),flip(c)].
% 6.01/6.31 288 -member(unordered_pair(unordered_pair(c3,c3),unordered_pair(c3,null_class)),unordered_pair(unordered_pair(unordered_pair(c3,c3),unordered_pair(c3,unordered_pair(c4,c4))),unordered_pair(unordered_pair(c3,c3),unordered_pair(c3,unordered_pair(c4,c4))))). [ur(127,b,84,a(flip),c,84,a(flip))].
% 6.01/6.31 289 f5(unordered_pair(A,A)) = A | unordered_pair(A,A) = null_class. [factor(286,a,b)].
% 6.01/6.31 296 member(unordered_pair(A,B),unordered_pair(C,D)) | unordered_pair(A,B) != D. [resolve(129,b,59,a)].
% 6.01/6.31 9529 unordered_pair(A,A) = null_class | member(A,universal_class). [para(289(a,1),67(b,1)),flip(b),merge(b)].
% 6.01/6.31 10097 member(unordered_pair(A,B),unordered_pair(C,unordered_pair(A,B))). [xx_res(296,b)].
% 6.01/6.31 94364 unordered_pair(c4,c4) = null_class. [resolve(9529,b,252,a)].
% 6.01/6.31 94365 $F. [back_rewrite(288),rewrite([94364(14),94364(21)]),unit_del(a,10097)].
% 6.01/6.31
% 6.01/6.31 % SZS output end Refutation
% 6.01/6.31 ============================== end of proof ==========================
% 6.01/6.31
% 6.01/6.31 ============================== STATISTICS ============================
% 6.01/6.31
% 6.01/6.31 Given=3928. Generated=315949. Kept=94271. proofs=1.
% 6.01/6.31 Usable=3702. Sos=9999. Demods=83. Limbo=1, Disabled=80671. Hints=0.
% 6.01/6.31 Megabytes=44.81.
% 6.01/6.31 User_CPU=5.11, System_CPU=0.18, Wall_clock=5.
% 6.01/6.31
% 6.01/6.31 ============================== end of statistics =====================
% 6.01/6.31
% 6.01/6.31 ============================== end of search =========================
% 6.01/6.31
% 6.01/6.31 THEOREM PROVED
% 6.01/6.31 % SZS status Theorem
% 6.01/6.31
% 6.01/6.31 Exiting with 1 proof.
% 6.01/6.31
% 6.01/6.31 Process 28574 exit (max_proofs) Sun Jul 10 17:22:16 2022
% 6.01/6.31 Prover9 interrupted
%------------------------------------------------------------------------------