TSTP Solution File: LCL442-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL442-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:48 EDT 2022
% Result : Unsatisfiable 1.73s 1.99s
% Output : Refutation 1.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL442-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n016.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 : Sun Jul 3 10:30:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.73/1.99 ============================== Prover9 ===============================
% 1.73/1.99 Prover9 (32) version 2009-11A, November 2009.
% 1.73/1.99 Process 1333 was started by sandbox on n016.cluster.edu,
% 1.73/1.99 Sun Jul 3 10:30:46 2022
% 1.73/1.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1179_n016.cluster.edu".
% 1.73/1.99 ============================== end of head ===========================
% 1.73/1.99
% 1.73/1.99 ============================== INPUT =================================
% 1.73/1.99
% 1.73/1.99 % Reading from file /tmp/Prover9_1179_n016.cluster.edu
% 1.73/1.99
% 1.73/1.99 set(prolog_style_variables).
% 1.73/1.99 set(auto2).
% 1.73/1.99 % set(auto2) -> set(auto).
% 1.73/1.99 % set(auto) -> set(auto_inference).
% 1.73/1.99 % set(auto) -> set(auto_setup).
% 1.73/1.99 % set(auto_setup) -> set(predicate_elim).
% 1.73/1.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.73/1.99 % set(auto) -> set(auto_limits).
% 1.73/1.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.73/1.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.73/1.99 % set(auto) -> set(auto_denials).
% 1.73/1.99 % set(auto) -> set(auto_process).
% 1.73/1.99 % set(auto2) -> assign(new_constants, 1).
% 1.73/1.99 % set(auto2) -> assign(fold_denial_max, 3).
% 1.73/1.99 % set(auto2) -> assign(max_weight, "200.000").
% 1.73/1.99 % set(auto2) -> assign(max_hours, 1).
% 1.73/1.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.73/1.99 % set(auto2) -> assign(max_seconds, 0).
% 1.73/1.99 % set(auto2) -> assign(max_minutes, 5).
% 1.73/1.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.73/1.99 % set(auto2) -> set(sort_initial_sos).
% 1.73/1.99 % set(auto2) -> assign(sos_limit, -1).
% 1.73/1.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.73/1.99 % set(auto2) -> assign(max_megs, 400).
% 1.73/1.99 % set(auto2) -> assign(stats, some).
% 1.73/1.99 % set(auto2) -> clear(echo_input).
% 1.73/1.99 % set(auto2) -> set(quiet).
% 1.73/1.99 % set(auto2) -> clear(print_initial_clauses).
% 1.73/1.99 % set(auto2) -> clear(print_given).
% 1.73/1.99 assign(lrs_ticks,-1).
% 1.73/1.99 assign(sos_limit,10000).
% 1.73/1.99 assign(order,kbo).
% 1.73/1.99 set(lex_order_vars).
% 1.73/1.99 clear(print_given).
% 1.73/1.99
% 1.73/1.99 % formulas(sos). % not echoed (12 formulas)
% 1.73/1.99
% 1.73/1.99 ============================== end of input ==========================
% 1.73/1.99
% 1.73/1.99 % From the command line: assign(max_seconds, 300).
% 1.73/1.99
% 1.73/1.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.73/1.99
% 1.73/1.99 % Formulas that are not ordinary clauses:
% 1.73/1.99
% 1.73/1.99 ============================== end of process non-clausal formulas ===
% 1.73/1.99
% 1.73/1.99 ============================== PROCESS INITIAL CLAUSES ===============
% 1.73/1.99
% 1.73/1.99 ============================== PREDICATE ELIMINATION =================
% 1.73/1.99
% 1.73/1.99 ============================== end predicate elimination =============
% 1.73/1.99
% 1.73/1.99 Auto_denials: (non-Horn, no changes).
% 1.73/1.99
% 1.73/1.99 Term ordering decisions:
% 1.73/1.99
% 1.73/1.99 % Assigning unary symbol tc_PropLog_Opl kb_weight 0 and highest precedence (12).
% 1.73/1.99 Function symbol KB weights: t_a=1. v_tt=1. v_pl1=1. v_pl2=1. c_PropLog_Opl_Ofalse=1. c_PropLog_Othms=1. c_PropLog_Opl_Oop_A_N_62=1. c_PropLog_Ohyps=1. c_union=1. tc_PropLog_Opl=0.
% 1.73/1.99
% 1.73/1.99 ============================== end of process initial clauses ========
% 1.73/1.99
% 1.73/1.99 ============================== CLAUSES FOR SEARCH ====================
% 1.73/1.99
% 1.73/1.99 ============================== end of clauses for search =============
% 1.73/1.99
% 1.73/1.99 ============================== SEARCH ================================
% 1.73/1.99
% 1.73/1.99 % Starting search at 0.01 seconds.
% 1.73/1.99
% 1.73/1.99 ============================== PROOF =================================
% 1.73/1.99 % SZS status Unsatisfiable
% 1.73/1.99 % SZS output start Refutation
% 1.73/1.99
% 1.73/1.99 % Proof 1 at 1.00 (+ 0.01) seconds.
% 1.73/1.99 % Length of proof is 43.
% 1.73/1.99 % Level of proof is 22.
% 1.73/1.99 % Maximum clause weight is 40.000.
% 1.73/1.99 % Given clauses 711.
% 1.73/1.99
% 1.73/1.99 1 c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl1,t_a) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 1.73/1.99 2 c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl2,t_a) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 1.73/1.99 3 -c_PropLog_Oeval(v_tt,v_pl2,t_a) | -c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) # label(cls_conjecture_5) # label(negated_conjecture). [assumption].
% 1.73/1.99 4 c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | -c_PropLog_Oeval(v_tt,v_pl1,t_a) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 1.73/1.99 5 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | -c_PropLog_Oeval(v_tt,v_pl2,t_a) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 1.73/1.99 6 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | c_in(c_PropLog_Opl_Oop_A_N_62(D,A,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) # label(cls_PropLog_Oweaken__right_0) # label(axiom). [assumption].
% 1.73/1.99 7 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | c_in(A,c_PropLog_Othms(c_union(B,D,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)) # label(cls_PropLog_Oweaken__left__Un1_0) # label(axiom). [assumption].
% 1.73/1.99 8 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | c_in(A,c_PropLog_Othms(c_union(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)) # label(cls_PropLog_Oweaken__left__Un2_0) # label(axiom). [assumption].
% 1.73/1.99 9 -c_in(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Ofalse,B),c_PropLog_Othms(C,B),tc_PropLog_Opl(B)) | c_in(c_PropLog_Opl_Oop_A_N_62(A,D,B),c_PropLog_Othms(C,B),tc_PropLog_Opl(B)) # label(cls_PropLog_Ofalse__imp_0) # label(axiom). [assumption].
% 1.73/1.99 10 c_PropLog_Oeval(v_tt,v_pl1,t_a) | -c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 1.73/1.99 11 -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | -c_in(c_PropLog_Opl_Oop_A_N_62(D,c_PropLog_Opl_Ofalse,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) | c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,D,C),c_PropLog_Opl_Ofalse,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) # label(cls_PropLog_Oimp__false_0) # label(axiom). [assumption].
% 1.73/1.99 12 -c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl2,t_a) | -c_PropLog_Oeval(v_tt,v_pl1,t_a) # label(cls_conjecture_9) # label(negated_conjecture). [assumption].
% 1.73/1.99 14 -c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(3,a,2,b)].
% 1.73/1.99 15 c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(4,b,1,b)].
% 1.73/1.99 16 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(5,b,2,b)].
% 1.73/1.99 17 -c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl2,t_a) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(12,c,1,b)].
% 1.73/1.99 21 c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,A,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(15,b,9,a)].
% 1.73/1.99 28 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,A,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(16,b,9,a)].
% 1.73/1.99 34 c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,A,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),B,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [resolve(21,b,7,a)].
% 1.73/1.99 37 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,A,t_a),c_PropLog_Othms(c_union(B,c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [resolve(28,b,8,a)].
% 1.73/1.99 57 c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl1,t_a). [resolve(34,b,10,b)].
% 1.73/1.99 66 c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(57,b,4,b),merge(b)].
% 1.73/1.99 69 c_in(v_pl1,c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),A,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [resolve(66,a,7,a)].
% 1.73/1.99 85 -c_in(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),B,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,A,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),B,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [resolve(69,a,11,a)].
% 1.73/1.99 323 c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) | c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(85,a,37,b)].
% 1.73/1.99 864 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl2,t_a) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(323,a,17,a)].
% 1.73/1.99 868 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),A,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [resolve(323,a,9,a)].
% 1.73/1.99 870 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(864,b,5,b),merge(c)].
% 1.73/1.99 881 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,A,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(870,b,9,a)].
% 1.73/1.99 887 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,A,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),B,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [resolve(881,b,7,a)].
% 1.73/1.99 933 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl1,t_a). [resolve(887,b,10,b)].
% 1.73/1.99 936 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | -c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl2,t_a). [resolve(933,b,12,c)].
% 1.73/1.99 5086 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) | c_PropLog_Oeval(v_tt,v_pl2,t_a). [resolve(936,b,868,b),merge(c)].
% 1.73/1.99 5087 c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(5086,b,5,b),merge(b)].
% 1.73/1.99 5091 c_in(c_PropLog_Opl_Oop_A_N_62(A,v_pl2,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(5087,a,6,a)].
% 1.73/1.99 5093 c_in(c_PropLog_Opl_Oop_A_N_62(A,v_pl2,t_a),c_PropLog_Othms(c_union(B,c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [resolve(5091,a,8,a)].
% 1.73/1.99 5096 c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [back_unit_del(14),unit_del(a,5093)].
% 1.73/1.99 5097 c_PropLog_Oeval(v_tt,v_pl1,t_a). [back_unit_del(10),unit_del(b,5093)].
% 1.73/1.99 5098 -c_PropLog_Oeval(v_tt,v_pl2,t_a). [back_unit_del(3),unit_del(b,5093)].
% 1.73/1.99 5099 -c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [back_unit_del(12),unit_del(b,5098),unit_del(c,5097)].
% 1.73/1.99 5103 c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,A,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)). [resolve(5096,a,9,a)].
% 1.73/1.99 5108 c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,A,t_a),c_PropLog_Othms(c_union(B,c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)). [resolve(5103,a,8,a)].
% 1.73/1.99 5111 $F. [ur(85,b,5099,a),unit_del(a,5108)].
% 1.73/1.99
% 1.73/1.99 % SZS output end Refutation
% 1.73/1.99 ============================== end of proof ==========================
% 1.73/1.99
% 1.73/1.99 ============================== STATISTICS ============================
% 1.73/1.99
% 1.73/1.99 Given=711. Generated=7834. Kept=5110. proofs=1.
% 1.73/1.99 Usable=422. Sos=564. Demods=0. Limbo=0, Disabled=4136. Hints=0.
% 1.73/1.99 Megabytes=9.92.
% 1.73/1.99 User_CPU=1.00, System_CPU=0.01, Wall_clock=1.
% 1.73/1.99
% 1.73/1.99 ============================== end of statistics =====================
% 1.73/1.99
% 1.73/1.99 ============================== end of search =========================
% 1.73/1.99
% 1.73/1.99 THEOREM PROVED
% 1.73/1.99 % SZS status Unsatisfiable
% 1.73/1.99
% 1.73/1.99 Exiting with 1 proof.
% 1.73/1.99
% 1.73/1.99 Process 1333 exit (max_proofs) Sun Jul 3 10:30:47 2022
% 1.73/1.99 Prover9 interrupted
%------------------------------------------------------------------------------