TSTP Solution File: SWV282-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV282-2 : TPTP v8.1.0. Released v3.2.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 : Wed Jul 20 21:11:30 EDT 2022
% Result : Unsatisfiable 0.99s 1.31s
% Output : Refutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV282-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 15 13:08:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.99/1.31 ============================== Prover9 ===============================
% 0.99/1.31 Prover9 (32) version 2009-11A, November 2009.
% 0.99/1.31 Process 30010 was started by sandbox2 on n006.cluster.edu,
% 0.99/1.31 Wed Jun 15 13:08:42 2022
% 0.99/1.31 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29857_n006.cluster.edu".
% 0.99/1.31 ============================== end of head ===========================
% 0.99/1.31
% 0.99/1.31 ============================== INPUT =================================
% 0.99/1.31
% 0.99/1.31 % Reading from file /tmp/Prover9_29857_n006.cluster.edu
% 0.99/1.31
% 0.99/1.31 set(prolog_style_variables).
% 0.99/1.31 set(auto2).
% 0.99/1.31 % set(auto2) -> set(auto).
% 0.99/1.31 % set(auto) -> set(auto_inference).
% 0.99/1.31 % set(auto) -> set(auto_setup).
% 0.99/1.31 % set(auto_setup) -> set(predicate_elim).
% 0.99/1.31 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.99/1.31 % set(auto) -> set(auto_limits).
% 0.99/1.31 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.99/1.31 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.99/1.31 % set(auto) -> set(auto_denials).
% 0.99/1.31 % set(auto) -> set(auto_process).
% 0.99/1.31 % set(auto2) -> assign(new_constants, 1).
% 0.99/1.31 % set(auto2) -> assign(fold_denial_max, 3).
% 0.99/1.31 % set(auto2) -> assign(max_weight, "200.000").
% 0.99/1.31 % set(auto2) -> assign(max_hours, 1).
% 0.99/1.31 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.99/1.31 % set(auto2) -> assign(max_seconds, 0).
% 0.99/1.31 % set(auto2) -> assign(max_minutes, 5).
% 0.99/1.31 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.99/1.31 % set(auto2) -> set(sort_initial_sos).
% 0.99/1.31 % set(auto2) -> assign(sos_limit, -1).
% 0.99/1.31 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.99/1.31 % set(auto2) -> assign(max_megs, 400).
% 0.99/1.31 % set(auto2) -> assign(stats, some).
% 0.99/1.31 % set(auto2) -> clear(echo_input).
% 0.99/1.31 % set(auto2) -> set(quiet).
% 0.99/1.31 % set(auto2) -> clear(print_initial_clauses).
% 0.99/1.31 % set(auto2) -> clear(print_given).
% 0.99/1.31 assign(lrs_ticks,-1).
% 0.99/1.31 assign(sos_limit,10000).
% 0.99/1.31 assign(order,kbo).
% 0.99/1.31 set(lex_order_vars).
% 0.99/1.31 clear(print_given).
% 0.99/1.31
% 0.99/1.31 % formulas(sos). % not echoed (14 formulas)
% 0.99/1.31
% 0.99/1.31 ============================== end of input ==========================
% 0.99/1.31
% 0.99/1.31 % From the command line: assign(max_seconds, 300).
% 0.99/1.31
% 0.99/1.31 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.99/1.31
% 0.99/1.31 % Formulas that are not ordinary clauses:
% 0.99/1.31
% 0.99/1.31 ============================== end of process non-clausal formulas ===
% 0.99/1.31
% 0.99/1.31 ============================== PROCESS INITIAL CLAUSES ===============
% 0.99/1.31
% 0.99/1.31 ============================== PREDICATE ELIMINATION =================
% 0.99/1.31
% 0.99/1.31 ============================== end predicate elimination =============
% 0.99/1.31
% 0.99/1.31 Auto_denials: (non-Horn, no changes).
% 0.99/1.31
% 0.99/1.31 Term ordering decisions:
% 0.99/1.31 Function symbol KB weights: tc_nat=1. c_0=1. tc_Message_Omsg=1. c_1=1. v_evs=1. v_evs_H=1. v_evs_H_H=1. c_Binomial_Obinomial=1. c_Finite__Set_Ocard=1. c_SetInterval_OatMost=1. c_Suc=1. c_Event_Oused=1. c_Message_Omsg_ONonce=1. v_sko__urX=1. c_plus=1. c_minus=1.
% 0.99/1.31
% 0.99/1.31 ============================== end of process initial clauses ========
% 0.99/1.31
% 0.99/1.31 ============================== CLAUSES FOR SEARCH ====================
% 0.99/1.31
% 0.99/1.31 ============================== end of clauses for search =============
% 0.99/1.31
% 0.99/1.31 ============================== SEARCH ================================
% 0.99/1.31
% 0.99/1.31 % Starting search at 0.01 seconds.
% 0.99/1.31
% 0.99/1.31 ============================== PROOF =================================
% 0.99/1.31 % SZS status Unsatisfiable
% 0.99/1.31 % SZS output start Refutation
% 0.99/1.31
% 0.99/1.31 % Proof 1 at 0.31 (+ 0.01) seconds.
% 0.99/1.31 % Length of proof is 64.
% 0.99/1.31 % Level of proof is 24.
% 0.99/1.31 % Maximum clause weight is 29.000.
% 0.99/1.31 % Given clauses 259.
% 0.99/1.31
% 0.99/1.31 1 c_1 = c_Suc(c_0) # label(cls_Nat_OOne__nat__def_0) # label(axiom). [assumption].
% 0.99/1.31 2 c_Suc(c_0) = c_1. [copy(1),flip(a)].
% 0.99/1.31 3 c_Binomial_Obinomial(A,c_0) = c_1 # label(cls_Binomial_Obinomial__n__0_0) # label(axiom). [assumption].
% 0.99/1.31 4 c_less(A,c_Suc(A),tc_nat) # label(cls_Nat_OlessI_0) # label(axiom). [assumption].
% 0.99/1.31 5 c_Binomial_Obinomial(A,c_Suc(c_0)) = A # label(cls_Binomial_Obinomial__1_0) # label(axiom). [assumption].
% 0.99/1.31 6 c_Binomial_Obinomial(A,c_1) = A. [copy(5),rewrite([2(2)])].
% 0.99/1.31 7 c_minus(A,A,tc_nat) = c_0 # label(cls_Nat_Odiff__self__eq__0_0) # label(axiom). [assumption].
% 0.99/1.31 8 c_lessequals(A,c_plus(A,B,tc_nat),tc_nat) # label(cls_Nat_Ole__add1_0) # label(axiom). [assumption].
% 0.99/1.31 9 c_Finite__Set_Ocard(c_SetInterval_OatMost(A,tc_nat),tc_nat) = c_Suc(A) # label(cls_SetInterval_Ocard__atMost_0) # label(axiom). [assumption].
% 0.99/1.31 10 c_Suc(A) = c_Finite__Set_Ocard(c_SetInterval_OatMost(A,tc_nat),tc_nat). [copy(9),flip(a)].
% 0.99/1.31 11 c_Binomial_Obinomial(c_Suc(A),c_Suc(B)) = c_plus(c_Binomial_Obinomial(A,B),c_Binomial_Obinomial(A,c_Suc(B)),tc_nat) # label(cls_Binomial_Obinomial__Suc__Suc_0) # label(axiom). [assumption].
% 0.99/1.31 12 c_plus(c_Binomial_Obinomial(A,B),c_Binomial_Obinomial(A,c_Finite__Set_Ocard(c_SetInterval_OatMost(B,tc_nat),tc_nat)),tc_nat) = c_Binomial_Obinomial(c_Finite__Set_Ocard(c_SetInterval_OatMost(A,tc_nat),tc_nat),c_Finite__Set_Ocard(c_SetInterval_OatMost(B,tc_nat),tc_nat)). [copy(11),rewrite([10(1),10(5),10(11)]),flip(a)].
% 0.99/1.31 13 A = B | C = B | A = C | c_in(c_Message_Omsg_ONonce(B),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) | c_in(c_Message_Omsg_ONonce(C),c_Event_Oused(v_evs_H),tc_Message_Omsg) | c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.99/1.31 14 -c_less(c_plus(A,B,tc_nat),B,tc_nat) # label(cls_Nat_Onot__add__less2_0) # label(axiom). [assumption].
% 0.99/1.31 15 -c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(B),tc_Message_Omsg) | -c_lessequals(v_sko__urX(B),A,tc_nat) # label(cls_Public_ONonce__supply__lemma_0) # label(axiom). [assumption].
% 0.99/1.31 16 -c_lessequals(A,B,tc_nat) | c_less(A,c_Suc(B),tc_nat) # label(cls_Nat_Oless__Suc__eq__le_1) # label(axiom). [assumption].
% 0.99/1.31 17 -c_lessequals(A,B,tc_nat) | c_less(A,c_Finite__Set_Ocard(c_SetInterval_OatMost(B,tc_nat),tc_nat),tc_nat). [copy(16),rewrite([10(3)])].
% 0.99/1.31 18 c_minus(A,B,tc_nat) != c_0 | c_lessequals(A,B,tc_nat) # label(cls_Nat_Odiff__is__0__eq_0) # label(axiom). [assumption].
% 0.99/1.31 19 -c_lessequals(c_plus(A,B,tc_nat),c_plus(A,C,tc_nat),tc_nat) | c_lessequals(B,C,tc_nat) # label(cls_Nat_Onat__add__left__cancel__le_0) # label(axiom). [assumption].
% 0.99/1.31 20 c_less(A,c_Finite__Set_Ocard(c_SetInterval_OatMost(A,tc_nat),tc_nat),tc_nat). [back_rewrite(4),rewrite([10(1)])].
% 0.99/1.31 21 c_Finite__Set_Ocard(c_SetInterval_OatMost(c_0,tc_nat),tc_nat) = c_1. [back_rewrite(2),rewrite([10(2)])].
% 0.99/1.31 22 c_Finite__Set_Ocard(c_SetInterval_OatMost(A,tc_nat),tc_nat) = c_plus(c_1,A,tc_nat). [para(3(a,1),12(a,1,1)),rewrite([21(6),6(3),21(12),6(9)]),flip(a)].
% 0.99/1.31 23 c_plus(A,c_Binomial_Obinomial(A,c_plus(c_1,c_1,tc_nat)),tc_nat) = c_Binomial_Obinomial(c_plus(c_1,A,tc_nat),c_plus(c_1,c_1,tc_nat)). [para(6(a,1),12(a,1,1)),rewrite([22(5),22(11),22(15)])].
% 0.99/1.31 25 c_plus(c_1,c_0,tc_nat) = c_1. [back_rewrite(21),rewrite([22(5)])].
% 0.99/1.31 26 c_less(A,c_plus(c_1,A,tc_nat),tc_nat). [back_rewrite(20),rewrite([22(4)])].
% 0.99/1.31 27 -c_lessequals(A,B,tc_nat) | c_less(A,c_plus(c_1,B,tc_nat),tc_nat). [back_rewrite(17),rewrite([22(6)])].
% 0.99/1.31 33 -c_in(c_Message_Omsg_ONonce(c_plus(v_sko__urX(A),B,tc_nat)),c_Event_Oused(A),tc_Message_Omsg). [ur(15,b,8,a)].
% 0.99/1.31 34 c_lessequals(A,A,tc_nat). [resolve(18,a,7,a)].
% 0.99/1.31 35 c_plus(v_sko__urX(v_evs),A,tc_nat) = B | C = B | c_plus(v_sko__urX(v_evs),A,tc_nat) = C | c_in(c_Message_Omsg_ONonce(B),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) | c_in(c_Message_Omsg_ONonce(C),c_Event_Oused(v_evs_H),tc_Message_Omsg). [resolve(33,a,13,f)].
% 0.99/1.31 38 -c_in(c_Message_Omsg_ONonce(v_sko__urX(A)),c_Event_Oused(A),tc_Message_Omsg). [ur(15,b,34,a)].
% 0.99/1.31 52 v_sko__urX(v_evs) = A | B = A | v_sko__urX(v_evs) = B | c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) | c_in(c_Message_Omsg_ONonce(B),c_Event_Oused(v_evs_H),tc_Message_Omsg). [resolve(38,a,13,f)].
% 0.99/1.31 62 c_less(A,c_plus(c_1,c_plus(A,B,tc_nat),tc_nat),tc_nat). [resolve(27,a,8,a)].
% 0.99/1.31 63 -c_lessequals(c_plus(A,c_plus(c_1,B,tc_nat),tc_nat),B,tc_nat). [ur(27,b,14,a)].
% 0.99/1.31 70 -c_lessequals(c_plus(A,c_plus(B,c_plus(c_1,C,tc_nat),tc_nat),tc_nat),c_plus(A,C,tc_nat),tc_nat). [ur(19,b,63,a)].
% 0.99/1.31 72 -c_lessequals(c_plus(A,c_1,tc_nat),c_0,tc_nat). [para(25(a,1),63(a,1,2))].
% 0.99/1.31 74 -c_lessequals(c_plus(A,c_plus(B,c_1,tc_nat),tc_nat),c_plus(A,c_0,tc_nat),tc_nat). [ur(19,b,72,a)].
% 0.99/1.31 77 c_less(A,c_plus(c_1,c_Binomial_Obinomial(c_plus(c_1,A,tc_nat),c_plus(c_1,c_1,tc_nat)),tc_nat),tc_nat). [para(23(a,1),62(a,2,2))].
% 0.99/1.31 99 -c_lessequals(c_plus(A,c_plus(B,c_plus(C,c_plus(c_1,D,tc_nat),tc_nat),tc_nat),tc_nat),c_plus(A,c_plus(B,D,tc_nat),tc_nat),tc_nat). [ur(19,b,70,a)].
% 0.99/1.31 123 v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs) | v_sko__urX(v_evs_H_H) = A | v_sko__urX(v_evs) = A | c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs_H),tc_Message_Omsg). [resolve(52,d,38,a),flip(a),flip(b)].
% 0.99/1.31 127 v_sko__urX(v_evs) = A | v_sko__urX(v_evs_H) = A | v_sko__urX(v_evs_H) = v_sko__urX(v_evs) | c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs_H_H),tc_Message_Omsg). [resolve(52,e,38,a),flip(c)].
% 0.99/1.31 135 v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs_H),A,tc_nat) = v_sko__urX(v_evs_H_H) | c_plus(v_sko__urX(v_evs_H),A,tc_nat) = v_sko__urX(v_evs). [resolve(123,d,33,a),flip(b),flip(c)].
% 0.99/1.31 150 c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs_H_H) | v_sko__urX(v_evs_H_H) = B | c_plus(v_sko__urX(v_evs),A,tc_nat) = B | c_in(c_Message_Omsg_ONonce(B),c_Event_Oused(v_evs_H),tc_Message_Omsg). [resolve(35,d,38,a),flip(b)].
% 0.99/1.31 168 c_plus(v_sko__urX(v_evs_H_H),A,tc_nat) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs_H_H),A,tc_nat) = v_sko__urX(v_evs_H) | v_sko__urX(v_evs_H) = v_sko__urX(v_evs). [resolve(127,d,33,a),flip(a),flip(b)].
% 0.99/1.31 176 v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs_H),A,tc_nat) = v_sko__urX(v_evs) | -c_less(v_sko__urX(v_evs_H_H),A,tc_nat). [para(135(b,1),14(a,1))].
% 0.99/1.31 249 v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs_H),c_plus(c_1,c_plus(v_sko__urX(v_evs_H_H),A,tc_nat),tc_nat),tc_nat) = v_sko__urX(v_evs). [resolve(176,c,62,a)].
% 0.99/1.31 250 v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs_H),c_plus(c_1,v_sko__urX(v_evs_H_H),tc_nat),tc_nat) = v_sko__urX(v_evs). [resolve(176,c,26,a)].
% 0.99/1.31 385 v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs) | -c_lessequals(v_sko__urX(v_evs),c_plus(v_sko__urX(v_evs_H),c_plus(c_1,A,tc_nat),tc_nat),tc_nat). [para(249(b,1),99(a,1))].
% 0.99/1.31 472 v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs). [para(250(b,1),385(b,2)),merge(b),unit_del(b,34)].
% 0.99/1.31 486 c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs_H) | v_sko__urX(v_evs_H) = v_sko__urX(v_evs). [back_rewrite(168),rewrite([472(2),472(9)])].
% 0.99/1.31 490 c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs) | v_sko__urX(v_evs) = B | c_plus(v_sko__urX(v_evs),A,tc_nat) = B | c_in(c_Message_Omsg_ONonce(B),c_Event_Oused(v_evs_H),tc_Message_Omsg). [back_rewrite(150),rewrite([472(6),472(9)])].
% 0.99/1.31 506 c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs) | v_sko__urX(v_evs_H) = v_sko__urX(v_evs) | -c_less(v_sko__urX(v_evs_H),A,tc_nat). [para(486(b,1),14(a,1))].
% 0.99/1.31 630 c_plus(v_sko__urX(v_evs),c_plus(c_1,v_sko__urX(v_evs_H),tc_nat),tc_nat) = v_sko__urX(v_evs) | v_sko__urX(v_evs_H) = v_sko__urX(v_evs). [resolve(506,c,26,a)].
% 0.99/1.31 667 v_sko__urX(v_evs_H) = v_sko__urX(v_evs) | c_lessequals(c_plus(c_1,v_sko__urX(v_evs_H),tc_nat),A,tc_nat). [para(630(a,1),19(a,1)),unit_del(b,8)].
% 0.99/1.31 691 v_sko__urX(v_evs_H) = v_sko__urX(v_evs) | c_lessequals(v_sko__urX(v_evs_H),A,tc_nat). [resolve(667,b,19,a)].
% 0.99/1.31 693 v_sko__urX(v_evs_H) = v_sko__urX(v_evs) | c_less(v_sko__urX(v_evs_H),c_plus(c_1,A,tc_nat),tc_nat). [resolve(691,b,27,a)].
% 0.99/1.31 719 v_sko__urX(v_evs_H) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs),c_plus(c_1,A,tc_nat),tc_nat) = v_sko__urX(v_evs). [resolve(693,b,506,c),merge(c)].
% 0.99/1.31 828 v_sko__urX(v_evs_H) = v_sko__urX(v_evs). [para(719(b,1),74(a,1)),unit_del(b,8)].
% 0.99/1.31 866 -c_in(c_Message_Omsg_ONonce(c_plus(v_sko__urX(v_evs),A,tc_nat)),c_Event_Oused(v_evs_H),tc_Message_Omsg). [para(828(a,1),33(a,1,1,1))].
% 0.99/1.31 935 c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs),B,tc_nat) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs),A,tc_nat) = c_plus(v_sko__urX(v_evs),B,tc_nat). [resolve(490,d,866,a),flip(b)].
% 0.99/1.31 976 c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs),B,tc_nat) = v_sko__urX(v_evs) | -c_less(c_plus(v_sko__urX(v_evs),B,tc_nat),A,tc_nat). [para(935(c,1),14(a,1))].
% 0.99/1.31 1274 c_plus(v_sko__urX(v_evs),c_plus(c_1,c_plus(v_sko__urX(v_evs),A,tc_nat),tc_nat),tc_nat) = v_sko__urX(v_evs) | c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs). [resolve(976,c,26,a)].
% 0.99/1.31 1276 c_plus(v_sko__urX(v_evs),A,tc_nat) = v_sko__urX(v_evs). [para(1274(a,1),14(a,1)),unit_del(b,62)].
% 0.99/1.31 1277 -c_less(v_sko__urX(v_evs),A,tc_nat). [para(1276(a,1),14(a,1))].
% 0.99/1.31 1278 $F. [resolve(1277,a,77,a)].
% 0.99/1.31
% 0.99/1.31 % SZS output end Refutation
% 0.99/1.31 ============================== end of proof ==========================
% 0.99/1.31
% 0.99/1.31 ============================== STATISTICS ============================
% 0.99/1.31
% 0.99/1.31 Given=259. Generated=3294. Kept=1272. proofs=1.
% 0.99/1.31 Usable=181. Sos=185. Demods=28. Limbo=0, Disabled=919. Hints=0.
% 0.99/1.31 Megabytes=2.42.
% 0.99/1.31 User_CPU=0.31, System_CPU=0.01, Wall_clock=0.
% 0.99/1.31
% 0.99/1.31 ============================== end of statistics =====================
% 0.99/1.31
% 0.99/1.31 ============================== end of search =========================
% 0.99/1.31
% 0.99/1.31 THEOREM PROVED
% 0.99/1.31 % SZS status Unsatisfiable
% 0.99/1.31
% 0.99/1.31 Exiting with 1 proof.
% 0.99/1.31
% 0.99/1.31 Process 30010 exit (max_proofs) Wed Jun 15 13:08:42 2022
% 0.99/1.32 Prover9 interrupted
%------------------------------------------------------------------------------