%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU171+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n004.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:37 EDT 2022
% Result : Theorem 151.78s 152.04s
% Output : CNFRefutation 151.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 33
% Syntax : Number of formulae : 228 ( 89 unt; 0 def)
% Number of atoms : 507 ( 97 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 502 ( 223 ~; 219 |; 28 &)
% ( 8 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 11 con; 0-3 aty)
% Number of variables : 354 ( 23 sgn 89 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('<stdin>',d4_xboole_0) ).
fof(c_0_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('<stdin>',dt_k3_subset_1) ).
fof(c_0_2,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('<stdin>',involutiveness_k3_subset_1) ).
fof(c_0_3,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('<stdin>',d5_subset_1) ).
fof(c_0_4,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('<stdin>',antisymmetry_r2_hidden) ).
fof(c_0_5,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_6,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
file('<stdin>',rc1_subset_1) ).
fof(c_0_7,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('<stdin>',t7_boole) ).
fof(c_0_8,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
file('<stdin>',rc2_subset_1) ).
fof(c_0_9,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('<stdin>',existence_m1_subset_1) ).
fof(c_0_10,axiom,
! [X1] : ~ empty(powerset(X1)),
file('<stdin>',fc1_subset_1) ).
fof(c_0_11,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('<stdin>',t8_boole) ).
fof(c_0_12,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('<stdin>',t3_boole) ).
fof(c_0_13,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
file('<stdin>',t4_boole) ).
fof(c_0_14,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('<stdin>',t6_boole) ).
fof(c_0_15,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_16,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_17,axiom,
empty(empty_set),
file('<stdin>',fc1_xboole_0) ).
fof(c_0_18,axiom,
$true,
file('<stdin>',dt_m1_subset_1) ).
fof(c_0_19,axiom,
$true,
file('<stdin>',dt_k4_xboole_0) ).
fof(c_0_20,axiom,
$true,
file('<stdin>',dt_k1_zfmisc_1) ).
fof(c_0_21,axiom,
$true,
file('<stdin>',dt_k1_xboole_0) ).
fof(c_0_22,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_23,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
c_0_1 ).
fof(c_0_24,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
c_0_2 ).
fof(c_0_25,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
c_0_3 ).
fof(c_0_26,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_27,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_5]) ).
fof(c_0_28,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_29,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
c_0_7 ).
fof(c_0_30,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
c_0_8 ).
fof(c_0_31,axiom,
! [X1] :
? [X2] : element(X2,X1),
c_0_9 ).
fof(c_0_32,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_33,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
c_0_11 ).
fof(c_0_34,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
c_0_12 ).
fof(c_0_35,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
c_0_13 ).
fof(c_0_36,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
c_0_14 ).
fof(c_0_37,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_38,axiom,
? [X1] : empty(X1),
c_0_16 ).
fof(c_0_39,axiom,
empty(empty_set),
c_0_17 ).
fof(c_0_40,axiom,
$true,
c_0_18 ).
fof(c_0_41,axiom,
$true,
c_0_19 ).
fof(c_0_42,axiom,
$true,
c_0_20 ).
fof(c_0_43,axiom,
$true,
c_0_21 ).
fof(c_0_44,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X6)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X9,X5)
| in(X9,X6)
| in(X9,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(esk1_3(X10,X11,X12),X12)
| ~ in(esk1_3(X10,X11,X12),X10)
| in(esk1_3(X10,X11,X12),X11)
| X12 = set_difference(X10,X11) )
& ( in(esk1_3(X10,X11,X12),X10)
| in(esk1_3(X10,X11,X12),X12)
| X12 = set_difference(X10,X11) )
& ( ~ in(esk1_3(X10,X11,X12),X11)
| in(esk1_3(X10,X11,X12),X12)
| X12 = set_difference(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])])]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| element(subset_complement(X3,X4),powerset(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])]) ).
fof(c_0_46,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| subset_complement(X3,subset_complement(X3,X4)) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])]) ).
fof(c_0_47,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| subset_complement(X3,X4) = set_difference(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])]) ).
fof(c_0_48,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])]) ).
fof(c_0_49,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_27])])])])]) ).
fof(c_0_50,plain,
! [X3] :
( ( element(esk3_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk3_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
fof(c_0_51,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])]) ).
fof(c_0_52,plain,
! [X3] :
( element(esk5_1(X3),powerset(X3))
& empty(esk5_1(X3)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).
fof(c_0_53,plain,
! [X3] : element(esk2_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_31])]) ).
fof(c_0_54,plain,
! [X2] : ~ empty(powerset(X2)),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_55,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_33])])])]) ).
fof(c_0_56,plain,
! [X2] : set_difference(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_57,plain,
! [X2] : set_difference(empty_set,X2) = empty_set,
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_58,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])]) ).
fof(c_0_59,plain,
~ empty(esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_37])]) ).
fof(c_0_60,plain,
empty(esk4_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_38])]) ).
fof(c_0_61,axiom,
empty(empty_set),
c_0_39 ).
fof(c_0_62,axiom,
$true,
c_0_40 ).
fof(c_0_63,axiom,
$true,
c_0_41 ).
fof(c_0_64,axiom,
$true,
c_0_42 ).
fof(c_0_65,axiom,
$true,
c_0_43 ).
cnf(c_0_66,plain,
( X1 = set_difference(X2,X3)
| in(esk1_3(X2,X3,X1),X3)
| ~ in(esk1_3(X2,X3,X1),X2)
| ~ in(esk1_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_67,plain,
( X1 = set_difference(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| ~ in(esk1_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_68,plain,
( X1 = set_difference(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_69,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_70,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_71,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_72,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_73,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_74,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_75,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_76,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_77,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_78,plain,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_79,plain,
( empty(X1)
| element(esk3_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_80,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_81,plain,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_82,plain,
element(esk5_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_83,plain,
( empty(X1)
| ~ empty(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_84,plain,
element(esk2_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_85,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_86,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_87,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_88,plain,
set_difference(empty_set,X1) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_89,plain,
empty(esk5_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_90,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_91,plain,
~ empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_92,plain,
empty(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_93,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_94,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_95,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_96,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_97,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_98,plain,
( X1 = set_difference(X2,X3)
| in(esk1_3(X2,X3,X1),X3)
| ~ in(esk1_3(X2,X3,X1),X2)
| ~ in(esk1_3(X2,X3,X1),X1) ),
c_0_66,
[final] ).
cnf(c_0_99,plain,
( X1 = set_difference(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| ~ in(esk1_3(X2,X3,X1),X3) ),
c_0_67,
[final] ).
cnf(c_0_100,plain,
( X1 = set_difference(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X2) ),
c_0_68,
[final] ).
cnf(c_0_101,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
c_0_69,
[final] ).
cnf(c_0_102,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
c_0_70,
[final] ).
cnf(c_0_103,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
c_0_71,
[final] ).
cnf(c_0_104,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
c_0_72,
[final] ).
cnf(c_0_105,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
c_0_73,
[final] ).
cnf(c_0_106,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
c_0_74,
[final] ).
cnf(c_0_107,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_75,
[final] ).
cnf(c_0_108,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
c_0_76,
[final] ).
cnf(c_0_109,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
c_0_77,
[final] ).
cnf(c_0_110,plain,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
c_0_78,
[final] ).
cnf(c_0_111,plain,
( empty(X1)
| element(esk3_1(X1),powerset(X1)) ),
c_0_79,
[final] ).
cnf(c_0_112,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
c_0_80,
[final] ).
cnf(c_0_113,plain,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
c_0_81,
[final] ).
cnf(c_0_114,plain,
element(esk5_1(X1),powerset(X1)),
c_0_82,
[final] ).
cnf(c_0_115,plain,
( empty(X1)
| ~ empty(esk3_1(X1)) ),
c_0_83,
[final] ).
cnf(c_0_116,plain,
element(esk2_1(X1),X1),
c_0_84,
[final] ).
cnf(c_0_117,plain,
~ empty(powerset(X1)),
c_0_85,
[final] ).
cnf(c_0_118,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
c_0_86,
[final] ).
cnf(c_0_119,plain,
set_difference(X1,empty_set) = X1,
c_0_87,
[final] ).
cnf(c_0_120,plain,
set_difference(empty_set,X1) = empty_set,
c_0_88,
[final] ).
cnf(c_0_121,plain,
empty(esk5_1(X1)),
c_0_89,
[final] ).
cnf(c_0_122,plain,
( X1 = empty_set
| ~ empty(X1) ),
c_0_90,
[final] ).
cnf(c_0_123,plain,
~ empty(esk6_0),
c_0_91,
[final] ).
cnf(c_0_124,plain,
empty(esk4_0),
c_0_92,
[final] ).
cnf(c_0_125,plain,
empty(empty_set),
c_0_93,
[final] ).
cnf(c_0_126,plain,
$true,
c_0_94,
[final] ).
cnf(c_0_127,plain,
$true,
c_0_95,
[final] ).
cnf(c_0_128,plain,
$true,
c_0_96,
[final] ).
cnf(c_0_129,plain,
$true,
c_0_97,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_98_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk1_3(X2,X3,X1),X3)
| ~ in(sk1_esk1_3(X2,X3,X1),X2)
| ~ in(sk1_esk1_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_98_1,axiom,
( in(sk1_esk1_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk1_3(X2,X3,X1),X2)
| ~ in(sk1_esk1_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_98_2,axiom,
( ~ in(sk1_esk1_3(X2,X3,X1),X2)
| in(sk1_esk1_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk1_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_98_3,axiom,
( ~ in(sk1_esk1_3(X2,X3,X1),X1)
| ~ in(sk1_esk1_3(X2,X3,X1),X2)
| in(sk1_esk1_3(X2,X3,X1),X3)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_98]) ).
cnf(c_0_99_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk1_3(X2,X3,X1),X1)
| ~ in(sk1_esk1_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_99_1,axiom,
( in(sk1_esk1_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3)
| ~ in(sk1_esk1_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_99_2,axiom,
( ~ in(sk1_esk1_3(X2,X3,X1),X3)
| in(sk1_esk1_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_99]) ).
cnf(c_0_100_0,axiom,
( X1 = set_difference(X2,X3)
| in(sk1_esk1_3(X2,X3,X1),X1)
| in(sk1_esk1_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_1,axiom,
( in(sk1_esk1_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3)
| in(sk1_esk1_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_100_2,axiom,
( in(sk1_esk1_3(X2,X3,X1),X2)
| in(sk1_esk1_3(X2,X3,X1),X1)
| X1 = set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_100]) ).
cnf(c_0_101_0,axiom,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_101_1,axiom,
( ~ element(X2,powerset(X1))
| element(subset_complement(X1,X2),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_101]) ).
cnf(c_0_102_0,axiom,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_1,axiom,
( in(X4,X3)
| in(X4,X1)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_2,axiom,
( X1 != set_difference(X2,X3)
| in(X4,X3)
| in(X4,X1)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_102_3,axiom,
( ~ in(X4,X2)
| X1 != set_difference(X2,X3)
| in(X4,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_102]) ).
cnf(c_0_103_0,axiom,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_103_1,axiom,
( ~ element(X2,powerset(X1))
| subset_complement(X1,subset_complement(X1,X2)) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_103]) ).
cnf(c_0_104_0,axiom,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_1,axiom,
( ~ in(X4,X1)
| X1 != set_difference(X2,X3)
| ~ in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_104_2,axiom,
( ~ in(X4,X3)
| ~ in(X4,X1)
| X1 != set_difference(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_104]) ).
cnf(c_0_105_0,axiom,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_1,axiom,
( X1 != set_difference(X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_105_2,axiom,
( ~ in(X4,X1)
| X1 != set_difference(X2,X3)
| in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_105]) ).
cnf(c_0_106_0,axiom,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_106_1,axiom,
( ~ element(X2,powerset(X1))
| subset_complement(X1,X2) = set_difference(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_106]) ).
cnf(c_0_107_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_107_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_107]) ).
cnf(c_0_108_0,axiom,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_108_1,axiom,
( in(X2,X1)
| empty(X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_108_2,axiom,
( ~ element(X2,X1)
| in(X2,X1)
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_108]) ).
cnf(c_0_109_0,axiom,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_109_1,axiom,
( element(X2,X1)
| empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_109_2,axiom,
( ~ in(X2,X1)
| element(X2,X1)
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_109]) ).
cnf(c_0_110_0,axiom,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_110_1,axiom,
( ~ empty(X1)
| empty(X2)
| ~ element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_110_2,axiom,
( ~ element(X2,X1)
| ~ empty(X1)
| empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_111_0,axiom,
( empty(X1)
| element(sk1_esk3_1(X1),powerset(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_1,axiom,
( element(sk1_esk3_1(X1),powerset(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_112_0,axiom,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_1,axiom,
( ~ in(X2,X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_113_0,axiom,
( element(X2,X1)
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_113_1,axiom,
( ~ empty(X1)
| element(X2,X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_113_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| element(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_115_0,axiom,
( empty(X1)
| ~ empty(sk1_esk3_1(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_1,axiom,
( ~ empty(sk1_esk3_1(X1))
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_118_0,axiom,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_1,axiom,
( ~ empty(X1)
| X2 = X1
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| X2 = X1 ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_122_0,axiom,
( X1 = empty_set
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_1,axiom,
( ~ empty(X1)
| X1 = empty_set ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_117_0,axiom,
~ empty(powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_123_0,axiom,
~ empty(sk1_esk6_0),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_114_0,axiom,
element(sk1_esk5_1(X1),powerset(X1)),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_116_0,axiom,
element(sk1_esk2_1(X1),X1),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_119_0,axiom,
set_difference(X1,empty_set) = X1,
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_120_0,axiom,
set_difference(empty_set,X1) = empty_set,
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_121_0,axiom,
empty(sk1_esk5_1(X1)),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_124_0,axiom,
empty(sk1_esk4_0),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_125_0,axiom,
empty(empty_set),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_126_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_127_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_128_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_129_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_129]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1] :
( X1 != empty_set
=> ! [X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,X1)
=> ( ~ in(X3,X2)
=> in(X3,subset_complement(X1,X2)) ) ) ) ),
file('<stdin>',t50_subset_1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1] :
( X1 != empty_set
=> ! [X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,X1)
=> ( ~ in(X3,X2)
=> in(X3,subset_complement(X1,X2)) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_0])]) ).
fof(c_0_2_003,negated_conjecture,
( esk1_0 != empty_set
& element(esk2_0,powerset(esk1_0))
& element(esk3_0,esk1_0)
& ~ in(esk3_0,esk2_0)
& ~ in(esk3_0,subset_complement(esk1_0,esk2_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,subset_complement(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
~ in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
element(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
~ in(esk3_0,subset_complement(esk1_0,esk2_0)),
c_0_3,
[final] ).
cnf(c_0_9_010,negated_conjecture,
~ in(esk3_0,esk2_0),
c_0_4,
[final] ).
cnf(c_0_10_011,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
c_0_5,
[final] ).
cnf(c_0_11_012,negated_conjecture,
element(esk3_0,esk1_0),
c_0_6,
[final] ).
cnf(c_0_12_013,negated_conjecture,
empty_set != esk1_0,
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_51,plain,
( ~ in(X0,X1)
| X2 != set_difference(X1,X3)
| in(X0,X3)
| in(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_102_0) ).
cnf(c_171,plain,
( ~ in(X0,X1)
| X2 != set_difference(X1,X3)
| in(X0,X3)
| in(X0,X2) ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_5777,plain,
( ~ in(sk2_esk3_0,sk2_esk1_0)
| in(sk2_esk3_0,X0)
| in(sk2_esk3_0,X1)
| X1 != set_difference(sk2_esk1_0,X0) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_6110,plain,
( in(sk2_esk3_0,subset_complement(sk2_esk1_0,sk2_esk2_0))
| ~ in(sk2_esk3_0,sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk2_0)
| subset_complement(sk2_esk1_0,sk2_esk2_0) != set_difference(sk2_esk1_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_5777]) ).
cnf(c_33,plain,
( empty(X0)
| in(X1,X0)
| ~ element(X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_108_2) ).
cnf(c_153,plain,
( empty(X0)
| in(X1,X0)
| ~ element(X1,X0) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_5430,plain,
( empty(sk2_esk1_0)
| ~ element(X0,sk2_esk1_0)
| in(X0,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_5624,plain,
( empty(sk2_esk1_0)
| ~ element(sk2_esk3_0,sk2_esk1_0)
| in(sk2_esk3_0,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_5430]) ).
cnf(c_38,plain,
( subset_complement(X0,X1) = set_difference(X0,X1)
| ~ element(X1,powerset(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_106_1) ).
cnf(c_158,plain,
( subset_complement(X0,X1) = set_difference(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_5375,plain,
( ~ element(sk2_esk2_0,powerset(sk2_esk1_0))
| subset_complement(sk2_esk1_0,sk2_esk2_0) = set_difference(sk2_esk1_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_15,plain,
( X0 = X1
| ~ empty(X1)
| ~ empty(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_118_2) ).
cnf(c_135,plain,
( X0 = X1
| ~ empty(X1)
| ~ empty(X0) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_5340,plain,
( ~ empty(empty_set)
| ~ empty(sk2_esk1_0)
| empty_set = sk2_esk1_0 ),
inference(instantiation,[status(thm)],[c_135]) ).
cnf(c_4,plain,
empty(empty_set),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_125_0) ).
cnf(c_64,negated_conjecture,
~ in(sk2_esk3_0,subset_complement(sk2_esk1_0,sk2_esk2_0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_8) ).
cnf(c_65,negated_conjecture,
~ in(sk2_esk3_0,sk2_esk2_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_9) ).
cnf(c_66,negated_conjecture,
empty_set != sk2_esk1_0,
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_12) ).
cnf(c_67,negated_conjecture,
element(sk2_esk2_0,powerset(sk2_esk1_0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_10) ).
cnf(c_68,negated_conjecture,
element(sk2_esk3_0,sk2_esk1_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p',c_0_11) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_6110,c_5624,c_5375,c_5340,c_4,c_64,c_65,c_66,c_67,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU171+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 09:00:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/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/sandbox2/tmp/iprover_proof_e9be38.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_91831b | 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.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.54 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.54 % --bmc1_dump_file -
% 0.20/0.54 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.54 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.54 % --bmc1_ucm_extend_mode 1
% 0.20/0.54 % --bmc1_ucm_init_mode 2
% 0.20/0.54 % --bmc1_ucm_cone_mode none
% 0.20/0.54 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.54 % --bmc1_ucm_relax_model 4
% 0.20/0.54 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.54 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.54 % --bmc1_ucm_layered_model none
% 0.20/0.54 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.54
% 0.20/0.54 % ------ AIG Options
% 0.20/0.54
% 0.20/0.54 % --aig_mode false
% 0.20/0.54
% 0.20/0.54 % ------ Instantiation Options
% 0.20/0.54
% 0.20/0.54 % --instantiation_flag true
% 0.20/0.54 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.54 % --inst_solver_per_active 750
% 0.20/0.54 % --inst_solver_calls_frac 0.5
% 0.20/0.54 % --inst_passive_queue_type priority_queues
% 0.20/0.54 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.54 % --inst_passive_queues_freq [25;2]
% 0.20/0.54 % --inst_dismatching true
% 0.20/0.54 % --inst_eager_unprocessed_to_passive true
% 0.20/0.54 % --inst_prop_sim_given true
% 0.20/0.54 % --inst_prop_sim_new false
% 0.20/0.54 % --inst_orphan_elimination true
% 0.20/0.54 % --inst_learning_loop_flag true
% 0.20/0.54 % --inst_learning_start 3000
% 0.20/0.54 % --inst_learning_factor 2
% 0.20/0.54 % --inst_start_prop_sim_after_learn 3
% 0.20/0.54 % --inst_sel_renew solver
% 0.20/0.54 % --inst_lit_activity_flag true
% 0.20/0.54 % --inst_out_proof true
% 0.20/0.54
% 0.20/0.54 % ------ Resolution Options
% 0.20/0.54
% 0.20/0.54 % --resolution_flag true
% 0.20/0.54 % --res_lit_sel kbo_max
% 0.20/0.54 % --res_to_prop_solver none
% 0.20/0.54 % --res_prop_simpl_new false
% 0.20/0.54 % --res_prop_simpl_given false
% 0.20/0.54 % --res_passive_queue_type priority_queues
% 0.20/0.54 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.54 % --res_passive_queues_freq [15;5]
% 0.20/0.54 % --res_forward_subs full
% 0.20/0.54 % --res_backward_subs full
% 0.20/0.54 % --res_forward_subs_resolution true
% 0.20/0.54 % --res_backward_subs_resolution true
% 0.20/0.54 % --res_orphan_elimination false
% 0.20/0.54 % --res_time_limit 1000.
% 0.20/0.54 % --res_out_proof true
% 0.20/0.54 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_e9be38.s
% 0.20/0.54 % --modulo true
% 0.20/0.54
% 0.20/0.54 % ------ Combination Options
% 0.20/0.54
% 0.20/0.54 % --comb_res_mult 1000
% 0.20/0.54 % --comb_inst_mult 300
% 0.20/0.54 % ------
% 0.20/0.54
% 0.20/0.54 % ------ Parsing...% successful
% 0.20/0.54
% 0.20/0.54 % ------ 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.54
% 0.20/0.54 % ------ Proving...
% 0.20/0.54 % ------ Problem Properties
% 0.20/0.54
% 0.20/0.54 %
% 0.20/0.54 % EPR false
% 0.20/0.54 % Horn false
% 0.20/0.54 % Has equality true
% 0.20/0.54
% 0.20/0.54 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.54
% 0.20/0.54
% 0.20/0.54 Compiling...
% 0.20/0.54 Loading plugin: done.
% 0.20/0.54 % % ------ Current options:
% 0.20/0.54
% 0.20/0.54 % ------ Input Options
% 0.20/0.54
% 0.20/0.54 % --out_options all
% 0.20/0.54 % --tptp_safe_out true
% 0.20/0.54 % --problem_path ""
% 0.20/0.54 % --include_path ""
% 0.20/0.54 % --clausifier .//eprover
% 0.20/0.54 % --clausifier_options --tstp-format
% 0.20/0.54 % --stdin false
% 0.20/0.54 % --dbg_backtrace false
% 0.20/0.54 % --dbg_dump_prop_clauses false
% 0.20/0.54 % --dbg_dump_prop_clauses_file -
% 0.20/0.54 % --dbg_out_stat false
% 0.20/0.54
% 0.20/0.54 % ------ General Options
% 0.20/0.54
% 0.20/0.54 % --fof false
% 0.20/0.54 % --time_out_real 150.
% 0.20/0.54 % --time_out_prep_mult 0.2
% 0.20/0.54 % --time_out_virtual -1.
% 0.20/0.54 % --schedule none
% 0.20/0.54 % --ground_splitting input
% 0.20/0.54 % --splitting_nvd 16
% 0.20/0.54 % --non_eq_to_eq false
% 0.20/0.54 % --prep_gs_sim true
% 0.20/0.54 % --prep_unflatten false
% 0.20/0.54 % --prep_res_sim true
% 0.20/0.54 % --prep_upred true
% 0.20/0.54 % --res_sim_input true
% 0.20/0.54 % --clause_weak_htbl true
% 0.20/0.54 % --gc_record_bc_elim false
% 0.20/0.54 % --symbol_type_check false
% 0.20/0.54 % --clausify_out false
% 0.20/0.54 % --large_theory_mode false
% 0.20/0.54 % --prep_sem_filter none
% 0.20/0.54 % --prep_sem_filter_out false
% 0.20/0.54 % --preprocessed_out false
% 0.20/0.54 % --sub_typing false
% 0.20/0.54 % --brand_transform false
% 0.20/0.54 % --pure_diseq_elim true
% 0.20/0.54 % --min_unsat_core false
% 0.20/0.54 % --pred_elim true
% 0.20/0.54 % --add_important_lit false
% 0.20/0.54 % --soft_assumptions false
% 0.20/0.54 % --reset_solvers false
% 0.20/0.54 % --bc_imp_inh []
% 0.20/0.54 % --conj_cone_tolerance 1.5
% 0.20/0.54 % --prolific_symb_bound 500
% 0.20/0.54 % --lt_threshold 2000
% 0.20/0.54
% 0.20/0.54 % ------ SAT Options
% 0.20/0.54
% 0.20/0.54 % --sat_mode false
% 0.20/0.54 % --sat_fm_restart_options ""
% 0.20/0.54 % --sat_gr_def false
% 0.20/0.54 % --sat_epr_types true
% 0.20/0.54 % --sat_non_cyclic_types false
% 0.20/0.54 % --sat_finite_models false
% 0.20/0.54 % --sat_fm_lemmas false
% 0.20/0.54 % --sat_fm_prep false
% 0.20/0.54 % --sat_fm_uc_incr true
% 0.20/0.54 % --sat_out_model small
% 0.20/0.54 % --sat_out_clauses false
% 0.20/0.54
% 0.20/0.54 % ------ QBF Options
% 0.20/0.54
% 0.20/0.54 % --qbf_mode false
% 0.20/0.54 % --qbf_elim_univ true
% 0.20/0.54 % --qbf_sk_in true
% 0.20/0.54 % --qbf_pred_elim true
% 0.20/0.54 % --qbf_split 32
% 0.20/0.54
% 0.20/0.54 % ------ BMC1 Options
% 0.20/0.54
% 0.20/0.54 % --bmc1_incremental false
% 0.20/0.54 % --bmc1_axioms reachable_all
% 0.20/0.54 % --bmc1_min_bound 0
% 0.20/0.54 % --bmc1_max_bound -1
% 0.20/0.54 % --bmc1_max_bound_default -1
% 0.20/0.54 % --bmc1_symbol_reachability true
% 0.20/0.54 % --bmc1_property_lemmas false
% 0.20/0.54 % --bmc1_k_induction false
% 0.20/0.54 % --bmc1_non_equiv_states false
% 0.20/0.54 % --bmc1_deadlock false
% 0.20/0.54 % --bmc1_ucm false
% 0.20/0.54 % --bmc1_add_unsat_core none
% 0.20/0.54 % --bmc1_unsat_core_children false
% 0.20/0.54 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.54 % --bmc1_out_stat full
% 0.20/0.54 % --bmc1_ground_init false
% 0.20/0.54 % --bmc1_pre_inst_next_state false
% 0.20/0.54 % --bmc1_pre_inst_state false
% 0.20/0.54 % --bmc1_pre_inst_reach_state false
% 0.20/0.54 % --bmc1_out_unsat_core false
% 0.20/0.54 % --bmc1_aig_witness_out false
% 0.20/0.54 % --bmc1_verbose false
% 0.20/0.54 % --bmc1_dump_clauses_tptp false
% 0.20/0.54 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.54 % --bmc1_dump_file -
% 0.20/0.54 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.54 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.54 % --bmc1_ucm_extend_mode 1
% 0.20/0.54 % --bmc1_ucm_init_mode 2
% 0.20/0.54 % --bmc1_ucm_cone_mode none
% 0.20/0.54 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.54 % --bmc1_ucm_relax_model 4
% 0.20/0.54 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.54 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.54 % --bmc1_ucm_layered_model none
% 0.20/0.54 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.54
% 0.20/0.54 % ------ AIG Options
% 0.20/0.54
% 0.20/0.54 % --aig_mode false
% 0.20/0.54
% 0.20/0.54 % ------ Instantiation Options
% 0.20/0.54
% 0.20/0.54 % --instantiation_flag true
% 0.20/0.54 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.54 % --inst_solver_per_active 750
% 0.20/0.54 % --inst_solver_calls_frac 0.5
% 0.20/0.54 % --inst_passive_queue_type priority_queues
% 0.20/0.54 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.54 % --inst_passive_queues_freq [25;2]
% 0.20/0.54 % --inst_dismatching true
% 0.20/0.54 % --inst_eager_unprocessed_to_passive true
% 150.26/150.44 % --inst_prop_sim_given true
% 150.26/150.44 % --inst_prop_sim_new false
% 150.26/150.44 % --inst_orphan_elimination true
% 150.26/150.44 % --inst_learning_loop_flag true
% 150.26/150.44 % --inst_learning_start 3000
% 150.26/150.44 % --inst_learning_factor 2
% 150.26/150.44 % --inst_start_prop_sim_after_learn 3
% 150.26/150.44 % --inst_sel_renew solver
% 150.26/150.44 % --inst_lit_activity_flag true
% 150.26/150.44 % --inst_out_proof true
% 150.26/150.44
% 150.26/150.44 % ------ Resolution Options
% 150.26/150.44
% 150.26/150.44 % --resolution_flag true
% 150.26/150.44 % --res_lit_sel kbo_max
% 150.26/150.44 % --res_to_prop_solver none
% 150.26/150.44 % --res_prop_simpl_new false
% 150.26/150.44 % --res_prop_simpl_given false
% 150.26/150.44 % --res_passive_queue_type priority_queues
% 150.26/150.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.26/150.44 % --res_passive_queues_freq [15;5]
% 150.26/150.44 % --res_forward_subs full
% 150.26/150.44 % --res_backward_subs full
% 150.26/150.44 % --res_forward_subs_resolution true
% 150.26/150.44 % --res_backward_subs_resolution true
% 150.26/150.44 % --res_orphan_elimination false
% 150.26/150.44 % --res_time_limit 1000.
% 150.26/150.44 % --res_out_proof true
% 150.26/150.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_e9be38.s
% 150.26/150.44 % --modulo true
% 150.26/150.44
% 150.26/150.44 % ------ Combination Options
% 150.26/150.44
% 150.26/150.44 % --comb_res_mult 1000
% 150.26/150.44 % --comb_inst_mult 300
% 150.26/150.44 % ------
% 150.26/150.44
% 150.26/150.44
% 150.26/150.44
% 150.26/150.44 % ------ Proving...
% 150.26/150.44 %
% 150.26/150.44
% 150.26/150.44
% 150.26/150.44 % Time Out Real
% 150.26/150.44
% 150.26/150.44 % ------ Statistics
% 150.26/150.44
% 150.26/150.44 % ------ General
% 150.26/150.44
% 150.26/150.44 % num_of_input_clauses: 40
% 150.26/150.44 % num_of_input_neg_conjectures: 5
% 150.26/150.44 % num_of_splits: 0
% 150.26/150.44 % num_of_split_atoms: 0
% 150.26/150.44 % num_of_sem_filtered_clauses: 0
% 150.26/150.44 % num_of_subtypes: 0
% 150.26/150.44 % monotx_restored_types: 0
% 150.26/150.44 % sat_num_of_epr_types: 0
% 150.26/150.44 % sat_num_of_non_cyclic_types: 0
% 150.26/150.44 % sat_guarded_non_collapsed_types: 0
% 150.26/150.44 % is_epr: 0
% 150.26/150.44 % is_horn: 0
% 150.26/150.44 % has_eq: 1
% 150.26/150.44 % num_pure_diseq_elim: 0
% 150.26/150.44 % simp_replaced_by: 0
% 150.26/150.44 % res_preprocessed: 10
% 150.26/150.44 % prep_upred: 0
% 150.26/150.44 % prep_unflattend: 0
% 150.26/150.44 % pred_elim_cands: 0
% 150.26/150.44 % pred_elim: 0
% 150.26/150.44 % pred_elim_cl: 0
% 150.26/150.44 % pred_elim_cycles: 0
% 150.26/150.44 % forced_gc_time: 0
% 150.26/150.44 % gc_basic_clause_elim: 0
% 150.26/150.44 % parsing_time: 0.001
% 150.26/150.44 % sem_filter_time: 0.
% 150.26/150.44 % pred_elim_time: 0.
% 150.26/150.44 % out_proof_time: 0.
% 150.26/150.44 % monotx_time: 0.
% 150.26/150.44 % subtype_inf_time: 0.
% 150.26/150.44 % unif_index_cands_time: 0.025
% 150.26/150.44 % unif_index_add_time: 0.284
% 150.26/150.44 % total_time: 150.018
% 150.26/150.44 % num_of_symbols: 41
% 150.26/150.44 % num_of_terms: 68821
% 150.26/150.44
% 150.26/150.44 % ------ Propositional Solver
% 150.26/150.44
% 150.26/150.44 % prop_solver_calls: 24
% 150.26/150.44 % prop_fast_solver_calls: 15
% 150.26/150.44 % prop_num_of_clauses: 10304
% 150.26/150.44 % prop_preprocess_simplified: 13953
% 150.26/150.44 % prop_fo_subsumed: 0
% 150.26/150.44 % prop_solver_time: 0.007
% 150.26/150.44 % prop_fast_solver_time: 0.
% 150.26/150.44 % prop_unsat_core_time: 0.
% 150.26/150.44
% 150.26/150.44 % ------ QBF
% 150.26/150.44
% 150.26/150.44 % qbf_q_res: 0
% 150.26/150.44 % qbf_num_tautologies: 0
% 150.26/150.44 % qbf_prep_cycles: 0
% 150.26/150.44
% 150.26/150.44 % ------ BMC1
% 150.26/150.44
% 150.26/150.44 % bmc1_current_bound: -1
% 150.26/150.44 % bmc1_last_solved_bound: -1
% 150.26/150.44 % bmc1_unsat_core_size: -1
% 150.26/150.44 % bmc1_unsat_core_parents_size: -1
% 150.26/150.44 % bmc1_merge_next_fun: 0
% 150.26/150.44 % bmc1_unsat_core_clauses_time: 0.
% 150.26/150.44
% 150.26/150.44 % ------ Instantiation
% 150.26/150.44
% 150.26/150.44 % inst_num_of_clauses: 1163
% 150.26/150.44 % inst_num_in_passive: 526
% 150.26/150.44 % inst_num_in_active: 556
% 150.26/150.44 % inst_num_in_unprocessed: 45
% 150.26/150.44 % inst_num_of_loops: 599
% 150.26/150.44 % inst_num_of_learning_restarts: 1
% 150.26/150.44 % inst_num_moves_active_passive: 6
% 150.26/150.44 % inst_lit_activity: 261
% 150.26/150.44 % inst_lit_activity_moves: 0
% 150.26/150.44 % inst_num_tautologies: 36
% 150.26/150.44 % inst_num_prop_implied: 0
% 150.26/150.44 % inst_num_existing_simplified: 0
% 150.26/150.44 % inst_num_eq_res_simplified: 0
% 150.26/150.44 % inst_num_child_elim: 0
% 150.26/150.44 % inst_num_of_dismatching_blockings: 451
% 150.26/150.44 % inst_num_of_non_proper_insts: 1378
% 150.26/150.44 % inst_num_of_duplicates: 377
% 150.26/150.44 % inst_inst_num_from_inst_to_res: 0
% 150.26/150.44 % inst_dismatching_checking_time: 0.028
% 150.26/150.44
% 150.26/150.44 % ------ Resolution
% 150.26/150.44
% 150.26/150.44 % res_num_of_clauses: 4567
% 150.26/150.44 % res_num_in_passive: 253
% 150.26/150.44 % res_num_in_active: 4300
% 150.26/150.44 % res_num_of_loops: 12649
% 150.26/150.44 % res_forward_subset_subsumed: 5
% 150.26/150.44 % res_backward_subset_subsumed: 0
% 150.26/150.44 % res_forward_subsumed: 8376
% 150.26/150.44 % res_backward_subsumed: 0
% 150.26/150.44 % res_forward_subsumption_resolution: 1
% 150.26/150.44 % res_backward_subsumption_resolution: 0
% 150.26/150.44 % res_clause_to_clause_subsumption: 12384
% 150.26/150.44 % res_orphan_elimination: 0
% 150.26/150.44 % res_tautology_del: 0
% 150.26/150.44 % res_num_eq_res_simplified: 0
% 150.26/150.44 % res_num_sel_changes: 0
% 150.26/150.44 % res_moves_from_active_to_pass: 0
% 150.26/150.44
% 150.26/150.44 % Status Unknown
% 150.26/150.48 % Orienting using strategy ClausalAll
% 150.26/150.48 % FOF problem with conjecture
% 150.26/150.48 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_e9be38.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_eeb7c6.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_c9979b | grep -v "SZS"
% 150.33/150.50
% 150.33/150.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.33/150.50
% 150.33/150.50 %
% 150.33/150.50 % ------ iProver source info
% 150.33/150.50
% 150.33/150.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.33/150.50 % git: non_committed_changes: true
% 150.33/150.50 % git: last_make_outside_of_git: true
% 150.33/150.50
% 150.33/150.50 %
% 150.33/150.50 % ------ Input Options
% 150.33/150.50
% 150.33/150.50 % --out_options all
% 150.33/150.50 % --tptp_safe_out true
% 150.33/150.50 % --problem_path ""
% 150.33/150.50 % --include_path ""
% 150.33/150.50 % --clausifier .//eprover
% 150.33/150.50 % --clausifier_options --tstp-format
% 150.33/150.50 % --stdin false
% 150.33/150.50 % --dbg_backtrace false
% 150.33/150.50 % --dbg_dump_prop_clauses false
% 150.33/150.50 % --dbg_dump_prop_clauses_file -
% 150.33/150.50 % --dbg_out_stat false
% 150.33/150.50
% 150.33/150.50 % ------ General Options
% 150.33/150.50
% 150.33/150.50 % --fof false
% 150.33/150.50 % --time_out_real 150.
% 150.33/150.50 % --time_out_prep_mult 0.2
% 150.33/150.50 % --time_out_virtual -1.
% 150.33/150.50 % --schedule none
% 150.33/150.50 % --ground_splitting input
% 150.33/150.50 % --splitting_nvd 16
% 150.33/150.50 % --non_eq_to_eq false
% 150.33/150.50 % --prep_gs_sim true
% 150.33/150.50 % --prep_unflatten false
% 150.33/150.50 % --prep_res_sim true
% 150.33/150.50 % --prep_upred true
% 150.33/150.50 % --res_sim_input true
% 150.33/150.50 % --clause_weak_htbl true
% 150.33/150.50 % --gc_record_bc_elim false
% 150.33/150.50 % --symbol_type_check false
% 150.33/150.50 % --clausify_out false
% 150.33/150.50 % --large_theory_mode false
% 150.33/150.50 % --prep_sem_filter none
% 150.33/150.50 % --prep_sem_filter_out false
% 150.33/150.50 % --preprocessed_out false
% 150.33/150.50 % --sub_typing false
% 150.33/150.50 % --brand_transform false
% 150.33/150.50 % --pure_diseq_elim true
% 150.33/150.50 % --min_unsat_core false
% 150.33/150.50 % --pred_elim true
% 150.33/150.50 % --add_important_lit false
% 150.33/150.50 % --soft_assumptions false
% 150.33/150.50 % --reset_solvers false
% 150.33/150.50 % --bc_imp_inh []
% 150.33/150.50 % --conj_cone_tolerance 1.5
% 150.33/150.50 % --prolific_symb_bound 500
% 150.33/150.50 % --lt_threshold 2000
% 150.33/150.50
% 150.33/150.50 % ------ SAT Options
% 150.33/150.50
% 150.33/150.50 % --sat_mode false
% 150.33/150.50 % --sat_fm_restart_options ""
% 150.33/150.50 % --sat_gr_def false
% 150.33/150.50 % --sat_epr_types true
% 150.33/150.50 % --sat_non_cyclic_types false
% 150.33/150.50 % --sat_finite_models false
% 150.33/150.50 % --sat_fm_lemmas false
% 150.33/150.50 % --sat_fm_prep false
% 150.33/150.50 % --sat_fm_uc_incr true
% 150.33/150.50 % --sat_out_model small
% 150.33/150.50 % --sat_out_clauses false
% 150.33/150.50
% 150.33/150.50 % ------ QBF Options
% 150.33/150.50
% 150.33/150.50 % --qbf_mode false
% 150.33/150.50 % --qbf_elim_univ true
% 150.33/150.50 % --qbf_sk_in true
% 150.33/150.50 % --qbf_pred_elim true
% 150.33/150.50 % --qbf_split 32
% 150.33/150.50
% 150.33/150.50 % ------ BMC1 Options
% 150.33/150.50
% 150.33/150.50 % --bmc1_incremental false
% 150.33/150.50 % --bmc1_axioms reachable_all
% 150.33/150.50 % --bmc1_min_bound 0
% 150.33/150.50 % --bmc1_max_bound -1
% 150.33/150.50 % --bmc1_max_bound_default -1
% 150.33/150.50 % --bmc1_symbol_reachability true
% 150.33/150.50 % --bmc1_property_lemmas false
% 150.33/150.50 % --bmc1_k_induction false
% 150.33/150.50 % --bmc1_non_equiv_states false
% 150.33/150.50 % --bmc1_deadlock false
% 150.33/150.50 % --bmc1_ucm false
% 150.33/150.50 % --bmc1_add_unsat_core none
% 150.33/150.50 % --bmc1_unsat_core_children false
% 150.33/150.50 % --bmc1_unsat_core_extrapolate_axioms false
% 150.33/150.50 % --bmc1_out_stat full
% 150.33/150.50 % --bmc1_ground_init false
% 150.33/150.50 % --bmc1_pre_inst_next_state false
% 150.33/150.50 % --bmc1_pre_inst_state false
% 150.33/150.50 % --bmc1_pre_inst_reach_state false
% 150.33/150.50 % --bmc1_out_unsat_core false
% 150.33/150.50 % --bmc1_aig_witness_out false
% 150.33/150.50 % --bmc1_verbose false
% 150.33/150.50 % --bmc1_dump_clauses_tptp false
% 150.37/150.60 % --bmc1_dump_unsat_core_tptp false
% 150.37/150.60 % --bmc1_dump_file -
% 150.37/150.60 % --bmc1_ucm_expand_uc_limit 128
% 150.37/150.60 % --bmc1_ucm_n_expand_iterations 6
% 150.37/150.60 % --bmc1_ucm_extend_mode 1
% 150.37/150.60 % --bmc1_ucm_init_mode 2
% 150.37/150.60 % --bmc1_ucm_cone_mode none
% 150.37/150.60 % --bmc1_ucm_reduced_relation_type 0
% 150.37/150.60 % --bmc1_ucm_relax_model 4
% 150.37/150.60 % --bmc1_ucm_full_tr_after_sat true
% 150.37/150.60 % --bmc1_ucm_expand_neg_assumptions false
% 150.37/150.60 % --bmc1_ucm_layered_model none
% 150.37/150.60 % --bmc1_ucm_max_lemma_size 10
% 150.37/150.60
% 150.37/150.60 % ------ AIG Options
% 150.37/150.60
% 150.37/150.60 % --aig_mode false
% 150.37/150.60
% 150.37/150.60 % ------ Instantiation Options
% 150.37/150.60
% 150.37/150.60 % --instantiation_flag true
% 150.37/150.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.37/150.60 % --inst_solver_per_active 750
% 150.37/150.60 % --inst_solver_calls_frac 0.5
% 150.37/150.60 % --inst_passive_queue_type priority_queues
% 150.37/150.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.37/150.60 % --inst_passive_queues_freq [25;2]
% 150.37/150.60 % --inst_dismatching true
% 150.37/150.60 % --inst_eager_unprocessed_to_passive true
% 150.37/150.60 % --inst_prop_sim_given true
% 150.37/150.60 % --inst_prop_sim_new false
% 150.37/150.60 % --inst_orphan_elimination true
% 150.37/150.60 % --inst_learning_loop_flag true
% 150.37/150.60 % --inst_learning_start 3000
% 150.37/150.60 % --inst_learning_factor 2
% 150.37/150.60 % --inst_start_prop_sim_after_learn 3
% 150.37/150.60 % --inst_sel_renew solver
% 150.37/150.60 % --inst_lit_activity_flag true
% 150.37/150.60 % --inst_out_proof true
% 150.37/150.60
% 150.37/150.60 % ------ Resolution Options
% 150.37/150.60
% 150.37/150.60 % --resolution_flag true
% 150.37/150.60 % --res_lit_sel kbo_max
% 150.37/150.60 % --res_to_prop_solver none
% 150.37/150.60 % --res_prop_simpl_new false
% 150.37/150.60 % --res_prop_simpl_given false
% 150.37/150.60 % --res_passive_queue_type priority_queues
% 150.37/150.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.37/150.60 % --res_passive_queues_freq [15;5]
% 150.37/150.60 % --res_forward_subs full
% 150.37/150.60 % --res_backward_subs full
% 150.37/150.60 % --res_forward_subs_resolution true
% 150.37/150.60 % --res_backward_subs_resolution true
% 150.37/150.60 % --res_orphan_elimination false
% 150.37/150.60 % --res_time_limit 1000.
% 150.37/150.60 % --res_out_proof true
% 150.37/150.60 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_e9be38.s
% 150.37/150.60 % --modulo true
% 150.37/150.60
% 150.37/150.60 % ------ Combination Options
% 150.37/150.60
% 150.37/150.60 % --comb_res_mult 1000
% 150.37/150.60 % --comb_inst_mult 300
% 150.37/150.60 % ------
% 150.37/150.60
% 150.37/150.60 % ------ Parsing...% successful
% 150.37/150.60
% 150.37/150.60 % ------ 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 %
% 150.37/150.60
% 150.37/150.60 % ------ Proving...
% 150.37/150.60 % ------ Problem Properties
% 150.37/150.60
% 150.37/150.60 %
% 150.37/150.60 % EPR false
% 150.37/150.60 % Horn false
% 150.37/150.60 % Has equality true
% 150.37/150.60
% 150.37/150.60 % % ------ Input Options Time Limit: Unbounded
% 150.37/150.60
% 150.37/150.60
% 150.37/150.60 Compiling...
% 150.37/150.60 Loading plugin: done.
% 150.37/150.60 % % ------ Current options:
% 150.37/150.60
% 150.37/150.60 % ------ Input Options
% 150.37/150.60
% 150.37/150.60 % --out_options all
% 150.37/150.60 % --tptp_safe_out true
% 150.37/150.60 % --problem_path ""
% 150.37/150.60 % --include_path ""
% 150.37/150.60 % --clausifier .//eprover
% 150.37/150.60 % --clausifier_options --tstp-format
% 150.37/150.60 % --stdin false
% 150.37/150.60 % --dbg_backtrace false
% 150.37/150.60 % --dbg_dump_prop_clauses false
% 150.37/150.60 % --dbg_dump_prop_clauses_file -
% 150.37/150.60 % --dbg_out_stat false
% 150.37/150.60
% 150.37/150.60 % ------ General Options
% 150.37/150.60
% 150.37/150.60 % --fof false
% 150.37/150.60 % --time_out_real 150.
% 150.37/150.60 % --time_out_prep_mult 0.2
% 150.37/150.60 % --time_out_virtual -1.
% 150.37/150.60 % --schedule none
% 150.37/150.60 % --ground_splitting input
% 150.37/150.60 % --splitting_nvd 16
% 150.37/150.60 % --non_eq_to_eq false
% 150.37/150.60 % --prep_gs_sim true
% 150.37/150.60 % --prep_unflatten false
% 150.37/150.60 % --prep_res_sim true
% 150.37/150.60 % --prep_upred true
% 150.37/150.60 % --res_sim_input true
% 150.37/150.60 % --clause_weak_htbl true
% 150.37/150.60 % --gc_record_bc_elim false
% 150.37/150.60 % --symbol_type_check false
% 150.37/150.60 % --clausify_out false
% 150.37/150.60 % --large_theory_mode false
% 150.37/150.60 % --prep_sem_filter none
% 150.37/150.60 % --prep_sem_filter_out false
% 150.37/150.60 % --preprocessed_out false
% 150.37/150.60 % --sub_typing false
% 150.37/150.60 % --brand_transform false
% 150.37/150.60 % --pure_diseq_elim true
% 150.37/150.60 % --min_unsat_core false
% 150.37/150.60 % --pred_elim true
% 150.37/150.60 % --add_important_lit false
% 150.37/150.60 % --soft_assumptions false
% 150.37/150.60 % --reset_solvers false
% 150.37/150.60 % --bc_imp_inh []
% 150.37/150.60 % --conj_cone_tolerance 1.5
% 150.37/150.60 % --prolific_symb_bound 500
% 150.37/150.60 % --lt_threshold 2000
% 150.37/150.60
% 150.37/150.60 % ------ SAT Options
% 150.37/150.60
% 150.37/150.60 % --sat_mode false
% 150.37/150.60 % --sat_fm_restart_options ""
% 150.37/150.60 % --sat_gr_def false
% 150.37/150.60 % --sat_epr_types true
% 150.37/150.60 % --sat_non_cyclic_types false
% 150.37/150.60 % --sat_finite_models false
% 150.37/150.60 % --sat_fm_lemmas false
% 150.37/150.60 % --sat_fm_prep false
% 150.37/150.60 % --sat_fm_uc_incr true
% 150.37/150.60 % --sat_out_model small
% 150.37/150.60 % --sat_out_clauses false
% 150.37/150.60
% 150.37/150.60 % ------ QBF Options
% 150.37/150.60
% 150.37/150.60 % --qbf_mode false
% 150.37/150.60 % --qbf_elim_univ true
% 150.37/150.60 % --qbf_sk_in true
% 150.37/150.60 % --qbf_pred_elim true
% 150.37/150.60 % --qbf_split 32
% 150.37/150.60
% 150.37/150.60 % ------ BMC1 Options
% 150.37/150.60
% 150.37/150.60 % --bmc1_incremental false
% 150.37/150.60 % --bmc1_axioms reachable_all
% 150.37/150.60 % --bmc1_min_bound 0
% 150.37/150.60 % --bmc1_max_bound -1
% 150.37/150.60 % --bmc1_max_bound_default -1
% 150.37/150.60 % --bmc1_symbol_reachability true
% 150.37/150.60 % --bmc1_property_lemmas false
% 150.37/150.60 % --bmc1_k_induction false
% 150.37/150.60 % --bmc1_non_equiv_states false
% 150.37/150.60 % --bmc1_deadlock false
% 150.37/150.60 % --bmc1_ucm false
% 150.37/150.60 % --bmc1_add_unsat_core none
% 150.37/150.60 % --bmc1_unsat_core_children false
% 150.37/150.60 % --bmc1_unsat_core_extrapolate_axioms false
% 150.37/150.60 % --bmc1_out_stat full
% 150.37/150.60 % --bmc1_ground_init false
% 150.37/150.60 % --bmc1_pre_inst_next_state false
% 150.37/150.60 % --bmc1_pre_inst_state false
% 150.37/150.60 % --bmc1_pre_inst_reach_state false
% 150.37/150.60 % --bmc1_out_unsat_core false
% 150.37/150.60 % --bmc1_aig_witness_out false
% 150.37/150.60 % --bmc1_verbose false
% 150.37/150.60 % --bmc1_dump_clauses_tptp false
% 150.37/150.60 % --bmc1_dump_unsat_core_tptp false
% 150.37/150.60 % --bmc1_dump_file -
% 150.37/150.60 % --bmc1_ucm_expand_uc_limit 128
% 150.37/150.60 % --bmc1_ucm_n_expand_iterations 6
% 150.37/150.60 % --bmc1_ucm_extend_mode 1
% 150.37/150.60 % --bmc1_ucm_init_mode 2
% 150.37/150.60 % --bmc1_ucm_cone_mode none
% 150.37/150.60 % --bmc1_ucm_reduced_relation_type 0
% 150.37/150.60 % --bmc1_ucm_relax_model 4
% 150.37/150.60 % --bmc1_ucm_full_tr_after_sat true
% 150.37/150.60 % --bmc1_ucm_expand_neg_assumptions false
% 150.37/150.60 % --bmc1_ucm_layered_model none
% 150.37/150.60 % --bmc1_ucm_max_lemma_size 10
% 150.37/150.60
% 150.37/150.60 % ------ AIG Options
% 150.37/150.60
% 150.37/150.60 % --aig_mode false
% 150.37/150.60
% 150.37/150.60 % ------ Instantiation Options
% 150.37/150.60
% 150.37/150.60 % --instantiation_flag true
% 150.37/150.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.37/150.60 % --inst_solver_per_active 750
% 150.37/150.60 % --inst_solver_calls_frac 0.5
% 150.37/150.60 % --inst_passive_queue_type priority_queues
% 150.37/150.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.37/150.60 % --inst_passive_queues_freq [25;2]
% 150.37/150.60 % --inst_dismatching true
% 150.37/150.60 % --inst_eager_unprocessed_to_passive true
% 151.78/152.04 % --inst_prop_sim_given true
% 151.78/152.04 % --inst_prop_sim_new false
% 151.78/152.04 % --inst_orphan_elimination true
% 151.78/152.04 % --inst_learning_loop_flag true
% 151.78/152.04 % --inst_learning_start 3000
% 151.78/152.04 % --inst_learning_factor 2
% 151.78/152.04 % --inst_start_prop_sim_after_learn 3
% 151.78/152.04 % --inst_sel_renew solver
% 151.78/152.04 % --inst_lit_activity_flag true
% 151.78/152.04 % --inst_out_proof true
% 151.78/152.04
% 151.78/152.04 % ------ Resolution Options
% 151.78/152.04
% 151.78/152.04 % --resolution_flag true
% 151.78/152.04 % --res_lit_sel kbo_max
% 151.78/152.04 % --res_to_prop_solver none
% 151.78/152.04 % --res_prop_simpl_new false
% 151.78/152.04 % --res_prop_simpl_given false
% 151.78/152.04 % --res_passive_queue_type priority_queues
% 151.78/152.04 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 151.78/152.04 % --res_passive_queues_freq [15;5]
% 151.78/152.04 % --res_forward_subs full
% 151.78/152.04 % --res_backward_subs full
% 151.78/152.04 % --res_forward_subs_resolution true
% 151.78/152.04 % --res_backward_subs_resolution true
% 151.78/152.04 % --res_orphan_elimination false
% 151.78/152.04 % --res_time_limit 1000.
% 151.78/152.04 % --res_out_proof true
% 151.78/152.04 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_e9be38.s
% 151.78/152.04 % --modulo true
% 151.78/152.04
% 151.78/152.04 % ------ Combination Options
% 151.78/152.04
% 151.78/152.04 % --comb_res_mult 1000
% 151.78/152.04 % --comb_inst_mult 300
% 151.78/152.04 % ------
% 151.78/152.04
% 151.78/152.04
% 151.78/152.04
% 151.78/152.04 % ------ Proving...
% 151.78/152.04 %
% 151.78/152.04
% 151.78/152.04
% 151.78/152.04 % ------ Statistics
% 151.78/152.04
% 151.78/152.04 % ------ General
% 151.78/152.04
% 151.78/152.04 % num_of_input_clauses: 69
% 151.78/152.04 % num_of_input_neg_conjectures: 5
% 151.78/152.04 % num_of_splits: 0
% 151.78/152.04 % num_of_split_atoms: 0
% 151.78/152.04 % num_of_sem_filtered_clauses: 0
% 151.78/152.04 % num_of_subtypes: 0
% 151.78/152.04 % monotx_restored_types: 0
% 151.78/152.04 % sat_num_of_epr_types: 0
% 151.78/152.04 % sat_num_of_non_cyclic_types: 0
% 151.78/152.04 % sat_guarded_non_collapsed_types: 0
% 151.78/152.04 % is_epr: 0
% 151.78/152.04 % is_horn: 0
% 151.78/152.04 % has_eq: 1
% 151.78/152.04 % num_pure_diseq_elim: 0
% 151.78/152.04 % simp_replaced_by: 0
% 151.78/152.04 % res_preprocessed: 10
% 151.78/152.04 % prep_upred: 0
% 151.78/152.04 % prep_unflattend: 0
% 151.78/152.04 % pred_elim_cands: 0
% 151.78/152.04 % pred_elim: 0
% 151.78/152.04 % pred_elim_cl: 0
% 151.78/152.04 % pred_elim_cycles: 0
% 151.78/152.04 % forced_gc_time: 0
% 151.78/152.04 % gc_basic_clause_elim: 0
% 151.78/152.04 % parsing_time: 0.
% 151.78/152.04 % sem_filter_time: 0.
% 151.78/152.04 % pred_elim_time: 0.
% 151.78/152.04 % out_proof_time: 0.
% 151.78/152.04 % monotx_time: 0.
% 151.78/152.04 % subtype_inf_time: 0.
% 151.78/152.04 % unif_index_cands_time: 0.
% 151.78/152.04 % unif_index_add_time: 0.006
% 151.78/152.04 % total_time: 1.55
% 151.78/152.04 % num_of_symbols: 41
% 151.78/152.04 % num_of_terms: 3391
% 151.78/152.04
% 151.78/152.04 % ------ Propositional Solver
% 151.78/152.04
% 151.78/152.04 % prop_solver_calls: 7
% 151.78/152.04 % prop_fast_solver_calls: 15
% 151.78/152.04 % prop_num_of_clauses: 480
% 151.78/152.04 % prop_preprocess_simplified: 906
% 151.78/152.04 % prop_fo_subsumed: 0
% 151.78/152.04 % prop_solver_time: 0.
% 151.78/152.04 % prop_fast_solver_time: 0.
% 151.78/152.04 % prop_unsat_core_time: 0.
% 151.78/152.04
% 151.78/152.04 % ------ QBF
% 151.78/152.04
% 151.78/152.04 % qbf_q_res: 0
% 151.78/152.04 % qbf_num_tautologies: 0
% 151.78/152.04 % qbf_prep_cycles: 0
% 151.78/152.04
% 151.78/152.04 % ------ BMC1
% 151.78/152.04
% 151.78/152.04 % bmc1_current_bound: -1
% 151.78/152.04 % bmc1_last_solved_bound: -1
% 151.78/152.04 % bmc1_unsat_core_size: -1
% 151.78/152.04 % bmc1_unsat_core_parents_size: -1
% 151.78/152.04 % bmc1_merge_next_fun: 0
% 151.78/152.04 % bmc1_unsat_core_clauses_time: 0.
% 151.78/152.04
% 151.78/152.04 % ------ Instantiation
% 151.78/152.04
% 151.78/152.04 % inst_num_of_clauses: 376
% 151.78/152.04 % inst_num_in_passive: 152
% 151.78/152.04 % inst_num_in_active: 204
% 151.78/152.04 % inst_num_in_unprocessed: 18
% 151.78/152.04 % inst_num_of_loops: 210
% 151.78/152.04 % inst_num_of_learning_restarts: 0
% 151.78/152.04 % inst_num_moves_active_passive: 3
% 151.78/152.04 % inst_lit_activity: 108
% 151.78/152.04 % inst_lit_activity_moves: 0
% 151.78/152.04 % inst_num_tautologies: 0
% 151.78/152.04 % inst_num_prop_implied: 0
% 151.78/152.04 % inst_num_existing_simplified: 0
% 151.78/152.04 % inst_num_eq_res_simplified: 0
% 151.78/152.04 % inst_num_child_elim: 0
% 151.78/152.04 % inst_num_of_dismatching_blockings: 27
% 151.78/152.04 % inst_num_of_non_proper_insts: 339
% 151.78/152.04 % inst_num_of_duplicates: 294
% 151.78/152.04 % inst_inst_num_from_inst_to_res: 0
% 151.78/152.04 % inst_dismatching_checking_time: 0.
% 151.78/152.04
% 151.78/152.04 % ------ Resolution
% 151.78/152.04
% 151.78/152.04 % res_num_of_clauses: 718
% 151.78/152.04 % res_num_in_passive: 10
% 151.78/152.04 % res_num_in_active: 675
% 151.78/152.04 % res_num_of_loops: 1000
% 151.78/152.04 % res_forward_subset_subsumed: 116
% 151.78/152.04 % res_backward_subset_subsumed: 90
% 151.78/152.04 % res_forward_subsumed: 363
% 151.78/152.04 % res_backward_subsumed: 0
% 151.78/152.04 % res_forward_subsumption_resolution: 90
% 151.78/152.04 % res_backward_subsumption_resolution: 0
% 151.78/152.04 % res_clause_to_clause_subsumption: 2080
% 151.78/152.04 % res_orphan_elimination: 0
% 151.78/152.04 % res_tautology_del: 1
% 151.78/152.04 % res_num_eq_res_simplified: 0
% 151.78/152.04 % res_num_sel_changes: 0
% 151.78/152.04 % res_moves_from_active_to_pass: 0
% 151.78/152.04
% 151.78/152.04 % Status Unsatisfiable
% 151.78/152.04 % SZS status Theorem
% 151.78/152.04 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------