%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU101+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 10:24:55 EDT 2022
% Result : Theorem 0.55s 0.94s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 55
% Syntax : Number of formulae : 464 ( 132 unt; 0 def)
% Number of atoms : 1060 ( 45 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 1041 ( 445 ~; 444 |; 102 &)
% ( 10 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 38 ( 38 usr; 15 con; 0-2 aty)
% Number of variables : 599 ( 63 sgn 178 !; 20 ?)
% 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] :
( diff_closed(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> in(set_difference(X2,X3),X1) ) ),
file('<stdin>',d3_finsub_1) ).
fof(c_0_1,axiom,
! [X1] :
( cup_closed(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> in(set_union2(X2,X3),X1) ) ),
file('<stdin>',d1_finsub_1) ).
fof(c_0_2,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('<stdin>',t4_subset) ).
fof(c_0_3,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('<stdin>',t5_subset) ).
fof(c_0_4,axiom,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X2,X1)) ),
file('<stdin>',fc3_xboole_0) ).
fof(c_0_5,axiom,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X1,X2)) ),
file('<stdin>',fc2_xboole_0) ).
fof(c_0_6,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('<stdin>',t3_subset) ).
fof(c_0_7,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('<stdin>',antisymmetry_r2_hidden) ).
fof(c_0_8,axiom,
! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(set_union2(X1,X2)) ),
file('<stdin>',fc9_finset_1) ).
fof(c_0_9,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
file('<stdin>',cc2_finset_1) ).
fof(c_0_10,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('<stdin>',t2_subset) ).
fof(c_0_11,axiom,
! [X1,X2] :
( finite(X1)
=> finite(set_difference(X1,X2)) ),
file('<stdin>',fc12_finset_1) ).
fof(c_0_12,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('<stdin>',t1_subset) ).
fof(c_0_13,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
file('<stdin>',rc4_finset_1) ).
fof(c_0_14,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
file('<stdin>',rc3_finset_1) ).
fof(c_0_15,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
file('<stdin>',rc1_subset_1) ).
fof(c_0_16,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('<stdin>',t7_boole) ).
fof(c_0_17,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('<stdin>',commutativity_k2_xboole_0) ).
fof(c_0_18,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
file('<stdin>',rc2_subset_1) ).
fof(c_0_19,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2)
& relation(X2)
& function(X2)
& one_to_one(X2)
& epsilon_transitive(X2)
& epsilon_connected(X2)
& ordinal(X2)
& natural(X2)
& finite(X2) ),
file('<stdin>',rc2_finset_1) ).
fof(c_0_20,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('<stdin>',existence_m1_subset_1) ).
fof(c_0_21,axiom,
! [X1] :
( preboolean(X1)
<=> ( cup_closed(X1)
& diff_closed(X1) ) ),
file('<stdin>',d4_finsub_1) ).
fof(c_0_22,axiom,
! [X1] :
( ( cup_closed(X1)
& diff_closed(X1) )
=> preboolean(X1) ),
file('<stdin>',cc2_finsub_1) ).
fof(c_0_23,axiom,
! [X1] : ~ empty(powerset(X1)),
file('<stdin>',fc1_subset_1) ).
fof(c_0_24,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('<stdin>',t8_boole) ).
fof(c_0_25,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('<stdin>',idempotence_k2_xboole_0) ).
fof(c_0_26,axiom,
! [X1,X2] : subset(X1,X1),
file('<stdin>',reflexivity_r1_tarski) ).
fof(c_0_27,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('<stdin>',t3_boole) ).
fof(c_0_28,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
file('<stdin>',t1_boole) ).
fof(c_0_29,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
file('<stdin>',t4_boole) ).
fof(c_0_30,axiom,
! [X1] :
( preboolean(X1)
=> ( cup_closed(X1)
& diff_closed(X1) ) ),
file('<stdin>',cc1_finsub_1) ).
fof(c_0_31,axiom,
! [X1] :
( empty(X1)
=> finite(X1) ),
file('<stdin>',cc1_finset_1) ).
fof(c_0_32,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('<stdin>',t6_boole) ).
fof(c_0_33,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_34,axiom,
? [X1] :
( ~ empty(X1)
& cup_closed(X1)
& cap_closed(X1)
& diff_closed(X1)
& preboolean(X1) ),
file('<stdin>',rc1_finsub_1) ).
fof(c_0_35,axiom,
? [X1] :
( ~ empty(X1)
& finite(X1) ),
file('<stdin>',rc1_finset_1) ).
fof(c_0_36,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_37,axiom,
empty(empty_set),
file('<stdin>',fc1_xboole_0) ).
fof(c_0_38,axiom,
! [X1] :
( diff_closed(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> in(set_difference(X2,X3),X1) ) ),
c_0_0 ).
fof(c_0_39,axiom,
! [X1] :
( cup_closed(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> in(set_union2(X2,X3),X1) ) ),
c_0_1 ).
fof(c_0_40,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
c_0_2 ).
fof(c_0_41,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
c_0_3 ).
fof(c_0_42,plain,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_43,plain,
! [X1,X2] :
( ~ empty(X1)
=> ~ empty(set_union2(X1,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_44,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
c_0_6 ).
fof(c_0_45,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_46,axiom,
! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(set_union2(X1,X2)) ),
c_0_8 ).
fof(c_0_47,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
c_0_9 ).
fof(c_0_48,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
c_0_10 ).
fof(c_0_49,axiom,
! [X1,X2] :
( finite(X1)
=> finite(set_difference(X1,X2)) ),
c_0_11 ).
fof(c_0_50,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
c_0_12 ).
fof(c_0_51,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_52,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_53,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_54,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
c_0_16 ).
fof(c_0_55,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
c_0_17 ).
fof(c_0_56,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
c_0_18 ).
fof(c_0_57,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2)
& relation(X2)
& function(X2)
& one_to_one(X2)
& epsilon_transitive(X2)
& epsilon_connected(X2)
& ordinal(X2)
& natural(X2)
& finite(X2) ),
c_0_19 ).
fof(c_0_58,axiom,
! [X1] :
? [X2] : element(X2,X1),
c_0_20 ).
fof(c_0_59,axiom,
! [X1] :
( preboolean(X1)
<=> ( cup_closed(X1)
& diff_closed(X1) ) ),
c_0_21 ).
fof(c_0_60,axiom,
! [X1] :
( ( cup_closed(X1)
& diff_closed(X1) )
=> preboolean(X1) ),
c_0_22 ).
fof(c_0_61,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
fof(c_0_62,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
c_0_24 ).
fof(c_0_63,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
c_0_25 ).
fof(c_0_64,axiom,
! [X1,X2] : subset(X1,X1),
c_0_26 ).
fof(c_0_65,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
c_0_27 ).
fof(c_0_66,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
c_0_28 ).
fof(c_0_67,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
c_0_29 ).
fof(c_0_68,axiom,
! [X1] :
( preboolean(X1)
=> ( cup_closed(X1)
& diff_closed(X1) ) ),
c_0_30 ).
fof(c_0_69,axiom,
! [X1] :
( empty(X1)
=> finite(X1) ),
c_0_31 ).
fof(c_0_70,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
c_0_32 ).
fof(c_0_71,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_33]) ).
fof(c_0_72,plain,
? [X1] :
( ~ empty(X1)
& cup_closed(X1)
& cap_closed(X1)
& diff_closed(X1)
& preboolean(X1) ),
inference(fof_simplification,[status(thm)],[c_0_34]) ).
fof(c_0_73,plain,
? [X1] :
( ~ empty(X1)
& finite(X1) ),
inference(fof_simplification,[status(thm)],[c_0_35]) ).
fof(c_0_74,axiom,
? [X1] : empty(X1),
c_0_36 ).
fof(c_0_75,axiom,
empty(empty_set),
c_0_37 ).
fof(c_0_76,plain,
! [X4,X5,X6,X7] :
( ( ~ diff_closed(X4)
| ~ in(X5,X4)
| ~ in(X6,X4)
| in(set_difference(X5,X6),X4) )
& ( in(esk3_1(X7),X7)
| diff_closed(X7) )
& ( in(esk4_1(X7),X7)
| diff_closed(X7) )
& ( ~ in(set_difference(esk3_1(X7),esk4_1(X7)),X7)
| diff_closed(X7) ) ),
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_38])])])])])]) ).
fof(c_0_77,plain,
! [X4,X5,X6,X7] :
( ( ~ cup_closed(X4)
| ~ in(X5,X4)
| ~ in(X6,X4)
| in(set_union2(X5,X6),X4) )
& ( in(esk1_1(X7),X7)
| cup_closed(X7) )
& ( in(esk2_1(X7),X7)
| cup_closed(X7) )
& ( ~ in(set_union2(esk1_1(X7),esk2_1(X7)),X7)
| cup_closed(X7) ) ),
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_39])])])])])]) ).
fof(c_0_78,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| element(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])]) ).
fof(c_0_79,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| ~ empty(X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])]) ).
fof(c_0_80,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_42])])])]) ).
fof(c_0_81,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_43])])])]) ).
fof(c_0_82,plain,
! [X3,X4,X5,X6] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X5,X6)
| element(X5,powerset(X6)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])]) ).
fof(c_0_83,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])]) ).
fof(c_0_84,plain,
! [X3,X4] :
( ~ finite(X3)
| ~ finite(X4)
| finite(set_union2(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])]) ).
fof(c_0_85,plain,
! [X3,X4] :
( ~ finite(X3)
| ~ element(X4,powerset(X3))
| finite(X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])]) ).
fof(c_0_86,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])]) ).
fof(c_0_87,plain,
! [X3,X4] :
( ~ finite(X3)
| finite(set_difference(X3,X4)) ),
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_88,plain,
! [X3,X4] :
( ~ in(X3,X4)
| element(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])]) ).
fof(c_0_89,plain,
! [X3] :
( ( element(esk14_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk14_1(X3))
| empty(X3) )
& ( finite(esk14_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])])]) ).
fof(c_0_90,plain,
! [X3] :
( ( element(esk13_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk13_1(X3))
| empty(X3) )
& ( finite(esk13_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])])])]) ).
fof(c_0_91,plain,
! [X3] :
( ( element(esk8_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk8_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])])])]) ).
fof(c_0_92,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])]) ).
fof(c_0_93,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[c_0_55]) ).
fof(c_0_94,plain,
! [X3] :
( element(esk11_1(X3),powerset(X3))
& empty(esk11_1(X3)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_56])]) ).
fof(c_0_95,plain,
! [X3] :
( element(esk10_1(X3),powerset(X3))
& empty(esk10_1(X3))
& relation(esk10_1(X3))
& function(esk10_1(X3))
& one_to_one(esk10_1(X3))
& epsilon_transitive(esk10_1(X3))
& epsilon_connected(esk10_1(X3))
& ordinal(esk10_1(X3))
& natural(esk10_1(X3))
& finite(esk10_1(X3)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_57])]) ).
fof(c_0_96,plain,
! [X3] : element(esk5_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_58])]) ).
fof(c_0_97,plain,
! [X2,X3] :
( ( cup_closed(X2)
| ~ preboolean(X2) )
& ( diff_closed(X2)
| ~ preboolean(X2) )
& ( ~ cup_closed(X3)
| ~ diff_closed(X3)
| preboolean(X3) ) ),
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_59])])])])]) ).
fof(c_0_98,plain,
! [X2] :
( ~ cup_closed(X2)
| ~ diff_closed(X2)
| preboolean(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])]) ).
fof(c_0_99,plain,
! [X2] : ~ empty(powerset(X2)),
inference(variable_rename,[status(thm)],[c_0_61]) ).
fof(c_0_100,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_62])])])]) ).
fof(c_0_101,plain,
! [X3,X4] : set_union2(X3,X3) = X3,
inference(variable_rename,[status(thm)],[c_0_63]) ).
fof(c_0_102,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[c_0_64]) ).
fof(c_0_103,plain,
! [X2] : set_difference(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[c_0_65]) ).
fof(c_0_104,plain,
! [X2] : set_union2(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[c_0_66]) ).
fof(c_0_105,plain,
! [X2] : set_difference(empty_set,X2) = empty_set,
inference(variable_rename,[status(thm)],[c_0_67]) ).
fof(c_0_106,plain,
! [X2] :
( ( cup_closed(X2)
| ~ preboolean(X2) )
& ( diff_closed(X2)
| ~ preboolean(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])])]) ).
fof(c_0_107,plain,
! [X2] :
( ~ empty(X2)
| finite(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_69])]) ).
fof(c_0_108,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])]) ).
fof(c_0_109,plain,
~ empty(esk12_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_71])]) ).
fof(c_0_110,plain,
( ~ empty(esk7_0)
& cup_closed(esk7_0)
& cap_closed(esk7_0)
& diff_closed(esk7_0)
& preboolean(esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_72])]) ).
fof(c_0_111,plain,
( ~ empty(esk6_0)
& finite(esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_73])]) ).
fof(c_0_112,plain,
empty(esk9_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_74])]) ).
fof(c_0_113,axiom,
empty(empty_set),
c_0_75 ).
cnf(c_0_114,plain,
( diff_closed(X1)
| ~ in(set_difference(esk3_1(X1),esk4_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_115,plain,
( cup_closed(X1)
| ~ in(set_union2(esk1_1(X1),esk2_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_116,plain,
( in(set_difference(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ diff_closed(X3) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_117,plain,
( in(set_union2(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ cup_closed(X3) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_118,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_119,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_120,plain,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_121,plain,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_122,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_123,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_124,plain,
( finite(set_union2(X1,X2))
| ~ finite(X2)
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_125,plain,
( finite(X1)
| ~ element(X1,powerset(X2))
| ~ finite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_126,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_127,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_128,plain,
( finite(set_difference(X1,X2))
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_129,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_130,plain,
( empty(X1)
| element(esk14_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_131,plain,
( empty(X1)
| element(esk13_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_132,plain,
( empty(X1)
| element(esk8_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_133,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_134,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_135,plain,
element(esk11_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_136,plain,
element(esk10_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_137,plain,
( diff_closed(X1)
| in(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_138,plain,
( diff_closed(X1)
| in(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_139,plain,
( cup_closed(X1)
| in(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_140,plain,
( cup_closed(X1)
| in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_141,plain,
( empty(X1)
| ~ empty(esk14_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_142,plain,
( empty(X1)
| ~ empty(esk13_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_143,plain,
( empty(X1)
| ~ empty(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_144,plain,
element(esk5_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_145,plain,
( preboolean(X1)
| ~ diff_closed(X1)
| ~ cup_closed(X1) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_146,plain,
( preboolean(X1)
| ~ diff_closed(X1)
| ~ cup_closed(X1) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_147,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_148,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_149,plain,
( empty(X1)
| finite(esk14_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_150,plain,
( empty(X1)
| finite(esk13_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_151,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_152,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_153,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_154,plain,
set_union2(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_155,plain,
set_difference(empty_set,X1) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_156,plain,
( cup_closed(X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_157,plain,
( diff_closed(X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_158,plain,
( cup_closed(X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_159,plain,
( diff_closed(X1)
| ~ preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_160,plain,
( finite(X1)
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_161,plain,
empty(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_162,plain,
empty(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_163,plain,
relation(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_164,plain,
function(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_165,plain,
one_to_one(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_166,plain,
epsilon_transitive(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_167,plain,
epsilon_connected(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_168,plain,
ordinal(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_169,plain,
natural(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_170,plain,
finite(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_171,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_172,plain,
~ empty(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_173,plain,
~ empty(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_174,plain,
~ empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_175,plain,
empty(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_176,plain,
cup_closed(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_177,plain,
cap_closed(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_178,plain,
diff_closed(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_179,plain,
preboolean(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_180,plain,
finite(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_181,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_182,plain,
( diff_closed(X1)
| ~ in(set_difference(esk3_1(X1),esk4_1(X1)),X1) ),
c_0_114,
[final] ).
cnf(c_0_183,plain,
( cup_closed(X1)
| ~ in(set_union2(esk1_1(X1),esk2_1(X1)),X1) ),
c_0_115,
[final] ).
cnf(c_0_184,plain,
( in(set_difference(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ diff_closed(X3) ),
c_0_116,
[final] ).
cnf(c_0_185,plain,
( in(set_union2(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ cup_closed(X3) ),
c_0_117,
[final] ).
cnf(c_0_186,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
c_0_118,
[final] ).
cnf(c_0_187,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
c_0_119,
[final] ).
cnf(c_0_188,plain,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
c_0_120,
[final] ).
cnf(c_0_189,plain,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
c_0_121,
[final] ).
cnf(c_0_190,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
c_0_122,
[final] ).
cnf(c_0_191,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_123,
[final] ).
cnf(c_0_192,plain,
( finite(set_union2(X1,X2))
| ~ finite(X2)
| ~ finite(X1) ),
c_0_124,
[final] ).
cnf(c_0_193,plain,
( finite(X1)
| ~ element(X1,powerset(X2))
| ~ finite(X2) ),
c_0_125,
[final] ).
cnf(c_0_194,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
c_0_126,
[final] ).
cnf(c_0_195,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
c_0_127,
[final] ).
cnf(c_0_196,plain,
( finite(set_difference(X1,X2))
| ~ finite(X1) ),
c_0_128,
[final] ).
cnf(c_0_197,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
c_0_129,
[final] ).
cnf(c_0_198,plain,
( empty(X1)
| element(esk14_1(X1),powerset(X1)) ),
c_0_130,
[final] ).
cnf(c_0_199,plain,
( empty(X1)
| element(esk13_1(X1),powerset(X1)) ),
c_0_131,
[final] ).
cnf(c_0_200,plain,
( empty(X1)
| element(esk8_1(X1),powerset(X1)) ),
c_0_132,
[final] ).
cnf(c_0_201,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
c_0_133,
[final] ).
cnf(c_0_202,plain,
set_union2(X1,X2) = set_union2(X2,X1),
c_0_134,
[final] ).
cnf(c_0_203,plain,
element(esk11_1(X1),powerset(X1)),
c_0_135,
[final] ).
cnf(c_0_204,plain,
element(esk10_1(X1),powerset(X1)),
c_0_136,
[final] ).
cnf(c_0_205,plain,
( diff_closed(X1)
| in(esk3_1(X1),X1) ),
c_0_137,
[final] ).
cnf(c_0_206,plain,
( diff_closed(X1)
| in(esk4_1(X1),X1) ),
c_0_138,
[final] ).
cnf(c_0_207,plain,
( cup_closed(X1)
| in(esk1_1(X1),X1) ),
c_0_139,
[final] ).
cnf(c_0_208,plain,
( cup_closed(X1)
| in(esk2_1(X1),X1) ),
c_0_140,
[final] ).
cnf(c_0_209,plain,
( empty(X1)
| ~ empty(esk14_1(X1)) ),
c_0_141,
[final] ).
cnf(c_0_210,plain,
( empty(X1)
| ~ empty(esk13_1(X1)) ),
c_0_142,
[final] ).
cnf(c_0_211,plain,
( empty(X1)
| ~ empty(esk8_1(X1)) ),
c_0_143,
[final] ).
cnf(c_0_212,plain,
element(esk5_1(X1),X1),
c_0_144,
[final] ).
cnf(c_0_213,plain,
( preboolean(X1)
| ~ diff_closed(X1)
| ~ cup_closed(X1) ),
c_0_145,
[final] ).
cnf(c_0_214,plain,
( preboolean(X1)
| ~ diff_closed(X1)
| ~ cup_closed(X1) ),
c_0_146,
[final] ).
cnf(c_0_215,plain,
~ empty(powerset(X1)),
c_0_147,
[final] ).
cnf(c_0_216,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
c_0_148,
[final] ).
cnf(c_0_217,plain,
( empty(X1)
| finite(esk14_1(X1)) ),
c_0_149,
[final] ).
cnf(c_0_218,plain,
( empty(X1)
| finite(esk13_1(X1)) ),
c_0_150,
[final] ).
cnf(c_0_219,plain,
set_union2(X1,X1) = X1,
c_0_151,
[final] ).
cnf(c_0_220,plain,
subset(X1,X1),
c_0_152,
[final] ).
cnf(c_0_221,plain,
set_difference(X1,empty_set) = X1,
c_0_153,
[final] ).
cnf(c_0_222,plain,
set_union2(X1,empty_set) = X1,
c_0_154,
[final] ).
cnf(c_0_223,plain,
set_difference(empty_set,X1) = empty_set,
c_0_155,
[final] ).
cnf(c_0_224,plain,
( cup_closed(X1)
| ~ preboolean(X1) ),
c_0_156,
[final] ).
cnf(c_0_225,plain,
( diff_closed(X1)
| ~ preboolean(X1) ),
c_0_157,
[final] ).
cnf(c_0_226,plain,
( cup_closed(X1)
| ~ preboolean(X1) ),
c_0_158,
[final] ).
cnf(c_0_227,plain,
( diff_closed(X1)
| ~ preboolean(X1) ),
c_0_159,
[final] ).
cnf(c_0_228,plain,
( finite(X1)
| ~ empty(X1) ),
c_0_160,
[final] ).
cnf(c_0_229,plain,
empty(esk11_1(X1)),
c_0_161,
[final] ).
cnf(c_0_230,plain,
empty(esk10_1(X1)),
c_0_162,
[final] ).
cnf(c_0_231,plain,
relation(esk10_1(X1)),
c_0_163,
[final] ).
cnf(c_0_232,plain,
function(esk10_1(X1)),
c_0_164,
[final] ).
cnf(c_0_233,plain,
one_to_one(esk10_1(X1)),
c_0_165,
[final] ).
cnf(c_0_234,plain,
epsilon_transitive(esk10_1(X1)),
c_0_166,
[final] ).
cnf(c_0_235,plain,
epsilon_connected(esk10_1(X1)),
c_0_167,
[final] ).
cnf(c_0_236,plain,
ordinal(esk10_1(X1)),
c_0_168,
[final] ).
cnf(c_0_237,plain,
natural(esk10_1(X1)),
c_0_169,
[final] ).
cnf(c_0_238,plain,
finite(esk10_1(X1)),
c_0_170,
[final] ).
cnf(c_0_239,plain,
( X1 = empty_set
| ~ empty(X1) ),
c_0_171,
[final] ).
cnf(c_0_240,plain,
~ empty(esk12_0),
c_0_172,
[final] ).
cnf(c_0_241,plain,
~ empty(esk7_0),
c_0_173,
[final] ).
cnf(c_0_242,plain,
~ empty(esk6_0),
c_0_174,
[final] ).
cnf(c_0_243,plain,
empty(esk9_0),
c_0_175,
[final] ).
cnf(c_0_244,plain,
cup_closed(esk7_0),
c_0_176,
[final] ).
cnf(c_0_245,plain,
cap_closed(esk7_0),
c_0_177,
[final] ).
cnf(c_0_246,plain,
diff_closed(esk7_0),
c_0_178,
[final] ).
cnf(c_0_247,plain,
preboolean(esk7_0),
c_0_179,
[final] ).
cnf(c_0_248,plain,
finite(esk6_0),
c_0_180,
[final] ).
cnf(c_0_249,plain,
empty(empty_set),
c_0_181,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_182_0,axiom,
( diff_closed(X1)
| ~ in(set_difference(sk1_esk3_1(X1),sk1_esk4_1(X1)),X1) ),
inference(literals_permutation,[status(thm)],[c_0_182]) ).
cnf(c_0_182_1,axiom,
( ~ in(set_difference(sk1_esk3_1(X1),sk1_esk4_1(X1)),X1)
| diff_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_182]) ).
cnf(c_0_183_0,axiom,
( cup_closed(X1)
| ~ in(set_union2(sk1_esk1_1(X1),sk1_esk2_1(X1)),X1) ),
inference(literals_permutation,[status(thm)],[c_0_183]) ).
cnf(c_0_183_1,axiom,
( ~ in(set_union2(sk1_esk1_1(X1),sk1_esk2_1(X1)),X1)
| cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_183]) ).
cnf(c_0_184_0,axiom,
( in(set_difference(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ diff_closed(X3) ),
inference(literals_permutation,[status(thm)],[c_0_184]) ).
cnf(c_0_184_1,axiom,
( ~ in(X2,X3)
| in(set_difference(X1,X2),X3)
| ~ in(X1,X3)
| ~ diff_closed(X3) ),
inference(literals_permutation,[status(thm)],[c_0_184]) ).
cnf(c_0_184_2,axiom,
( ~ in(X1,X3)
| ~ in(X2,X3)
| in(set_difference(X1,X2),X3)
| ~ diff_closed(X3) ),
inference(literals_permutation,[status(thm)],[c_0_184]) ).
cnf(c_0_184_3,axiom,
( ~ diff_closed(X3)
| ~ in(X1,X3)
| ~ in(X2,X3)
| in(set_difference(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_184]) ).
cnf(c_0_185_0,axiom,
( in(set_union2(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ cup_closed(X3) ),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_185_1,axiom,
( ~ in(X2,X3)
| in(set_union2(X1,X2),X3)
| ~ in(X1,X3)
| ~ cup_closed(X3) ),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_185_2,axiom,
( ~ in(X1,X3)
| ~ in(X2,X3)
| in(set_union2(X1,X2),X3)
| ~ cup_closed(X3) ),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_185_3,axiom,
( ~ cup_closed(X3)
| ~ in(X1,X3)
| ~ in(X2,X3)
| in(set_union2(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_186_0,axiom,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_186_1,axiom,
( ~ element(X3,powerset(X2))
| element(X1,X2)
| ~ in(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_186_2,axiom,
( ~ in(X1,X3)
| ~ element(X3,powerset(X2))
| element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_187_0,axiom,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_187]) ).
cnf(c_0_187_1,axiom,
( ~ element(X2,powerset(X1))
| ~ empty(X1)
| ~ in(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_187]) ).
cnf(c_0_187_2,axiom,
( ~ in(X3,X2)
| ~ element(X2,powerset(X1))
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_187]) ).
cnf(c_0_188_0,axiom,
( empty(X2)
| ~ empty(set_union2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_188]) ).
cnf(c_0_188_1,axiom,
( ~ empty(set_union2(X1,X2))
| empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_188]) ).
cnf(c_0_189_0,axiom,
( empty(X1)
| ~ empty(set_union2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_189]) ).
cnf(c_0_189_1,axiom,
( ~ empty(set_union2(X1,X2))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_189]) ).
cnf(c_0_190_0,axiom,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_190]) ).
cnf(c_0_190_1,axiom,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_190]) ).
cnf(c_0_191_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_191]) ).
cnf(c_0_191_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_191]) ).
cnf(c_0_192_0,axiom,
( finite(set_union2(X1,X2))
| ~ finite(X2)
| ~ finite(X1) ),
inference(literals_permutation,[status(thm)],[c_0_192]) ).
cnf(c_0_192_1,axiom,
( ~ finite(X2)
| finite(set_union2(X1,X2))
| ~ finite(X1) ),
inference(literals_permutation,[status(thm)],[c_0_192]) ).
cnf(c_0_192_2,axiom,
( ~ finite(X1)
| ~ finite(X2)
| finite(set_union2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_192]) ).
cnf(c_0_193_0,axiom,
( finite(X1)
| ~ element(X1,powerset(X2))
| ~ finite(X2) ),
inference(literals_permutation,[status(thm)],[c_0_193]) ).
cnf(c_0_193_1,axiom,
( ~ element(X1,powerset(X2))
| finite(X1)
| ~ finite(X2) ),
inference(literals_permutation,[status(thm)],[c_0_193]) ).
cnf(c_0_193_2,axiom,
( ~ finite(X2)
| ~ element(X1,powerset(X2))
| finite(X1) ),
inference(literals_permutation,[status(thm)],[c_0_193]) ).
cnf(c_0_194_0,axiom,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_194_1,axiom,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_195_0,axiom,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_195]) ).
cnf(c_0_195_1,axiom,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_195]) ).
cnf(c_0_195_2,axiom,
( ~ element(X1,X2)
| empty(X2)
| in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_195]) ).
cnf(c_0_196_0,axiom,
( finite(set_difference(X1,X2))
| ~ finite(X1) ),
inference(literals_permutation,[status(thm)],[c_0_196]) ).
cnf(c_0_196_1,axiom,
( ~ finite(X1)
| finite(set_difference(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_196]) ).
cnf(c_0_197_0,axiom,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_197]) ).
cnf(c_0_197_1,axiom,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_197]) ).
cnf(c_0_198_0,axiom,
( empty(X1)
| element(sk1_esk14_1(X1),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_198]) ).
cnf(c_0_198_1,axiom,
( element(sk1_esk14_1(X1),powerset(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_198]) ).
cnf(c_0_199_0,axiom,
( empty(X1)
| element(sk1_esk13_1(X1),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_199_1,axiom,
( element(sk1_esk13_1(X1),powerset(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_200_0,axiom,
( empty(X1)
| element(sk1_esk8_1(X1),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_200_1,axiom,
( element(sk1_esk8_1(X1),powerset(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_201_0,axiom,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_201]) ).
cnf(c_0_201_1,axiom,
( ~ in(X2,X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_201]) ).
cnf(c_0_205_0,axiom,
( diff_closed(X1)
| in(sk1_esk3_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_205]) ).
cnf(c_0_205_1,axiom,
( in(sk1_esk3_1(X1),X1)
| diff_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_205]) ).
cnf(c_0_206_0,axiom,
( diff_closed(X1)
| in(sk1_esk4_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_206]) ).
cnf(c_0_206_1,axiom,
( in(sk1_esk4_1(X1),X1)
| diff_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_206]) ).
cnf(c_0_207_0,axiom,
( cup_closed(X1)
| in(sk1_esk1_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_207_1,axiom,
( in(sk1_esk1_1(X1),X1)
| cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_208_0,axiom,
( cup_closed(X1)
| in(sk1_esk2_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_208_1,axiom,
( in(sk1_esk2_1(X1),X1)
| cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_209_0,axiom,
( empty(X1)
| ~ empty(sk1_esk14_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_209_1,axiom,
( ~ empty(sk1_esk14_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_210_0,axiom,
( empty(X1)
| ~ empty(sk1_esk13_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_210]) ).
cnf(c_0_210_1,axiom,
( ~ empty(sk1_esk13_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_210]) ).
cnf(c_0_211_0,axiom,
( empty(X1)
| ~ empty(sk1_esk8_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_211]) ).
cnf(c_0_211_1,axiom,
( ~ empty(sk1_esk8_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_211]) ).
cnf(c_0_213_0,axiom,
( preboolean(X1)
| ~ diff_closed(X1)
| ~ cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_213]) ).
cnf(c_0_213_1,axiom,
( ~ diff_closed(X1)
| preboolean(X1)
| ~ cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_213]) ).
cnf(c_0_213_2,axiom,
( ~ cup_closed(X1)
| ~ diff_closed(X1)
| preboolean(X1) ),
inference(literals_permutation,[status(thm)],[c_0_213]) ).
cnf(c_0_214_0,axiom,
( preboolean(X1)
| ~ diff_closed(X1)
| ~ cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_214]) ).
cnf(c_0_214_1,axiom,
( ~ diff_closed(X1)
| preboolean(X1)
| ~ cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_214]) ).
cnf(c_0_214_2,axiom,
( ~ cup_closed(X1)
| ~ diff_closed(X1)
| preboolean(X1) ),
inference(literals_permutation,[status(thm)],[c_0_214]) ).
cnf(c_0_216_0,axiom,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_216_1,axiom,
( ~ empty(X1)
| X2 = X1
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_216_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| X2 = X1 ),
inference(literals_permutation,[status(thm)],[c_0_216]) ).
cnf(c_0_217_0,axiom,
( empty(X1)
| finite(sk1_esk14_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_217]) ).
cnf(c_0_217_1,axiom,
( finite(sk1_esk14_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_217]) ).
cnf(c_0_218_0,axiom,
( empty(X1)
| finite(sk1_esk13_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_218_1,axiom,
( finite(sk1_esk13_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_224_0,axiom,
( cup_closed(X1)
| ~ preboolean(X1) ),
inference(literals_permutation,[status(thm)],[c_0_224]) ).
cnf(c_0_224_1,axiom,
( ~ preboolean(X1)
| cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_224]) ).
cnf(c_0_225_0,axiom,
( diff_closed(X1)
| ~ preboolean(X1) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_225_1,axiom,
( ~ preboolean(X1)
| diff_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_226_0,axiom,
( cup_closed(X1)
| ~ preboolean(X1) ),
inference(literals_permutation,[status(thm)],[c_0_226]) ).
cnf(c_0_226_1,axiom,
( ~ preboolean(X1)
| cup_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_226]) ).
cnf(c_0_227_0,axiom,
( diff_closed(X1)
| ~ preboolean(X1) ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_227_1,axiom,
( ~ preboolean(X1)
| diff_closed(X1) ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_228_0,axiom,
( finite(X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_228]) ).
cnf(c_0_228_1,axiom,
( ~ empty(X1)
| finite(X1) ),
inference(literals_permutation,[status(thm)],[c_0_228]) ).
cnf(c_0_239_0,axiom,
( X1 = empty_set
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_239_1,axiom,
( ~ empty(X1)
| X1 = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_215_0,axiom,
~ empty(powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_215]) ).
cnf(c_0_240_0,axiom,
~ empty(sk1_esk12_0),
inference(literals_permutation,[status(thm)],[c_0_240]) ).
cnf(c_0_241_0,axiom,
~ empty(sk1_esk7_0),
inference(literals_permutation,[status(thm)],[c_0_241]) ).
cnf(c_0_242_0,axiom,
~ empty(sk1_esk6_0),
inference(literals_permutation,[status(thm)],[c_0_242]) ).
cnf(c_0_202_0,axiom,
set_union2(X1,X2) = set_union2(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_202]) ).
cnf(c_0_203_0,axiom,
element(sk1_esk11_1(X1),powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_203]) ).
cnf(c_0_204_0,axiom,
element(sk1_esk10_1(X1),powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_204]) ).
cnf(c_0_212_0,axiom,
element(sk1_esk5_1(X1),X1),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
cnf(c_0_219_0,axiom,
set_union2(X1,X1) = X1,
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_220_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_221_0,axiom,
set_difference(X1,empty_set) = X1,
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_222_0,axiom,
set_union2(X1,empty_set) = X1,
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_223_0,axiom,
set_difference(empty_set,X1) = empty_set,
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_229_0,axiom,
empty(sk1_esk11_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_229]) ).
cnf(c_0_230_0,axiom,
empty(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_230]) ).
cnf(c_0_231_0,axiom,
relation(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_232_0,axiom,
function(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_233_0,axiom,
one_to_one(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_234_0,axiom,
epsilon_transitive(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_234]) ).
cnf(c_0_235_0,axiom,
epsilon_connected(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_235]) ).
cnf(c_0_236_0,axiom,
ordinal(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_236]) ).
cnf(c_0_237_0,axiom,
natural(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_238_0,axiom,
finite(sk1_esk10_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_238]) ).
cnf(c_0_243_0,axiom,
empty(sk1_esk9_0),
inference(literals_permutation,[status(thm)],[c_0_243]) ).
cnf(c_0_244_0,axiom,
cup_closed(sk1_esk7_0),
inference(literals_permutation,[status(thm)],[c_0_244]) ).
cnf(c_0_245_0,axiom,
cap_closed(sk1_esk7_0),
inference(literals_permutation,[status(thm)],[c_0_245]) ).
cnf(c_0_246_0,axiom,
diff_closed(sk1_esk7_0),
inference(literals_permutation,[status(thm)],[c_0_246]) ).
cnf(c_0_247_0,axiom,
preboolean(sk1_esk7_0),
inference(literals_permutation,[status(thm)],[c_0_247]) ).
cnf(c_0_248_0,axiom,
finite(sk1_esk6_0),
inference(literals_permutation,[status(thm)],[c_0_248]) ).
cnf(c_0_249_0,axiom,
empty(empty_set),
inference(literals_permutation,[status(thm)],[c_0_249]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1] :
( preboolean(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> ( in(set_union2(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) ),
file('<stdin>',t10_finsub_1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1] :
( preboolean(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> ( in(set_union2(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
! [X7,X8] :
( ( in(esk2_0,esk1_0)
| ~ preboolean(esk1_0) )
& ( in(esk3_0,esk1_0)
| ~ preboolean(esk1_0) )
& ( ~ in(set_union2(esk2_0,esk3_0),esk1_0)
| ~ in(set_difference(esk2_0,esk3_0),esk1_0)
| ~ preboolean(esk1_0) )
& ( in(set_union2(X7,X8),esk1_0)
| ~ in(X7,esk1_0)
| ~ in(X8,esk1_0)
| preboolean(esk1_0) )
& ( in(set_difference(X7,X8),esk1_0)
| ~ in(X7,esk1_0)
| ~ in(X8,esk1_0)
| preboolean(esk1_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3_004,negated_conjecture,
( ~ preboolean(esk1_0)
| ~ in(set_difference(esk2_0,esk3_0),esk1_0)
| ~ in(set_union2(esk2_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( preboolean(esk1_0)
| in(set_union2(X2,X1),esk1_0)
| ~ in(X1,esk1_0)
| ~ in(X2,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( preboolean(esk1_0)
| in(set_difference(X2,X1),esk1_0)
| ~ in(X1,esk1_0)
| ~ in(X2,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
( in(esk2_0,esk1_0)
| ~ preboolean(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
( in(esk3_0,esk1_0)
| ~ preboolean(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
( ~ preboolean(esk1_0)
| ~ in(set_difference(esk2_0,esk3_0),esk1_0)
| ~ in(set_union2(esk2_0,esk3_0),esk1_0) ),
c_0_3,
[final] ).
cnf(c_0_9_010,negated_conjecture,
( preboolean(esk1_0)
| in(set_union2(X2,X1),esk1_0)
| ~ in(X1,esk1_0)
| ~ in(X2,esk1_0) ),
c_0_4,
[final] ).
cnf(c_0_10_011,negated_conjecture,
( preboolean(esk1_0)
| in(set_difference(X2,X1),esk1_0)
| ~ in(X1,esk1_0)
| ~ in(X2,esk1_0) ),
c_0_5,
[final] ).
cnf(c_0_11_012,negated_conjecture,
( in(esk2_0,esk1_0)
| ~ preboolean(esk1_0) ),
c_0_6,
[final] ).
cnf(c_0_12_013,negated_conjecture,
( in(esk3_0,esk1_0)
| ~ preboolean(esk1_0) ),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_122,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk1_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_12) ).
cnf(c_184,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_200,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_184]) ).
cnf(c_201,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_200]) ).
cnf(c_208,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_201]) ).
cnf(c_570,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_208]) ).
cnf(c_108,plain,
( ~ cup_closed(X0)
| ~ in(X1,X0)
| in(set_union2(X1,X2),X0)
| ~ in(X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_185_1) ).
cnf(c_546,plain,
( ~ cup_closed(X0)
| ~ in(X1,X0)
| in(set_union2(X1,X2),X0)
| ~ in(X2,X0) ),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_547,plain,
( ~ cup_closed(X0)
| in(set_union2(X1,X2),X0)
| ~ in(X1,X0)
| ~ in(X2,X0) ),
inference(rewriting,[status(thm)],[c_546]) ).
cnf(c_609,plain,
( ~ preboolean(sk2_esk1_0)
| ~ cup_closed(sk2_esk1_0)
| in(set_union2(X0,sk2_esk3_0),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_570,c_547]) ).
cnf(c_610,plain,
( ~ preboolean(sk2_esk1_0)
| ~ cup_closed(sk2_esk1_0)
| in(set_union2(X0,sk2_esk3_0),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_609]) ).
cnf(c_119,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_union2(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_9) ).
cnf(c_178,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_union2(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_119]) ).
cnf(c_197,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_union2(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_178]) ).
cnf(c_204,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_union2(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_197]) ).
cnf(c_210,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_union2(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_204]) ).
cnf(c_574,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_union2(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_210]) ).
cnf(c_114,plain,
( cup_closed(X0)
| ~ in(set_union2(sk1_esk1_1(X0),sk1_esk2_1(X0)),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_183_1) ).
cnf(c_558,plain,
( cup_closed(X0)
| ~ in(set_union2(sk1_esk1_1(X0),sk1_esk2_1(X0)),X0) ),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_664,plain,
( preboolean(sk2_esk1_0)
| cup_closed(sk2_esk1_0)
| ~ in(sk1_esk2_1(sk2_esk1_0),sk2_esk1_0)
| ~ in(sk1_esk1_1(sk2_esk1_0),sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_574,c_558]) ).
cnf(c_665,plain,
( preboolean(sk2_esk1_0)
| cup_closed(sk2_esk1_0)
| ~ in(sk1_esk2_1(sk2_esk1_0),sk2_esk1_0)
| ~ in(sk1_esk1_1(sk2_esk1_0),sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_664]) ).
cnf(c_63,plain,
( cup_closed(X0)
| in(sk1_esk1_1(X0),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_207_1) ).
cnf(c_456,plain,
( cup_closed(X0)
| in(sk1_esk1_1(X0),X0) ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_61,plain,
( cup_closed(X0)
| in(sk1_esk2_1(X0),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_208_1) ).
cnf(c_452,plain,
( cup_closed(X0)
| in(sk1_esk2_1(X0),X0) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_36,plain,
( cup_closed(X0)
| ~ preboolean(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_226_1) ).
cnf(c_402,plain,
( cup_closed(X0)
| ~ preboolean(X0) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_403,plain,
( ~ preboolean(X0)
| cup_closed(X0) ),
inference(rewriting,[status(thm)],[c_402]) ).
cnf(c_711,plain,
cup_closed(sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_665,c_456,c_452,c_403]) ).
cnf(c_712,plain,
cup_closed(sk2_esk1_0),
inference(rewriting,[status(thm)],[c_711]) ).
cnf(c_49,plain,
( preboolean(X0)
| ~ diff_closed(X0)
| ~ cup_closed(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_214_2) ).
cnf(c_428,plain,
( preboolean(X0)
| ~ diff_closed(X0)
| ~ cup_closed(X0) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_714,plain,
( preboolean(sk2_esk1_0)
| ~ diff_closed(sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_712,c_428]) ).
cnf(c_715,plain,
( preboolean(sk2_esk1_0)
| ~ diff_closed(sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_714]) ).
cnf(c_120,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_difference(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_10) ).
cnf(c_180,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_difference(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_120]) ).
cnf(c_198,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_difference(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_180]) ).
cnf(c_203,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_difference(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_198]) ).
cnf(c_206,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_difference(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_203]) ).
cnf(c_566,negated_conjecture,
( preboolean(sk2_esk1_0)
| in(set_difference(X0,X1),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0)
| ~ in(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_206]) ).
cnf(c_116,plain,
( diff_closed(X0)
| ~ in(set_difference(sk1_esk3_1(X0),sk1_esk4_1(X0)),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_182_1) ).
cnf(c_562,plain,
( diff_closed(X0)
| ~ in(set_difference(sk1_esk3_1(X0),sk1_esk4_1(X0)),X0) ),
inference(copy,[status(esa)],[c_116]) ).
cnf(c_634,plain,
( preboolean(sk2_esk1_0)
| diff_closed(sk2_esk1_0)
| ~ in(sk1_esk4_1(sk2_esk1_0),sk2_esk1_0)
| ~ in(sk1_esk3_1(sk2_esk1_0),sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_566,c_562]) ).
cnf(c_635,plain,
( preboolean(sk2_esk1_0)
| diff_closed(sk2_esk1_0)
| ~ in(sk1_esk4_1(sk2_esk1_0),sk2_esk1_0)
| ~ in(sk1_esk3_1(sk2_esk1_0),sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_634]) ).
cnf(c_67,plain,
( diff_closed(X0)
| in(sk1_esk3_1(X0),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_205_1) ).
cnf(c_464,plain,
( diff_closed(X0)
| in(sk1_esk3_1(X0),X0) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_65,plain,
( diff_closed(X0)
| in(sk1_esk4_1(X0),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_206_1) ).
cnf(c_460,plain,
( diff_closed(X0)
| in(sk1_esk4_1(X0),X0) ),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_34,plain,
( diff_closed(X0)
| ~ preboolean(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_227_1) ).
cnf(c_398,plain,
( diff_closed(X0)
| ~ preboolean(X0) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_399,plain,
( ~ preboolean(X0)
| diff_closed(X0) ),
inference(rewriting,[status(thm)],[c_398]) ).
cnf(c_702,plain,
diff_closed(sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_635,c_464,c_460,c_399]) ).
cnf(c_703,plain,
diff_closed(sk2_esk1_0),
inference(rewriting,[status(thm)],[c_702]) ).
cnf(c_720,plain,
preboolean(sk2_esk1_0),
inference(forward_subsumption_resolution,[status(thm)],[c_715,c_703]) ).
cnf(c_721,plain,
preboolean(sk2_esk1_0),
inference(rewriting,[status(thm)],[c_720]) ).
cnf(c_829,plain,
( in(set_union2(X0,sk2_esk3_0),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_610,c_712,c_721]) ).
cnf(c_830,plain,
( in(set_union2(X0,sk2_esk3_0),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_829]) ).
cnf(c_118,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(set_union2(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_8) ).
cnf(c_176,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(set_union2(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0) ),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_196,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(set_union2(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0) ),
inference(copy,[status(esa)],[c_176]) ).
cnf(c_205,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(set_union2(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0) ),
inference(copy,[status(esa)],[c_196]) ).
cnf(c_209,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(set_union2(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0) ),
inference(copy,[status(esa)],[c_205]) ).
cnf(c_572,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(set_union2(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0) ),
inference(copy,[status(esa)],[c_209]) ).
cnf(c_727,negated_conjecture,
( ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(set_union2(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_721,c_572]) ).
cnf(c_736,plain,
( ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(set_union2(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_727]) ).
cnf(c_847,plain,
( ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(sk2_esk2_0,sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_830,c_736]) ).
cnf(c_848,plain,
( ~ in(set_difference(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ in(sk2_esk2_0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_847]) ).
cnf(c_121,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk2_0,sk2_esk1_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_11) ).
cnf(c_182,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk2_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_199,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk2_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_182]) ).
cnf(c_202,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk2_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_199]) ).
cnf(c_207,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk2_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_202]) ).
cnf(c_568,negated_conjecture,
( ~ preboolean(sk2_esk1_0)
| in(sk2_esk2_0,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_207]) ).
cnf(c_729,negated_conjecture,
in(sk2_esk2_0,sk2_esk1_0),
inference(backward_subsumption_resolution,[status(thm)],[c_721,c_568]) ).
cnf(c_734,plain,
in(sk2_esk2_0,sk2_esk1_0),
inference(rewriting,[status(thm)],[c_729]) ).
cnf(c_112,plain,
( ~ diff_closed(X0)
| ~ in(X1,X0)
| in(set_difference(X1,X2),X0)
| ~ in(X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p',c_0_184_1) ).
cnf(c_554,plain,
( ~ diff_closed(X0)
| ~ in(X1,X0)
| in(set_difference(X1,X2),X0)
| ~ in(X2,X0) ),
inference(copy,[status(esa)],[c_112]) ).
cnf(c_555,plain,
( ~ diff_closed(X0)
| in(set_difference(X1,X2),X0)
| ~ in(X1,X0)
| ~ in(X2,X0) ),
inference(rewriting,[status(thm)],[c_554]) ).
cnf(c_608,plain,
( ~ preboolean(sk2_esk1_0)
| ~ diff_closed(sk2_esk1_0)
| in(set_difference(X0,sk2_esk3_0),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_570,c_555]) ).
cnf(c_611,plain,
( ~ preboolean(sk2_esk1_0)
| ~ diff_closed(sk2_esk1_0)
| in(set_difference(X0,sk2_esk3_0),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_608]) ).
cnf(c_853,plain,
( in(set_difference(X0,sk2_esk3_0),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_611,c_703,c_721]) ).
cnf(c_854,plain,
( in(set_difference(X0,sk2_esk3_0),sk2_esk1_0)
| ~ in(X0,sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_853]) ).
cnf(c_887,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_848,c_734,c_854]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU101+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 22:45:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35 % Running in mono-core mode
% 0.19/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.41 % FOF problem with conjecture
% 0.19/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_aa5f4e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_5a11ab | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.39/0.64 % --bmc1_dump_unsat_core_tptp false
% 0.39/0.64 % --bmc1_dump_file -
% 0.39/0.64 % --bmc1_ucm_expand_uc_limit 128
% 0.39/0.64 % --bmc1_ucm_n_expand_iterations 6
% 0.39/0.64 % --bmc1_ucm_extend_mode 1
% 0.39/0.64 % --bmc1_ucm_init_mode 2
% 0.39/0.64 % --bmc1_ucm_cone_mode none
% 0.39/0.64 % --bmc1_ucm_reduced_relation_type 0
% 0.39/0.64 % --bmc1_ucm_relax_model 4
% 0.39/0.64 % --bmc1_ucm_full_tr_after_sat true
% 0.39/0.64 % --bmc1_ucm_expand_neg_assumptions false
% 0.39/0.64 % --bmc1_ucm_layered_model none
% 0.39/0.64 % --bmc1_ucm_max_lemma_size 10
% 0.39/0.64
% 0.39/0.64 % ------ AIG Options
% 0.39/0.64
% 0.39/0.64 % --aig_mode false
% 0.39/0.64
% 0.39/0.64 % ------ Instantiation Options
% 0.39/0.64
% 0.39/0.64 % --instantiation_flag true
% 0.39/0.64 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.39/0.64 % --inst_solver_per_active 750
% 0.39/0.64 % --inst_solver_calls_frac 0.5
% 0.39/0.64 % --inst_passive_queue_type priority_queues
% 0.39/0.64 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.39/0.64 % --inst_passive_queues_freq [25;2]
% 0.39/0.64 % --inst_dismatching true
% 0.39/0.64 % --inst_eager_unprocessed_to_passive true
% 0.39/0.64 % --inst_prop_sim_given true
% 0.39/0.64 % --inst_prop_sim_new false
% 0.39/0.64 % --inst_orphan_elimination true
% 0.39/0.64 % --inst_learning_loop_flag true
% 0.39/0.64 % --inst_learning_start 3000
% 0.39/0.64 % --inst_learning_factor 2
% 0.39/0.64 % --inst_start_prop_sim_after_learn 3
% 0.39/0.64 % --inst_sel_renew solver
% 0.39/0.64 % --inst_lit_activity_flag true
% 0.39/0.64 % --inst_out_proof true
% 0.39/0.64
% 0.39/0.64 % ------ Resolution Options
% 0.39/0.64
% 0.39/0.64 % --resolution_flag true
% 0.39/0.64 % --res_lit_sel kbo_max
% 0.39/0.64 % --res_to_prop_solver none
% 0.39/0.64 % --res_prop_simpl_new false
% 0.39/0.64 % --res_prop_simpl_given false
% 0.39/0.64 % --res_passive_queue_type priority_queues
% 0.39/0.64 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.39/0.64 % --res_passive_queues_freq [15;5]
% 0.39/0.64 % --res_forward_subs full
% 0.39/0.64 % --res_backward_subs full
% 0.39/0.64 % --res_forward_subs_resolution true
% 0.39/0.64 % --res_backward_subs_resolution true
% 0.39/0.64 % --res_orphan_elimination false
% 0.39/0.64 % --res_time_limit 1000.
% 0.39/0.64 % --res_out_proof true
% 0.39/0.64 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_aa5f4e.s
% 0.39/0.64 % --modulo true
% 0.39/0.64
% 0.39/0.64 % ------ Combination Options
% 0.39/0.64
% 0.39/0.64 % --comb_res_mult 1000
% 0.39/0.64 % --comb_inst_mult 300
% 0.39/0.64 % ------
% 0.39/0.64
% 0.39/0.64 % ------ Parsing...% successful
% 0.39/0.64
% 0.39/0.64 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.39/0.64
% 0.39/0.64 % ------ Proving...
% 0.39/0.64 % ------ Problem Properties
% 0.39/0.64
% 0.39/0.64 %
% 0.39/0.64 % EPR false
% 0.39/0.64 % Horn false
% 0.39/0.64 % Has equality true
% 0.39/0.64
% 0.39/0.64 % % ------ Input Options Time Limit: Unbounded
% 0.39/0.64
% 0.39/0.64
% 0.39/0.64 Compiling...
% 0.39/0.64 Loading plugin: done.
% 0.39/0.64 Compiling...
% 0.39/0.64 Loading plugin: done.
% 0.39/0.64 % % ------ Current options:
% 0.39/0.64
% 0.39/0.64 % ------ Input Options
% 0.39/0.64
% 0.39/0.64 % --out_options all
% 0.39/0.64 % --tptp_safe_out true
% 0.39/0.64 % --problem_path ""
% 0.39/0.64 % --include_path ""
% 0.39/0.64 % --clausifier .//eprover
% 0.39/0.64 % --clausifier_options --tstp-format
% 0.39/0.64 % --stdin false
% 0.39/0.64 % --dbg_backtrace false
% 0.39/0.64 % --dbg_dump_prop_clauses false
% 0.39/0.64 % --dbg_dump_prop_clauses_file -
% 0.39/0.64 % --dbg_out_stat false
% 0.39/0.64
% 0.39/0.64 % ------ General Options
% 0.39/0.64
% 0.39/0.64 % --fof false
% 0.39/0.64 % --time_out_real 150.
% 0.39/0.64 % --time_out_prep_mult 0.2
% 0.39/0.64 % --time_out_virtual -1.
% 0.39/0.64 % --schedule none
% 0.39/0.64 % --ground_splitting input
% 0.39/0.64 % --splitting_nvd 16
% 0.39/0.64 % --non_eq_to_eq false
% 0.39/0.64 % --prep_gs_sim true
% 0.39/0.64 % --prep_unflatten false
% 0.39/0.64 % --prep_res_sim true
% 0.39/0.64 % --prep_upred true
% 0.39/0.64 % --res_sim_input true
% 0.39/0.64 % --clause_weak_htbl true
% 0.39/0.64 % --gc_record_bc_elim false
% 0.39/0.64 % --symbol_type_check false
% 0.39/0.64 % --clausify_out false
% 0.39/0.64 % --large_theory_mode false
% 0.39/0.64 % --prep_sem_filter none
% 0.39/0.64 % --prep_sem_filter_out false
% 0.39/0.64 % --preprocessed_out false
% 0.39/0.64 % --sub_typing false
% 0.39/0.64 % --brand_transform false
% 0.39/0.64 % --pure_diseq_elim true
% 0.39/0.64 % --min_unsat_core false
% 0.39/0.64 % --pred_elim true
% 0.39/0.64 % --add_important_lit false
% 0.39/0.64 % --soft_assumptions false
% 0.39/0.64 % --reset_solvers false
% 0.39/0.64 % --bc_imp_inh []
% 0.39/0.64 % --conj_cone_tolerance 1.5
% 0.39/0.64 % --prolific_symb_bound 500
% 0.39/0.64 % --lt_threshold 2000
% 0.39/0.64
% 0.39/0.64 % ------ SAT Options
% 0.39/0.64
% 0.39/0.64 % --sat_mode false
% 0.39/0.64 % --sat_fm_restart_options ""
% 0.39/0.64 % --sat_gr_def false
% 0.39/0.64 % --sat_epr_types true
% 0.39/0.64 % --sat_non_cyclic_types false
% 0.39/0.64 % --sat_finite_models false
% 0.39/0.64 % --sat_fm_lemmas false
% 0.39/0.64 % --sat_fm_prep false
% 0.39/0.64 % --sat_fm_uc_incr true
% 0.39/0.64 % --sat_out_model small
% 0.39/0.64 % --sat_out_clauses false
% 0.39/0.64
% 0.39/0.64 % ------ QBF Options
% 0.39/0.64
% 0.39/0.64 % --qbf_mode false
% 0.39/0.64 % --qbf_elim_univ true
% 0.39/0.64 % --qbf_sk_in true
% 0.39/0.64 % --qbf_pred_elim true
% 0.39/0.64 % --qbf_split 32
% 0.39/0.64
% 0.39/0.64 % ------ BMC1 Options
% 0.39/0.64
% 0.39/0.64 % --bmc1_incremental false
% 0.39/0.64 % --bmc1_axioms reachable_all
% 0.39/0.64 % --bmc1_min_bound 0
% 0.39/0.64 % --bmc1_max_bound -1
% 0.39/0.64 % --bmc1_max_bound_default -1
% 0.39/0.64 % --bmc1_symbol_reachability true
% 0.39/0.64 % --bmc1_property_lemmas false
% 0.39/0.64 % --bmc1_k_induction false
% 0.39/0.64 % --bmc1_non_equiv_states false
% 0.39/0.64 % --bmc1_deadlock false
% 0.39/0.64 % --bmc1_ucm false
% 0.39/0.64 % --bmc1_add_unsat_core none
% 0.39/0.64 % --bmc1_unsat_core_children false
% 0.39/0.64 % --bmc1_unsat_core_extrapolate_axioms false
% 0.39/0.64 % --bmc1_out_stat full
% 0.39/0.64 % --bmc1_ground_init false
% 0.39/0.64 % --bmc1_pre_inst_next_state false
% 0.39/0.64 % --bmc1_pre_inst_state false
% 0.39/0.64 % --bmc1_pre_inst_reach_state false
% 0.39/0.64 % --bmc1_out_unsat_core false
% 0.39/0.64 % --bmc1_aig_witness_out false
% 0.39/0.64 % --bmc1_verbose false
% 0.39/0.64 % --bmc1_dump_clauses_tptp false
% 0.39/0.64 % --bmc1_dump_unsat_core_tptp false
% 0.39/0.64 % --bmc1_dump_file -
% 0.39/0.64 % --bmc1_ucm_expand_uc_limit 128
% 0.46/0.64 % --bmc1_ucm_n_expand_iterations 6
% 0.46/0.64 % --bmc1_ucm_extend_mode 1
% 0.46/0.64 % --bmc1_ucm_init_mode 2
% 0.46/0.64 % --bmc1_ucm_cone_mode none
% 0.46/0.64 % --bmc1_ucm_reduced_relation_type 0
% 0.46/0.64 % --bmc1_ucm_relax_model 4
% 0.46/0.64 % --bmc1_ucm_full_tr_after_sat true
% 0.46/0.64 % --bmc1_ucm_expand_neg_assumptions false
% 0.46/0.64 % --bmc1_ucm_layered_model none
% 0.46/0.64 % --bmc1_ucm_max_lemma_size 10
% 0.46/0.64
% 0.46/0.64 % ------ AIG Options
% 0.46/0.64
% 0.46/0.64 % --aig_mode false
% 0.46/0.64
% 0.46/0.64 % ------ Instantiation Options
% 0.46/0.64
% 0.46/0.64 % --instantiation_flag true
% 0.46/0.64 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.46/0.64 % --inst_solver_per_active 750
% 0.46/0.64 % --inst_solver_calls_frac 0.5
% 0.46/0.64 % --inst_passive_queue_type priority_queues
% 0.46/0.64 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.46/0.64 % --inst_passive_queues_freq [25;2]
% 0.46/0.64 % --inst_dismatching true
% 0.46/0.65 % --inst_eager_unprocessed_to_passive true
% 0.46/0.65 % --inst_prop_sim_given true
% 0.46/0.65 % --inst_prop_sim_new false
% 0.46/0.65 % --inst_orphan_elimination true
% 0.46/0.65 % --inst_learning_loop_flag true
% 0.46/0.65 % --inst_learning_start 3000
% 0.46/0.65 % --inst_learning_factor 2
% 0.46/0.65 % --inst_start_prop_sim_after_learn 3
% 0.46/0.65 % --inst_sel_renew solver
% 0.46/0.65 % --inst_lit_activity_flag true
% 0.46/0.65 % --inst_out_proof true
% 0.46/0.65
% 0.46/0.65 % ------ Resolution Options
% 0.46/0.65
% 0.46/0.65 % --resolution_flag true
% 0.46/0.65 % --res_lit_sel kbo_max
% 0.46/0.65 % --res_to_prop_solver none
% 0.46/0.65 % --res_prop_simpl_new false
% 0.46/0.65 % --res_prop_simpl_given false
% 0.46/0.65 % --res_passive_queue_type priority_queues
% 0.46/0.65 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.46/0.65 % --res_passive_queues_freq [15;5]
% 0.46/0.65 % --res_forward_subs full
% 0.46/0.65 % --res_backward_subs full
% 0.46/0.65 % --res_forward_subs_resolution true
% 0.46/0.65 % --res_backward_subs_resolution true
% 0.46/0.65 % --res_orphan_elimination false
% 0.46/0.65 % --res_time_limit 1000.
% 0.46/0.65 % --res_out_proof true
% 0.46/0.65 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_aa5f4e.s
% 0.46/0.65 % --modulo true
% 0.46/0.65
% 0.46/0.65 % ------ Combination Options
% 0.46/0.65
% 0.46/0.65 % --comb_res_mult 1000
% 0.46/0.65 % --comb_inst_mult 300
% 0.46/0.65 % ------
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 % ------ Proving...
% 0.46/0.65 % warning: shown sat in sat incomplete mode
% 0.46/0.65 %
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 cnf(c_75,negated_conjecture,
% 0.46/0.65 ( in(set_difference(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_10) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_134,negated_conjecture,
% 0.46/0.65 ( in(set_difference(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_75]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_152,negated_conjecture,
% 0.46/0.65 ( in(set_difference(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_134]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_157,negated_conjecture,
% 0.46/0.65 ( in(set_difference(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_152]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_162,negated_conjecture,
% 0.46/0.65 ( in(set_difference(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_157]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_389,plain,
% 0.46/0.65 ( in(set_difference(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_162]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_63,plain,
% 0.46/0.65 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_148_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_365,plain,
% 0.46/0.65 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_63]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_439,plain,
% 0.46/0.65 ( ~ in(sk3_esk1_0,set_difference(X0,X1))
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(resolution,[status(thm)],[c_389,c_365]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_440,plain,
% 0.46/0.65 ( ~ in(sk3_esk1_0,set_difference(X0,X1))
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_439]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_56,plain,
% 0.46/0.65 ( element(X0,X1) | ~ in(X0,X1) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_155_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_351,plain,
% 0.46/0.65 ( element(X0,X1) | ~ in(X0,X1) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_56]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_437,plain,
% 0.46/0.65 ( element(set_difference(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(resolution,[status(thm)],[c_389,c_351]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_438,plain,
% 0.46/0.65 ( element(set_difference(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_437]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_74,negated_conjecture,
% 0.46/0.65 ( in(set_union2(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_9) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_132,negated_conjecture,
% 0.46/0.65 ( in(set_union2(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_74]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_151,negated_conjecture,
% 0.46/0.65 ( in(set_union2(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_132]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_158,negated_conjecture,
% 0.46/0.65 ( in(set_union2(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_151]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_161,negated_conjecture,
% 0.46/0.65 ( in(set_union2(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_158]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_387,plain,
% 0.46/0.65 ( in(set_union2(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_161]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_427,plain,
% 0.46/0.65 ( ~ in(sk3_esk1_0,set_union2(X0,X1))
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(resolution,[status(thm)],[c_387,c_365]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_428,plain,
% 0.46/0.65 ( ~ in(sk3_esk1_0,set_union2(X0,X1))
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_427]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_425,plain,
% 0.46/0.65 ( element(set_union2(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(resolution,[status(thm)],[c_387,c_351]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_426,plain,
% 0.46/0.65 ( element(set_union2(X0,X1),sk3_esk1_0)
% 0.46/0.65 | ~ in(X0,sk3_esk1_0)
% 0.46/0.65 | ~ in(X1,sk3_esk1_0)
% 0.46/0.65 | preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_425]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_77,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk3_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_12) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_138,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk3_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_77]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_154,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk3_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_138]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_155,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk3_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_154]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_164,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk3_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_155]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_393,plain,
% 0.46/0.65 ( in(sk3_esk3_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_164]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_409,plain,
% 0.46/0.65 ( ~ in(sk3_esk1_0,sk3_esk3_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(resolution,[status(thm)],[c_393,c_365]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_410,plain,
% 0.46/0.65 ( ~ in(sk3_esk1_0,sk3_esk3_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_409]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_407,plain,
% 0.46/0.65 ( element(sk3_esk3_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(resolution,[status(thm)],[c_393,c_351]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_408,plain,
% 0.46/0.65 ( element(sk3_esk3_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_407]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_76,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk2_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_11) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_136,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk2_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_76]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_153,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk2_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_136]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_156,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk2_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_153]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_163,negated_conjecture,
% 0.46/0.65 ( in(sk3_esk2_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_156]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_391,plain,
% 0.46/0.65 ( in(sk3_esk2_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_163]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_401,plain,
% 0.46/0.65 ( ~ in(sk3_esk1_0,sk3_esk2_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(resolution,[status(thm)],[c_391,c_365]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_402,plain,
% 0.46/0.65 ( ~ in(sk3_esk1_0,sk3_esk2_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_401]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_399,plain,
% 0.46/0.65 ( element(sk3_esk2_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(resolution,[status(thm)],[c_391,c_351]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_400,plain,
% 0.46/0.65 ( element(sk3_esk2_0,sk3_esk1_0) | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_399]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_70,plain,
% 0.46/0.65 ( ~ in(X0,X1)
% 0.46/0.65 | ~ in(X2,X1)
% 0.46/0.65 | in(set_difference(X0,X2),X1)
% 0.46/0.65 | ~ diff_closed(X1) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_141_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_379,plain,
% 0.46/0.65 ( ~ in(X0,X1)
% 0.46/0.65 | ~ in(X2,X1)
% 0.46/0.65 | in(set_difference(X0,X2),X1)
% 0.46/0.65 | ~ diff_closed(X1) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_70]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_380,plain,
% 0.46/0.65 ( in(set_difference(X0,X1),X2)
% 0.46/0.65 | ~ in(X0,X2)
% 0.46/0.65 | ~ in(X1,X2)
% 0.46/0.65 | ~ diff_closed(X2) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_379]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_69,plain,
% 0.46/0.65 ( ~ in(X0,X1)
% 0.46/0.65 | ~ in(X2,X1)
% 0.46/0.65 | in(set_union2(X0,X2),X1)
% 0.46/0.65 | ~ cup_closed(X1) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_142_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_377,plain,
% 0.46/0.65 ( ~ in(X0,X1)
% 0.46/0.65 | ~ in(X2,X1)
% 0.46/0.65 | in(set_union2(X0,X2),X1)
% 0.46/0.65 | ~ cup_closed(X1) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_69]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_378,plain,
% 0.46/0.65 ( in(set_union2(X0,X1),X2)
% 0.46/0.65 | ~ in(X0,X2)
% 0.46/0.65 | ~ in(X1,X2)
% 0.46/0.65 | ~ cup_closed(X2) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_377]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_68,plain,
% 0.46/0.65 ( ~ in(X0,X1) | ~ element(X1,powerset(X2)) | element(X0,X2) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_143_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_375,plain,
% 0.46/0.65 ( ~ in(X0,X1) | ~ element(X1,powerset(X2)) | element(X0,X2) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_68]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_376,plain,
% 0.46/0.65 ( ~ element(X0,powerset(X1)) | element(X2,X1) | ~ in(X2,X0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_375]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_64,plain,
% 0.46/0.65 ( ~ subset(X0,X1) | element(X0,powerset(X1)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_147_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_367,plain,
% 0.46/0.65 ( ~ subset(X0,X1) | element(X0,powerset(X1)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_64]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_368,plain,
% 0.46/0.65 ( element(X0,powerset(X1)) | ~ subset(X0,X1) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_367]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_61,plain,
% 0.46/0.65 ( empty(X0) | in(X1,X0) | ~ element(X1,X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_150_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_361,plain,
% 0.46/0.65 ( empty(X0) | in(X1,X0) | ~ element(X1,X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_61]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_362,plain,
% 0.46/0.65 ( empty(X0) | ~ element(X1,X0) | in(X1,X0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_361]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_60,plain,
% 0.46/0.65 ( element(sk1_esk7_1(X0),powerset(X0)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_151_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_359,plain,
% 0.46/0.65 ( element(sk1_esk7_1(X0),powerset(X0)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_60]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_360,plain,
% 0.46/0.65 ( empty(X0) | element(sk1_esk7_1(X0),powerset(X0)) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_359]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_59,plain,
% 0.46/0.65 ( element(sk1_esk6_1(X0),powerset(X0)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_152_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_357,plain,
% 0.46/0.65 ( element(sk1_esk6_1(X0),powerset(X0)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_59]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_358,plain,
% 0.46/0.65 ( empty(X0) | element(sk1_esk6_1(X0),powerset(X0)) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_357]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_58,plain,
% 0.46/0.65 ( element(sk1_esk5_1(X0),powerset(X0)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_153_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_355,plain,
% 0.46/0.65 ( element(sk1_esk5_1(X0),powerset(X0)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_58]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_356,plain,
% 0.46/0.65 ( empty(X0) | element(sk1_esk5_1(X0),powerset(X0)) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_355]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_57,plain,
% 0.46/0.65 ( subset(X0,X1) | ~ element(X0,powerset(X1)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_154_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_353,plain,
% 0.46/0.65 ( subset(X0,X1) | ~ element(X0,powerset(X1)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_57]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_354,plain,
% 0.46/0.65 ( ~ element(X0,powerset(X1)) | subset(X0,X1) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_353]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_55,plain,
% 0.46/0.65 ( ~ finite(X0) | ~ finite(X1) | finite(set_union2(X0,X1)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_156_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_349,plain,
% 0.46/0.65 ( ~ finite(X0) | ~ finite(X1) | finite(set_union2(X0,X1)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_55]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_350,plain,
% 0.46/0.65 ( finite(set_union2(X0,X1)) | ~ finite(X0) | ~ finite(X1) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_349]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_45,plain,
% 0.46/0.65 ( finite(sk1_esk7_1(X0)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_166_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_329,plain,
% 0.46/0.65 ( finite(sk1_esk7_1(X0)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_45]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_330,plain,
% 0.46/0.65 ( empty(X0) | finite(sk1_esk7_1(X0)) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_329]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_44,plain,
% 0.46/0.65 ( finite(sk1_esk6_1(X0)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_167_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_327,plain,
% 0.46/0.65 ( finite(sk1_esk6_1(X0)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_44]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_328,plain,
% 0.46/0.65 ( empty(X0) | finite(sk1_esk6_1(X0)) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_327]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_39,plain,
% 0.46/0.65 ( finite(X0) | ~ empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_173_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_317,plain,
% 0.46/0.65 ( finite(X0) | ~ empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_39]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_318,plain,
% 0.46/0.65 ( ~ empty(X0) | finite(X0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_317]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_38,plain,
% 0.46/0.65 ( X0 = empty_set | ~ empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_174_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_315,plain,
% 0.46/0.65 ( X0 = empty_set | ~ empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_38]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_316,plain,
% 0.46/0.65 ( ~ empty(X0) | X0 = empty_set ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_315]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_7,plain,
% 0.46/0.65 ( X0 = X1 | ~ empty(X1) | ~ empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_60_2) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_257,plain,
% 0.46/0.65 ( X0 = X1 | ~ empty(X1) | ~ empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_7]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_258,plain,
% 0.46/0.65 ( ~ empty(X0) | ~ empty(X1) | X1 = X0 ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_257]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_73,negated_conjecture,
% 0.46/0.65 ( ~ in(set_union2(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ in(set_difference(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_8) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_130,negated_conjecture,
% 0.46/0.65 ( ~ in(set_union2(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ in(set_difference(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_73]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_150,negated_conjecture,
% 0.46/0.65 ( ~ in(set_union2(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ in(set_difference(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_130]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_159,negated_conjecture,
% 0.46/0.65 ( ~ in(set_union2(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ in(set_difference(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_150]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_160,negated_conjecture,
% 0.46/0.65 ( ~ in(set_union2(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ in(set_difference(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_159]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_385,negated_conjecture,
% 0.46/0.65 ( ~ in(set_union2(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ in(set_difference(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.46/0.65 | ~ preboolean(sk3_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_160]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_72,plain,
% 0.46/0.65 ( ~ in(set_difference(sk1_esk3_1(X0),sk1_esk4_1(X0)),X0)
% 0.46/0.65 | diff_closed(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_139_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_383,plain,
% 0.46/0.65 ( ~ in(set_difference(sk1_esk3_1(X0),sk1_esk4_1(X0)),X0)
% 0.46/0.65 | diff_closed(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_72]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_71,plain,
% 0.46/0.65 ( ~ in(set_union2(sk1_esk1_1(X0),sk1_esk2_1(X0)),X0) | cup_closed(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_140_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_381,plain,
% 0.46/0.65 ( ~ in(set_union2(sk1_esk1_1(X0),sk1_esk2_1(X0)),X0) | cup_closed(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_71]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_67,plain,
% 0.46/0.65 ( ~ empty(set_union2(X0,X1)) | empty(X1) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_144_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_373,plain,
% 0.46/0.65 ( ~ empty(set_union2(X0,X1)) | empty(X1) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_67]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_66,plain,
% 0.46/0.65 ( ~ empty(set_union2(X0,X1)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_145_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_371,plain,
% 0.46/0.65 ( ~ empty(set_union2(X0,X1)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_66]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_65,plain,
% 0.46/0.65 ( ~ element(X0,powerset(X1)) | finite(X0) | ~ finite(X1) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_146_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_369,plain,
% 0.46/0.65 ( ~ element(X0,powerset(X1)) | finite(X0) | ~ finite(X1) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_65]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_62,plain,
% 0.46/0.65 ( finite(set_difference(X0,X1)) | ~ finite(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_149_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_363,plain,
% 0.46/0.65 ( finite(set_difference(X0,X1)) | ~ finite(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_62]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_54,plain,
% 0.46/0.65 ( in(sk1_esk3_1(X0),X0) | diff_closed(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_157_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_347,plain,
% 0.46/0.65 ( in(sk1_esk3_1(X0),X0) | diff_closed(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_54]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_53,plain,
% 0.46/0.65 ( in(sk1_esk4_1(X0),X0) | diff_closed(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_158_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_345,plain,
% 0.46/0.65 ( in(sk1_esk4_1(X0),X0) | diff_closed(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_53]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_52,plain,
% 0.46/0.65 ( in(sk1_esk1_1(X0),X0) | cup_closed(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_159_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_343,plain,
% 0.46/0.65 ( in(sk1_esk1_1(X0),X0) | cup_closed(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_52]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_51,plain,
% 0.46/0.65 ( in(sk1_esk2_1(X0),X0) | cup_closed(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_160_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_341,plain,
% 0.46/0.65 ( in(sk1_esk2_1(X0),X0) | cup_closed(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_51]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_50,plain,
% 0.46/0.65 ( ~ empty(sk1_esk7_1(X0)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_161_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_339,plain,
% 0.46/0.65 ( ~ empty(sk1_esk7_1(X0)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_50]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_49,plain,
% 0.46/0.65 ( ~ empty(sk1_esk6_1(X0)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_162_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_337,plain,
% 0.46/0.65 ( ~ empty(sk1_esk6_1(X0)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_49]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_48,plain,
% 0.46/0.65 ( ~ empty(sk1_esk5_1(X0)) | empty(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_163_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_335,plain,
% 0.46/0.65 ( ~ empty(sk1_esk5_1(X0)) | empty(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_48]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_46,plain,
% 0.46/0.65 ( ~ cup_closed(X0) | ~ diff_closed(X0) | preboolean(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_165_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_331,plain,
% 0.46/0.65 ( ~ cup_closed(X0) | ~ diff_closed(X0) | preboolean(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_46]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_41,plain,
% 0.46/0.65 ( cup_closed(X0) | ~ preboolean(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_171_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_321,plain,
% 0.46/0.65 ( cup_closed(X0) | ~ preboolean(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_41]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_40,plain,
% 0.46/0.65 ( diff_closed(X0) | ~ preboolean(X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_172_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_319,plain,
% 0.46/0.65 ( diff_closed(X0) | ~ preboolean(X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_40]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_37,plain,
% 0.46/0.65 ( set_union2(X0,X1) = set_union2(X1,X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_168_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_313,plain,
% 0.46/0.65 ( set_union2(X0,X1) = set_union2(X1,X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_37]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_33,plain,
% 0.46/0.65 ( subset(X0,X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_178_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_308,plain,( subset(X0,X0) ),inference(copy,[status(esa)],[c_33]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_31,plain,
% 0.46/0.65 ( ~ empty(powerset(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_180_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_305,plain,
% 0.46/0.65 ( ~ empty(powerset(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_31]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_30,plain,
% 0.46/0.65 ( empty(empty_set) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_181_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_303,plain,( empty(empty_set) ),inference(copy,[status(esa)],[c_30]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_29,plain,
% 0.46/0.65 ( empty(sk2_esk4_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_79_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_301,plain,( empty(sk2_esk4_0) ),inference(copy,[status(esa)],[c_29]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_28,plain,
% 0.46/0.65 ( preboolean(sk2_esk5_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_78_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_299,plain,
% 0.46/0.65 ( preboolean(sk2_esk5_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_28]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_27,plain,
% 0.46/0.65 ( diff_closed(sk2_esk5_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_77_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_297,plain,
% 0.46/0.65 ( diff_closed(sk2_esk5_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_27]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_26,plain,
% 0.46/0.65 ( cap_closed(sk2_esk5_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_76_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_295,plain,
% 0.46/0.65 ( cap_closed(sk2_esk5_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_26]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_25,plain,
% 0.46/0.65 ( cup_closed(sk2_esk5_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_75_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_293,plain,
% 0.46/0.65 ( cup_closed(sk2_esk5_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_25]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_24,plain,
% 0.46/0.65 ( finite(sk2_esk6_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_74_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_291,plain,
% 0.46/0.65 ( finite(sk2_esk6_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_24]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_23,plain,
% 0.46/0.65 ( empty(sk2_esk2_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_70_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_289,plain,
% 0.46/0.65 ( empty(sk2_esk2_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_23]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_22,plain,
% 0.46/0.65 ( finite(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_69_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_287,plain,
% 0.46/0.65 ( finite(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_22]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_21,plain,
% 0.46/0.65 ( natural(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_68_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_285,plain,
% 0.46/0.65 ( natural(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_21]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_20,plain,
% 0.46/0.65 ( ordinal(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_67_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_283,plain,
% 0.46/0.65 ( ordinal(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_20]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_19,plain,
% 0.46/0.65 ( epsilon_connected(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_66_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_281,plain,
% 0.46/0.65 ( epsilon_connected(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_19]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_18,plain,
% 0.46/0.65 ( epsilon_transitive(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_65_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_279,plain,
% 0.46/0.65 ( epsilon_transitive(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_18]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_17,plain,
% 0.46/0.65 ( one_to_one(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_64_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_277,plain,
% 0.46/0.65 ( one_to_one(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_17]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_16,plain,
% 0.46/0.65 ( function(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_63_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_275,plain,
% 0.46/0.65 ( function(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_16]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_15,plain,
% 0.46/0.65 ( relation(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_62_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_273,plain,
% 0.46/0.65 ( relation(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_15]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_14,plain,
% 0.46/0.65 ( empty(sk2_esk3_1(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_61_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_271,plain,
% 0.46/0.65 ( empty(sk2_esk3_1(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_14]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_13,plain,
% 0.46/0.65 ( element(sk2_esk7_1(X0),X0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_59_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_269,plain,
% 0.46/0.65 ( element(sk2_esk7_1(X0),X0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_13]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_12,plain,
% 0.46/0.65 ( element(sk2_esk2_1(X0),powerset(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_58_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_267,plain,
% 0.46/0.65 ( element(sk2_esk2_1(X0),powerset(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_12]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_11,plain,
% 0.46/0.65 ( element(sk2_esk3_1(X0),powerset(X0)) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_57_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_265,plain,
% 0.46/0.65 ( element(sk2_esk3_1(X0),powerset(X0)) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_11]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_10,plain,
% 0.46/0.65 ( ~ empty(sk2_esk1_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_73_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_263,plain,
% 0.46/0.65 ( ~ empty(sk2_esk1_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_10]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_9,plain,
% 0.46/0.65 ( ~ empty(sk2_esk5_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_72_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_261,plain,
% 0.46/0.65 ( ~ empty(sk2_esk5_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_9]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_8,plain,
% 0.46/0.65 ( ~ empty(sk2_esk6_0) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_71_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_259,plain,
% 0.46/0.65 ( ~ empty(sk2_esk6_0) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_8]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_5,plain,
% 0.46/0.65 ( ~ empty(X0) | ~ empty(X1) | X0 = X1 ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_60_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_253,plain,
% 0.46/0.65 ( ~ empty(X0) | ~ empty(X1) | X0 = X1 ),
% 0.46/0.65 inference(copy,[status(esa)],[c_5]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_3,plain,
% 0.46/0.65 ( ~ in(X0,X1) | ~ empty(X1) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_56_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_249,plain,
% 0.46/0.65 ( ~ in(X0,X1) | ~ empty(X1) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_3]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_250,plain,
% 0.46/0.65 ( ~ empty(X0) | ~ in(X1,X0) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_249]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_0,plain,
% 0.46/0.65 ( ~ in(X0,X1) | ~ element(X1,powerset(X2)) | ~ empty(X2) ),
% 0.46/0.65 file('/export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p', c_0_55_0) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_243,plain,
% 0.46/0.65 ( ~ in(X0,X1) | ~ element(X1,powerset(X2)) | ~ empty(X2) ),
% 0.46/0.65 inference(copy,[status(esa)],[c_0]) ).
% 0.46/0.65
% 0.46/0.65 cnf(c_244,plain,
% 0.46/0.65 ( ~ empty(X0) | ~ element(X1,powerset(X0)) | ~ in(X2,X1) ),
% 0.46/0.65 inference(rewriting,[status(thm)],[c_243]) ).
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 % ------ Statistics
% 0.46/0.65
% 0.46/0.65 % ------ General
% 0.46/0.65
% 0.46/0.65 % num_of_input_clauses: 78
% 0.46/0.65 % num_of_input_neg_conjectures: 5
% 0.46/0.65 % num_of_splits: 0
% 0.46/0.65 % num_of_split_atoms: 0
% 0.46/0.65 % num_of_sem_filtered_clauses: 0
% 0.46/0.65 % num_of_subtypes: 0
% 0.46/0.65 % monotx_restored_types: 0
% 0.46/0.65 % sat_num_of_epr_types: 0
% 0.46/0.65 % sat_num_of_non_cyclic_types: 0
% 0.46/0.65 % sat_guarded_non_collapsed_types: 0
% 0.46/0.65 % is_epr: 0
% 0.46/0.65 % is_horn: 0
% 0.46/0.65 % has_eq: 1
% 0.46/0.65 % num_pure_diseq_elim: 0
% 0.46/0.65 % simp_replaced_by: 0
% 0.46/0.65 % res_preprocessed: 10
% 0.46/0.65 % prep_upred: 0
% 0.46/0.65 % prep_unflattend: 0
% 0.46/0.65 % pred_elim_cands: 0
% 0.46/0.65 % pred_elim: 0
% 0.46/0.65 % pred_elim_cl: 0
% 0.46/0.65 % pred_elim_cycles: 0
% 0.46/0.65 % forced_gc_time: 0
% 0.46/0.65 % gc_basic_clause_elim: 0
% 0.46/0.65 % parsing_time: 0.001
% 0.46/0.65 % sem_filter_time: 0.
% 0.46/0.65 % pred_elim_time: 0.
% 0.46/0.65 % out_proof_time: 0.
% 0.46/0.65 % monotx_time: 0.
% 0.46/0.65 % subtype_inf_time: 0.
% 0.46/0.65 % unif_index_cands_time: 0.
% 0.46/0.65 % unif_index_add_time: 0.
% 0.46/0.65 % total_time: 0.231
% 0.46/0.65 % num_of_symbols: 62
% 0.46/0.65 % num_of_terms: 275
% 0.46/0.65
% 0.46/0.65 % ------ Propositional Solver
% 0.46/0.65
% 0.46/0.65 % prop_solver_calls: 1
% 0.46/0.65 % prop_fast_solver_calls: 45
% 0.46/0.65 % prop_num_of_clauses: 124
% 0.46/0.65 % prop_preprocess_simplified: 218
% 0.46/0.65 % prop_fo_subsumed: 0
% 0.46/0.65 % prop_solver_time: 0.
% 0.46/0.65 % prop_fast_solver_time: 0.
% 0.46/0.65 % prop_unsat_core_time: 0.
% 0.46/0.65
% 0.46/0.65 % ------ QBF
% 0.46/0.65
% 0.46/0.65 % qbf_q_res: 0
% 0.46/0.65 % qbf_num_tautologies: 0
% 0.46/0.65 % qbf_prep_cycles: 0
% 0.46/0.65
% 0.46/0.65 % ------ BMC1
% 0.46/0.65
% 0.46/0.65 % bmc1_current_bound: -1
% 0.46/0.65 % bmc1_last_solved_bound: -1
% 0.46/0.65 % bmc1_unsat_core_size: -1
% 0.46/0.65 % bmc1_unsat_core_parents_size: -1
% 0.46/0.65 % bmc1_merge_next_fun: 0
% 0.46/0.65 % bmc1_unsat_core_clauses_time: 0.
% 0.46/0.65
% 0.46/0.65 % ------ Instantiation
% 0.46/0.65
% 0.46/0.65 % inst_num_of_clauses: 75
% 0.46/0.65 % inst_num_in_passive: 0
% 0.46/0.65 % inst_num_in_active: 0
% 0.46/0.65 % inst_num_in_unprocessed: 78
% 0.46/0.65 % inst_num_of_loops: 0
% 0.46/0.65 % inst_num_of_learning_restarts: 0
% 0.46/0.65 % inst_num_moves_active_passive: 0
% 0.46/0.65 % inst_lit_activity: 0
% 0.46/0.65 % inst_lit_activity_moves: 0
% 0.46/0.65 % inst_num_tautologies: 0
% 0.46/0.65 % inst_num_prop_implied: 0
% 0.46/0.65 % inst_num_existing_simplified: 0
% 0.46/0.65 % inst_num_eq_res_simplified: 0
% 0.46/0.65 % inst_num_child_elim: 0
% 0.46/0.65 % inst_num_of_dismatching_blockings: 0
% 0.46/0.65 % inst_num_of_non_proper_insts: 0
% 0.46/0.65 % inst_num_of_duplicates: 0
% 0.46/0.65 % inst_inst_num_from_inst_to_res: 0
% 0.46/0.65 % inst_dismatching_checking_time: 0.
% 0.46/0.65
% 0.46/0.65 % ------ Resolution
% 0.46/0.65
% 0.46/0.65 % res_num_of_clauses: 98
% 0.46/0.65 % res_num_in_passive: 0
% 0.46/0.65 % res_num_in_active: 75
% 0.46/0.65 % res_num_of_loops: 14
% 0.46/0.65 % res_forward_subset_subsumed: 11
% 0.46/0.65 % res_backward_subset_subsumed: 0
% 0.46/0.65 % res_forward_subsumed: 0
% 0.46/0.65 % res_backward_subsumed: 0
% 0.46/0.65 % res_forward_subsumption_resolution: 0
% 0.46/0.65 % res_backward_subsumption_resolution: 0
% 0.46/0.65 % res_clause_to_clause_subsumption: 40
% 0.46/0.65 % res_orphan_elimination: 0
% 0.46/0.65 % res_tautology_del: 1
% 0.46/0.65 % res_num_eq_res_simplified: 0
% 0.46/0.65 % res_num_sel_changes: 0
% 0.46/0.65 % res_moves_from_active_to_pass: 0
% 0.46/0.65
% 0.46/0.65 % Status Unknown
% 0.46/0.70 % Orienting using strategy ClausalAll
% 0.46/0.70 % FOF problem with conjecture
% 0.46/0.70 % 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/sandbox/tmp/iprover_proof_aa5f4e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e9f32e.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_981145 | grep -v "SZS"
% 0.55/0.72
% 0.55/0.72 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.55/0.72
% 0.55/0.72 %
% 0.55/0.72 % ------ iProver source info
% 0.55/0.72
% 0.55/0.72 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.55/0.72 % git: non_committed_changes: true
% 0.55/0.72 % git: last_make_outside_of_git: true
% 0.55/0.72
% 0.55/0.72 %
% 0.55/0.72 % ------ Input Options
% 0.55/0.72
% 0.55/0.72 % --out_options all
% 0.55/0.72 % --tptp_safe_out true
% 0.55/0.72 % --problem_path ""
% 0.55/0.72 % --include_path ""
% 0.55/0.72 % --clausifier .//eprover
% 0.55/0.72 % --clausifier_options --tstp-format
% 0.55/0.72 % --stdin false
% 0.55/0.72 % --dbg_backtrace false
% 0.55/0.72 % --dbg_dump_prop_clauses false
% 0.55/0.72 % --dbg_dump_prop_clauses_file -
% 0.55/0.72 % --dbg_out_stat false
% 0.55/0.72
% 0.55/0.72 % ------ General Options
% 0.55/0.72
% 0.55/0.72 % --fof false
% 0.55/0.72 % --time_out_real 150.
% 0.55/0.72 % --time_out_prep_mult 0.2
% 0.55/0.72 % --time_out_virtual -1.
% 0.55/0.72 % --schedule none
% 0.55/0.72 % --ground_splitting input
% 0.55/0.72 % --splitting_nvd 16
% 0.55/0.72 % --non_eq_to_eq false
% 0.55/0.72 % --prep_gs_sim true
% 0.55/0.72 % --prep_unflatten false
% 0.55/0.72 % --prep_res_sim true
% 0.55/0.72 % --prep_upred true
% 0.55/0.72 % --res_sim_input true
% 0.55/0.72 % --clause_weak_htbl true
% 0.55/0.72 % --gc_record_bc_elim false
% 0.55/0.72 % --symbol_type_check false
% 0.55/0.72 % --clausify_out false
% 0.55/0.72 % --large_theory_mode false
% 0.55/0.72 % --prep_sem_filter none
% 0.55/0.72 % --prep_sem_filter_out false
% 0.55/0.72 % --preprocessed_out false
% 0.55/0.72 % --sub_typing false
% 0.55/0.72 % --brand_transform false
% 0.55/0.72 % --pure_diseq_elim true
% 0.55/0.72 % --min_unsat_core false
% 0.55/0.72 % --pred_elim true
% 0.55/0.72 % --add_important_lit false
% 0.55/0.72 % --soft_assumptions false
% 0.55/0.72 % --reset_solvers false
% 0.55/0.72 % --bc_imp_inh []
% 0.55/0.72 % --conj_cone_tolerance 1.5
% 0.55/0.72 % --prolific_symb_bound 500
% 0.55/0.72 % --lt_threshold 2000
% 0.55/0.72
% 0.55/0.72 % ------ SAT Options
% 0.55/0.72
% 0.55/0.72 % --sat_mode false
% 0.55/0.72 % --sat_fm_restart_options ""
% 0.55/0.72 % --sat_gr_def false
% 0.55/0.72 % --sat_epr_types true
% 0.55/0.72 % --sat_non_cyclic_types false
% 0.55/0.72 % --sat_finite_models false
% 0.55/0.72 % --sat_fm_lemmas false
% 0.55/0.72 % --sat_fm_prep false
% 0.55/0.72 % --sat_fm_uc_incr true
% 0.55/0.72 % --sat_out_model small
% 0.55/0.72 % --sat_out_clauses false
% 0.55/0.72
% 0.55/0.72 % ------ QBF Options
% 0.55/0.72
% 0.55/0.72 % --qbf_mode false
% 0.55/0.72 % --qbf_elim_univ true
% 0.55/0.72 % --qbf_sk_in true
% 0.55/0.72 % --qbf_pred_elim true
% 0.55/0.72 % --qbf_split 32
% 0.55/0.72
% 0.55/0.72 % ------ BMC1 Options
% 0.55/0.72
% 0.55/0.72 % --bmc1_incremental false
% 0.55/0.72 % --bmc1_axioms reachable_all
% 0.55/0.72 % --bmc1_min_bound 0
% 0.55/0.72 % --bmc1_max_bound -1
% 0.55/0.72 % --bmc1_max_bound_default -1
% 0.55/0.72 % --bmc1_symbol_reachability true
% 0.55/0.72 % --bmc1_property_lemmas false
% 0.55/0.72 % --bmc1_k_induction false
% 0.55/0.72 % --bmc1_non_equiv_states false
% 0.55/0.72 % --bmc1_deadlock false
% 0.55/0.72 % --bmc1_ucm false
% 0.55/0.72 % --bmc1_add_unsat_core none
% 0.55/0.72 % --bmc1_unsat_core_children false
% 0.55/0.72 % --bmc1_unsat_core_extrapolate_axioms false
% 0.55/0.72 % --bmc1_out_stat full
% 0.55/0.72 % --bmc1_ground_init false
% 0.55/0.72 % --bmc1_pre_inst_next_state false
% 0.55/0.72 % --bmc1_pre_inst_state false
% 0.55/0.72 % --bmc1_pre_inst_reach_state false
% 0.55/0.72 % --bmc1_out_unsat_core false
% 0.55/0.72 % --bmc1_aig_witness_out false
% 0.55/0.72 % --bmc1_verbose false
% 0.55/0.72 % --bmc1_dump_clauses_tptp false
% 0.55/0.93 % --bmc1_dump_unsat_core_tptp false
% 0.55/0.93 % --bmc1_dump_file -
% 0.55/0.93 % --bmc1_ucm_expand_uc_limit 128
% 0.55/0.93 % --bmc1_ucm_n_expand_iterations 6
% 0.55/0.93 % --bmc1_ucm_extend_mode 1
% 0.55/0.93 % --bmc1_ucm_init_mode 2
% 0.55/0.93 % --bmc1_ucm_cone_mode none
% 0.55/0.93 % --bmc1_ucm_reduced_relation_type 0
% 0.55/0.93 % --bmc1_ucm_relax_model 4
% 0.55/0.93 % --bmc1_ucm_full_tr_after_sat true
% 0.55/0.93 % --bmc1_ucm_expand_neg_assumptions false
% 0.55/0.93 % --bmc1_ucm_layered_model none
% 0.55/0.93 % --bmc1_ucm_max_lemma_size 10
% 0.55/0.93
% 0.55/0.93 % ------ AIG Options
% 0.55/0.93
% 0.55/0.93 % --aig_mode false
% 0.55/0.93
% 0.55/0.93 % ------ Instantiation Options
% 0.55/0.93
% 0.55/0.93 % --instantiation_flag true
% 0.55/0.93 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.55/0.93 % --inst_solver_per_active 750
% 0.55/0.93 % --inst_solver_calls_frac 0.5
% 0.55/0.93 % --inst_passive_queue_type priority_queues
% 0.55/0.93 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.55/0.93 % --inst_passive_queues_freq [25;2]
% 0.55/0.93 % --inst_dismatching true
% 0.55/0.93 % --inst_eager_unprocessed_to_passive true
% 0.55/0.93 % --inst_prop_sim_given true
% 0.55/0.93 % --inst_prop_sim_new false
% 0.55/0.93 % --inst_orphan_elimination true
% 0.55/0.93 % --inst_learning_loop_flag true
% 0.55/0.93 % --inst_learning_start 3000
% 0.55/0.93 % --inst_learning_factor 2
% 0.55/0.93 % --inst_start_prop_sim_after_learn 3
% 0.55/0.93 % --inst_sel_renew solver
% 0.55/0.93 % --inst_lit_activity_flag true
% 0.55/0.93 % --inst_out_proof true
% 0.55/0.93
% 0.55/0.93 % ------ Resolution Options
% 0.55/0.93
% 0.55/0.93 % --resolution_flag true
% 0.55/0.93 % --res_lit_sel kbo_max
% 0.55/0.93 % --res_to_prop_solver none
% 0.55/0.93 % --res_prop_simpl_new false
% 0.55/0.93 % --res_prop_simpl_given false
% 0.55/0.93 % --res_passive_queue_type priority_queues
% 0.55/0.93 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.55/0.93 % --res_passive_queues_freq [15;5]
% 0.55/0.93 % --res_forward_subs full
% 0.55/0.93 % --res_backward_subs full
% 0.55/0.93 % --res_forward_subs_resolution true
% 0.55/0.93 % --res_backward_subs_resolution true
% 0.55/0.93 % --res_orphan_elimination false
% 0.55/0.93 % --res_time_limit 1000.
% 0.55/0.93 % --res_out_proof true
% 0.55/0.93 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_aa5f4e.s
% 0.55/0.93 % --modulo true
% 0.55/0.93
% 0.55/0.93 % ------ Combination Options
% 0.55/0.93
% 0.55/0.93 % --comb_res_mult 1000
% 0.55/0.93 % --comb_inst_mult 300
% 0.55/0.93 % ------
% 0.55/0.93
% 0.55/0.93 % ------ Parsing...% successful
% 0.55/0.93
% 0.55/0.93 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.55/0.93
% 0.55/0.93 % ------ Proving...
% 0.55/0.93 % ------ Problem Properties
% 0.55/0.93
% 0.55/0.93 %
% 0.55/0.93 % EPR false
% 0.55/0.93 % Horn false
% 0.55/0.93 % Has equality true
% 0.55/0.93
% 0.55/0.93 % % ------ Input Options Time Limit: Unbounded
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 Compiling...
% 0.55/0.93 Loading plugin: done.
% 0.55/0.93 Compiling...
% 0.55/0.93 Loading plugin: done.
% 0.55/0.93 % % ------ Current options:
% 0.55/0.93
% 0.55/0.93 % ------ Input Options
% 0.55/0.93
% 0.55/0.93 % --out_options all
% 0.55/0.93 % --tptp_safe_out true
% 0.55/0.93 % --problem_path ""
% 0.55/0.93 % --include_path ""
% 0.55/0.93 % --clausifier .//eprover
% 0.55/0.93 % --clausifier_options --tstp-format
% 0.55/0.93 % --stdin false
% 0.55/0.93 % --dbg_backtrace false
% 0.55/0.93 % --dbg_dump_prop_clauses false
% 0.55/0.93 % --dbg_dump_prop_clauses_file -
% 0.55/0.93 % --dbg_out_stat false
% 0.55/0.93
% 0.55/0.93 % ------ General Options
% 0.55/0.93
% 0.55/0.93 % --fof false
% 0.55/0.93 % --time_out_real 150.
% 0.55/0.93 % --time_out_prep_mult 0.2
% 0.55/0.93 % --time_out_virtual -1.
% 0.55/0.93 % --schedule none
% 0.55/0.93 % --ground_splitting input
% 0.55/0.93 % --splitting_nvd 16
% 0.55/0.93 % --non_eq_to_eq false
% 0.55/0.93 % --prep_gs_sim true
% 0.55/0.93 % --prep_unflatten false
% 0.55/0.93 % --prep_res_sim true
% 0.55/0.93 % --prep_upred true
% 0.55/0.93 % --res_sim_input true
% 0.55/0.93 % --clause_weak_htbl true
% 0.55/0.93 % --gc_record_bc_elim false
% 0.55/0.93 % --symbol_type_check false
% 0.55/0.93 % --clausify_out false
% 0.55/0.93 % --large_theory_mode false
% 0.55/0.93 % --prep_sem_filter none
% 0.55/0.93 % --prep_sem_filter_out false
% 0.55/0.93 % --preprocessed_out false
% 0.55/0.93 % --sub_typing false
% 0.55/0.93 % --brand_transform false
% 0.55/0.93 % --pure_diseq_elim true
% 0.55/0.93 % --min_unsat_core false
% 0.55/0.93 % --pred_elim true
% 0.55/0.93 % --add_important_lit false
% 0.55/0.93 % --soft_assumptions false
% 0.55/0.93 % --reset_solvers false
% 0.55/0.93 % --bc_imp_inh []
% 0.55/0.93 % --conj_cone_tolerance 1.5
% 0.55/0.93 % --prolific_symb_bound 500
% 0.55/0.93 % --lt_threshold 2000
% 0.55/0.93
% 0.55/0.93 % ------ SAT Options
% 0.55/0.93
% 0.55/0.93 % --sat_mode false
% 0.55/0.93 % --sat_fm_restart_options ""
% 0.55/0.93 % --sat_gr_def false
% 0.55/0.93 % --sat_epr_types true
% 0.55/0.93 % --sat_non_cyclic_types false
% 0.55/0.93 % --sat_finite_models false
% 0.55/0.93 % --sat_fm_lemmas false
% 0.55/0.93 % --sat_fm_prep false
% 0.55/0.93 % --sat_fm_uc_incr true
% 0.55/0.93 % --sat_out_model small
% 0.55/0.93 % --sat_out_clauses false
% 0.55/0.93
% 0.55/0.93 % ------ QBF Options
% 0.55/0.93
% 0.55/0.93 % --qbf_mode false
% 0.55/0.93 % --qbf_elim_univ true
% 0.55/0.93 % --qbf_sk_in true
% 0.55/0.93 % --qbf_pred_elim true
% 0.55/0.93 % --qbf_split 32
% 0.55/0.93
% 0.55/0.93 % ------ BMC1 Options
% 0.55/0.93
% 0.55/0.93 % --bmc1_incremental false
% 0.55/0.93 % --bmc1_axioms reachable_all
% 0.55/0.93 % --bmc1_min_bound 0
% 0.55/0.93 % --bmc1_max_bound -1
% 0.55/0.93 % --bmc1_max_bound_default -1
% 0.55/0.93 % --bmc1_symbol_reachability true
% 0.55/0.93 % --bmc1_property_lemmas false
% 0.55/0.93 % --bmc1_k_induction false
% 0.55/0.93 % --bmc1_non_equiv_states false
% 0.55/0.93 % --bmc1_deadlock false
% 0.55/0.93 % --bmc1_ucm false
% 0.55/0.93 % --bmc1_add_unsat_core none
% 0.55/0.93 % --bmc1_unsat_core_children false
% 0.55/0.93 % --bmc1_unsat_core_extrapolate_axioms false
% 0.55/0.93 % --bmc1_out_stat full
% 0.55/0.93 % --bmc1_ground_init false
% 0.55/0.93 % --bmc1_pre_inst_next_state false
% 0.55/0.93 % --bmc1_pre_inst_state false
% 0.55/0.93 % --bmc1_pre_inst_reach_state false
% 0.55/0.93 % --bmc1_out_unsat_core false
% 0.55/0.93 % --bmc1_aig_witness_out false
% 0.55/0.93 % --bmc1_verbose false
% 0.55/0.93 % --bmc1_dump_clauses_tptp false
% 0.55/0.93 % --bmc1_dump_unsat_core_tptp false
% 0.55/0.93 % --bmc1_dump_file -
% 0.55/0.93 % --bmc1_ucm_expand_uc_limit 128
% 0.55/0.93 % --bmc1_ucm_n_expand_iterations 6
% 0.55/0.93 % --bmc1_ucm_extend_mode 1
% 0.55/0.93 % --bmc1_ucm_init_mode 2
% 0.55/0.93 % --bmc1_ucm_cone_mode none
% 0.55/0.93 % --bmc1_ucm_reduced_relation_type 0
% 0.55/0.93 % --bmc1_ucm_relax_model 4
% 0.55/0.93 % --bmc1_ucm_full_tr_after_sat true
% 0.55/0.93 % --bmc1_ucm_expand_neg_assumptions false
% 0.55/0.93 % --bmc1_ucm_layered_model none
% 0.55/0.93 % --bmc1_ucm_max_lemma_size 10
% 0.55/0.93
% 0.55/0.93 % ------ AIG Options
% 0.55/0.93
% 0.55/0.93 % --aig_mode false
% 0.55/0.93
% 0.55/0.93 % ------ Instantiation Options
% 0.55/0.93
% 0.55/0.93 % --instantiation_flag true
% 0.55/0.93 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.55/0.93 % --inst_solver_per_active 750
% 0.55/0.93 % --inst_solver_calls_frac 0.5
% 0.55/0.93 % --inst_passive_queue_type priority_queues
% 0.55/0.93 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.55/0.93 % --inst_passive_queues_freq [25;2]
% 0.55/0.93 % --inst_dismatching true
% 0.55/0.94 % --inst_eager_unprocessed_to_passive true
% 0.55/0.94 % --inst_prop_sim_given true
% 0.55/0.94 % --inst_prop_sim_new false
% 0.55/0.94 % --inst_orphan_elimination true
% 0.55/0.94 % --inst_learning_loop_flag true
% 0.55/0.94 % --inst_learning_start 3000
% 0.55/0.94 % --inst_learning_factor 2
% 0.55/0.94 % --inst_start_prop_sim_after_learn 3
% 0.55/0.94 % --inst_sel_renew solver
% 0.55/0.94 % --inst_lit_activity_flag true
% 0.55/0.94 % --inst_out_proof true
% 0.55/0.94
% 0.55/0.94 % ------ Resolution Options
% 0.55/0.94
% 0.55/0.94 % --resolution_flag true
% 0.55/0.94 % --res_lit_sel kbo_max
% 0.55/0.94 % --res_to_prop_solver none
% 0.55/0.94 % --res_prop_simpl_new false
% 0.55/0.94 % --res_prop_simpl_given false
% 0.55/0.94 % --res_passive_queue_type priority_queues
% 0.55/0.94 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.55/0.94 % --res_passive_queues_freq [15;5]
% 0.55/0.94 % --res_forward_subs full
% 0.55/0.94 % --res_backward_subs full
% 0.55/0.94 % --res_forward_subs_resolution true
% 0.55/0.94 % --res_backward_subs_resolution true
% 0.55/0.94 % --res_orphan_elimination false
% 0.55/0.94 % --res_time_limit 1000.
% 0.55/0.94 % --res_out_proof true
% 0.55/0.94 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_aa5f4e.s
% 0.55/0.94 % --modulo true
% 0.55/0.94
% 0.55/0.94 % ------ Combination Options
% 0.55/0.94
% 0.55/0.94 % --comb_res_mult 1000
% 0.55/0.94 % --comb_inst_mult 300
% 0.55/0.94 % ------
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 % ------ Proving...
% 0.55/0.94 %
% 0.55/0.94
% 0.55/0.94
% 0.55/0.94 % Resolution empty clause
% 0.55/0.94
% 0.55/0.94 % ------ Statistics
% 0.55/0.94
% 0.55/0.94 % ------ General
% 0.55/0.94
% 0.55/0.94 % num_of_input_clauses: 123
% 0.55/0.94 % num_of_input_neg_conjectures: 5
% 0.55/0.94 % num_of_splits: 0
% 0.55/0.94 % num_of_split_atoms: 0
% 0.55/0.94 % num_of_sem_filtered_clauses: 0
% 0.55/0.94 % num_of_subtypes: 0
% 0.55/0.94 % monotx_restored_types: 0
% 0.55/0.94 % sat_num_of_epr_types: 0
% 0.55/0.94 % sat_num_of_non_cyclic_types: 0
% 0.55/0.94 % sat_guarded_non_collapsed_types: 0
% 0.55/0.94 % is_epr: 0
% 0.55/0.94 % is_horn: 0
% 0.55/0.94 % has_eq: 1
% 0.55/0.94 % num_pure_diseq_elim: 0
% 0.55/0.94 % simp_replaced_by: 0
% 0.55/0.94 % res_preprocessed: 10
% 0.55/0.94 % prep_upred: 0
% 0.55/0.94 % prep_unflattend: 0
% 0.55/0.94 % pred_elim_cands: 0
% 0.55/0.94 % pred_elim: 0
% 0.55/0.94 % pred_elim_cl: 0
% 0.55/0.94 % pred_elim_cycles: 0
% 0.55/0.94 % forced_gc_time: 0
% 0.55/0.94 % gc_basic_clause_elim: 0
% 0.55/0.94 % parsing_time: 0.003
% 0.55/0.94 % sem_filter_time: 0.
% 0.55/0.94 % pred_elim_time: 0.
% 0.55/0.94 % out_proof_time: 0.003
% 0.55/0.94 % monotx_time: 0.
% 0.55/0.94 % subtype_inf_time: 0.
% 0.55/0.94 % unif_index_cands_time: 0.
% 0.55/0.94 % unif_index_add_time: 0.
% 0.55/0.94 % total_time: 0.236
% 0.55/0.94 % num_of_symbols: 62
% 0.55/0.94 % num_of_terms: 363
% 0.55/0.94
% 0.55/0.94 % ------ Propositional Solver
% 0.55/0.94
% 0.55/0.94 % prop_solver_calls: 1
% 0.55/0.94 % prop_fast_solver_calls: 45
% 0.55/0.94 % prop_num_of_clauses: 130
% 0.55/0.94 % prop_preprocess_simplified: 392
% 0.55/0.94 % prop_fo_subsumed: 0
% 0.55/0.94 % prop_solver_time: 0.
% 0.55/0.94 % prop_fast_solver_time: 0.
% 0.55/0.94 % prop_unsat_core_time: 0.
% 0.55/0.94
% 0.55/0.94 % ------ QBF
% 0.55/0.94
% 0.55/0.94 % qbf_q_res: 0
% 0.55/0.94 % qbf_num_tautologies: 0
% 0.55/0.94 % qbf_prep_cycles: 0
% 0.55/0.94
% 0.55/0.94 % ------ BMC1
% 0.55/0.94
% 0.55/0.94 % bmc1_current_bound: -1
% 0.55/0.94 % bmc1_last_solved_bound: -1
% 0.55/0.94 % bmc1_unsat_core_size: -1
% 0.55/0.94 % bmc1_unsat_core_parents_size: -1
% 0.55/0.94 % bmc1_merge_next_fun: 0
% 0.55/0.94 % bmc1_unsat_core_clauses_time: 0.
% 0.55/0.94
% 0.55/0.94 % ------ Instantiation
% 0.55/0.94
% 0.55/0.94 % inst_num_of_clauses: 115
% 0.55/0.94 % inst_num_in_passive: 0
% 0.55/0.94 % inst_num_in_active: 0
% 0.55/0.94 % inst_num_in_unprocessed: 123
% 0.55/0.94 % inst_num_of_loops: 0
% 0.55/0.94 % inst_num_of_learning_restarts: 0
% 0.55/0.94 % inst_num_moves_active_passive: 0
% 0.55/0.94 % inst_lit_activity: 0
% 0.55/0.94 % inst_lit_activity_moves: 0
% 0.55/0.94 % inst_num_tautologies: 0
% 0.55/0.94 % inst_num_prop_implied: 0
% 0.55/0.94 % inst_num_existing_simplified: 0
% 0.55/0.94 % inst_num_eq_res_simplified: 0
% 0.55/0.94 % inst_num_child_elim: 0
% 0.55/0.94 % inst_num_of_dismatching_blockings: 0
% 0.55/0.94 % inst_num_of_non_proper_insts: 0
% 0.55/0.94 % inst_num_of_duplicates: 0
% 0.55/0.94 % inst_inst_num_from_inst_to_res: 0
% 0.55/0.94 % inst_dismatching_checking_time: 0.
% 0.55/0.94
% 0.55/0.94 % ------ Resolution
% 0.55/0.94
% 0.55/0.94 % res_num_of_clauses: 160
% 0.55/0.94 % res_num_in_passive: 27
% 0.55/0.94 % res_num_in_active: 81
% 0.55/0.94 % res_num_of_loops: 31
% 0.55/0.94 % res_forward_subset_subsumed: 76
% 0.55/0.94 % res_backward_subset_subsumed: 12
% 0.55/0.94 % res_forward_subsumed: 4
% 0.55/0.94 % res_backward_subsumed: 0
% 0.55/0.94 % res_forward_subsumption_resolution: 17
% 0.55/0.94 % res_backward_subsumption_resolution: 9
% 0.55/0.94 % res_clause_to_clause_subsumption: 72
% 0.55/0.94 % res_orphan_elimination: 0
% 0.55/0.94 % res_tautology_del: 1
% 0.55/0.94 % res_num_eq_res_simplified: 0
% 0.55/0.94 % res_num_sel_changes: 0
% 0.55/0.94 % res_moves_from_active_to_pass: 0
% 0.55/0.94
% 0.55/0.94 % Status Unsatisfiable
% 0.55/0.94 % SZS status Theorem
% 0.55/0.94 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------