TSTP Solution File: PUZ019-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ019-1 : TPTP v8.1.0. Bugfixed v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 : Mon Jul 18 18:23:51 EDT 2022
% Result : Unsatisfiable 0.71s 1.00s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PUZ019-1 : TPTP v8.1.0. Bugfixed v5.1.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.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 May 28 23:02:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/0.97 ============================== Prover9 ===============================
% 0.71/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.97 Process 17405 was started by sandbox on n022.cluster.edu,
% 0.71/0.97 Sat May 28 23:02:53 2022
% 0.71/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17252_n022.cluster.edu".
% 0.71/0.97 ============================== end of head ===========================
% 0.71/0.97
% 0.71/0.97 ============================== INPUT =================================
% 0.71/0.97
% 0.71/0.97 % Reading from file /tmp/Prover9_17252_n022.cluster.edu
% 0.71/0.97
% 0.71/0.97 set(prolog_style_variables).
% 0.71/0.97 set(auto2).
% 0.71/0.97 % set(auto2) -> set(auto).
% 0.71/0.97 % set(auto) -> set(auto_inference).
% 0.71/0.97 % set(auto) -> set(auto_setup).
% 0.71/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.97 % set(auto) -> set(auto_limits).
% 0.71/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.97 % set(auto) -> set(auto_denials).
% 0.71/0.97 % set(auto) -> set(auto_process).
% 0.71/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.97 % set(auto2) -> assign(stats, some).
% 0.71/0.97 % set(auto2) -> clear(echo_input).
% 0.71/0.97 % set(auto2) -> set(quiet).
% 0.71/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.97 % set(auto2) -> clear(print_given).
% 0.71/0.97 assign(lrs_ticks,-1).
% 0.71/0.97 assign(sos_limit,10000).
% 0.71/0.97 assign(order,kbo).
% 0.71/0.97 set(lex_order_vars).
% 0.71/0.97 clear(print_given).
% 0.71/0.97
% 0.71/0.97 % formulas(sos). % not echoed (64 formulas)
% 0.71/0.97
% 0.71/0.97 ============================== end of input ==========================
% 0.71/0.97
% 0.71/0.97 % From the command line: assign(max_seconds, 300).
% 0.71/0.97
% 0.71/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.97
% 0.71/0.97 % Formulas that are not ordinary clauses:
% 0.71/0.97
% 0.71/0.97 ============================== end of process non-clausal formulas ===
% 0.71/0.97
% 0.71/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.97
% 0.71/0.97 ============================== PREDICATE ELIMINATION =================
% 0.71/0.97 1 -male(A) | -female(A) # label(males_are_not_female) # label(axiom). [assumption].
% 0.71/0.97 2 male(steve) # label(steve_is_male) # label(hypothesis). [assumption].
% 0.71/0.97 3 male(pete) # label(pete_is_male) # label(hypothesis). [assumption].
% 0.71/0.97 4 male(A) | female(A) # label(everyone_male_or_female) # label(axiom). [assumption].
% 0.71/0.97 Derived: -female(steve). [resolve(1,a,2,a)].
% 0.71/0.97 Derived: -female(pete). [resolve(1,a,3,a)].
% 0.71/0.97 5 -has_job(A,nurse) | male(A) # label(nurse_is_male) # label(axiom). [assumption].
% 0.71/0.97 Derived: -has_job(A,nurse) | -female(A). [resolve(5,b,1,a)].
% 0.71/0.97 6 -has_job(A,actor) | male(A) # label(actor_is_male) # label(axiom). [assumption].
% 0.71/0.97 Derived: -has_job(A,actor) | -female(A). [resolve(6,b,1,a)].
% 0.71/0.97 7 -husband(A,B) | male(B) # label(husband_is_male) # label(axiom). [assumption].
% 0.71/0.97 Derived: -husband(A,B) | -female(B). [resolve(7,b,1,a)].
% 0.71/0.97 8 -female(steve). [resolve(1,a,2,a)].
% 0.71/0.97 9 female(roberta) # label(roberta_is_female) # label(hypothesis). [assumption].
% 0.71/0.97 10 female(thelma) # label(thelma_is_female) # label(hypothesis). [assumption].
% 0.71/0.97 11 -has_job(A,chef) | female(A) # label(chef_is_female) # label(axiom). [assumption].
% 0.71/0.97 12 -husband(A,B) | female(A) # label(wife_is_female) # label(axiom). [assumption].
% 0.71/0.97 Derived: -has_job(steve,chef). [resolve(8,a,11,b)].
% 0.71/0.97 Derived: -husband(steve,A). [resolve(8,a,12,b)].
% 0.71/0.97 13 -female(pete). [resolve(1,a,3,a)].
% 0.71/0.97 Derived: -has_job(pete,chef). [resolve(13,a,11,b)].
% 0.71/0.97 Derived: -husband(pete,A). [resolve(13,a,12,b)].
% 0.71/0.97 14 -has_job(A,nurse) | -female(A). [resolve(5,b,1,a)].
% 0.71/0.97 Derived: -has_job(roberta,nurse). [resolve(14,b,9,a)].
% 0.71/0.97 Derived: -has_job(thelma,nurse). [resolve(14,b,10,a)].
% 0.71/0.97 Derived: -has_job(A,nurse) | -has_job(A,chef). [resolve(14,b,11,b)].
% 0.71/0.97 Derived: -has_job(A,nurse) | -husband(A,B). [resolve(14,b,12,b)].
% 0.71/1.00 15 -has_job(A,actor) | -female(A). [resolve(6,b,1,a)].
% 0.71/1.00 Derived: -has_job(roberta,actor). [resolve(15,b,9,a)].
% 0.71/1.00 Derived: -has_job(thelma,actor). [resolve(15,b,10,a)].
% 0.71/1.00 Derived: -has_job(A,actor) | -has_job(A,chef). [resolve(15,b,11,b)].
% 0.71/1.00 Derived: -has_job(A,actor) | -husband(A,B). [resolve(15,b,12,b)].
% 0.71/1.00 16 -husband(A,B) | -female(B). [resolve(7,b,1,a)].
% 0.71/1.00 Derived: -husband(A,roberta). [resolve(16,b,9,a)].
% 0.71/1.00 Derived: -husband(A,thelma). [resolve(16,b,10,a)].
% 0.71/1.00 Derived: -husband(A,B) | -has_job(B,chef). [resolve(16,b,11,b)].
% 0.71/1.00 Derived: -husband(A,B) | -husband(B,C). [resolve(16,b,12,b)].
% 0.71/1.00 17 -has_job(A,nurse) | educated(A) # label(nurse_is_educated) # label(axiom). [assumption].
% 0.71/1.00 18 -educated(pete) # label(pete_is_not_educated) # label(hypothesis). [assumption].
% 0.71/1.00 Derived: -has_job(pete,nurse). [resolve(17,b,18,a)].
% 0.71/1.00 19 -has_job(A,teacher) | educated(A) # label(teacher_is_educated) # label(axiom). [assumption].
% 0.71/1.00 Derived: -has_job(pete,teacher). [resolve(19,b,18,a)].
% 0.71/1.00 20 -has_job(A,police) | educated(A) # label(police_is_educated) # label(axiom). [assumption].
% 0.71/1.00 Derived: -has_job(pete,police). [resolve(20,b,18,a)].
% 0.71/1.00
% 0.71/1.00 ============================== end predicate elimination =============
% 0.71/1.00
% 0.71/1.00 Auto_denials: (non-Horn, no changes).
% 0.71/1.00
% 0.71/1.00 Term ordering decisions:
% 0.71/1.00 Function symbol KB weights: chef=1. operator=1. actor=1. boxer=1. guard=1. nurse=1. pete=1. police=1. roberta=1. steve=1. teacher=1. thelma=1.
% 0.71/1.00
% 0.71/1.00 ============================== end of process initial clauses ========
% 0.71/1.00
% 0.71/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.00
% 0.71/1.00 ============================== end of clauses for search =============
% 0.71/1.00
% 0.71/1.00 ============================== SEARCH ================================
% 0.71/1.00
% 0.71/1.00 % Starting search at 0.02 seconds.
% 0.71/1.00
% 0.71/1.00 ============================== PROOF =================================
% 0.71/1.00 % SZS status Unsatisfiable
% 0.71/1.00 % SZS output start Refutation
% 0.71/1.00
% 0.71/1.00 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.71/1.00 % Length of proof is 88.
% 0.71/1.00 % Level of proof is 16.
% 0.71/1.00 % Maximum clause weight is 24.000.
% 0.71/1.00 % Given clauses 165.
% 0.71/1.00
% 0.71/1.00 1 -male(A) | -female(A) # label(males_are_not_female) # label(axiom). [assumption].
% 0.71/1.00 2 male(steve) # label(steve_is_male) # label(hypothesis). [assumption].
% 0.71/1.00 3 male(pete) # label(pete_is_male) # label(hypothesis). [assumption].
% 0.71/1.00 5 -has_job(A,nurse) | male(A) # label(nurse_is_male) # label(axiom). [assumption].
% 0.71/1.00 6 -has_job(A,actor) | male(A) # label(actor_is_male) # label(axiom). [assumption].
% 0.71/1.00 7 -husband(A,B) | male(B) # label(husband_is_male) # label(axiom). [assumption].
% 0.71/1.00 8 -female(steve). [resolve(1,a,2,a)].
% 0.71/1.00 9 female(roberta) # label(roberta_is_female) # label(hypothesis). [assumption].
% 0.71/1.00 10 female(thelma) # label(thelma_is_female) # label(hypothesis). [assumption].
% 0.71/1.00 11 -has_job(A,chef) | female(A) # label(chef_is_female) # label(axiom). [assumption].
% 0.71/1.00 12 -husband(A,B) | female(A) # label(wife_is_female) # label(axiom). [assumption].
% 0.71/1.00 13 -female(pete). [resolve(1,a,3,a)].
% 0.71/1.00 14 -has_job(A,nurse) | -female(A). [resolve(5,b,1,a)].
% 0.71/1.00 15 -has_job(A,actor) | -female(A). [resolve(6,b,1,a)].
% 0.71/1.00 16 -husband(A,B) | -female(B). [resolve(7,b,1,a)].
% 0.71/1.00 17 -has_job(A,nurse) | educated(A) # label(nurse_is_educated) # label(axiom). [assumption].
% 0.71/1.00 18 -educated(pete) # label(pete_is_not_educated) # label(hypothesis). [assumption].
% 0.71/1.00 19 -has_job(A,teacher) | educated(A) # label(teacher_is_educated) # label(axiom). [assumption].
% 0.71/1.00 20 -has_job(A,police) | educated(A) # label(police_is_educated) # label(axiom). [assumption].
% 0.71/1.00 23 has_job(roberta,A) | has_job(thelma,A) | has_job(pete,A) | has_job(steve,A) # label(every_job_is_used) # label(hypothesis). [assumption].
% 0.71/1.00 24 has_job(A,chef) | has_job(A,guard) | has_job(A,nurse) | has_job(A,operator) | has_job(A,police) | has_job(A,teacher) | has_job(A,actor) | has_job(A,boxer) # label(everyone_works) # label(hypothesis). [assumption].
% 0.71/1.00 38 -equal_jobs(guard,nurse) # label(guard_not_nurse) # label(axiom). [assumption].
% 0.71/1.00 39 -equal_jobs(guard,operator) # label(guard_not_operator) # label(axiom). [assumption].
% 0.71/1.00 40 -equal_jobs(guard,police) # label(guard_not_police) # label(axiom). [assumption].
% 0.71/1.00 41 -equal_jobs(guard,actor) # label(guard_not_actor) # label(axiom). [assumption].
% 0.71/1.00 44 -equal_jobs(nurse,operator) # label(nurse_not_operator) # label(axiom). [assumption].
% 0.71/1.00 45 -equal_jobs(nurse,police) # label(nurse_not_police) # label(axiom). [assumption].
% 0.71/1.00 46 -equal_jobs(nurse,actor) # label(nurse_not_actor) # label(axiom). [assumption].
% 0.71/1.00 47 -equal_jobs(nurse,boxer) # label(nurse_not_boxer) # label(axiom). [assumption].
% 0.71/1.00 48 -equal_jobs(nurse,teacher) # label(nurse_not_teacher) # label(axiom). [assumption].
% 0.71/1.00 49 -equal_jobs(operator,police) # label(operator_not_police) # label(axiom). [assumption].
% 0.71/1.00 50 -equal_jobs(operator,actor) # label(operator_not_actor) # label(axiom). [assumption].
% 0.71/1.00 51 -equal_jobs(operator,boxer) # label(operator_not_boxer) # label(axiom). [assumption].
% 0.71/1.00 53 -equal_jobs(police,actor) # label(police_not_actor) # label(axiom). [assumption].
% 0.71/1.00 54 -equal_jobs(police,boxer) # label(police_not_boxer) # label(axiom). [assumption].
% 0.71/1.00 55 -equal_jobs(police,teacher) # label(police_not_teacher) # label(axiom). [assumption].
% 0.71/1.00 56 -equal_jobs(actor,boxer) # label(actor_not_boxer) # label(axiom). [assumption].
% 0.71/1.00 59 -has_job(roberta,chef) # label(roberta_is_not_chef) # label(hypothesis). [assumption].
% 0.71/1.00 60 -has_job(roberta,boxer) # label(roberta_is_not_boxer) # label(hypothesis). [assumption].
% 0.71/1.00 61 -has_job(roberta,police) # label(roberta_is_not_police) # label(hypothesis). [assumption].
% 0.71/1.00 62 -has_job(A,chef) | -has_job(A,police) # label(chef_is_not_also_police) # label(axiom). [assumption].
% 0.71/1.00 63 -has_job(A,chef) | -has_job(B,guard) | -has_job(C,nurse) | -has_job(D,operator) | -has_job(E,police) | -has_job(F,teacher) | -has_job(V6,actor) | -has_job(V7,boxer) # label(find_who_has_each_job) # label(negated_conjecture). [assumption].
% 0.71/1.00 66 -has_job(A,chef) | -has_job(B,operator) | husband(A,B) # label(husband_of_chef_is_operator1) # label(hypothesis). [assumption].
% 0.71/1.00 69 -has_job(A,B) | -has_job(A,C) | -has_job(A,D) | equal_jobs(B,C) | equal_jobs(B,D) | equal_jobs(C,D) # label(each_has_maximum_of_two_jobs) # label(hypothesis). [assumption].
% 0.71/1.00 70 -has_job(steve,chef). [resolve(8,a,11,b)].
% 0.71/1.00 72 -has_job(pete,chef). [resolve(13,a,11,b)].
% 0.71/1.00 74 -has_job(roberta,nurse). [resolve(14,b,9,a)].
% 0.71/1.00 75 -has_job(thelma,nurse). [resolve(14,b,10,a)].
% 0.71/1.00 78 -has_job(roberta,actor). [resolve(15,b,9,a)].
% 0.71/1.00 79 -has_job(thelma,actor). [resolve(15,b,10,a)].
% 0.71/1.00 82 -husband(A,roberta). [resolve(16,b,9,a)].
% 0.71/1.00 85 -husband(A,B) | -husband(B,C). [resolve(16,b,12,b)].
% 0.71/1.00 86 -has_job(pete,nurse). [resolve(17,b,18,a)].
% 0.71/1.00 87 -has_job(pete,teacher). [resolve(19,b,18,a)].
% 0.71/1.00 88 -has_job(pete,police). [resolve(20,b,18,a)].
% 0.71/1.00 89 -husband(A,A). [factor(85,a,b)].
% 0.71/1.00 90 -has_job(thelma,chef) | has_job(steve,police). [resolve(62,b,23,b),unit_del(b,61),unit_del(c,88)].
% 0.71/1.00 91 -has_job(A,guard) | -has_job(B,nurse) | -has_job(C,operator) | -has_job(D,police) | -has_job(E,teacher) | -has_job(F,actor) | -has_job(V6,boxer). [resolve(63,a,23,b),unit_del(h,59),unit_del(i,72),unit_del(j,70)].
% 0.71/1.00 134 -has_job(A,operator) | husband(thelma,A). [resolve(66,a,23,b),unit_del(c,59),unit_del(d,72),unit_del(e,70)].
% 0.71/1.00 146 has_job(steve,nurse). [resolve(75,a,23,b),unit_del(a,74),unit_del(b,86)].
% 0.71/1.00 147 has_job(pete,actor) | has_job(steve,actor). [resolve(79,a,23,b),unit_del(a,78)].
% 0.71/1.00 149 has_job(steve,police). [resolve(90,a,23,b),unit_del(b,59),unit_del(c,72),unit_del(d,70)].
% 0.71/1.00 160 -has_job(steve,guard). [ur(69,b,146,a,c,149,a,d,38,a,e,40,a,f,45,a)].
% 0.71/1.00 161 -has_job(steve,operator). [ur(69,a,146,a,c,149,a,d,44,a,e,45,a,f,49,a)].
% 0.71/1.00 162 -has_job(steve,teacher). [ur(69,a,146,a,b,149,a,d,45,a,e,48,a,f,55,a)].
% 0.71/1.00 163 -has_job(steve,boxer). [ur(69,a,146,a,b,149,a,d,45,a,e,47,a,f,54,a)].
% 0.71/1.00 164 -has_job(steve,actor). [ur(69,a,146,a,b,149,a,d,45,a,e,46,a,f,53,a)].
% 0.71/1.00 170 has_job(pete,actor). [back_unit_del(147),unit_del(b,164)].
% 0.71/1.00 176 has_job(roberta,operator) | has_job(pete,operator). [resolve(134,a,23,b),unit_del(a,89),unit_del(d,161)].
% 0.71/1.00 178 -has_job(roberta,operator). [ur(134,b,82,a)].
% 0.71/1.00 179 has_job(pete,operator). [back_unit_del(176),unit_del(a,178)].
% 0.71/1.00 181 -has_job(A,guard) | -has_job(B,operator) | -has_job(C,police) | -has_job(D,teacher) | -has_job(E,actor) | -has_job(F,boxer). [resolve(91,b,146,a)].
% 0.71/1.00 194 -has_job(pete,guard). [ur(69,b,179,a,c,170,a,d,39,a,e,41,a,f,50,a)].
% 0.71/1.00 195 -has_job(pete,boxer). [ur(69,a,179,a,b,170,a,d,50,a,e,51,a,f,56,a)].
% 0.71/1.00 210 -has_job(A,guard) | -has_job(B,police) | -has_job(C,teacher) | -has_job(D,actor) | -has_job(E,boxer). [resolve(181,b,179,a)].
% 0.71/1.00 216 -has_job(A,police) | -has_job(B,teacher) | -has_job(C,actor) | -has_job(D,boxer) | has_job(roberta,guard). [resolve(210,a,23,b),unit_del(f,194),unit_del(g,160)].
% 0.71/1.00 217 -has_job(A,guard) | -has_job(B,teacher) | -has_job(C,actor) | -has_job(D,boxer). [resolve(210,b,149,a)].
% 0.71/1.00 222 -has_job(A,teacher) | -has_job(B,actor) | -has_job(C,boxer) | has_job(roberta,guard). [resolve(216,a,149,a)].
% 0.71/1.00 230 -has_job(A,teacher) | -has_job(B,boxer) | has_job(roberta,guard). [resolve(222,b,170,a)].
% 0.71/1.00 235 -has_job(A,teacher) | has_job(roberta,guard). [resolve(230,b,23,b),unit_del(c,60),unit_del(d,195),unit_del(e,163)].
% 0.71/1.00 241 -has_job(A,guard) | -has_job(B,teacher) | -has_job(C,boxer). [resolve(217,c,170,a)].
% 0.71/1.00 245 -has_job(A,guard) | -has_job(B,teacher). [resolve(241,c,23,b),unit_del(c,60),unit_del(d,195),unit_del(e,163)].
% 0.71/1.00 247 -has_job(A,guard) | has_job(roberta,teacher). [resolve(245,b,23,b),unit_del(c,87),unit_del(d,162)].
% 0.71/1.00 248 has_job(roberta,guard) | has_job(A,chef) | has_job(A,guard) | has_job(A,nurse) | has_job(A,operator) | has_job(A,police) | has_job(A,actor) | has_job(A,boxer). [resolve(235,a,24,f)].
% 0.71/1.00 250 has_job(roberta,guard). [factor(248,a,c),unit_del(b,59),unit_del(c,74),unit_del(d,178),unit_del(e,61),unit_del(f,78),unit_del(g,60)].
% 0.71/1.00 251 -has_job(A,teacher). [resolve(250,a,245,a)].
% 0.71/1.00 258 -has_job(A,guard). [back_unit_del(247),unit_del(b,251)].
% 0.71/1.00 259 $F. [resolve(258,a,250,a)].
% 0.71/1.00
% 0.71/1.00 % SZS output end Refutation
% 0.71/1.00 ============================== end of proof ==========================
% 0.71/1.00
% 0.71/1.00 ============================== STATISTICS ============================
% 0.71/1.00
% 0.71/1.00 Given=165. Generated=867. Kept=238. proofs=1.
% 0.71/1.00 Usable=149. Sos=11. Demods=0. Limbo=7, Disabled=158. Hints=0.
% 0.71/1.00 Megabytes=0.19.
% 0.71/1.00 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.71/1.00
% 0.71/1.00 ============================== end of statistics =====================
% 0.71/1.00
% 0.71/1.00 ============================== end of search =========================
% 0.71/1.00
% 0.71/1.00 THEOREM PROVED
% 0.71/1.00 % SZS status Unsatisfiable
% 0.71/1.00
% 0.71/1.00 Exiting with 1 proof.
% 0.71/1.00
% 0.71/1.00 Process 17405 exit (max_proofs) Sat May 28 23:02:53 2022
% 0.71/1.00 Prover9 interrupted
%------------------------------------------------------------------------------