TSTP Solution File: SET071-7 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET071-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:26:46 EDT 2022
% Result : Unsatisfiable 0.93s 1.21s
% Output : Refutation 0.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET071-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n013.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 : Sat Jul 9 23:28:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.01 ============================== Prover9 ===============================
% 0.42/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.01 Process 28230 was started by sandbox2 on n013.cluster.edu,
% 0.42/1.01 Sat Jul 9 23:29:00 2022
% 0.42/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28077_n013.cluster.edu".
% 0.42/1.01 ============================== end of head ===========================
% 0.42/1.01
% 0.42/1.01 ============================== INPUT =================================
% 0.42/1.01
% 0.42/1.01 % Reading from file /tmp/Prover9_28077_n013.cluster.edu
% 0.42/1.01
% 0.42/1.01 set(prolog_style_variables).
% 0.42/1.01 set(auto2).
% 0.42/1.01 % set(auto2) -> set(auto).
% 0.42/1.01 % set(auto) -> set(auto_inference).
% 0.42/1.01 % set(auto) -> set(auto_setup).
% 0.42/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.01 % set(auto) -> set(auto_limits).
% 0.42/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.01 % set(auto) -> set(auto_denials).
% 0.42/1.01 % set(auto) -> set(auto_process).
% 0.42/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.01 % set(auto2) -> assign(stats, some).
% 0.42/1.01 % set(auto2) -> clear(echo_input).
% 0.42/1.01 % set(auto2) -> set(quiet).
% 0.42/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.01 % set(auto2) -> clear(print_given).
% 0.42/1.01 assign(lrs_ticks,-1).
% 0.42/1.01 assign(sos_limit,10000).
% 0.42/1.01 assign(order,kbo).
% 0.42/1.01 set(lex_order_vars).
% 0.42/1.01 clear(print_given).
% 0.42/1.01
% 0.42/1.01 % formulas(sos). % not echoed (115 formulas)
% 0.42/1.01
% 0.42/1.01 ============================== end of input ==========================
% 0.42/1.01
% 0.42/1.01 % From the command line: assign(max_seconds, 300).
% 0.42/1.01
% 0.42/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.01
% 0.42/1.01 % Formulas that are not ordinary clauses:
% 0.42/1.01
% 0.42/1.01 ============================== end of process non-clausal formulas ===
% 0.42/1.01
% 0.42/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.01
% 0.42/1.01 ============================== PREDICATE ELIMINATION =================
% 0.42/1.01 1 -member(null_class,A) | -subclass(image(successor_relation,A),A) | inductive(A) # label(inductive3) # label(axiom). [assumption].
% 0.42/1.01 2 -inductive(A) | member(null_class,A) # label(inductive1) # label(axiom). [assumption].
% 0.42/1.01 3 -inductive(A) | subclass(image(successor_relation,A),A) # label(inductive2) # label(axiom). [assumption].
% 0.42/1.01 4 inductive(omega) # label(omega_is_inductive1) # label(axiom). [assumption].
% 0.42/1.01 Derived: member(null_class,omega). [resolve(4,a,2,a)].
% 0.42/1.01 Derived: subclass(image(successor_relation,omega),omega). [resolve(4,a,3,a)].
% 0.42/1.01 5 -inductive(A) | subclass(omega,A) # label(omega_is_inductive2) # label(axiom). [assumption].
% 0.42/1.01 Derived: subclass(omega,A) | -member(null_class,A) | -subclass(image(successor_relation,A),A). [resolve(5,a,1,c)].
% 0.74/1.01 6 -subclass(compose(A,inverse(A)),identity_relation) | single_valued_class(A) # label(single_valued_class2) # label(axiom). [assumption].
% 0.74/1.01 7 -single_valued_class(A) | subclass(compose(A,inverse(A)),identity_relation) # label(single_valued_class1) # label(axiom). [assumption].
% 0.74/1.01 8 -function(inverse(A)) | -function(A) | one_to_one(A) # label(one_to_one3) # label(axiom). [assumption].
% 0.74/1.01 9 -one_to_one(A) | function(A) # label(one_to_one1) # label(axiom). [assumption].
% 0.74/1.01 10 -one_to_one(A) | function(inverse(A)) # label(one_to_one2) # label(axiom). [assumption].
% 0.74/1.01 11 -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) | function(A) # label(function3) # label(axiom). [assumption].
% 0.74/1.01 12 -function(A) | subclass(A,cross_product(universal_class,universal_class)) # label(function1) # label(axiom). [assumption].
% 0.74/1.01 13 -function(A) | subclass(compose(A,inverse(A)),identity_relation) # label(function2) # label(axiom). [assumption].
% 0.74/1.01 14 -function(A) | -member(B,universal_class) | member(image(A,B),universal_class) # label(replacement) # label(axiom). [assumption].
% 0.74/1.01 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -subclass(B,cross_product(universal_class,universal_class)) | -subclass(compose(B,inverse(B)),identity_relation). [resolve(14,a,11,c)].
% 0.74/1.01 15 function(choice) # label(choice1) # label(axiom). [assumption].
% 0.74/1.01 Derived: subclass(choice,cross_product(universal_class,universal_class)). [resolve(15,a,12,a)].
% 0.74/1.01 Derived: subclass(compose(choice,inverse(choice)),identity_relation). [resolve(15,a,13,a)].
% 0.74/1.01 Derived: -member(A,universal_class) | member(image(choice,A),universal_class). [resolve(15,a,14,a)].
% 0.74/1.01 16 -operation(A) | function(A) # label(operation1) # label(axiom). [assumption].
% 0.74/1.01 Derived: -operation(A) | subclass(A,cross_product(universal_class,universal_class)). [resolve(16,b,12,a)].
% 0.74/1.01 Derived: -operation(A) | subclass(compose(A,inverse(A)),identity_relation). [resolve(16,b,13,a)].
% 0.74/1.01 Derived: -operation(A) | -member(B,universal_class) | member(image(A,B),universal_class). [resolve(16,b,14,a)].
% 0.74/1.01 17 -function(A) | cross_product(domain_of(domain_of(A)),domain_of(domain_of(A))) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(A))) | operation(A) # label(operation4) # label(axiom). [assumption].
% 0.74/1.01 Derived: cross_product(domain_of(domain_of(A)),domain_of(domain_of(A))) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(A))) | operation(A) | -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation). [resolve(17,a,11,c)].
% 0.74/1.01 Derived: cross_product(domain_of(domain_of(choice)),domain_of(domain_of(choice))) != domain_of(choice) | -subclass(range_of(choice),domain_of(domain_of(choice))) | operation(choice). [resolve(17,a,15,a)].
% 0.74/1.01 18 -compatible(A,B,C) | function(A) # label(compatible1) # label(axiom). [assumption].
% 0.74/1.01 Derived: -compatible(A,B,C) | subclass(A,cross_product(universal_class,universal_class)). [resolve(18,b,12,a)].
% 0.74/1.01 Derived: -compatible(A,B,C) | subclass(compose(A,inverse(A)),identity_relation). [resolve(18,b,13,a)].
% 0.74/1.01 Derived: -compatible(A,B,C) | -member(D,universal_class) | member(image(A,D),universal_class). [resolve(18,b,14,a)].
% 0.74/1.01 Derived: -compatible(A,B,C) | cross_product(domain_of(domain_of(A)),domain_of(domain_of(A))) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(A))) | operation(A). [resolve(18,b,17,a)].
% 0.74/1.01 19 -function(A) | domain_of(domain_of(B)) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(C))) | compatible(A,B,C) # label(compatible4) # label(axiom). [assumption].
% 0.74/1.01 Derived: domain_of(domain_of(A)) != domain_of(B) | -subclass(range_of(B),domain_of(domain_of(C))) | compatible(B,A,C) | -subclass(B,cross_product(universal_class,universal_class)) | -subclass(compose(B,inverse(B)),identity_relation). [resolve(19,a,11,c)].
% 0.74/1.01 Derived: domain_of(domain_of(A)) != domain_of(choice) | -subclass(range_of(choice),domain_of(domain_of(B))) | compatible(choice,A,B). [resolve(19,a,15,a)].
% 0.74/1.01 Derived: domain_of(domain_of(A)) != domain_of(B) | -subclass(range_of(B),domain_of(domain_of(C))) | compatible(B,A,C) | -operation(B). [resolve(19,a,16,b)].
% 0.74/1.01 Derived: domain_of(domain_of(A)) != domain_of(B) | -subclass(range_of(B),domain_of(domain_of(C))) | compatible(B,A,C) | -compatible(B,D,E). [resolve(19,a,18,b)].
% 0.74/1.01 20 -operation(A) | -operation(B) | -compatible(C,A,B) | member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A)) | homomorphism(C,A,B) # label(homomorphism5) # label(axiom). [assumption].
% 0.74/1.01 21 -homomorphism(A,B,C) | operation(B) # label(homomorphism1) # label(axiom). [assumption].
% 0.74/1.01 22 -homomorphism(A,B,C) | operation(C) # label(homomorphism2) # label(axiom). [assumption].
% 0.74/1.01 23 -homomorphism(A,B,C) | compatible(A,B,C) # label(homomorphism3) # label(axiom). [assumption].
% 0.74/1.01 24 -homomorphism(A,B,C) | -member(ordered_pair(D,E),domain_of(B)) | apply(C,ordered_pair(apply(A,D),apply(A,E))) = apply(A,apply(B,ordered_pair(D,E))) # label(homomorphism4) # label(axiom). [assumption].
% 0.74/1.01 Derived: -operation(A) | -operation(B) | -compatible(C,A,B) | member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A)) | -member(ordered_pair(D,E),domain_of(A)) | apply(B,ordered_pair(apply(C,D),apply(C,E))) = apply(C,apply(A,ordered_pair(D,E))). [resolve(20,e,24,a)].
% 0.93/1.21 25 -operation(A) | -operation(B) | -compatible(C,A,B) | apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B)))) != apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)))) | homomorphism(C,A,B) # label(homomorphism6) # label(axiom). [assumption].
% 0.93/1.21 Derived: -operation(A) | -operation(B) | -compatible(C,A,B) | apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B)))) != apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)))) | -member(ordered_pair(D,E),domain_of(A)) | apply(B,ordered_pair(apply(C,D),apply(C,E))) = apply(C,apply(A,ordered_pair(D,E))). [resolve(25,e,24,a)].
% 0.93/1.21
% 0.93/1.21 ============================== end predicate elimination =============
% 0.93/1.21
% 0.93/1.21 Auto_denials: (non-Horn, no changes).
% 0.93/1.21
% 0.93/1.21 Term ordering decisions:
% 0.93/1.21 Function symbol KB weights: universal_class=1. null_class=1. choice=1. element_relation=1. identity_relation=1. omega=1. successor_relation=1. subset_relation=1. x=1. y=1. ordered_pair=1. cross_product=1. apply=1. intersection=1. unordered_pair=1. image=1. not_subclass_element=1. compose=1. union=1. symmetric_difference=1. domain_of=1. singleton=1. complement=1. inverse=1. range_of=1. flip=1. rotate=1. successor=1. sum_class=1. diagonalise=1. first=1. power_class=1. regular=1. second=1. cantor=1. restrict=1. not_homomorphism1=1. not_homomorphism2=1. domain=1. range=1.
% 0.93/1.21
% 0.93/1.21 ============================== end of process initial clauses ========
% 0.93/1.21
% 0.93/1.21 ============================== CLAUSES FOR SEARCH ====================
% 0.93/1.21
% 0.93/1.21 ============================== end of clauses for search =============
% 0.93/1.21
% 0.93/1.21 ============================== SEARCH ================================
% 0.93/1.21
% 0.93/1.21 % Starting search at 0.04 seconds.
% 0.93/1.21
% 0.93/1.21 ============================== PROOF =================================
% 0.93/1.21 % SZS status Unsatisfiable
% 0.93/1.21 % SZS output start Refutation
% 0.93/1.21
% 0.93/1.21 % Proof 1 at 0.21 (+ 0.01) seconds.
% 0.93/1.21 % Length of proof is 22.
% 0.93/1.21 % Level of proof is 6.
% 0.93/1.21 % Maximum clause weight is 11.000.
% 0.93/1.21 % Given clauses 219.
% 0.93/1.21
% 0.93/1.21 26 -subclass(A,B) | -member(C,A) | member(C,B) # label(subclass_members) # label(axiom). [assumption].
% 0.93/1.21 29 subclass(A,universal_class) # label(class_elements_are_sets) # label(axiom). [assumption].
% 0.93/1.21 33 -member(A,unordered_pair(B,C)) | A = B | A = C # label(unordered_pair_member) # label(axiom). [assumption].
% 0.93/1.21 37 unordered_pair(A,A) = singleton(A) # label(singleton_set) # label(axiom). [assumption].
% 0.93/1.21 38 singleton(A) = unordered_pair(A,A). [copy(37),flip(a)].
% 0.93/1.21 112 A = null_class | member(regular(A),A) # label(regularity1) # label(axiom). [assumption].
% 0.93/1.21 113 null_class = A | member(regular(A),A). [copy(112),flip(a)].
% 0.93/1.21 156 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_of_unordered_pair) # label(axiom). [assumption].
% 0.93/1.21 160 member(A,universal_class) | unordered_pair(B,A) = singleton(B) # label(unordered_pair_equals_singleton1) # label(axiom). [assumption].
% 0.93/1.21 161 member(A,universal_class) | unordered_pair(A,B) = unordered_pair(B,B). [copy(160),rewrite([156(3),38(4)])].
% 0.93/1.21 163 unordered_pair(x,y) != null_class # label(prove_null_unordered_pair_1) # label(negated_conjecture). [assumption].
% 0.93/1.21 164 -member(x,universal_class) # label(prove_null_unordered_pair_2) # label(negated_conjecture). [assumption].
% 0.93/1.21 165 -member(y,universal_class) # label(prove_null_unordered_pair_3) # label(negated_conjecture). [assumption].
% 0.93/1.21 206 -member(A,unordered_pair(B,B)) | A = B. [factor(33,b,c)].
% 0.93/1.21 214 -member(A,B) | member(A,universal_class). [resolve(29,a,26,a)].
% 0.93/1.21 405 unordered_pair(A,x) = unordered_pair(A,A). [resolve(164,a,161,a),rewrite([156(2)])].
% 0.93/1.21 468 unordered_pair(A,y) = unordered_pair(A,A). [resolve(165,a,161,a),rewrite([156(2)])].
% 0.93/1.21 469 unordered_pair(x,x) != null_class. [back_rewrite(163),rewrite([468(3)])].
% 0.93/1.21 571 member(regular(A),universal_class) | null_class = A. [resolve(214,a,113,b)].
% 0.93/1.21 661 -member(A,unordered_pair(x,x)) | x = A. [para(405(a,1),206(a,2)),flip(b)].
% 0.93/1.21 1404 regular(unordered_pair(x,x)) = x. [resolve(661,a,113,b),flip(a),flip(b),unit_del(b,469)].
% 0.93/1.21 1463 $F. [para(1404(a,1),571(a,1)),flip(b),unit_del(a,164),unit_del(b,469)].
% 0.93/1.21
% 0.93/1.21 % SZS output end Refutation
% 0.93/1.21 ============================== end of proof ==========================
% 0.93/1.21
% 0.93/1.21 ============================== STATISTICS ============================
% 0.93/1.21
% 0.93/1.21 Given=219. Generated=2399. Kept=1367. proofs=1.
% 0.93/1.21 Usable=210. Sos=1009. Demods=29. Limbo=2, Disabled=283. Hints=0.
% 0.93/1.21 Megabytes=2.51.
% 0.93/1.21 User_CPU=0.21, System_CPU=0.01, Wall_clock=0.
% 0.93/1.21
% 0.93/1.21 ============================== end of statistics =====================
% 0.93/1.21
% 0.93/1.21 ============================== end of search =========================
% 0.93/1.21
% 0.93/1.21 THEOREM PROVED
% 0.93/1.21 % SZS status Unsatisfiable
% 0.93/1.21
% 0.93/1.21 Exiting with 1 proof.
% 0.93/1.21
% 0.93/1.21 Process 28230 exit (max_proofs) Sat Jul 9 23:29:00 2022
% 0.93/1.21 Prover9 interrupted
%------------------------------------------------------------------------------