%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU172+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n005.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 10:25:38 EDT 2022
% Result : Theorem 151.78s 152.03s
% Output : CNFRefutation 151.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 117
% Syntax : Number of formulae : 1007 ( 250 unt; 0 def)
% Number of atoms : 2603 ( 776 equ)
% Maximal formula atoms : 28 ( 2 avg)
% Number of connectives : 2709 (1113 ~;1243 |; 183 &)
% ( 72 <=>; 98 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 7 usr; 2 prp; 0-2 aty)
% Number of functors : 67 ( 67 usr; 11 con; 0-4 aty)
% Number of variables : 2386 ( 140 sgn 765 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('<stdin>',d2_zfmisc_1) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('<stdin>',d3_xboole_0) ).
fof(c_0_2,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('<stdin>',d4_xboole_0) ).
fof(c_0_3,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('<stdin>',d2_xboole_0) ).
fof(c_0_4,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('<stdin>',d2_tarski) ).
fof(c_0_5,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('<stdin>',d4_tarski) ).
fof(c_0_6,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('<stdin>',d1_zfmisc_1) ).
fof(c_0_7,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('<stdin>',t2_tarski) ).
fof(c_0_8,axiom,
! [X1] :
? [X2] :
( in(X1,X2)
& ! [X3,X4] :
( ( in(X3,X2)
& subset(X4,X3) )
=> in(X4,X2) )
& ! [X3] :
~ ( in(X3,X2)
& ! [X4] :
~ ( in(X4,X2)
& ! [X5] :
( subset(X5,X3)
=> in(X5,X4) ) ) )
& ! [X3] :
~ ( subset(X3,X2)
& ~ are_equipotent(X3,X2)
& ~ in(X3,X2) ) ),
file('<stdin>',t9_tarski) ).
fof(c_0_9,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('<stdin>',d1_tarski) ).
fof(c_0_10,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('<stdin>',dt_k3_subset_1) ).
fof(c_0_11,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('<stdin>',d3_tarski) ).
fof(c_0_12,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('<stdin>',involutiveness_k3_subset_1) ).
fof(c_0_13,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('<stdin>',d5_subset_1) ).
fof(c_0_14,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('<stdin>',d5_tarski) ).
fof(c_0_15,axiom,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X2,X1)) ),
file('<stdin>',fc3_xboole_0) ).
fof(c_0_16,axiom,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X1,X2)) ),
file('<stdin>',fc2_xboole_0) ).
fof(c_0_17,axiom,
! [X1,X2] : ~ empty(ordered_pair(X1,X2)),
file('<stdin>',fc1_zfmisc_1) ).
fof(c_0_18,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',d10_xboole_0) ).
fof(c_0_19,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
file('<stdin>',antisymmetry_r2_xboole_0) ).
fof(c_0_20,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('<stdin>',antisymmetry_r2_hidden) ).
fof(c_0_21,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('<stdin>',d2_subset_1) ).
fof(c_0_22,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
file('<stdin>',d8_xboole_0) ).
fof(c_0_23,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('<stdin>',symmetry_r1_xboole_0) ).
fof(c_0_24,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('<stdin>',d7_xboole_0) ).
fof(c_0_25,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
file('<stdin>',rc1_subset_1) ).
fof(c_0_26,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('<stdin>',t7_boole) ).
fof(c_0_27,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('<stdin>',commutativity_k3_xboole_0) ).
fof(c_0_28,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('<stdin>',commutativity_k2_xboole_0) ).
fof(c_0_29,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('<stdin>',commutativity_k2_tarski) ).
fof(c_0_30,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
file('<stdin>',rc2_subset_1) ).
fof(c_0_31,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('<stdin>',d1_xboole_0) ).
fof(c_0_32,axiom,
! [X1,X2] : ~ proper_subset(X1,X1),
file('<stdin>',irreflexivity_r2_xboole_0) ).
fof(c_0_33,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('<stdin>',existence_m1_subset_1) ).
fof(c_0_34,axiom,
! [X1] : ~ empty(powerset(X1)),
file('<stdin>',fc1_subset_1) ).
fof(c_0_35,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('<stdin>',t8_boole) ).
fof(c_0_36,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('<stdin>',idempotence_k3_xboole_0) ).
fof(c_0_37,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('<stdin>',idempotence_k2_xboole_0) ).
fof(c_0_38,axiom,
! [X1,X2] : subset(X1,X1),
file('<stdin>',reflexivity_r1_tarski) ).
fof(c_0_39,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('<stdin>',t3_boole) ).
fof(c_0_40,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
file('<stdin>',t1_boole) ).
fof(c_0_41,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
file('<stdin>',t4_boole) ).
fof(c_0_42,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('<stdin>',t2_boole) ).
fof(c_0_43,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('<stdin>',t6_boole) ).
fof(c_0_44,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_45,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_46,axiom,
empty(empty_set),
file('<stdin>',fc1_xboole_0) ).
fof(c_0_47,axiom,
$true,
file('<stdin>',dt_m1_subset_1) ).
fof(c_0_48,axiom,
$true,
file('<stdin>',dt_k4_xboole_0) ).
fof(c_0_49,axiom,
$true,
file('<stdin>',dt_k4_tarski) ).
fof(c_0_50,axiom,
$true,
file('<stdin>',dt_k3_xboole_0) ).
fof(c_0_51,axiom,
$true,
file('<stdin>',dt_k3_tarski) ).
fof(c_0_52,axiom,
$true,
file('<stdin>',dt_k2_zfmisc_1) ).
fof(c_0_53,axiom,
$true,
file('<stdin>',dt_k2_xboole_0) ).
fof(c_0_54,axiom,
$true,
file('<stdin>',dt_k2_tarski) ).
fof(c_0_55,axiom,
$true,
file('<stdin>',dt_k1_zfmisc_1) ).
fof(c_0_56,axiom,
$true,
file('<stdin>',dt_k1_xboole_0) ).
fof(c_0_57,axiom,
$true,
file('<stdin>',dt_k1_tarski) ).
fof(c_0_58,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
c_0_0 ).
fof(c_0_59,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
c_0_1 ).
fof(c_0_60,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_61,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
c_0_3 ).
fof(c_0_62,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
c_0_4 ).
fof(c_0_63,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
c_0_5 ).
fof(c_0_64,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
c_0_6 ).
fof(c_0_65,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
c_0_7 ).
fof(c_0_66,plain,
! [X1] :
? [X2] :
( in(X1,X2)
& ! [X3,X4] :
( ( in(X3,X2)
& subset(X4,X3) )
=> in(X4,X2) )
& ! [X3] :
~ ( in(X3,X2)
& ! [X4] :
~ ( in(X4,X2)
& ! [X5] :
( subset(X5,X3)
=> in(X5,X4) ) ) )
& ! [X3] :
~ ( subset(X3,X2)
& ~ are_equipotent(X3,X2)
& ~ in(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_67,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
c_0_9 ).
fof(c_0_68,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
c_0_10 ).
fof(c_0_69,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
c_0_11 ).
fof(c_0_70,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
c_0_12 ).
fof(c_0_71,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
c_0_13 ).
fof(c_0_72,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
c_0_14 ).
fof(c_0_73,plain,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_74,plain,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X1,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_75,plain,
! [X1,X2] : ~ empty(ordered_pair(X1,X2)),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_76,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_18 ).
fof(c_0_77,plain,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_78,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_79,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_80,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
c_0_22 ).
fof(c_0_81,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
c_0_23 ).
fof(c_0_82,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
c_0_24 ).
fof(c_0_83,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_25]) ).
fof(c_0_84,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
c_0_26 ).
fof(c_0_85,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
c_0_27 ).
fof(c_0_86,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
c_0_28 ).
fof(c_0_87,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
c_0_29 ).
fof(c_0_88,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
c_0_30 ).
fof(c_0_89,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
fof(c_0_90,plain,
! [X1,X2] : ~ proper_subset(X1,X1),
inference(fof_simplification,[status(thm)],[c_0_32]) ).
fof(c_0_91,axiom,
! [X1] :
? [X2] : element(X2,X1),
c_0_33 ).
fof(c_0_92,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[c_0_34]) ).
fof(c_0_93,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
c_0_35 ).
fof(c_0_94,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
c_0_36 ).
fof(c_0_95,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
c_0_37 ).
fof(c_0_96,axiom,
! [X1,X2] : subset(X1,X1),
c_0_38 ).
fof(c_0_97,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
c_0_39 ).
fof(c_0_98,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
c_0_40 ).
fof(c_0_99,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
c_0_41 ).
fof(c_0_100,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
c_0_42 ).
fof(c_0_101,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
c_0_43 ).
fof(c_0_102,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_44]) ).
fof(c_0_103,axiom,
? [X1] : empty(X1),
c_0_45 ).
fof(c_0_104,axiom,
empty(empty_set),
c_0_46 ).
fof(c_0_105,axiom,
$true,
c_0_47 ).
fof(c_0_106,axiom,
$true,
c_0_48 ).
fof(c_0_107,axiom,
$true,
c_0_49 ).
fof(c_0_108,axiom,
$true,
c_0_50 ).
fof(c_0_109,axiom,
$true,
c_0_51 ).
fof(c_0_110,axiom,
$true,
c_0_52 ).
fof(c_0_111,axiom,
$true,
c_0_53 ).
fof(c_0_112,axiom,
$true,
c_0_54 ).
fof(c_0_113,axiom,
$true,
c_0_55 ).
fof(c_0_114,axiom,
$true,
c_0_56 ).
fof(c_0_115,axiom,
$true,
c_0_57 ).
fof(c_0_116,plain,
! [X7,X8,X9,X10,X13,X14,X15,X16,X17,X18,X20,X21] :
( ( in(esk6_4(X7,X8,X9,X10),X7)
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( in(esk7_4(X7,X8,X9,X10),X8)
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( X10 = ordered_pair(esk6_4(X7,X8,X9,X10),esk7_4(X7,X8,X9,X10))
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( ~ in(X14,X7)
| ~ in(X15,X8)
| X13 != ordered_pair(X14,X15)
| in(X13,X9)
| X9 != cartesian_product2(X7,X8) )
& ( ~ in(esk8_3(X16,X17,X18),X18)
| ~ in(X20,X16)
| ~ in(X21,X17)
| esk8_3(X16,X17,X18) != ordered_pair(X20,X21)
| X18 = cartesian_product2(X16,X17) )
& ( in(esk9_3(X16,X17,X18),X16)
| in(esk8_3(X16,X17,X18),X18)
| X18 = cartesian_product2(X16,X17) )
& ( in(esk10_3(X16,X17,X18),X17)
| in(esk8_3(X16,X17,X18),X18)
| X18 = cartesian_product2(X16,X17) )
& ( esk8_3(X16,X17,X18) = ordered_pair(esk9_3(X16,X17,X18),esk10_3(X16,X17,X18))
| in(esk8_3(X16,X17,X18),X18)
| X18 = cartesian_product2(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])])])])]) ).
fof(c_0_117,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X9,X5)
| ~ in(X9,X6)
| in(X9,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk12_3(X10,X11,X12),X12)
| ~ in(esk12_3(X10,X11,X12),X10)
| ~ in(esk12_3(X10,X11,X12),X11)
| X12 = set_intersection2(X10,X11) )
& ( in(esk12_3(X10,X11,X12),X10)
| in(esk12_3(X10,X11,X12),X12)
| X12 = set_intersection2(X10,X11) )
& ( in(esk12_3(X10,X11,X12),X11)
| in(esk12_3(X10,X11,X12),X12)
| X12 = set_intersection2(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])])])]) ).
fof(c_0_118,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X6)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X9,X5)
| in(X9,X6)
| in(X9,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(esk16_3(X10,X11,X12),X12)
| ~ in(esk16_3(X10,X11,X12),X10)
| in(esk16_3(X10,X11,X12),X11)
| X12 = set_difference(X10,X11) )
& ( in(esk16_3(X10,X11,X12),X10)
| in(esk16_3(X10,X11,X12),X12)
| X12 = set_difference(X10,X11) )
& ( ~ in(esk16_3(X10,X11,X12),X11)
| in(esk16_3(X10,X11,X12),X12)
| X12 = set_difference(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])])])])]) ).
fof(c_0_119,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( ~ in(X8,X7)
| in(X8,X5)
| in(X8,X6)
| X7 != set_union2(X5,X6) )
& ( ~ in(X9,X5)
| in(X9,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(X9,X6)
| in(X9,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(esk5_3(X10,X11,X12),X10)
| ~ in(esk5_3(X10,X11,X12),X12)
| X12 = set_union2(X10,X11) )
& ( ~ in(esk5_3(X10,X11,X12),X11)
| ~ in(esk5_3(X10,X11,X12),X12)
| X12 = set_union2(X10,X11) )
& ( in(esk5_3(X10,X11,X12),X12)
| in(esk5_3(X10,X11,X12),X10)
| in(esk5_3(X10,X11,X12),X11)
| X12 = set_union2(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])])])])]) ).
fof(c_0_120,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X9 != X5
| in(X9,X7)
| X7 != unordered_pair(X5,X6) )
& ( X9 != X6
| in(X9,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk4_3(X10,X11,X12) != X10
| ~ in(esk4_3(X10,X11,X12),X12)
| X12 = unordered_pair(X10,X11) )
& ( esk4_3(X10,X11,X12) != X11
| ~ in(esk4_3(X10,X11,X12),X12)
| X12 = unordered_pair(X10,X11) )
& ( in(esk4_3(X10,X11,X12),X12)
| esk4_3(X10,X11,X12) = X10
| esk4_3(X10,X11,X12) = X11
| X12 = unordered_pair(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])])])])])]) ).
fof(c_0_121,plain,
! [X5,X6,X7,X9,X10,X11,X12,X14] :
( ( in(X7,esk13_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != union(X5) )
& ( in(esk13_3(X5,X6,X7),X5)
| ~ in(X7,X6)
| X6 != union(X5) )
& ( ~ in(X9,X10)
| ~ in(X10,X5)
| in(X9,X6)
| X6 != union(X5) )
& ( ~ in(esk14_2(X11,X12),X12)
| ~ in(esk14_2(X11,X12),X14)
| ~ in(X14,X11)
| X12 = union(X11) )
& ( in(esk14_2(X11,X12),esk15_2(X11,X12))
| in(esk14_2(X11,X12),X12)
| X12 = union(X11) )
& ( in(esk15_2(X11,X12),X11)
| in(esk14_2(X11,X12),X12)
| X12 = union(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])])])])])]) ).
fof(c_0_122,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ in(X6,X5)
| subset(X6,X4)
| X5 != powerset(X4) )
& ( ~ subset(X7,X4)
| in(X7,X5)
| X5 != powerset(X4) )
& ( ~ in(esk3_2(X8,X9),X9)
| ~ subset(esk3_2(X8,X9),X8)
| X9 = powerset(X8) )
& ( in(esk3_2(X8,X9),X9)
| subset(esk3_2(X8,X9),X8)
| X9 = powerset(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])])])])])]) ).
fof(c_0_123,plain,
! [X4,X5] :
( ( ~ in(esk22_2(X4,X5),X4)
| ~ in(esk22_2(X4,X5),X5)
| X4 = X5 )
& ( in(esk22_2(X4,X5),X4)
| in(esk22_2(X4,X5),X5)
| X4 = X5 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])])]) ).
fof(c_0_124,plain,
! [X6,X8,X9,X10,X12,X13] :
( in(X6,esk23_1(X6))
& ( ~ in(X8,esk23_1(X6))
| ~ subset(X9,X8)
| in(X9,esk23_1(X6)) )
& ( in(esk24_2(X6,X10),esk23_1(X6))
| ~ in(X10,esk23_1(X6)) )
& ( ~ subset(X12,X10)
| in(X12,esk24_2(X6,X10))
| ~ in(X10,esk23_1(X6)) )
& ( ~ subset(X13,esk23_1(X6))
| are_equipotent(X13,esk23_1(X6))
| in(X13,esk23_1(X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_66])])])])]) ).
fof(c_0_125,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X7 != X4
| in(X7,X5)
| X5 != singleton(X4) )
& ( ~ in(esk1_2(X8,X9),X9)
| esk1_2(X8,X9) != X8
| X9 = singleton(X8) )
& ( in(esk1_2(X8,X9),X9)
| esk1_2(X8,X9) = X8
| X9 = singleton(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_67])])])])])]) ).
fof(c_0_126,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| element(subset_complement(X3,X4),powerset(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])]) ).
fof(c_0_127,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk11_2(X7,X8),X7)
| subset(X7,X8) )
& ( ~ in(esk11_2(X7,X8),X8)
| subset(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_69])])])])])]) ).
fof(c_0_128,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| subset_complement(X3,subset_complement(X3,X4)) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])]) ).
fof(c_0_129,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| subset_complement(X3,X4) = set_difference(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_71])]) ).
fof(c_0_130,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[c_0_72]) ).
fof(c_0_131,plain,
! [X3,X4] :
( empty(X3)
| ~ empty(set_union2(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])])]) ).
fof(c_0_132,plain,
! [X3,X4] :
( empty(X3)
| ~ empty(set_union2(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_74])])])]) ).
fof(c_0_133,plain,
! [X3,X4] : ~ empty(ordered_pair(X3,X4)),
inference(variable_rename,[status(thm)],[c_0_75]) ).
fof(c_0_134,plain,
! [X3,X4,X5,X6] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X5,X6)
| ~ subset(X6,X5)
| X5 = X6 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_76])])])])]) ).
fof(c_0_135,plain,
! [X3,X4] :
( ~ proper_subset(X3,X4)
| ~ proper_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_77])]) ).
fof(c_0_136,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_78])]) ).
fof(c_0_137,plain,
! [X3,X4,X5,X6,X7,X8] :
( ( ~ element(X4,X3)
| in(X4,X3)
| empty(X3) )
& ( ~ in(X5,X3)
| element(X5,X3)
| empty(X3) )
& ( ~ element(X7,X6)
| empty(X7)
| ~ empty(X6) )
& ( ~ empty(X8)
| element(X8,X6)
| ~ empty(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_79])])])])]) ).
fof(c_0_138,plain,
! [X3,X4,X5,X6] :
( ( subset(X3,X4)
| ~ proper_subset(X3,X4) )
& ( X3 != X4
| ~ proper_subset(X3,X4) )
& ( ~ subset(X5,X6)
| X5 = X6
| proper_subset(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_80])])])])]) ).
fof(c_0_139,plain,
! [X3,X4] :
( ~ disjoint(X3,X4)
| disjoint(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_81])]) ).
fof(c_0_140,plain,
! [X3,X4,X5,X6] :
( ( ~ disjoint(X3,X4)
| set_intersection2(X3,X4) = empty_set )
& ( set_intersection2(X5,X6) != empty_set
| disjoint(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_82])])])]) ).
fof(c_0_141,plain,
! [X3] :
( ( element(esk18_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk18_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_83])])])]) ).
fof(c_0_142,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_84])]) ).
fof(c_0_143,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[c_0_85]) ).
fof(c_0_144,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[c_0_86]) ).
fof(c_0_145,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[c_0_87]) ).
fof(c_0_146,plain,
! [X3] :
( element(esk20_1(X3),powerset(X3))
& empty(esk20_1(X3)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_88])]) ).
fof(c_0_147,plain,
! [X3,X4,X5] :
( ( X3 != empty_set
| ~ in(X4,X3) )
& ( in(esk2_1(X5),X5)
| X5 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_89])])])])]) ).
fof(c_0_148,plain,
! [X3,X4] : ~ proper_subset(X3,X3),
inference(variable_rename,[status(thm)],[c_0_90]) ).
fof(c_0_149,plain,
! [X3] : element(esk17_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_91])]) ).
fof(c_0_150,plain,
! [X2] : ~ empty(powerset(X2)),
inference(variable_rename,[status(thm)],[c_0_92]) ).
fof(c_0_151,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_93])])])]) ).
fof(c_0_152,plain,
! [X3,X4] : set_intersection2(X3,X3) = X3,
inference(variable_rename,[status(thm)],[c_0_94]) ).
fof(c_0_153,plain,
! [X3,X4] : set_union2(X3,X3) = X3,
inference(variable_rename,[status(thm)],[c_0_95]) ).
fof(c_0_154,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[c_0_96]) ).
fof(c_0_155,plain,
! [X2] : set_difference(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[c_0_97]) ).
fof(c_0_156,plain,
! [X2] : set_union2(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[c_0_98]) ).
fof(c_0_157,plain,
! [X2] : set_difference(empty_set,X2) = empty_set,
inference(variable_rename,[status(thm)],[c_0_99]) ).
fof(c_0_158,plain,
! [X2] : set_intersection2(X2,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[c_0_100]) ).
fof(c_0_159,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_101])]) ).
fof(c_0_160,plain,
~ empty(esk21_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_102])]) ).
fof(c_0_161,plain,
empty(esk19_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_103])]) ).
fof(c_0_162,axiom,
empty(empty_set),
c_0_104 ).
fof(c_0_163,axiom,
$true,
c_0_105 ).
fof(c_0_164,axiom,
$true,
c_0_106 ).
fof(c_0_165,axiom,
$true,
c_0_107 ).
fof(c_0_166,axiom,
$true,
c_0_108 ).
fof(c_0_167,axiom,
$true,
c_0_109 ).
fof(c_0_168,axiom,
$true,
c_0_110 ).
fof(c_0_169,axiom,
$true,
c_0_111 ).
fof(c_0_170,axiom,
$true,
c_0_112 ).
fof(c_0_171,axiom,
$true,
c_0_113 ).
fof(c_0_172,axiom,
$true,
c_0_114 ).
fof(c_0_173,axiom,
$true,
c_0_115 ).
cnf(c_0_174,plain,
( X4 = ordered_pair(esk6_4(X2,X3,X1,X4),esk7_4(X2,X3,X1,X4))
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_175,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk12_3(X2,X3,X1),X3)
| ~ in(esk12_3(X2,X3,X1),X2)
| ~ in(esk12_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_176,plain,
( in(esk6_4(X2,X3,X1,X4),X2)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_177,plain,
( in(esk7_4(X2,X3,X1,X4),X3)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_178,plain,
( X1 = set_difference(X2,X3)
| in(esk16_3(X2,X3,X1),X3)
| ~ in(esk16_3(X2,X3,X1),X2)
| ~ in(esk16_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_179,plain,
( X1 = cartesian_product2(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| esk8_3(X2,X3,X1) = ordered_pair(esk9_3(X2,X3,X1),esk10_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_180,plain,
( X1 = set_union2(X2,X3)
| ~ in(esk5_3(X2,X3,X1),X1)
| ~ in(esk5_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_181,plain,
( X1 = set_union2(X2,X3)
| ~ in(esk5_3(X2,X3,X1),X1)
| ~ in(esk5_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_182,plain,
( X1 = set_union2(X2,X3)
| in(esk5_3(X2,X3,X1),X3)
| in(esk5_3(X2,X3,X1),X2)
| in(esk5_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_183,plain,
( X1 = cartesian_product2(X2,X3)
| esk8_3(X2,X3,X1) != ordered_pair(X4,X5)
| ~ in(X5,X3)
| ~ in(X4,X2)
| ~ in(esk8_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_184,plain,
( X1 = set_difference(X2,X3)
| in(esk16_3(X2,X3,X1),X1)
| ~ in(esk16_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_185,plain,
( X1 = unordered_pair(X2,X3)
| ~ in(esk4_3(X2,X3,X1),X1)
| esk4_3(X2,X3,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_186,plain,
( X1 = unordered_pair(X2,X3)
| ~ in(esk4_3(X2,X3,X1),X1)
| esk4_3(X2,X3,X1) != X3 ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_187,plain,
( X1 = set_difference(X2,X3)
| in(esk16_3(X2,X3,X1),X1)
| in(esk16_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_188,plain,
( X1 = set_intersection2(X2,X3)
| in(esk12_3(X2,X3,X1),X1)
| in(esk12_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_189,plain,
( X1 = set_intersection2(X2,X3)
| in(esk12_3(X2,X3,X1),X1)
| in(esk12_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_190,plain,
( X1 = cartesian_product2(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| in(esk9_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_191,plain,
( X1 = cartesian_product2(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| in(esk10_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_192,plain,
( X1 = unordered_pair(X2,X3)
| esk4_3(X2,X3,X1) = X3
| esk4_3(X2,X3,X1) = X2
| in(esk4_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_193,plain,
( X1 = union(X2)
| ~ in(X3,X2)
| ~ in(esk14_2(X2,X1),X3)
| ~ in(esk14_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_194,plain,
( in(X3,esk13_3(X2,X1,X3))
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_195,plain,
( in(esk13_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_196,plain,
( X1 = powerset(X2)
| ~ subset(esk3_2(X2,X1),X2)
| ~ in(esk3_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_197,plain,
( X1 = X2
| ~ in(esk22_2(X1,X2),X2)
| ~ in(esk22_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_198,plain,
( X1 = union(X2)
| in(esk14_2(X2,X1),X1)
| in(esk14_2(X2,X1),esk15_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_199,plain,
( in(X4,X1)
| X1 != cartesian_product2(X2,X3)
| X4 != ordered_pair(X5,X6)
| ~ in(X6,X3)
| ~ in(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_200,plain,
( in(X3,esk24_2(X2,X1))
| ~ in(X1,esk23_1(X2))
| ~ subset(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_201,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) != X2
| ~ in(esk1_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_202,plain,
( X1 = union(X2)
| in(esk14_2(X2,X1),X1)
| in(esk15_2(X2,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_203,plain,
( X1 = powerset(X2)
| subset(esk3_2(X2,X1),X2)
| in(esk3_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_204,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_205,plain,
( X1 = X2
| in(esk22_2(X1,X2),X2)
| in(esk22_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_206,plain,
( in(esk24_2(X2,X1),esk23_1(X2))
| ~ in(X1,esk23_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_207,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_208,plain,
( subset(X1,X2)
| ~ in(esk11_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_209,plain,
( in(X1,esk23_1(X2))
| ~ subset(X1,X3)
| ~ in(X3,esk23_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_210,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_211,plain,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_212,plain,
( in(X1,esk23_1(X2))
| are_equipotent(X1,esk23_1(X2))
| ~ subset(X1,esk23_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_213,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_214,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_215,plain,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_216,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_217,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_218,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_219,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_220,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_221,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) = X2
| in(esk1_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_222,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_129]) ).
cnf(c_0_223,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_130]) ).
cnf(c_0_224,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_225,plain,
( subset(X1,X2)
| in(esk11_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_226,plain,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_131]) ).
cnf(c_0_227,plain,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_132]) ).
cnf(c_0_228,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_229,plain,
~ empty(ordered_pair(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_133]) ).
cnf(c_0_230,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_231,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_232,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_233,plain,
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_135]) ).
cnf(c_0_234,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_136]) ).
cnf(c_0_235,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_236,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_237,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_238,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_239,plain,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_138]) ).
cnf(c_0_240,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_139]) ).
cnf(c_0_241,plain,
( subset(X1,X2)
| ~ proper_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_138]) ).
cnf(c_0_242,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_243,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_244,plain,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_245,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_246,plain,
( empty(X1)
| element(esk18_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_141]) ).
cnf(c_0_247,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_142]) ).
cnf(c_0_248,plain,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_249,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_143]) ).
cnf(c_0_250,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_144]) ).
cnf(c_0_251,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_145]) ).
cnf(c_0_252,plain,
element(esk20_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_253,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_254,plain,
( ~ proper_subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_138]) ).
cnf(c_0_255,plain,
( ~ in(X1,X2)
| X2 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_256,plain,
~ proper_subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_148]) ).
cnf(c_0_257,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_258,plain,
( empty(X1)
| ~ empty(esk18_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_141]) ).
cnf(c_0_259,plain,
in(X1,esk23_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_260,plain,
element(esk17_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_149]) ).
cnf(c_0_261,plain,
( subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_262,plain,
( subset(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_263,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_150]) ).
cnf(c_0_264,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_151]) ).
cnf(c_0_265,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_152]) ).
cnf(c_0_266,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_267,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_154]) ).
cnf(c_0_268,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_155]) ).
cnf(c_0_269,plain,
set_union2(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_156]) ).
cnf(c_0_270,plain,
set_difference(empty_set,X1) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_157]) ).
cnf(c_0_271,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_158]) ).
cnf(c_0_272,plain,
empty(esk20_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_273,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_159]) ).
cnf(c_0_274,plain,
~ empty(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_160]) ).
cnf(c_0_275,plain,
empty(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_161]) ).
cnf(c_0_276,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[c_0_162]) ).
cnf(c_0_277,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_163]) ).
cnf(c_0_278,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_279,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_165]) ).
cnf(c_0_280,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_166]) ).
cnf(c_0_281,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_167]) ).
cnf(c_0_282,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_168]) ).
cnf(c_0_283,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_169]) ).
cnf(c_0_284,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_170]) ).
cnf(c_0_285,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_171]) ).
cnf(c_0_286,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_172]) ).
cnf(c_0_287,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_173]) ).
cnf(c_0_288,plain,
( ordered_pair(esk6_4(X2,X3,X1,X4),esk7_4(X2,X3,X1,X4)) = X4
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
c_0_174,
[final] ).
cnf(c_0_289,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk12_3(X2,X3,X1),X3)
| ~ in(esk12_3(X2,X3,X1),X2)
| ~ in(esk12_3(X2,X3,X1),X1) ),
c_0_175,
[final] ).
cnf(c_0_290,plain,
( in(esk6_4(X2,X3,X1,X4),X2)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
c_0_176,
[final] ).
cnf(c_0_291,plain,
( in(esk7_4(X2,X3,X1,X4),X3)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
c_0_177,
[final] ).
cnf(c_0_292,plain,
( X1 = set_difference(X2,X3)
| in(esk16_3(X2,X3,X1),X3)
| ~ in(esk16_3(X2,X3,X1),X2)
| ~ in(esk16_3(X2,X3,X1),X1) ),
c_0_178,
[final] ).
cnf(c_0_293,plain,
( X1 = cartesian_product2(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| ordered_pair(esk9_3(X2,X3,X1),esk10_3(X2,X3,X1)) = esk8_3(X2,X3,X1) ),
c_0_179,
[final] ).
cnf(c_0_294,plain,
( X1 = set_union2(X2,X3)
| ~ in(esk5_3(X2,X3,X1),X1)
| ~ in(esk5_3(X2,X3,X1),X2) ),
c_0_180,
[final] ).
cnf(c_0_295,plain,
( X1 = set_union2(X2,X3)
| ~ in(esk5_3(X2,X3,X1),X1)
| ~ in(esk5_3(X2,X3,X1),X3) ),
c_0_181,
[final] ).
cnf(c_0_296,plain,
( X1 = set_union2(X2,X3)
| in(esk5_3(X2,X3,X1),X3)
| in(esk5_3(X2,X3,X1),X2)
| in(esk5_3(X2,X3,X1),X1) ),
c_0_182,
[final] ).
cnf(c_0_297,plain,
( X1 = cartesian_product2(X2,X3)
| esk8_3(X2,X3,X1) != ordered_pair(X4,X5)
| ~ in(X5,X3)
| ~ in(X4,X2)
| ~ in(esk8_3(X2,X3,X1),X1) ),
c_0_183,
[final] ).
cnf(c_0_298,plain,
( X1 = set_difference(X2,X3)
| in(esk16_3(X2,X3,X1),X1)
| ~ in(esk16_3(X2,X3,X1),X3) ),
c_0_184,
[final] ).
cnf(c_0_299,plain,
( X1 = unordered_pair(X2,X3)
| ~ in(esk4_3(X2,X3,X1),X1)
| esk4_3(X2,X3,X1) != X2 ),
c_0_185,
[final] ).
cnf(c_0_300,plain,
( X1 = unordered_pair(X2,X3)
| ~ in(esk4_3(X2,X3,X1),X1)
| esk4_3(X2,X3,X1) != X3 ),
c_0_186,
[final] ).
cnf(c_0_301,plain,
( X1 = set_difference(X2,X3)
| in(esk16_3(X2,X3,X1),X1)
| in(esk16_3(X2,X3,X1),X2) ),
c_0_187,
[final] ).
cnf(c_0_302,plain,
( X1 = set_intersection2(X2,X3)
| in(esk12_3(X2,X3,X1),X1)
| in(esk12_3(X2,X3,X1),X2) ),
c_0_188,
[final] ).
cnf(c_0_303,plain,
( X1 = set_intersection2(X2,X3)
| in(esk12_3(X2,X3,X1),X1)
| in(esk12_3(X2,X3,X1),X3) ),
c_0_189,
[final] ).
cnf(c_0_304,plain,
( X1 = cartesian_product2(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| in(esk9_3(X2,X3,X1),X2) ),
c_0_190,
[final] ).
cnf(c_0_305,plain,
( X1 = cartesian_product2(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| in(esk10_3(X2,X3,X1),X3) ),
c_0_191,
[final] ).
cnf(c_0_306,plain,
( X1 = unordered_pair(X2,X3)
| esk4_3(X2,X3,X1) = X3
| esk4_3(X2,X3,X1) = X2
| in(esk4_3(X2,X3,X1),X1) ),
c_0_192,
[final] ).
cnf(c_0_307,plain,
( X1 = union(X2)
| ~ in(X3,X2)
| ~ in(esk14_2(X2,X1),X3)
| ~ in(esk14_2(X2,X1),X1) ),
c_0_193,
[final] ).
cnf(c_0_308,plain,
( in(X3,esk13_3(X2,X1,X3))
| X1 != union(X2)
| ~ in(X3,X1) ),
c_0_194,
[final] ).
cnf(c_0_309,plain,
( in(esk13_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
c_0_195,
[final] ).
cnf(c_0_310,plain,
( X1 = powerset(X2)
| ~ subset(esk3_2(X2,X1),X2)
| ~ in(esk3_2(X2,X1),X1) ),
c_0_196,
[final] ).
cnf(c_0_311,plain,
( X1 = X2
| ~ in(esk22_2(X1,X2),X2)
| ~ in(esk22_2(X1,X2),X1) ),
c_0_197,
[final] ).
cnf(c_0_312,plain,
( X1 = union(X2)
| in(esk14_2(X2,X1),X1)
| in(esk14_2(X2,X1),esk15_2(X2,X1)) ),
c_0_198,
[final] ).
cnf(c_0_313,plain,
( in(X4,X1)
| X1 != cartesian_product2(X2,X3)
| X4 != ordered_pair(X5,X6)
| ~ in(X6,X3)
| ~ in(X5,X2) ),
c_0_199,
[final] ).
cnf(c_0_314,plain,
( in(X3,esk24_2(X2,X1))
| ~ in(X1,esk23_1(X2))
| ~ subset(X3,X1) ),
c_0_200,
[final] ).
cnf(c_0_315,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) != X2
| ~ in(esk1_2(X2,X1),X1) ),
c_0_201,
[final] ).
cnf(c_0_316,plain,
( X1 = union(X2)
| in(esk14_2(X2,X1),X1)
| in(esk15_2(X2,X1),X2) ),
c_0_202,
[final] ).
cnf(c_0_317,plain,
( X1 = powerset(X2)
| subset(esk3_2(X2,X1),X2)
| in(esk3_2(X2,X1),X1) ),
c_0_203,
[final] ).
cnf(c_0_318,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
c_0_204,
[final] ).
cnf(c_0_319,plain,
( X1 = X2
| in(esk22_2(X1,X2),X2)
| in(esk22_2(X1,X2),X1) ),
c_0_205,
[final] ).
cnf(c_0_320,plain,
( in(esk24_2(X2,X1),esk23_1(X2))
| ~ in(X1,esk23_1(X2)) ),
c_0_206,
[final] ).
cnf(c_0_321,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
c_0_207,
[final] ).
cnf(c_0_322,plain,
( subset(X1,X2)
| ~ in(esk11_2(X1,X2),X2) ),
c_0_208,
[final] ).
cnf(c_0_323,plain,
( in(X1,esk23_1(X2))
| ~ subset(X1,X3)
| ~ in(X3,esk23_1(X2)) ),
c_0_209,
[final] ).
cnf(c_0_324,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
c_0_210,
[final] ).
cnf(c_0_325,plain,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
c_0_211,
[final] ).
cnf(c_0_326,plain,
( in(X1,esk23_1(X2))
| are_equipotent(X1,esk23_1(X2))
| ~ subset(X1,esk23_1(X2)) ),
c_0_212,
[final] ).
cnf(c_0_327,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
c_0_213,
[final] ).
cnf(c_0_328,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
c_0_214,
[final] ).
cnf(c_0_329,plain,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
c_0_215,
[final] ).
cnf(c_0_330,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
c_0_216,
[final] ).
cnf(c_0_331,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
c_0_217,
[final] ).
cnf(c_0_332,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
c_0_218,
[final] ).
cnf(c_0_333,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X2) ),
c_0_219,
[final] ).
cnf(c_0_334,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X3) ),
c_0_220,
[final] ).
cnf(c_0_335,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) = X2
| in(esk1_2(X2,X1),X1) ),
c_0_221,
[final] ).
cnf(c_0_336,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
c_0_222,
[final] ).
cnf(c_0_337,plain,
unordered_pair(unordered_pair(X1,X2),singleton(X1)) = ordered_pair(X1,X2),
c_0_223,
[final] ).
cnf(c_0_338,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
c_0_224,
[final] ).
cnf(c_0_339,plain,
( subset(X1,X2)
| in(esk11_2(X1,X2),X1) ),
c_0_225,
[final] ).
cnf(c_0_340,plain,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
c_0_226,
[final] ).
cnf(c_0_341,plain,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
c_0_227,
[final] ).
cnf(c_0_342,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
c_0_228,
[final] ).
cnf(c_0_343,plain,
~ empty(ordered_pair(X1,X2)),
c_0_229,
[final] ).
cnf(c_0_344,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_230,
[final] ).
cnf(c_0_345,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
c_0_231,
[final] ).
cnf(c_0_346,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
c_0_232,
[final] ).
cnf(c_0_347,plain,
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
c_0_233,
[final] ).
cnf(c_0_348,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_234,
[final] ).
cnf(c_0_349,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
c_0_235,
[final] ).
cnf(c_0_350,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
c_0_236,
[final] ).
cnf(c_0_351,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
c_0_237,
[final] ).
cnf(c_0_352,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
c_0_238,
[final] ).
cnf(c_0_353,plain,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
c_0_239,
[final] ).
cnf(c_0_354,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
c_0_240,
[final] ).
cnf(c_0_355,plain,
( subset(X1,X2)
| ~ proper_subset(X1,X2) ),
c_0_241,
[final] ).
cnf(c_0_356,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
c_0_242,
[final] ).
cnf(c_0_357,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
c_0_243,
[final] ).
cnf(c_0_358,plain,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
c_0_244,
[final] ).
cnf(c_0_359,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
c_0_245,
[final] ).
cnf(c_0_360,plain,
( empty(X1)
| element(esk18_1(X1),powerset(X1)) ),
c_0_246,
[final] ).
cnf(c_0_361,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
c_0_247,
[final] ).
cnf(c_0_362,plain,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
c_0_248,
[final] ).
cnf(c_0_363,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
c_0_249,
[final] ).
cnf(c_0_364,plain,
set_union2(X1,X2) = set_union2(X2,X1),
c_0_250,
[final] ).
cnf(c_0_365,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
c_0_251,
[final] ).
cnf(c_0_366,plain,
element(esk20_1(X1),powerset(X1)),
c_0_252,
[final] ).
cnf(c_0_367,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
c_0_253,
[final] ).
cnf(c_0_368,plain,
( ~ proper_subset(X1,X2)
| X1 != X2 ),
c_0_254,
[final] ).
cnf(c_0_369,plain,
( ~ in(X1,X2)
| X2 != empty_set ),
c_0_255,
[final] ).
cnf(c_0_370,plain,
~ proper_subset(X1,X1),
c_0_256,
[final] ).
cnf(c_0_371,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
c_0_257,
[final] ).
cnf(c_0_372,plain,
( empty(X1)
| ~ empty(esk18_1(X1)) ),
c_0_258,
[final] ).
cnf(c_0_373,plain,
in(X1,esk23_1(X1)),
c_0_259,
[final] ).
cnf(c_0_374,plain,
element(esk17_1(X1),X1),
c_0_260,
[final] ).
cnf(c_0_375,plain,
( subset(X1,X2)
| X1 != X2 ),
c_0_261,
[final] ).
cnf(c_0_376,plain,
( subset(X2,X1)
| X1 != X2 ),
c_0_262,
[final] ).
cnf(c_0_377,plain,
~ empty(powerset(X1)),
c_0_263,
[final] ).
cnf(c_0_378,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
c_0_264,
[final] ).
cnf(c_0_379,plain,
set_intersection2(X1,X1) = X1,
c_0_265,
[final] ).
cnf(c_0_380,plain,
set_union2(X1,X1) = X1,
c_0_266,
[final] ).
cnf(c_0_381,plain,
subset(X1,X1),
c_0_267,
[final] ).
cnf(c_0_382,plain,
set_difference(X1,empty_set) = X1,
c_0_268,
[final] ).
cnf(c_0_383,plain,
set_union2(X1,empty_set) = X1,
c_0_269,
[final] ).
cnf(c_0_384,plain,
set_difference(empty_set,X1) = empty_set,
c_0_270,
[final] ).
cnf(c_0_385,plain,
set_intersection2(X1,empty_set) = empty_set,
c_0_271,
[final] ).
cnf(c_0_386,plain,
empty(esk20_1(X1)),
c_0_272,
[final] ).
cnf(c_0_387,plain,
( X1 = empty_set
| ~ empty(X1) ),
c_0_273,
[final] ).
cnf(c_0_388,plain,
~ empty(esk21_0),
c_0_274,
[final] ).
cnf(c_0_389,plain,
empty(esk19_0),
c_0_275,
[final] ).
cnf(c_0_390,plain,
empty(empty_set),
c_0_276,
[final] ).
cnf(c_0_391,plain,
$true,
c_0_277,
[final] ).
cnf(c_0_392,plain,
$true,
c_0_278,
[final] ).
cnf(c_0_393,plain,
$true,
c_0_279,
[final] ).
cnf(c_0_394,plain,
$true,
c_0_280,
[final] ).
cnf(c_0_395,plain,
$true,
c_0_281,
[final] ).
cnf(c_0_396,plain,
$true,
c_0_282,
[final] ).
cnf(c_0_397,plain,
$true,
c_0_283,
[final] ).
cnf(c_0_398,plain,
$true,
c_0_284,
[final] ).
cnf(c_0_399,plain,
$true,
c_0_285,
[final] ).
cnf(c_0_400,plain,
$true,
c_0_286,
[final] ).
cnf(c_0_401,plain,
$true,
c_0_287,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_288_0,axiom,
( ordered_pair(sk1_esk6_4(X2,X3,X1,X4),sk1_esk7_4(X2,X3,X1,X4)) = X4
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_288_1,axiom,
( X1 != cartesian_product2(X2,X3)
| ordered_pair(sk1_esk6_4(X2,X3,X1,X4),sk1_esk7_4(X2,X3,X1,X4)) = X4
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_288_2,axiom,
( ~ in(X4,X1)
| X1 != cartesian_product2(X2,X3)
| ordered_pair(sk1_esk6_4(X2,X3,X1,X4),sk1_esk7_4(X2,X3,X1,X4)) = X4 ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_289_0,axiom,
( X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk12_3(X2,X3,X1),X3)
| ~ in(sk1_esk12_3(X2,X3,X1),X2)
| ~ in(sk1_esk12_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_289_1,axiom,
( ~ in(sk1_esk12_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk12_3(X2,X3,X1),X2)
| ~ in(sk1_esk12_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_289_2,axiom,
( ~ in(sk1_esk12_3(X2,X3,X1),X2)
| ~ in(sk1_esk12_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk12_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_289_3,axiom,
( ~ in(sk1_esk12_3(X2,X3,X1),X1)
| ~ in(sk1_esk12_3(X2,X3,X1),X2)
| ~ in(sk1_esk12_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_290_0,axiom,
( in(sk1_esk6_4(X2,X3,X1,X4),X2)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_290_1,axiom,
( X1 != cartesian_product2(X2,X3)
| in(sk1_esk6_4(X2,X3,X1,X4),X2)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_290_2,axiom,
( ~ in(X4,X1)
| X1 != cartesian_product2(X2,X3)
| in(sk1_esk6_4(X2,X3,X1,X4),X2) ),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_291_0,axiom,
( in(sk1_esk7_4(X2,X3,X1,X4),X3)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_291_1,axiom,
( X1 != cartesian_product2(X2,X3)
| in(sk1_esk7_4(X2,X3,X1,X4),X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_291_2,axiom,
( ~ in(X4,X1)
| X1 != cartesian_product2(X2,X3)
| in(sk1_esk7_4(X2,X3,X1,X4),X3) ),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_292_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk16_3(X2,X3,X1),X3)
| ~ in(sk1_esk16_3(X2,X3,X1),X2)
| ~ in(sk1_esk16_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_1,axiom,
( in(sk1_esk16_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk16_3(X2,X3,X1),X2)
| ~ in(sk1_esk16_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_2,axiom,
( ~ in(sk1_esk16_3(X2,X3,X1),X2)
| in(sk1_esk16_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk16_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_292_3,axiom,
( ~ in(sk1_esk16_3(X2,X3,X1),X1)
| ~ in(sk1_esk16_3(X2,X3,X1),X2)
| in(sk1_esk16_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_293_0,axiom,
( X1 = cartesian_product2(X2,X3)
| in(sk1_esk8_3(X2,X3,X1),X1)
| ordered_pair(sk1_esk9_3(X2,X3,X1),sk1_esk10_3(X2,X3,X1)) = sk1_esk8_3(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_1,axiom,
( in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = cartesian_product2(X2,X3)
| ordered_pair(sk1_esk9_3(X2,X3,X1),sk1_esk10_3(X2,X3,X1)) = sk1_esk8_3(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_2,axiom,
( ordered_pair(sk1_esk9_3(X2,X3,X1),sk1_esk10_3(X2,X3,X1)) = sk1_esk8_3(X2,X3,X1)
| in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = cartesian_product2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_294_0,axiom,
( X1 = set_union2(X2,X3)
| ~ in(sk1_esk5_3(X2,X3,X1),X1)
| ~ in(sk1_esk5_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_1,axiom,
( ~ in(sk1_esk5_3(X2,X3,X1),X1)
| X1 = set_union2(X2,X3)
| ~ in(sk1_esk5_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_2,axiom,
( ~ in(sk1_esk5_3(X2,X3,X1),X2)
| ~ in(sk1_esk5_3(X2,X3,X1),X1)
| X1 = set_union2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_295_0,axiom,
( X1 = set_union2(X2,X3)
| ~ in(sk1_esk5_3(X2,X3,X1),X1)
| ~ in(sk1_esk5_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_1,axiom,
( ~ in(sk1_esk5_3(X2,X3,X1),X1)
| X1 = set_union2(X2,X3)
| ~ in(sk1_esk5_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_2,axiom,
( ~ in(sk1_esk5_3(X2,X3,X1),X3)
| ~ in(sk1_esk5_3(X2,X3,X1),X1)
| X1 = set_union2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_296_0,axiom,
( X1 = set_union2(X2,X3)
| in(sk1_esk5_3(X2,X3,X1),X3)
| in(sk1_esk5_3(X2,X3,X1),X2)
| in(sk1_esk5_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_296_1,axiom,
( in(sk1_esk5_3(X2,X3,X1),X3)
| X1 = set_union2(X2,X3)
| in(sk1_esk5_3(X2,X3,X1),X2)
| in(sk1_esk5_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_296_2,axiom,
( in(sk1_esk5_3(X2,X3,X1),X2)
| in(sk1_esk5_3(X2,X3,X1),X3)
| X1 = set_union2(X2,X3)
| in(sk1_esk5_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_296_3,axiom,
( in(sk1_esk5_3(X2,X3,X1),X1)
| in(sk1_esk5_3(X2,X3,X1),X2)
| in(sk1_esk5_3(X2,X3,X1),X3)
| X1 = set_union2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_297_0,axiom,
( X1 = cartesian_product2(X2,X3)
| sk1_esk8_3(X2,X3,X1) != ordered_pair(X4,X5)
| ~ in(X5,X3)
| ~ in(X4,X2)
| ~ in(sk1_esk8_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_1,axiom,
( sk1_esk8_3(X2,X3,X1) != ordered_pair(X4,X5)
| X1 = cartesian_product2(X2,X3)
| ~ in(X5,X3)
| ~ in(X4,X2)
| ~ in(sk1_esk8_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_2,axiom,
( ~ in(X5,X3)
| sk1_esk8_3(X2,X3,X1) != ordered_pair(X4,X5)
| X1 = cartesian_product2(X2,X3)
| ~ in(X4,X2)
| ~ in(sk1_esk8_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_3,axiom,
( ~ in(X4,X2)
| ~ in(X5,X3)
| sk1_esk8_3(X2,X3,X1) != ordered_pair(X4,X5)
| X1 = cartesian_product2(X2,X3)
| ~ in(sk1_esk8_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_4,axiom,
( ~ in(sk1_esk8_3(X2,X3,X1),X1)
| ~ in(X4,X2)
| ~ in(X5,X3)
| sk1_esk8_3(X2,X3,X1) != ordered_pair(X4,X5)
| X1 = cartesian_product2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_298_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk16_3(X2,X3,X1),X1)
| ~ in(sk1_esk16_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_298_1,axiom,
( in(sk1_esk16_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk16_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_298_2,axiom,
( ~ in(sk1_esk16_3(X2,X3,X1),X3)
| in(sk1_esk16_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_299_0,axiom,
( X1 = unordered_pair(X2,X3)
| ~ in(sk1_esk4_3(X2,X3,X1),X1)
| sk1_esk4_3(X2,X3,X1) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_299_1,axiom,
( ~ in(sk1_esk4_3(X2,X3,X1),X1)
| X1 = unordered_pair(X2,X3)
| sk1_esk4_3(X2,X3,X1) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_299_2,axiom,
( sk1_esk4_3(X2,X3,X1) != X2
| ~ in(sk1_esk4_3(X2,X3,X1),X1)
| X1 = unordered_pair(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_300_0,axiom,
( X1 = unordered_pair(X2,X3)
| ~ in(sk1_esk4_3(X2,X3,X1),X1)
| sk1_esk4_3(X2,X3,X1) != X3 ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_300_1,axiom,
( ~ in(sk1_esk4_3(X2,X3,X1),X1)
| X1 = unordered_pair(X2,X3)
| sk1_esk4_3(X2,X3,X1) != X3 ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_300_2,axiom,
( sk1_esk4_3(X2,X3,X1) != X3
| ~ in(sk1_esk4_3(X2,X3,X1),X1)
| X1 = unordered_pair(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_301_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk16_3(X2,X3,X1),X1)
| in(sk1_esk16_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_301_1,axiom,
( in(sk1_esk16_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3)
| in(sk1_esk16_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_301_2,axiom,
( in(sk1_esk16_3(X2,X3,X1),X2)
| in(sk1_esk16_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_302_0,axiom,
( X1 = set_intersection2(X2,X3)
| in(sk1_esk12_3(X2,X3,X1),X1)
| in(sk1_esk12_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_302_1,axiom,
( in(sk1_esk12_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3)
| in(sk1_esk12_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_302_2,axiom,
( in(sk1_esk12_3(X2,X3,X1),X2)
| in(sk1_esk12_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_303_0,axiom,
( X1 = set_intersection2(X2,X3)
| in(sk1_esk12_3(X2,X3,X1),X1)
| in(sk1_esk12_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_303_1,axiom,
( in(sk1_esk12_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3)
| in(sk1_esk12_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_303_2,axiom,
( in(sk1_esk12_3(X2,X3,X1),X3)
| in(sk1_esk12_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_304_0,axiom,
( X1 = cartesian_product2(X2,X3)
| in(sk1_esk8_3(X2,X3,X1),X1)
| in(sk1_esk9_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_304]) ).
cnf(c_0_304_1,axiom,
( in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = cartesian_product2(X2,X3)
| in(sk1_esk9_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_304]) ).
cnf(c_0_304_2,axiom,
( in(sk1_esk9_3(X2,X3,X1),X2)
| in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = cartesian_product2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_304]) ).
cnf(c_0_305_0,axiom,
( X1 = cartesian_product2(X2,X3)
| in(sk1_esk8_3(X2,X3,X1),X1)
| in(sk1_esk10_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_305_1,axiom,
( in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = cartesian_product2(X2,X3)
| in(sk1_esk10_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_305_2,axiom,
( in(sk1_esk10_3(X2,X3,X1),X3)
| in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = cartesian_product2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_306_0,axiom,
( X1 = unordered_pair(X2,X3)
| sk1_esk4_3(X2,X3,X1) = X3
| sk1_esk4_3(X2,X3,X1) = X2
| in(sk1_esk4_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
cnf(c_0_306_1,axiom,
( sk1_esk4_3(X2,X3,X1) = X3
| X1 = unordered_pair(X2,X3)
| sk1_esk4_3(X2,X3,X1) = X2
| in(sk1_esk4_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
cnf(c_0_306_2,axiom,
( sk1_esk4_3(X2,X3,X1) = X2
| sk1_esk4_3(X2,X3,X1) = X3
| X1 = unordered_pair(X2,X3)
| in(sk1_esk4_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
cnf(c_0_306_3,axiom,
( in(sk1_esk4_3(X2,X3,X1),X1)
| sk1_esk4_3(X2,X3,X1) = X2
| sk1_esk4_3(X2,X3,X1) = X3
| X1 = unordered_pair(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
cnf(c_0_307_0,axiom,
( X1 = union(X2)
| ~ in(X3,X2)
| ~ in(sk1_esk14_2(X2,X1),X3)
| ~ in(sk1_esk14_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_307_1,axiom,
( ~ in(X3,X2)
| X1 = union(X2)
| ~ in(sk1_esk14_2(X2,X1),X3)
| ~ in(sk1_esk14_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_307_2,axiom,
( ~ in(sk1_esk14_2(X2,X1),X3)
| ~ in(X3,X2)
| X1 = union(X2)
| ~ in(sk1_esk14_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_307_3,axiom,
( ~ in(sk1_esk14_2(X2,X1),X1)
| ~ in(sk1_esk14_2(X2,X1),X3)
| ~ in(X3,X2)
| X1 = union(X2) ),
inference(literals_permutation,[status(thm)],[c_0_307]) ).
cnf(c_0_308_0,axiom,
( in(X3,sk1_esk13_3(X2,X1,X3))
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_308_1,axiom,
( X1 != union(X2)
| in(X3,sk1_esk13_3(X2,X1,X3))
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_308_2,axiom,
( ~ in(X3,X1)
| X1 != union(X2)
| in(X3,sk1_esk13_3(X2,X1,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_308]) ).
cnf(c_0_309_0,axiom,
( in(sk1_esk13_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_309]) ).
cnf(c_0_309_1,axiom,
( X1 != union(X2)
| in(sk1_esk13_3(X2,X1,X3),X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_309]) ).
cnf(c_0_309_2,axiom,
( ~ in(X3,X1)
| X1 != union(X2)
| in(sk1_esk13_3(X2,X1,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_309]) ).
cnf(c_0_310_0,axiom,
( X1 = powerset(X2)
| ~ subset(sk1_esk3_2(X2,X1),X2)
| ~ in(sk1_esk3_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_310]) ).
cnf(c_0_310_1,axiom,
( ~ subset(sk1_esk3_2(X2,X1),X2)
| X1 = powerset(X2)
| ~ in(sk1_esk3_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_310]) ).
cnf(c_0_310_2,axiom,
( ~ in(sk1_esk3_2(X2,X1),X1)
| ~ subset(sk1_esk3_2(X2,X1),X2)
| X1 = powerset(X2) ),
inference(literals_permutation,[status(thm)],[c_0_310]) ).
cnf(c_0_311_0,axiom,
( X1 = X2
| ~ in(sk1_esk22_2(X1,X2),X2)
| ~ in(sk1_esk22_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_311_1,axiom,
( ~ in(sk1_esk22_2(X1,X2),X2)
| X1 = X2
| ~ in(sk1_esk22_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_311_2,axiom,
( ~ in(sk1_esk22_2(X1,X2),X1)
| ~ in(sk1_esk22_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_311]) ).
cnf(c_0_312_0,axiom,
( X1 = union(X2)
| in(sk1_esk14_2(X2,X1),X1)
| in(sk1_esk14_2(X2,X1),sk1_esk15_2(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_312_1,axiom,
( in(sk1_esk14_2(X2,X1),X1)
| X1 = union(X2)
| in(sk1_esk14_2(X2,X1),sk1_esk15_2(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_312_2,axiom,
( in(sk1_esk14_2(X2,X1),sk1_esk15_2(X2,X1))
| in(sk1_esk14_2(X2,X1),X1)
| X1 = union(X2) ),
inference(literals_permutation,[status(thm)],[c_0_312]) ).
cnf(c_0_313_0,axiom,
( in(X4,X1)
| X1 != cartesian_product2(X2,X3)
| X4 != ordered_pair(X5,X6)
| ~ in(X6,X3)
| ~ in(X5,X2) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_313_1,axiom,
( X1 != cartesian_product2(X2,X3)
| in(X4,X1)
| X4 != ordered_pair(X5,X6)
| ~ in(X6,X3)
| ~ in(X5,X2) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_313_2,axiom,
( X4 != ordered_pair(X5,X6)
| X1 != cartesian_product2(X2,X3)
| in(X4,X1)
| ~ in(X6,X3)
| ~ in(X5,X2) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_313_3,axiom,
( ~ in(X6,X3)
| X4 != ordered_pair(X5,X6)
| X1 != cartesian_product2(X2,X3)
| in(X4,X1)
| ~ in(X5,X2) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_313_4,axiom,
( ~ in(X5,X2)
| ~ in(X6,X3)
| X4 != ordered_pair(X5,X6)
| X1 != cartesian_product2(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_313]) ).
cnf(c_0_314_0,axiom,
( in(X3,sk1_esk24_2(X2,X1))
| ~ in(X1,sk1_esk23_1(X2))
| ~ subset(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_314]) ).
cnf(c_0_314_1,axiom,
( ~ in(X1,sk1_esk23_1(X2))
| in(X3,sk1_esk24_2(X2,X1))
| ~ subset(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_314]) ).
cnf(c_0_314_2,axiom,
( ~ subset(X3,X1)
| ~ in(X1,sk1_esk23_1(X2))
| in(X3,sk1_esk24_2(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_314]) ).
cnf(c_0_315_0,axiom,
( X1 = singleton(X2)
| sk1_esk1_2(X2,X1) != X2
| ~ in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_315_1,axiom,
( sk1_esk1_2(X2,X1) != X2
| X1 = singleton(X2)
| ~ in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_315_2,axiom,
( ~ in(sk1_esk1_2(X2,X1),X1)
| sk1_esk1_2(X2,X1) != X2
| X1 = singleton(X2) ),
inference(literals_permutation,[status(thm)],[c_0_315]) ).
cnf(c_0_316_0,axiom,
( X1 = union(X2)
| in(sk1_esk14_2(X2,X1),X1)
| in(sk1_esk15_2(X2,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_316_1,axiom,
( in(sk1_esk14_2(X2,X1),X1)
| X1 = union(X2)
| in(sk1_esk15_2(X2,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_316_2,axiom,
( in(sk1_esk15_2(X2,X1),X2)
| in(sk1_esk14_2(X2,X1),X1)
| X1 = union(X2) ),
inference(literals_permutation,[status(thm)],[c_0_316]) ).
cnf(c_0_317_0,axiom,
( X1 = powerset(X2)
| subset(sk1_esk3_2(X2,X1),X2)
| in(sk1_esk3_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_317_1,axiom,
( subset(sk1_esk3_2(X2,X1),X2)
| X1 = powerset(X2)
| in(sk1_esk3_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_317_2,axiom,
( in(sk1_esk3_2(X2,X1),X1)
| subset(sk1_esk3_2(X2,X1),X2)
| X1 = powerset(X2) ),
inference(literals_permutation,[status(thm)],[c_0_317]) ).
cnf(c_0_318_0,axiom,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_318_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X1)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_318_2,axiom,
( ~ in(X4,X3)
| X1 != set_intersection2(X2,X3)
| in(X4,X1)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_318_3,axiom,
( ~ in(X4,X2)
| ~ in(X4,X3)
| X1 != set_intersection2(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_318]) ).
cnf(c_0_319_0,axiom,
( X1 = X2
| in(sk1_esk22_2(X1,X2),X2)
| in(sk1_esk22_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_319_1,axiom,
( in(sk1_esk22_2(X1,X2),X2)
| X1 = X2
| in(sk1_esk22_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_319_2,axiom,
( in(sk1_esk22_2(X1,X2),X1)
| in(sk1_esk22_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_319]) ).
cnf(c_0_320_0,axiom,
( in(sk1_esk24_2(X2,X1),sk1_esk23_1(X2))
| ~ in(X1,sk1_esk23_1(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_320]) ).
cnf(c_0_320_1,axiom,
( ~ in(X1,sk1_esk23_1(X2))
| in(sk1_esk24_2(X2,X1),sk1_esk23_1(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_320]) ).
cnf(c_0_321_0,axiom,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_321]) ).
cnf(c_0_321_1,axiom,
( ~ element(X2,powerset(X1))
| element(subset_complement(X1,X2),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_321]) ).
cnf(c_0_322_0,axiom,
( subset(X1,X2)
| ~ in(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_322]) ).
cnf(c_0_322_1,axiom,
( ~ in(sk1_esk11_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_322]) ).
cnf(c_0_323_0,axiom,
( in(X1,sk1_esk23_1(X2))
| ~ subset(X1,X3)
| ~ in(X3,sk1_esk23_1(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_323_1,axiom,
( ~ subset(X1,X3)
| in(X1,sk1_esk23_1(X2))
| ~ in(X3,sk1_esk23_1(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_323_2,axiom,
( ~ in(X3,sk1_esk23_1(X2))
| ~ subset(X1,X3)
| in(X1,sk1_esk23_1(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_323]) ).
cnf(c_0_324_0,axiom,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_324_1,axiom,
( in(X4,X3)
| in(X4,X1)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_324_2,axiom,
( X1 != set_difference(X2,X3)
| in(X4,X3)
| in(X4,X1)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_324_3,axiom,
( ~ in(X4,X2)
| X1 != set_difference(X2,X3)
| in(X4,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_324]) ).
cnf(c_0_325_0,axiom,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_325_1,axiom,
( in(X4,X2)
| in(X4,X3)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_325_2,axiom,
( X1 != set_union2(X2,X3)
| in(X4,X2)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_325_3,axiom,
( ~ in(X4,X1)
| X1 != set_union2(X2,X3)
| in(X4,X2)
| in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_325]) ).
cnf(c_0_326_0,axiom,
( in(X1,sk1_esk23_1(X2))
| are_equipotent(X1,sk1_esk23_1(X2))
| ~ subset(X1,sk1_esk23_1(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_326]) ).
cnf(c_0_326_1,axiom,
( are_equipotent(X1,sk1_esk23_1(X2))
| in(X1,sk1_esk23_1(X2))
| ~ subset(X1,sk1_esk23_1(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_326]) ).
cnf(c_0_326_2,axiom,
( ~ subset(X1,sk1_esk23_1(X2))
| are_equipotent(X1,sk1_esk23_1(X2))
| in(X1,sk1_esk23_1(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_326]) ).
cnf(c_0_327_0,axiom,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_327]) ).
cnf(c_0_327_1,axiom,
( ~ element(X2,powerset(X1))
| subset_complement(X1,subset_complement(X1,X2)) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_327]) ).
cnf(c_0_328_0,axiom,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_328]) ).
cnf(c_0_328_1,axiom,
( ~ in(X4,X1)
| X1 != set_difference(X2,X3)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_328]) ).
cnf(c_0_328_2,axiom,
( ~ in(X4,X3)
| ~ in(X4,X1)
| X1 != set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_328]) ).
cnf(c_0_329_0,axiom,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_329_1,axiom,
( X1 != union(X2)
| in(X3,X1)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_329_2,axiom,
( ~ in(X4,X2)
| X1 != union(X2)
| in(X3,X1)
| ~ in(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_329_3,axiom,
( ~ in(X3,X4)
| ~ in(X4,X2)
| X1 != union(X2)
| in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_329]) ).
cnf(c_0_330_0,axiom,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_330_1,axiom,
( X1 != set_difference(X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_330_2,axiom,
( ~ in(X4,X1)
| X1 != set_difference(X2,X3)
| in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_330]) ).
cnf(c_0_331_0,axiom,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_331]) ).
cnf(c_0_331_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_331]) ).
cnf(c_0_331_2,axiom,
( ~ in(X4,X1)
| X1 != set_intersection2(X2,X3)
| in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_331]) ).
cnf(c_0_332_0,axiom,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_332]) ).
cnf(c_0_332_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_332]) ).
cnf(c_0_332_2,axiom,
( ~ in(X4,X1)
| X1 != set_intersection2(X2,X3)
| in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_332]) ).
cnf(c_0_333_0,axiom,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_333]) ).
cnf(c_0_333_1,axiom,
( X1 != set_union2(X2,X3)
| in(X4,X1)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_333]) ).
cnf(c_0_333_2,axiom,
( ~ in(X4,X2)
| X1 != set_union2(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_333]) ).
cnf(c_0_334_0,axiom,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_334]) ).
cnf(c_0_334_1,axiom,
( X1 != set_union2(X2,X3)
| in(X4,X1)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_334]) ).
cnf(c_0_334_2,axiom,
( ~ in(X4,X3)
| X1 != set_union2(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_334]) ).
cnf(c_0_335_0,axiom,
( X1 = singleton(X2)
| sk1_esk1_2(X2,X1) = X2
| in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_335]) ).
cnf(c_0_335_1,axiom,
( sk1_esk1_2(X2,X1) = X2
| X1 = singleton(X2)
| in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_335]) ).
cnf(c_0_335_2,axiom,
( in(sk1_esk1_2(X2,X1),X1)
| sk1_esk1_2(X2,X1) = X2
| X1 = singleton(X2) ),
inference(literals_permutation,[status(thm)],[c_0_335]) ).
cnf(c_0_336_0,axiom,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_336]) ).
cnf(c_0_336_1,axiom,
( ~ element(X2,powerset(X1))
| subset_complement(X1,X2) = set_difference(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_336]) ).
cnf(c_0_338_0,axiom,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_338]) ).
cnf(c_0_338_1,axiom,
( ~ in(X1,X3)
| in(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_338]) ).
cnf(c_0_338_2,axiom,
( ~ subset(X3,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_338]) ).
cnf(c_0_339_0,axiom,
( subset(X1,X2)
| in(sk1_esk11_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_339]) ).
cnf(c_0_339_1,axiom,
( in(sk1_esk11_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_339]) ).
cnf(c_0_340_0,axiom,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_340]) ).
cnf(c_0_340_1,axiom,
( ~ empty(set_union2(X1,X2))
| empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_340]) ).
cnf(c_0_341_0,axiom,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_341]) ).
cnf(c_0_341_1,axiom,
( ~ empty(set_union2(X1,X2))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_341]) ).
cnf(c_0_342_0,axiom,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_342]) ).
cnf(c_0_342_1,axiom,
( X4 = X2
| X4 = X3
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_342]) ).
cnf(c_0_342_2,axiom,
( X1 != unordered_pair(X2,X3)
| X4 = X2
| X4 = X3
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_342]) ).
cnf(c_0_342_3,axiom,
( ~ in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 = X2
| X4 = X3 ),
inference(literals_permutation,[status(thm)],[c_0_342]) ).
cnf(c_0_344_0,axiom,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_344]) ).
cnf(c_0_344_1,axiom,
( ~ subset(X2,X1)
| X1 = X2
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_344]) ).
cnf(c_0_344_2,axiom,
( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_344]) ).
cnf(c_0_345_0,axiom,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_345]) ).
cnf(c_0_345_1,axiom,
( X1 != powerset(X2)
| subset(X3,X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_345]) ).
cnf(c_0_345_2,axiom,
( ~ in(X3,X1)
| X1 != powerset(X2)
| subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_345]) ).
cnf(c_0_346_0,axiom,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_346]) ).
cnf(c_0_346_1,axiom,
( X1 != powerset(X2)
| in(X3,X1)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_346]) ).
cnf(c_0_346_2,axiom,
( ~ subset(X3,X2)
| X1 != powerset(X2)
| in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_346]) ).
cnf(c_0_347_0,axiom,
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_347]) ).
cnf(c_0_347_1,axiom,
( ~ proper_subset(X2,X1)
| ~ proper_subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_347]) ).
cnf(c_0_348_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_348]) ).
cnf(c_0_348_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_348]) ).
cnf(c_0_349_0,axiom,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_349]) ).
cnf(c_0_349_1,axiom,
( X1 != unordered_pair(X2,X3)
| in(X4,X1)
| X4 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_349]) ).
cnf(c_0_349_2,axiom,
( X4 != X2
| X1 != unordered_pair(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_349]) ).
cnf(c_0_350_0,axiom,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_350]) ).
cnf(c_0_350_1,axiom,
( X1 != unordered_pair(X2,X3)
| in(X4,X1)
| X4 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_350]) ).
cnf(c_0_350_2,axiom,
( X4 != X3
| X1 != unordered_pair(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_350]) ).
cnf(c_0_351_0,axiom,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_351]) ).
cnf(c_0_351_1,axiom,
( in(X2,X1)
| empty(X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_351]) ).
cnf(c_0_351_2,axiom,
( ~ element(X2,X1)
| in(X2,X1)
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_351]) ).
cnf(c_0_352_0,axiom,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_352]) ).
cnf(c_0_352_1,axiom,
( element(X2,X1)
| empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_352]) ).
cnf(c_0_352_2,axiom,
( ~ in(X2,X1)
| element(X2,X1)
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_352]) ).
cnf(c_0_353_0,axiom,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_353]) ).
cnf(c_0_353_1,axiom,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_353]) ).
cnf(c_0_353_2,axiom,
( ~ subset(X1,X2)
| X1 = X2
| proper_subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_353]) ).
cnf(c_0_354_0,axiom,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_354]) ).
cnf(c_0_354_1,axiom,
( ~ disjoint(X2,X1)
| disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_354]) ).
cnf(c_0_355_0,axiom,
( subset(X1,X2)
| ~ proper_subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_355]) ).
cnf(c_0_355_1,axiom,
( ~ proper_subset(X1,X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_355]) ).
cnf(c_0_356_0,axiom,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_356]) ).
cnf(c_0_356_1,axiom,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_356]) ).
cnf(c_0_357_0,axiom,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(literals_permutation,[status(thm)],[c_0_357]) ).
cnf(c_0_357_1,axiom,
( set_intersection2(X1,X2) != empty_set
| disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_357]) ).
cnf(c_0_358_0,axiom,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_358]) ).
cnf(c_0_358_1,axiom,
( ~ empty(X1)
| empty(X2)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_358]) ).
cnf(c_0_358_2,axiom,
( ~ element(X2,X1)
| ~ empty(X1)
| empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_358]) ).
cnf(c_0_359_0,axiom,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_359]) ).
cnf(c_0_359_1,axiom,
( X1 != singleton(X2)
| X3 = X2
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_359]) ).
cnf(c_0_359_2,axiom,
( ~ in(X3,X1)
| X1 != singleton(X2)
| X3 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_359]) ).
cnf(c_0_360_0,axiom,
( empty(X1)
| element(sk1_esk18_1(X1),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_360]) ).
cnf(c_0_360_1,axiom,
( element(sk1_esk18_1(X1),powerset(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_360]) ).
cnf(c_0_361_0,axiom,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_361]) ).
cnf(c_0_361_1,axiom,
( ~ in(X2,X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_361]) ).
cnf(c_0_362_0,axiom,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_362]) ).
cnf(c_0_362_1,axiom,
( ~ empty(X1)
| element(X2,X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_362]) ).
cnf(c_0_362_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_362]) ).
cnf(c_0_367_0,axiom,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_367]) ).
cnf(c_0_367_1,axiom,
( X1 != singleton(X2)
| in(X3,X1)
| X3 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_367]) ).
cnf(c_0_367_2,axiom,
( X3 != X2
| X1 != singleton(X2)
| in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_367]) ).
cnf(c_0_368_0,axiom,
( ~ proper_subset(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_368]) ).
cnf(c_0_368_1,axiom,
( X1 != X2
| ~ proper_subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_368]) ).
cnf(c_0_369_0,axiom,
( ~ in(X1,X2)
| X2 != empty_set ),
inference(literals_permutation,[status(thm)],[c_0_369]) ).
cnf(c_0_369_1,axiom,
( X2 != empty_set
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_369]) ).
cnf(c_0_371_0,axiom,
( X1 = empty_set
| in(sk1_esk2_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_371]) ).
cnf(c_0_371_1,axiom,
( in(sk1_esk2_1(X1),X1)
| X1 = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_371]) ).
cnf(c_0_372_0,axiom,
( empty(X1)
| ~ empty(sk1_esk18_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_372]) ).
cnf(c_0_372_1,axiom,
( ~ empty(sk1_esk18_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_372]) ).
cnf(c_0_375_0,axiom,
( subset(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_375]) ).
cnf(c_0_375_1,axiom,
( X1 != X2
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_375]) ).
cnf(c_0_376_0,axiom,
( subset(X2,X1)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_376]) ).
cnf(c_0_376_1,axiom,
( X1 != X2
| subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_376]) ).
cnf(c_0_378_0,axiom,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_378]) ).
cnf(c_0_378_1,axiom,
( ~ empty(X1)
| X2 = X1
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_378]) ).
cnf(c_0_378_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| X2 = X1 ),
inference(literals_permutation,[status(thm)],[c_0_378]) ).
cnf(c_0_387_0,axiom,
( X1 = empty_set
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_387]) ).
cnf(c_0_387_1,axiom,
( ~ empty(X1)
| X1 = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_387]) ).
cnf(c_0_343_0,axiom,
~ empty(ordered_pair(X1,X2)),
inference(literals_permutation,[status(thm)],[c_0_343]) ).
cnf(c_0_370_0,axiom,
~ proper_subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_370]) ).
cnf(c_0_377_0,axiom,
~ empty(powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_377]) ).
cnf(c_0_388_0,axiom,
~ empty(sk1_esk21_0),
inference(literals_permutation,[status(thm)],[c_0_388]) ).
cnf(c_0_337_0,axiom,
unordered_pair(unordered_pair(X1,X2),singleton(X1)) = ordered_pair(X1,X2),
inference(literals_permutation,[status(thm)],[c_0_337]) ).
cnf(c_0_363_0,axiom,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_363]) ).
cnf(c_0_364_0,axiom,
set_union2(X1,X2) = set_union2(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_364]) ).
cnf(c_0_365_0,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_365]) ).
cnf(c_0_366_0,axiom,
element(sk1_esk20_1(X1),powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_366]) ).
cnf(c_0_373_0,axiom,
in(X1,sk1_esk23_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_373]) ).
cnf(c_0_374_0,axiom,
element(sk1_esk17_1(X1),X1),
inference(literals_permutation,[status(thm)],[c_0_374]) ).
cnf(c_0_379_0,axiom,
set_intersection2(X1,X1) = X1,
inference(literals_permutation,[status(thm)],[c_0_379]) ).
cnf(c_0_380_0,axiom,
set_union2(X1,X1) = X1,
inference(literals_permutation,[status(thm)],[c_0_380]) ).
cnf(c_0_381_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_381]) ).
cnf(c_0_382_0,axiom,
set_difference(X1,empty_set) = X1,
inference(literals_permutation,[status(thm)],[c_0_382]) ).
cnf(c_0_383_0,axiom,
set_union2(X1,empty_set) = X1,
inference(literals_permutation,[status(thm)],[c_0_383]) ).
cnf(c_0_384_0,axiom,
set_difference(empty_set,X1) = empty_set,
inference(literals_permutation,[status(thm)],[c_0_384]) ).
cnf(c_0_385_0,axiom,
set_intersection2(X1,empty_set) = empty_set,
inference(literals_permutation,[status(thm)],[c_0_385]) ).
cnf(c_0_386_0,axiom,
empty(sk1_esk20_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_386]) ).
cnf(c_0_389_0,axiom,
empty(sk1_esk19_0),
inference(literals_permutation,[status(thm)],[c_0_389]) ).
cnf(c_0_390_0,axiom,
empty(empty_set),
inference(literals_permutation,[status(thm)],[c_0_390]) ).
cnf(c_0_391_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_391]) ).
cnf(c_0_392_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_392]) ).
cnf(c_0_393_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_393]) ).
cnf(c_0_394_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_394]) ).
cnf(c_0_395_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_395]) ).
cnf(c_0_396_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_396]) ).
cnf(c_0_397_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_397]) ).
cnf(c_0_398_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_398]) ).
cnf(c_0_399_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_399]) ).
cnf(c_0_400_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_400]) ).
cnf(c_0_401_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_401]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,lemma,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,powerset(X1))
=> ( disjoint(X2,X3)
<=> subset(X2,subset_complement(X1,X3)) ) ) ),
file('<stdin>',t43_subset_1) ).
fof(c_0_1_002,lemma,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('<stdin>',t106_zfmisc_1) ).
fof(c_0_2_003,lemma,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('<stdin>',l55_zfmisc_1) ).
fof(c_0_3_004,lemma,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('<stdin>',t119_zfmisc_1) ).
fof(c_0_4_005,lemma,
! [X1] :
( X1 != empty_set
=> ! [X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,X1)
=> ( ~ in(X3,X2)
=> in(X3,subset_complement(X1,X2)) ) ) ) ),
file('<stdin>',t50_subset_1) ).
fof(c_0_5_006,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
file('<stdin>',l3_zfmisc_1) ).
fof(c_0_6_007,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
file('<stdin>',t33_xboole_1) ).
fof(c_0_7_008,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('<stdin>',t26_xboole_1) ).
fof(c_0_8_009,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
& subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)) ) ),
file('<stdin>',t118_zfmisc_1) ).
fof(c_0_9_010,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('<stdin>',t4_xboole_0) ).
fof(c_0_10_011,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('<stdin>',t8_xboole_1) ).
fof(c_0_11_012,lemma,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
file('<stdin>',t38_zfmisc_1) ).
fof(c_0_12_013,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('<stdin>',t19_xboole_1) ).
fof(c_0_13_014,lemma,
! [X1] :
? [X2] :
( in(X1,X2)
& ! [X3,X4] :
( ( in(X3,X2)
& subset(X4,X3) )
=> in(X4,X2) )
& ! [X3] :
( in(X3,X2)
=> in(powerset(X3),X2) )
& ! [X3] :
~ ( subset(X3,X2)
& ~ are_equipotent(X3,X2)
& ~ in(X3,X2) ) ),
file('<stdin>',t136_zfmisc_1) ).
fof(c_0_14_015,lemma,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('<stdin>',l3_subset_1) ).
fof(c_0_15_016,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('<stdin>',t3_xboole_0) ).
fof(c_0_16_017,lemma,
! [X1,X2] :
( subset(X1,X2)
=> X2 = set_union2(X1,set_difference(X2,X1)) ),
file('<stdin>',t45_xboole_1) ).
fof(c_0_17_018,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
file('<stdin>',t63_xboole_1) ).
fof(c_0_18_019,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('<stdin>',t1_xboole_1) ).
fof(c_0_19_020,lemma,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
file('<stdin>',t65_zfmisc_1) ).
fof(c_0_20_021,lemma,
! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
file('<stdin>',l25_zfmisc_1) ).
fof(c_0_21_022,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('<stdin>',t48_xboole_1) ).
fof(c_0_22_023,lemma,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('<stdin>',t40_xboole_1) ).
fof(c_0_23_024,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('<stdin>',t39_xboole_1) ).
fof(c_0_24_025,lemma,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('<stdin>',t10_zfmisc_1) ).
fof(c_0_25_026,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('<stdin>',t37_zfmisc_1) ).
fof(c_0_26_027,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('<stdin>',l2_zfmisc_1) ).
fof(c_0_27_028,lemma,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('<stdin>',t33_zfmisc_1) ).
fof(c_0_28_029,lemma,
! [X1,X2] :
~ ( subset(X1,X2)
& proper_subset(X2,X1) ),
file('<stdin>',t60_xboole_1) ).
fof(c_0_29_030,lemma,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
file('<stdin>',t6_zfmisc_1) ).
fof(c_0_30_031,lemma,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
file('<stdin>',t46_zfmisc_1) ).
fof(c_0_31_032,lemma,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
file('<stdin>',l23_zfmisc_1) ).
fof(c_0_32_033,lemma,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('<stdin>',t92_zfmisc_1) ).
fof(c_0_33_034,lemma,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('<stdin>',l50_zfmisc_1) ).
fof(c_0_34_035,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('<stdin>',t7_xboole_1) ).
fof(c_0_35_036,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('<stdin>',t36_xboole_1) ).
fof(c_0_36_037,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('<stdin>',t17_xboole_1) ).
fof(c_0_37_038,lemma,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('<stdin>',t39_zfmisc_1) ).
fof(c_0_38_039,lemma,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('<stdin>',l4_zfmisc_1) ).
fof(c_0_39_040,lemma,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('<stdin>',t83_xboole_1) ).
fof(c_0_40_041,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('<stdin>',t28_xboole_1) ).
fof(c_0_41_042,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('<stdin>',t12_xboole_1) ).
fof(c_0_42_043,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('<stdin>',t37_xboole_1) ).
fof(c_0_43_044,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('<stdin>',l32_xboole_1) ).
fof(c_0_44_045,lemma,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('<stdin>',l28_zfmisc_1) ).
fof(c_0_45_046,conjecture,
! [X1,X2,X3] :
( element(X3,powerset(X1))
=> ~ ( in(X2,subset_complement(X1,X3))
& in(X2,X3) ) ),
file('<stdin>',t54_subset_1) ).
fof(c_0_46_047,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('<stdin>',t9_zfmisc_1) ).
fof(c_0_47_048,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('<stdin>',t8_zfmisc_1) ).
fof(c_0_48_049,lemma,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('<stdin>',t3_xboole_1) ).
fof(c_0_49_050,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('<stdin>',t69_enumset1) ).
fof(c_0_50_051,lemma,
! [X1] : subset(empty_set,X1),
file('<stdin>',t2_xboole_1) ).
fof(c_0_51_052,lemma,
! [X1] : union(powerset(X1)) = X1,
file('<stdin>',t99_zfmisc_1) ).
fof(c_0_52_053,lemma,
! [X1] : singleton(X1) != empty_set,
file('<stdin>',l1_zfmisc_1) ).
fof(c_0_53_054,lemma,
powerset(empty_set) = singleton(empty_set),
file('<stdin>',t1_zfmisc_1) ).
fof(c_0_54_055,lemma,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,powerset(X1))
=> ( disjoint(X2,X3)
<=> subset(X2,subset_complement(X1,X3)) ) ) ),
c_0_0 ).
fof(c_0_55_056,lemma,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
c_0_1 ).
fof(c_0_56_057,lemma,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
c_0_2 ).
fof(c_0_57_058,lemma,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
c_0_3 ).
fof(c_0_58_059,lemma,
! [X1] :
( X1 != empty_set
=> ! [X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,X1)
=> ( ~ in(X3,X2)
=> in(X3,subset_complement(X1,X2)) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_59_060,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
c_0_5 ).
fof(c_0_60_061,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
c_0_6 ).
fof(c_0_61_062,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
c_0_7 ).
fof(c_0_62_063,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
& subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)) ) ),
c_0_8 ).
fof(c_0_63_064,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_64_065,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
c_0_10 ).
fof(c_0_65_066,lemma,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
c_0_11 ).
fof(c_0_66_067,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
c_0_12 ).
fof(c_0_67_068,lemma,
! [X1] :
? [X2] :
( in(X1,X2)
& ! [X3,X4] :
( ( in(X3,X2)
& subset(X4,X3) )
=> in(X4,X2) )
& ! [X3] :
( in(X3,X2)
=> in(powerset(X3),X2) )
& ! [X3] :
~ ( subset(X3,X2)
& ~ are_equipotent(X3,X2)
& ~ in(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_68_069,lemma,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
c_0_14 ).
fof(c_0_69_070,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_70_071,lemma,
! [X1,X2] :
( subset(X1,X2)
=> X2 = set_union2(X1,set_difference(X2,X1)) ),
c_0_16 ).
fof(c_0_71_072,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
c_0_17 ).
fof(c_0_72_073,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
c_0_18 ).
fof(c_0_73_074,lemma,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_74_075,lemma,
! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
c_0_20 ).
fof(c_0_75_076,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
c_0_21 ).
fof(c_0_76_077,lemma,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
c_0_22 ).
fof(c_0_77_078,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
c_0_23 ).
fof(c_0_78_079,lemma,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
c_0_24 ).
fof(c_0_79_080,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
c_0_25 ).
fof(c_0_80_081,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
c_0_26 ).
fof(c_0_81_082,lemma,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
c_0_27 ).
fof(c_0_82_083,lemma,
! [X1,X2] :
~ ( subset(X1,X2)
& proper_subset(X2,X1) ),
c_0_28 ).
fof(c_0_83_084,lemma,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
c_0_29 ).
fof(c_0_84_085,lemma,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
c_0_30 ).
fof(c_0_85_086,lemma,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
c_0_31 ).
fof(c_0_86_087,lemma,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
c_0_32 ).
fof(c_0_87_088,lemma,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
c_0_33 ).
fof(c_0_88_089,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
c_0_34 ).
fof(c_0_89_090,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
c_0_35 ).
fof(c_0_90_091,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
c_0_36 ).
fof(c_0_91_092,lemma,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
c_0_37 ).
fof(c_0_92_093,lemma,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
c_0_38 ).
fof(c_0_93_094,lemma,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
c_0_39 ).
fof(c_0_94_095,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
c_0_40 ).
fof(c_0_95_096,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
c_0_41 ).
fof(c_0_96_097,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
c_0_42 ).
fof(c_0_97_098,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
c_0_43 ).
fof(c_0_98_099,lemma,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[c_0_44]) ).
fof(c_0_99_100,negated_conjecture,
~ ! [X1,X2,X3] :
( element(X3,powerset(X1))
=> ~ ( in(X2,subset_complement(X1,X3))
& in(X2,X3) ) ),
inference(assume_negation,[status(cth)],[c_0_45]) ).
fof(c_0_100_101,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
c_0_46 ).
fof(c_0_101_102,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
c_0_47 ).
fof(c_0_102_103,lemma,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
c_0_48 ).
fof(c_0_103_104,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
c_0_49 ).
fof(c_0_104_105,lemma,
! [X1] : subset(empty_set,X1),
c_0_50 ).
fof(c_0_105_106,lemma,
! [X1] : union(powerset(X1)) = X1,
c_0_51 ).
fof(c_0_106_107,lemma,
! [X1] : singleton(X1) != empty_set,
c_0_52 ).
fof(c_0_107_108,lemma,
powerset(empty_set) = singleton(empty_set),
c_0_53 ).
fof(c_0_108_109,lemma,
! [X4,X5,X6] :
( ( ~ disjoint(X5,X6)
| subset(X5,subset_complement(X4,X6))
| ~ element(X6,powerset(X4))
| ~ element(X5,powerset(X4)) )
& ( ~ subset(X5,subset_complement(X4,X6))
| disjoint(X5,X6)
| ~ element(X6,powerset(X4))
| ~ element(X5,powerset(X4)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])])]) ).
fof(c_0_109_110,lemma,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( in(X5,X7)
| ~ in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) )
& ( in(X6,X8)
| ~ in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) )
& ( ~ in(X9,X11)
| ~ in(X10,X12)
| in(ordered_pair(X9,X10),cartesian_product2(X11,X12)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_55])])])])]) ).
fof(c_0_110_111,lemma,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( in(X5,X7)
| ~ in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) )
& ( in(X6,X8)
| ~ in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) )
& ( ~ in(X9,X11)
| ~ in(X10,X12)
| in(ordered_pair(X9,X10),cartesian_product2(X11,X12)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])])])])]) ).
fof(c_0_111_112,lemma,
! [X5,X6,X7,X8] :
( ~ subset(X5,X6)
| ~ subset(X7,X8)
| subset(cartesian_product2(X5,X7),cartesian_product2(X6,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_57])]) ).
fof(c_0_112_113,lemma,
! [X4,X5,X6] :
( X4 = empty_set
| ~ element(X5,powerset(X4))
| ~ element(X6,X4)
| in(X6,X5)
| in(X6,subset_complement(X4,X5)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])]) ).
fof(c_0_113_114,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| in(X6,X4)
| subset(X4,set_difference(X5,singleton(X6))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])]) ).
fof(c_0_114_115,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(set_difference(X4,X6),set_difference(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])])]) ).
fof(c_0_115_116,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(set_intersection2(X4,X6),set_intersection2(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])])]) ).
fof(c_0_116_117,lemma,
! [X4,X5,X6,X7] :
( ( subset(cartesian_product2(X4,X6),cartesian_product2(X5,X6))
| ~ subset(X4,X5) )
& ( subset(cartesian_product2(X7,X4),cartesian_product2(X7,X5))
| ~ subset(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])])])])]) ).
fof(c_0_117_118,lemma,
! [X4,X5,X7,X8,X9] :
( ( disjoint(X4,X5)
| in(esk3_2(X4,X5),set_intersection2(X4,X5)) )
& ( ~ in(X9,set_intersection2(X7,X8))
| ~ disjoint(X7,X8) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])])])])]) ).
fof(c_0_118_119,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X6,X5)
| subset(set_union2(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])]) ).
fof(c_0_119_120,lemma,
! [X4,X5,X6,X7,X8,X9] :
( ( in(X4,X6)
| ~ subset(unordered_pair(X4,X5),X6) )
& ( in(X5,X6)
| ~ subset(unordered_pair(X4,X5),X6) )
& ( ~ in(X7,X9)
| ~ in(X8,X9)
| subset(unordered_pair(X7,X8),X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])])])]) ).
fof(c_0_120_121,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X4,X6)
| subset(X4,set_intersection2(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_66])]) ).
fof(c_0_121_122,lemma,
! [X5,X7,X8,X9,X10] :
( in(X5,esk1_1(X5))
& ( ~ in(X7,esk1_1(X5))
| ~ subset(X8,X7)
| in(X8,esk1_1(X5)) )
& ( ~ in(X9,esk1_1(X5))
| in(powerset(X9),esk1_1(X5)) )
& ( ~ subset(X10,esk1_1(X5))
| are_equipotent(X10,esk1_1(X5))
| in(X10,esk1_1(X5)) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_67])])])]) ).
fof(c_0_122_123,lemma,
! [X4,X5,X6] :
( ~ element(X5,powerset(X4))
| ~ in(X6,X5)
| in(X6,X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])])]) ).
fof(c_0_123_124,lemma,
! [X4,X5,X7,X8,X9] :
( ( in(esk2_2(X4,X5),X4)
| disjoint(X4,X5) )
& ( in(esk2_2(X4,X5),X5)
| disjoint(X4,X5) )
& ( ~ in(X9,X7)
| ~ in(X9,X8)
| ~ disjoint(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_69])])])])])]) ).
fof(c_0_124_125,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| X4 = set_union2(X3,set_difference(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])]) ).
fof(c_0_125_126,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ disjoint(X5,X6)
| disjoint(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_71])]) ).
fof(c_0_126_127,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_72])]) ).
fof(c_0_127_128,lemma,
! [X3,X4,X5,X6] :
( ( set_difference(X3,singleton(X4)) != X3
| ~ in(X4,X3) )
& ( in(X6,X5)
| set_difference(X5,singleton(X6)) = X5 ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])])]) ).
fof(c_0_128_129,lemma,
! [X3,X4] :
( ~ disjoint(singleton(X3),X4)
| ~ in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_74])]) ).
fof(c_0_129_130,lemma,
! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
inference(variable_rename,[status(thm)],[c_0_75]) ).
fof(c_0_130_131,lemma,
! [X3,X4] : set_difference(set_union2(X3,X4),X4) = set_difference(X3,X4),
inference(variable_rename,[status(thm)],[c_0_76]) ).
fof(c_0_131_132,lemma,
! [X3,X4] : set_union2(X3,set_difference(X4,X3)) = set_union2(X3,X4),
inference(variable_rename,[status(thm)],[c_0_77]) ).
fof(c_0_132_133,lemma,
! [X5,X6,X7,X8] :
( unordered_pair(X5,X6) != unordered_pair(X7,X8)
| X5 = X7
| X5 = X8 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_78])]) ).
fof(c_0_133_134,lemma,
! [X3,X4,X5,X6] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X5,X6)
| subset(singleton(X5),X6) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_79])])])]) ).
fof(c_0_134_135,lemma,
! [X3,X4,X5,X6] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X5,X6)
| subset(singleton(X5),X6) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_80])])])]) ).
fof(c_0_135_136,lemma,
! [X5,X6,X7,X8] :
( ( X5 = X7
| ordered_pair(X5,X6) != ordered_pair(X7,X8) )
& ( X6 = X8
| ordered_pair(X5,X6) != ordered_pair(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_81])])]) ).
fof(c_0_136_137,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| ~ proper_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_82])]) ).
fof(c_0_137_138,lemma,
! [X3,X4] :
( ~ subset(singleton(X3),singleton(X4))
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_83])]) ).
fof(c_0_138_139,lemma,
! [X3,X4] :
( ~ in(X3,X4)
| set_union2(singleton(X3),X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_84])]) ).
fof(c_0_139_140,lemma,
! [X3,X4] :
( ~ in(X3,X4)
| set_union2(singleton(X3),X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_85])]) ).
fof(c_0_140_141,lemma,
! [X3,X4] :
( ~ in(X3,X4)
| subset(X3,union(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_86])]) ).
fof(c_0_141_142,lemma,
! [X3,X4] :
( ~ in(X3,X4)
| subset(X3,union(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_87])]) ).
fof(c_0_142_143,lemma,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[c_0_88]) ).
fof(c_0_143_144,lemma,
! [X3,X4] : subset(set_difference(X3,X4),X3),
inference(variable_rename,[status(thm)],[c_0_89]) ).
fof(c_0_144_145,lemma,
! [X3,X4] : subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[c_0_90]) ).
fof(c_0_145_146,lemma,
! [X3,X4,X5,X6] :
( ( ~ subset(X3,singleton(X4))
| X3 = empty_set
| X3 = singleton(X4) )
& ( X5 != empty_set
| subset(X5,singleton(X6)) )
& ( X5 != singleton(X6)
| subset(X5,singleton(X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_91])])])])]) ).
fof(c_0_146_147,lemma,
! [X3,X4,X5,X6] :
( ( ~ subset(X3,singleton(X4))
| X3 = empty_set
| X3 = singleton(X4) )
& ( X5 != empty_set
| subset(X5,singleton(X6)) )
& ( X5 != singleton(X6)
| subset(X5,singleton(X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_92])])])])]) ).
fof(c_0_147_148,lemma,
! [X3,X4,X5,X6] :
( ( ~ disjoint(X3,X4)
| set_difference(X3,X4) = X3 )
& ( set_difference(X5,X6) != X5
| disjoint(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_93])])])]) ).
fof(c_0_148_149,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_intersection2(X3,X4) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_94])]) ).
fof(c_0_149_150,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_union2(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_95])]) ).
fof(c_0_150_151,lemma,
! [X3,X4,X5,X6] :
( ( set_difference(X3,X4) != empty_set
| subset(X3,X4) )
& ( ~ subset(X5,X6)
| set_difference(X5,X6) = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_96])])])]) ).
fof(c_0_151_152,lemma,
! [X3,X4,X5,X6] :
( ( set_difference(X3,X4) != empty_set
| subset(X3,X4) )
& ( ~ subset(X5,X6)
| set_difference(X5,X6) = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_97])])])]) ).
fof(c_0_152_153,lemma,
! [X3,X4] :
( in(X3,X4)
| disjoint(singleton(X3),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_98])]) ).
fof(c_0_153_154,negated_conjecture,
( element(esk6_0,powerset(esk4_0))
& in(esk5_0,subset_complement(esk4_0,esk6_0))
& in(esk5_0,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_99])])]) ).
fof(c_0_154_155,lemma,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_100])]) ).
fof(c_0_155_156,lemma,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X4 = X5 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_101])])])]) ).
fof(c_0_156_157,lemma,
! [X2] :
( ~ subset(X2,empty_set)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_102])]) ).
fof(c_0_157_158,lemma,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[c_0_103]) ).
fof(c_0_158_159,lemma,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[c_0_104]) ).
fof(c_0_159_160,lemma,
! [X2] : union(powerset(X2)) = X2,
inference(variable_rename,[status(thm)],[c_0_105]) ).
fof(c_0_160_161,lemma,
! [X2] : singleton(X2) != empty_set,
inference(variable_rename,[status(thm)],[c_0_106]) ).
fof(c_0_161_162,lemma,
powerset(empty_set) = singleton(empty_set),
c_0_107 ).
cnf(c_0_162_163,lemma,
( disjoint(X1,X3)
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2))
| ~ subset(X1,subset_complement(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_163_164,lemma,
( subset(X1,subset_complement(X2,X3))
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2))
| ~ disjoint(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_164_165,lemma,
( in(X1,X3)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_165_166,lemma,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_166_167,lemma,
( in(X1,X3)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_167_168,lemma,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_168_169,lemma,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ subset(X2,X4)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_169_170,lemma,
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_170_171,lemma,
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_171_172,lemma,
( in(X1,subset_complement(X2,X3))
| in(X1,X3)
| X2 = empty_set
| ~ element(X1,X2)
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_172_173,lemma,
( subset(X1,set_difference(X2,singleton(X3)))
| in(X3,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_173_174,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_174_175,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_175_176,lemma,
( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_176_177,lemma,
( subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_177_178,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_178_179,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_179_180,lemma,
( subset(unordered_pair(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_180_181,lemma,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_181_182,lemma,
( in(esk3_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_182_183,lemma,
( in(X1,X3)
| ~ subset(unordered_pair(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_183_184,lemma,
( in(X2,X3)
| ~ subset(unordered_pair(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_184_185,lemma,
( in(X1,esk1_1(X2))
| ~ subset(X1,X3)
| ~ in(X3,esk1_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_185_186,lemma,
( in(X1,esk1_1(X2))
| are_equipotent(X1,esk1_1(X2))
| ~ subset(X1,esk1_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_186_187,lemma,
( in(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_187_188,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_188_189,lemma,
( X1 = set_union2(X2,set_difference(X1,X2))
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_189_190,lemma,
( disjoint(X1,X2)
| ~ disjoint(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_190_191,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_191_192,lemma,
( in(powerset(X1),esk1_1(X2))
| ~ in(X1,esk1_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_192_193,lemma,
( ~ in(X1,X2)
| set_difference(X2,singleton(X1)) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_193_194,lemma,
( ~ in(X1,X2)
| ~ disjoint(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_194_195,lemma,
( disjoint(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_195_196,lemma,
( disjoint(X1,X2)
| in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_196_197,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_129]) ).
cnf(c_0_197_198,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_130]) ).
cnf(c_0_198_199,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_131]) ).
cnf(c_0_199_200,lemma,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_132]) ).
cnf(c_0_200_201,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_133]) ).
cnf(c_0_201_202,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_202_203,lemma,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_135]) ).
cnf(c_0_203_204,lemma,
( X2 = X4
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_135]) ).
cnf(c_0_204_205,lemma,
( ~ proper_subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_136]) ).
cnf(c_0_205_206,lemma,
( X1 = X2
| ~ subset(singleton(X1),singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_206_207,lemma,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_138]) ).
cnf(c_0_207_208,lemma,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_139]) ).
cnf(c_0_208_209,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_209_210,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_133]) ).
cnf(c_0_210_211,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_141]) ).
cnf(c_0_211_212,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_212_213,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_142]) ).
cnf(c_0_213_214,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_143]) ).
cnf(c_0_214_215,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_144]) ).
cnf(c_0_215_216,lemma,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_145]) ).
cnf(c_0_216_217,lemma,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_217_218,lemma,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_218_219,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_219_220,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_148]) ).
cnf(c_0_220_221,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_149]) ).
cnf(c_0_221_222,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_150]) ).
cnf(c_0_222_223,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_150]) ).
cnf(c_0_223_224,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_151]) ).
cnf(c_0_224_225,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_151]) ).
cnf(c_0_225_226,lemma,
( set_difference(X1,singleton(X2)) = X1
| in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_226_227,lemma,
( disjoint(singleton(X1),X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_152]) ).
cnf(c_0_227_228,negated_conjecture,
in(esk5_0,subset_complement(esk4_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_228_229,lemma,
( X1 = X2
| singleton(X3) != unordered_pair(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_154]) ).
cnf(c_0_229_230,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_155]) ).
cnf(c_0_230_231,lemma,
( subset(X1,singleton(X2))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_145]) ).
cnf(c_0_231_232,lemma,
( subset(X1,singleton(X2))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_232_233,lemma,
( subset(X1,singleton(X2))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_145]) ).
cnf(c_0_233_234,lemma,
( subset(X1,singleton(X2))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_234_235,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_156]) ).
cnf(c_0_235_236,lemma,
in(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_236_237,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_157]) ).
cnf(c_0_237_238,negated_conjecture,
element(esk6_0,powerset(esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_238_239,lemma,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_158]) ).
cnf(c_0_239_240,lemma,
union(powerset(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_159]) ).
cnf(c_0_240_241,negated_conjecture,
in(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_153]) ).
cnf(c_0_241_242,lemma,
singleton(X1) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_160]) ).
cnf(c_0_242_243,lemma,
powerset(empty_set) = singleton(empty_set),
inference(split_conjunct,[status(thm)],[c_0_161]) ).
cnf(c_0_243_244,lemma,
( disjoint(X1,X3)
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2))
| ~ subset(X1,subset_complement(X2,X3)) ),
c_0_162,
[final] ).
cnf(c_0_244_245,lemma,
( subset(X1,subset_complement(X2,X3))
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2))
| ~ disjoint(X1,X3) ),
c_0_163,
[final] ).
cnf(c_0_245_246,lemma,
( in(X1,X3)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
c_0_164,
[final] ).
cnf(c_0_246_247,lemma,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
c_0_165,
[final] ).
cnf(c_0_247_248,lemma,
( in(X1,X3)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
c_0_166,
[final] ).
cnf(c_0_248_249,lemma,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
c_0_167,
[final] ).
cnf(c_0_249_250,lemma,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ subset(X2,X4)
| ~ subset(X1,X3) ),
c_0_168,
[final] ).
cnf(c_0_250_251,lemma,
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
c_0_169,
[final] ).
cnf(c_0_251_252,lemma,
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
c_0_170,
[final] ).
cnf(c_0_252_253,lemma,
( in(X1,subset_complement(X2,X3))
| in(X1,X3)
| X2 = empty_set
| ~ element(X1,X2)
| ~ element(X3,powerset(X2)) ),
c_0_171,
[final] ).
cnf(c_0_253_254,lemma,
( subset(X1,set_difference(X2,singleton(X3)))
| in(X3,X1)
| ~ subset(X1,X2) ),
c_0_172,
[final] ).
cnf(c_0_254_255,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
c_0_173,
[final] ).
cnf(c_0_255_256,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
c_0_174,
[final] ).
cnf(c_0_256_257,lemma,
( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
| ~ subset(X1,X2) ),
c_0_175,
[final] ).
cnf(c_0_257_258,lemma,
( subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2))
| ~ subset(X1,X2) ),
c_0_176,
[final] ).
cnf(c_0_258_259,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
c_0_177,
[final] ).
cnf(c_0_259_260,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
c_0_178,
[final] ).
cnf(c_0_260_261,lemma,
( subset(unordered_pair(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
c_0_179,
[final] ).
cnf(c_0_261_262,lemma,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
c_0_180,
[final] ).
cnf(c_0_262_263,lemma,
( in(esk3_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
c_0_181,
[final] ).
cnf(c_0_263_264,lemma,
( in(X1,X3)
| ~ subset(unordered_pair(X1,X2),X3) ),
c_0_182,
[final] ).
cnf(c_0_264_265,lemma,
( in(X2,X3)
| ~ subset(unordered_pair(X1,X2),X3) ),
c_0_183,
[final] ).
cnf(c_0_265_266,lemma,
( in(X1,esk1_1(X2))
| ~ subset(X1,X3)
| ~ in(X3,esk1_1(X2)) ),
c_0_184,
[final] ).
cnf(c_0_266_267,lemma,
( in(X1,esk1_1(X2))
| are_equipotent(X1,esk1_1(X2))
| ~ subset(X1,esk1_1(X2)) ),
c_0_185,
[final] ).
cnf(c_0_267_268,lemma,
( in(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
c_0_186,
[final] ).
cnf(c_0_268_269,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
c_0_187,
[final] ).
cnf(c_0_269_270,lemma,
( set_union2(X2,set_difference(X1,X2)) = X1
| ~ subset(X2,X1) ),
c_0_188,
[final] ).
cnf(c_0_270_271,lemma,
( disjoint(X1,X2)
| ~ disjoint(X3,X2)
| ~ subset(X1,X3) ),
c_0_189,
[final] ).
cnf(c_0_271_272,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
c_0_190,
[final] ).
cnf(c_0_272_273,lemma,
( in(powerset(X1),esk1_1(X2))
| ~ in(X1,esk1_1(X2)) ),
c_0_191,
[final] ).
cnf(c_0_273_274,lemma,
( ~ in(X1,X2)
| set_difference(X2,singleton(X1)) != X2 ),
c_0_192,
[final] ).
cnf(c_0_274_275,lemma,
( ~ in(X1,X2)
| ~ disjoint(singleton(X1),X2) ),
c_0_193,
[final] ).
cnf(c_0_275_276,lemma,
( disjoint(X1,X2)
| in(esk2_2(X1,X2),X1) ),
c_0_194,
[final] ).
cnf(c_0_276_277,lemma,
( disjoint(X1,X2)
| in(esk2_2(X1,X2),X2) ),
c_0_195,
[final] ).
cnf(c_0_277_278,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
c_0_196,
[final] ).
cnf(c_0_278_279,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
c_0_197,
[final] ).
cnf(c_0_279_280,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
c_0_198,
[final] ).
cnf(c_0_280_281,lemma,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
c_0_199,
[final] ).
cnf(c_0_281_282,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
c_0_200,
[final] ).
cnf(c_0_282_283,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
c_0_201,
[final] ).
cnf(c_0_283_284,lemma,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
c_0_202,
[final] ).
cnf(c_0_284_285,lemma,
( X2 = X4
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
c_0_203,
[final] ).
cnf(c_0_285_286,lemma,
( ~ proper_subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_204,
[final] ).
cnf(c_0_286_287,lemma,
( X1 = X2
| ~ subset(singleton(X1),singleton(X2)) ),
c_0_205,
[final] ).
cnf(c_0_287_288,lemma,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
c_0_206,
[final] ).
cnf(c_0_288_289,lemma,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
c_0_207,
[final] ).
cnf(c_0_289_290,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
c_0_208,
[final] ).
cnf(c_0_290_291,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
c_0_209,
[final] ).
cnf(c_0_291_292,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
c_0_210,
[final] ).
cnf(c_0_292_293,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
c_0_211,
[final] ).
cnf(c_0_293_294,lemma,
subset(X1,set_union2(X1,X2)),
c_0_212,
[final] ).
cnf(c_0_294_295,lemma,
subset(set_difference(X1,X2),X1),
c_0_213,
[final] ).
cnf(c_0_295_296,lemma,
subset(set_intersection2(X1,X2),X1),
c_0_214,
[final] ).
cnf(c_0_296_297,lemma,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
c_0_215,
[final] ).
cnf(c_0_297_298,lemma,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
c_0_216,
[final] ).
cnf(c_0_298_299,lemma,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
c_0_217,
[final] ).
cnf(c_0_299_300,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
c_0_218,
[final] ).
cnf(c_0_300_301,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
c_0_219,
[final] ).
cnf(c_0_301_302,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
c_0_220,
[final] ).
cnf(c_0_302_303,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
c_0_221,
[final] ).
cnf(c_0_303_304,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
c_0_222,
[final] ).
cnf(c_0_304_305,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
c_0_223,
[final] ).
cnf(c_0_305_306,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
c_0_224,
[final] ).
cnf(c_0_306_307,lemma,
( set_difference(X1,singleton(X2)) = X1
| in(X2,X1) ),
c_0_225,
[final] ).
cnf(c_0_307_308,lemma,
( disjoint(singleton(X1),X2)
| in(X1,X2) ),
c_0_226,
[final] ).
cnf(c_0_308_309,negated_conjecture,
in(esk5_0,subset_complement(esk4_0,esk6_0)),
c_0_227,
[final] ).
cnf(c_0_309_310,lemma,
( X1 = X2
| singleton(X3) != unordered_pair(X1,X2) ),
c_0_228,
[final] ).
cnf(c_0_310_311,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
c_0_229,
[final] ).
cnf(c_0_311_312,lemma,
( subset(X1,singleton(X2))
| X1 != singleton(X2) ),
c_0_230,
[final] ).
cnf(c_0_312_313,lemma,
( subset(X1,singleton(X2))
| X1 != singleton(X2) ),
c_0_231,
[final] ).
cnf(c_0_313_314,lemma,
( subset(X1,singleton(X2))
| X1 != empty_set ),
c_0_232,
[final] ).
cnf(c_0_314_315,lemma,
( subset(X1,singleton(X2))
| X1 != empty_set ),
c_0_233,
[final] ).
cnf(c_0_315_316,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
c_0_234,
[final] ).
cnf(c_0_316_317,lemma,
in(X1,esk1_1(X1)),
c_0_235,
[final] ).
cnf(c_0_317_318,lemma,
unordered_pair(X1,X1) = singleton(X1),
c_0_236,
[final] ).
cnf(c_0_318_319,negated_conjecture,
element(esk6_0,powerset(esk4_0)),
c_0_237,
[final] ).
cnf(c_0_319_320,lemma,
subset(empty_set,X1),
c_0_238,
[final] ).
cnf(c_0_320_321,lemma,
union(powerset(X1)) = X1,
c_0_239,
[final] ).
cnf(c_0_321_322,negated_conjecture,
in(esk5_0,esk6_0),
c_0_240,
[final] ).
cnf(c_0_322_323,lemma,
singleton(X1) != empty_set,
c_0_241,
[final] ).
cnf(c_0_323_324,lemma,
powerset(empty_set) = singleton(empty_set),
c_0_242,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_138,plain,
( X0 != set_difference(X1,X2)
| ~ in(X3,X0)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_43fe92.p',c_0_328_2) ).
cnf(c_973,plain,
( X0 != set_difference(X1,X2)
| ~ in(X3,X0)
| ~ in(X3,X2) ),
inference(copy,[status(esa)],[c_138]) ).
cnf(c_44799,plain,
( ~ in(sk2_esk5_0,subset_complement(sk2_esk4_0,sk2_esk6_0))
| ~ in(sk2_esk5_0,X0)
| subset_complement(sk2_esk4_0,sk2_esk6_0) != set_difference(X1,X0) ),
inference(instantiation,[status(thm)],[c_973]) ).
cnf(c_45060,plain,
( ~ in(sk2_esk5_0,subset_complement(sk2_esk4_0,sk2_esk6_0))
| ~ in(sk2_esk5_0,sk2_esk6_0)
| subset_complement(sk2_esk4_0,sk2_esk6_0) != set_difference(X0,sk2_esk6_0) ),
inference(instantiation,[status(thm)],[c_44799]) ).
cnf(c_45503,plain,
( ~ in(sk2_esk5_0,subset_complement(sk2_esk4_0,sk2_esk6_0))
| ~ in(sk2_esk5_0,sk2_esk6_0)
| subset_complement(sk2_esk4_0,sk2_esk6_0) != set_difference(sk2_esk4_0,sk2_esk6_0) ),
inference(instantiation,[status(thm)],[c_45060]) ).
cnf(c_114,plain,
( subset_complement(X0,X1) = set_difference(X0,X1)
| ~ element(X1,powerset(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_43fe92.p',c_0_336_1) ).
cnf(c_949,plain,
( subset_complement(X0,X1) = set_difference(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_44499,plain,
( ~ element(sk2_esk6_0,powerset(sk2_esk4_0))
| subset_complement(sk2_esk4_0,sk2_esk6_0) = set_difference(sk2_esk4_0,sk2_esk6_0) ),
inference(instantiation,[status(thm)],[c_949]) ).
cnf(c_342,negated_conjecture,
in(sk2_esk5_0,subset_complement(sk2_esk4_0,sk2_esk6_0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_43fe92.p',c_0_308) ).
cnf(c_345,negated_conjecture,
element(sk2_esk6_0,powerset(sk2_esk4_0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_43fe92.p',c_0_318) ).
cnf(c_348,negated_conjecture,
in(sk2_esk5_0,sk2_esk6_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_43fe92.p',c_0_321) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_45503,c_44499,c_342,c_345,c_348]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU172+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 06:08:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % FOF problem with conjecture
% 0.20/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ac0b0c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_43fe92.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_407937 | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.47/0.76 % --bmc1_dump_unsat_core_tptp false
% 0.47/0.76 % --bmc1_dump_file -
% 0.47/0.76 % --bmc1_ucm_expand_uc_limit 128
% 0.47/0.76 % --bmc1_ucm_n_expand_iterations 6
% 0.47/0.76 % --bmc1_ucm_extend_mode 1
% 0.47/0.76 % --bmc1_ucm_init_mode 2
% 0.47/0.76 % --bmc1_ucm_cone_mode none
% 0.47/0.76 % --bmc1_ucm_reduced_relation_type 0
% 0.47/0.76 % --bmc1_ucm_relax_model 4
% 0.47/0.76 % --bmc1_ucm_full_tr_after_sat true
% 0.47/0.76 % --bmc1_ucm_expand_neg_assumptions false
% 0.47/0.76 % --bmc1_ucm_layered_model none
% 0.47/0.76 % --bmc1_ucm_max_lemma_size 10
% 0.47/0.76
% 0.47/0.76 % ------ AIG Options
% 0.47/0.76
% 0.47/0.76 % --aig_mode false
% 0.47/0.76
% 0.47/0.76 % ------ Instantiation Options
% 0.47/0.76
% 0.47/0.76 % --instantiation_flag true
% 0.47/0.76 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.47/0.76 % --inst_solver_per_active 750
% 0.47/0.76 % --inst_solver_calls_frac 0.5
% 0.47/0.76 % --inst_passive_queue_type priority_queues
% 0.47/0.76 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.47/0.76 % --inst_passive_queues_freq [25;2]
% 0.47/0.76 % --inst_dismatching true
% 0.47/0.76 % --inst_eager_unprocessed_to_passive true
% 0.47/0.76 % --inst_prop_sim_given true
% 0.47/0.76 % --inst_prop_sim_new false
% 0.47/0.76 % --inst_orphan_elimination true
% 0.47/0.76 % --inst_learning_loop_flag true
% 0.47/0.76 % --inst_learning_start 3000
% 0.47/0.76 % --inst_learning_factor 2
% 0.47/0.76 % --inst_start_prop_sim_after_learn 3
% 0.47/0.76 % --inst_sel_renew solver
% 0.47/0.76 % --inst_lit_activity_flag true
% 0.47/0.76 % --inst_out_proof true
% 0.47/0.76
% 0.47/0.76 % ------ Resolution Options
% 0.47/0.76
% 0.47/0.76 % --resolution_flag true
% 0.47/0.76 % --res_lit_sel kbo_max
% 0.47/0.76 % --res_to_prop_solver none
% 0.47/0.76 % --res_prop_simpl_new false
% 0.47/0.76 % --res_prop_simpl_given false
% 0.47/0.76 % --res_passive_queue_type priority_queues
% 0.47/0.76 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.47/0.76 % --res_passive_queues_freq [15;5]
% 0.47/0.76 % --res_forward_subs full
% 0.47/0.76 % --res_backward_subs full
% 0.47/0.76 % --res_forward_subs_resolution true
% 0.47/0.76 % --res_backward_subs_resolution true
% 0.47/0.76 % --res_orphan_elimination false
% 0.47/0.76 % --res_time_limit 1000.
% 0.47/0.76 % --res_out_proof true
% 0.47/0.76 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ac0b0c.s
% 0.47/0.76 % --modulo true
% 0.47/0.76
% 0.47/0.76 % ------ Combination Options
% 0.47/0.76
% 0.47/0.76 % --comb_res_mult 1000
% 0.47/0.76 % --comb_inst_mult 300
% 0.47/0.76 % ------
% 0.47/0.76
% 0.47/0.76 % ------ Parsing...% successful
% 0.47/0.76
% 0.47/0.76 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.47/0.76
% 0.47/0.76 % ------ Proving...
% 0.47/0.76 % ------ Problem Properties
% 0.47/0.76
% 0.47/0.76 %
% 0.47/0.76 % EPR false
% 0.47/0.76 % Horn false
% 0.47/0.76 % Has equality true
% 0.47/0.76
% 0.47/0.76 % % ------ Input Options Time Limit: Unbounded
% 0.47/0.76
% 0.47/0.76
% 0.47/0.76 Compiling...
% 0.47/0.76 Loading plugin: done.
% 0.47/0.76 Compiling...
% 0.47/0.76 Loading plugin: done.
% 0.47/0.76 Compiling...
% 0.47/0.76 Loading plugin: done.
% 0.47/0.76 % % ------ Current options:
% 0.47/0.76
% 0.47/0.76 % ------ Input Options
% 0.47/0.76
% 0.47/0.76 % --out_options all
% 0.47/0.76 % --tptp_safe_out true
% 0.47/0.76 % --problem_path ""
% 0.47/0.76 % --include_path ""
% 0.47/0.76 % --clausifier .//eprover
% 0.47/0.76 % --clausifier_options --tstp-format
% 0.47/0.76 % --stdin false
% 0.47/0.76 % --dbg_backtrace false
% 0.47/0.76 % --dbg_dump_prop_clauses false
% 0.47/0.76 % --dbg_dump_prop_clauses_file -
% 0.47/0.76 % --dbg_out_stat false
% 0.47/0.76
% 0.47/0.76 % ------ General Options
% 0.47/0.76
% 0.47/0.76 % --fof false
% 0.47/0.76 % --time_out_real 150.
% 0.47/0.76 % --time_out_prep_mult 0.2
% 0.47/0.76 % --time_out_virtual -1.
% 0.47/0.76 % --schedule none
% 0.47/0.76 % --ground_splitting input
% 0.47/0.76 % --splitting_nvd 16
% 0.47/0.76 % --non_eq_to_eq false
% 0.47/0.76 % --prep_gs_sim true
% 0.47/0.76 % --prep_unflatten false
% 0.47/0.76 % --prep_res_sim true
% 0.47/0.76 % --prep_upred true
% 0.47/0.76 % --res_sim_input true
% 0.47/0.76 % --clause_weak_htbl true
% 0.47/0.76 % --gc_record_bc_elim false
% 0.47/0.76 % --symbol_type_check false
% 0.47/0.76 % --clausify_out false
% 0.47/0.76 % --large_theory_mode false
% 0.47/0.76 % --prep_sem_filter none
% 0.47/0.76 % --prep_sem_filter_out false
% 0.47/0.76 % --preprocessed_out false
% 0.47/0.76 % --sub_typing false
% 0.47/0.76 % --brand_transform false
% 0.47/0.76 % --pure_diseq_elim true
% 0.47/0.76 % --min_unsat_core false
% 0.47/0.76 % --pred_elim true
% 0.47/0.76 % --add_important_lit false
% 0.47/0.76 % --soft_assumptions false
% 0.47/0.76 % --reset_solvers false
% 0.47/0.76 % --bc_imp_inh []
% 0.47/0.76 % --conj_cone_tolerance 1.5
% 0.47/0.76 % --prolific_symb_bound 500
% 0.47/0.76 % --lt_threshold 2000
% 0.47/0.76
% 0.47/0.76 % ------ SAT Options
% 0.47/0.76
% 0.47/0.76 % --sat_mode false
% 0.47/0.76 % --sat_fm_restart_options ""
% 0.47/0.76 % --sat_gr_def false
% 0.47/0.76 % --sat_epr_types true
% 0.47/0.76 % --sat_non_cyclic_types false
% 0.47/0.76 % --sat_finite_models false
% 0.47/0.76 % --sat_fm_lemmas false
% 0.47/0.76 % --sat_fm_prep false
% 0.47/0.76 % --sat_fm_uc_incr true
% 0.47/0.76 % --sat_out_model small
% 0.47/0.76 % --sat_out_clauses false
% 0.47/0.76
% 0.47/0.76 % ------ QBF Options
% 0.47/0.76
% 0.47/0.76 % --qbf_mode false
% 0.47/0.76 % --qbf_elim_univ true
% 0.47/0.76 % --qbf_sk_in true
% 0.47/0.76 % --qbf_pred_elim true
% 0.47/0.76 % --qbf_split 32
% 0.47/0.76
% 0.47/0.76 % ------ BMC1 Options
% 0.47/0.76
% 0.47/0.76 % --bmc1_incremental false
% 0.47/0.76 % --bmc1_axioms reachable_all
% 0.47/0.76 % --bmc1_min_bound 0
% 0.47/0.76 % --bmc1_max_bound -1
% 0.47/0.76 % --bmc1_max_bound_default -1
% 0.47/0.76 % --bmc1_symbol_reachability true
% 0.47/0.76 % --bmc1_property_lemmas false
% 0.47/0.76 % --bmc1_k_induction false
% 0.47/0.76 % --bmc1_non_equiv_states false
% 0.47/0.76 % --bmc1_deadlock false
% 0.47/0.76 % --bmc1_ucm false
% 0.47/0.76 % --bmc1_add_unsat_core none
% 0.47/0.76 % --bmc1_unsat_core_children false
% 0.47/0.76 % --bmc1_unsat_core_extrapolate_axioms false
% 0.47/0.76 % --bmc1_out_stat full
% 0.47/0.76 % --bmc1_ground_init false
% 0.47/0.76 % --bmc1_pre_inst_next_state false
% 0.47/0.76 % --bmc1_pre_inst_state false
% 0.47/0.76 % --bmc1_pre_inst_reach_state false
% 0.47/0.76 % --bmc1_out_unsat_core false
% 0.47/0.76 % --bmc1_aig_witness_out false
% 0.47/0.76 % --bmc1_verbose false
% 0.47/0.76 % --bmc1_dump_clauses_tptp false
% 0.47/0.76 % --bmc1_dump_unsat_core_tptp false
% 0.47/0.76 % --bmc1_dump_file -
% 0.47/0.76 % --bmc1_ucm_expand_uc_limit 128
% 0.47/0.76 % --bmc1_ucm_n_expand_iterations 6
% 0.47/0.76 % --bmc1_ucm_extend_mode 1
% 0.47/0.76 % --bmc1_ucm_init_mode 2
% 0.47/0.76 % --bmc1_ucm_cone_mode none
% 0.47/0.76 % --bmc1_ucm_reduced_relation_type 0
% 0.47/0.76 % --bmc1_ucm_relax_model 4
% 0.47/0.76 % --bmc1_ucm_full_tr_after_sat true
% 0.47/0.76 % --bmc1_ucm_expand_neg_assumptions false
% 0.47/0.76 % --bmc1_ucm_layered_model none
% 0.47/0.76 % --bmc1_ucm_max_lemma_size 10
% 0.47/0.76
% 0.47/0.76 % ------ AIG Options
% 0.47/0.76
% 0.47/0.76 % --aig_mode false
% 0.47/0.76
% 0.47/0.76 % ------ Instantiation Options
% 0.47/0.76
% 0.47/0.76 % --instantiation_flag true
% 0.47/0.76 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.47/0.76 % --inst_solver_per_active 750
% 0.47/0.76 % --inst_solver_calls_frac 0.5
% 0.47/0.76 % --inst_passive_queue_type priority_queues
% 0.47/0.76 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.47/0.76 % --inst_passive_queues_freq [25;2]
% 150.25/150.44 % --inst_dismatching true
% 150.25/150.44 % --inst_eager_unprocessed_to_passive true
% 150.25/150.44 % --inst_prop_sim_given true
% 150.25/150.44 % --inst_prop_sim_new false
% 150.25/150.44 % --inst_orphan_elimination true
% 150.25/150.44 % --inst_learning_loop_flag true
% 150.25/150.44 % --inst_learning_start 3000
% 150.25/150.44 % --inst_learning_factor 2
% 150.25/150.44 % --inst_start_prop_sim_after_learn 3
% 150.25/150.44 % --inst_sel_renew solver
% 150.25/150.44 % --inst_lit_activity_flag true
% 150.25/150.44 % --inst_out_proof true
% 150.25/150.44
% 150.25/150.44 % ------ Resolution Options
% 150.25/150.44
% 150.25/150.44 % --resolution_flag true
% 150.25/150.44 % --res_lit_sel kbo_max
% 150.25/150.44 % --res_to_prop_solver none
% 150.25/150.44 % --res_prop_simpl_new false
% 150.25/150.44 % --res_prop_simpl_given false
% 150.25/150.44 % --res_passive_queue_type priority_queues
% 150.25/150.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.25/150.44 % --res_passive_queues_freq [15;5]
% 150.25/150.44 % --res_forward_subs full
% 150.25/150.44 % --res_backward_subs full
% 150.25/150.44 % --res_forward_subs_resolution true
% 150.25/150.44 % --res_backward_subs_resolution true
% 150.25/150.44 % --res_orphan_elimination false
% 150.25/150.44 % --res_time_limit 1000.
% 150.25/150.44 % --res_out_proof true
% 150.25/150.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ac0b0c.s
% 150.25/150.44 % --modulo true
% 150.25/150.44
% 150.25/150.44 % ------ Combination Options
% 150.25/150.44
% 150.25/150.44 % --comb_res_mult 1000
% 150.25/150.44 % --comb_inst_mult 300
% 150.25/150.44 % ------
% 150.25/150.44
% 150.25/150.44
% 150.25/150.44
% 150.25/150.44 % ------ Proving...
% 150.25/150.44 %
% 150.25/150.44
% 150.25/150.44
% 150.25/150.44 % Time Out Real
% 150.25/150.44
% 150.25/150.44 % ------ Statistics
% 150.25/150.44
% 150.25/150.44 % ------ General
% 150.25/150.44
% 150.25/150.44 % num_of_input_clauses: 205
% 150.25/150.44 % num_of_input_neg_conjectures: 3
% 150.25/150.44 % num_of_splits: 0
% 150.25/150.44 % num_of_split_atoms: 0
% 150.25/150.44 % num_of_sem_filtered_clauses: 0
% 150.25/150.44 % num_of_subtypes: 0
% 150.25/150.44 % monotx_restored_types: 0
% 150.25/150.44 % sat_num_of_epr_types: 0
% 150.25/150.44 % sat_num_of_non_cyclic_types: 0
% 150.25/150.44 % sat_guarded_non_collapsed_types: 0
% 150.25/150.44 % is_epr: 0
% 150.25/150.44 % is_horn: 0
% 150.25/150.44 % has_eq: 1
% 150.25/150.44 % num_pure_diseq_elim: 0
% 150.25/150.44 % simp_replaced_by: 2
% 150.25/150.44 % res_preprocessed: 84
% 150.25/150.44 % prep_upred: 0
% 150.25/150.44 % prep_unflattend: 0
% 150.25/150.44 % pred_elim_cands: 4
% 150.25/150.44 % pred_elim: 2
% 150.25/150.44 % pred_elim_cl: 2
% 150.25/150.44 % pred_elim_cycles: 3
% 150.25/150.44 % forced_gc_time: 0
% 150.25/150.44 % gc_basic_clause_elim: 0
% 150.25/150.44 % parsing_time: 0.007
% 150.25/150.44 % sem_filter_time: 0.
% 150.25/150.44 % pred_elim_time: 0.
% 150.25/150.44 % out_proof_time: 0.
% 150.25/150.44 % monotx_time: 0.
% 150.25/150.44 % subtype_inf_time: 0.
% 150.25/150.44 % unif_index_cands_time: 1.255
% 150.25/150.44 % unif_index_add_time: 0.063
% 150.25/150.44 % total_time: 150.016
% 150.25/150.44 % num_of_symbols: 73
% 150.25/150.44 % num_of_terms: 2717561
% 150.25/150.44
% 150.25/150.44 % ------ Propositional Solver
% 150.25/150.44
% 150.25/150.44 % prop_solver_calls: 25
% 150.25/150.44 % prop_fast_solver_calls: 317
% 150.25/150.44 % prop_num_of_clauses: 75908
% 150.25/150.44 % prop_preprocess_simplified: 71810
% 150.25/150.44 % prop_fo_subsumed: 0
% 150.25/150.44 % prop_solver_time: 0.016
% 150.25/150.44 % prop_fast_solver_time: 0.
% 150.25/150.44 % prop_unsat_core_time: 0.
% 150.25/150.44
% 150.25/150.44 % ------ QBF
% 150.25/150.44
% 150.25/150.44 % qbf_q_res: 0
% 150.25/150.44 % qbf_num_tautologies: 0
% 150.25/150.44 % qbf_prep_cycles: 0
% 150.25/150.44
% 150.25/150.44 % ------ BMC1
% 150.25/150.44
% 150.25/150.44 % bmc1_current_bound: -1
% 150.25/150.44 % bmc1_last_solved_bound: -1
% 150.25/150.44 % bmc1_unsat_core_size: -1
% 150.25/150.44 % bmc1_unsat_core_parents_size: -1
% 150.25/150.44 % bmc1_merge_next_fun: 0
% 150.25/150.44 % bmc1_unsat_core_clauses_time: 0.
% 150.25/150.44
% 150.25/150.44 % ------ Instantiation
% 150.25/150.44
% 150.25/150.44 % inst_num_of_clauses: 896
% 150.25/150.44 % inst_num_in_passive: 346
% 150.25/150.46 % inst_num_in_active: 296
% 150.25/150.46 % inst_num_in_unprocessed: 252
% 150.25/150.46 % inst_num_of_loops: 299
% 150.25/150.46 % inst_num_of_learning_restarts: 1
% 150.25/150.46 % inst_num_moves_active_passive: 0
% 150.25/150.46 % inst_lit_activity: 227
% 150.25/150.46 % inst_lit_activity_moves: 0
% 150.25/150.46 % inst_num_tautologies: 2
% 150.25/150.46 % inst_num_prop_implied: 0
% 150.25/150.46 % inst_num_existing_simplified: 0
% 150.25/150.46 % inst_num_eq_res_simplified: 0
% 150.25/150.46 % inst_num_child_elim: 0
% 150.25/150.46 % inst_num_of_dismatching_blockings: 66
% 150.25/150.46 % inst_num_of_non_proper_insts: 458
% 150.25/150.46 % inst_num_of_duplicates: 131
% 150.25/150.46 % inst_inst_num_from_inst_to_res: 0
% 150.25/150.46 % inst_dismatching_checking_time: 2.318
% 150.25/150.46
% 150.25/150.46 % ------ Resolution
% 150.25/150.46
% 150.25/150.46 % res_num_of_clauses: 2460368
% 150.25/150.46 % res_num_in_passive: 2457692
% 150.25/150.46 % res_num_in_active: 10757
% 150.25/150.46 % res_num_of_loops: 11731
% 150.25/150.46 % res_forward_subset_subsumed: 124160
% 150.25/150.46 % res_backward_subset_subsumed: 8460
% 150.25/150.46 % res_forward_subsumed: 840
% 150.25/150.46 % res_backward_subsumed: 60
% 150.25/150.46 % res_forward_subsumption_resolution: 180
% 150.25/150.46 % res_backward_subsumption_resolution: 16
% 150.25/150.46 % res_clause_to_clause_subsumption: 189924
% 150.25/150.46 % res_orphan_elimination: 0
% 150.25/150.46 % res_tautology_del: 1839
% 150.25/150.46 % res_num_eq_res_simplified: 1
% 150.25/150.46 % res_num_sel_changes: 0
% 150.25/150.46 % res_moves_from_active_to_pass: 0
% 150.25/150.46
% 150.30/150.47 % Status Unknown
% 150.30/150.53 % Orienting using strategy ClausalAll
% 150.30/150.53 % FOF problem with conjecture
% 150.30/150.53 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ac0b0c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_43fe92.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_eaac20 | grep -v "SZS"
% 150.30/150.54
% 150.30/150.54 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.30/150.54
% 150.30/150.54 %
% 150.30/150.54 % ------ iProver source info
% 150.30/150.54
% 150.30/150.54 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.30/150.54 % git: non_committed_changes: true
% 150.30/150.54 % git: last_make_outside_of_git: true
% 150.30/150.54
% 150.30/150.54 %
% 150.30/150.54 % ------ Input Options
% 150.30/150.54
% 150.30/150.54 % --out_options all
% 150.30/150.54 % --tptp_safe_out true
% 150.30/150.54 % --problem_path ""
% 150.30/150.54 % --include_path ""
% 150.30/150.54 % --clausifier .//eprover
% 150.30/150.54 % --clausifier_options --tstp-format
% 150.30/150.54 % --stdin false
% 150.30/150.54 % --dbg_backtrace false
% 150.30/150.54 % --dbg_dump_prop_clauses false
% 150.30/150.54 % --dbg_dump_prop_clauses_file -
% 150.30/150.54 % --dbg_out_stat false
% 150.30/150.54
% 150.30/150.54 % ------ General Options
% 150.30/150.54
% 150.30/150.54 % --fof false
% 150.30/150.54 % --time_out_real 150.
% 150.30/150.54 % --time_out_prep_mult 0.2
% 150.30/150.54 % --time_out_virtual -1.
% 150.30/150.54 % --schedule none
% 150.30/150.54 % --ground_splitting input
% 150.30/150.54 % --splitting_nvd 16
% 150.30/150.54 % --non_eq_to_eq false
% 150.30/150.54 % --prep_gs_sim true
% 150.30/150.54 % --prep_unflatten false
% 150.30/150.54 % --prep_res_sim true
% 150.30/150.54 % --prep_upred true
% 150.30/150.54 % --res_sim_input true
% 150.30/150.54 % --clause_weak_htbl true
% 150.30/150.54 % --gc_record_bc_elim false
% 150.30/150.54 % --symbol_type_check false
% 150.30/150.54 % --clausify_out false
% 150.30/150.54 % --large_theory_mode false
% 150.30/150.54 % --prep_sem_filter none
% 150.30/150.54 % --prep_sem_filter_out false
% 150.30/150.54 % --preprocessed_out false
% 150.30/150.54 % --sub_typing false
% 150.30/150.54 % --brand_transform false
% 150.30/150.54 % --pure_diseq_elim true
% 150.30/150.54 % --min_unsat_core false
% 150.30/150.54 % --pred_elim true
% 150.30/150.54 % --add_important_lit false
% 150.30/150.54 % --soft_assumptions false
% 150.30/150.54 % --reset_solvers false
% 150.30/150.54 % --bc_imp_inh []
% 150.30/150.54 % --conj_cone_tolerance 1.5
% 150.30/150.54 % --prolific_symb_bound 500
% 150.30/150.54 % --lt_threshold 2000
% 150.30/150.54
% 150.30/150.54 % ------ SAT Options
% 150.30/150.54
% 150.30/150.54 % --sat_mode false
% 150.30/150.54 % --sat_fm_restart_options ""
% 150.30/150.54 % --sat_gr_def false
% 150.30/150.54 % --sat_epr_types true
% 150.30/150.54 % --sat_non_cyclic_types false
% 150.30/150.54 % --sat_finite_models false
% 150.30/150.54 % --sat_fm_lemmas false
% 150.30/150.54 % --sat_fm_prep false
% 150.30/150.54 % --sat_fm_uc_incr true
% 150.30/150.54 % --sat_out_model small
% 150.30/150.54 % --sat_out_clauses false
% 150.30/150.54
% 150.30/150.54 % ------ QBF Options
% 150.30/150.54
% 150.30/150.54 % --qbf_mode false
% 150.30/150.54 % --qbf_elim_univ true
% 150.30/150.54 % --qbf_sk_in true
% 150.30/150.54 % --qbf_pred_elim true
% 150.30/150.54 % --qbf_split 32
% 150.30/150.54
% 150.30/150.54 % ------ BMC1 Options
% 150.30/150.54
% 150.30/150.54 % --bmc1_incremental false
% 150.30/150.54 % --bmc1_axioms reachable_all
% 150.30/150.54 % --bmc1_min_bound 0
% 150.30/150.54 % --bmc1_max_bound -1
% 150.30/150.54 % --bmc1_max_bound_default -1
% 150.30/150.54 % --bmc1_symbol_reachability true
% 150.30/150.54 % --bmc1_property_lemmas false
% 150.30/150.54 % --bmc1_k_induction false
% 150.30/150.54 % --bmc1_non_equiv_states false
% 150.30/150.54 % --bmc1_deadlock false
% 150.30/150.54 % --bmc1_ucm false
% 150.30/150.54 % --bmc1_add_unsat_core none
% 150.30/150.54 % --bmc1_unsat_core_children false
% 150.30/150.54 % --bmc1_unsat_core_extrapolate_axioms false
% 150.30/150.54 % --bmc1_out_stat full
% 150.30/150.54 % --bmc1_ground_init false
% 150.30/150.54 % --bmc1_pre_inst_next_state false
% 150.30/150.54 % --bmc1_pre_inst_state false
% 150.30/150.54 % --bmc1_pre_inst_reach_state false
% 150.30/150.54 % --bmc1_out_unsat_core false
% 150.30/150.54 % --bmc1_aig_witness_out false
% 150.30/150.54 % --bmc1_verbose false
% 150.30/150.54 % --bmc1_dump_clauses_tptp false
% 150.58/150.88 % --bmc1_dump_unsat_core_tptp false
% 150.58/150.88 % --bmc1_dump_file -
% 150.58/150.88 % --bmc1_ucm_expand_uc_limit 128
% 150.58/150.88 % --bmc1_ucm_n_expand_iterations 6
% 150.58/150.88 % --bmc1_ucm_extend_mode 1
% 150.58/150.88 % --bmc1_ucm_init_mode 2
% 150.58/150.88 % --bmc1_ucm_cone_mode none
% 150.58/150.88 % --bmc1_ucm_reduced_relation_type 0
% 150.58/150.88 % --bmc1_ucm_relax_model 4
% 150.58/150.88 % --bmc1_ucm_full_tr_after_sat true
% 150.58/150.88 % --bmc1_ucm_expand_neg_assumptions false
% 150.58/150.88 % --bmc1_ucm_layered_model none
% 150.58/150.88 % --bmc1_ucm_max_lemma_size 10
% 150.58/150.88
% 150.58/150.88 % ------ AIG Options
% 150.58/150.88
% 150.58/150.88 % --aig_mode false
% 150.58/150.88
% 150.58/150.88 % ------ Instantiation Options
% 150.58/150.88
% 150.58/150.88 % --instantiation_flag true
% 150.58/150.88 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.58/150.88 % --inst_solver_per_active 750
% 150.58/150.88 % --inst_solver_calls_frac 0.5
% 150.58/150.88 % --inst_passive_queue_type priority_queues
% 150.58/150.88 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.58/150.89 % --inst_passive_queues_freq [25;2]
% 150.58/150.89 % --inst_dismatching true
% 150.58/150.89 % --inst_eager_unprocessed_to_passive true
% 150.58/150.89 % --inst_prop_sim_given true
% 150.58/150.89 % --inst_prop_sim_new false
% 150.58/150.89 % --inst_orphan_elimination true
% 150.58/150.89 % --inst_learning_loop_flag true
% 150.58/150.89 % --inst_learning_start 3000
% 150.58/150.89 % --inst_learning_factor 2
% 150.58/150.89 % --inst_start_prop_sim_after_learn 3
% 150.58/150.89 % --inst_sel_renew solver
% 150.58/150.89 % --inst_lit_activity_flag true
% 150.58/150.89 % --inst_out_proof true
% 150.58/150.89
% 150.58/150.89 % ------ Resolution Options
% 150.58/150.89
% 150.58/150.89 % --resolution_flag true
% 150.58/150.89 % --res_lit_sel kbo_max
% 150.58/150.89 % --res_to_prop_solver none
% 150.58/150.89 % --res_prop_simpl_new false
% 150.58/150.89 % --res_prop_simpl_given false
% 150.58/150.89 % --res_passive_queue_type priority_queues
% 150.58/150.89 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.58/150.89 % --res_passive_queues_freq [15;5]
% 150.58/150.89 % --res_forward_subs full
% 150.58/150.89 % --res_backward_subs full
% 150.58/150.89 % --res_forward_subs_resolution true
% 150.58/150.89 % --res_backward_subs_resolution true
% 150.58/150.89 % --res_orphan_elimination false
% 150.58/150.89 % --res_time_limit 1000.
% 150.58/150.89 % --res_out_proof true
% 150.58/150.89 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ac0b0c.s
% 150.58/150.89 % --modulo true
% 150.58/150.89
% 150.58/150.89 % ------ Combination Options
% 150.58/150.89
% 150.58/150.89 % --comb_res_mult 1000
% 150.58/150.89 % --comb_inst_mult 300
% 150.58/150.89 % ------
% 150.58/150.89
% 150.58/150.89 % ------ Parsing...% successful
% 150.58/150.89
% 150.58/150.89 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe_e snvd_s sp: 0 0s snvd_e %
% 150.58/150.89
% 150.58/150.89 % ------ Proving...
% 150.58/150.89 % ------ Problem Properties
% 150.58/150.89
% 150.58/150.89 %
% 150.58/150.89 % EPR false
% 150.58/150.89 % Horn false
% 150.58/150.89 % Has equality true
% 150.58/150.89
% 150.58/150.89 % % ------ Input Options Time Limit: Unbounded
% 150.58/150.89
% 150.58/150.89
% 150.58/150.89 Compiling...
% 150.58/150.89 Loading plugin: done.
% 150.58/150.89 Compiling...
% 150.58/150.89 Loading plugin: done.
% 150.58/150.89 Compiling...
% 150.58/150.89 Loading plugin: done.
% 150.58/150.89 % % ------ Current options:
% 150.58/150.89
% 150.58/150.89 % ------ Input Options
% 150.58/150.89
% 150.58/150.89 % --out_options all
% 150.58/150.89 % --tptp_safe_out true
% 150.58/150.89 % --problem_path ""
% 150.58/150.89 % --include_path ""
% 150.58/150.89 % --clausifier .//eprover
% 150.58/150.89 % --clausifier_options --tstp-format
% 150.58/150.89 % --stdin false
% 150.58/150.89 % --dbg_backtrace false
% 150.58/150.89 % --dbg_dump_prop_clauses false
% 150.58/150.89 % --dbg_dump_prop_clauses_file -
% 150.58/150.89 % --dbg_out_stat false
% 150.58/150.89
% 150.58/150.89 % ------ General Options
% 150.58/150.89
% 150.58/150.89 % --fof false
% 150.58/150.89 % --time_out_real 150.
% 150.58/150.89 % --time_out_prep_mult 0.2
% 150.58/150.89 % --time_out_virtual -1.
% 150.58/150.89 % --schedule none
% 150.58/150.89 % --ground_splitting input
% 150.58/150.89 % --splitting_nvd 16
% 150.58/150.89 % --non_eq_to_eq false
% 150.58/150.89 % --prep_gs_sim true
% 150.58/150.89 % --prep_unflatten false
% 150.58/150.89 % --prep_res_sim true
% 150.58/150.89 % --prep_upred true
% 150.58/150.89 % --res_sim_input true
% 150.58/150.89 % --clause_weak_htbl true
% 150.58/150.89 % --gc_record_bc_elim false
% 150.58/150.89 % --symbol_type_check false
% 150.58/150.89 % --clausify_out false
% 150.58/150.89 % --large_theory_mode false
% 150.58/150.89 % --prep_sem_filter none
% 150.58/150.89 % --prep_sem_filter_out false
% 150.58/150.89 % --preprocessed_out false
% 150.58/150.89 % --sub_typing false
% 150.58/150.89 % --brand_transform false
% 150.58/150.89 % --pure_diseq_elim true
% 150.58/150.89 % --min_unsat_core false
% 150.58/150.89 % --pred_elim true
% 150.58/150.89 % --add_important_lit false
% 150.58/150.89 % --soft_assumptions false
% 150.58/150.89 % --reset_solvers false
% 150.58/150.89 % --bc_imp_inh []
% 150.58/150.89 % --conj_cone_tolerance 1.5
% 150.58/150.89 % --prolific_symb_bound 500
% 150.58/150.89 % --lt_threshold 2000
% 150.58/150.89
% 150.58/150.89 % ------ SAT Options
% 150.58/150.89
% 150.58/150.89 % --sat_mode false
% 150.58/150.89 % --sat_fm_restart_options ""
% 150.58/150.89 % --sat_gr_def false
% 150.58/150.89 % --sat_epr_types true
% 150.58/150.89 % --sat_non_cyclic_types false
% 150.58/150.89 % --sat_finite_models false
% 150.58/150.89 % --sat_fm_lemmas false
% 150.58/150.89 % --sat_fm_prep false
% 150.58/150.89 % --sat_fm_uc_incr true
% 150.58/150.89 % --sat_out_model small
% 150.58/150.89 % --sat_out_clauses false
% 150.58/150.89
% 150.58/150.89 % ------ QBF Options
% 150.58/150.89
% 150.58/150.89 % --qbf_mode false
% 150.58/150.89 % --qbf_elim_univ true
% 150.58/150.89 % --qbf_sk_in true
% 150.58/150.89 % --qbf_pred_elim true
% 150.58/150.89 % --qbf_split 32
% 150.58/150.89
% 150.58/150.89 % ------ BMC1 Options
% 150.58/150.89
% 150.58/150.89 % --bmc1_incremental false
% 150.58/150.89 % --bmc1_axioms reachable_all
% 150.58/150.89 % --bmc1_min_bound 0
% 150.58/150.89 % --bmc1_max_bound -1
% 150.58/150.89 % --bmc1_max_bound_default -1
% 150.58/150.89 % --bmc1_symbol_reachability true
% 150.58/150.89 % --bmc1_property_lemmas false
% 150.58/150.89 % --bmc1_k_induction false
% 150.58/150.89 % --bmc1_non_equiv_states false
% 150.58/150.89 % --bmc1_deadlock false
% 150.58/150.89 % --bmc1_ucm false
% 150.58/150.89 % --bmc1_add_unsat_core none
% 150.58/150.89 % --bmc1_unsat_core_children false
% 150.58/150.89 % --bmc1_unsat_core_extrapolate_axioms false
% 150.58/150.89 % --bmc1_out_stat full
% 150.58/150.89 % --bmc1_ground_init false
% 150.58/150.89 % --bmc1_pre_inst_next_state false
% 150.58/150.89 % --bmc1_pre_inst_state false
% 150.58/150.89 % --bmc1_pre_inst_reach_state false
% 150.58/150.89 % --bmc1_out_unsat_core false
% 150.58/150.89 % --bmc1_aig_witness_out false
% 150.58/150.89 % --bmc1_verbose false
% 150.58/150.89 % --bmc1_dump_clauses_tptp false
% 150.58/150.89 % --bmc1_dump_unsat_core_tptp false
% 150.58/150.89 % --bmc1_dump_file -
% 150.58/150.89 % --bmc1_ucm_expand_uc_limit 128
% 150.58/150.89 % --bmc1_ucm_n_expand_iterations 6
% 150.58/150.89 % --bmc1_ucm_extend_mode 1
% 150.58/150.89 % --bmc1_ucm_init_mode 2
% 150.58/150.89 % --bmc1_ucm_cone_mode none
% 150.58/150.89 % --bmc1_ucm_reduced_relation_type 0
% 150.58/150.89 % --bmc1_ucm_relax_model 4
% 150.58/150.89 % --bmc1_ucm_full_tr_after_sat true
% 150.58/150.89 % --bmc1_ucm_expand_neg_assumptions false
% 150.58/150.89 % --bmc1_ucm_layered_model none
% 150.58/150.89 % --bmc1_ucm_max_lemma_size 10
% 150.58/150.89
% 150.58/150.89 % ------ AIG Options
% 150.58/150.89
% 150.58/150.89 % --aig_mode false
% 150.58/150.89
% 150.58/150.89 % ------ Instantiation Options
% 150.58/150.89
% 150.58/150.89 % --instantiation_flag true
% 150.58/150.89 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.58/150.89 % --inst_solver_per_active 750
% 150.58/150.89 % --inst_solver_calls_frac 0.5
% 150.58/150.89 % --inst_passive_queue_type priority_queues
% 150.58/150.89 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.58/150.89 % --inst_passive_queues_freq [25;2]
% 151.78/152.03 % --inst_dismatching true
% 151.78/152.03 % --inst_eager_unprocessed_to_passive true
% 151.78/152.03 % --inst_prop_sim_given true
% 151.78/152.03 % --inst_prop_sim_new false
% 151.78/152.03 % --inst_orphan_elimination true
% 151.78/152.03 % --inst_learning_loop_flag true
% 151.78/152.03 % --inst_learning_start 3000
% 151.78/152.03 % --inst_learning_factor 2
% 151.78/152.03 % --inst_start_prop_sim_after_learn 3
% 151.78/152.03 % --inst_sel_renew solver
% 151.78/152.03 % --inst_lit_activity_flag true
% 151.78/152.03 % --inst_out_proof true
% 151.78/152.03
% 151.78/152.03 % ------ Resolution Options
% 151.78/152.03
% 151.78/152.03 % --resolution_flag true
% 151.78/152.03 % --res_lit_sel kbo_max
% 151.78/152.03 % --res_to_prop_solver none
% 151.78/152.03 % --res_prop_simpl_new false
% 151.78/152.03 % --res_prop_simpl_given false
% 151.78/152.03 % --res_passive_queue_type priority_queues
% 151.78/152.03 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 151.78/152.03 % --res_passive_queues_freq [15;5]
% 151.78/152.03 % --res_forward_subs full
% 151.78/152.03 % --res_backward_subs full
% 151.78/152.03 % --res_forward_subs_resolution true
% 151.78/152.03 % --res_backward_subs_resolution true
% 151.78/152.03 % --res_orphan_elimination false
% 151.78/152.03 % --res_time_limit 1000.
% 151.78/152.03 % --res_out_proof true
% 151.78/152.03 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ac0b0c.s
% 151.78/152.03 % --modulo true
% 151.78/152.03
% 151.78/152.03 % ------ Combination Options
% 151.78/152.03
% 151.78/152.03 % --comb_res_mult 1000
% 151.78/152.03 % --comb_inst_mult 300
% 151.78/152.03 % ------
% 151.78/152.03
% 151.78/152.03
% 151.78/152.03
% 151.78/152.03 % ------ Proving...
% 151.78/152.03 %
% 151.78/152.03
% 151.78/152.03
% 151.78/152.03 % ------ Statistics
% 151.78/152.03
% 151.78/152.03 % ------ General
% 151.78/152.03
% 151.78/152.03 % num_of_input_clauses: 350
% 151.78/152.03 % num_of_input_neg_conjectures: 3
% 151.78/152.03 % num_of_splits: 0
% 151.78/152.03 % num_of_split_atoms: 0
% 151.78/152.03 % num_of_sem_filtered_clauses: 0
% 151.78/152.03 % num_of_subtypes: 0
% 151.78/152.03 % monotx_restored_types: 0
% 151.78/152.03 % sat_num_of_epr_types: 0
% 151.78/152.03 % sat_num_of_non_cyclic_types: 0
% 151.78/152.03 % sat_guarded_non_collapsed_types: 0
% 151.78/152.03 % is_epr: 0
% 151.78/152.03 % is_horn: 0
% 151.78/152.03 % has_eq: 1
% 151.78/152.03 % num_pure_diseq_elim: 0
% 151.78/152.03 % simp_replaced_by: 0
% 151.78/152.03 % res_preprocessed: 84
% 151.78/152.03 % prep_upred: 0
% 151.78/152.03 % prep_unflattend: 0
% 151.78/152.03 % pred_elim_cands: 4
% 151.78/152.03 % pred_elim: 2
% 151.78/152.03 % pred_elim_cl: 2
% 151.78/152.03 % pred_elim_cycles: 3
% 151.78/152.03 % forced_gc_time: 0
% 151.78/152.03 % gc_basic_clause_elim: 0
% 151.78/152.03 % parsing_time: 0.007
% 151.78/152.03 % sem_filter_time: 0.
% 151.78/152.03 % pred_elim_time: 0.
% 151.78/152.03 % out_proof_time: 0.
% 151.78/152.03 % monotx_time: 0.
% 151.78/152.03 % subtype_inf_time: 0.
% 151.78/152.03 % unif_index_cands_time: 0.006
% 151.78/152.03 % unif_index_add_time: 0.002
% 151.78/152.03 % total_time: 1.494
% 151.78/152.03 % num_of_symbols: 73
% 151.78/152.03 % num_of_terms: 53480
% 151.78/152.03
% 151.78/152.03 % ------ Propositional Solver
% 151.78/152.03
% 151.78/152.03 % prop_solver_calls: 4
% 151.78/152.03 % prop_fast_solver_calls: 317
% 151.78/152.03 % prop_num_of_clauses: 1062
% 151.78/152.03 % prop_preprocess_simplified: 3253
% 151.78/152.03 % prop_fo_subsumed: 0
% 151.78/152.03 % prop_solver_time: 0.
% 151.78/152.03 % prop_fast_solver_time: 0.
% 151.78/152.03 % prop_unsat_core_time: 0.
% 151.78/152.03
% 151.78/152.03 % ------ QBF
% 151.78/152.03
% 151.78/152.03 % qbf_q_res: 0
% 151.78/152.03 % qbf_num_tautologies: 0
% 151.78/152.03 % qbf_prep_cycles: 0
% 151.78/152.03
% 151.78/152.03 % ------ BMC1
% 151.78/152.03
% 151.78/152.03 % bmc1_current_bound: -1
% 151.78/152.03 % bmc1_last_solved_bound: -1
% 151.78/152.03 % bmc1_unsat_core_size: -1
% 151.78/152.03 % bmc1_unsat_core_parents_size: -1
% 151.78/152.03 % bmc1_merge_next_fun: 0
% 151.78/152.03 % bmc1_unsat_core_clauses_time: 0.
% 151.78/152.03
% 151.78/152.03 % ------ Instantiation
% 151.78/152.03
% 151.78/152.03 % inst_num_of_clauses: 785
% 151.78/152.03 % inst_num_in_passive: 546
% 151.78/152.03 % inst_num_in_active: 202
% 151.78/152.03 % inst_num_in_unprocessed: 35
% 151.78/152.03 % inst_num_of_loops: 210
% 151.78/152.03 % inst_num_of_learning_restarts: 0
% 151.78/152.03 % inst_num_moves_active_passive: 6
% 151.78/152.03 % inst_lit_activity: 114
% 151.78/152.03 % inst_lit_activity_moves: 0
% 151.78/152.03 % inst_num_tautologies: 0
% 151.78/152.03 % inst_num_prop_implied: 0
% 151.78/152.03 % inst_num_existing_simplified: 0
% 151.78/152.03 % inst_num_eq_res_simplified: 0
% 151.78/152.03 % inst_num_child_elim: 0
% 151.78/152.03 % inst_num_of_dismatching_blockings: 98
% 151.78/152.03 % inst_num_of_non_proper_insts: 379
% 151.78/152.03 % inst_num_of_duplicates: 393
% 151.78/152.03 % inst_inst_num_from_inst_to_res: 0
% 151.78/152.03 % inst_dismatching_checking_time: 0.
% 151.78/152.03
% 151.78/152.03 % ------ Resolution
% 151.78/152.03
% 151.78/152.03 % res_num_of_clauses: 18479
% 151.78/152.03 % res_num_in_passive: 17460
% 151.78/152.03 % res_num_in_active: 853
% 151.78/152.03 % res_num_of_loops: 1000
% 151.78/152.03 % res_forward_subset_subsumed: 911
% 151.78/152.03 % res_backward_subset_subsumed: 8
% 151.78/152.03 % res_forward_subsumed: 282
% 151.78/152.03 % res_backward_subsumed: 2
% 151.78/152.03 % res_forward_subsumption_resolution: 22
% 151.78/152.03 % res_backward_subsumption_resolution: 0
% 151.78/152.03 % res_clause_to_clause_subsumption: 6180
% 151.78/152.03 % res_orphan_elimination: 0
% 151.78/152.03 % res_tautology_del: 53
% 151.78/152.03 % res_num_eq_res_simplified: 0
% 151.78/152.03 % res_num_sel_changes: 0
% 151.78/152.03 % res_moves_from_active_to_pass: 0
% 151.78/152.03
% 151.78/152.03 % Status Unsatisfiable
% 151.78/152.03 % SZS status Theorem
% 151.78/152.03 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------