TSTP Solution File: SET863-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET863-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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 : Tue Jul 19 04:33:01 EDT 2022
% Result : Unsatisfiable 0.98s 1.29s
% Output : Refutation 0.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET863-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 07:24:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/0.98 ============================== Prover9 ===============================
% 0.44/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.98 Process 11913 was started by sandbox on n014.cluster.edu,
% 0.44/0.98 Mon Jul 11 07:24:05 2022
% 0.44/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11755_n014.cluster.edu".
% 0.44/0.98 ============================== end of head ===========================
% 0.44/0.98
% 0.44/0.98 ============================== INPUT =================================
% 0.44/0.98
% 0.44/0.98 % Reading from file /tmp/Prover9_11755_n014.cluster.edu
% 0.44/0.98
% 0.44/0.98 set(prolog_style_variables).
% 0.44/0.98 set(auto2).
% 0.44/0.98 % set(auto2) -> set(auto).
% 0.44/0.98 % set(auto) -> set(auto_inference).
% 0.44/0.98 % set(auto) -> set(auto_setup).
% 0.44/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.98 % set(auto) -> set(auto_limits).
% 0.44/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.98 % set(auto) -> set(auto_denials).
% 0.44/0.98 % set(auto) -> set(auto_process).
% 0.44/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.98 % set(auto2) -> assign(stats, some).
% 0.44/0.98 % set(auto2) -> clear(echo_input).
% 0.44/0.98 % set(auto2) -> set(quiet).
% 0.44/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.98 % set(auto2) -> clear(print_given).
% 0.44/0.98 assign(lrs_ticks,-1).
% 0.44/0.98 assign(sos_limit,10000).
% 0.44/0.98 assign(order,kbo).
% 0.44/0.98 set(lex_order_vars).
% 0.44/0.98 clear(print_given).
% 0.44/0.98
% 0.44/0.98 % formulas(sos). % not echoed (14 formulas)
% 0.44/0.98
% 0.44/0.98 ============================== end of input ==========================
% 0.44/0.98
% 0.44/0.98 % From the command line: assign(max_seconds, 300).
% 0.44/0.98
% 0.44/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.98
% 0.44/0.98 % Formulas that are not ordinary clauses:
% 0.44/0.98
% 0.44/0.98 ============================== end of process non-clausal formulas ===
% 0.44/0.98
% 0.44/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.98
% 0.44/0.98 ============================== PREDICATE ELIMINATION =================
% 0.44/0.98 1 -c_in(A,B,C) | -c_lessequals(B,D,tc_set(C)) | c_in(A,D,C) # label(cls_Set_OsubsetD_0) # label(axiom). [assumption].
% 0.44/0.98 2 c_lessequals(v_y,v_x,tc_set(t_a)) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.44/0.98 3 c_in(c_Main_OsubsetI__1(A,B,C),A,C) | c_lessequals(A,B,tc_set(C)) # label(cls_Set_OsubsetI_0) # label(axiom). [assumption].
% 0.44/0.98 4 c_lessequals(A,v_y,tc_set(t_a)) | -c_in(A,v_c,tc_set(t_a)) # label(cls_conjecture_7) # label(negated_conjecture). [assumption].
% 0.44/0.98 5 -c_in(c_Main_OsubsetI__1(A,B,C),B,C) | c_lessequals(A,B,tc_set(C)) # label(cls_Set_OsubsetI_1) # label(axiom). [assumption].
% 0.44/0.98 Derived: -c_in(A,v_y,t_a) | c_in(A,v_x,t_a). [resolve(1,b,2,a)].
% 0.44/0.98 Derived: -c_in(A,B,C) | c_in(A,D,C) | c_in(c_Main_OsubsetI__1(B,D,C),B,C). [resolve(1,b,3,b)].
% 0.44/0.98 Derived: -c_in(A,B,t_a) | c_in(A,v_y,t_a) | -c_in(B,v_c,tc_set(t_a)). [resolve(1,b,4,a)].
% 0.44/0.98 Derived: -c_in(A,B,C) | c_in(A,D,C) | -c_in(c_Main_OsubsetI__1(B,D,C),D,C). [resolve(1,b,5,b)].
% 0.44/0.98 6 -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | -c_lessequals(c_Zorn_Ochain__extend__1(D,A,C),A,tc_set(C)) | c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))) # label(cls_Zorn_Ochain__extend_1) # label(axiom). [assumption].
% 0.44/0.98 Derived: -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(D,A,C),A,C),c_Zorn_Ochain__extend__1(D,A,C),C). [resolve(6,c,3,b)].
% 0.44/0.98 Derived: -c_in(v_y,A,tc_set(t_a)) | -c_in(B,c_Zorn_Ochain(A,t_a),tc_set(tc_set(t_a))) | c_in(c_union(c_insert(v_y,c_emptyset,tc_set(t_a)),B,tc_set(t_a)),c_Zorn_Ochain(A,t_a),tc_set(tc_set(t_a))) | -c_in(c_Zorn_Ochain__extend__1(B,v_y,t_a),v_c,tc_set(t_a)). [resolve(6,c,4,a)].
% 0.98/1.29 Derived: -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | -c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(D,A,C),A,C),A,C). [resolve(6,c,5,b)].
% 0.98/1.29 7 -c_in(A,B,C) | -c_in(D,c_Zorn_Omaxchain(E,C),tc_set(tc_set(C))) | -c_in(c_union(c_insert(B,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(E,C),tc_set(tc_set(C))) | -c_lessequals(c_Zorn_Omaxchain__super__lemma__1(D,F,C),F,tc_set(C)) | c_in(A,F,C) # label(cls_Zorn_Omaxchain__super__lemma_1) # label(axiom). [assumption].
% 0.98/1.29 Derived: -c_in(A,B,C) | -c_in(D,c_Zorn_Omaxchain(E,C),tc_set(tc_set(C))) | -c_in(c_union(c_insert(B,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(E,C),tc_set(tc_set(C))) | c_in(A,F,C) | c_in(c_Main_OsubsetI__1(c_Zorn_Omaxchain__super__lemma__1(D,F,C),F,C),c_Zorn_Omaxchain__super__lemma__1(D,F,C),C). [resolve(7,d,3,b)].
% 0.98/1.29 Derived: -c_in(A,B,t_a) | -c_in(C,c_Zorn_Omaxchain(D,t_a),tc_set(tc_set(t_a))) | -c_in(c_union(c_insert(B,c_emptyset,tc_set(t_a)),C,tc_set(t_a)),c_Zorn_Ochain(D,t_a),tc_set(tc_set(t_a))) | c_in(A,v_y,t_a) | -c_in(c_Zorn_Omaxchain__super__lemma__1(C,v_y,t_a),v_c,tc_set(t_a)). [resolve(7,d,4,a)].
% 0.98/1.29 Derived: -c_in(A,B,C) | -c_in(D,c_Zorn_Omaxchain(E,C),tc_set(tc_set(C))) | -c_in(c_union(c_insert(B,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(E,C),tc_set(tc_set(C))) | c_in(A,F,C) | -c_in(c_Main_OsubsetI__1(c_Zorn_Omaxchain__super__lemma__1(D,F,C),F,C),F,C). [resolve(7,d,5,b)].
% 0.98/1.29
% 0.98/1.29 ============================== end predicate elimination =============
% 0.98/1.29
% 0.98/1.29 Auto_denials: (non-Horn, no changes).
% 0.98/1.29
% 0.98/1.29 Term ordering decisions:
% 0.98/1.29
% 0.98/1.29 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (16).
% 0.98/1.29 Function symbol KB weights: t_a=1. c_emptyset=1. v_y=1. v_c=1. v_S=1. v_x=1. v_xa=1. c_Zorn_Ochain=1. c_Zorn_Omaxchain=1. c_insert=1. c_union=1. c_Main_OsubsetI__1=1. c_Zorn_Ochain__extend__1=1. c_Zorn_Omaxchain__super__lemma__1=1. tc_set=0.
% 0.98/1.29
% 0.98/1.29 ============================== end of process initial clauses ========
% 0.98/1.29
% 0.98/1.29 ============================== CLAUSES FOR SEARCH ====================
% 0.98/1.29
% 0.98/1.29 ============================== end of clauses for search =============
% 0.98/1.29
% 0.98/1.29 ============================== SEARCH ================================
% 0.98/1.29
% 0.98/1.29 % Starting search at 0.01 seconds.
% 0.98/1.29
% 0.98/1.29 ============================== PROOF =================================
% 0.98/1.29 % SZS status Unsatisfiable
% 0.98/1.29 % SZS output start Refutation
% 0.98/1.29
% 0.98/1.29 % Proof 1 at 0.31 (+ 0.01) seconds.
% 0.98/1.29 % Length of proof is 39.
% 0.98/1.29 % Level of proof is 12.
% 0.98/1.29 % Maximum clause weight is 42.000.
% 0.98/1.29 % Given clauses 194.
% 0.98/1.29
% 0.98/1.29 1 -c_in(A,B,C) | -c_lessequals(B,D,tc_set(C)) | c_in(A,D,C) # label(cls_Set_OsubsetD_0) # label(axiom). [assumption].
% 0.98/1.29 2 c_lessequals(v_y,v_x,tc_set(t_a)) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.98/1.29 3 c_in(c_Main_OsubsetI__1(A,B,C),A,C) | c_lessequals(A,B,tc_set(C)) # label(cls_Set_OsubsetI_0) # label(axiom). [assumption].
% 0.98/1.29 4 c_lessequals(A,v_y,tc_set(t_a)) | -c_in(A,v_c,tc_set(t_a)) # label(cls_conjecture_7) # label(negated_conjecture). [assumption].
% 0.98/1.29 5 -c_in(c_Main_OsubsetI__1(A,B,C),B,C) | c_lessequals(A,B,tc_set(C)) # label(cls_Set_OsubsetI_1) # label(axiom). [assumption].
% 0.98/1.29 6 -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | -c_lessequals(c_Zorn_Ochain__extend__1(D,A,C),A,tc_set(C)) | c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))) # label(cls_Zorn_Ochain__extend_1) # label(axiom). [assumption].
% 0.98/1.29 7 -c_in(A,B,C) | -c_in(D,c_Zorn_Omaxchain(E,C),tc_set(tc_set(C))) | -c_in(c_union(c_insert(B,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(E,C),tc_set(tc_set(C))) | -c_lessequals(c_Zorn_Omaxchain__super__lemma__1(D,F,C),F,tc_set(C)) | c_in(A,F,C) # label(cls_Zorn_Omaxchain__super__lemma_1) # label(axiom). [assumption].
% 0.98/1.29 8 c_in(v_xa,v_x,t_a) # label(cls_conjecture_5) # label(negated_conjecture). [assumption].
% 0.98/1.29 9 c_in(v_x,v_S,tc_set(t_a)) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.98/1.29 10 c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.98/1.29 11 c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.98/1.29 12 -c_in(v_xa,v_y,t_a) # label(cls_conjecture_6) # label(negated_conjecture). [assumption].
% 0.98/1.29 13 -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | c_in(c_Zorn_Ochain__extend__1(D,A,C),D,tc_set(C)) | c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))) # label(cls_Zorn_Ochain__extend_0) # label(axiom). [assumption].
% 0.98/1.29 14 -c_in(A,B,C) | -c_in(D,c_Zorn_Omaxchain(E,C),tc_set(tc_set(C))) | -c_in(c_union(c_insert(B,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(E,C),tc_set(tc_set(C))) | c_in(A,F,C) | c_in(c_Zorn_Omaxchain__super__lemma__1(D,F,C),D,tc_set(C)) # label(cls_Zorn_Omaxchain__super__lemma_0) # label(axiom). [assumption].
% 0.98/1.29 15 -c_in(A,v_y,t_a) | c_in(A,v_x,t_a). [resolve(1,b,2,a)].
% 0.98/1.29 17 -c_in(A,B,t_a) | c_in(A,v_y,t_a) | -c_in(B,v_c,tc_set(t_a)). [resolve(1,b,4,a)].
% 0.98/1.29 19 -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(D,A,C),A,C),c_Zorn_Ochain__extend__1(D,A,C),C). [resolve(6,c,3,b)].
% 0.98/1.29 21 -c_in(A,B,tc_set(C)) | -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))) | -c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(D,A,C),A,C),A,C). [resolve(6,c,5,b)].
% 0.98/1.29 23 -c_in(A,B,t_a) | -c_in(C,c_Zorn_Omaxchain(D,t_a),tc_set(tc_set(t_a))) | -c_in(c_union(c_insert(B,c_emptyset,tc_set(t_a)),C,tc_set(t_a)),c_Zorn_Ochain(D,t_a),tc_set(tc_set(t_a))) | c_in(A,v_y,t_a) | -c_in(c_Zorn_Omaxchain__super__lemma__1(C,v_y,t_a),v_c,tc_set(t_a)). [resolve(7,d,4,a)].
% 0.98/1.29 27 -c_in(A,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) | c_in(c_Zorn_Ochain__extend__1(A,v_x,t_a),A,tc_set(t_a)) | c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),A,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))). [resolve(13,a,9,a)].
% 0.98/1.29 32 -c_in(A,c_Zorn_Omaxchain(B,t_a),tc_set(tc_set(t_a))) | -c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),A,tc_set(t_a)),c_Zorn_Ochain(B,t_a),tc_set(tc_set(t_a))) | c_in(v_xa,C,t_a) | c_in(c_Zorn_Omaxchain__super__lemma__1(A,C,t_a),A,tc_set(t_a)). [resolve(14,a,8,a)].
% 0.98/1.29 45 -c_in(A,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) | c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),A,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) | c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(A,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(A,v_x,t_a),t_a). [resolve(19,a,9,a)].
% 0.98/1.29 51 -c_in(A,v_S,tc_set(t_a)) | c_in(c_union(c_insert(A,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) | -c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,A,t_a),A,t_a),A,t_a). [resolve(21,b,11,a)].
% 0.98/1.29 56 -c_in(A,c_Zorn_Omaxchain(B,t_a),tc_set(tc_set(t_a))) | -c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),A,tc_set(t_a)),c_Zorn_Ochain(B,t_a),tc_set(tc_set(t_a))) | -c_in(c_Zorn_Omaxchain__super__lemma__1(A,v_y,t_a),v_c,tc_set(t_a)). [resolve(23,a,8,a),unit_del(c,12)].
% 0.98/1.29 93 c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)) | c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))). [resolve(27,a,11,a)].
% 0.98/1.29 261 c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)) | -c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)). [resolve(93,b,56,b),unit_del(b,10)].
% 0.98/1.29 262 c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)) | c_in(v_xa,A,t_a) | c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,A,t_a),v_c,tc_set(t_a)). [resolve(93,b,32,b),unit_del(b,10)].
% 0.98/1.29 291 c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)). [resolve(262,c,261,b),merge(c),unit_del(b,12)].
% 0.98/1.29 301 -c_in(A,c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a) | c_in(A,v_y,t_a). [resolve(291,a,17,c)].
% 0.98/1.29 323 c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) | c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a). [resolve(45,a,11,a)].
% 0.98/1.29 1144 c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) | c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_y,t_a). [resolve(323,b,301,a)].
% 0.98/1.29 1155 c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_y,t_a) | -c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)). [resolve(1144,a,56,b),unit_del(b,10)].
% 0.98/1.29 1158 c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_y,t_a) | c_in(v_xa,A,t_a) | c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,A,t_a),v_c,tc_set(t_a)). [resolve(1144,a,32,b),unit_del(b,10)].
% 0.98/1.29 1185 c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_y,t_a). [resolve(1158,c,1155,b),merge(c),unit_del(b,12)].
% 0.98/1.29 1191 c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_x,t_a). [resolve(1185,a,15,a)].
% 0.98/1.29 1193 c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))). [resolve(1191,a,51,c),unit_del(a,9)].
% 0.98/1.29 1207 -c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)). [resolve(1193,a,56,b),unit_del(a,10)].
% 0.98/1.29 1210 c_in(v_xa,A,t_a) | c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,A,t_a),v_c,tc_set(t_a)). [resolve(1193,a,32,b),unit_del(a,10)].
% 0.98/1.29 1254 $F. [resolve(1207,a,1210,b),unit_del(a,12)].
% 0.98/1.29
% 0.98/1.29 % SZS output end Refutation
% 0.98/1.29 ============================== end of proof ==========================
% 0.98/1.29
% 0.98/1.29 ============================== STATISTICS ============================
% 0.98/1.29
% 0.98/1.29 Given=194. Generated=9404. Kept=1246. proofs=1.
% 0.98/1.29 Usable=185. Sos=965. Demods=0. Limbo=0, Disabled=120. Hints=0.
% 0.98/1.29 Megabytes=2.43.
% 0.98/1.29 User_CPU=0.31, System_CPU=0.01, Wall_clock=0.
% 0.98/1.29
% 0.98/1.29 ============================== end of statistics =====================
% 0.98/1.29
% 0.98/1.29 ============================== end of search =========================
% 0.98/1.29
% 0.98/1.29 THEOREM PROVED
% 0.98/1.29 % SZS status Unsatisfiable
% 0.98/1.29
% 0.98/1.29 Exiting with 1 proof.
% 0.98/1.29
% 0.98/1.29 Process 11913 exit (max_proofs) Mon Jul 11 07:24:05 2022
% 0.98/1.29 Prover9 interrupted
%------------------------------------------------------------------------------