TSTP Solution File: SEU361+2 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU361+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art03.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 04:02:25 EST 2010

% Result   : Theorem 243.55s
% Output   : Solution 244.13s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP17933/SEU361+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~t44_yellow_0:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... dt_k3_yellow_0:
%  CSA axiom dt_k3_yellow_0 found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_m1_subset_1:
%  CSA axiom existence_m1_subset_1 found
% Looking for CSA axiom ... t25_orders_2:
%  CSA axiom t25_orders_2 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... existence_l1_orders_2:
% d4_yellow_0:
%  CSA axiom d4_yellow_0 found
% Looking for CSA axiom ... t26_orders_2: CSA axiom t26_orders_2 found
% Looking for CSA axiom ... dt_k1_yellow_0:
%  CSA axiom dt_k1_yellow_0 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% dt_k2_yellow_0:
%  CSA axiom dt_k2_yellow_0 found
% Looking for CSA axiom ... t15_yellow_0:
%  CSA axiom t15_yellow_0 found
% Looking for CSA axiom ... t16_yellow_0:
%  CSA axiom t16_yellow_0 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% redefinition_r3_orders_2: CSA axiom redefinition_r3_orders_2 found
% Looking for CSA axiom ... d8_lattice3:
%  CSA axiom d8_lattice3 found
% Looking for CSA axiom ... d9_lattice3:
%  CSA axiom d9_lattice3 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% reflexivity_r3_orders_2:
%  CSA axiom reflexivity_r3_orders_2 found
% Looking for CSA axiom ... t42_yellow_0:
%  CSA axiom t42_yellow_0 found
% Looking for CSA axiom ... d6_orders_2:
%  CSA axiom d6_orders_2 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% d7_yellow_0:
%  CSA axiom d7_yellow_0 found
% Looking for CSA axiom ... d8_yellow_0:
%  CSA axiom d8_yellow_0 found
% Looking for CSA axiom ... d9_orders_2:
%  CSA axiom d9_orders_2 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% dt_k15_lattice3:
%  CSA axiom dt_k15_lattice3 found
% Looking for CSA axiom ... dt_k16_lattice3:
%  CSA axiom dt_k16_lattice3 found
% Looking for CSA axiom ... dt_k1_lattices:
%  CSA axiom dt_k1_lattices found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% dt_k2_lattices:
%  CSA axiom dt_k2_lattices found
% Looking for CSA axiom ... dt_k5_lattices:
%  CSA axiom dt_k5_lattices found
% Looking for CSA axiom ... t30_yellow_0:
%  CSA axiom t30_yellow_0 found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% antisymmetry_r2_hidden:
%  CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... dt_l1_orders_2:
%  CSA axiom dt_l1_orders_2 found
% Looking for CSA axiom ... existence_l1_lattices:
%  CSA axiom existence_l1_lattices found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_l1_pre_topc:
%  CSA axiom existence_l1_pre_topc found
% Looking for CSA axiom ... existence_l1_struct_0:
% existence_l2_lattices:
%  CSA axiom existence_l2_lattices found
% Looking for CSA axiom ... existence_l3_lattices:
%  CSA axiom existence_l3_lattices found
% ---- Iteration 11 (30 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_l1_struct_0:
% existence_m2_relset_1:
%  CSA axiom existence_m2_relset_1 found
% Looking for CSA axiom ... rc1_subset_1:
%  CSA axiom rc1_subset_1 found
% Looking for CSA axiom ... rc1_xboole_0:
%  CSA axiom rc1_xboole_0 found
% ---- Iteration 12 (33 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_l1_struct_0:
% rc2_subset_1:
%  CSA axiom rc2_subset_1 found
% Looking for CSA axiom ... rc2_xboole_0:
%  CSA axiom rc2_xboole_0 found
% Looking for CSA axiom ... t3_ordinal1:
%  CSA axiom t3_ordinal1 found
% ---- Iteration 13 (36 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_l1_struct_0:
% t7_tarski:
%  CSA axiom t7_tarski found
% Looking for CSA axiom ... d10_yellow_0:
%  CSA axiom d10_yellow_0 found
% Looking for CSA axiom ... d9_yellow_0:
%  CSA axiom d9_yellow_0 found
% ---- Iteration 14 (39 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_l1_struct_0:
% rc1_orders_2:
%  CSA axiom rc1_orders_2 found
% Looking for CSA axiom ... rc2_orders_2:
%  CSA axiom rc2_orders_2 found
% Looking for CSA axiom ... t1_subset:
%  CSA axiom t1_subset found
% ---- Iteration 15 (42 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_l1_struct_0:
% d1_struct_0:
%  CSA axiom d1_struct_0 found
% Looking for CSA axiom ... fc1_struct_0:
%  CSA axiom fc1_struct_0 found
% Looking for CSA axiom ... rc3_struct_0:
% dt_u1_orders_2:
%  CSA axiom dt_u1_orders_2 found
% ---- Iteration 16 (45 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_l1_struct_0:
% rc3_struct_0:
% rc5_struct_0:
% t6_yellow_0:
%  CSA axiom t6_yellow_0 found
% Looking for CSA axiom ... existence_m1_connsp_2:
%  CSA axiom existence_m1_connsp_2 found
% Looking for CSA axiom ... d11_yellow_0:
%  CSA axiom d11_yellow_0 found
% ---- Iteration 17 (48 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :d11_yellow_0:existence_m1_connsp_2:t6_yellow_0:dt_u1_orders_2:fc1_struct_0:d1_struct_0:t1_subset:rc2_orders_2:rc1_orders_2:d9_yellow_0:d10_yellow_0:t7_tarski:t3_ordinal1:rc2_xboole_0:rc2_subset_1:rc1_xboole_0:rc1_subset_1:existence_m2_relset_1:existence_l3_lattices:existence_l2_lattices:existence_l1_pre_topc:existence_l1_lattices:dt_l1_orders_2:antisymmetry_r2_hidden:t30_yellow_0:dt_k5_lattices:dt_k2_lattices:dt_k1_lattices:dt_k16_lattice3:dt_k15_lattice3:d9_orders_2:d8_yellow_0:d7_yellow_0:d6_orders_2:t42_yellow_0:reflexivity_r3_orders_2:d9_lattice3:d8_lattice3:redefinition_r3_orders_2:t16_yellow_0:t15_yellow_0:dt_k2_yellow_0:dt_k1_yellow_0:t26_orders_2:d4_yellow_0:t25_orders_2:existence_m1_subset_1:dt_k3_yellow_0 (48)
% Unselected axioms are ... :existence_l1_orders_2:existence_l1_struct_0:rc3_struct_0:rc5_struct_0:dt_k3_lattices:dt_k4_lattices:l40_tops_1:commutativity_k3_lattices:commutativity_k4_lattices:d13_lattices:d3_lattice3:d3_lattices:t26_lattices:t91_tmap_1:d11_grcat_1:d16_lattice3:d17_lattice3:dt_m1_connsp_2:dt_k10_filter_1:dt_k4_lattice3:dt_k5_lattice3:fraenkel_a_2_2_lattice3:rc3_finset_1:rc4_finset_1:t5_tops_2:d4_lattice3:dt_k1_pre_topc:dt_k1_tops_1:dt_k2_pre_topc:dt_k6_pre_topc:dt_u1_pre_topc:redefinition_k10_filter_1:d1_xboole_0:d8_lattices:rc7_pre_topc:t2_lattice3:t50_subset_1:cc1_finsub_1:cc2_finsub_1:d8_setfam_1:dt_k3_lattice3:existence_m1_relset_1:rc1_tops_1:rc6_pre_topc:reflexivity_r1_tarski:reflexivity_r3_lattices:symmetry_r1_xboole_0:t1_xboole_1:t23_lattices:d8_filter_1:l3_subset_1:l55_zfmisc_1:l71_subset_1:rc6_lattices:redefinition_k2_lattice3:t106_zfmisc_1:t3_xboole_1:t4_subset:t6_boole:cc16_membered:d16_lattices:d1_lattices:d2_lattices:d2_subset_1:dt_k3_subset_1:fc1_lattice3:fc4_lattice3:l1_zfmisc_1:redefinition_k3_lattices:redefinition_k4_lattices:s1_funct_1__e4_7_2__tops_2__1:t13_tops_2:t1_boole:t2_boole:t2_subset:t3_boole:t4_boole:cc2_finset_1:d1_connsp_2:d5_subset_1:dt_k1_pcomps_1:dt_k2_subset_1:dt_k4_subset_1:dt_k5_setfam_1:dt_k5_subset_1:dt_k6_setfam_1:dt_k6_subset_1:dt_k7_setfam_1:rc2_tex_2:t32_filter_1:t33_zfmisc_1:t5_connsp_2:t99_zfmisc_1:d2_lattice3:d5_orders_2:redefinition_k1_pcomps_1:redefinition_r3_lattices:s1_tarski__e4_7_1__tops_2__2:s1_tarski__e4_7_2__tops_2__1:s1_xboole_0__e4_7_1__tops_2__1:t28_lattice3:t29_lattice3:t30_lattice3:t31_lattice3:t43_subset_1:t7_lattice3:t8_boole:cc1_relat_1:fraenkel_a_1_0_filter_1:fraenkel_a_2_3_lattice3:rc1_relat_1:rc2_relat_1:rc2_tops_1:t15_pre_topc:t22_pre_topc:d1_relat_1:d2_relat_1:fc2_tops_1:fc6_tops_1:s1_funct_1__e4_7_1__tops_2__1:s2_funct_1__e4_7_2__tops_2:t29_tops_1:t2_tarski:t30_tops_1:t51_tops_1:t7_boole:abstractness_v1_orders_2:cc10_membered:d1_funct_1:d22_lattice3:d2_zfmisc_1:d3_pre_topc:fc1_subset_1:fc2_orders_2:t12_pre_topc:t16_relset_1:t2_xboole_1:antisymmetry_r2_xboole_0:cc1_funct_1:d1_zfmisc_1:d3_relat_1:dt_g1_orders_2:dt_k4_relat_1:dt_k5_relat_1:dt_k6_relat_1:dt_k7_grcat_1:dt_l1_lattices:dt_l1_pre_topc:dt_l2_lattices:fc1_xboole_0:fc1_zfmisc_1:fc2_pre_topc:fc5_pre_topc:irreflexivity_r2_xboole_0:l2_wellord1:rc3_partfun1:redefinition_m2_relset_1:s1_tarski__e4_7_1__tops_2__1:s1_xboole_0__e2_37_1_1__pre_topc__1:s2_funct_1__e4_7_1__tops_2:s3_subset_1__e2_37_1_1__pre_topc:t30_relat_1:t44_pre_topc:t52_pre_topc:t55_tops_1:cc1_finset_1:cc1_relset_1:commutativity_k4_subset_1:commutativity_k5_subset_1:d1_pre_topc:d1_relat_2:d1_setfam_1:d1_tops_1:d21_lattice3:d8_pre_topc:d8_relat_2:dt_k8_filter_1:fc1_ordinal1:fc2_subset_1:fc2_xboole_0:fc3_subset_1:fc3_tops_1:fc3_xboole_0:fc4_relat_1:fc4_subset_1:fc4_tops_1:idempotence_k4_subset_1:idempotence_k5_subset_1:involutiveness_k3_subset_1:involutiveness_k7_setfam_1:rc1_finset_1:rc3_lattices:t17_pre_topc:t19_wellord1:t34_lattice3:t5_subset:t5_tex_2:t71_relat_1:d3_tarski:d6_pre_topc:dt_k1_domain_1:l32_xboole_1:l4_zfmisc_1:s1_tarski__e1_40__pre_topc__1:s1_tarski__e2_37_1_1__pre_topc__1:s1_xboole_0__e1_40__pre_topc__1:s2_ordinal1__e18_27__finset_1__1:s3_subset_1__e1_40__pre_topc:t136_zfmisc_1:t140_relat_1:t1_zfmisc_1:t37_xboole_1:t39_zfmisc_1:t44_tops_1:t48_pre_topc:t54_subset_1:t60_relat_1:cc17_membered:cc1_lattices:cc2_lattices:d2_pre_topc:d5_tarski:d7_xboole_0:dt_k1_lattice3:dt_k4_relset_1:dt_k5_relset_1:dt_m2_relset_1:fc1_finset_1:fc29_membered:fc30_membered:fc38_membered:s1_tarski__e4_7_2__tops_2__2:s1_xboole_0__e4_7_2__tops_2__1:s1_xboole_0__e6_22__wellord2:t10_ordinal1:t11_tops_2:t12_tops_2:t14_relset_1:t1_lattice3:t23_ordinal1:t45_pre_topc:t46_pre_topc:t7_mcart_1:d10_relat_1:d10_xboole_0:d11_relat_1:d12_relat_1:d13_relat_1:d14_relat_1:d1_wellord1:d2_ordinal1:d4_relat_1:d4_relat_2:d5_relat_1:d6_relat_2:d7_relat_1:d8_relat_1:fc10_relat_1:fc11_relat_1:fc13_relat_1:fc5_relat_1:fc6_relat_1:fc7_relat_1:fc8_relat_1:fc9_relat_1:free_g1_orders_2:l23_zfmisc_1:l2_zfmisc_1:l3_wellord1:l50_zfmisc_1:redefinition_k6_partfun1:s1_funct_1__e10_24__wellord2__1:s1_funct_1__e16_22__wellord2__1:s1_ordinal1__e8_6__wellord2:s1_tarski__e10_24__wellord2__1:s1_tarski__e10_24__wellord2__2:s1_tarski__e16_22__wellord2__2:s1_tarski__e8_6__wellord2__1:s1_xboole_0__e10_24__wellord2__1:s1_xboole_0__e16_22__wellord2__1:s1_xboole_0__e8_6__wellord2__1:t117_relat_1:t178_relat_1:t24_wellord1:t25_wellord1:t31_ordinal1:t35_funct_1:t37_zfmisc_1:t38_zfmisc_1:t39_xboole_1:t3_subset:t3_xboole_0:t40_xboole_1:t46_zfmisc_1:t48_xboole_1:t56_relat_1:t65_zfmisc_1:t83_xboole_1:t88_relat_1:t92_zfmisc_1:t9_tarski:cc1_arytm_3:commutativity_k2_xboole_0:commutativity_k3_xboole_0:d13_pre_topc:d1_mcart_1:d1_tarski:d1_tops_2:d2_mcart_1:d2_tex_2:d2_tops_2:d3_compts_1:d3_xboole_0:d4_xboole_0:d5_pre_topc:dt_k9_filter_1:fc1_orders_2:fc2_lattice3:fc3_orders_2:idempotence_k2_xboole_0:idempotence_k3_xboole_0:l30_wellord2:l4_wellord1:rc9_lattices:redefinition_k1_domain_1:reflexivity_r2_wellord2:s1_tarski__e16_22__wellord2__1:s1_tarski__e18_27__finset_1__1:s1_tarski__e6_22__wellord2__1:s1_xboole_0__e18_27__finset_1__1:s1_xboole_0__e6_27__finset_1:symmetry_r2_wellord2:t10_tops_2:t13_compts_1:t16_tops_2:t17_tops_2:t18_finset_1:t24_ordinal1:t29_yellow_0:t46_setfam_1:t50_lattice3:abstractness_v3_lattices:cc18_membered:commutativity_k2_tarski:d1_enumset1:d2_tarski:d2_xboole_0:d3_ordinal1:d4_subset_1:d4_tarski:dt_k2_lattice3:fc2_relat_1:fc3_relat_1:involutiveness_k4_relat_1:redefinition_k4_relset_1:redefinition_k5_subset_1:s1_relat_1__e6_21__wellord2:s1_tarski__e4_27_3_1__finset_1__1:s1_xboole_0__e4_27_3_1__finset_1:t10_zfmisc_1:t20_relat_1:t3_lattice3:t47_setfam_1:t48_setfam_1:t64_relat_1:t65_relat_1:cc12_membered:cc20_membered:fc1_finsub_1:fc2_lattice2:fc4_lattice2:l1_wellord1:rc1_funct_1:rc2_funct_1:redefinition_k4_subset_1:redefinition_k5_relset_1:redefinition_k5_setfam_1:redefinition_k6_setfam_1:redefinition_k6_subset_1:s1_ordinal2__e18_27__finset_1:s1_tarski__e6_21__wellord2__1:s1_tarski__e6_27__finset_1__1:s1_xboole_0__e6_21__wellord2__1:t115_relat_1:t119_relat_1:t12_xboole_1:t13_finset_1:t143_relat_1:t160_relat_1:t166_relat_1:t17_wellord1:t18_wellord1:t22_relset_1:t23_relset_1:t28_xboole_1:t42_ordinal1:t6_zfmisc_1:t74_relat_1:t7_xboole_1:t86_relat_1:t8_funct_1:t8_xboole_1:t90_relat_1:cc1_funct_2:cc1_ordinal1:cc2_funct_1:cc2_ordinal1:cc3_membered:cc4_membered:d1_funct_2:d1_wellord2:d4_ordinal1:d5_ordinal2:d8_xboole_0:dt_l3_lattices:fc10_finset_1:fc11_finset_1:fc12_finset_1:fc12_relat_1:fc14_finset_1:fc27_membered:fc28_membered:fc31_membered:fc32_membered:fc37_membered:fc39_membered:fc9_finset_1:rc1_ordinal1:rc1_ordinal2:rc1_partfun1:redefinition_k8_funct_2:redefinition_r2_wellord2:t118_zfmisc_1:t119_zfmisc_1:t12_relset_1:t15_finset_1:t16_wellord1:t21_funct_2:t2_wellord2:t3_wellord2:t57_funct_1:t5_wellord2:cc2_funct_2:cc3_arytm_3:cc3_funct_2:connectedness_r1_ordinal1:d16_relat_2:d1_binop_1:d1_relset_1:d2_compts_1:d4_funct_1:d6_relat_1:d9_relat_2:dt_k6_partfun1:dt_k8_funct_2:fc13_finset_1:fc1_funct_1:fc3_funct_1:l25_zfmisc_1:l28_zfmisc_1:rc2_partfun1:rc3_funct_1:redefinition_r1_ordinal1:reflexivity_r1_ordinal1:s2_funct_1__e10_24__wellord2:t145_relat_1:t174_relat_1:t17_finset_1:t17_xboole_1:t19_xboole_1:t20_wellord1:t21_funct_1:t22_wellord1:t23_wellord1:t26_xboole_1:t31_wellord1:t32_wellord1:t33_xboole_1:t36_xboole_1:t46_relat_1:t47_relat_1:t4_xboole_0:t54_funct_1:t60_xboole_1:t63_xboole_1:t94_relat_1:cc11_membered:cc13_membered:cc19_membered:cc1_partfun1:d12_relat_2:d14_relat_2:d1_finset_1:d1_ordinal1:d3_wellord1:d4_wellord1:d6_ordinal1:d7_wellord1:d9_funct_1:dt_g3_lattices:dt_k2_funct_1:fc2_funct_1:fc2_partfun1:fc4_funct_1:fc5_funct_1:fc6_membered:l29_wellord1:l3_zfmisc_1:rc1_funct_2:rc4_funct_1:t116_relat_1:t118_relat_1:t144_relat_1:t145_funct_1:t146_funct_1:t146_relat_1:t167_relat_1:t21_ordinal1:t21_relat_1:t21_wellord1:t25_relat_1:t26_finset_1:t32_ordinal1:t33_ordinal1:t37_relat_1:t39_wellord1:t41_ordinal1:t44_relat_1:t45_relat_1:t45_xboole_1:t46_funct_2:t49_wellord1:t54_wellord1:t5_wellord1:t62_funct_1:t68_funct_1:t69_enumset1:t6_funct_2:t72_funct_1:t8_wellord1:t8_zfmisc_1:t99_relat_1:t9_funct_2:t9_zfmisc_1:cc5_funct_2:cc6_funct_2:d12_funct_1:d13_funct_1:d1_lattice3:d5_funct_1:d6_wellord1:d8_funct_1:dt_k1_wellord2:dt_k2_wellord1:dt_k7_relat_1:dt_k8_relat_1:dt_u1_lattices:dt_u2_lattices:fc1_relat_1:l82_funct_1:rc2_ordinal1:rc3_relat_1:s2_funct_1__e16_22__wellord2__1:s3_funct_1__e16_22__wellord2:t147_funct_1:t22_funct_1:t23_funct_1:t26_wellord2:t28_wellord2:t34_funct_1:t70_funct_1:cc14_membered:cc15_membered:cc3_ordinal1:cc4_funct_2:d2_wellord1:d4_wellord2:dt_k2_binop_1:fc1_ordinal2:fc1_pre_topc:fc33_membered:fc34_membered:fc3_ordinal1:fc40_membered:rc1_membered:rc2_funct_2:rc3_ordinal1:t25_wellord2:t53_wellord1:t55_funct_1:cc1_membered:cc2_membered:fc35_membered:fc36_membered:fc3_lattice2:fc3_lattices:fc41_membered:fc4_ordinal1:fc5_lattice2:redefinition_k2_binop_1:fc2_arytm_3:fc2_ordinal1:free_g3_lattices:rc2_finset_1:t4_wellord2:t6_wellord2:t7_wellord2:cc2_arytm_3:rc1_arytm_3:d5_wellord1:dt_k10_relat_1:dt_k1_binop_1:dt_k1_enumset1:dt_k1_funct_1:dt_k1_mcart_1:dt_k1_ordinal1:dt_k1_relat_1:dt_k1_setfam_1:dt_k1_tarski:dt_k1_wellord1:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_mcart_1:dt_k2_relat_1:dt_k2_tarski:dt_k2_xboole_0:dt_k2_zfmisc_1:dt_k3_relat_1:dt_k3_tarski:dt_k3_xboole_0:dt_k4_tarski:dt_k4_xboole_0:dt_k5_ordinal2:dt_k9_relat_1:dt_l1_struct_0:dt_m1_relset_1:dt_m1_subset_1:dt_u1_struct_0 (638)
% SZS status THM for /tmp/SystemOnTPTP17933/SEU361+2.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP17933/SEU361+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 29322
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.026 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(rel_str(X1)=>bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)),file('/tmp/SRASS.s.p', d11_yellow_0)).
% fof(3, axiom,![X1]:(rel_str(X1)=>![X2]:(element(X2,the_carrier(X1))=>(relstr_set_smaller(X1,empty_set,X2)&relstr_element_smaller(X1,empty_set,X2)))),file('/tmp/SRASS.s.p', t6_yellow_0)).
% fof(10, axiom,![X1]:(rel_str(X1)=>![X2]:![X3]:(element(X3,the_carrier(X1))=>(ex_sup_of_relstr_set(X1,X2)=>(X3=join_on_relstr(X1,X2)<=>(relstr_set_smaller(X1,X2,X3)&![X4]:(element(X4,the_carrier(X1))=>(relstr_set_smaller(X1,X2,X4)=>related(X1,X3,X4)))))))),file('/tmp/SRASS.s.p', d9_yellow_0)).
% fof(33, axiom,![X1]:(rel_str(X1)=>![X2]:(ex_sup_of_relstr_set(X1,X2)<=>?[X3]:(((element(X3,the_carrier(X1))&relstr_set_smaller(X1,X2,X3))&![X4]:(element(X4,the_carrier(X1))=>(relstr_set_smaller(X1,X2,X4)=>related(X1,X3,X4))))&![X4]:(element(X4,the_carrier(X1))=>((relstr_set_smaller(X1,X2,X4)&![X5]:(element(X5,the_carrier(X1))=>(relstr_set_smaller(X1,X2,X5)=>related(X1,X4,X5))))=>X4=X3))))),file('/tmp/SRASS.s.p', d7_yellow_0)).
% fof(35, axiom,![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>(ex_sup_of_relstr_set(X1,empty_set)&ex_inf_of_relstr_set(X1,the_carrier(X1)))),file('/tmp/SRASS.s.p', t42_yellow_0)).
% fof(49, conjecture,![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>related(X1,bottom_of_relstr(X1),X2))),file('/tmp/SRASS.s.p', t44_yellow_0)).
% fof(50, negated_conjecture,~(![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>related(X1,bottom_of_relstr(X1),X2)))),inference(assume_negation,[status(cth)],[49])).
% fof(62, plain,![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>(ex_sup_of_relstr_set(X1,empty_set)&ex_inf_of_relstr_set(X1,the_carrier(X1)))),inference(fof_simplification,[status(thm)],[35,theory(equality)])).
% fof(65, negated_conjecture,~(![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>related(X1,bottom_of_relstr(X1),X2)))),inference(fof_simplification,[status(thm)],[50,theory(equality)])).
% fof(66, plain,![X1]:(~(rel_str(X1))|bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)),inference(fof_nnf,[status(thm)],[1])).
% fof(67, plain,![X2]:(~(rel_str(X2))|bottom_of_relstr(X2)=join_on_relstr(X2,empty_set)),inference(variable_rename,[status(thm)],[66])).
% cnf(68,plain,(bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)|~rel_str(X1)),inference(split_conjunct,[status(thm)],[67])).
% fof(73, plain,![X1]:(~(rel_str(X1))|![X2]:(~(element(X2,the_carrier(X1)))|(relstr_set_smaller(X1,empty_set,X2)&relstr_element_smaller(X1,empty_set,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(74, plain,![X3]:(~(rel_str(X3))|![X4]:(~(element(X4,the_carrier(X3)))|(relstr_set_smaller(X3,empty_set,X4)&relstr_element_smaller(X3,empty_set,X4)))),inference(variable_rename,[status(thm)],[73])).
% fof(75, plain,![X3]:![X4]:((~(element(X4,the_carrier(X3)))|(relstr_set_smaller(X3,empty_set,X4)&relstr_element_smaller(X3,empty_set,X4)))|~(rel_str(X3))),inference(shift_quantors,[status(thm)],[74])).
% fof(76, plain,![X3]:![X4]:(((relstr_set_smaller(X3,empty_set,X4)|~(element(X4,the_carrier(X3))))|~(rel_str(X3)))&((relstr_element_smaller(X3,empty_set,X4)|~(element(X4,the_carrier(X3))))|~(rel_str(X3)))),inference(distribute,[status(thm)],[75])).
% cnf(78,plain,(relstr_set_smaller(X1,empty_set,X2)|~rel_str(X1)|~element(X2,the_carrier(X1))),inference(split_conjunct,[status(thm)],[76])).
% fof(105, plain,![X1]:(~(rel_str(X1))|![X2]:![X3]:(~(element(X3,the_carrier(X1)))|(~(ex_sup_of_relstr_set(X1,X2))|((~(X3=join_on_relstr(X1,X2))|(relstr_set_smaller(X1,X2,X3)&![X4]:(~(element(X4,the_carrier(X1)))|(~(relstr_set_smaller(X1,X2,X4))|related(X1,X3,X4)))))&((~(relstr_set_smaller(X1,X2,X3))|?[X4]:(element(X4,the_carrier(X1))&(relstr_set_smaller(X1,X2,X4)&~(related(X1,X3,X4)))))|X3=join_on_relstr(X1,X2)))))),inference(fof_nnf,[status(thm)],[10])).
% fof(106, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|(~(ex_sup_of_relstr_set(X5,X6))|((~(X7=join_on_relstr(X5,X6))|(relstr_set_smaller(X5,X6,X7)&![X8]:(~(element(X8,the_carrier(X5)))|(~(relstr_set_smaller(X5,X6,X8))|related(X5,X7,X8)))))&((~(relstr_set_smaller(X5,X6,X7))|?[X9]:(element(X9,the_carrier(X5))&(relstr_set_smaller(X5,X6,X9)&~(related(X5,X7,X9)))))|X7=join_on_relstr(X5,X6)))))),inference(variable_rename,[status(thm)],[105])).
% fof(107, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|(~(ex_sup_of_relstr_set(X5,X6))|((~(X7=join_on_relstr(X5,X6))|(relstr_set_smaller(X5,X6,X7)&![X8]:(~(element(X8,the_carrier(X5)))|(~(relstr_set_smaller(X5,X6,X8))|related(X5,X7,X8)))))&((~(relstr_set_smaller(X5,X6,X7))|(element(esk4_3(X5,X6,X7),the_carrier(X5))&(relstr_set_smaller(X5,X6,esk4_3(X5,X6,X7))&~(related(X5,X7,esk4_3(X5,X6,X7))))))|X7=join_on_relstr(X5,X6)))))),inference(skolemize,[status(esa)],[106])).
% fof(108, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(element(X8,the_carrier(X5)))|(~(relstr_set_smaller(X5,X6,X8))|related(X5,X7,X8)))&relstr_set_smaller(X5,X6,X7))|~(X7=join_on_relstr(X5,X6)))&((~(relstr_set_smaller(X5,X6,X7))|(element(esk4_3(X5,X6,X7),the_carrier(X5))&(relstr_set_smaller(X5,X6,esk4_3(X5,X6,X7))&~(related(X5,X7,esk4_3(X5,X6,X7))))))|X7=join_on_relstr(X5,X6)))|~(ex_sup_of_relstr_set(X5,X6)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5))),inference(shift_quantors,[status(thm)],[107])).
% fof(109, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(element(X8,the_carrier(X5)))|(~(relstr_set_smaller(X5,X6,X8))|related(X5,X7,X8)))|~(X7=join_on_relstr(X5,X6)))|~(ex_sup_of_relstr_set(X5,X6)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((relstr_set_smaller(X5,X6,X7)|~(X7=join_on_relstr(X5,X6)))|~(ex_sup_of_relstr_set(X5,X6)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5))))&((((((element(esk4_3(X5,X6,X7),the_carrier(X5))|~(relstr_set_smaller(X5,X6,X7)))|X7=join_on_relstr(X5,X6))|~(ex_sup_of_relstr_set(X5,X6)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((((relstr_set_smaller(X5,X6,esk4_3(X5,X6,X7))|~(relstr_set_smaller(X5,X6,X7)))|X7=join_on_relstr(X5,X6))|~(ex_sup_of_relstr_set(X5,X6)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&(((((~(related(X5,X7,esk4_3(X5,X6,X7)))|~(relstr_set_smaller(X5,X6,X7)))|X7=join_on_relstr(X5,X6))|~(ex_sup_of_relstr_set(X5,X6)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))))),inference(distribute,[status(thm)],[108])).
% cnf(110,plain,(X2=join_on_relstr(X1,X3)|~rel_str(X1)|~element(X2,the_carrier(X1))|~ex_sup_of_relstr_set(X1,X3)|~relstr_set_smaller(X1,X3,X2)|~related(X1,X2,esk4_3(X1,X3,X2))),inference(split_conjunct,[status(thm)],[109])).
% cnf(111,plain,(X2=join_on_relstr(X1,X3)|relstr_set_smaller(X1,X3,esk4_3(X1,X3,X2))|~rel_str(X1)|~element(X2,the_carrier(X1))|~ex_sup_of_relstr_set(X1,X3)|~relstr_set_smaller(X1,X3,X2)),inference(split_conjunct,[status(thm)],[109])).
% cnf(112,plain,(X2=join_on_relstr(X1,X3)|element(esk4_3(X1,X3,X2),the_carrier(X1))|~rel_str(X1)|~element(X2,the_carrier(X1))|~ex_sup_of_relstr_set(X1,X3)|~relstr_set_smaller(X1,X3,X2)),inference(split_conjunct,[status(thm)],[109])).
% fof(229, plain,![X1]:(~(rel_str(X1))|![X2]:((~(ex_sup_of_relstr_set(X1,X2))|?[X3]:(((element(X3,the_carrier(X1))&relstr_set_smaller(X1,X2,X3))&![X4]:(~(element(X4,the_carrier(X1)))|(~(relstr_set_smaller(X1,X2,X4))|related(X1,X3,X4))))&![X4]:(~(element(X4,the_carrier(X1)))|((~(relstr_set_smaller(X1,X2,X4))|?[X5]:(element(X5,the_carrier(X1))&(relstr_set_smaller(X1,X2,X5)&~(related(X1,X4,X5)))))|X4=X3))))&(![X3]:(((~(element(X3,the_carrier(X1)))|~(relstr_set_smaller(X1,X2,X3)))|?[X4]:(element(X4,the_carrier(X1))&(relstr_set_smaller(X1,X2,X4)&~(related(X1,X3,X4)))))|?[X4]:(element(X4,the_carrier(X1))&((relstr_set_smaller(X1,X2,X4)&![X5]:(~(element(X5,the_carrier(X1)))|(~(relstr_set_smaller(X1,X2,X5))|related(X1,X4,X5))))&~(X4=X3))))|ex_sup_of_relstr_set(X1,X2)))),inference(fof_nnf,[status(thm)],[33])).
% fof(230, plain,![X6]:(~(rel_str(X6))|![X7]:((~(ex_sup_of_relstr_set(X6,X7))|?[X8]:(((element(X8,the_carrier(X6))&relstr_set_smaller(X6,X7,X8))&![X9]:(~(element(X9,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X9))|related(X6,X8,X9))))&![X10]:(~(element(X10,the_carrier(X6)))|((~(relstr_set_smaller(X6,X7,X10))|?[X11]:(element(X11,the_carrier(X6))&(relstr_set_smaller(X6,X7,X11)&~(related(X6,X10,X11)))))|X10=X8))))&(![X12]:(((~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12)))|?[X13]:(element(X13,the_carrier(X6))&(relstr_set_smaller(X6,X7,X13)&~(related(X6,X12,X13)))))|?[X14]:(element(X14,the_carrier(X6))&((relstr_set_smaller(X6,X7,X14)&![X15]:(~(element(X15,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X15))|related(X6,X14,X15))))&~(X14=X12))))|ex_sup_of_relstr_set(X6,X7)))),inference(variable_rename,[status(thm)],[229])).
% fof(231, plain,![X6]:(~(rel_str(X6))|![X7]:((~(ex_sup_of_relstr_set(X6,X7))|(((element(esk21_2(X6,X7),the_carrier(X6))&relstr_set_smaller(X6,X7,esk21_2(X6,X7)))&![X9]:(~(element(X9,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X9))|related(X6,esk21_2(X6,X7),X9))))&![X10]:(~(element(X10,the_carrier(X6)))|((~(relstr_set_smaller(X6,X7,X10))|(element(esk22_3(X6,X7,X10),the_carrier(X6))&(relstr_set_smaller(X6,X7,esk22_3(X6,X7,X10))&~(related(X6,X10,esk22_3(X6,X7,X10))))))|X10=esk21_2(X6,X7)))))&(![X12]:(((~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12)))|(element(esk23_3(X6,X7,X12),the_carrier(X6))&(relstr_set_smaller(X6,X7,esk23_3(X6,X7,X12))&~(related(X6,X12,esk23_3(X6,X7,X12))))))|(element(esk24_3(X6,X7,X12),the_carrier(X6))&((relstr_set_smaller(X6,X7,esk24_3(X6,X7,X12))&![X15]:(~(element(X15,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X15))|related(X6,esk24_3(X6,X7,X12),X15))))&~(esk24_3(X6,X7,X12)=X12))))|ex_sup_of_relstr_set(X6,X7)))),inference(skolemize,[status(esa)],[230])).
% fof(232, plain,![X6]:![X7]:![X9]:![X10]:![X12]:![X15]:((((((((~(element(X15,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X15))|related(X6,esk24_3(X6,X7,X12),X15)))&relstr_set_smaller(X6,X7,esk24_3(X6,X7,X12)))&~(esk24_3(X6,X7,X12)=X12))&element(esk24_3(X6,X7,X12),the_carrier(X6)))|((~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12)))|(element(esk23_3(X6,X7,X12),the_carrier(X6))&(relstr_set_smaller(X6,X7,esk23_3(X6,X7,X12))&~(related(X6,X12,esk23_3(X6,X7,X12)))))))|ex_sup_of_relstr_set(X6,X7))&(((~(element(X10,the_carrier(X6)))|((~(relstr_set_smaller(X6,X7,X10))|(element(esk22_3(X6,X7,X10),the_carrier(X6))&(relstr_set_smaller(X6,X7,esk22_3(X6,X7,X10))&~(related(X6,X10,esk22_3(X6,X7,X10))))))|X10=esk21_2(X6,X7)))&((~(element(X9,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X9))|related(X6,esk21_2(X6,X7),X9)))&(element(esk21_2(X6,X7),the_carrier(X6))&relstr_set_smaller(X6,X7,esk21_2(X6,X7)))))|~(ex_sup_of_relstr_set(X6,X7))))|~(rel_str(X6))),inference(shift_quantors,[status(thm)],[231])).
% fof(233, plain,![X6]:![X7]:![X9]:![X10]:![X12]:![X15]:(((((((((element(esk23_3(X6,X7,X12),the_carrier(X6))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|(~(element(X15,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X15))|related(X6,esk24_3(X6,X7,X12),X15))))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))&(((((relstr_set_smaller(X6,X7,esk23_3(X6,X7,X12))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|(~(element(X15,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X15))|related(X6,esk24_3(X6,X7,X12),X15))))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))&((((~(related(X6,X12,esk23_3(X6,X7,X12)))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|(~(element(X15,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X15))|related(X6,esk24_3(X6,X7,X12),X15))))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))))&(((((element(esk23_3(X6,X7,X12),the_carrier(X6))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|relstr_set_smaller(X6,X7,esk24_3(X6,X7,X12)))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))&(((((relstr_set_smaller(X6,X7,esk23_3(X6,X7,X12))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|relstr_set_smaller(X6,X7,esk24_3(X6,X7,X12)))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))&((((~(related(X6,X12,esk23_3(X6,X7,X12)))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|relstr_set_smaller(X6,X7,esk24_3(X6,X7,X12)))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6))))))&(((((element(esk23_3(X6,X7,X12),the_carrier(X6))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|~(esk24_3(X6,X7,X12)=X12))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))&(((((relstr_set_smaller(X6,X7,esk23_3(X6,X7,X12))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|~(esk24_3(X6,X7,X12)=X12))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))&((((~(related(X6,X12,esk23_3(X6,X7,X12)))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|~(esk24_3(X6,X7,X12)=X12))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6))))))&(((((element(esk23_3(X6,X7,X12),the_carrier(X6))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|element(esk24_3(X6,X7,X12),the_carrier(X6)))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))&(((((relstr_set_smaller(X6,X7,esk23_3(X6,X7,X12))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|element(esk24_3(X6,X7,X12),the_carrier(X6)))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6)))&((((~(related(X6,X12,esk23_3(X6,X7,X12)))|(~(element(X12,the_carrier(X6)))|~(relstr_set_smaller(X6,X7,X12))))|element(esk24_3(X6,X7,X12),the_carrier(X6)))|ex_sup_of_relstr_set(X6,X7))|~(rel_str(X6))))))&(((((((element(esk22_3(X6,X7,X10),the_carrier(X6))|~(relstr_set_smaller(X6,X7,X10)))|X10=esk21_2(X6,X7))|~(element(X10,the_carrier(X6))))|~(ex_sup_of_relstr_set(X6,X7)))|~(rel_str(X6)))&((((((relstr_set_smaller(X6,X7,esk22_3(X6,X7,X10))|~(relstr_set_smaller(X6,X7,X10)))|X10=esk21_2(X6,X7))|~(element(X10,the_carrier(X6))))|~(ex_sup_of_relstr_set(X6,X7)))|~(rel_str(X6)))&(((((~(related(X6,X10,esk22_3(X6,X7,X10)))|~(relstr_set_smaller(X6,X7,X10)))|X10=esk21_2(X6,X7))|~(element(X10,the_carrier(X6))))|~(ex_sup_of_relstr_set(X6,X7)))|~(rel_str(X6)))))&((((~(element(X9,the_carrier(X6)))|(~(relstr_set_smaller(X6,X7,X9))|related(X6,esk21_2(X6,X7),X9)))|~(ex_sup_of_relstr_set(X6,X7)))|~(rel_str(X6)))&(((element(esk21_2(X6,X7),the_carrier(X6))|~(ex_sup_of_relstr_set(X6,X7)))|~(rel_str(X6)))&((relstr_set_smaller(X6,X7,esk21_2(X6,X7))|~(ex_sup_of_relstr_set(X6,X7)))|~(rel_str(X6))))))),inference(distribute,[status(thm)],[232])).
% cnf(234,plain,(relstr_set_smaller(X1,X2,esk21_2(X1,X2))|~rel_str(X1)|~ex_sup_of_relstr_set(X1,X2)),inference(split_conjunct,[status(thm)],[233])).
% cnf(235,plain,(element(esk21_2(X1,X2),the_carrier(X1))|~rel_str(X1)|~ex_sup_of_relstr_set(X1,X2)),inference(split_conjunct,[status(thm)],[233])).
% cnf(236,plain,(related(X1,esk21_2(X1,X2),X3)|~rel_str(X1)|~ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[233])).
% fof(257, plain,![X1]:((((empty_carrier(X1)|~(antisymmetric_relstr(X1)))|~(lower_bounded_relstr(X1)))|~(rel_str(X1)))|(ex_sup_of_relstr_set(X1,empty_set)&ex_inf_of_relstr_set(X1,the_carrier(X1)))),inference(fof_nnf,[status(thm)],[62])).
% fof(258, plain,![X2]:((((empty_carrier(X2)|~(antisymmetric_relstr(X2)))|~(lower_bounded_relstr(X2)))|~(rel_str(X2)))|(ex_sup_of_relstr_set(X2,empty_set)&ex_inf_of_relstr_set(X2,the_carrier(X2)))),inference(variable_rename,[status(thm)],[257])).
% fof(259, plain,![X2]:((ex_sup_of_relstr_set(X2,empty_set)|(((empty_carrier(X2)|~(antisymmetric_relstr(X2)))|~(lower_bounded_relstr(X2)))|~(rel_str(X2))))&(ex_inf_of_relstr_set(X2,the_carrier(X2))|(((empty_carrier(X2)|~(antisymmetric_relstr(X2)))|~(lower_bounded_relstr(X2)))|~(rel_str(X2))))),inference(distribute,[status(thm)],[258])).
% cnf(261,plain,(empty_carrier(X1)|ex_sup_of_relstr_set(X1,empty_set)|~rel_str(X1)|~lower_bounded_relstr(X1)|~antisymmetric_relstr(X1)),inference(split_conjunct,[status(thm)],[259])).
% fof(338, negated_conjecture,?[X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))&?[X2]:(element(X2,the_carrier(X1))&~(related(X1,bottom_of_relstr(X1),X2)))),inference(fof_nnf,[status(thm)],[65])).
% fof(339, negated_conjecture,?[X3]:((((~(empty_carrier(X3))&antisymmetric_relstr(X3))&lower_bounded_relstr(X3))&rel_str(X3))&?[X4]:(element(X4,the_carrier(X3))&~(related(X3,bottom_of_relstr(X3),X4)))),inference(variable_rename,[status(thm)],[338])).
% fof(340, negated_conjecture,((((~(empty_carrier(esk33_0))&antisymmetric_relstr(esk33_0))&lower_bounded_relstr(esk33_0))&rel_str(esk33_0))&(element(esk34_0,the_carrier(esk33_0))&~(related(esk33_0,bottom_of_relstr(esk33_0),esk34_0)))),inference(skolemize,[status(esa)],[339])).
% cnf(341,negated_conjecture,(~related(esk33_0,bottom_of_relstr(esk33_0),esk34_0)),inference(split_conjunct,[status(thm)],[340])).
% cnf(342,negated_conjecture,(element(esk34_0,the_carrier(esk33_0))),inference(split_conjunct,[status(thm)],[340])).
% cnf(343,negated_conjecture,(rel_str(esk33_0)),inference(split_conjunct,[status(thm)],[340])).
% cnf(344,negated_conjecture,(lower_bounded_relstr(esk33_0)),inference(split_conjunct,[status(thm)],[340])).
% cnf(345,negated_conjecture,(antisymmetric_relstr(esk33_0)),inference(split_conjunct,[status(thm)],[340])).
% cnf(346,negated_conjecture,(~empty_carrier(esk33_0)),inference(split_conjunct,[status(thm)],[340])).
% cnf(348,negated_conjecture,(~related(esk33_0,join_on_relstr(esk33_0,empty_set),esk34_0)|~rel_str(esk33_0)),inference(spm,[status(thm)],[341,68,theory(equality)])).
% cnf(350,negated_conjecture,(~related(esk33_0,join_on_relstr(esk33_0,empty_set),esk34_0)|$false),inference(rw,[status(thm)],[348,343,theory(equality)])).
% cnf(351,negated_conjecture,(~related(esk33_0,join_on_relstr(esk33_0,empty_set),esk34_0)),inference(cn,[status(thm)],[350,theory(equality)])).
% cnf(354,negated_conjecture,(ex_sup_of_relstr_set(esk33_0,empty_set)|empty_carrier(esk33_0)|~antisymmetric_relstr(esk33_0)|~rel_str(esk33_0)),inference(spm,[status(thm)],[261,344,theory(equality)])).
% cnf(355,negated_conjecture,(ex_sup_of_relstr_set(esk33_0,empty_set)|empty_carrier(esk33_0)|$false|~rel_str(esk33_0)),inference(rw,[status(thm)],[354,345,theory(equality)])).
% cnf(356,negated_conjecture,(ex_sup_of_relstr_set(esk33_0,empty_set)|empty_carrier(esk33_0)|$false|$false),inference(rw,[status(thm)],[355,343,theory(equality)])).
% cnf(357,negated_conjecture,(ex_sup_of_relstr_set(esk33_0,empty_set)|empty_carrier(esk33_0)),inference(cn,[status(thm)],[356,theory(equality)])).
% cnf(358,negated_conjecture,(ex_sup_of_relstr_set(esk33_0,empty_set)),inference(sr,[status(thm)],[357,346,theory(equality)])).
% cnf(431,plain,(join_on_relstr(X1,X2)=esk21_2(X1,X3)|~ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X2,esk21_2(X1,X3))|~element(esk21_2(X1,X3),the_carrier(X1))|~rel_str(X1)|~ex_sup_of_relstr_set(X1,X3)|~relstr_set_smaller(X1,X3,esk4_3(X1,X2,esk21_2(X1,X3)))|~element(esk4_3(X1,X2,esk21_2(X1,X3)),the_carrier(X1))),inference(spm,[status(thm)],[110,236,theory(equality)])).
% cnf(1725,plain,(join_on_relstr(X1,X2)=esk21_2(X1,X3)|~ex_sup_of_relstr_set(X1,X2)|~ex_sup_of_relstr_set(X1,X3)|~relstr_set_smaller(X1,X3,esk4_3(X1,X2,esk21_2(X1,X3)))|~relstr_set_smaller(X1,X2,esk21_2(X1,X3))|~element(esk21_2(X1,X3),the_carrier(X1))|~rel_str(X1)),inference(csr,[status(thm)],[431,112])).
% cnf(1726,plain,(join_on_relstr(X1,X2)=esk21_2(X1,X3)|~ex_sup_of_relstr_set(X1,X3)|~ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X3,esk4_3(X1,X2,esk21_2(X1,X3)))|~relstr_set_smaller(X1,X2,esk21_2(X1,X3))|~rel_str(X1)),inference(csr,[status(thm)],[1725,235])).
% cnf(1730,plain,(join_on_relstr(X1,X2)=esk21_2(X1,X2)|~ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X2,esk21_2(X1,X2))|~rel_str(X1)|~element(esk21_2(X1,X2),the_carrier(X1))),inference(spm,[status(thm)],[1726,111,theory(equality)])).
% cnf(1733,plain,(esk21_2(X1,X2)=join_on_relstr(X1,X2)|~ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X2,esk21_2(X1,X2))|~rel_str(X1)),inference(csr,[status(thm)],[1730,235])).
% cnf(1734,plain,(esk21_2(X1,X2)=join_on_relstr(X1,X2)|~ex_sup_of_relstr_set(X1,X2)|~rel_str(X1)),inference(csr,[status(thm)],[1733,234])).
% cnf(1739,plain,(related(X1,join_on_relstr(X1,X2),X3)|~ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1)),inference(spm,[status(thm)],[236,1734,theory(equality)])).
% cnf(1764,negated_conjecture,(~ex_sup_of_relstr_set(esk33_0,empty_set)|~relstr_set_smaller(esk33_0,empty_set,esk34_0)|~element(esk34_0,the_carrier(esk33_0))|~rel_str(esk33_0)),inference(spm,[status(thm)],[351,1739,theory(equality)])).
% cnf(1784,negated_conjecture,($false|~relstr_set_smaller(esk33_0,empty_set,esk34_0)|~element(esk34_0,the_carrier(esk33_0))|~rel_str(esk33_0)),inference(rw,[status(thm)],[1764,358,theory(equality)])).
% cnf(1785,negated_conjecture,($false|~relstr_set_smaller(esk33_0,empty_set,esk34_0)|$false|~rel_str(esk33_0)),inference(rw,[status(thm)],[1784,342,theory(equality)])).
% cnf(1786,negated_conjecture,($false|~relstr_set_smaller(esk33_0,empty_set,esk34_0)|$false|$false),inference(rw,[status(thm)],[1785,343,theory(equality)])).
% cnf(1787,negated_conjecture,(~relstr_set_smaller(esk33_0,empty_set,esk34_0)),inference(cn,[status(thm)],[1786,theory(equality)])).
% cnf(1788,negated_conjecture,(~element(esk34_0,the_carrier(esk33_0))|~rel_str(esk33_0)),inference(spm,[status(thm)],[1787,78,theory(equality)])).
% cnf(1789,negated_conjecture,($false|~rel_str(esk33_0)),inference(rw,[status(thm)],[1788,342,theory(equality)])).
% cnf(1790,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1789,343,theory(equality)])).
% cnf(1791,negated_conjecture,($false),inference(cn,[status(thm)],[1790,theory(equality)])).
% cnf(1792,negated_conjecture,($false),1791,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 308
% # ...of these trivial                : 3
% # ...subsumed                        : 41
% # ...remaining for further processing: 264
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 11
% # Backward-rewritten                 : 0
% # Generated clauses                  : 894
% # ...of the previous two non-trivial : 829
% # Contextual simplify-reflections    : 98
% # Paramodulations                    : 887
% # Factorizations                     : 0
% # Equation resolutions               : 7
% # Current number of processed clauses: 253
% #    Positive orientable unit clauses: 22
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 7
% #    Non-unit-clauses                : 224
% # Current number of unprocessed clauses: 618
% # ...number of literals in the above : 4967
% # Clause-clause subsumption calls (NU) : 2378
% # Rec. Clause-clause subsumption calls : 451
% # Unit Clause-clause subsumption calls : 32
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:   220 leaves,   1.70+/-2.770 terms/leaf
% # Paramod-from index:           94 leaves,   1.28+/-1.356 terms/leaf
% # Paramod-into index:          185 leaves,   1.52+/-2.118 terms/leaf
% # -------------------------------------------------
% # User time              : 0.090 s
% # System time            : 0.007 s
% # Total time             : 0.097 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.31 WC
% FINAL PrfWatch: 0.23 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP17933/SEU361+2.tptp
% 
%------------------------------------------------------------------------------