TSTP Solution File: SEU154+2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU154+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n019.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:23 EDT 2022
% Result : Theorem 154.60s 154.86s
% Output : CNFRefutation 154.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 86
% Syntax : Number of formulae : 713 ( 207 unt; 0 def)
% Number of atoms : 1689 ( 595 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 1700 ( 724 ~; 791 |; 91 &)
% ( 46 <=>; 48 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 34 ( 34 usr; 9 con; 0-3 aty)
% Number of variables : 1551 ( 100 sgn 486 !; 8 ?)
% 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 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('<stdin>',d3_xboole_0) ).
fof(c_0_1,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_2,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_3,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('<stdin>',d2_tarski) ).
fof(c_0_4,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('<stdin>',d1_zfmisc_1) ).
fof(c_0_5,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('<stdin>',t2_tarski) ).
fof(c_0_6,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('<stdin>',d1_tarski) ).
fof(c_0_7,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('<stdin>',d3_tarski) ).
fof(c_0_8,axiom,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X2,X1)) ),
file('<stdin>',fc3_xboole_0) ).
fof(c_0_9,axiom,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X1,X2)) ),
file('<stdin>',fc2_xboole_0) ).
fof(c_0_10,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',d10_xboole_0) ).
fof(c_0_11,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
file('<stdin>',antisymmetry_r2_xboole_0) ).
fof(c_0_12,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('<stdin>',antisymmetry_r2_hidden) ).
fof(c_0_13,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
file('<stdin>',d8_xboole_0) ).
fof(c_0_14,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('<stdin>',symmetry_r1_xboole_0) ).
fof(c_0_15,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('<stdin>',d7_xboole_0) ).
fof(c_0_16,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('<stdin>',t7_boole) ).
fof(c_0_17,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('<stdin>',commutativity_k3_xboole_0) ).
fof(c_0_18,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('<stdin>',commutativity_k2_xboole_0) ).
fof(c_0_19,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('<stdin>',commutativity_k2_tarski) ).
fof(c_0_20,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('<stdin>',d1_xboole_0) ).
fof(c_0_21,axiom,
! [X1,X2] : ~ proper_subset(X1,X1),
file('<stdin>',irreflexivity_r2_xboole_0) ).
fof(c_0_22,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('<stdin>',t8_boole) ).
fof(c_0_23,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('<stdin>',idempotence_k3_xboole_0) ).
fof(c_0_24,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('<stdin>',idempotence_k2_xboole_0) ).
fof(c_0_25,axiom,
! [X1,X2] : subset(X1,X1),
file('<stdin>',reflexivity_r1_tarski) ).
fof(c_0_26,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('<stdin>',t3_boole) ).
fof(c_0_27,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
file('<stdin>',t1_boole) ).
fof(c_0_28,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
file('<stdin>',t4_boole) ).
fof(c_0_29,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('<stdin>',t2_boole) ).
fof(c_0_30,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('<stdin>',t6_boole) ).
fof(c_0_31,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_32,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_33,axiom,
empty(empty_set),
file('<stdin>',fc1_xboole_0) ).
fof(c_0_34,axiom,
$true,
file('<stdin>',dt_k4_xboole_0) ).
fof(c_0_35,axiom,
$true,
file('<stdin>',dt_k3_xboole_0) ).
fof(c_0_36,axiom,
$true,
file('<stdin>',dt_k2_xboole_0) ).
fof(c_0_37,axiom,
$true,
file('<stdin>',dt_k2_tarski) ).
fof(c_0_38,axiom,
$true,
file('<stdin>',dt_k1_zfmisc_1) ).
fof(c_0_39,axiom,
$true,
file('<stdin>',dt_k1_xboole_0) ).
fof(c_0_40,axiom,
$true,
file('<stdin>',dt_k1_tarski) ).
fof(c_0_41,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
c_0_0 ).
fof(c_0_42,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_1]) ).
fof(c_0_43,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
c_0_2 ).
fof(c_0_44,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
c_0_3 ).
fof(c_0_45,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
c_0_4 ).
fof(c_0_46,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
c_0_5 ).
fof(c_0_47,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
c_0_6 ).
fof(c_0_48,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
c_0_7 ).
fof(c_0_49,plain,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_50,plain,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X1,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_51,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_10 ).
fof(c_0_52,plain,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_53,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_54,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
c_0_13 ).
fof(c_0_55,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
c_0_14 ).
fof(c_0_56,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
c_0_15 ).
fof(c_0_57,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
c_0_16 ).
fof(c_0_58,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
c_0_17 ).
fof(c_0_59,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
c_0_18 ).
fof(c_0_60,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
c_0_19 ).
fof(c_0_61,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_62,plain,
! [X1,X2] : ~ proper_subset(X1,X1),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_63,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
c_0_22 ).
fof(c_0_64,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
c_0_23 ).
fof(c_0_65,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
c_0_24 ).
fof(c_0_66,axiom,
! [X1,X2] : subset(X1,X1),
c_0_25 ).
fof(c_0_67,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
c_0_26 ).
fof(c_0_68,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
c_0_27 ).
fof(c_0_69,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
c_0_28 ).
fof(c_0_70,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
c_0_29 ).
fof(c_0_71,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
c_0_30 ).
fof(c_0_72,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
fof(c_0_73,axiom,
? [X1] : empty(X1),
c_0_32 ).
fof(c_0_74,axiom,
empty(empty_set),
c_0_33 ).
fof(c_0_75,axiom,
$true,
c_0_34 ).
fof(c_0_76,axiom,
$true,
c_0_35 ).
fof(c_0_77,axiom,
$true,
c_0_36 ).
fof(c_0_78,axiom,
$true,
c_0_37 ).
fof(c_0_79,axiom,
$true,
c_0_38 ).
fof(c_0_80,axiom,
$true,
c_0_39 ).
fof(c_0_81,axiom,
$true,
c_0_40 ).
fof(c_0_82,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(esk7_3(X10,X11,X12),X12)
| ~ in(esk7_3(X10,X11,X12),X10)
| ~ in(esk7_3(X10,X11,X12),X11)
| X12 = set_intersection2(X10,X11) )
& ( in(esk7_3(X10,X11,X12),X10)
| in(esk7_3(X10,X11,X12),X12)
| X12 = set_intersection2(X10,X11) )
& ( in(esk7_3(X10,X11,X12),X11)
| in(esk7_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_41])])])])])]) ).
fof(c_0_83,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(esk8_3(X10,X11,X12),X12)
| ~ in(esk8_3(X10,X11,X12),X10)
| in(esk8_3(X10,X11,X12),X11)
| X12 = set_difference(X10,X11) )
& ( in(esk8_3(X10,X11,X12),X10)
| in(esk8_3(X10,X11,X12),X12)
| X12 = set_difference(X10,X11) )
& ( ~ in(esk8_3(X10,X11,X12),X11)
| in(esk8_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_42])])])])])]) ).
fof(c_0_84,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_43])])])])])]) ).
fof(c_0_85,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_44])])])])])]) ).
fof(c_0_86,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_45])])])])])]) ).
fof(c_0_87,plain,
! [X4,X5] :
( ( ~ in(esk11_2(X4,X5),X4)
| ~ in(esk11_2(X4,X5),X5)
| X4 = X5 )
& ( in(esk11_2(X4,X5),X4)
| in(esk11_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_46])])])]) ).
fof(c_0_88,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_47])])])])])]) ).
fof(c_0_89,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk6_2(X7,X8),X7)
| subset(X7,X8) )
& ( ~ in(esk6_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_48])])])])])]) ).
fof(c_0_90,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_49])])])]) ).
fof(c_0_91,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_50])])])]) ).
fof(c_0_92,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_51])])])])]) ).
fof(c_0_93,plain,
! [X3,X4] :
( ~ proper_subset(X3,X4)
| ~ proper_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])]) ).
fof(c_0_94,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])]) ).
fof(c_0_95,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_54])])])])]) ).
fof(c_0_96,plain,
! [X3,X4] :
( ~ disjoint(X3,X4)
| disjoint(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_55])]) ).
fof(c_0_97,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_56])])])]) ).
fof(c_0_98,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_57])]) ).
fof(c_0_99,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[c_0_58]) ).
fof(c_0_100,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[c_0_59]) ).
fof(c_0_101,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[c_0_60]) ).
fof(c_0_102,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_61])])])])]) ).
fof(c_0_103,plain,
! [X3,X4] : ~ proper_subset(X3,X3),
inference(variable_rename,[status(thm)],[c_0_62]) ).
fof(c_0_104,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_63])])])]) ).
fof(c_0_105,plain,
! [X3,X4] : set_intersection2(X3,X3) = X3,
inference(variable_rename,[status(thm)],[c_0_64]) ).
fof(c_0_106,plain,
! [X3,X4] : set_union2(X3,X3) = X3,
inference(variable_rename,[status(thm)],[c_0_65]) ).
fof(c_0_107,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[c_0_66]) ).
fof(c_0_108,plain,
! [X2] : set_difference(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[c_0_67]) ).
fof(c_0_109,plain,
! [X2] : set_union2(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[c_0_68]) ).
fof(c_0_110,plain,
! [X2] : set_difference(empty_set,X2) = empty_set,
inference(variable_rename,[status(thm)],[c_0_69]) ).
fof(c_0_111,plain,
! [X2] : set_intersection2(X2,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[c_0_70]) ).
fof(c_0_112,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_71])]) ).
fof(c_0_113,plain,
~ empty(esk10_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_72])]) ).
fof(c_0_114,plain,
empty(esk9_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_73])]) ).
fof(c_0_115,axiom,
empty(empty_set),
c_0_74 ).
fof(c_0_116,axiom,
$true,
c_0_75 ).
fof(c_0_117,axiom,
$true,
c_0_76 ).
fof(c_0_118,axiom,
$true,
c_0_77 ).
fof(c_0_119,axiom,
$true,
c_0_78 ).
fof(c_0_120,axiom,
$true,
c_0_79 ).
fof(c_0_121,axiom,
$true,
c_0_80 ).
fof(c_0_122,axiom,
$true,
c_0_81 ).
cnf(c_0_123,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk7_3(X2,X3,X1),X3)
| ~ in(esk7_3(X2,X3,X1),X2)
| ~ in(esk7_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_124,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X3)
| ~ in(esk8_3(X2,X3,X1),X2)
| ~ in(esk8_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_125,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_84]) ).
cnf(c_0_126,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_84]) ).
cnf(c_0_127,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_84]) ).
cnf(c_0_128,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| ~ in(esk8_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_129,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_85]) ).
cnf(c_0_130,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_85]) ).
cnf(c_0_131,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| in(esk8_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_132,plain,
( X1 = set_intersection2(X2,X3)
| in(esk7_3(X2,X3,X1),X1)
| in(esk7_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_133,plain,
( X1 = set_intersection2(X2,X3)
| in(esk7_3(X2,X3,X1),X1)
| in(esk7_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_134,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_85]) ).
cnf(c_0_135,plain,
( X1 = powerset(X2)
| ~ subset(esk3_2(X2,X1),X2)
| ~ in(esk3_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_136,plain,
( X1 = X2
| ~ in(esk11_2(X1,X2),X2)
| ~ in(esk11_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_137,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) != X2
| ~ in(esk1_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_138,plain,
( X1 = powerset(X2)
| subset(esk3_2(X2,X1),X2)
| in(esk3_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_139,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_140,plain,
( X1 = X2
| in(esk11_2(X1,X2),X2)
| in(esk11_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_141,plain,
( subset(X1,X2)
| ~ in(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_142,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_143,plain,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_144,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_145,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_146,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_147,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_148,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_149,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_150,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) = X2
| in(esk1_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_151,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_152,plain,
( subset(X1,X2)
| in(esk6_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_153,plain,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_154,plain,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_155,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_156,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_157,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_158,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_159,plain,
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_160,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_161,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_162,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_163,plain,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_164,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_165,plain,
( subset(X1,X2)
| ~ proper_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_166,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_167,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_168,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_169,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_170,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_171,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_172,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_173,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_174,plain,
( ~ proper_subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_175,plain,
( ~ in(X1,X2)
| X2 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_176,plain,
~ proper_subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_177,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_178,plain,
( subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_179,plain,
( subset(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_180,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_181,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_182,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_183,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_184,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_185,plain,
set_union2(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_186,plain,
set_difference(empty_set,X1) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_187,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_188,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_189,plain,
~ empty(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_190,plain,
empty(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_191,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_192,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_193,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_194,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_195,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_196,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_197,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_198,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_199,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk7_3(X2,X3,X1),X3)
| ~ in(esk7_3(X2,X3,X1),X2)
| ~ in(esk7_3(X2,X3,X1),X1) ),
c_0_123,
[final] ).
cnf(c_0_200,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X3)
| ~ in(esk8_3(X2,X3,X1),X2)
| ~ in(esk8_3(X2,X3,X1),X1) ),
c_0_124,
[final] ).
cnf(c_0_201,plain,
( X1 = set_union2(X2,X3)
| ~ in(esk5_3(X2,X3,X1),X1)
| ~ in(esk5_3(X2,X3,X1),X2) ),
c_0_125,
[final] ).
cnf(c_0_202,plain,
( X1 = set_union2(X2,X3)
| ~ in(esk5_3(X2,X3,X1),X1)
| ~ in(esk5_3(X2,X3,X1),X3) ),
c_0_126,
[final] ).
cnf(c_0_203,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_127,
[final] ).
cnf(c_0_204,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| ~ in(esk8_3(X2,X3,X1),X3) ),
c_0_128,
[final] ).
cnf(c_0_205,plain,
( X1 = unordered_pair(X2,X3)
| ~ in(esk4_3(X2,X3,X1),X1)
| esk4_3(X2,X3,X1) != X2 ),
c_0_129,
[final] ).
cnf(c_0_206,plain,
( X1 = unordered_pair(X2,X3)
| ~ in(esk4_3(X2,X3,X1),X1)
| esk4_3(X2,X3,X1) != X3 ),
c_0_130,
[final] ).
cnf(c_0_207,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| in(esk8_3(X2,X3,X1),X2) ),
c_0_131,
[final] ).
cnf(c_0_208,plain,
( X1 = set_intersection2(X2,X3)
| in(esk7_3(X2,X3,X1),X1)
| in(esk7_3(X2,X3,X1),X2) ),
c_0_132,
[final] ).
cnf(c_0_209,plain,
( X1 = set_intersection2(X2,X3)
| in(esk7_3(X2,X3,X1),X1)
| in(esk7_3(X2,X3,X1),X3) ),
c_0_133,
[final] ).
cnf(c_0_210,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_134,
[final] ).
cnf(c_0_211,plain,
( X1 = powerset(X2)
| ~ subset(esk3_2(X2,X1),X2)
| ~ in(esk3_2(X2,X1),X1) ),
c_0_135,
[final] ).
cnf(c_0_212,plain,
( X1 = X2
| ~ in(esk11_2(X1,X2),X2)
| ~ in(esk11_2(X1,X2),X1) ),
c_0_136,
[final] ).
cnf(c_0_213,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) != X2
| ~ in(esk1_2(X2,X1),X1) ),
c_0_137,
[final] ).
cnf(c_0_214,plain,
( X1 = powerset(X2)
| subset(esk3_2(X2,X1),X2)
| in(esk3_2(X2,X1),X1) ),
c_0_138,
[final] ).
cnf(c_0_215,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
c_0_139,
[final] ).
cnf(c_0_216,plain,
( X1 = X2
| in(esk11_2(X1,X2),X2)
| in(esk11_2(X1,X2),X1) ),
c_0_140,
[final] ).
cnf(c_0_217,plain,
( subset(X1,X2)
| ~ in(esk6_2(X1,X2),X2) ),
c_0_141,
[final] ).
cnf(c_0_218,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
c_0_142,
[final] ).
cnf(c_0_219,plain,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
c_0_143,
[final] ).
cnf(c_0_220,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
c_0_144,
[final] ).
cnf(c_0_221,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
c_0_145,
[final] ).
cnf(c_0_222,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
c_0_146,
[final] ).
cnf(c_0_223,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
c_0_147,
[final] ).
cnf(c_0_224,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X2) ),
c_0_148,
[final] ).
cnf(c_0_225,plain,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X3) ),
c_0_149,
[final] ).
cnf(c_0_226,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) = X2
| in(esk1_2(X2,X1),X1) ),
c_0_150,
[final] ).
cnf(c_0_227,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
c_0_151,
[final] ).
cnf(c_0_228,plain,
( subset(X1,X2)
| in(esk6_2(X1,X2),X1) ),
c_0_152,
[final] ).
cnf(c_0_229,plain,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
c_0_153,
[final] ).
cnf(c_0_230,plain,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
c_0_154,
[final] ).
cnf(c_0_231,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
c_0_155,
[final] ).
cnf(c_0_232,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_156,
[final] ).
cnf(c_0_233,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
c_0_157,
[final] ).
cnf(c_0_234,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
c_0_158,
[final] ).
cnf(c_0_235,plain,
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
c_0_159,
[final] ).
cnf(c_0_236,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_160,
[final] ).
cnf(c_0_237,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
c_0_161,
[final] ).
cnf(c_0_238,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
c_0_162,
[final] ).
cnf(c_0_239,plain,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
c_0_163,
[final] ).
cnf(c_0_240,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
c_0_164,
[final] ).
cnf(c_0_241,plain,
( subset(X1,X2)
| ~ proper_subset(X1,X2) ),
c_0_165,
[final] ).
cnf(c_0_242,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
c_0_166,
[final] ).
cnf(c_0_243,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
c_0_167,
[final] ).
cnf(c_0_244,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
c_0_168,
[final] ).
cnf(c_0_245,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
c_0_169,
[final] ).
cnf(c_0_246,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
c_0_170,
[final] ).
cnf(c_0_247,plain,
set_union2(X1,X2) = set_union2(X2,X1),
c_0_171,
[final] ).
cnf(c_0_248,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
c_0_172,
[final] ).
cnf(c_0_249,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
c_0_173,
[final] ).
cnf(c_0_250,plain,
( ~ proper_subset(X1,X2)
| X1 != X2 ),
c_0_174,
[final] ).
cnf(c_0_251,plain,
( ~ in(X1,X2)
| X2 != empty_set ),
c_0_175,
[final] ).
cnf(c_0_252,plain,
~ proper_subset(X1,X1),
c_0_176,
[final] ).
cnf(c_0_253,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
c_0_177,
[final] ).
cnf(c_0_254,plain,
( subset(X1,X2)
| X1 != X2 ),
c_0_178,
[final] ).
cnf(c_0_255,plain,
( subset(X2,X1)
| X1 != X2 ),
c_0_179,
[final] ).
cnf(c_0_256,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
c_0_180,
[final] ).
cnf(c_0_257,plain,
set_intersection2(X1,X1) = X1,
c_0_181,
[final] ).
cnf(c_0_258,plain,
set_union2(X1,X1) = X1,
c_0_182,
[final] ).
cnf(c_0_259,plain,
subset(X1,X1),
c_0_183,
[final] ).
cnf(c_0_260,plain,
set_difference(X1,empty_set) = X1,
c_0_184,
[final] ).
cnf(c_0_261,plain,
set_union2(X1,empty_set) = X1,
c_0_185,
[final] ).
cnf(c_0_262,plain,
set_difference(empty_set,X1) = empty_set,
c_0_186,
[final] ).
cnf(c_0_263,plain,
set_intersection2(X1,empty_set) = empty_set,
c_0_187,
[final] ).
cnf(c_0_264,plain,
( X1 = empty_set
| ~ empty(X1) ),
c_0_188,
[final] ).
cnf(c_0_265,plain,
~ empty(esk10_0),
c_0_189,
[final] ).
cnf(c_0_266,plain,
empty(esk9_0),
c_0_190,
[final] ).
cnf(c_0_267,plain,
empty(empty_set),
c_0_191,
[final] ).
cnf(c_0_268,plain,
$true,
c_0_192,
[final] ).
cnf(c_0_269,plain,
$true,
c_0_193,
[final] ).
cnf(c_0_270,plain,
$true,
c_0_194,
[final] ).
cnf(c_0_271,plain,
$true,
c_0_195,
[final] ).
cnf(c_0_272,plain,
$true,
c_0_196,
[final] ).
cnf(c_0_273,plain,
$true,
c_0_197,
[final] ).
cnf(c_0_274,plain,
$true,
c_0_198,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_199_0,axiom,
( X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk7_3(X2,X3,X1),X3)
| ~ in(sk1_esk7_3(X2,X3,X1),X2)
| ~ in(sk1_esk7_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_199_1,axiom,
( ~ in(sk1_esk7_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk7_3(X2,X3,X1),X2)
| ~ in(sk1_esk7_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_199_2,axiom,
( ~ in(sk1_esk7_3(X2,X3,X1),X2)
| ~ in(sk1_esk7_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk7_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_199_3,axiom,
( ~ in(sk1_esk7_3(X2,X3,X1),X1)
| ~ in(sk1_esk7_3(X2,X3,X1),X2)
| ~ in(sk1_esk7_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_200_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk8_3(X2,X3,X1),X3)
| ~ in(sk1_esk8_3(X2,X3,X1),X2)
| ~ in(sk1_esk8_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_200_1,axiom,
( in(sk1_esk8_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk8_3(X2,X3,X1),X2)
| ~ in(sk1_esk8_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_200_2,axiom,
( ~ in(sk1_esk8_3(X2,X3,X1),X2)
| in(sk1_esk8_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk8_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_200_3,axiom,
( ~ in(sk1_esk8_3(X2,X3,X1),X1)
| ~ in(sk1_esk8_3(X2,X3,X1),X2)
| in(sk1_esk8_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_201_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_201]) ).
cnf(c_0_201_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_201]) ).
cnf(c_0_201_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_201]) ).
cnf(c_0_202_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_202]) ).
cnf(c_0_202_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_202]) ).
cnf(c_0_202_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_202]) ).
cnf(c_0_203_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_203]) ).
cnf(c_0_203_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_203]) ).
cnf(c_0_203_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_203]) ).
cnf(c_0_203_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_203]) ).
cnf(c_0_204_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk8_3(X2,X3,X1),X1)
| ~ in(sk1_esk8_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_204]) ).
cnf(c_0_204_1,axiom,
( in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk8_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_204]) ).
cnf(c_0_204_2,axiom,
( ~ in(sk1_esk8_3(X2,X3,X1),X3)
| in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_204]) ).
cnf(c_0_205_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_205]) ).
cnf(c_0_205_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_205]) ).
cnf(c_0_205_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_205]) ).
cnf(c_0_206_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_206]) ).
cnf(c_0_206_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_206]) ).
cnf(c_0_206_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_206]) ).
cnf(c_0_207_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk8_3(X2,X3,X1),X1)
| in(sk1_esk8_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_207_1,axiom,
( in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3)
| in(sk1_esk8_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_207_2,axiom,
( in(sk1_esk8_3(X2,X3,X1),X2)
| in(sk1_esk8_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_208_0,axiom,
( X1 = set_intersection2(X2,X3)
| in(sk1_esk7_3(X2,X3,X1),X1)
| in(sk1_esk7_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_208_1,axiom,
( in(sk1_esk7_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3)
| in(sk1_esk7_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_208_2,axiom,
( in(sk1_esk7_3(X2,X3,X1),X2)
| in(sk1_esk7_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_209_0,axiom,
( X1 = set_intersection2(X2,X3)
| in(sk1_esk7_3(X2,X3,X1),X1)
| in(sk1_esk7_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_209_1,axiom,
( in(sk1_esk7_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3)
| in(sk1_esk7_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_209_2,axiom,
( in(sk1_esk7_3(X2,X3,X1),X3)
| in(sk1_esk7_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_210_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_210]) ).
cnf(c_0_210_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_210]) ).
cnf(c_0_210_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_210]) ).
cnf(c_0_210_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_210]) ).
cnf(c_0_211_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_211]) ).
cnf(c_0_211_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_211]) ).
cnf(c_0_211_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_211]) ).
cnf(c_0_212_0,axiom,
( X1 = X2
| ~ in(sk1_esk11_2(X1,X2),X2)
| ~ in(sk1_esk11_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
cnf(c_0_212_1,axiom,
( ~ in(sk1_esk11_2(X1,X2),X2)
| X1 = X2
| ~ in(sk1_esk11_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
cnf(c_0_212_2,axiom,
( ~ in(sk1_esk11_2(X1,X2),X1)
| ~ in(sk1_esk11_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
cnf(c_0_213_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_213]) ).
cnf(c_0_213_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_213]) ).
cnf(c_0_213_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_213]) ).
cnf(c_0_214_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_214]) ).
cnf(c_0_214_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_214]) ).
cnf(c_0_214_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_214]) ).
cnf(c_0_215_0,axiom,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_215_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X1)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_215_2,axiom,
( ~ in(X4,X3)
| X1 != set_intersection2(X2,X3)
| in(X4,X1)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_215_3,axiom,
( ~ in(X4,X2)
| ~ in(X4,X3)
| X1 != set_intersection2(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_216_0,axiom,
( X1 = X2
| in(sk1_esk11_2(X1,X2),X2)
| in(sk1_esk11_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_216_1,axiom,
( in(sk1_esk11_2(X1,X2),X2)
| X1 = X2
| in(sk1_esk11_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_216_2,axiom,
( in(sk1_esk11_2(X1,X2),X1)
| in(sk1_esk11_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_217_0,axiom,
( subset(X1,X2)
| ~ in(sk1_esk6_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_217]) ).
cnf(c_0_217_1,axiom,
( ~ in(sk1_esk6_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_217]) ).
cnf(c_0_218_0,axiom,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_218_1,axiom,
( in(X4,X3)
| in(X4,X1)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_218_2,axiom,
( X1 != set_difference(X2,X3)
| in(X4,X3)
| in(X4,X1)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_218_3,axiom,
( ~ in(X4,X2)
| X1 != set_difference(X2,X3)
| in(X4,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_219_0,axiom,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_219_1,axiom,
( in(X4,X2)
| in(X4,X3)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_219_2,axiom,
( X1 != set_union2(X2,X3)
| in(X4,X2)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_219_3,axiom,
( ~ in(X4,X1)
| X1 != set_union2(X2,X3)
| in(X4,X2)
| in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_220_0,axiom,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_220_1,axiom,
( ~ in(X4,X1)
| X1 != set_difference(X2,X3)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_220_2,axiom,
( ~ in(X4,X3)
| ~ in(X4,X1)
| X1 != set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_221_0,axiom,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_221_1,axiom,
( X1 != set_difference(X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_221_2,axiom,
( ~ in(X4,X1)
| X1 != set_difference(X2,X3)
| in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_222_0,axiom,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_222_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_222_2,axiom,
( ~ in(X4,X1)
| X1 != set_intersection2(X2,X3)
| in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_223_0,axiom,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_223_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_223_2,axiom,
( ~ in(X4,X1)
| X1 != set_intersection2(X2,X3)
| in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_224_0,axiom,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_224]) ).
cnf(c_0_224_1,axiom,
( X1 != set_union2(X2,X3)
| in(X4,X1)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_224]) ).
cnf(c_0_224_2,axiom,
( ~ in(X4,X2)
| X1 != set_union2(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_224]) ).
cnf(c_0_225_0,axiom,
( in(X4,X1)
| X1 != set_union2(X2,X3)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_225_1,axiom,
( X1 != set_union2(X2,X3)
| in(X4,X1)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_225_2,axiom,
( ~ in(X4,X3)
| X1 != set_union2(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_226_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_226]) ).
cnf(c_0_226_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_226]) ).
cnf(c_0_226_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_226]) ).
cnf(c_0_227_0,axiom,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_227_1,axiom,
( ~ in(X1,X3)
| in(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_227_2,axiom,
( ~ subset(X3,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_228_0,axiom,
( subset(X1,X2)
| in(sk1_esk6_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_228]) ).
cnf(c_0_228_1,axiom,
( in(sk1_esk6_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_228]) ).
cnf(c_0_229_0,axiom,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_229]) ).
cnf(c_0_229_1,axiom,
( ~ empty(set_union2(X1,X2))
| empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_229]) ).
cnf(c_0_230_0,axiom,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_230]) ).
cnf(c_0_230_1,axiom,
( ~ empty(set_union2(X1,X2))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_230]) ).
cnf(c_0_231_0,axiom,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_231_1,axiom,
( X4 = X2
| X4 = X3
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_231_2,axiom,
( X1 != unordered_pair(X2,X3)
| X4 = X2
| X4 = X3
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_231_3,axiom,
( ~ in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 = X2
| X4 = X3 ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_232_0,axiom,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_232_1,axiom,
( ~ subset(X2,X1)
| X1 = X2
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_232_2,axiom,
( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_233_0,axiom,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_233_1,axiom,
( X1 != powerset(X2)
| subset(X3,X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_233_2,axiom,
( ~ in(X3,X1)
| X1 != powerset(X2)
| subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_234_0,axiom,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_234]) ).
cnf(c_0_234_1,axiom,
( X1 != powerset(X2)
| in(X3,X1)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_234]) ).
cnf(c_0_234_2,axiom,
( ~ subset(X3,X2)
| X1 != powerset(X2)
| in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_234]) ).
cnf(c_0_235_0,axiom,
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_235]) ).
cnf(c_0_235_1,axiom,
( ~ proper_subset(X2,X1)
| ~ proper_subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_235]) ).
cnf(c_0_236_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_236]) ).
cnf(c_0_236_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_236]) ).
cnf(c_0_237_0,axiom,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_237_1,axiom,
( X1 != unordered_pair(X2,X3)
| in(X4,X1)
| X4 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_237_2,axiom,
( X4 != X2
| X1 != unordered_pair(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_238_0,axiom,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_238]) ).
cnf(c_0_238_1,axiom,
( X1 != unordered_pair(X2,X3)
| in(X4,X1)
| X4 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_238]) ).
cnf(c_0_238_2,axiom,
( X4 != X3
| X1 != unordered_pair(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_238]) ).
cnf(c_0_239_0,axiom,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_239_1,axiom,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_239_2,axiom,
( ~ subset(X1,X2)
| X1 = X2
| proper_subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_240_0,axiom,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_240]) ).
cnf(c_0_240_1,axiom,
( ~ disjoint(X2,X1)
| disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_240]) ).
cnf(c_0_241_0,axiom,
( subset(X1,X2)
| ~ proper_subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_241]) ).
cnf(c_0_241_1,axiom,
( ~ proper_subset(X1,X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_241]) ).
cnf(c_0_242_0,axiom,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_242]) ).
cnf(c_0_242_1,axiom,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_242]) ).
cnf(c_0_243_0,axiom,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(literals_permutation,[status(thm)],[c_0_243]) ).
cnf(c_0_243_1,axiom,
( set_intersection2(X1,X2) != empty_set
| disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_243]) ).
cnf(c_0_244_0,axiom,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_244]) ).
cnf(c_0_244_1,axiom,
( X1 != singleton(X2)
| X3 = X2
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_244]) ).
cnf(c_0_244_2,axiom,
( ~ in(X3,X1)
| X1 != singleton(X2)
| X3 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_244]) ).
cnf(c_0_245_0,axiom,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_245]) ).
cnf(c_0_245_1,axiom,
( ~ in(X2,X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_245]) ).
cnf(c_0_249_0,axiom,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_249]) ).
cnf(c_0_249_1,axiom,
( X1 != singleton(X2)
| in(X3,X1)
| X3 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_249]) ).
cnf(c_0_249_2,axiom,
( X3 != X2
| X1 != singleton(X2)
| in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_249]) ).
cnf(c_0_250_0,axiom,
( ~ proper_subset(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_250]) ).
cnf(c_0_250_1,axiom,
( X1 != X2
| ~ proper_subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_250]) ).
cnf(c_0_251_0,axiom,
( ~ in(X1,X2)
| X2 != empty_set ),
inference(literals_permutation,[status(thm)],[c_0_251]) ).
cnf(c_0_251_1,axiom,
( X2 != empty_set
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_251]) ).
cnf(c_0_253_0,axiom,
( X1 = empty_set
| in(sk1_esk2_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_253]) ).
cnf(c_0_253_1,axiom,
( in(sk1_esk2_1(X1),X1)
| X1 = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_253]) ).
cnf(c_0_254_0,axiom,
( subset(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_254]) ).
cnf(c_0_254_1,axiom,
( X1 != X2
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_254]) ).
cnf(c_0_255_0,axiom,
( subset(X2,X1)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_255]) ).
cnf(c_0_255_1,axiom,
( X1 != X2
| subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_255]) ).
cnf(c_0_256_0,axiom,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_256]) ).
cnf(c_0_256_1,axiom,
( ~ empty(X1)
| X2 = X1
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_256]) ).
cnf(c_0_256_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| X2 = X1 ),
inference(literals_permutation,[status(thm)],[c_0_256]) ).
cnf(c_0_264_0,axiom,
( X1 = empty_set
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_264]) ).
cnf(c_0_264_1,axiom,
( ~ empty(X1)
| X1 = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_264]) ).
cnf(c_0_252_0,axiom,
~ proper_subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_252]) ).
cnf(c_0_265_0,axiom,
~ empty(sk1_esk10_0),
inference(literals_permutation,[status(thm)],[c_0_265]) ).
cnf(c_0_246_0,axiom,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_246]) ).
cnf(c_0_247_0,axiom,
set_union2(X1,X2) = set_union2(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_247]) ).
cnf(c_0_248_0,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_248]) ).
cnf(c_0_257_0,axiom,
set_intersection2(X1,X1) = X1,
inference(literals_permutation,[status(thm)],[c_0_257]) ).
cnf(c_0_258_0,axiom,
set_union2(X1,X1) = X1,
inference(literals_permutation,[status(thm)],[c_0_258]) ).
cnf(c_0_259_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_259]) ).
cnf(c_0_260_0,axiom,
set_difference(X1,empty_set) = X1,
inference(literals_permutation,[status(thm)],[c_0_260]) ).
cnf(c_0_261_0,axiom,
set_union2(X1,empty_set) = X1,
inference(literals_permutation,[status(thm)],[c_0_261]) ).
cnf(c_0_262_0,axiom,
set_difference(empty_set,X1) = empty_set,
inference(literals_permutation,[status(thm)],[c_0_262]) ).
cnf(c_0_263_0,axiom,
set_intersection2(X1,empty_set) = empty_set,
inference(literals_permutation,[status(thm)],[c_0_263]) ).
cnf(c_0_266_0,axiom,
empty(sk1_esk9_0),
inference(literals_permutation,[status(thm)],[c_0_266]) ).
cnf(c_0_267_0,axiom,
empty(empty_set),
inference(literals_permutation,[status(thm)],[c_0_267]) ).
cnf(c_0_268_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_269_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_270_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_271_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_272_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_273_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_274_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_274]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,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_1_002,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
file('<stdin>',t33_xboole_1) ).
fof(c_0_2_003,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('<stdin>',t26_xboole_1) ).
fof(c_0_3_004,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_4_005,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('<stdin>',t8_xboole_1) ).
fof(c_0_5_006,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('<stdin>',t19_xboole_1) ).
fof(c_0_6_007,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_7_008,lemma,
! [X1,X2] :
( subset(X1,X2)
=> X2 = set_union2(X1,set_difference(X2,X1)) ),
file('<stdin>',t45_xboole_1) ).
fof(c_0_8_009,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
file('<stdin>',t63_xboole_1) ).
fof(c_0_9_010,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('<stdin>',t1_xboole_1) ).
fof(c_0_10_011,lemma,
! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
file('<stdin>',l25_zfmisc_1) ).
fof(c_0_11_012,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('<stdin>',t48_xboole_1) ).
fof(c_0_12_013,lemma,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('<stdin>',t40_xboole_1) ).
fof(c_0_13_014,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('<stdin>',t39_xboole_1) ).
fof(c_0_14_015,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_15_016,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('<stdin>',l2_zfmisc_1) ).
fof(c_0_16_017,lemma,
! [X1,X2] :
~ ( subset(X1,X2)
& proper_subset(X2,X1) ),
file('<stdin>',t60_xboole_1) ).
fof(c_0_17_018,lemma,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
file('<stdin>',t6_zfmisc_1) ).
fof(c_0_18_019,lemma,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
file('<stdin>',l23_zfmisc_1) ).
fof(c_0_19_020,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('<stdin>',t7_xboole_1) ).
fof(c_0_20_021,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('<stdin>',t36_xboole_1) ).
fof(c_0_21_022,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('<stdin>',t17_xboole_1) ).
fof(c_0_22_023,lemma,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('<stdin>',l4_zfmisc_1) ).
fof(c_0_23_024,lemma,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('<stdin>',t83_xboole_1) ).
fof(c_0_24_025,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('<stdin>',t28_xboole_1) ).
fof(c_0_25_026,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('<stdin>',t12_xboole_1) ).
fof(c_0_26_027,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('<stdin>',t37_xboole_1) ).
fof(c_0_27_028,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('<stdin>',l32_xboole_1) ).
fof(c_0_28_029,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('<stdin>',t9_zfmisc_1) ).
fof(c_0_29_030,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('<stdin>',t8_zfmisc_1) ).
fof(c_0_30_031,conjecture,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('<stdin>',l28_zfmisc_1) ).
fof(c_0_31_032,lemma,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('<stdin>',t3_xboole_1) ).
fof(c_0_32_033,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('<stdin>',t69_enumset1) ).
fof(c_0_33_034,lemma,
! [X1] : subset(empty_set,X1),
file('<stdin>',t2_xboole_1) ).
fof(c_0_34_035,lemma,
! [X1] : singleton(X1) != empty_set,
file('<stdin>',l1_zfmisc_1) ).
fof(c_0_35_036,lemma,
powerset(empty_set) = singleton(empty_set),
file('<stdin>',t1_zfmisc_1) ).
fof(c_0_36_037,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
c_0_0 ).
fof(c_0_37_038,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
c_0_1 ).
fof(c_0_38_039,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
c_0_2 ).
fof(c_0_39_040,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_3]) ).
fof(c_0_40_041,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
c_0_4 ).
fof(c_0_41_042,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
c_0_5 ).
fof(c_0_42_043,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_6]) ).
fof(c_0_43_044,lemma,
! [X1,X2] :
( subset(X1,X2)
=> X2 = set_union2(X1,set_difference(X2,X1)) ),
c_0_7 ).
fof(c_0_44_045,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
c_0_8 ).
fof(c_0_45_046,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
c_0_9 ).
fof(c_0_46_047,lemma,
! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
c_0_10 ).
fof(c_0_47_048,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
c_0_11 ).
fof(c_0_48_049,lemma,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
c_0_12 ).
fof(c_0_49_050,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
c_0_13 ).
fof(c_0_50_051,lemma,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
c_0_14 ).
fof(c_0_51_052,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
c_0_15 ).
fof(c_0_52_053,lemma,
! [X1,X2] :
~ ( subset(X1,X2)
& proper_subset(X2,X1) ),
c_0_16 ).
fof(c_0_53_054,lemma,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
c_0_17 ).
fof(c_0_54_055,lemma,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
c_0_18 ).
fof(c_0_55_056,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
c_0_19 ).
fof(c_0_56_057,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
c_0_20 ).
fof(c_0_57_058,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
c_0_21 ).
fof(c_0_58_059,lemma,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
c_0_22 ).
fof(c_0_59_060,lemma,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
c_0_23 ).
fof(c_0_60_061,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
c_0_24 ).
fof(c_0_61_062,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
c_0_25 ).
fof(c_0_62_063,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
c_0_26 ).
fof(c_0_63_064,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
c_0_27 ).
fof(c_0_64_065,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
c_0_28 ).
fof(c_0_65_066,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
c_0_29 ).
fof(c_0_66_067,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_30])]) ).
fof(c_0_67_068,lemma,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
c_0_31 ).
fof(c_0_68_069,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
c_0_32 ).
fof(c_0_69_070,lemma,
! [X1] : subset(empty_set,X1),
c_0_33 ).
fof(c_0_70_071,lemma,
! [X1] : singleton(X1) != empty_set,
c_0_34 ).
fof(c_0_71_072,lemma,
powerset(empty_set) = singleton(empty_set),
c_0_35 ).
fof(c_0_72_073,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_36])])])]) ).
fof(c_0_73_074,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_37])])])]) ).
fof(c_0_74_075,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_38])])])]) ).
fof(c_0_75_076,lemma,
! [X4,X5,X7,X8,X9] :
( ( disjoint(X4,X5)
| in(esk4_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_39])])])])]) ).
fof(c_0_76_077,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_40])]) ).
fof(c_0_77_078,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_41])]) ).
fof(c_0_78_079,lemma,
! [X4,X5,X7,X8,X9] :
( ( in(esk3_2(X4,X5),X4)
| disjoint(X4,X5) )
& ( in(esk3_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_42])])])])])]) ).
fof(c_0_79_080,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_43])]) ).
fof(c_0_80_081,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_44])]) ).
fof(c_0_81_082,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_45])]) ).
fof(c_0_82_083,lemma,
! [X3,X4] :
( ~ disjoint(singleton(X3),X4)
| ~ in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])]) ).
fof(c_0_83_084,lemma,
! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
inference(variable_rename,[status(thm)],[c_0_47]) ).
fof(c_0_84_085,lemma,
! [X3,X4] : set_difference(set_union2(X3,X4),X4) = set_difference(X3,X4),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_85_086,lemma,
! [X3,X4] : set_union2(X3,set_difference(X4,X3)) = set_union2(X3,X4),
inference(variable_rename,[status(thm)],[c_0_49]) ).
fof(c_0_86_087,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_50])]) ).
fof(c_0_87_088,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_51])])])]) ).
fof(c_0_88_089,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| ~ proper_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])]) ).
fof(c_0_89_090,lemma,
! [X3,X4] :
( ~ subset(singleton(X3),singleton(X4))
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])]) ).
fof(c_0_90_091,lemma,
! [X3,X4] :
( ~ in(X3,X4)
| set_union2(singleton(X3),X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])]) ).
fof(c_0_91_092,lemma,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[c_0_55]) ).
fof(c_0_92_093,lemma,
! [X3,X4] : subset(set_difference(X3,X4),X3),
inference(variable_rename,[status(thm)],[c_0_56]) ).
fof(c_0_93_094,lemma,
! [X3,X4] : subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[c_0_57]) ).
fof(c_0_94_095,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_58])])])])]) ).
fof(c_0_95_096,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_59])])])]) ).
fof(c_0_96_097,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_intersection2(X3,X4) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])]) ).
fof(c_0_97_098,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_union2(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])]) ).
fof(c_0_98_099,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_62])])])]) ).
fof(c_0_99_100,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_63])])])]) ).
fof(c_0_100_101,lemma,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])]) ).
fof(c_0_101_102,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_65])])])]) ).
fof(c_0_102_103,negated_conjecture,
( ~ in(esk1_0,esk2_0)
& ~ disjoint(singleton(esk1_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_66])])]) ).
fof(c_0_103_104,lemma,
! [X2] :
( ~ subset(X2,empty_set)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_67])]) ).
fof(c_0_104_105,lemma,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[c_0_68]) ).
fof(c_0_105_106,lemma,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[c_0_69]) ).
fof(c_0_106_107,lemma,
! [X2] : singleton(X2) != empty_set,
inference(variable_rename,[status(thm)],[c_0_70]) ).
fof(c_0_107_108,lemma,
powerset(empty_set) = singleton(empty_set),
c_0_71 ).
cnf(c_0_108_109,lemma,
( subset(X1,set_difference(X2,singleton(X3)))
| in(X3,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_109_110,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_110_111,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_111_112,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_112_113,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_113_114,lemma,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_114_115,lemma,
( in(esk4_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_115_116,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_116_117,lemma,
( X1 = set_union2(X2,set_difference(X1,X2))
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_117_118,lemma,
( disjoint(X1,X2)
| ~ disjoint(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_118_119,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_119_120,lemma,
( ~ in(X1,X2)
| ~ disjoint(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_120_121,lemma,
( disjoint(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_121_122,lemma,
( disjoint(X1,X2)
| in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_122_123,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_123_124,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_124_125,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_125_126,lemma,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_126_127,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_127_128,lemma,
( ~ proper_subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_128_129,lemma,
( X1 = X2
| ~ subset(singleton(X1),singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_129_130,lemma,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_130_131,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_131_132,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_132_133,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_133_134,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_134_135,lemma,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_135_136,lemma,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_136_137,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_137_138,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_138_139,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_139_140,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_140_141,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_141_142,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_142_143,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_143_144,lemma,
( X1 = X2
| singleton(X3) != unordered_pair(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_144_145,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_145_146,lemma,
( subset(X1,singleton(X2))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_146_147,negated_conjecture,
~ disjoint(singleton(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_147_148,lemma,
( subset(X1,singleton(X2))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_148_149,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_149_150,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_150_151,negated_conjecture,
~ in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_151_152,lemma,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_152_153,lemma,
singleton(X1) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_153_154,lemma,
powerset(empty_set) = singleton(empty_set),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_154_155,lemma,
( subset(X1,set_difference(X2,singleton(X3)))
| in(X3,X1)
| ~ subset(X1,X2) ),
c_0_108,
[final] ).
cnf(c_0_155_156,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
c_0_109,
[final] ).
cnf(c_0_156_157,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
c_0_110,
[final] ).
cnf(c_0_157_158,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
c_0_111,
[final] ).
cnf(c_0_158_159,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
c_0_112,
[final] ).
cnf(c_0_159_160,lemma,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
c_0_113,
[final] ).
cnf(c_0_160_161,lemma,
( in(esk4_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
c_0_114,
[final] ).
cnf(c_0_161_162,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
c_0_115,
[final] ).
cnf(c_0_162_163,lemma,
( set_union2(X2,set_difference(X1,X2)) = X1
| ~ subset(X2,X1) ),
c_0_116,
[final] ).
cnf(c_0_163_164,lemma,
( disjoint(X1,X2)
| ~ disjoint(X3,X2)
| ~ subset(X1,X3) ),
c_0_117,
[final] ).
cnf(c_0_164_165,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
c_0_118,
[final] ).
cnf(c_0_165_166,lemma,
( ~ in(X1,X2)
| ~ disjoint(singleton(X1),X2) ),
c_0_119,
[final] ).
cnf(c_0_166_167,lemma,
( disjoint(X1,X2)
| in(esk3_2(X1,X2),X1) ),
c_0_120,
[final] ).
cnf(c_0_167_168,lemma,
( disjoint(X1,X2)
| in(esk3_2(X1,X2),X2) ),
c_0_121,
[final] ).
cnf(c_0_168_169,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
c_0_122,
[final] ).
cnf(c_0_169_170,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
c_0_123,
[final] ).
cnf(c_0_170_171,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
c_0_124,
[final] ).
cnf(c_0_171_172,lemma,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
c_0_125,
[final] ).
cnf(c_0_172_173,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
c_0_126,
[final] ).
cnf(c_0_173_174,lemma,
( ~ proper_subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_127,
[final] ).
cnf(c_0_174_175,lemma,
( X1 = X2
| ~ subset(singleton(X1),singleton(X2)) ),
c_0_128,
[final] ).
cnf(c_0_175_176,lemma,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
c_0_129,
[final] ).
cnf(c_0_176_177,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
c_0_130,
[final] ).
cnf(c_0_177_178,lemma,
subset(X1,set_union2(X1,X2)),
c_0_131,
[final] ).
cnf(c_0_178_179,lemma,
subset(set_difference(X1,X2),X1),
c_0_132,
[final] ).
cnf(c_0_179_180,lemma,
subset(set_intersection2(X1,X2),X1),
c_0_133,
[final] ).
cnf(c_0_180_181,lemma,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
c_0_134,
[final] ).
cnf(c_0_181_182,lemma,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
c_0_135,
[final] ).
cnf(c_0_182_183,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
c_0_136,
[final] ).
cnf(c_0_183_184,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
c_0_137,
[final] ).
cnf(c_0_184_185,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
c_0_138,
[final] ).
cnf(c_0_185_186,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
c_0_139,
[final] ).
cnf(c_0_186_187,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
c_0_140,
[final] ).
cnf(c_0_187_188,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
c_0_141,
[final] ).
cnf(c_0_188_189,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
c_0_142,
[final] ).
cnf(c_0_189_190,lemma,
( X1 = X2
| singleton(X3) != unordered_pair(X1,X2) ),
c_0_143,
[final] ).
cnf(c_0_190_191,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
c_0_144,
[final] ).
cnf(c_0_191_192,lemma,
( subset(X1,singleton(X2))
| X1 != singleton(X2) ),
c_0_145,
[final] ).
cnf(c_0_192_193,negated_conjecture,
~ disjoint(singleton(esk1_0),esk2_0),
c_0_146,
[final] ).
cnf(c_0_193_194,lemma,
( subset(X1,singleton(X2))
| X1 != empty_set ),
c_0_147,
[final] ).
cnf(c_0_194_195,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
c_0_148,
[final] ).
cnf(c_0_195_196,lemma,
unordered_pair(X1,X1) = singleton(X1),
c_0_149,
[final] ).
cnf(c_0_196_197,negated_conjecture,
~ in(esk1_0,esk2_0),
c_0_150,
[final] ).
cnf(c_0_197_198,lemma,
subset(empty_set,X1),
c_0_151,
[final] ).
cnf(c_0_198_199,lemma,
singleton(X1) != empty_set,
c_0_152,
[final] ).
cnf(c_0_199_200,lemma,
singleton(empty_set) = powerset(empty_set),
c_0_153,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_197,plain,
( ~ subset(X0,singleton(X1))
| X0 = empty_set
| X0 = singleton(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_180) ).
cnf(c_330,plain,
( ~ subset(X0,singleton(X1))
| X0 = empty_set
| X0 = singleton(X1) ),
inference(copy,[status(esa)],[c_197]) ).
cnf(c_406,plain,
( ~ subset(X0,singleton(X1))
| X0 = empty_set
| X0 = singleton(X1) ),
inference(copy,[status(esa)],[c_330]) ).
cnf(c_453,plain,
( ~ subset(X0,singleton(X1))
| X0 = empty_set
| X0 = singleton(X1) ),
inference(copy,[status(esa)],[c_406]) ).
cnf(c_514,plain,
( ~ subset(X0,singleton(X1))
| X0 = empty_set
| X0 = singleton(X1) ),
inference(copy,[status(esa)],[c_453]) ).
cnf(c_1165,plain,
( ~ subset(X0,singleton(X1))
| X0 = empty_set
| X0 = singleton(X1) ),
inference(copy,[status(esa)],[c_514]) ).
cnf(c_198,plain,
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_181) ).
cnf(c_332,plain,
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(copy,[status(esa)],[c_198]) ).
cnf(c_407,plain,
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(copy,[status(esa)],[c_332]) ).
cnf(c_452,plain,
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(copy,[status(esa)],[c_407]) ).
cnf(c_515,plain,
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(copy,[status(esa)],[c_452]) ).
cnf(c_1167,plain,
( disjoint(X0,X1)
| set_difference(X0,X1) != X0 ),
inference(copy,[status(esa)],[c_515]) ).
cnf(c_5005,plain,
( ~ subset(set_difference(singleton(X0),X1),singleton(X0))
| disjoint(singleton(X0),X1)
| set_difference(singleton(X0),X1) = empty_set ),
inference(resolution,[status(thm)],[c_1165,c_1167]) ).
cnf(c_5006,plain,
( ~ subset(set_difference(singleton(X0),X1),singleton(X0))
| disjoint(singleton(X0),X1)
| set_difference(singleton(X0),X1) = empty_set ),
inference(rewriting,[status(thm)],[c_5005]) ).
cnf(c_218,plain,
subset(set_difference(X0,X1),X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_178) ).
cnf(c_368,plain,
subset(set_difference(X0,X1),X0),
inference(copy,[status(esa)],[c_218]) ).
cnf(c_425,plain,
subset(set_difference(X0,X1),X0),
inference(copy,[status(esa)],[c_368]) ).
cnf(c_434,plain,
subset(set_difference(X0,X1),X0),
inference(copy,[status(esa)],[c_425]) ).
cnf(c_490,plain,
subset(set_difference(X0,X1),X0),
inference(copy,[status(esa)],[c_434]) ).
cnf(c_1117,plain,
subset(set_difference(X0,X1),X0),
inference(copy,[status(esa)],[c_490]) ).
cnf(c_48998,plain,
( disjoint(singleton(X0),X1)
| set_difference(singleton(X0),X1) = empty_set ),
inference(forward_subsumption_resolution,[status(thm)],[c_5006,c_1117]) ).
cnf(c_48999,plain,
( disjoint(singleton(X0),X1)
| set_difference(singleton(X0),X1) = empty_set ),
inference(rewriting,[status(thm)],[c_48998]) ).
cnf(c_202,plain,
( subset(X0,X1)
| set_difference(X0,X1) != empty_set ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_185) ).
cnf(c_340,plain,
( subset(X0,X1)
| set_difference(X0,X1) != empty_set ),
inference(copy,[status(esa)],[c_202]) ).
cnf(c_411,plain,
( subset(X0,X1)
| set_difference(X0,X1) != empty_set ),
inference(copy,[status(esa)],[c_340]) ).
cnf(c_448,plain,
( subset(X0,X1)
| set_difference(X0,X1) != empty_set ),
inference(copy,[status(esa)],[c_411]) ).
cnf(c_476,plain,
( subset(X0,X1)
| set_difference(X0,X1) != empty_set ),
inference(copy,[status(esa)],[c_448]) ).
cnf(c_1089,plain,
( subset(X0,X1)
| set_difference(X0,X1) != empty_set ),
inference(copy,[status(esa)],[c_476]) ).
cnf(c_49016,plain,
( subset(singleton(X0),X1)
| disjoint(singleton(X0),X1) ),
inference(resolution,[status(thm)],[c_48999,c_1089]) ).
cnf(c_49017,plain,
( subset(singleton(X0),X1)
| disjoint(singleton(X0),X1) ),
inference(rewriting,[status(thm)],[c_49016]) ).
cnf(c_211,negated_conjecture,
~ disjoint(singleton(sk2_esk1_0),sk2_esk2_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_192) ).
cnf(c_378,negated_conjecture,
~ disjoint(singleton(sk2_esk1_0),sk2_esk2_0),
inference(copy,[status(esa)],[c_211]) ).
cnf(c_418,negated_conjecture,
~ disjoint(singleton(sk2_esk1_0),sk2_esk2_0),
inference(copy,[status(esa)],[c_378]) ).
cnf(c_441,negated_conjecture,
~ disjoint(singleton(sk2_esk1_0),sk2_esk2_0),
inference(copy,[status(esa)],[c_418]) ).
cnf(c_483,negated_conjecture,
~ disjoint(singleton(sk2_esk1_0),sk2_esk2_0),
inference(copy,[status(esa)],[c_441]) ).
cnf(c_1103,negated_conjecture,
~ disjoint(singleton(sk2_esk1_0),sk2_esk2_0),
inference(copy,[status(esa)],[c_483]) ).
cnf(c_105720,plain,
subset(singleton(sk2_esk1_0),sk2_esk2_0),
inference(resolution,[status(thm)],[c_49017,c_1103]) ).
cnf(c_105721,plain,
subset(singleton(sk2_esk1_0),sk2_esk2_0),
inference(rewriting,[status(thm)],[c_105720]) ).
cnf(c_192,plain,
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_172) ).
cnf(c_320,plain,
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(copy,[status(esa)],[c_192]) ).
cnf(c_401,plain,
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(copy,[status(esa)],[c_320]) ).
cnf(c_458,plain,
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(copy,[status(esa)],[c_401]) ).
cnf(c_510,plain,
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(copy,[status(esa)],[c_458]) ).
cnf(c_1157,plain,
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(copy,[status(esa)],[c_510]) ).
cnf(c_13,plain,
subset(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_259_0) ).
cnf(c_759,plain,
subset(X0,X0),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_2711,plain,
in(X0,singleton(X0)),
inference(resolution,[status(thm)],[c_1157,c_759]) ).
cnf(c_2712,plain,
in(X0,singleton(X0)),
inference(rewriting,[status(thm)],[c_2711]) ).
cnf(c_212,negated_conjecture,
~ in(sk2_esk1_0,sk2_esk2_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_196) ).
cnf(c_380,negated_conjecture,
~ in(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_212]) ).
cnf(c_419,negated_conjecture,
~ in(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_380]) ).
cnf(c_440,negated_conjecture,
~ in(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_419]) ).
cnf(c_484,negated_conjecture,
~ in(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_440]) ).
cnf(c_1105,plain,
~ in(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_484]) ).
cnf(c_86,plain,
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p',c_0_227_0) ).
cnf(c_903,plain,
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_1177,plain,
( ~ subset(X0,sk2_esk2_0)
| ~ in(sk2_esk1_0,X0) ),
inference(resolution,[status(thm)],[c_1105,c_903]) ).
cnf(c_1178,plain,
( ~ subset(X0,sk2_esk2_0)
| ~ in(sk2_esk1_0,X0) ),
inference(rewriting,[status(thm)],[c_1177]) ).
cnf(c_5446,plain,
~ subset(singleton(sk2_esk1_0),sk2_esk2_0),
inference(resolution,[status(thm)],[c_2712,c_1178]) ).
cnf(c_5447,plain,
~ subset(singleton(sk2_esk1_0),sk2_esk2_0),
inference(rewriting,[status(thm)],[c_5446]) ).
cnf(c_106203,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_105721,c_5447]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU154+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : iprover_modulo %s %d
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 20 03:31:54 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % Running in mono-core mode
% 0.22/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.44 % FOF problem with conjecture
% 0.22/0.44 % 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_9c419b.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_80bdba | grep -v "SZS"
% 0.22/0.47
% 0.22/0.47 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % ------ iProver source info
% 0.22/0.47
% 0.22/0.47 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.47 % git: non_committed_changes: true
% 0.22/0.47 % git: last_make_outside_of_git: true
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % ------ Input Options
% 0.22/0.47
% 0.22/0.47 % --out_options all
% 0.22/0.47 % --tptp_safe_out true
% 0.22/0.47 % --problem_path ""
% 0.22/0.47 % --include_path ""
% 0.22/0.47 % --clausifier .//eprover
% 0.22/0.47 % --clausifier_options --tstp-format
% 0.22/0.47 % --stdin false
% 0.22/0.47 % --dbg_backtrace false
% 0.22/0.47 % --dbg_dump_prop_clauses false
% 0.22/0.47 % --dbg_dump_prop_clauses_file -
% 0.22/0.47 % --dbg_out_stat false
% 0.22/0.47
% 0.22/0.47 % ------ General Options
% 0.22/0.47
% 0.22/0.47 % --fof false
% 0.22/0.47 % --time_out_real 150.
% 0.22/0.47 % --time_out_prep_mult 0.2
% 0.22/0.47 % --time_out_virtual -1.
% 0.22/0.47 % --schedule none
% 0.22/0.47 % --ground_splitting input
% 0.22/0.47 % --splitting_nvd 16
% 0.22/0.47 % --non_eq_to_eq false
% 0.22/0.47 % --prep_gs_sim true
% 0.22/0.47 % --prep_unflatten false
% 0.22/0.47 % --prep_res_sim true
% 0.22/0.47 % --prep_upred true
% 0.22/0.47 % --res_sim_input true
% 0.22/0.47 % --clause_weak_htbl true
% 0.22/0.47 % --gc_record_bc_elim false
% 0.22/0.47 % --symbol_type_check false
% 0.22/0.47 % --clausify_out false
% 0.22/0.47 % --large_theory_mode false
% 0.22/0.47 % --prep_sem_filter none
% 0.22/0.47 % --prep_sem_filter_out false
% 0.22/0.47 % --preprocessed_out false
% 0.22/0.47 % --sub_typing false
% 0.22/0.47 % --brand_transform false
% 0.22/0.47 % --pure_diseq_elim true
% 0.22/0.47 % --min_unsat_core false
% 0.22/0.47 % --pred_elim true
% 0.22/0.47 % --add_important_lit false
% 0.22/0.47 % --soft_assumptions false
% 0.22/0.47 % --reset_solvers false
% 0.22/0.47 % --bc_imp_inh []
% 0.22/0.47 % --conj_cone_tolerance 1.5
% 0.22/0.47 % --prolific_symb_bound 500
% 0.22/0.47 % --lt_threshold 2000
% 0.22/0.47
% 0.22/0.47 % ------ SAT Options
% 0.22/0.47
% 0.22/0.47 % --sat_mode false
% 0.22/0.47 % --sat_fm_restart_options ""
% 0.22/0.47 % --sat_gr_def false
% 0.22/0.47 % --sat_epr_types true
% 0.22/0.47 % --sat_non_cyclic_types false
% 0.22/0.47 % --sat_finite_models false
% 0.22/0.47 % --sat_fm_lemmas false
% 0.22/0.47 % --sat_fm_prep false
% 0.22/0.47 % --sat_fm_uc_incr true
% 0.22/0.47 % --sat_out_model small
% 0.22/0.47 % --sat_out_clauses false
% 0.22/0.47
% 0.22/0.47 % ------ QBF Options
% 0.22/0.47
% 0.22/0.47 % --qbf_mode false
% 0.22/0.47 % --qbf_elim_univ true
% 0.22/0.47 % --qbf_sk_in true
% 0.22/0.47 % --qbf_pred_elim true
% 0.22/0.47 % --qbf_split 32
% 0.22/0.47
% 0.22/0.47 % ------ BMC1 Options
% 0.22/0.47
% 0.22/0.47 % --bmc1_incremental false
% 0.22/0.47 % --bmc1_axioms reachable_all
% 0.22/0.47 % --bmc1_min_bound 0
% 0.22/0.47 % --bmc1_max_bound -1
% 0.22/0.47 % --bmc1_max_bound_default -1
% 0.22/0.47 % --bmc1_symbol_reachability true
% 0.22/0.47 % --bmc1_property_lemmas false
% 0.22/0.47 % --bmc1_k_induction false
% 0.22/0.47 % --bmc1_non_equiv_states false
% 0.22/0.47 % --bmc1_deadlock false
% 0.22/0.47 % --bmc1_ucm false
% 0.22/0.47 % --bmc1_add_unsat_core none
% 0.22/0.47 % --bmc1_unsat_core_children false
% 0.22/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.47 % --bmc1_out_stat full
% 0.22/0.47 % --bmc1_ground_init false
% 0.22/0.47 % --bmc1_pre_inst_next_state false
% 0.22/0.47 % --bmc1_pre_inst_state false
% 0.22/0.47 % --bmc1_pre_inst_reach_state false
% 0.22/0.47 % --bmc1_out_unsat_core false
% 0.22/0.47 % --bmc1_aig_witness_out false
% 0.22/0.47 % --bmc1_verbose false
% 0.22/0.47 % --bmc1_dump_clauses_tptp false
% 0.40/0.73 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.73 % --bmc1_dump_file -
% 0.40/0.73 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.73 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.73 % --bmc1_ucm_extend_mode 1
% 0.40/0.73 % --bmc1_ucm_init_mode 2
% 0.40/0.73 % --bmc1_ucm_cone_mode none
% 0.40/0.73 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.73 % --bmc1_ucm_relax_model 4
% 0.40/0.73 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.73 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.73 % --bmc1_ucm_layered_model none
% 0.40/0.73 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.73
% 0.40/0.73 % ------ AIG Options
% 0.40/0.73
% 0.40/0.73 % --aig_mode false
% 0.40/0.73
% 0.40/0.73 % ------ Instantiation Options
% 0.40/0.73
% 0.40/0.73 % --instantiation_flag true
% 0.40/0.73 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.73 % --inst_solver_per_active 750
% 0.40/0.73 % --inst_solver_calls_frac 0.5
% 0.40/0.73 % --inst_passive_queue_type priority_queues
% 0.40/0.73 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.73 % --inst_passive_queues_freq [25;2]
% 0.40/0.73 % --inst_dismatching true
% 0.40/0.73 % --inst_eager_unprocessed_to_passive true
% 0.40/0.73 % --inst_prop_sim_given true
% 0.40/0.73 % --inst_prop_sim_new false
% 0.40/0.73 % --inst_orphan_elimination true
% 0.40/0.73 % --inst_learning_loop_flag true
% 0.40/0.73 % --inst_learning_start 3000
% 0.40/0.73 % --inst_learning_factor 2
% 0.40/0.73 % --inst_start_prop_sim_after_learn 3
% 0.40/0.73 % --inst_sel_renew solver
% 0.40/0.73 % --inst_lit_activity_flag true
% 0.40/0.73 % --inst_out_proof true
% 0.40/0.73
% 0.40/0.73 % ------ Resolution Options
% 0.40/0.73
% 0.40/0.73 % --resolution_flag true
% 0.40/0.73 % --res_lit_sel kbo_max
% 0.40/0.73 % --res_to_prop_solver none
% 0.40/0.73 % --res_prop_simpl_new false
% 0.40/0.73 % --res_prop_simpl_given false
% 0.40/0.73 % --res_passive_queue_type priority_queues
% 0.40/0.73 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.40/0.73 % --res_passive_queues_freq [15;5]
% 0.40/0.73 % --res_forward_subs full
% 0.40/0.73 % --res_backward_subs full
% 0.40/0.73 % --res_forward_subs_resolution true
% 0.40/0.73 % --res_backward_subs_resolution true
% 0.40/0.73 % --res_orphan_elimination false
% 0.40/0.73 % --res_time_limit 1000.
% 0.40/0.73 % --res_out_proof true
% 0.40/0.73 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9c419b.s
% 0.40/0.73 % --modulo true
% 0.40/0.73
% 0.40/0.73 % ------ Combination Options
% 0.40/0.73
% 0.40/0.73 % --comb_res_mult 1000
% 0.40/0.73 % --comb_inst_mult 300
% 0.40/0.73 % ------
% 0.40/0.73
% 0.40/0.73 % ------ Parsing...% successful
% 0.40/0.73
% 0.40/0.73 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.40/0.73
% 0.40/0.73 % ------ Proving...
% 0.40/0.73 % ------ Problem Properties
% 0.40/0.73
% 0.40/0.73 %
% 0.40/0.73 % EPR false
% 0.40/0.73 % Horn false
% 0.40/0.73 % Has equality true
% 0.40/0.73
% 0.40/0.73 % % ------ Input Options Time Limit: Unbounded
% 0.40/0.73
% 0.40/0.73
% 0.40/0.73 Compiling...
% 0.40/0.73 Loading plugin: done.
% 0.40/0.73 Compiling...
% 0.40/0.73 Loading plugin: done.
% 0.40/0.73 % % ------ Current options:
% 0.40/0.73
% 0.40/0.73 % ------ Input Options
% 0.40/0.73
% 0.40/0.73 % --out_options all
% 0.40/0.73 % --tptp_safe_out true
% 0.40/0.73 % --problem_path ""
% 0.40/0.73 % --include_path ""
% 0.40/0.73 % --clausifier .//eprover
% 0.40/0.73 % --clausifier_options --tstp-format
% 0.40/0.73 % --stdin false
% 0.40/0.73 % --dbg_backtrace false
% 0.40/0.73 % --dbg_dump_prop_clauses false
% 0.40/0.73 % --dbg_dump_prop_clauses_file -
% 0.40/0.73 % --dbg_out_stat false
% 0.40/0.73
% 0.40/0.73 % ------ General Options
% 0.40/0.73
% 0.40/0.73 % --fof false
% 0.40/0.73 % --time_out_real 150.
% 0.40/0.73 % --time_out_prep_mult 0.2
% 0.40/0.73 % --time_out_virtual -1.
% 0.40/0.73 % --schedule none
% 0.40/0.73 % --ground_splitting input
% 0.40/0.73 % --splitting_nvd 16
% 0.40/0.73 % --non_eq_to_eq false
% 0.40/0.73 % --prep_gs_sim true
% 0.40/0.73 % --prep_unflatten false
% 0.40/0.73 % --prep_res_sim true
% 0.40/0.73 % --prep_upred true
% 0.40/0.73 % --res_sim_input true
% 0.40/0.73 % --clause_weak_htbl true
% 0.40/0.73 % --gc_record_bc_elim false
% 0.40/0.73 % --symbol_type_check false
% 0.40/0.73 % --clausify_out false
% 0.40/0.73 % --large_theory_mode false
% 0.40/0.73 % --prep_sem_filter none
% 0.40/0.73 % --prep_sem_filter_out false
% 0.40/0.73 % --preprocessed_out false
% 0.40/0.73 % --sub_typing false
% 0.40/0.73 % --brand_transform false
% 0.40/0.73 % --pure_diseq_elim true
% 0.40/0.73 % --min_unsat_core false
% 0.40/0.73 % --pred_elim true
% 0.40/0.73 % --add_important_lit false
% 0.40/0.73 % --soft_assumptions false
% 0.40/0.73 % --reset_solvers false
% 0.40/0.73 % --bc_imp_inh []
% 0.40/0.73 % --conj_cone_tolerance 1.5
% 0.40/0.73 % --prolific_symb_bound 500
% 0.40/0.73 % --lt_threshold 2000
% 0.40/0.73
% 0.40/0.73 % ------ SAT Options
% 0.40/0.73
% 0.40/0.73 % --sat_mode false
% 0.40/0.73 % --sat_fm_restart_options ""
% 0.40/0.73 % --sat_gr_def false
% 0.40/0.73 % --sat_epr_types true
% 0.40/0.73 % --sat_non_cyclic_types false
% 0.40/0.73 % --sat_finite_models false
% 0.40/0.73 % --sat_fm_lemmas false
% 0.40/0.73 % --sat_fm_prep false
% 0.40/0.73 % --sat_fm_uc_incr true
% 0.40/0.73 % --sat_out_model small
% 0.40/0.73 % --sat_out_clauses false
% 0.40/0.73
% 0.40/0.73 % ------ QBF Options
% 0.40/0.73
% 0.40/0.73 % --qbf_mode false
% 0.40/0.73 % --qbf_elim_univ true
% 0.40/0.73 % --qbf_sk_in true
% 0.40/0.73 % --qbf_pred_elim true
% 0.40/0.73 % --qbf_split 32
% 0.40/0.73
% 0.40/0.73 % ------ BMC1 Options
% 0.40/0.73
% 0.40/0.73 % --bmc1_incremental false
% 0.40/0.73 % --bmc1_axioms reachable_all
% 0.40/0.73 % --bmc1_min_bound 0
% 0.40/0.73 % --bmc1_max_bound -1
% 0.40/0.73 % --bmc1_max_bound_default -1
% 0.40/0.73 % --bmc1_symbol_reachability true
% 0.40/0.73 % --bmc1_property_lemmas false
% 0.40/0.73 % --bmc1_k_induction false
% 0.40/0.73 % --bmc1_non_equiv_states false
% 0.40/0.73 % --bmc1_deadlock false
% 0.40/0.73 % --bmc1_ucm false
% 0.40/0.73 % --bmc1_add_unsat_core none
% 0.40/0.73 % --bmc1_unsat_core_children false
% 0.40/0.73 % --bmc1_unsat_core_extrapolate_axioms false
% 0.40/0.73 % --bmc1_out_stat full
% 0.40/0.73 % --bmc1_ground_init false
% 0.40/0.73 % --bmc1_pre_inst_next_state false
% 0.40/0.73 % --bmc1_pre_inst_state false
% 0.40/0.73 % --bmc1_pre_inst_reach_state false
% 0.40/0.73 % --bmc1_out_unsat_core false
% 0.40/0.73 % --bmc1_aig_witness_out false
% 0.40/0.73 % --bmc1_verbose false
% 0.40/0.73 % --bmc1_dump_clauses_tptp false
% 0.40/0.73 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.73 % --bmc1_dump_file -
% 0.40/0.73 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.73 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.73 % --bmc1_ucm_extend_mode 1
% 0.40/0.73 % --bmc1_ucm_init_mode 2
% 0.40/0.73 % --bmc1_ucm_cone_mode none
% 0.40/0.73 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.73 % --bmc1_ucm_relax_model 4
% 0.40/0.73 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.73 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.73 % --bmc1_ucm_layered_model none
% 0.40/0.73 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.73
% 0.40/0.73 % ------ AIG Options
% 0.40/0.73
% 0.40/0.73 % --aig_mode false
% 0.40/0.73
% 0.40/0.73 % ------ Instantiation Options
% 0.40/0.73
% 0.40/0.73 % --instantiation_flag true
% 0.40/0.73 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.73 % --inst_solver_per_active 750
% 0.40/0.73 % --inst_solver_calls_frac 0.5
% 0.40/0.73 % --inst_passive_queue_type priority_queues
% 0.40/0.73 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.73 % --inst_passive_queues_freq [25;2]
% 0.40/0.73 % --inst_dismatching true
% 150.23/150.47 % --inst_eager_unprocessed_to_passive true
% 150.23/150.47 % --inst_prop_sim_given true
% 150.23/150.47 % --inst_prop_sim_new false
% 150.23/150.47 % --inst_orphan_elimination true
% 150.23/150.47 % --inst_learning_loop_flag true
% 150.23/150.47 % --inst_learning_start 3000
% 150.23/150.47 % --inst_learning_factor 2
% 150.23/150.47 % --inst_start_prop_sim_after_learn 3
% 150.23/150.47 % --inst_sel_renew solver
% 150.23/150.47 % --inst_lit_activity_flag true
% 150.23/150.47 % --inst_out_proof true
% 150.23/150.47
% 150.23/150.47 % ------ Resolution Options
% 150.23/150.47
% 150.23/150.47 % --resolution_flag true
% 150.23/150.47 % --res_lit_sel kbo_max
% 150.23/150.47 % --res_to_prop_solver none
% 150.23/150.47 % --res_prop_simpl_new false
% 150.23/150.47 % --res_prop_simpl_given false
% 150.23/150.47 % --res_passive_queue_type priority_queues
% 150.23/150.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.23/150.47 % --res_passive_queues_freq [15;5]
% 150.23/150.47 % --res_forward_subs full
% 150.23/150.47 % --res_backward_subs full
% 150.23/150.47 % --res_forward_subs_resolution true
% 150.23/150.47 % --res_backward_subs_resolution true
% 150.23/150.47 % --res_orphan_elimination false
% 150.23/150.47 % --res_time_limit 1000.
% 150.23/150.47 % --res_out_proof true
% 150.23/150.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9c419b.s
% 150.23/150.47 % --modulo true
% 150.23/150.47
% 150.23/150.47 % ------ Combination Options
% 150.23/150.47
% 150.23/150.47 % --comb_res_mult 1000
% 150.23/150.47 % --comb_inst_mult 300
% 150.23/150.47 % ------
% 150.23/150.47
% 150.23/150.47
% 150.23/150.47
% 150.23/150.47 % ------ Proving...
% 150.23/150.47 %
% 150.23/150.47
% 150.23/150.47
% 150.23/150.47 % Time Out Real
% 150.23/150.47
% 150.23/150.47 % ------ Statistics
% 150.23/150.47
% 150.23/150.47 % ------ General
% 150.23/150.47
% 150.23/150.47 % num_of_input_clauses: 125
% 150.23/150.47 % num_of_input_neg_conjectures: 2
% 150.23/150.47 % num_of_splits: 0
% 150.23/150.47 % num_of_split_atoms: 0
% 150.23/150.47 % num_of_sem_filtered_clauses: 0
% 150.23/150.47 % num_of_subtypes: 0
% 150.23/150.47 % monotx_restored_types: 0
% 150.23/150.47 % sat_num_of_epr_types: 0
% 150.23/150.47 % sat_num_of_non_cyclic_types: 0
% 150.23/150.47 % sat_guarded_non_collapsed_types: 0
% 150.23/150.47 % is_epr: 0
% 150.23/150.47 % is_horn: 0
% 150.23/150.47 % has_eq: 1
% 150.23/150.47 % num_pure_diseq_elim: 0
% 150.23/150.47 % simp_replaced_by: 0
% 150.23/150.47 % res_preprocessed: 48
% 150.23/150.47 % prep_upred: 0
% 150.23/150.47 % prep_unflattend: 0
% 150.23/150.47 % pred_elim_cands: 2
% 150.23/150.47 % pred_elim: 1
% 150.23/150.47 % pred_elim_cl: 1
% 150.23/150.47 % pred_elim_cycles: 2
% 150.23/150.47 % forced_gc_time: 0
% 150.23/150.47 % gc_basic_clause_elim: 0
% 150.23/150.47 % parsing_time: 0.005
% 150.23/150.47 % sem_filter_time: 0.
% 150.23/150.47 % pred_elim_time: 0.
% 150.23/150.47 % out_proof_time: 0.
% 150.23/150.47 % monotx_time: 0.
% 150.23/150.47 % subtype_inf_time: 0.
% 150.23/150.47 % unif_index_cands_time: 0.488
% 150.23/150.47 % unif_index_add_time: 0.045
% 150.23/150.47 % total_time: 150.018
% 150.23/150.47 % num_of_symbols: 52
% 150.23/150.47 % num_of_terms: 1076211
% 150.23/150.47
% 150.23/150.47 % ------ Propositional Solver
% 150.23/150.47
% 150.23/150.47 % prop_solver_calls: 20
% 150.23/150.47 % prop_fast_solver_calls: 174
% 150.23/150.47 % prop_num_of_clauses: 46789
% 150.23/150.47 % prop_preprocess_simplified: 56543
% 150.23/150.47 % prop_fo_subsumed: 0
% 150.23/150.47 % prop_solver_time: 0.01
% 150.23/150.47 % prop_fast_solver_time: 0.
% 150.23/150.47 % prop_unsat_core_time: 0.
% 150.23/150.47
% 150.23/150.47 % ------ QBF
% 150.23/150.47
% 150.23/150.47 % qbf_q_res: 0
% 150.23/150.47 % qbf_num_tautologies: 0
% 150.23/150.47 % qbf_prep_cycles: 0
% 150.23/150.47
% 150.23/150.47 % ------ BMC1
% 150.23/150.47
% 150.23/150.47 % bmc1_current_bound: -1
% 150.23/150.47 % bmc1_last_solved_bound: -1
% 150.23/150.47 % bmc1_unsat_core_size: -1
% 150.23/150.47 % bmc1_unsat_core_parents_size: -1
% 150.23/150.47 % bmc1_merge_next_fun: 0
% 150.23/150.47 % bmc1_unsat_core_clauses_time: 0.
% 150.23/150.47
% 150.23/150.47 % ------ Instantiation
% 150.23/150.47
% 150.23/150.47 % inst_num_of_clauses: 27095
% 150.23/150.47 % inst_num_in_passive: 24573
% 150.23/150.47 % inst_num_in_active: 2001
% 150.23/150.48 % inst_num_in_unprocessed: 503
% 150.23/150.48 % inst_num_of_loops: 2100
% 150.23/150.48 % inst_num_of_learning_restarts: 0
% 150.23/150.48 % inst_num_moves_active_passive: 87
% 150.23/150.48 % inst_lit_activity: 4145
% 150.23/150.48 % inst_lit_activity_moves: 0
% 150.23/150.48 % inst_num_tautologies: 11
% 150.23/150.48 % inst_num_prop_implied: 0
% 150.23/150.48 % inst_num_existing_simplified: 0
% 150.23/150.48 % inst_num_eq_res_simplified: 7
% 150.23/150.48 % inst_num_child_elim: 0
% 150.23/150.48 % inst_num_of_dismatching_blockings: 14214
% 150.23/150.48 % inst_num_of_non_proper_insts: 18234
% 150.23/150.48 % inst_num_of_duplicates: 2558
% 150.23/150.48 % inst_inst_num_from_inst_to_res: 0
% 150.23/150.48 % inst_dismatching_checking_time: 0.576
% 150.23/150.48
% 150.23/150.48 % ------ Resolution
% 150.23/150.48
% 150.23/150.48 % res_num_of_clauses: 1073834
% 150.23/150.48 % res_num_in_passive: 1072284
% 150.23/150.48 % res_num_in_active: 5069
% 150.23/150.48 % res_num_of_loops: 7130
% 150.23/150.48 % res_forward_subset_subsumed: 58385
% 150.23/150.48 % res_backward_subset_subsumed: 3664
% 150.23/150.48 % res_forward_subsumed: 1542
% 150.23/150.48 % res_backward_subsumed: 72
% 150.23/150.48 % res_forward_subsumption_resolution: 540
% 150.23/150.48 % res_backward_subsumption_resolution: 294
% 150.23/150.48 % res_clause_to_clause_subsumption: 846112
% 150.23/150.48 % res_orphan_elimination: 0
% 150.23/150.48 % res_tautology_del: 4651
% 150.23/150.48 % res_num_eq_res_simplified: 8
% 150.23/150.48 % res_num_sel_changes: 0
% 150.23/150.48 % res_moves_from_active_to_pass: 0
% 150.23/150.48
% 150.23/150.48 % Status Unknown
% 150.23/150.54 % Orienting using strategy ClausalAll
% 150.23/150.54 % FOF problem with conjecture
% 150.23/150.54 % 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_9c419b.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_b37e78.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_de459f | grep -v "SZS"
% 150.23/150.56
% 150.23/150.56 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.23/150.56
% 150.23/150.56 %
% 150.23/150.56 % ------ iProver source info
% 150.23/150.56
% 150.23/150.56 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.23/150.56 % git: non_committed_changes: true
% 150.23/150.56 % git: last_make_outside_of_git: true
% 150.23/150.56
% 150.23/150.56 %
% 150.23/150.56 % ------ Input Options
% 150.23/150.56
% 150.23/150.56 % --out_options all
% 150.23/150.56 % --tptp_safe_out true
% 150.23/150.56 % --problem_path ""
% 150.23/150.56 % --include_path ""
% 150.23/150.56 % --clausifier .//eprover
% 150.23/150.56 % --clausifier_options --tstp-format
% 150.23/150.56 % --stdin false
% 150.23/150.56 % --dbg_backtrace false
% 150.23/150.56 % --dbg_dump_prop_clauses false
% 150.23/150.56 % --dbg_dump_prop_clauses_file -
% 150.23/150.56 % --dbg_out_stat false
% 150.23/150.56
% 150.23/150.56 % ------ General Options
% 150.23/150.56
% 150.23/150.56 % --fof false
% 150.23/150.56 % --time_out_real 150.
% 150.23/150.56 % --time_out_prep_mult 0.2
% 150.23/150.56 % --time_out_virtual -1.
% 150.23/150.56 % --schedule none
% 150.23/150.56 % --ground_splitting input
% 150.23/150.56 % --splitting_nvd 16
% 150.23/150.56 % --non_eq_to_eq false
% 150.23/150.56 % --prep_gs_sim true
% 150.23/150.56 % --prep_unflatten false
% 150.23/150.56 % --prep_res_sim true
% 150.23/150.56 % --prep_upred true
% 150.23/150.56 % --res_sim_input true
% 150.23/150.56 % --clause_weak_htbl true
% 150.23/150.56 % --gc_record_bc_elim false
% 150.23/150.56 % --symbol_type_check false
% 150.23/150.56 % --clausify_out false
% 150.23/150.56 % --large_theory_mode false
% 150.23/150.56 % --prep_sem_filter none
% 150.23/150.56 % --prep_sem_filter_out false
% 150.23/150.56 % --preprocessed_out false
% 150.23/150.56 % --sub_typing false
% 150.23/150.56 % --brand_transform false
% 150.23/150.56 % --pure_diseq_elim true
% 150.23/150.56 % --min_unsat_core false
% 150.23/150.56 % --pred_elim true
% 150.23/150.56 % --add_important_lit false
% 150.23/150.56 % --soft_assumptions false
% 150.23/150.56 % --reset_solvers false
% 150.23/150.56 % --bc_imp_inh []
% 150.23/150.56 % --conj_cone_tolerance 1.5
% 150.23/150.56 % --prolific_symb_bound 500
% 150.23/150.56 % --lt_threshold 2000
% 150.23/150.56
% 150.23/150.56 % ------ SAT Options
% 150.23/150.56
% 150.23/150.56 % --sat_mode false
% 150.23/150.56 % --sat_fm_restart_options ""
% 150.23/150.56 % --sat_gr_def false
% 150.23/150.56 % --sat_epr_types true
% 150.23/150.56 % --sat_non_cyclic_types false
% 150.23/150.56 % --sat_finite_models false
% 150.23/150.56 % --sat_fm_lemmas false
% 150.23/150.56 % --sat_fm_prep false
% 150.23/150.56 % --sat_fm_uc_incr true
% 150.23/150.56 % --sat_out_model small
% 150.23/150.56 % --sat_out_clauses false
% 150.23/150.56
% 150.23/150.56 % ------ QBF Options
% 150.23/150.56
% 150.23/150.56 % --qbf_mode false
% 150.23/150.56 % --qbf_elim_univ true
% 150.23/150.56 % --qbf_sk_in true
% 150.23/150.56 % --qbf_pred_elim true
% 150.23/150.56 % --qbf_split 32
% 150.23/150.56
% 150.23/150.56 % ------ BMC1 Options
% 150.23/150.56
% 150.23/150.56 % --bmc1_incremental false
% 150.23/150.56 % --bmc1_axioms reachable_all
% 150.23/150.56 % --bmc1_min_bound 0
% 150.23/150.56 % --bmc1_max_bound -1
% 150.23/150.56 % --bmc1_max_bound_default -1
% 150.23/150.56 % --bmc1_symbol_reachability true
% 150.23/150.56 % --bmc1_property_lemmas false
% 150.23/150.56 % --bmc1_k_induction false
% 150.23/150.56 % --bmc1_non_equiv_states false
% 150.23/150.56 % --bmc1_deadlock false
% 150.23/150.56 % --bmc1_ucm false
% 150.23/150.56 % --bmc1_add_unsat_core none
% 150.23/150.56 % --bmc1_unsat_core_children false
% 150.23/150.56 % --bmc1_unsat_core_extrapolate_axioms false
% 150.23/150.56 % --bmc1_out_stat full
% 150.23/150.56 % --bmc1_ground_init false
% 150.23/150.56 % --bmc1_pre_inst_next_state false
% 150.23/150.56 % --bmc1_pre_inst_state false
% 150.23/150.56 % --bmc1_pre_inst_reach_state false
% 150.23/150.56 % --bmc1_out_unsat_core false
% 150.23/150.56 % --bmc1_aig_witness_out false
% 150.23/150.56 % --bmc1_verbose false
% 150.23/150.56 % --bmc1_dump_clauses_tptp false
% 150.48/150.83 % --bmc1_dump_unsat_core_tptp false
% 150.48/150.83 % --bmc1_dump_file -
% 150.48/150.83 % --bmc1_ucm_expand_uc_limit 128
% 150.48/150.83 % --bmc1_ucm_n_expand_iterations 6
% 150.48/150.83 % --bmc1_ucm_extend_mode 1
% 150.48/150.83 % --bmc1_ucm_init_mode 2
% 150.48/150.83 % --bmc1_ucm_cone_mode none
% 150.48/150.83 % --bmc1_ucm_reduced_relation_type 0
% 150.48/150.83 % --bmc1_ucm_relax_model 4
% 150.48/150.83 % --bmc1_ucm_full_tr_after_sat true
% 150.48/150.83 % --bmc1_ucm_expand_neg_assumptions false
% 150.48/150.83 % --bmc1_ucm_layered_model none
% 150.48/150.83 % --bmc1_ucm_max_lemma_size 10
% 150.48/150.83
% 150.48/150.83 % ------ AIG Options
% 150.48/150.83
% 150.48/150.83 % --aig_mode false
% 150.48/150.83
% 150.48/150.83 % ------ Instantiation Options
% 150.48/150.83
% 150.48/150.83 % --instantiation_flag true
% 150.48/150.83 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.48/150.83 % --inst_solver_per_active 750
% 150.48/150.83 % --inst_solver_calls_frac 0.5
% 150.48/150.83 % --inst_passive_queue_type priority_queues
% 150.48/150.83 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.48/150.83 % --inst_passive_queues_freq [25;2]
% 150.48/150.83 % --inst_dismatching true
% 150.48/150.83 % --inst_eager_unprocessed_to_passive true
% 150.48/150.83 % --inst_prop_sim_given true
% 150.48/150.83 % --inst_prop_sim_new false
% 150.48/150.83 % --inst_orphan_elimination true
% 150.48/150.83 % --inst_learning_loop_flag true
% 150.48/150.83 % --inst_learning_start 3000
% 150.48/150.83 % --inst_learning_factor 2
% 150.48/150.83 % --inst_start_prop_sim_after_learn 3
% 150.48/150.83 % --inst_sel_renew solver
% 150.48/150.83 % --inst_lit_activity_flag true
% 150.48/150.83 % --inst_out_proof true
% 150.48/150.83
% 150.48/150.83 % ------ Resolution Options
% 150.48/150.83
% 150.48/150.83 % --resolution_flag true
% 150.48/150.83 % --res_lit_sel kbo_max
% 150.48/150.83 % --res_to_prop_solver none
% 150.48/150.83 % --res_prop_simpl_new false
% 150.48/150.83 % --res_prop_simpl_given false
% 150.48/150.83 % --res_passive_queue_type priority_queues
% 150.48/150.83 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.48/150.83 % --res_passive_queues_freq [15;5]
% 150.48/150.83 % --res_forward_subs full
% 150.48/150.83 % --res_backward_subs full
% 150.48/150.83 % --res_forward_subs_resolution true
% 150.48/150.83 % --res_backward_subs_resolution true
% 150.48/150.83 % --res_orphan_elimination false
% 150.48/150.83 % --res_time_limit 1000.
% 150.48/150.83 % --res_out_proof true
% 150.48/150.83 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9c419b.s
% 150.48/150.83 % --modulo true
% 150.48/150.83
% 150.48/150.83 % ------ Combination Options
% 150.48/150.83
% 150.48/150.83 % --comb_res_mult 1000
% 150.48/150.83 % --comb_inst_mult 300
% 150.48/150.83 % ------
% 150.48/150.83
% 150.48/150.83 % ------ Parsing...% successful
% 150.48/150.83
% 150.48/150.83 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 150.48/150.83
% 150.48/150.83 % ------ Proving...
% 150.48/150.83 % ------ Problem Properties
% 150.48/150.83
% 150.48/150.83 %
% 150.48/150.83 % EPR false
% 150.48/150.83 % Horn false
% 150.48/150.83 % Has equality true
% 150.48/150.83
% 150.48/150.83 % % ------ Input Options Time Limit: Unbounded
% 150.48/150.83
% 150.48/150.83
% 150.48/150.83 Compiling...
% 150.48/150.83 Loading plugin: done.
% 150.48/150.83 Compiling...
% 150.48/150.83 Loading plugin: done.
% 150.48/150.83 % % ------ Current options:
% 150.48/150.83
% 150.48/150.83 % ------ Input Options
% 150.48/150.83
% 150.48/150.83 % --out_options all
% 150.48/150.83 % --tptp_safe_out true
% 150.48/150.83 % --problem_path ""
% 150.48/150.83 % --include_path ""
% 150.48/150.83 % --clausifier .//eprover
% 150.48/150.83 % --clausifier_options --tstp-format
% 150.48/150.83 % --stdin false
% 150.48/150.83 % --dbg_backtrace false
% 150.48/150.83 % --dbg_dump_prop_clauses false
% 150.48/150.83 % --dbg_dump_prop_clauses_file -
% 150.48/150.83 % --dbg_out_stat false
% 150.48/150.83
% 150.48/150.83 % ------ General Options
% 150.48/150.83
% 150.48/150.83 % --fof false
% 150.48/150.83 % --time_out_real 150.
% 150.48/150.83 % --time_out_prep_mult 0.2
% 150.48/150.83 % --time_out_virtual -1.
% 150.48/150.83 % --schedule none
% 150.48/150.83 % --ground_splitting input
% 150.48/150.83 % --splitting_nvd 16
% 150.48/150.83 % --non_eq_to_eq false
% 150.48/150.83 % --prep_gs_sim true
% 150.48/150.83 % --prep_unflatten false
% 150.48/150.83 % --prep_res_sim true
% 150.48/150.83 % --prep_upred true
% 150.48/150.83 % --res_sim_input true
% 150.48/150.83 % --clause_weak_htbl true
% 150.48/150.83 % --gc_record_bc_elim false
% 150.48/150.83 % --symbol_type_check false
% 150.48/150.83 % --clausify_out false
% 150.48/150.83 % --large_theory_mode false
% 150.48/150.83 % --prep_sem_filter none
% 150.48/150.83 % --prep_sem_filter_out false
% 150.48/150.83 % --preprocessed_out false
% 150.48/150.83 % --sub_typing false
% 150.48/150.83 % --brand_transform false
% 150.48/150.83 % --pure_diseq_elim true
% 150.48/150.83 % --min_unsat_core false
% 150.48/150.83 % --pred_elim true
% 150.48/150.83 % --add_important_lit false
% 150.48/150.83 % --soft_assumptions false
% 150.48/150.83 % --reset_solvers false
% 150.48/150.83 % --bc_imp_inh []
% 150.48/150.83 % --conj_cone_tolerance 1.5
% 150.48/150.83 % --prolific_symb_bound 500
% 150.48/150.83 % --lt_threshold 2000
% 150.48/150.83
% 150.48/150.83 % ------ SAT Options
% 150.48/150.83
% 150.48/150.83 % --sat_mode false
% 150.48/150.83 % --sat_fm_restart_options ""
% 150.48/150.83 % --sat_gr_def false
% 150.48/150.83 % --sat_epr_types true
% 150.48/150.83 % --sat_non_cyclic_types false
% 150.48/150.83 % --sat_finite_models false
% 150.48/150.83 % --sat_fm_lemmas false
% 150.48/150.83 % --sat_fm_prep false
% 150.48/150.83 % --sat_fm_uc_incr true
% 150.48/150.83 % --sat_out_model small
% 150.48/150.83 % --sat_out_clauses false
% 150.48/150.83
% 150.48/150.83 % ------ QBF Options
% 150.48/150.83
% 150.48/150.83 % --qbf_mode false
% 150.48/150.83 % --qbf_elim_univ true
% 150.48/150.83 % --qbf_sk_in true
% 150.48/150.83 % --qbf_pred_elim true
% 150.48/150.83 % --qbf_split 32
% 150.48/150.83
% 150.48/150.83 % ------ BMC1 Options
% 150.48/150.83
% 150.48/150.83 % --bmc1_incremental false
% 150.48/150.83 % --bmc1_axioms reachable_all
% 150.48/150.83 % --bmc1_min_bound 0
% 150.48/150.83 % --bmc1_max_bound -1
% 150.48/150.83 % --bmc1_max_bound_default -1
% 150.48/150.83 % --bmc1_symbol_reachability true
% 150.48/150.83 % --bmc1_property_lemmas false
% 150.48/150.83 % --bmc1_k_induction false
% 150.48/150.83 % --bmc1_non_equiv_states false
% 150.48/150.83 % --bmc1_deadlock false
% 150.48/150.83 % --bmc1_ucm false
% 150.48/150.83 % --bmc1_add_unsat_core none
% 150.48/150.83 % --bmc1_unsat_core_children false
% 150.48/150.83 % --bmc1_unsat_core_extrapolate_axioms false
% 150.48/150.83 % --bmc1_out_stat full
% 150.48/150.83 % --bmc1_ground_init false
% 150.48/150.83 % --bmc1_pre_inst_next_state false
% 150.48/150.83 % --bmc1_pre_inst_state false
% 150.48/150.83 % --bmc1_pre_inst_reach_state false
% 150.48/150.83 % --bmc1_out_unsat_core false
% 150.48/150.83 % --bmc1_aig_witness_out false
% 150.48/150.83 % --bmc1_verbose false
% 150.48/150.83 % --bmc1_dump_clauses_tptp false
% 150.48/150.83 % --bmc1_dump_unsat_core_tptp false
% 150.48/150.83 % --bmc1_dump_file -
% 150.48/150.83 % --bmc1_ucm_expand_uc_limit 128
% 150.48/150.83 % --bmc1_ucm_n_expand_iterations 6
% 150.48/150.83 % --bmc1_ucm_extend_mode 1
% 150.48/150.83 % --bmc1_ucm_init_mode 2
% 150.48/150.83 % --bmc1_ucm_cone_mode none
% 150.48/150.83 % --bmc1_ucm_reduced_relation_type 0
% 150.48/150.83 % --bmc1_ucm_relax_model 4
% 150.48/150.83 % --bmc1_ucm_full_tr_after_sat true
% 150.48/150.83 % --bmc1_ucm_expand_neg_assumptions false
% 150.48/150.83 % --bmc1_ucm_layered_model none
% 150.48/150.83 % --bmc1_ucm_max_lemma_size 10
% 150.48/150.83
% 150.48/150.83 % ------ AIG Options
% 150.48/150.83
% 150.48/150.83 % --aig_mode false
% 150.48/150.83
% 150.48/150.83 % ------ Instantiation Options
% 150.48/150.83
% 150.48/150.83 % --instantiation_flag true
% 150.48/150.83 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.48/150.83 % --inst_solver_per_active 750
% 150.48/150.83 % --inst_solver_calls_frac 0.5
% 150.48/150.83 % --inst_passive_queue_type priority_queues
% 150.48/150.83 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.48/150.83 % --inst_passive_queues_freq [25;2]
% 150.48/150.83 % --inst_dismatching true
% 154.60/154.86 % --inst_eager_unprocessed_to_passive true
% 154.60/154.86 % --inst_prop_sim_given true
% 154.60/154.86 % --inst_prop_sim_new false
% 154.60/154.86 % --inst_orphan_elimination true
% 154.60/154.86 % --inst_learning_loop_flag true
% 154.60/154.86 % --inst_learning_start 3000
% 154.60/154.86 % --inst_learning_factor 2
% 154.60/154.86 % --inst_start_prop_sim_after_learn 3
% 154.60/154.86 % --inst_sel_renew solver
% 154.60/154.86 % --inst_lit_activity_flag true
% 154.60/154.86 % --inst_out_proof true
% 154.60/154.86
% 154.60/154.86 % ------ Resolution Options
% 154.60/154.86
% 154.60/154.86 % --resolution_flag true
% 154.60/154.86 % --res_lit_sel kbo_max
% 154.60/154.86 % --res_to_prop_solver none
% 154.60/154.86 % --res_prop_simpl_new false
% 154.60/154.86 % --res_prop_simpl_given false
% 154.60/154.86 % --res_passive_queue_type priority_queues
% 154.60/154.86 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 154.60/154.86 % --res_passive_queues_freq [15;5]
% 154.60/154.86 % --res_forward_subs full
% 154.60/154.86 % --res_backward_subs full
% 154.60/154.86 % --res_forward_subs_resolution true
% 154.60/154.86 % --res_backward_subs_resolution true
% 154.60/154.86 % --res_orphan_elimination false
% 154.60/154.86 % --res_time_limit 1000.
% 154.60/154.86 % --res_out_proof true
% 154.60/154.86 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9c419b.s
% 154.60/154.86 % --modulo true
% 154.60/154.86
% 154.60/154.86 % ------ Combination Options
% 154.60/154.86
% 154.60/154.86 % --comb_res_mult 1000
% 154.60/154.86 % --comb_inst_mult 300
% 154.60/154.86 % ------
% 154.60/154.86
% 154.60/154.86
% 154.60/154.86
% 154.60/154.86 % ------ Proving...
% 154.60/154.86 %
% 154.60/154.86
% 154.60/154.86
% 154.60/154.86 % Resolution empty clause
% 154.60/154.86
% 154.60/154.86 % ------ Statistics
% 154.60/154.86
% 154.60/154.86 % ------ General
% 154.60/154.86
% 154.60/154.86 % num_of_input_clauses: 223
% 154.60/154.86 % num_of_input_neg_conjectures: 2
% 154.60/154.86 % num_of_splits: 0
% 154.60/154.86 % num_of_split_atoms: 0
% 154.60/154.86 % num_of_sem_filtered_clauses: 0
% 154.60/154.86 % num_of_subtypes: 0
% 154.60/154.86 % monotx_restored_types: 0
% 154.60/154.86 % sat_num_of_epr_types: 0
% 154.60/154.86 % sat_num_of_non_cyclic_types: 0
% 154.60/154.86 % sat_guarded_non_collapsed_types: 0
% 154.60/154.86 % is_epr: 0
% 154.60/154.86 % is_horn: 0
% 154.60/154.86 % has_eq: 1
% 154.60/154.86 % num_pure_diseq_elim: 0
% 154.60/154.86 % simp_replaced_by: 0
% 154.60/154.86 % res_preprocessed: 48
% 154.60/154.86 % prep_upred: 0
% 154.60/154.86 % prep_unflattend: 0
% 154.60/154.86 % pred_elim_cands: 2
% 154.60/154.86 % pred_elim: 1
% 154.60/154.86 % pred_elim_cl: 1
% 154.60/154.86 % pred_elim_cycles: 2
% 154.60/154.86 % forced_gc_time: 0
% 154.60/154.86 % gc_basic_clause_elim: 0
% 154.60/154.86 % parsing_time: 0.004
% 154.60/154.86 % sem_filter_time: 0.
% 154.60/154.86 % pred_elim_time: 0.
% 154.60/154.86 % out_proof_time: 0.001
% 154.60/154.86 % monotx_time: 0.
% 154.60/154.86 % subtype_inf_time: 0.
% 154.60/154.86 % unif_index_cands_time: 0.019
% 154.60/154.86 % unif_index_add_time: 0.005
% 154.60/154.86 % total_time: 4.315
% 154.60/154.86 % num_of_symbols: 52
% 154.60/154.86 % num_of_terms: 115374
% 154.60/154.86
% 154.60/154.86 % ------ Propositional Solver
% 154.60/154.86
% 154.60/154.86 % prop_solver_calls: 5
% 154.60/154.86 % prop_fast_solver_calls: 174
% 154.60/154.86 % prop_num_of_clauses: 1496
% 154.60/154.86 % prop_preprocess_simplified: 2660
% 154.60/154.86 % prop_fo_subsumed: 0
% 154.60/154.86 % prop_solver_time: 0.
% 154.60/154.86 % prop_fast_solver_time: 0.
% 154.60/154.86 % prop_unsat_core_time: 0.
% 154.60/154.86
% 154.60/154.86 % ------ QBF
% 154.60/154.86
% 154.60/154.86 % qbf_q_res: 0
% 154.60/154.86 % qbf_num_tautologies: 0
% 154.60/154.86 % qbf_prep_cycles: 0
% 154.60/154.86
% 154.60/154.86 % ------ BMC1
% 154.60/154.86
% 154.60/154.86 % bmc1_current_bound: -1
% 154.60/154.86 % bmc1_last_solved_bound: -1
% 154.60/154.86 % bmc1_unsat_core_size: -1
% 154.60/154.86 % bmc1_unsat_core_parents_size: -1
% 154.60/154.86 % bmc1_merge_next_fun: 0
% 154.60/154.86 % bmc1_unsat_core_clauses_time: 0.
% 154.60/154.86
% 154.60/154.86 % ------ Instantiation
% 154.60/154.86
% 154.60/154.86 % inst_num_of_clauses: 1022
% 154.60/154.86 % inst_num_in_passive: 460
% 154.60/154.86 % inst_num_in_active: 277
% 154.60/154.86 % inst_num_in_unprocessed: 279
% 154.60/154.86 % inst_num_of_loops: 300
% 154.60/154.86 % inst_num_of_learning_restarts: 0
% 154.60/154.86 % inst_num_moves_active_passive: 17
% 154.60/154.86 % inst_lit_activity: 399
% 154.60/154.86 % inst_lit_activity_moves: 0
% 154.60/154.86 % inst_num_tautologies: 5
% 154.60/154.86 % inst_num_prop_implied: 0
% 154.60/154.86 % inst_num_existing_simplified: 0
% 154.60/154.86 % inst_num_eq_res_simplified: 1
% 154.60/154.86 % inst_num_child_elim: 0
% 154.60/154.86 % inst_num_of_dismatching_blockings: 617
% 154.60/154.86 % inst_num_of_non_proper_insts: 739
% 154.60/154.86 % inst_num_of_duplicates: 754
% 154.60/154.86 % inst_inst_num_from_inst_to_res: 0
% 154.60/154.86 % inst_dismatching_checking_time: 0.001
% 154.60/154.86
% 154.60/154.86 % ------ Resolution
% 154.60/154.86
% 154.60/154.86 % res_num_of_clauses: 38162
% 154.60/154.86 % res_num_in_passive: 36829
% 154.60/154.86 % res_num_in_active: 1282
% 154.60/154.86 % res_num_of_loops: 1415
% 154.60/154.86 % res_forward_subset_subsumed: 2458
% 154.60/154.86 % res_backward_subset_subsumed: 68
% 154.60/154.86 % res_forward_subsumed: 182
% 154.60/154.86 % res_backward_subsumed: 29
% 154.60/154.86 % res_forward_subsumption_resolution: 51
% 154.60/154.86 % res_backward_subsumption_resolution: 13
% 154.60/154.86 % res_clause_to_clause_subsumption: 47196
% 154.60/154.86 % res_orphan_elimination: 0
% 154.60/154.86 % res_tautology_del: 4451
% 154.60/154.86 % res_num_eq_res_simplified: 19
% 154.60/154.86 % res_num_sel_changes: 0
% 154.60/154.86 % res_moves_from_active_to_pass: 0
% 154.60/154.86
% 154.60/154.86 % Status Unsatisfiable
% 154.60/154.86 % SZS status Theorem
% 154.60/154.86 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------