%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU169+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 10:25:35 EDT 2022
% Result : Theorem 56.08s 56.28s
% Output : CNFRefutation 56.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 26
% Syntax : Number of formulae : 190 ( 64 unt; 0 def)
% Number of atoms : 430 ( 46 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 439 ( 199 ~; 193 |; 21 &)
% ( 10 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 11 con; 0-2 aty)
% Number of variables : 282 ( 12 sgn 75 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('<stdin>',d1_zfmisc_1) ).
fof(c_0_1,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('<stdin>',d3_tarski) ).
fof(c_0_2,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('<stdin>',antisymmetry_r2_hidden) ).
fof(c_0_3,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('<stdin>',d2_subset_1) ).
fof(c_0_4,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
file('<stdin>',rc1_subset_1) ).
fof(c_0_5,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('<stdin>',t7_boole) ).
fof(c_0_6,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('<stdin>',existence_m1_subset_1) ).
fof(c_0_7,axiom,
! [X1] : ~ empty(powerset(X1)),
file('<stdin>',fc1_subset_1) ).
fof(c_0_8,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('<stdin>',t8_boole) ).
fof(c_0_9,axiom,
! [X1,X2] : subset(X1,X1),
file('<stdin>',reflexivity_r1_tarski) ).
fof(c_0_10,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('<stdin>',t6_boole) ).
fof(c_0_11,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_12,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_13,axiom,
empty(empty_set),
file('<stdin>',fc1_xboole_0) ).
fof(c_0_14,axiom,
$true,
file('<stdin>',dt_m1_subset_1) ).
fof(c_0_15,axiom,
$true,
file('<stdin>',dt_k1_zfmisc_1) ).
fof(c_0_16,axiom,
$true,
file('<stdin>',dt_k1_xboole_0) ).
fof(c_0_17,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
c_0_0 ).
fof(c_0_18,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
c_0_1 ).
fof(c_0_19,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_20,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_21,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_22,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
c_0_5 ).
fof(c_0_23,axiom,
! [X1] :
? [X2] : element(X2,X1),
c_0_6 ).
fof(c_0_24,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_25,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
c_0_8 ).
fof(c_0_26,axiom,
! [X1,X2] : subset(X1,X1),
c_0_9 ).
fof(c_0_27,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
c_0_10 ).
fof(c_0_28,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_29,axiom,
? [X1] : empty(X1),
c_0_12 ).
fof(c_0_30,axiom,
empty(empty_set),
c_0_13 ).
fof(c_0_31,axiom,
$true,
c_0_14 ).
fof(c_0_32,axiom,
$true,
c_0_15 ).
fof(c_0_33,axiom,
$true,
c_0_16 ).
fof(c_0_34,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ in(X6,X5)
| subset(X6,X4)
| X5 != powerset(X4) )
& ( ~ subset(X7,X4)
| in(X7,X5)
| X5 != powerset(X4) )
& ( ~ in(esk1_2(X8,X9),X9)
| ~ subset(esk1_2(X8,X9),X8)
| X9 = powerset(X8) )
& ( in(esk1_2(X8,X9),X9)
| subset(esk1_2(X8,X9),X8)
| X9 = powerset(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])]) ).
fof(c_0_35,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk2_2(X7,X8),X7)
| subset(X7,X8) )
& ( ~ in(esk2_2(X7,X8),X8)
| subset(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])]) ).
fof(c_0_36,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
fof(c_0_37,plain,
! [X3,X4,X5,X6,X7,X8] :
( ( ~ element(X4,X3)
| in(X4,X3)
| empty(X3) )
& ( ~ in(X5,X3)
| element(X5,X3)
| empty(X3) )
& ( ~ element(X7,X6)
| empty(X7)
| ~ empty(X6) )
& ( ~ empty(X8)
| element(X8,X6)
| ~ empty(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])]) ).
fof(c_0_38,plain,
! [X3] :
( ( element(esk4_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk4_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_39,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
fof(c_0_40,plain,
! [X3] : element(esk3_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
fof(c_0_41,plain,
! [X2] : ~ empty(powerset(X2)),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_42,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_25])])])]) ).
fof(c_0_43,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_44,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])]) ).
fof(c_0_45,plain,
~ empty(esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
fof(c_0_46,plain,
empty(esk5_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_29])]) ).
fof(c_0_47,axiom,
empty(empty_set),
c_0_30 ).
fof(c_0_48,axiom,
$true,
c_0_31 ).
fof(c_0_49,axiom,
$true,
c_0_32 ).
fof(c_0_50,axiom,
$true,
c_0_33 ).
cnf(c_0_51,plain,
( X1 = powerset(X2)
| ~ subset(esk1_2(X2,X1),X2)
| ~ in(esk1_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,plain,
( X1 = powerset(X2)
| subset(esk1_2(X2,X1),X2)
| in(esk1_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_53,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_54,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_55,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_56,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_57,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_58,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_59,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_60,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_61,plain,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_62,plain,
( empty(X1)
| element(esk4_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_63,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_64,plain,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_65,plain,
( empty(X1)
| ~ empty(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_66,plain,
element(esk3_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_67,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_68,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_69,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_70,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_71,plain,
~ empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_72,plain,
empty(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_73,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_74,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_75,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_76,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_77,plain,
( X1 = powerset(X2)
| ~ subset(esk1_2(X2,X1),X2)
| ~ in(esk1_2(X2,X1),X1) ),
c_0_51,
[final] ).
cnf(c_0_78,plain,
( X1 = powerset(X2)
| subset(esk1_2(X2,X1),X2)
| in(esk1_2(X2,X1),X1) ),
c_0_52,
[final] ).
cnf(c_0_79,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
c_0_53,
[final] ).
cnf(c_0_80,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
c_0_54,
[final] ).
cnf(c_0_81,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
c_0_55,
[final] ).
cnf(c_0_82,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
c_0_56,
[final] ).
cnf(c_0_83,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
c_0_57,
[final] ).
cnf(c_0_84,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_58,
[final] ).
cnf(c_0_85,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
c_0_59,
[final] ).
cnf(c_0_86,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
c_0_60,
[final] ).
cnf(c_0_87,plain,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
c_0_61,
[final] ).
cnf(c_0_88,plain,
( empty(X1)
| element(esk4_1(X1),powerset(X1)) ),
c_0_62,
[final] ).
cnf(c_0_89,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
c_0_63,
[final] ).
cnf(c_0_90,plain,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
c_0_64,
[final] ).
cnf(c_0_91,plain,
( empty(X1)
| ~ empty(esk4_1(X1)) ),
c_0_65,
[final] ).
cnf(c_0_92,plain,
element(esk3_1(X1),X1),
c_0_66,
[final] ).
cnf(c_0_93,plain,
~ empty(powerset(X1)),
c_0_67,
[final] ).
cnf(c_0_94,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
c_0_68,
[final] ).
cnf(c_0_95,plain,
subset(X1,X1),
c_0_69,
[final] ).
cnf(c_0_96,plain,
( X1 = empty_set
| ~ empty(X1) ),
c_0_70,
[final] ).
cnf(c_0_97,plain,
~ empty(esk6_0),
c_0_71,
[final] ).
cnf(c_0_98,plain,
empty(esk5_0),
c_0_72,
[final] ).
cnf(c_0_99,plain,
empty(empty_set),
c_0_73,
[final] ).
cnf(c_0_100,plain,
$true,
c_0_74,
[final] ).
cnf(c_0_101,plain,
$true,
c_0_75,
[final] ).
cnf(c_0_102,plain,
$true,
c_0_76,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_77_0,axiom,
( X1 = powerset(X2)
| ~ subset(sk1_esk1_2(X2,X1),X2)
| ~ in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_1,axiom,
( ~ subset(sk1_esk1_2(X2,X1),X2)
| X1 = powerset(X2)
| ~ in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_2,axiom,
( ~ in(sk1_esk1_2(X2,X1),X1)
| ~ subset(sk1_esk1_2(X2,X1),X2)
| X1 = powerset(X2) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_78_0,axiom,
( X1 = powerset(X2)
| subset(sk1_esk1_2(X2,X1),X2)
| in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( subset(sk1_esk1_2(X2,X1),X2)
| X1 = powerset(X2)
| in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_2,axiom,
( in(sk1_esk1_2(X2,X1),X1)
| subset(sk1_esk1_2(X2,X1),X2)
| X1 = powerset(X2) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( subset(X1,X2)
| ~ in(sk1_esk2_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( ~ in(sk1_esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_80_0,axiom,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_80_1,axiom,
( ~ in(X1,X3)
| in(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_80_2,axiom,
( ~ subset(X3,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_81_0,axiom,
( subset(X1,X2)
| in(sk1_esk2_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_81_1,axiom,
( in(sk1_esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_82_0,axiom,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_1,axiom,
( X1 != powerset(X2)
| subset(X3,X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_2,axiom,
( ~ in(X3,X1)
| X1 != powerset(X2)
| subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_83_0,axiom,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_1,axiom,
( X1 != powerset(X2)
| in(X3,X1)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_2,axiom,
( ~ subset(X3,X2)
| X1 != powerset(X2)
| in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_84_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_84_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_85_0,axiom,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_85_1,axiom,
( in(X2,X1)
| empty(X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_85_2,axiom,
( ~ element(X2,X1)
| in(X2,X1)
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_86_0,axiom,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_86_1,axiom,
( element(X2,X1)
| empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_86_2,axiom,
( ~ in(X2,X1)
| element(X2,X1)
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_87_0,axiom,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_87_1,axiom,
( ~ empty(X1)
| empty(X2)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_87_2,axiom,
( ~ element(X2,X1)
| ~ empty(X1)
| empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_88_0,axiom,
( empty(X1)
| element(sk1_esk4_1(X1),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_88_1,axiom,
( element(sk1_esk4_1(X1),powerset(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_89_0,axiom,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
cnf(c_0_89_1,axiom,
( ~ in(X2,X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
cnf(c_0_90_0,axiom,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_90]) ).
cnf(c_0_90_1,axiom,
( ~ empty(X1)
| element(X2,X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_90]) ).
cnf(c_0_90_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_90]) ).
cnf(c_0_91_0,axiom,
( empty(X1)
| ~ empty(sk1_esk4_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_91]) ).
cnf(c_0_91_1,axiom,
( ~ empty(sk1_esk4_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_91]) ).
cnf(c_0_94_0,axiom,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_94]) ).
cnf(c_0_94_1,axiom,
( ~ empty(X1)
| X2 = X1
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_94]) ).
cnf(c_0_94_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| X2 = X1 ),
inference(literals_permutation,[status(thm)],[c_0_94]) ).
cnf(c_0_96_0,axiom,
( X1 = empty_set
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_96]) ).
cnf(c_0_96_1,axiom,
( ~ empty(X1)
| X1 = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_96]) ).
cnf(c_0_93_0,axiom,
~ empty(powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_93]) ).
cnf(c_0_97_0,axiom,
~ empty(sk1_esk6_0),
inference(literals_permutation,[status(thm)],[c_0_97]) ).
cnf(c_0_92_0,axiom,
element(sk1_esk3_1(X1),X1),
inference(literals_permutation,[status(thm)],[c_0_92]) ).
cnf(c_0_95_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_95]) ).
cnf(c_0_98_0,axiom,
empty(sk1_esk5_0),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_99_0,axiom,
empty(empty_set),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_100_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_101_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_102_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_102]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('<stdin>',l3_subset_1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( element(esk2_0,powerset(esk1_0))
& in(esk3_0,esk2_0)
& ~ in(esk3_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
~ in(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
~ in(esk3_0,esk1_0),
c_0_3,
[final] ).
cnf(c_0_7_008,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
c_0_4,
[final] ).
cnf(c_0_8_009,negated_conjecture,
in(esk3_0,esk2_0),
c_0_5,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_39,plain,
( ~ in(X0,X1)
| X1 != powerset(X2)
| subset(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p',c_0_82_0) ).
cnf(c_131,plain,
( ~ in(X0,X1)
| X1 != powerset(X2)
| subset(X0,X2) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_200586,plain,
( subset(sk2_esk2_0,X0)
| ~ in(sk2_esk2_0,X1)
| X1 != powerset(X0) ),
inference(instantiation,[status(thm)],[c_131]) ).
cnf(c_200729,plain,
( subset(sk2_esk2_0,sk2_esk1_0)
| ~ in(sk2_esk2_0,X0)
| X0 != powerset(sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_200586]) ).
cnf(c_200927,plain,
( subset(sk2_esk2_0,sk2_esk1_0)
| ~ in(sk2_esk2_0,powerset(sk2_esk1_0))
| powerset(sk2_esk1_0) != powerset(sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_200729]) ).
cnf(c_201207,plain,
( subset(sk2_esk2_0,sk2_esk1_0)
| ~ in(sk2_esk2_0,powerset(sk2_esk1_0)) ),
inference(equality_resolution_simp,[status(esa)],[c_200927]) ).
cnf(c_29,plain,
( empty(X0)
| in(X1,X0)
| ~ element(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p',c_0_85_2) ).
cnf(c_121,plain,
( empty(X0)
| in(X1,X0)
| ~ element(X1,X0) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_200504,plain,
( empty(powerset(X0))
| ~ element(X1,powerset(X0))
| in(X1,powerset(X0)) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_200687,plain,
( empty(powerset(sk2_esk1_0))
| ~ element(sk2_esk2_0,powerset(sk2_esk1_0))
| in(sk2_esk2_0,powerset(sk2_esk1_0)) ),
inference(instantiation,[status(thm)],[c_200504]) ).
cnf(c_42,plain,
( in(X0,X1)
| ~ in(X0,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p',c_0_80_2) ).
cnf(c_134,plain,
( in(X0,X1)
| ~ in(X0,X2)
| ~ subset(X2,X1) ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_200508,plain,
( ~ subset(sk2_esk2_0,X0)
| ~ in(sk2_esk3_0,sk2_esk2_0)
| in(sk2_esk3_0,X0) ),
inference(instantiation,[status(thm)],[c_134]) ).
cnf(c_200638,plain,
( ~ subset(sk2_esk2_0,sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk1_0)
| ~ in(sk2_esk3_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_200508]) ).
cnf(c_25,plain,
( ~ element(X0,X1)
| ~ empty(X1)
| empty(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p',c_0_87_0) ).
cnf(c_117,plain,
( ~ element(X0,X1)
| ~ empty(X1)
| empty(X0) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_200572,plain,
( empty(sk2_esk2_0)
| ~ empty(X0)
| ~ element(sk2_esk2_0,X0) ),
inference(instantiation,[status(thm)],[c_117]) ).
cnf(c_200629,plain,
( ~ empty(powerset(sk2_esk1_0))
| empty(sk2_esk2_0)
| ~ element(sk2_esk2_0,powerset(sk2_esk1_0)) ),
inference(instantiation,[status(thm)],[c_200572]) ).
cnf(c_19,plain,
( ~ empty(X0)
| ~ in(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p',c_0_89_1) ).
cnf(c_111,plain,
( ~ empty(X0)
| ~ in(X1,X0) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_200490,plain,
( ~ empty(sk2_esk2_0)
| ~ in(sk2_esk3_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_111]) ).
cnf(c_53,negated_conjecture,
~ in(sk2_esk3_0,sk2_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p',c_0_6) ).
cnf(c_54,negated_conjecture,
element(sk2_esk2_0,powerset(sk2_esk1_0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p',c_0_7) ).
cnf(c_55,negated_conjecture,
in(sk2_esk3_0,sk2_esk2_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p',c_0_8) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_201207,c_200687,c_200638,c_200629,c_200490,c_53,c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU169+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 18 22:41:24 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % FOF problem with conjecture
% 0.20/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6bfac7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_91a86b.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_3338a9 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6bfac7.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ 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.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % ------ Problem Properties
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % EPR false
% 0.20/0.44 % Horn false
% 0.20/0.44 % Has equality true
% 0.20/0.44
% 0.20/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % % ------ Current options:
% 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.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6bfac7.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % warning: shown sat in sat incomplete mode
% 0.20/0.44 %
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 cnf(c_31,negated_conjecture,
% 0.20/0.44 ( in(sk3_esk3_0,sk3_esk2_0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_8) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_52,negated_conjecture,
% 0.20/0.44 ( in(sk3_esk3_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_62,negated_conjecture,
% 0.20/0.44 ( in(sk3_esk3_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_63,negated_conjecture,
% 0.20/0.44 ( in(sk3_esk3_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_62]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_68,negated_conjecture,
% 0.20/0.44 ( in(sk3_esk3_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_63]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_163,negated_conjecture,
% 0.20/0.44 ( in(sk3_esk3_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_68]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_19,plain,
% 0.20/0.44 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_75_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_139,plain,
% 0.20/0.44 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_167,plain,
% 0.20/0.44 ( ~ in(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.44 inference(resolution,[status(thm)],[c_163,c_139]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_168,plain,
% 0.20/0.44 ( ~ in(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_167]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_22,plain,
% 0.20/0.44 ( ~ subset(X0,X1) | in(X0,X2) | X2 != powerset(X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_72_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_145,plain,
% 0.20/0.44 ( ~ subset(X0,X1) | in(X0,X2) | X2 != powerset(X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_146,plain,
% 0.20/0.44 ( in(X0,X1) | ~ subset(X0,X2) | X1 != powerset(X2) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_145]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_21,plain,
% 0.20/0.44 ( ~ element(X0,X1) | in(X0,X1) | empty(X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_73_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_143,plain,
% 0.20/0.44 ( ~ element(X0,X1) | in(X0,X1) | empty(X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_144,plain,
% 0.20/0.44 ( empty(X0) | in(X1,X0) | ~ element(X1,X0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_143]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_20,plain,
% 0.20/0.44 ( ~ in(X0,X1) | element(X0,X1) | empty(X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_74_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_141,plain,
% 0.20/0.44 ( ~ in(X0,X1) | element(X0,X1) | empty(X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_142,plain,
% 0.20/0.44 ( empty(X0) | ~ in(X1,X0) | element(X1,X0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_141]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_18,plain,
% 0.20/0.44 ( ~ element(X0,X1) | empty(X0) | ~ empty(X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_76_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_137,plain,
% 0.20/0.44 ( ~ element(X0,X1) | empty(X0) | ~ empty(X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_138,plain,
% 0.20/0.44 ( empty(X0) | ~ empty(X1) | ~ element(X0,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_137]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_17,plain,
% 0.20/0.44 ( element(sk1_esk3_1(X0),powerset(X0)) | empty(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_77_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_135,plain,
% 0.20/0.44 ( element(sk1_esk3_1(X0),powerset(X0)) | empty(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_136,plain,
% 0.20/0.44 ( empty(X0) | element(sk1_esk3_1(X0),powerset(X0)) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_135]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_16,plain,
% 0.20/0.44 ( ~ empty(X0) | element(X0,X1) | ~ empty(X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_78_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_133,plain,
% 0.20/0.44 ( ~ empty(X0) | element(X0,X1) | ~ empty(X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_134,plain,
% 0.20/0.44 ( ~ empty(X0) | ~ empty(X1) | element(X0,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_133]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_14,plain,
% 0.20/0.44 ( X0 = empty_set | ~ empty(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_80_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_129,plain,
% 0.20/0.44 ( X0 = empty_set | ~ empty(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_130,plain,
% 0.20/0.44 ( ~ empty(X0) | X0 = empty_set ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_129]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_4,plain,
% 0.20/0.44 ( X0 = X1 | ~ empty(X1) | ~ empty(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_22_2) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_109,plain,
% 0.20/0.44 ( X0 = X1 | ~ empty(X1) | ~ empty(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_110,plain,
% 0.20/0.44 ( ~ empty(X0) | ~ empty(X1) | X1 = X0 ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_109]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_30,negated_conjecture,
% 0.20/0.44 ( element(sk3_esk2_0,powerset(sk3_esk1_0)) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_7) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_50,negated_conjecture,
% 0.20/0.44 ( element(sk3_esk2_0,powerset(sk3_esk1_0)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_61,negated_conjecture,
% 0.20/0.44 ( element(sk3_esk2_0,powerset(sk3_esk1_0)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_64,negated_conjecture,
% 0.20/0.44 ( element(sk3_esk2_0,powerset(sk3_esk1_0)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_61]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_67,negated_conjecture,
% 0.20/0.44 ( element(sk3_esk2_0,powerset(sk3_esk1_0)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_64]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_161,negated_conjecture,
% 0.20/0.44 ( element(sk3_esk2_0,powerset(sk3_esk1_0)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_67]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_29,negated_conjecture,
% 0.20/0.44 ( ~ in(sk3_esk3_0,sk3_esk1_0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_6) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_48,negated_conjecture,
% 0.20/0.44 ( ~ in(sk3_esk3_0,sk3_esk1_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_60,negated_conjecture,
% 0.20/0.44 ( ~ in(sk3_esk3_0,sk3_esk1_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_65,negated_conjecture,
% 0.20/0.44 ( ~ in(sk3_esk3_0,sk3_esk1_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_60]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_66,negated_conjecture,
% 0.20/0.44 ( ~ in(sk3_esk3_0,sk3_esk1_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_65]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_159,negated_conjecture,
% 0.20/0.44 ( ~ in(sk3_esk3_0,sk3_esk1_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_66]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_28,plain,
% 0.20/0.44 ( ~ in(sk1_esk1_2(X0,X1),X0)
% 0.20/0.44 | ~ subset(sk1_esk1_2(X0,X1),X1)
% 0.20/0.44 | X0 = powerset(X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_66_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_157,plain,
% 0.20/0.44 ( ~ in(sk1_esk1_2(X0,X1),X0)
% 0.20/0.44 | ~ subset(sk1_esk1_2(X0,X1),X1)
% 0.20/0.44 | X0 = powerset(X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_27,plain,
% 0.20/0.44 ( in(sk1_esk1_2(X0,X1),X0)
% 0.20/0.44 | subset(sk1_esk1_2(X0,X1),X1)
% 0.20/0.44 | X0 = powerset(X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_67_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_155,plain,
% 0.20/0.44 ( in(sk1_esk1_2(X0,X1),X0)
% 0.20/0.44 | subset(sk1_esk1_2(X0,X1),X1)
% 0.20/0.44 | X0 = powerset(X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_26,plain,
% 0.20/0.44 ( ~ in(sk1_esk2_2(X0,X1),X0) | subset(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_68_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_153,plain,
% 0.20/0.44 ( ~ in(sk1_esk2_2(X0,X1),X0) | subset(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_25,plain,
% 0.20/0.44 ( in(sk1_esk2_2(X0,X1),X1) | subset(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_69_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_151,plain,
% 0.20/0.44 ( in(sk1_esk2_2(X0,X1),X1) | subset(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_24,plain,
% 0.20/0.44 ( ~ in(X0,X1) | in(X0,X2) | ~ subset(X1,X2) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_70_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_149,plain,
% 0.20/0.44 ( ~ in(X0,X1) | in(X0,X2) | ~ subset(X1,X2) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_23,plain,
% 0.20/0.44 ( ~ in(X0,X1) | subset(X0,X2) | X1 != powerset(X2) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_71_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_147,plain,
% 0.20/0.44 ( ~ in(X0,X1) | subset(X0,X2) | X1 != powerset(X2) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_23]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_15,plain,
% 0.20/0.44 ( ~ empty(sk1_esk3_1(X0)) | empty(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_79_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_131,plain,
% 0.20/0.44 ( ~ empty(sk1_esk3_1(X0)) | empty(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_13,plain,
% 0.20/0.44 ( subset(X0,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_81_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_127,plain,( subset(X0,X0) ),inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_12,plain,
% 0.20/0.44 ( ~ empty(powerset(X0)) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_82_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_125,plain,
% 0.20/0.44 ( ~ empty(powerset(X0)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_11,plain,
% 0.20/0.44 ( empty(empty_set) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_83_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_123,plain,( empty(empty_set) ),inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_8,plain,
% 0.20/0.44 ( $true ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_86_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_117,plain,( $true ),inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_7,plain,
% 0.20/0.44 ( empty(sk2_esk2_0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_24_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_115,plain,( empty(sk2_esk2_0) ),inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_6,plain,
% 0.20/0.44 ( element(sk2_esk3_1(X0),X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_21_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_113,plain,
% 0.20/0.44 ( element(sk2_esk3_1(X0),X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_5,plain,
% 0.20/0.44 ( ~ empty(sk2_esk1_0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_23_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_111,plain,
% 0.20/0.44 ( ~ empty(sk2_esk1_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_2,plain,
% 0.20/0.44 ( ~ empty(X0) | ~ empty(X1) | X0 = X1 ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_22_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_105,plain,
% 0.20/0.44 ( ~ empty(X0) | ~ empty(X1) | X0 = X1 ),
% 0.20/0.44 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_0,plain,
% 0.20/0.44 ( ~ in(X0,X1) | ~ empty(X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_91a86b.p', c_0_20_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_101,plain,
% 0.20/0.44 ( ~ in(X0,X1) | ~ empty(X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_102,plain,
% 0.20/0.44 ( ~ empty(X0) | ~ in(X1,X0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_101]) ).
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Statistics
% 0.20/0.44
% 0.20/0.44 % ------ General
% 0.20/0.44
% 0.20/0.44 % num_of_input_clauses: 32
% 0.20/0.44 % num_of_input_neg_conjectures: 3
% 0.20/0.44 % num_of_splits: 0
% 0.20/0.44 % num_of_split_atoms: 0
% 0.20/0.44 % num_of_sem_filtered_clauses: 0
% 0.20/0.44 % num_of_subtypes: 0
% 0.20/0.44 % monotx_restored_types: 0
% 0.20/0.44 % sat_num_of_epr_types: 0
% 0.20/0.44 % sat_num_of_non_cyclic_types: 0
% 0.20/0.44 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 0
% 0.20/0.44 % has_eq: 1
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 6
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 0
% 0.20/0.44 % pred_elim: 0
% 0.20/0.44 % pred_elim_cl: 0
% 0.20/0.44 % pred_elim_cycles: 0
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.
% 0.20/0.44 % out_proof_time: 0.
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.024
% 0.20/0.44 % num_of_symbols: 40
% 0.20/0.44 % num_of_terms: 113
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 1
% 0.20/0.44 % prop_fast_solver_calls: 9
% 0.20/0.44 % prop_num_of_clauses: 44
% 0.20/0.44 % prop_preprocess_simplified: 90
% 0.20/0.44 % prop_fo_subsumed: 0
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: 30
% 0.20/0.44 % inst_num_in_passive: 0
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 32
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: 39
% 0.20/0.44 % res_num_in_passive: 0
% 0.20/0.44 % res_num_in_active: 29
% 0.20/0.44 % res_num_of_loops: 5
% 0.20/0.44 % res_forward_subset_subsumed: 4
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 0
% 0.20/0.44 % res_backward_subsumed: 0
% 0.20/0.44 % res_forward_subsumption_resolution: 0
% 0.20/0.44 % res_backward_subsumption_resolution: 0
% 0.20/0.44 % res_clause_to_clause_subsumption: 2
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 0
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unknown
% 0.20/0.49 % Orienting using strategy ClausalAll
% 0.20/0.49 % FOF problem with conjecture
% 0.20/0.49 % 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_6bfac7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_91a86b.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_59e631 | grep -v "SZS"
% 0.20/0.51
% 0.20/0.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % ------ iProver source info
% 0.20/0.51
% 0.20/0.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.51 % git: non_committed_changes: true
% 0.20/0.51 % git: last_make_outside_of_git: true
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 0.20/0.51 % --inst_prop_sim_new false
% 0.20/0.51 % --inst_orphan_elimination true
% 0.20/0.51 % --inst_learning_loop_flag true
% 0.20/0.51 % --inst_learning_start 3000
% 0.20/0.51 % --inst_learning_factor 2
% 0.20/0.51 % --inst_start_prop_sim_after_learn 3
% 0.20/0.51 % --inst_sel_renew solver
% 0.20/0.51 % --inst_lit_activity_flag true
% 0.20/0.51 % --inst_out_proof true
% 0.20/0.51
% 0.20/0.51 % ------ Resolution Options
% 0.20/0.51
% 0.20/0.51 % --resolution_flag true
% 0.20/0.51 % --res_lit_sel kbo_max
% 0.20/0.51 % --res_to_prop_solver none
% 0.20/0.51 % --res_prop_simpl_new false
% 0.20/0.51 % --res_prop_simpl_given false
% 0.20/0.51 % --res_passive_queue_type priority_queues
% 0.20/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.51 % --res_passive_queues_freq [15;5]
% 0.20/0.51 % --res_forward_subs full
% 0.20/0.51 % --res_backward_subs full
% 0.20/0.51 % --res_forward_subs_resolution true
% 0.20/0.51 % --res_backward_subs_resolution true
% 0.20/0.51 % --res_orphan_elimination false
% 0.20/0.51 % --res_time_limit 1000.
% 0.20/0.51 % --res_out_proof true
% 0.20/0.51 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6bfac7.s
% 0.20/0.51 % --modulo true
% 0.20/0.51
% 0.20/0.51 % ------ Combination Options
% 0.20/0.51
% 0.20/0.51 % --comb_res_mult 1000
% 0.20/0.51 % --comb_inst_mult 300
% 0.20/0.51 % ------
% 0.20/0.51
% 0.20/0.51 % ------ Parsing...% successful
% 0.20/0.51
% 0.20/0.51 % ------ 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.20/0.51
% 0.20/0.51 % ------ Proving...
% 0.20/0.51 % ------ Problem Properties
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % EPR false
% 0.20/0.51 % Horn false
% 0.20/0.51 % Has equality true
% 0.20/0.51
% 0.20/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % % ------ Current options:
% 0.20/0.51
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 56.08/56.28 % --inst_prop_sim_new false
% 56.08/56.28 % --inst_orphan_elimination true
% 56.08/56.28 % --inst_learning_loop_flag true
% 56.08/56.28 % --inst_learning_start 3000
% 56.08/56.28 % --inst_learning_factor 2
% 56.08/56.28 % --inst_start_prop_sim_after_learn 3
% 56.08/56.28 % --inst_sel_renew solver
% 56.08/56.28 % --inst_lit_activity_flag true
% 56.08/56.28 % --inst_out_proof true
% 56.08/56.28
% 56.08/56.28 % ------ Resolution Options
% 56.08/56.28
% 56.08/56.28 % --resolution_flag true
% 56.08/56.28 % --res_lit_sel kbo_max
% 56.08/56.28 % --res_to_prop_solver none
% 56.08/56.28 % --res_prop_simpl_new false
% 56.08/56.28 % --res_prop_simpl_given false
% 56.08/56.28 % --res_passive_queue_type priority_queues
% 56.08/56.28 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 56.08/56.28 % --res_passive_queues_freq [15;5]
% 56.08/56.28 % --res_forward_subs full
% 56.08/56.28 % --res_backward_subs full
% 56.08/56.28 % --res_forward_subs_resolution true
% 56.08/56.28 % --res_backward_subs_resolution true
% 56.08/56.28 % --res_orphan_elimination false
% 56.08/56.28 % --res_time_limit 1000.
% 56.08/56.28 % --res_out_proof true
% 56.08/56.28 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_6bfac7.s
% 56.08/56.28 % --modulo true
% 56.08/56.28
% 56.08/56.28 % ------ Combination Options
% 56.08/56.28
% 56.08/56.28 % --comb_res_mult 1000
% 56.08/56.28 % --comb_inst_mult 300
% 56.08/56.28 % ------
% 56.08/56.28
% 56.08/56.28
% 56.08/56.28
% 56.08/56.28 % ------ Proving...
% 56.08/56.28 %
% 56.08/56.28
% 56.08/56.28
% 56.08/56.28 % ------ Statistics
% 56.08/56.28
% 56.08/56.28 % ------ General
% 56.08/56.28
% 56.08/56.28 % num_of_input_clauses: 56
% 56.08/56.28 % num_of_input_neg_conjectures: 3
% 56.08/56.28 % num_of_splits: 0
% 56.08/56.28 % num_of_split_atoms: 0
% 56.08/56.28 % num_of_sem_filtered_clauses: 0
% 56.08/56.28 % num_of_subtypes: 0
% 56.08/56.28 % monotx_restored_types: 0
% 56.08/56.28 % sat_num_of_epr_types: 0
% 56.08/56.28 % sat_num_of_non_cyclic_types: 0
% 56.08/56.28 % sat_guarded_non_collapsed_types: 0
% 56.08/56.28 % is_epr: 0
% 56.08/56.28 % is_horn: 0
% 56.08/56.28 % has_eq: 1
% 56.08/56.28 % num_pure_diseq_elim: 0
% 56.08/56.28 % simp_replaced_by: 0
% 56.08/56.28 % res_preprocessed: 6
% 56.08/56.28 % prep_upred: 0
% 56.08/56.28 % prep_unflattend: 0
% 56.08/56.28 % pred_elim_cands: 0
% 56.08/56.28 % pred_elim: 0
% 56.08/56.28 % pred_elim_cl: 0
% 56.08/56.28 % pred_elim_cycles: 0
% 56.08/56.28 % forced_gc_time: 0
% 56.08/56.28 % gc_basic_clause_elim: 0
% 56.08/56.28 % parsing_time: 0.002
% 56.08/56.28 % sem_filter_time: 0.
% 56.08/56.28 % pred_elim_time: 0.
% 56.08/56.28 % out_proof_time: 0.
% 56.08/56.28 % monotx_time: 0.
% 56.08/56.28 % subtype_inf_time: 0.
% 56.08/56.28 % unif_index_cands_time: 0.002
% 56.08/56.28 % unif_index_add_time: 0.003
% 56.08/56.28 % total_time: 55.787
% 56.08/56.28 % num_of_symbols: 40
% 56.08/56.28 % num_of_terms: 3018
% 56.08/56.28
% 56.08/56.28 % ------ Propositional Solver
% 56.08/56.28
% 56.08/56.28 % prop_solver_calls: 5
% 56.08/56.28 % prop_fast_solver_calls: 9
% 56.08/56.28 % prop_num_of_clauses: 371
% 56.08/56.28 % prop_preprocess_simplified: 758
% 56.08/56.28 % prop_fo_subsumed: 0
% 56.08/56.28 % prop_solver_time: 0.
% 56.08/56.28 % prop_fast_solver_time: 0.
% 56.08/56.28 % prop_unsat_core_time: 0.
% 56.08/56.28
% 56.08/56.28 % ------ QBF
% 56.08/56.28
% 56.08/56.28 % qbf_q_res: 0
% 56.08/56.28 % qbf_num_tautologies: 0
% 56.08/56.28 % qbf_prep_cycles: 0
% 56.08/56.28
% 56.08/56.28 % ------ BMC1
% 56.08/56.28
% 56.08/56.28 % bmc1_current_bound: -1
% 56.08/56.28 % bmc1_last_solved_bound: -1
% 56.08/56.28 % bmc1_unsat_core_size: -1
% 56.08/56.28 % bmc1_unsat_core_parents_size: -1
% 56.08/56.28 % bmc1_merge_next_fun: 0
% 56.08/56.28 % bmc1_unsat_core_clauses_time: 0.
% 56.08/56.28
% 56.08/56.28 % ------ Instantiation
% 56.08/56.28
% 56.08/56.28 % inst_num_of_clauses: 295
% 56.08/56.28 % inst_num_in_passive: 96
% 56.08/56.28 % inst_num_in_active: 196
% 56.08/56.28 % inst_num_in_unprocessed: 0
% 56.08/56.28 % inst_num_of_loops: 217
% 56.08/56.28 % inst_num_of_learning_restarts: 0
% 56.08/56.28 % inst_num_moves_active_passive: 15
% 56.08/56.28 % inst_lit_activity: 63
% 56.08/56.28 % inst_lit_activity_moves: 0
% 56.08/56.28 % inst_num_tautologies: 1
% 56.08/56.28 % inst_num_prop_implied: 0
% 56.08/56.28 % inst_num_existing_simplified: 0
% 56.08/56.28 % inst_num_eq_res_simplified: 1
% 56.08/56.28 % inst_num_child_elim: 0
% 56.08/56.28 % inst_num_of_dismatching_blockings: 115
% 56.08/56.28 % inst_num_of_non_proper_insts: 404
% 56.08/56.28 % inst_num_of_duplicates: 234
% 56.08/56.28 % inst_inst_num_from_inst_to_res: 0
% 56.08/56.28 % inst_dismatching_checking_time: 0.
% 56.08/56.28
% 56.08/56.28 % ------ Resolution
% 56.08/56.28
% 56.08/56.28 % res_num_of_clauses: 1059
% 56.08/56.28 % res_num_in_passive: 4
% 56.08/56.28 % res_num_in_active: 1026
% 56.08/56.28 % res_num_of_loops: 1000
% 56.08/56.28 % res_forward_subset_subsumed: 422
% 56.08/56.28 % res_backward_subset_subsumed: 0
% 56.08/56.28 % res_forward_subsumed: 2
% 56.08/56.28 % res_backward_subsumed: 0
% 56.08/56.28 % res_forward_subsumption_resolution: 2
% 56.08/56.28 % res_backward_subsumption_resolution: 0
% 56.08/56.28 % res_clause_to_clause_subsumption: 684230
% 56.08/56.28 % res_orphan_elimination: 0
% 56.08/56.28 % res_tautology_del: 0
% 56.08/56.28 % res_num_eq_res_simplified: 0
% 56.08/56.28 % res_num_sel_changes: 0
% 56.08/56.28 % res_moves_from_active_to_pass: 0
% 56.08/56.28
% 56.08/56.28 % Status Unsatisfiable
% 56.08/56.28 % SZS status Theorem
% 56.08/56.28 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------