TSTP Solution File: LCL430-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL430-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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 : Sun Jul 17 13:46:37 EDT 2022
% Result : Unsatisfiable 0.45s 1.03s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL430-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 11:14:06 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.03 ============================== Prover9 ===============================
% 0.45/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03 Process 20261 was started by sandbox on n011.cluster.edu,
% 0.45/1.03 Mon Jul 4 11:14:07 2022
% 0.45/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20108_n011.cluster.edu".
% 0.45/1.03 ============================== end of head ===========================
% 0.45/1.03
% 0.45/1.03 ============================== INPUT =================================
% 0.45/1.03
% 0.45/1.03 % Reading from file /tmp/Prover9_20108_n011.cluster.edu
% 0.45/1.03
% 0.45/1.03 set(prolog_style_variables).
% 0.45/1.03 set(auto2).
% 0.45/1.03 % set(auto2) -> set(auto).
% 0.45/1.03 % set(auto) -> set(auto_inference).
% 0.45/1.03 % set(auto) -> set(auto_setup).
% 0.45/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03 % set(auto) -> set(auto_limits).
% 0.45/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03 % set(auto) -> set(auto_denials).
% 0.45/1.03 % set(auto) -> set(auto_process).
% 0.45/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03 % set(auto2) -> assign(stats, some).
% 0.45/1.03 % set(auto2) -> clear(echo_input).
% 0.45/1.03 % set(auto2) -> set(quiet).
% 0.45/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03 % set(auto2) -> clear(print_given).
% 0.45/1.03 assign(lrs_ticks,-1).
% 0.45/1.03 assign(sos_limit,10000).
% 0.45/1.03 assign(order,kbo).
% 0.45/1.03 set(lex_order_vars).
% 0.45/1.03 clear(print_given).
% 0.45/1.03
% 0.45/1.03 % formulas(sos). % not echoed (8 formulas)
% 0.45/1.03
% 0.45/1.03 ============================== end of input ==========================
% 0.45/1.03
% 0.45/1.03 % From the command line: assign(max_seconds, 300).
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03
% 0.45/1.03 % Formulas that are not ordinary clauses:
% 0.45/1.03
% 0.45/1.03 ============================== end of process non-clausal formulas ===
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03
% 0.45/1.03 ============================== PREDICATE ELIMINATION =================
% 0.45/1.03 1 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | -c_lessequals(B,D,tc_set(tc_PropLog_Opl(C))) | c_in(A,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)) # label(cls_PropLog_Oweaken__left_0) # label(axiom). [assumption].
% 0.45/1.03 2 c_lessequals(c_minus(A,B,tc_set(C)),c_insert(D,c_minus(A,c_insert(D,B,C),tc_set(C)),C),tc_set(C)) # label(cls_PropLog_Oinsert__Diff__same_0) # label(axiom). [assumption].
% 0.45/1.03 3 c_lessequals(c_minus(c_insert(A,c_minus(B,c_insert(C,c_emptyset,D),tc_set(D)),D),E,tc_set(D)),c_insert(A,c_minus(B,c_insert(C,E,D),tc_set(D)),D),tc_set(D)) # label(cls_PropLog_Oinsert__Diff__subset2_0) # label(axiom). [assumption].
% 0.45/1.03 4 c_lessequals(c_PropLog_Ohyps(A,c_insert(B,C,D),D),c_insert(c_PropLog_Opl_Ovar(B,D),c_minus(c_PropLog_Ohyps(A,C,D),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(B,D),c_PropLog_Opl_Ofalse,D),c_emptyset,tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))),tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))) # label(cls_PropLog_Ohyps__insert_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: -c_in(A,c_PropLog_Othms(c_minus(B,C,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)) | c_in(A,c_PropLog_Othms(c_insert(E,c_minus(B,c_insert(E,C,tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))),tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)). [resolve(1,b,2,a)].
% 0.45/1.03 Derived: -c_in(A,c_PropLog_Othms(c_minus(c_insert(B,c_minus(C,c_insert(D,c_emptyset,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),F,tc_set(tc_PropLog_Opl(E))),E),tc_PropLog_Opl(E)) | c_in(A,c_PropLog_Othms(c_insert(B,c_minus(C,c_insert(D,F,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),E),tc_PropLog_Opl(E)). [resolve(1,b,3,a)].
% 0.45/1.03 Derived: -c_in(A,c_PropLog_Othms(c_PropLog_Ohyps(B,c_insert(C,D,E),E),E),tc_PropLog_Opl(E)) | c_in(A,c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(C,E),c_minus(c_PropLog_Ohyps(B,D,E),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(C,E),c_PropLog_Opl_Ofalse,E),c_emptyset,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),E),tc_PropLog_Opl(E)). [resolve(1,b,4,a)].
% 0.45/1.03 5 -c_in(A,c_PropLog_Othms(c_minus(B,C,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)) | -c_lessequals(B,E,tc_set(tc_PropLog_Opl(D))) | c_in(A,c_PropLog_Othms(c_minus(E,C,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)) # label(cls_PropLog_ODiff__weaken__left_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: -c_in(A,c_PropLog_Othms(c_minus(c_minus(B,C,tc_set(tc_PropLog_Opl(D))),E,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)) | c_in(A,c_PropLog_Othms(c_minus(c_insert(F,c_minus(B,c_insert(F,C,tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))),tc_PropLog_Opl(D)),E,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)). [resolve(5,b,2,a)].
% 0.45/1.03 Derived: -c_in(A,c_PropLog_Othms(c_minus(c_minus(c_insert(B,c_minus(C,c_insert(D,c_emptyset,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),F,tc_set(tc_PropLog_Opl(E))),V6,tc_set(tc_PropLog_Opl(E))),E),tc_PropLog_Opl(E)) | c_in(A,c_PropLog_Othms(c_minus(c_insert(B,c_minus(C,c_insert(D,F,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),V6,tc_set(tc_PropLog_Opl(E))),E),tc_PropLog_Opl(E)). [resolve(5,b,3,a)].
% 0.45/1.03 Derived: -c_in(A,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(B,c_insert(C,D,E),E),F,tc_set(tc_PropLog_Opl(E))),E),tc_PropLog_Opl(E)) | c_in(A,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Ovar(C,E),c_minus(c_PropLog_Ohyps(B,D,E),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(C,E),c_PropLog_Opl_Ofalse,E),c_emptyset,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),F,tc_set(tc_PropLog_Opl(E))),E),tc_PropLog_Opl(E)). [resolve(5,b,4,a)].
% 0.45/1.03
% 0.45/1.03 ============================== end predicate elimination =============
% 0.45/1.03
% 0.45/1.03 Auto_denials:
% 0.45/1.03 % copying label cls_conjecture_5 to answer in negative clause
% 0.45/1.03
% 0.45/1.03 Term ordering decisions:
% 0.45/1.03 Function symbol KB weights: c_emptyset=1. t_a=1. c_PropLog_Opl_Ofalse=1. v_p=1. v_F=1. v_t=1. v_v=1. c_PropLog_Othms=1. c_PropLog_Opl_Ovar=1. tc_PropLog_Opl=1. tc_set=1. c_insert=1. c_minus=1. c_PropLog_Ohyps=1. c_PropLog_Opl_Oop_A_N_62=1.
% 0.45/1.03
% 0.45/1.03 ============================== end of process initial clauses ========
% 0.45/1.03
% 0.45/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.03
% 0.45/1.03 ============================== end of clauses for search =============
% 0.45/1.03
% 0.45/1.03 ============================== SEARCH ================================
% 0.45/1.03
% 0.45/1.03 % Starting search at 0.01 seconds.
% 0.45/1.03
% 0.45/1.03 ============================== PROOF =================================
% 0.45/1.03 % SZS status Unsatisfiable
% 0.45/1.03 % SZS output start Refutation
% 0.45/1.03
% 0.45/1.03 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_5.
% 0.45/1.03 % Length of proof is 17.
% 0.45/1.03 % Level of proof is 5.
% 0.45/1.03 % Maximum clause weight is 59.000.
% 0.45/1.03 % Given clauses 12.
% 0.45/1.03
% 0.45/1.03 1 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | -c_lessequals(B,D,tc_set(tc_PropLog_Opl(C))) | c_in(A,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)) # label(cls_PropLog_Oweaken__left_0) # label(axiom). [assumption].
% 0.45/1.03 2 c_lessequals(c_minus(A,B,tc_set(C)),c_insert(D,c_minus(A,c_insert(D,B,C),tc_set(C)),C),tc_set(C)) # label(cls_PropLog_Oinsert__Diff__same_0) # label(axiom). [assumption].
% 0.45/1.03 3 c_lessequals(c_minus(c_insert(A,c_minus(B,c_insert(C,c_emptyset,D),tc_set(D)),D),E,tc_set(D)),c_insert(A,c_minus(B,c_insert(C,E,D),tc_set(D)),D),tc_set(D)) # label(cls_PropLog_Oinsert__Diff__subset2_0) # label(axiom). [assumption].
% 0.45/1.03 4 c_lessequals(c_PropLog_Ohyps(A,c_insert(B,C,D),D),c_insert(c_PropLog_Opl_Ovar(B,D),c_minus(c_PropLog_Ohyps(A,C,D),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(B,D),c_PropLog_Opl_Ofalse,D),c_emptyset,tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))),tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))) # label(cls_PropLog_Ohyps__insert_0) # label(axiom). [assumption].
% 0.45/1.03 5 -c_in(A,c_PropLog_Othms(c_minus(B,C,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)) | -c_lessequals(B,E,tc_set(tc_PropLog_Opl(D))) | c_in(A,c_PropLog_Othms(c_minus(E,C,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)) # label(cls_PropLog_ODiff__weaken__left_0) # label(axiom). [assumption].
% 0.45/1.03 6 c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,A,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.45/1.03 7 -c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) # label(cls_conjecture_5) # label(negated_conjecture) # answer(cls_conjecture_5). [assumption].
% 0.45/1.03 8 -c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)) | -c_in(A,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(B,c_PropLog_Opl_Ofalse,D),C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)) | c_in(A,c_PropLog_Othms(C,D),tc_PropLog_Opl(D)) # label(cls_PropLog_Othms__excluded__middle__rule_0) # label(axiom). [assumption].
% 0.45/1.03 9 -c_in(A,c_PropLog_Othms(c_minus(B,C,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)) | c_in(A,c_PropLog_Othms(c_insert(E,c_minus(B,c_insert(E,C,tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))),tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)). [resolve(1,b,2,a)].
% 0.45/1.03 10 -c_in(A,c_PropLog_Othms(c_minus(c_insert(B,c_minus(C,c_insert(D,c_emptyset,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),F,tc_set(tc_PropLog_Opl(E))),E),tc_PropLog_Opl(E)) | c_in(A,c_PropLog_Othms(c_insert(B,c_minus(C,c_insert(D,F,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),E),tc_PropLog_Opl(E)). [resolve(1,b,3,a)].
% 0.45/1.03 14 -c_in(A,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(B,c_insert(C,D,E),E),F,tc_set(tc_PropLog_Opl(E))),E),tc_PropLog_Opl(E)) | c_in(A,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Ovar(C,E),c_minus(c_PropLog_Ohyps(B,D,E),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(C,E),c_PropLog_Opl_Ofalse,E),c_emptyset,tc_PropLog_Opl(E)),tc_set(tc_PropLog_Opl(E))),tc_PropLog_Opl(E)),F,tc_set(tc_PropLog_Opl(E))),E),tc_PropLog_Opl(E)). [resolve(5,b,4,a)].
% 0.45/1.03 15 -c_in(v_p,c_PropLog_Othms(c_insert(A,c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) | -c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) # answer(cls_conjecture_5). [resolve(8,c,7,a)].
% 0.45/1.03 17 c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Ovar(A,t_a),c_minus(c_PropLog_Ohyps(v_p,B,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(A,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)). [ur(14,a,6,a)].
% 0.45/1.03 22 -c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_v,t_a),c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) | -c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) # answer(cls_conjecture_5). [resolve(15,b,9,b)].
% 0.45/1.03 27 -c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_v,t_a),c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) # answer(cls_conjecture_5). [resolve(22,b,6,a)].
% 0.45/1.03 28 -c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Ovar(v_v,t_a),c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) # answer(cls_conjecture_5). [resolve(27,a,10,b)].
% 0.45/1.03 29 $F # answer(cls_conjecture_5). [resolve(28,a,17,a)].
% 0.45/1.03
% 0.45/1.03 % SZS output end Refutation
% 0.45/1.03 ============================== end of proof ==========================
% 0.45/1.03
% 0.45/1.03 ============================== STATISTICS ============================
% 0.45/1.03
% 0.45/1.03 Given=12. Generated=24. Kept=23. proofs=1.
% 0.45/1.03 Usable=11. Sos=9. Demods=0. Limbo=0, Disabled=16. Hints=0.
% 0.45/1.03 Megabytes=0.15.
% 0.45/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.03
% 0.45/1.03 ============================== end of statistics =====================
% 0.45/1.03
% 0.45/1.03 ============================== end of search =========================
% 0.45/1.03
% 0.45/1.03 THEOREM PROVED
% 0.45/1.03 % SZS status Unsatisfiable
% 0.45/1.03
% 0.45/1.03 Exiting with 1 proof.
% 0.45/1.03
% 0.45/1.03 Process 20261 exit (max_proofs) Mon Jul 4 11:14:07 2022
% 0.45/1.03 Prover9 interrupted
%------------------------------------------------------------------------------