TSTP Solution File: SET017-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET017-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:25:48 EDT 2022
% Result : Unsatisfiable 0.81s 1.09s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET017-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 07:52:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.03 ============================== Prover9 ===============================
% 0.43/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.03 Process 8646 was started by sandbox on n006.cluster.edu,
% 0.43/1.03 Mon Jul 11 07:52:36 2022
% 0.43/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8493_n006.cluster.edu".
% 0.43/1.03 ============================== end of head ===========================
% 0.43/1.03
% 0.43/1.03 ============================== INPUT =================================
% 0.43/1.03
% 0.43/1.03 % Reading from file /tmp/Prover9_8493_n006.cluster.edu
% 0.43/1.03
% 0.43/1.03 set(prolog_style_variables).
% 0.43/1.03 set(auto2).
% 0.43/1.03 % set(auto2) -> set(auto).
% 0.43/1.03 % set(auto) -> set(auto_inference).
% 0.43/1.03 % set(auto) -> set(auto_setup).
% 0.43/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.03 % set(auto) -> set(auto_limits).
% 0.43/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.03 % set(auto) -> set(auto_denials).
% 0.43/1.03 % set(auto) -> set(auto_process).
% 0.43/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.03 % set(auto2) -> assign(stats, some).
% 0.43/1.03 % set(auto2) -> clear(echo_input).
% 0.43/1.03 % set(auto2) -> set(quiet).
% 0.43/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.03 % set(auto2) -> clear(print_given).
% 0.43/1.03 assign(lrs_ticks,-1).
% 0.43/1.03 assign(sos_limit,10000).
% 0.43/1.03 assign(order,kbo).
% 0.43/1.03 set(lex_order_vars).
% 0.43/1.03 clear(print_given).
% 0.43/1.03
% 0.43/1.03 % formulas(sos). % not echoed (94 formulas)
% 0.43/1.03
% 0.43/1.03 ============================== end of input ==========================
% 0.43/1.03
% 0.43/1.03 % From the command line: assign(max_seconds, 300).
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.03
% 0.43/1.03 % Formulas that are not ordinary clauses:
% 0.43/1.03
% 0.43/1.03 ============================== end of process non-clausal formulas ===
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.03
% 0.43/1.03 ============================== PREDICATE ELIMINATION =================
% 0.43/1.03 1 -inductive(A) | member(null_class,A) # label(inductive1) # label(axiom). [assumption].
% 0.43/1.03 2 inductive(omega) # label(omega_is_inductive1) # label(axiom). [assumption].
% 0.43/1.03 Derived: member(null_class,omega). [resolve(1,a,2,a)].
% 0.43/1.03 3 -inductive(A) | subclass(omega,A) # label(omega_is_inductive2) # label(axiom). [assumption].
% 0.43/1.03 Derived: subclass(omega,omega). [resolve(3,a,2,a)].
% 0.43/1.03 4 -inductive(A) | subclass(image(successor_relation,A),A) # label(inductive2) # label(axiom). [assumption].
% 0.43/1.03 Derived: subclass(image(successor_relation,omega),omega). [resolve(4,a,2,a)].
% 0.43/1.03 5 -member(null_class,A) | -subclass(image(successor_relation,A),A) | inductive(A) # label(inductive3) # label(axiom). [assumption].
% 0.43/1.03 Derived: -member(null_class,A) | -subclass(image(successor_relation,A),A) | subclass(omega,A). [resolve(5,c,3,a)].
% 0.43/1.03 6 -function(inverse(A)) | -function(A) | one_to_one(A) # label(one_to_one3) # label(axiom). [assumption].
% 0.43/1.03 7 -one_to_one(A) | function(A) # label(one_to_one1) # label(axiom). [assumption].
% 0.43/1.03 8 -one_to_one(A) | function(inverse(A)) # label(one_to_one2) # label(axiom). [assumption].
% 0.43/1.03 9 -function(A) | subclass(A,cross_product(universal_class,universal_class)) # label(function1) # label(axiom). [assumption].
% 0.43/1.03 10 function(choice) # label(choice1) # label(axiom). [assumption].
% 0.43/1.03 11 -operation(A) | function(A) # label(operation1) # label(axiom). [assumption].
% 0.43/1.03 12 -compatible(A,B,C) | function(A) # label(compatible1) # label(axiom). [assumption].
% 0.43/1.03 Derived: subclass(choice,cross_product(universal_class,universal_class)). [resolve(9,a,10,a)].
% 0.43/1.03 Derived: subclass(A,cross_product(universal_class,universal_class)) | -operation(A). [resolve(9,a,11,b)].
% 0.43/1.03 Derived: subclass(A,cross_product(universal_class,universal_class)) | -compatible(A,B,C). [resolve(9,a,12,b)].
% 0.43/1.03 13 -function(A) | subclass(compose(A,inverse(A)),identity_relation) # label(function2) # label(axiom). [assumption].
% 0.43/1.03 Derived: subclass(compose(choice,inverse(choice)),identity_relation). [resolve(13,a,10,a)].
% 0.43/1.03 Derived: subclass(compose(A,inverse(A)),identity_relation) | -operation(A). [resolve(13,a,11,b)].
% 0.43/1.03 Derived: subclass(compose(A,inverse(A)),identity_relation) | -compatible(A,B,C). [resolve(13,a,12,b)].
% 0.43/1.03 14 -function(A) | -member(B,universal_class) | member(image(A,B),universal_class) # label(replacement) # label(axiom). [assumption].
% 0.43/1.03 Derived: -member(A,universal_class) | member(image(choice,A),universal_class). [resolve(14,a,10,a)].
% 0.43/1.03 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -operation(B). [resolve(14,a,11,b)].
% 0.43/1.03 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -compatible(B,C,D). [resolve(14,a,12,b)].
% 0.43/1.03 15 -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) | function(A) # label(function3) # label(axiom). [assumption].
% 0.43/1.03 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(15,c,14,a)].
% 0.43/1.03 16 -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.43/1.03 Derived: domain_of(domain_of(A)) != domain_of(choice) | -subclass(range_of(choice),domain_of(domain_of(B))) | compatible(choice,A,B). [resolve(16,a,10,a)].
% 0.43/1.03 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(16,a,11,b)].
% 0.43/1.03 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(16,a,12,b)].
% 0.43/1.03 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(16,a,15,c)].
% 0.43/1.03 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.43/1.03 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,10,a)].
% 0.43/1.03 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) | -compatible(A,B,C). [resolve(17,a,12,b)].
% 0.43/1.03 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,15,c)].
% 0.43/1.03 18 -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.43/1.03 19 -homomorphism(A,B,C) | operation(B) # label(homomorphism1) # label(axiom). [assumption].
% 0.43/1.03 20 -homomorphism(A,B,C) | operation(C) # label(homomorphism2) # label(axiom). [assumption].
% 0.43/1.03 21 -homomorphism(A,B,C) | compatible(A,B,C) # label(homomorphism3) # label(axiom). [assumption].
% 0.43/1.03 22 -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.43/1.03 Derived: -member(ordered_pair(A,B),domain_of(C)) | apply(D,ordered_pair(apply(E,A),apply(E,B))) = apply(E,apply(C,ordered_pair(A,B))) | -operation(C) | -operation(D) | -compatible(E,C,D) | member(ordered_pair(not_homomorphism1(E,C,D),not_homomorphism2(E,C,D)),domain_of(C)). [resolve(22,a,18,e)].
% 0.81/1.09 23 -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.81/1.09 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(23,e,22,a)].
% 0.81/1.09 24 -subclass(compose(A,inverse(A)),identity_relation) | single_valued_class(A) # label(single_valued_class2) # label(axiom). [assumption].
% 0.81/1.09 25 -single_valued_class(A) | subclass(compose(A,inverse(A)),identity_relation) # label(single_valued_class1) # label(axiom). [assumption].
% 0.81/1.09
% 0.81/1.09 ============================== end predicate elimination =============
% 0.81/1.09
% 0.81/1.09 Auto_denials: (non-Horn, no changes).
% 0.81/1.09
% 0.81/1.09 Term ordering decisions:
% 0.81/1.09 Function symbol KB weights: universal_class=1. choice=1. null_class=1. element_relation=1. identity_relation=1. omega=1. successor_relation=1. subset_relation=1. x=1. y=1. z=1. ordered_pair=1. cross_product=1. apply=1. intersection=1. image=1. compose=1. unordered_pair=1. not_subclass_element=1. union=1. symmetric_difference=1. domain_of=1. complement=1. inverse=1. range_of=1. singleton=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.81/1.09
% 0.81/1.09 ============================== end of process initial clauses ========
% 0.81/1.09
% 0.81/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.09
% 0.81/1.09 ============================== end of clauses for search =============
% 0.81/1.09
% 0.81/1.09 ============================== SEARCH ================================
% 0.81/1.09
% 0.81/1.09 % Starting search at 0.02 seconds.
% 0.81/1.09
% 0.81/1.09 ============================== PROOF =================================
% 0.81/1.09 % SZS status Unsatisfiable
% 0.81/1.09 % SZS output start Refutation
% 0.81/1.09
% 0.81/1.09 % Proof 1 at 0.07 (+ 0.00) seconds.
% 0.81/1.09 % Length of proof is 26.
% 0.81/1.09 % Level of proof is 9.
% 0.81/1.09 % Maximum clause weight is 16.000.
% 0.81/1.09 % Given clauses 187.
% 0.81/1.09
% 0.81/1.09 31 unordered_pair(A,A) = singleton(A) # label(singleton_set) # label(axiom). [assumption].
% 0.81/1.09 32 singleton(A) = unordered_pair(A,A). [copy(31),flip(a)].
% 0.81/1.09 41 unordered_pair(x,y) = unordered_pair(x,z) # label(prove_left_cancellation_1) # label(negated_conjecture). [assumption].
% 0.81/1.09 42 unordered_pair(x,z) = unordered_pair(x,y). [copy(41),flip(a)].
% 0.81/1.09 43 member(ordered_pair(y,z),cross_product(universal_class,universal_class)) # label(prove_left_cancellation_2) # label(negated_conjecture). [assumption].
% 0.81/1.09 67 unordered_pair(singleton(A),unordered_pair(A,singleton(B))) = ordered_pair(A,B) # label(ordered_pair) # label(axiom). [assumption].
% 0.81/1.09 68 ordered_pair(A,B) = unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B))). [copy(67),rewrite([32(1),32(2)]),flip(a)].
% 0.81/1.09 79 y != z # label(prove_left_cancellation_3) # label(negated_conjecture). [assumption].
% 0.81/1.09 80 z != y. [copy(79),flip(a)].
% 0.81/1.09 92 -member(A,universal_class) | member(A,unordered_pair(B,A)) # label(unordered_pair3) # label(axiom). [assumption].
% 0.81/1.09 103 -member(ordered_pair(A,B),cross_product(C,D)) | member(A,C) # label(cartesian_product1) # label(axiom). [assumption].
% 0.81/1.09 104 -member(unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B))),cross_product(C,D)) | member(A,C). [copy(103),rewrite([68(1)])].
% 0.81/1.09 105 -member(ordered_pair(A,B),cross_product(C,D)) | member(B,D) # label(cartesian_product2) # label(axiom). [assumption].
% 0.81/1.09 106 -member(unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B))),cross_product(C,D)) | member(B,D). [copy(105),rewrite([68(1)])].
% 0.81/1.09 111 -member(A,unordered_pair(B,C)) | A = B | A = C # label(unordered_pair_member) # label(axiom). [assumption].
% 0.81/1.09 186 member(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),cross_product(universal_class,universal_class)). [back_rewrite(43),rewrite([68(3)])].
% 0.81/1.09 255 -member(y,unordered_pair(z,z)). [ur(111,b,80,a(flip),c,80,a(flip))].
% 0.81/1.09 318 member(z,universal_class). [resolve(186,a,106,a)].
% 0.81/1.09 319 member(y,universal_class). [resolve(186,a,104,a)].
% 0.81/1.09 368 member(z,unordered_pair(A,z)). [resolve(318,a,92,a)].
% 0.81/1.09 384 member(y,unordered_pair(A,y)). [resolve(319,a,92,a)].
% 0.81/1.09 474 member(z,unordered_pair(x,y)). [para(42(a,1),368(a,2))].
% 0.81/1.09 549 z = x. [resolve(474,a,111,a),unit_del(b,80)].
% 0.81/1.09 640 -member(y,unordered_pair(x,x)). [back_rewrite(255),rewrite([549(2),549(3)])].
% 0.81/1.09 644 unordered_pair(x,y) = unordered_pair(x,x). [back_rewrite(42),rewrite([549(2)]),flip(a)].
% 0.81/1.09 986 $F. [para(644(a,1),384(a,2)),unit_del(a,640)].
% 0.81/1.09
% 0.81/1.09 % SZS output end Refutation
% 0.81/1.09 ============================== end of proof ==========================
% 0.81/1.09
% 0.81/1.09 ============================== STATISTICS ============================
% 0.81/1.09
% 0.81/1.09 Given=187. Generated=1389. Kept=899. proofs=1.
% 0.81/1.09 Usable=174. Sos=601. Demods=22. Limbo=0, Disabled=241. Hints=0.
% 0.81/1.09 Megabytes=1.72.
% 0.81/1.09 User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.81/1.09
% 0.81/1.09 ============================== end of statistics =====================
% 0.81/1.09
% 0.81/1.09 ============================== end of search =========================
% 0.81/1.09
% 0.81/1.09 THEOREM PROVED
% 0.81/1.09 % SZS status Unsatisfiable
% 0.81/1.09
% 0.81/1.09 Exiting with 1 proof.
% 0.81/1.09
% 0.81/1.09 Process 8646 exit (max_proofs) Mon Jul 11 07:52:36 2022
% 0.81/1.09 Prover9 interrupted
%------------------------------------------------------------------------------