TSTP Solution File: SWV925-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV925-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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 : Wed Jul 20 21:15:16 EDT 2022
% Result : Unsatisfiable 1.00s 1.39s
% Output : Refutation 1.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV925-1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 20:37:39 EDT 2022
% 0.15/0.36 % CPUTime :
% 1.00/1.33 ============================== Prover9 ===============================
% 1.00/1.33 Prover9 (32) version 2009-11A, November 2009.
% 1.00/1.33 Process 13853 was started by sandbox on n010.cluster.edu,
% 1.00/1.33 Tue Jun 14 20:37:40 2022
% 1.00/1.33 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13698_n010.cluster.edu".
% 1.00/1.33 ============================== end of head ===========================
% 1.00/1.33
% 1.00/1.33 ============================== INPUT =================================
% 1.00/1.33
% 1.00/1.33 % Reading from file /tmp/Prover9_13698_n010.cluster.edu
% 1.00/1.33
% 1.00/1.33 set(prolog_style_variables).
% 1.00/1.33 set(auto2).
% 1.00/1.33 % set(auto2) -> set(auto).
% 1.00/1.33 % set(auto) -> set(auto_inference).
% 1.00/1.33 % set(auto) -> set(auto_setup).
% 1.00/1.33 % set(auto_setup) -> set(predicate_elim).
% 1.00/1.33 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.00/1.33 % set(auto) -> set(auto_limits).
% 1.00/1.33 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.00/1.33 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.00/1.33 % set(auto) -> set(auto_denials).
% 1.00/1.33 % set(auto) -> set(auto_process).
% 1.00/1.33 % set(auto2) -> assign(new_constants, 1).
% 1.00/1.33 % set(auto2) -> assign(fold_denial_max, 3).
% 1.00/1.33 % set(auto2) -> assign(max_weight, "200.000").
% 1.00/1.33 % set(auto2) -> assign(max_hours, 1).
% 1.00/1.33 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.00/1.33 % set(auto2) -> assign(max_seconds, 0).
% 1.00/1.33 % set(auto2) -> assign(max_minutes, 5).
% 1.00/1.33 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.00/1.33 % set(auto2) -> set(sort_initial_sos).
% 1.00/1.33 % set(auto2) -> assign(sos_limit, -1).
% 1.00/1.33 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.00/1.33 % set(auto2) -> assign(max_megs, 400).
% 1.00/1.33 % set(auto2) -> assign(stats, some).
% 1.00/1.33 % set(auto2) -> clear(echo_input).
% 1.00/1.33 % set(auto2) -> set(quiet).
% 1.00/1.33 % set(auto2) -> clear(print_initial_clauses).
% 1.00/1.33 % set(auto2) -> clear(print_given).
% 1.00/1.33 assign(lrs_ticks,-1).
% 1.00/1.33 assign(sos_limit,10000).
% 1.00/1.33 assign(order,kbo).
% 1.00/1.33 set(lex_order_vars).
% 1.00/1.33 clear(print_given).
% 1.00/1.33
% 1.00/1.33 % formulas(sos). % not echoed (614 formulas)
% 1.00/1.33
% 1.00/1.33 ============================== end of input ==========================
% 1.00/1.33
% 1.00/1.33 % From the command line: assign(max_seconds, 300).
% 1.00/1.33
% 1.00/1.33 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.00/1.33
% 1.00/1.33 % Formulas that are not ordinary clauses:
% 1.00/1.33
% 1.00/1.33 ============================== end of process non-clausal formulas ===
% 1.00/1.33
% 1.00/1.33 ============================== PROCESS INITIAL CLAUSES ===============
% 1.00/1.33
% 1.00/1.33 ============================== PREDICATE ELIMINATION =================
% 1.00/1.33 1 class_Orderings_Olinorder(tc_nat) # label(clsarity_nat__Orderings_Olinorder) # label(axiom). [assumption].
% 1.00/1.33 2 -class_Orderings_Olinorder(A) | -c_in(B,hAPP(c_List_Oset(C),D),C) | -c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(E,B,D,C,A),C) # label(cls_distinct__insort_0) # label(axiom). [assumption].
% 1.00/1.33 3 -class_Orderings_Olinorder(A) | hAPP(c_List_Oset(A),B) != hAPP(c_List_Oset(A),C) | -c_List_Odistinct(C,A) | -c_List_Olinorder__class_Osorted(C,A) | -c_List_Odistinct(B,A) | -c_List_Olinorder__class_Osorted(B,A) | B = C # label(cls_sorted__distinct__set__unique_0) # label(axiom). [assumption].
% 1.00/1.33 4 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | -c_in(C,hAPP(c_List_Oset(A),D),A) | -c_in(B,hAPP(c_List_Oset(A),E),A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(E,D,A),A) # label(cls_sorted__append_2) # label(axiom). [assumption].
% 1.00/1.33 5 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Oinsort__key(B,C,c_List_Olist_OCons(D,E,F),F,A) = c_List_Olist_OCons(C,c_List_Olist_OCons(D,E,F),F) | -c_lessequals(hAPP(B,C),hAPP(B,D),A) # label(cls_insort__key_Osimps_I2_J_0) # label(axiom). [assumption].
% 1.00/1.33 6 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_OtakeWhile(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__takeWhile_0) # label(axiom). [assumption].
% 1.00/1.33 7 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Oinsort__key(B,C,c_List_Olist_OCons(D,E,F),F,A) = c_List_Olist_OCons(D,c_List_Olinorder__class_Oinsort__key(B,C,E,F,A),F) | c_lessequals(hAPP(B,C),hAPP(B,D),A) # label(cls_insort__key_Osimps_I2_J_1) # label(axiom). [assumption].
% 1.00/1.33 8 -class_Orderings_Olinorder(A) | c_Nat_Osize__class_Osize(c_List_Olinorder__class_Oinsort__key(B,C,D,E,A),tc_List_Olist(E)) = c_Suc(c_Nat_Osize__class_Osize(D,tc_List_Olist(E))) # label(cls_length__insert_0) # label(axiom). [assumption].
% 1.00/1.33 9 -class_Orderings_Olinorder(A) | hAPP(c_List_Oset(B),c_List_Olinorder__class_Oinsort__key(C,D,E,B,A)) = c_Set_Oinsert(D,hAPP(c_List_Oset(B),E),B) # label(cls_set__insort_0) # label(axiom). [assumption].
% 1.00/1.33 10 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_OCons(C,D,A),A),A) # label(cls_sorted_Osimps_I3_J_0) # label(axiom). [assumption].
% 1.00/1.33 11 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | -c_in(C,hAPP(c_List_Oset(A),D),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,D,A),A) # label(cls_sorted__Cons_1) # label(axiom). [assumption].
% 1.00/1.33 12 -class_Orderings_Olinorder(A) | c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(B,C,D,E,A),E) | -c_List_Odistinct(D,E) | c_in(C,hAPP(c_List_Oset(E),D),E) # label(cls_distinct__insort_2) # label(axiom). [assumption].
% 1.00/1.33 13 -class_Orderings_Olinorder(A) | c_List_Odistinct(B,C) | -c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(D,E,B,C,A),C) # label(cls_distinct__insort_1) # label(axiom). [assumption].
% 1.00/1.33 14 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,A),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(D,c_List_Olist_OCons(B,C,A),A),A) # label(cls_sorted_Osimps_I3_J_1) # label(axiom). [assumption].
% 1.00/1.33 15 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,B,A),A) # label(cls_sorted__Cons_0) # label(axiom). [assumption].
% 1.00/1.33 16 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_ONil(A),A) # label(cls_sorted_Osimps_I1_J_0) # label(axiom). [assumption].
% 1.00/1.33 17 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_OCons(C,D,A),A),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,D,A),A) | -c_lessequals(B,C,A) # label(cls_sorted_Osimps_I3_J_2) # label(axiom). [assumption].
% 1.00/1.33 18 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(C,B,A),A) # label(cls_sorted__append_1) # label(axiom). [assumption].
% 1.00/1.33 19 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(B,C,A),A) # label(cls_sorted__append_0) # label(axiom). [assumption].
% 1.00/1.33 20 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | c_lessequals(C,B,A) # label(cls_linorder__linear_0) # label(axiom). [assumption].
% 1.00/1.33 21 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Oinsort__key(B,C,c_List_Olist_ONil(D),D,A) = c_List_Olist_OCons(C,c_List_Olist_ONil(D),D) # label(cls_insort__key_Osimps_I1_J_0) # label(axiom). [assumption].
% 1.00/1.33 22 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_ONil(A),A),A) # label(cls_sorted_Osimps_I2_J_0) # label(axiom). [assumption].
% 1.00/1.33 Derived: -c_in(A,hAPP(c_List_Oset(B),C),B) | -c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(D,A,C,B,tc_nat),B). [resolve(1,a,2,a)].
% 1.00/1.33 Derived: hAPP(c_List_Oset(tc_nat),A) != hAPP(c_List_Oset(tc_nat),B) | -c_List_Odistinct(B,tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat) | -c_List_Odistinct(A,tc_nat) | -c_List_Olinorder__class_Osorted(A,tc_nat) | A = B. [resolve(1,a,3,a)].
% 1.00/1.33 Derived: c_lessequals(A,B,tc_nat) | -c_in(B,hAPP(c_List_Oset(tc_nat),C),tc_nat) | -c_in(A,hAPP(c_List_Oset(tc_nat),D),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(D,C,tc_nat),tc_nat). [resolve(1,a,4,a)].
% 1.00/1.33 Derived: c_List_Olinorder__class_Oinsort__key(A,B,c_List_Olist_OCons(C,D,E),E,tc_nat) = c_List_Olist_OCons(B,c_List_Olist_OCons(C,D,E),E) | -c_lessequals(hAPP(A,B),hAPP(A,C),tc_nat). [resolve(1,a,5,a)].
% 1.00/1.33 Derived: c_List_Olinorder__class_Osorted(c_List_OtakeWhile(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(1,a,6,a)].
% 1.00/1.33 Derived: c_List_Olinorder__class_Oinsort__key(A,B,c_List_Olist_OCons(C,D,E),E,tc_nat) = c_List_Olist_OCons(C,c_List_Olinorder__class_Oinsort__key(A,B,D,E,tc_nat),E) | c_lessequals(hAPP(A,B),hAPP(A,C),tc_nat). [resolve(1,a,7,a)].
% 1.00/1.39 Derived: c_Nat_Osize__class_Osize(c_List_Olinorder__class_Oinsort__key(A,B,C,D,tc_nat),tc_List_Olist(D)) = c_Suc(c_Nat_Osize__class_Osize(C,tc_List_Olist(D))). [resolve(1,a,8,a)].
% 1.00/1.39 Derived: hAPP(c_List_Oset(A),c_List_Olinorder__class_Oinsort__key(B,C,D,A,tc_nat)) = c_Set_Oinsert(C,hAPP(c_List_Oset(A),D),A). [resolve(1,a,9,a)].
% 1.00/1.39 Derived: c_lessequals(A,B,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_OCons(B,C,tc_nat),tc_nat),tc_nat). [resolve(1,a,10,a)].
% 1.00/1.39 Derived: c_lessequals(A,B,tc_nat) | -c_in(B,hAPP(c_List_Oset(tc_nat),C),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,C,tc_nat),tc_nat). [resolve(1,a,11,a)].
% 1.00/1.39 Derived: c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(A,B,C,D,tc_nat),D) | -c_List_Odistinct(C,D) | c_in(B,hAPP(c_List_Oset(D),C),D). [resolve(1,a,12,a)].
% 1.00/1.39 Derived: c_List_Odistinct(A,B) | -c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(C,D,A,B,tc_nat),B). [resolve(1,a,13,a)].
% 1.00/1.39 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,c_List_Olist_OCons(A,B,tc_nat),tc_nat),tc_nat). [resolve(1,a,14,a)].
% 1.00/1.39 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,A,tc_nat),tc_nat). [resolve(1,a,15,a)].
% 1.00/1.39 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_ONil(tc_nat),tc_nat). [resolve(1,a,16,a)].
% 1.00/1.39 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_OCons(B,C,tc_nat),tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,tc_nat),tc_nat) | -c_lessequals(A,B,tc_nat). [resolve(1,a,17,a)].
% 1.00/1.39 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(B,A,tc_nat),tc_nat). [resolve(1,a,18,a)].
% 1.00/1.39 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(A,B,tc_nat),tc_nat). [resolve(1,a,19,a)].
% 1.00/1.39 Derived: c_lessequals(A,B,tc_nat) | c_lessequals(B,A,tc_nat). [resolve(1,a,20,a)].
% 1.00/1.39 Derived: c_List_Olinorder__class_Oinsort__key(A,B,c_List_Olist_ONil(C),C,tc_nat) = c_List_Olist_OCons(B,c_List_Olist_ONil(C),C). [resolve(1,a,21,a)].
% 1.00/1.39 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_ONil(tc_nat),tc_nat),tc_nat). [resolve(1,a,22,a)].
% 1.00/1.39 23 A = B | -c_fequal(A,B,C) # label(cls_ATP__Linkup_Ofequal__imp__equal_0) # label(axiom). [assumption].
% 1.00/1.39 24 c_fequal(A,A,B) # label(cls_ATP__Linkup_Oequal__imp__fequal_0) # label(axiom). [assumption].
% 1.00/1.39 Derived: A = A. [resolve(23,b,24,a)].
% 1.00/1.39
% 1.00/1.39 ============================== end predicate elimination =============
% 1.00/1.39
% 1.00/1.39 Auto_denials: (non-Horn, no changes).
% 1.00/1.39
% 1.00/1.39 Term ordering decisions:
% 1.00/1.39 Function symbol KB weights: tc_String_Ochar=1. tc_Value_Oval=1. tc_nat=1. tc_bool=1. tc_Type_Oty=1. t_b=1. t_a=1. v_A=1. v_aj=1. v_ak=1. v_al=1. tc_prod=1. tc_fun=1. hAPP=1. c_Nat_Osize__class_Osize=1. c_DefAss_O_092_060A_062=1. c_List_Orev=1. c_Transitive__Closure_Ortrancl=1. c_Expr_Oexp_OVal=1. c_List_Obutlast=1. c_List_Olast=1. c_List_Oconcat=1. c_Expr_Oexp_Onew=1. c_Expr_Oexp_Othrow=1. tc_List_Olist=1. tc_Option_Ooption=1. tc_Expr_Oexp=1. c_List_Olist_ONil=1. c_Option_Ooption_OSome=1. c_List_Oset=1. c_Orderings_Obot__class_Obot=1. c_Option_Ooption_ONone=1. c_Suc=1. c_SmallStep_Ored=1. c_HOL_Ozero__class_Ozero=1. c_SmallStep_Oblocks=1. c_List_Olist_OCons=1. c_List_Oappend=1. c_Set_Oinsert=1. c_DefAss_OhyperUn=1. c_Expr_Oexp_OSeq=1. c_List_OtakeWhile=1. c_Expr_Oexp_OLAss=1. c_Expr_Oexp_OWhile=1. c_Expr_Oexp_OCast=1. c_List_Osplice=1. c_ATP__Linkup_Osko__Option__Xospec__1__1=1. c_Pair=1. c_Map_Omap__add=1. c_Complete__Lattice_Ocomplete__lattice__class_OSUPR=1. c_Expr_Oexp_OBinOp=1. c_Expr_Oexp_OCond=1. c_Expr_Oexp_OBlock=1. c_Expr_Oexp_OFAcc=1. c_Expr_Oexp_OCall=1. c_Option_Omap=1. c_Fun_Ofun__upd=1. c_Map_Omap__upds=1. c_Expr_Oexp_OFAss=1. c_Expr_Oexp_OTryCatch=1. c_List_Olinorder__class_Oinsort__key=1. c_Fun_Ooverride__on=1. c_Option_Ooption_Ooption__case=1. c_Map_Omap__comp=1. c_Equivalence_Osko__Equivalence__XblocksEval__1__1=1.
% 1.00/1.39
% 1.00/1.39 ============================== PROOF =================================
% 1.00/1.39 % SZS status Unsatisfiable
% 1.00/1.39 % SZS output start Refutation
% 1.00/1.39
% 1.00/1.39 % Proof 1 at 0.16 (+ 0.00) seconds.
% 1.00/1.39 % Length of proof is 7.
% 1.00/1.39 % Level of proof is 2.
% 1.00/1.39 % Maximum clause weight is 13.000.
% 1.00/1.39 % Given clauses 0.
% 1.00/1.39
% 1.00/1.39 78 c_HOL_Ozero__class_Ozero(tc_nat) != c_Suc(A) # label(cls_nat_Osimps_I2_J_0) # label(axiom). [assumption].
% 1.00/1.39 79 c_Suc(A) != c_HOL_Ozero__class_Ozero(tc_nat). [copy(78),flip(a)].
% 1.00/1.39 594 c_Suc(c_Nat_Osize__class_Osize(A,tc_List_Olist(B))) = c_Nat_Osize__class_Osize(c_List_Olist_OCons(C,A,B),tc_List_Olist(B)) # label(cls_Suc__length__conv_2) # label(axiom). [assumption].
% 1.00/1.39 595 c_Nat_Osize__class_Osize(c_List_Olist_OCons(A,B,C),tc_List_Olist(C)) = c_Suc(c_Nat_Osize__class_Osize(B,tc_List_Olist(C))). [copy(594),flip(a)].
% 1.00/1.39 603 c_Nat_Osize__class_Osize(c_List_Olist_ONil(A),tc_List_Olist(A)) = c_HOL_Ozero__class_Ozero(tc_nat) # label(cls_length__0__conv_1) # label(axiom). [assumption].
% 1.00/1.39 623 c_Nat_Osize__class_Osize(c_List_Olist_OCons(v_aj,v_ak,tc_Value_Oval),tc_List_Olist(tc_Value_Oval)) = c_Nat_Osize__class_Osize(c_List_Olist_ONil(tc_Type_Oty),tc_List_Olist(tc_Type_Oty)) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 1.00/1.39 624 $F. [copy(623),rewrite([595(7),603(10)]),unit_del(a,79)].
% 1.00/1.39
% 1.00/1.39 % SZS output end Refutation
% 1.00/1.39 ============================== end of proof ==========================
% 1.00/1.39
% 1.00/1.39 ============================== STATISTICS ============================
% 1.00/1.39
% 1.00/1.39 Given=0. Generated=574. Kept=401. proofs=1.
% 1.00/1.39 Usable=0. Sos=0. Demods=58. Limbo=401, Disabled=598. Hints=0.
% 1.00/1.39 Megabytes=1.29.
% 1.00/1.39 User_CPU=0.16, System_CPU=0.00, Wall_clock=0.
% 1.00/1.39
% 1.00/1.39 ============================== end of statistics =====================
% 1.00/1.39
% 1.00/1.39 ============================== end of search =========================
% 1.00/1.39
% 1.00/1.39 THEOREM PROVED
% 1.00/1.39 % SZS status Unsatisfiable
% 1.00/1.39
% 1.00/1.39 Exiting with 1 proof.
% 1.00/1.39
% 1.00/1.39 Process 13853 exit (max_proofs) Tue Jun 14 20:37:40 2022
% 1.00/1.39 Prover9 interrupted
%------------------------------------------------------------------------------