TSTP Solution File: SET032-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET032-3 : TPTP v8.1.0. Released v1.0.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 04:26:08 EDT 2022
% Result : Timeout 300.02s 300.27s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET032-3 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.31 % Computer : n003.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Sun Jul 10 06:11:44 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.73/1.05 ============================== Prover9 ===============================
% 0.73/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.05 Process 18925 was started by sandbox2 on n003.cluster.edu,
% 0.73/1.05 Sun Jul 10 06:11:45 2022
% 0.73/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18771_n003.cluster.edu".
% 0.73/1.05 ============================== end of head ===========================
% 0.73/1.05
% 0.73/1.05 ============================== INPUT =================================
% 0.73/1.05
% 0.73/1.05 % Reading from file /tmp/Prover9_18771_n003.cluster.edu
% 0.73/1.05
% 0.73/1.05 set(prolog_style_variables).
% 0.73/1.05 set(auto2).
% 0.73/1.05 % set(auto2) -> set(auto).
% 0.73/1.05 % set(auto) -> set(auto_inference).
% 0.73/1.05 % set(auto) -> set(auto_setup).
% 0.73/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.05 % set(auto) -> set(auto_limits).
% 0.73/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.05 % set(auto) -> set(auto_denials).
% 0.73/1.05 % set(auto) -> set(auto_process).
% 0.73/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.05 % set(auto2) -> assign(stats, some).
% 0.73/1.05 % set(auto2) -> clear(echo_input).
% 0.73/1.05 % set(auto2) -> set(quiet).
% 0.73/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.05 % set(auto2) -> clear(print_given).
% 0.73/1.05 assign(lrs_ticks,-1).
% 0.73/1.05 assign(sos_limit,10000).
% 0.73/1.05 assign(order,kbo).
% 0.73/1.05 set(lex_order_vars).
% 0.73/1.05 clear(print_given).
% 0.73/1.05
% 0.73/1.05 % formulas(sos). % not echoed (158 formulas)
% 0.73/1.05
% 0.73/1.05 ============================== end of input ==========================
% 0.73/1.05
% 0.73/1.05 % From the command line: assign(max_seconds, 300).
% 0.73/1.05
% 0.73/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.05
% 0.73/1.05 % Formulas that are not ordinary clauses:
% 0.73/1.05
% 0.73/1.05 ============================== end of process non-clausal formulas ===
% 0.73/1.05
% 0.73/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.05
% 0.73/1.05 ============================== PREDICATE ELIMINATION =================
% 0.73/1.05 1 proper_subset(A,B) | -subset(A,B) | A = B # label(proper_subset3) # label(axiom). [assumption].
% 0.73/1.05 2 -proper_subset(A,B) | subset(A,B) # label(proper_subset1) # label(axiom). [assumption].
% 0.73/1.05 3 -proper_subset(A,B) | A != B # label(proper_subset2) # label(axiom). [assumption].
% 0.73/1.05 4 relation(A) | member(f18(A),A) # label(relation2) # label(axiom). [assumption].
% 0.73/1.05 5 -relation(A) | -member(B,A) | ordered_pair_predicate(B) # label(relation1) # label(axiom). [assumption].
% 0.73/1.05 Derived: member(f18(A),A) | -member(B,A) | ordered_pair_predicate(B). [resolve(4,a,5,a)].
% 0.73/1.05 6 relation(A) | -ordered_pair_predicate(f18(A)) # label(relation3) # label(axiom). [assumption].
% 0.73/1.05 Derived: -ordered_pair_predicate(f18(A)) | -member(B,A) | ordered_pair_predicate(B). [resolve(6,a,5,a)].
% 0.73/1.05 7 -function(A) | relation(A) # label(function1) # label(axiom). [assumption].
% 0.73/1.05 Derived: -function(A) | -member(B,A) | ordered_pair_predicate(B). [resolve(7,b,5,a)].
% 0.73/1.05 8 function(A) | -relation(A) | -single_valued_set(A) # label(function3) # label(axiom). [assumption].
% 0.73/1.05 Derived: function(A) | -single_valued_set(A) | member(f18(A),A). [resolve(8,b,4,a)].
% 0.73/1.05 Derived: function(A) | -single_valued_set(A) | -ordered_pair_predicate(f18(A)). [resolve(8,b,6,a)].
% 0.73/1.05 9 relation(compose(A,B)) # label(composition_is_a_relation) # label(axiom). [assumption].
% 0.73/1.05 Derived: -member(A,compose(B,C)) | ordered_pair_predicate(A). [resolve(9,a,5,a)].
% 0.73/1.05 Derived: function(compose(A,B)) | -single_valued_set(compose(A,B)). [resolve(9,a,8,b)].
% 0.73/1.05 10 disjoint(A,B) | member(f23(A,B),A) # label(disjoint2) # label(axiom). [assumption].
% 0.73/1.05 11 -disjoint(A,B) | -member(C,A) | -member(C,B) # label(disjoint1) # label(axiom). [assumption].
% 0.73/1.05 Derived: member(f23(A,B),A) | -member(C,A) | -member(C,B). [resolve(10,a,11,a)].
% 0.73/1.05 12 disjoint(A,B) | member(f23(A,B),B) # label(disjoint3) # label(axiom). [assumption].
% 0.73/1.05 Derived: member(f23(A,B),B) | -member(C,A) | -member(C,B). [resolve(12,a,11,a)].
% 0.73/1.05 13 A = empty_set | disjoint(f24(A),A) # label(regularity2) # label(axiom). [assumption].
% 0.73/1.05 Derived: A = empty_set | -member(B,f24(A)) | -member(B,A). [resolve(13,b,11,a)].
% 0.73/1.05 14 one_to_one_function(A) | -function(A) | -function(converse(A)) # label(one_to_one_function3) # label(axiom). [assumption].
% 0.73/1.05 15 -one_to_one_function(A) | function(A) # label(one_to_one_function1) # label(axiom). [assumption].
% 0.73/1.05 16 -one_to_one_function(A) | function(converse(A)) # label(one_to_one_function2) # label(axiom). [assumption].
% 0.73/1.05 17 function(f25) # label(choice1) # label(axiom). [assumption].
% 0.73/1.05 18 -function(A) | single_valued_set(A) # label(function2) # label(axiom). [assumption].
% 0.73/1.05 19 -little_set(A) | -function(B) | little_set(image(A,B)) # label(image_and_substitution6) # label(axiom). [assumption].
% 0.73/1.05 Derived: single_valued_set(f25). [resolve(17,a,18,a)].
% 0.73/1.05 Derived: -little_set(A) | little_set(image(A,f25)). [resolve(17,a,19,b)].
% 0.73/1.05 20 -maps(A,B,C) | function(A) # label(maps1) # label(axiom). [assumption].
% 0.73/1.05 Derived: -maps(A,B,C) | single_valued_set(A). [resolve(20,b,18,a)].
% 0.73/1.05 Derived: -maps(A,B,C) | -little_set(D) | little_set(image(D,A)). [resolve(20,b,19,b)].
% 0.73/1.05 21 maps(A,B,C) | -function(A) | domain_of(A) != B | -subset(range_of(A),C) # label(maps4) # label(axiom). [assumption].
% 0.73/1.05 Derived: maps(f25,A,B) | domain_of(f25) != A | -subset(range_of(f25),B). [resolve(21,b,17,a)].
% 0.73/1.05 Derived: maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C) | -maps(A,D,E). [resolve(21,b,20,b)].
% 0.73/1.05 22 -function(A) | little_set(apply(A,B)) # label(function_values_are_small) # label(axiom). [assumption].
% 0.73/1.05 Derived: little_set(apply(f25,A)). [resolve(22,a,17,a)].
% 0.73/1.05 Derived: little_set(apply(A,B)) | -maps(A,C,D). [resolve(22,a,20,b)].
% 0.73/1.05 23 -function(A) | -member(B,A) | ordered_pair_predicate(B). [resolve(7,b,5,a)].
% 0.73/1.05 Derived: -member(A,f25) | ordered_pair_predicate(A). [resolve(23,a,17,a)].
% 0.73/1.05 Derived: -member(A,B) | ordered_pair_predicate(A) | -maps(B,C,D). [resolve(23,a,20,b)].
% 0.73/1.05 24 function(A) | -single_valued_set(A) | member(f18(A),A). [resolve(8,b,4,a)].
% 0.73/1.05 Derived: -single_valued_set(A) | member(f18(A),A) | -little_set(B) | little_set(image(B,A)). [resolve(24,a,19,b)].
% 0.73/1.05 Derived: -single_valued_set(A) | member(f18(A),A) | maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C). [resolve(24,a,21,b)].
% 0.73/1.05 Derived: -single_valued_set(A) | member(f18(A),A) | little_set(apply(A,B)). [resolve(24,a,22,a)].
% 0.73/1.05 Derived: -single_valued_set(A) | member(f18(A),A) | -member(B,A) | ordered_pair_predicate(B). [resolve(24,a,23,a)].
% 0.73/1.05 25 function(A) | -single_valued_set(A) | -ordered_pair_predicate(f18(A)). [resolve(8,b,6,a)].
% 0.73/1.05 Derived: -single_valued_set(A) | -ordered_pair_predicate(f18(A)) | -little_set(B) | little_set(image(B,A)). [resolve(25,a,19,b)].
% 0.73/1.05 Derived: -single_valued_set(A) | -ordered_pair_predicate(f18(A)) | maps(A,B,C) | domain_of(A) != B | -subset(range_of(A),C). [resolve(25,a,21,b)].
% 0.73/1.05 Derived: -single_valued_set(A) | -ordered_pair_predicate(f18(A)) | little_set(apply(A,B)). [resolve(25,a,22,a)].
% 0.73/1.05 Derived: -single_valued_set(A) | -ordered_pair_predicate(f18(A)) | -member(B,A) | ordered_pair_predicate(B). [resolve(25,a,23,a)].
% 0.73/1.05 26 function(compose(A,B)) | -single_valued_set(compose(A,B)). [resolve(9,a,8,b)].
% 0.73/1.05 Derived: -single_valued_set(compose(A,B)) | -little_set(C) | little_set(image(C,compose(A,B))). [resolve(26,a,19,b)].
% 0.73/1.05 Derived: -single_valued_set(compose(A,B)) | maps(compose(A,B),C,D) | domain_of(compose(A,B)) != C | -subset(range_of(compose(A,B)),D). [resolve(26,a,21,b)].
% 0.73/1.05 Derived: -single_valued_set(compose(A,B)) | little_set(apply(compose(A,B),C)). [resolve(26,a,22,a)].
% 0.73/1.05 Derived: -single_valued_set(compose(A,B)) | -member(C,compose(A,B)) | ordered_pair_predicate(C). [resolve(26,a,23,a)].
% 0.73/1.05 27 homomorphism(A,B,C,D,E) | -closed(B,C) | -closed(D,E) | -maps(A,B,D) | member(f32(A,B,C,D,E),B) # label(homomorphism5) # label(axiom). [assumption].
% 0.73/1.05 28 -homomorphism(A,B,C,D,E) | closed(B,C) # label(homomorphism1) # label(axiom). [assumption].
% 12.35/12.61 29 -homomorphism(A,B,C,D,E) | closed(D,E) # label(homomorphism2) # label(axiom). [assumption].
% 12.35/12.61 30 -homomorphism(A,B,C,D,E) | maps(A,B,D) # label(homomorphism3) # label(axiom). [assumption].
% 12.35/12.61 31 -homomorphism(A,B,C,D,E) | -member(F,B) | -member(V6,B) | apply(A,apply_to_two_arguments(C,F,V6)) = apply_to_two_arguments(E,apply(A,F),apply(A,V6)) # label(homomorphism4) # label(axiom). [assumption].
% 12.35/12.61 Derived: -closed(A,B) | -closed(C,D) | -maps(E,A,C) | member(f32(E,A,B,C,D),A) | -member(F,A) | -member(V6,A) | apply(E,apply_to_two_arguments(B,F,V6)) = apply_to_two_arguments(D,apply(E,F),apply(E,V6)). [resolve(27,a,31,a)].
% 12.35/12.61 32 homomorphism(A,B,C,D,E) | -closed(B,C) | -closed(D,E) | -maps(A,B,D) | member(f33(A,B,C,D,E),B) # label(homomorphism6) # label(axiom). [assumption].
% 12.35/12.61 Derived: -closed(A,B) | -closed(C,D) | -maps(E,A,C) | member(f33(E,A,B,C,D),A) | -member(F,A) | -member(V6,A) | apply(E,apply_to_two_arguments(B,F,V6)) = apply_to_two_arguments(D,apply(E,F),apply(E,V6)). [resolve(32,a,31,a)].
% 12.35/12.61 33 homomorphism(A,B,C,D,E) | -closed(B,C) | -closed(D,E) | -maps(A,B,D) | apply(A,apply_to_two_arguments(C,f32(A,B,C,D,E),f33(A,B,C,D,E))) != apply_to_two_arguments(E,apply(A,f32(A,B,C,D,E)),apply(A,f33(A,B,C,D,E))) # label(homomorphism7) # label(axiom). [assumption].
% 12.35/12.61 Derived: -closed(A,B) | -closed(C,D) | -maps(E,A,C) | apply(E,apply_to_two_arguments(B,f32(E,A,B,C,D),f33(E,A,B,C,D))) != apply_to_two_arguments(D,apply(E,f32(E,A,B,C,D)),apply(E,f33(E,A,B,C,D))) | -member(F,A) | -member(V6,A) | apply(E,apply_to_two_arguments(B,F,V6)) = apply_to_two_arguments(D,apply(E,F),apply(E,V6)). [resolve(33,a,31,a)].
% 12.35/12.61
% 12.35/12.61 ============================== end predicate elimination =============
% 12.35/12.61
% 12.35/12.61 Auto_denials: (non-Horn, no changes).
% 12.35/12.61
% 12.35/12.61 Term ordering decisions:
% 12.35/12.61 Function symbol KB weights: f25=1. empty_set=1. infinity=1. estin=1. identity_relation=1. universal_set=1. a=1. b=1. ordered_pair=1. apply=1. compose=1. image=1. non_ordered_pair=1. cross_product=1. f1=1. intersection=1. f10=1. f11=1. f12=1. f13=1. f14=1. f27=1. f4=1. f7=1. f8=1. f9=1. f16=1. f17=1. f23=1. f5=1. f6=1. union=1. restrict=1. first=1. second=1. domain_of=1. f18=1. range_of=1. flip_range_of=1. rotate_right=1. singleton_set=1. sigma=1. complement=1. converse=1. f19=1. f20=1. f21=1. powerset=1. f2=1. f24=1. f26=1. f3=1. successor=1. apply_to_two_arguments=1. f22=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1.
% 12.35/12.61
% 12.35/12.61 ============================== end of process initial clauses ========
% 12.35/12.61
% 12.35/12.61 ============================== CLAUSES FOR SEARCH ====================
% 12.35/12.61
% 12.35/12.61 ============================== end of clauses for search =============
% 12.35/12.61
% 12.35/12.61 ============================== SEARCH ================================
% 12.35/12.61
% 12.35/12.61 % Starting search at 0.05 seconds.
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=44.000, iters=3346
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=42.000, iters=3350
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=40.000, iters=3338
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=37.000, iters=3355
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=36.000, iters=3333
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=34.000, iters=3363
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=33.000, iters=3343
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=32.000, iters=3336
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=31.000, iters=3361
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=30.000, iters=3343
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=29.000, iters=3350
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=28.000, iters=3356
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=27.000, iters=3335
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=26.000, iters=3334
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=25.000, iters=3340
% 12.35/12.61
% 12.35/12.61 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 60 (0.00 of 2.33 sec).
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=24.000, iters=3333
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=23.000, iters=3468
% 12.35/12.61
% 12.35/12.61 Low Water (displace): id=10807, wt=17.000
% 12.35/12.61
% 12.35/12.61 Low Water (displace): id=10808, wt=16.000
% 12.35/12.61
% 12.35/12.61 Low Water (displace): id=10810, wt=8.000
% 12.35/12.61
% 12.35/12.61 Low Water (displace): id=10838, wt=7.000
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=22.000, iters=3336
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=21.000, iters=3420
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=20.000, iters=3338
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=19.000, iters=3335
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=18.000, iters=3335
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=17.000, iters=3345
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=16.000, iters=3335
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=15.000, iters=3334
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=14.000, iters=3346
% 12.35/12.61
% 12.35/12.61 Low Water (keep): wt=13.000, Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------