TSTP Solution File: SET122-7 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET122-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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:34 EDT 2022
% Result : Unsatisfiable 10.01s 10.31s
% Output : Refutation 10.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET122-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n009.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 : Sat Jul 9 19:46:37 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.44/1.05 ============================== Prover9 ===============================
% 0.44/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.05 Process 19417 was started by sandbox on n009.cluster.edu,
% 0.44/1.05 Sat Jul 9 19:46:37 2022
% 0.44/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19264_n009.cluster.edu".
% 0.44/1.05 ============================== end of head ===========================
% 0.44/1.05
% 0.44/1.05 ============================== INPUT =================================
% 0.44/1.05
% 0.44/1.05 % Reading from file /tmp/Prover9_19264_n009.cluster.edu
% 0.44/1.05
% 0.44/1.05 set(prolog_style_variables).
% 0.44/1.05 set(auto2).
% 0.44/1.05 % set(auto2) -> set(auto).
% 0.44/1.05 % set(auto) -> set(auto_inference).
% 0.44/1.05 % set(auto) -> set(auto_setup).
% 0.44/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.05 % set(auto) -> set(auto_limits).
% 0.44/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.05 % set(auto) -> set(auto_denials).
% 0.44/1.05 % set(auto) -> set(auto_process).
% 0.44/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.05 % set(auto2) -> assign(stats, some).
% 0.44/1.05 % set(auto2) -> clear(echo_input).
% 0.44/1.05 % set(auto2) -> set(quiet).
% 0.44/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.05 % set(auto2) -> clear(print_given).
% 0.44/1.05 assign(lrs_ticks,-1).
% 0.44/1.05 assign(sos_limit,10000).
% 0.44/1.05 assign(order,kbo).
% 0.44/1.05 set(lex_order_vars).
% 0.44/1.05 clear(print_given).
% 0.44/1.05
% 0.44/1.05 % formulas(sos). % not echoed (169 formulas)
% 0.44/1.05
% 0.44/1.05 ============================== end of input ==========================
% 0.44/1.05
% 0.44/1.05 % From the command line: assign(max_seconds, 300).
% 0.44/1.05
% 0.44/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.05
% 0.44/1.05 % Formulas that are not ordinary clauses:
% 0.44/1.05
% 0.44/1.05 ============================== end of process non-clausal formulas ===
% 0.44/1.05
% 0.44/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.05
% 0.44/1.05 ============================== PREDICATE ELIMINATION =================
% 0.44/1.05 1 -member(null_class,A) | -subclass(image(successor_relation,A),A) | inductive(A) # label(inductive3) # label(axiom). [assumption].
% 0.44/1.05 2 -inductive(A) | member(null_class,A) # label(inductive1) # label(axiom). [assumption].
% 0.44/1.05 3 -inductive(A) | subclass(image(successor_relation,A),A) # label(inductive2) # label(axiom). [assumption].
% 0.44/1.05 4 inductive(omega) # label(omega_is_inductive1) # label(axiom). [assumption].
% 0.44/1.05 Derived: member(null_class,omega). [resolve(4,a,2,a)].
% 0.44/1.05 Derived: subclass(image(successor_relation,omega),omega). [resolve(4,a,3,a)].
% 0.44/1.05 5 -inductive(A) | subclass(omega,A) # label(omega_is_inductive2) # label(axiom). [assumption].
% 0.44/1.05 Derived: subclass(omega,A) | -member(null_class,A) | -subclass(image(successor_relation,A),A). [resolve(5,a,1,c)].
% 0.44/1.05 6 -subclass(compose(A,inverse(A)),identity_relation) | single_valued_class(A) # label(single_valued_class2) # label(axiom). [assumption].
% 0.44/1.05 7 -single_valued_class(A) | subclass(compose(A,inverse(A)),identity_relation) # label(single_valued_class1) # label(axiom). [assumption].
% 0.44/1.05 8 -function(inverse(A)) | -function(A) | one_to_one(A) # label(one_to_one3) # label(axiom). [assumption].
% 0.44/1.05 9 -one_to_one(A) | function(A) # label(one_to_one1) # label(axiom). [assumption].
% 0.44/1.05 10 -one_to_one(A) | function(inverse(A)) # label(one_to_one2) # label(axiom). [assumption].
% 0.44/1.05 11 -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) | function(A) # label(function3) # label(axiom). [assumption].
% 0.44/1.05 12 -function(A) | subclass(A,cross_product(universal_class,universal_class)) # label(function1) # label(axiom). [assumption].
% 0.44/1.05 13 -function(A) | subclass(compose(A,inverse(A)),identity_relation) # label(function2) # label(axiom). [assumption].
% 0.44/1.05 14 -function(A) | -member(B,universal_class) | member(image(A,B),universal_class) # label(replacement) # label(axiom). [assumption].
% 0.44/1.05 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.44/1.05 15 function(choice) # label(choice1) # label(axiom). [assumption].
% 0.44/1.05 Derived: subclass(choice,cross_product(universal_class,universal_class)). [resolve(15,a,12,a)].
% 0.44/1.05 Derived: subclass(compose(choice,inverse(choice)),identity_relation). [resolve(15,a,13,a)].
% 0.44/1.05 Derived: -member(A,universal_class) | member(image(choice,A),universal_class). [resolve(15,a,14,a)].
% 0.44/1.05 16 -operation(A) | function(A) # label(operation1) # label(axiom). [assumption].
% 0.44/1.05 Derived: -operation(A) | subclass(A,cross_product(universal_class,universal_class)). [resolve(16,b,12,a)].
% 0.44/1.05 Derived: -operation(A) | subclass(compose(A,inverse(A)),identity_relation). [resolve(16,b,13,a)].
% 0.44/1.05 Derived: -operation(A) | -member(B,universal_class) | member(image(A,B),universal_class). [resolve(16,b,14,a)].
% 0.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 18 -compatible(A,B,C) | function(A) # label(compatible1) # label(axiom). [assumption].
% 0.44/1.05 Derived: -compatible(A,B,C) | subclass(A,cross_product(universal_class,universal_class)). [resolve(18,b,12,a)].
% 0.44/1.05 Derived: -compatible(A,B,C) | subclass(compose(A,inverse(A)),identity_relation). [resolve(18,b,13,a)].
% 0.44/1.05 Derived: -compatible(A,B,C) | -member(D,universal_class) | member(image(A,D),universal_class). [resolve(18,b,14,a)].
% 0.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 21 -homomorphism(A,B,C) | operation(B) # label(homomorphism1) # label(axiom). [assumption].
% 0.44/1.05 22 -homomorphism(A,B,C) | operation(C) # label(homomorphism2) # label(axiom). [assumption].
% 0.44/1.05 23 -homomorphism(A,B,C) | compatible(A,B,C) # label(homomorphism3) # label(axiom). [assumption].
% 0.44/1.05 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.44/1.05 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)].
% 10.01/10.31 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].
% 10.01/10.31 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)].
% 10.01/10.31
% 10.01/10.31 ============================== end predicate elimination =============
% 10.01/10.31
% 10.01/10.31 Auto_denials: (non-Horn, no changes).
% 10.01/10.31
% 10.01/10.31 Term ordering decisions:
% 10.01/10.31 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. unordered_pair=1. not_subclass_element=1. intersection=1. apply=1. image=1. compose=1. union=1. symmetric_difference=1. domain_of=1. singleton=1. first=1. second=1. complement=1. member_of=1. inverse=1. range_of=1. flip=1. rotate=1. successor=1. sum_class=1. diagonalise=1. member_of1=1. power_class=1. regular=1. cantor=1. restrict=1. not_homomorphism1=1. not_homomorphism2=1. domain=1. range=1.
% 10.01/10.31
% 10.01/10.31 ============================== end of process initial clauses ========
% 10.01/10.31
% 10.01/10.31 ============================== CLAUSES FOR SEARCH ====================
% 10.01/10.31
% 10.01/10.31 ============================== end of clauses for search =============
% 10.01/10.31
% 10.01/10.31 ============================== SEARCH ================================
% 10.01/10.31
% 10.01/10.31 % Starting search at 0.04 seconds.
% 10.01/10.31
% 10.01/10.31 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 63 (0.00 of 0.44 sec).
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=68.000, iters=3632
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=43.000, iters=3508
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=39.000, iters=3475
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=34.000, iters=3390
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=31.000, iters=3397
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=30.000, iters=3369
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=29.000, iters=3361
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=28.000, iters=3353
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=27.000, iters=3385
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=24.000, iters=3520
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=22.000, iters=3424
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=21.000, iters=3335
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=20.000, iters=3456
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=19.000, iters=3475
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=18.000, iters=3368
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=17.000, iters=3387
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=16.000, iters=3341
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=15.000, iters=3334
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=14.000, iters=3341
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=13.000, iters=3335
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=12.000, iters=3346
% 10.01/10.31
% 10.01/10.31 Low Water (keep): wt=11.000, iters=3336
% 10.01/10.31
% 10.01/10.31 ============================== PROOF =================================
% 10.01/10.31 % SZS status Unsatisfiable
% 10.01/10.31 % SZS output start Refutation
% 10.01/10.31
% 10.01/10.31 % Proof 1 at 9.13 (+ 0.16) seconds.
% 10.01/10.31 % Length of proof is 35.
% 10.01/10.31 % Level of proof is 9.
% 10.01/10.31 % Maximum clause weight is 17.000.
% 10.01/10.31 % Given clauses 4844.
% 10.01/10.31
% 10.01/10.31 26 -subclass(A,B) | -member(C,A) | member(C,B) # label(subclass_members) # label(axiom). [assumption].
% 10.01/10.31 29 subclass(A,universal_class) # label(class_elements_are_sets) # label(axiom). [assumption].
% 10.01/10.31 33 -member(A,unordered_pair(B,C)) | A = B | A = C # label(unordered_pair_member) # label(axiom). [assumption].
% 10.01/10.31 37 unordered_pair(A,A) = singleton(A) # label(singleton_set) # label(axiom). [assumption].
% 10.01/10.31 48 -member(A,B) | -member(A,C) | member(A,intersection(B,C)) # label(intersection3) # label(axiom). [assumption].
% 10.01/10.31 98 A = null_class | member(regular(A),A) # label(regularity1) # label(axiom). [assumption].
% 10.01/10.31 99 null_class = A | member(regular(A),A). [copy(98),flip(a)].
% 10.01/10.31 100 A = null_class | intersection(A,regular(A)) = null_class # label(regularity2) # label(axiom). [assumption].
% 10.01/10.31 101 null_class = A | intersection(A,regular(A)) = null_class. [copy(100),flip(a)].
% 10.01/10.31 123 -member(ordered_pair(A,B),cross_product(C,D)) | member(B,universal_class) # label(corollary_2_to_cartesian_product) # label(axiom). [assumption].
% 10.01/10.31 131 -member(A,null_class) # label(existence_of_null_class) # label(axiom). [assumption].
% 10.01/10.31 154 -member(A,universal_class) | singleton(A) != null_class # label(corollary_to_set_in_its_singleton) # label(axiom). [assumption].
% 10.01/10.31 185 unordered_pair(singleton(A),unordered_pair(A,null_class)) = ordered_pair(A,B) | member(B,universal_class) # label(property_1_of_ordered_pair) # label(axiom). [assumption].
% 10.01/10.31 186 ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,null_class)) | member(B,universal_class). [copy(185),flip(a)].
% 10.01/10.31 195 member(ordered_pair(first(A),second(A)),cross_product(universal_class,universal_class)) | second(A) = A # label(existence_of_1st_and_2nd_3) # label(axiom). [assumption].
% 10.01/10.31 197 ordered_pair(first(A),second(A)) = A | second(A) = A # label(existence_of_1st_and_2nd_5) # label(axiom). [assumption].
% 10.01/10.31 204 -member(y,universal_class) # label(prove_corollary_2_to_OP_determines_components2_1) # label(negated_conjecture). [assumption].
% 10.01/10.31 205 second(ordered_pair(x,y)) != ordered_pair(x,y) # label(prove_corollary_2_to_OP_determines_components2_2) # label(negated_conjecture). [assumption].
% 10.01/10.31 254 -member(A,B) | member(A,universal_class). [resolve(29,a,26,a)].
% 10.01/10.31 303 null_class = A | -member(regular(A),B) | member(regular(A),intersection(A,B)). [resolve(99,b,48,a)].
% 10.01/10.31 310 unordered_pair(A,B) = null_class | regular(unordered_pair(A,B)) = A | regular(unordered_pair(A,B)) = B. [resolve(99,b,33,a),flip(a)].
% 10.01/10.31 311 singleton(A) = null_class | regular(singleton(A)) = A. [factor(310,b,c),rewrite([37(1),37(4)])].
% 10.01/10.31 740 ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,null_class)) | singleton(B) != null_class. [resolve(186,b,154,a)].
% 10.01/10.31 876 second(A) = A | member(A,cross_product(universal_class,universal_class)). [para(197(a,1),195(a,1)),merge(c)].
% 10.01/10.31 935 unordered_pair(singleton(A),unordered_pair(A,null_class)) = ordered_pair(A,y). [resolve(204,a,186,b),flip(a)].
% 10.01/10.31 956 ordered_pair(A,y) = ordered_pair(A,B) | singleton(B) != null_class. [back_rewrite(740),rewrite([935(5)]),flip(a)].
% 10.01/10.31 1147 member(regular(A),universal_class) | null_class = A. [resolve(254,a,99,b)].
% 10.01/10.31 4081 null_class = A | member(regular(A),intersection(A,universal_class)). [resolve(303,b,1147,a),merge(c)].
% 10.01/10.31 4926 singleton(A) = null_class | intersection(singleton(A),A) = null_class. [para(311(b,1),101(b,1,2)),flip(b),merge(b)].
% 10.01/10.31 14746 singleton(universal_class) = null_class. [para(4926(b,1),4081(b,2)),flip(b),merge(b),unit_del(b,131)].
% 10.01/10.31 14775 ordered_pair(A,y) = ordered_pair(A,universal_class). [resolve(14746,a,956,b)].
% 10.01/10.31 16764 second(ordered_pair(x,universal_class)) != ordered_pair(x,universal_class). [back_rewrite(205),rewrite([14775(3),14775(7)])].
% 10.01/10.31 16812 -member(ordered_pair(A,universal_class),cross_product(B,C)). [para(14775(a,1),123(a,1)),unit_del(b,204)].
% 10.01/10.31 16839 second(ordered_pair(A,universal_class)) = ordered_pair(A,universal_class). [resolve(16812,a,876,b)].
% 10.01/10.31 16840 $F. [resolve(16839,a,16764,a)].
% 10.01/10.31
% 10.01/10.31 % SZS output end Refutation
% 10.01/10.31 ============================== end of proof ==========================
% 10.01/10.31
% 10.01/10.31 ============================== STATISTICS ============================
% 10.01/10.31
% 10.01/10.31 Given=4844. Generated=355473. Kept=16753. proofs=1.
% 10.01/10.31 Usable=3552. Sos=9408. Demods=265. Limbo=0, Disabled=3983. Hints=0.
% 10.01/10.31 Megabytes=24.21.
% 10.01/10.31 User_CPU=9.13, System_CPU=0.16, Wall_clock=10.
% 10.01/10.31
% 10.01/10.31 ============================== end of statistics =====================
% 10.01/10.31
% 10.01/10.31 ============================== end of search =========================
% 10.01/10.31
% 10.01/10.31 THEOREM PROVED
% 10.01/10.31 % SZS status Unsatisfiable
% 10.01/10.31
% 10.01/10.31 Exiting with 1 proof.
% 10.01/10.31
% 10.01/10.31 Process 19417 exit (max_proofs) Sat Jul 9 19:46:47 2022
% 10.01/10.31 Prover9 interrupted
%------------------------------------------------------------------------------