%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 10:25:23 EDT 2022
% Result : Theorem 1.12s 1.32s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 92 ( 19 unt; 0 def)
% Number of atoms : 254 ( 45 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 282 ( 120 ~; 140 |; 10 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 196 ( 3 sgn 41 !; 2 ?)
% 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 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('<stdin>',d4_tarski) ).
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] : subset(X1,X1),
file('<stdin>',reflexivity_r1_tarski) ).
fof(c_0_4,axiom,
$true,
file('<stdin>',dt_k3_tarski) ).
fof(c_0_5,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
c_0_0 ).
fof(c_0_6,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
c_0_1 ).
fof(c_0_7,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_8,axiom,
! [X1,X2] : subset(X1,X1),
c_0_3 ).
fof(c_0_9,axiom,
$true,
c_0_4 ).
fof(c_0_10,plain,
! [X5,X6,X7,X9,X10,X11,X12,X14] :
( ( in(X7,esk2_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != union(X5) )
& ( in(esk2_3(X5,X6,X7),X5)
| ~ in(X7,X6)
| X6 != union(X5) )
& ( ~ in(X9,X10)
| ~ in(X10,X5)
| in(X9,X6)
| X6 != union(X5) )
& ( ~ in(esk3_2(X11,X12),X12)
| ~ in(esk3_2(X11,X12),X14)
| ~ in(X14,X11)
| X12 = union(X11) )
& ( in(esk3_2(X11,X12),esk4_2(X11,X12))
| in(esk3_2(X11,X12),X12)
| X12 = union(X11) )
& ( in(esk4_2(X11,X12),X11)
| in(esk3_2(X11,X12),X12)
| X12 = union(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk1_2(X7,X8),X7)
| subset(X7,X8) )
& ( ~ in(esk1_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_6])])])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_13,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_14,axiom,
$true,
c_0_9 ).
cnf(c_0_15,plain,
( X1 = union(X2)
| ~ in(X3,X2)
| ~ in(esk3_2(X2,X1),X3)
| ~ in(esk3_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( in(X3,esk2_3(X2,X1,X3))
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( in(esk2_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( X1 = union(X2)
| in(esk3_2(X2,X1),X1)
| in(esk3_2(X2,X1),esk4_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( X1 = union(X2)
| in(esk3_2(X2,X1),X1)
| in(esk4_2(X2,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
$true,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( X1 = union(X2)
| ~ in(X3,X2)
| ~ in(esk3_2(X2,X1),X3)
| ~ in(esk3_2(X2,X1),X1) ),
c_0_15,
[final] ).
cnf(c_0_28,plain,
( in(X3,esk2_3(X2,X1,X3))
| X1 != union(X2)
| ~ in(X3,X1) ),
c_0_16,
[final] ).
cnf(c_0_29,plain,
( in(esk2_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
c_0_17,
[final] ).
cnf(c_0_30,plain,
( X1 = union(X2)
| in(esk3_2(X2,X1),X1)
| in(esk3_2(X2,X1),esk4_2(X2,X1)) ),
c_0_18,
[final] ).
cnf(c_0_31,plain,
( X1 = union(X2)
| in(esk3_2(X2,X1),X1)
| in(esk4_2(X2,X1),X2) ),
c_0_19,
[final] ).
cnf(c_0_32,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
c_0_20,
[final] ).
cnf(c_0_33,plain,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
c_0_21,
[final] ).
cnf(c_0_34,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
c_0_22,
[final] ).
cnf(c_0_35,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
c_0_23,
[final] ).
cnf(c_0_36,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_24,
[final] ).
cnf(c_0_37,plain,
subset(X1,X1),
c_0_25,
[final] ).
cnf(c_0_38,plain,
$true,
c_0_26,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_27_0,axiom,
( X1 = union(X2)
| ~ in(X3,X2)
| ~ in(sk1_esk3_2(X2,X1),X3)
| ~ in(sk1_esk3_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( ~ in(X3,X2)
| X1 = union(X2)
| ~ in(sk1_esk3_2(X2,X1),X3)
| ~ in(sk1_esk3_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_2,axiom,
( ~ in(sk1_esk3_2(X2,X1),X3)
| ~ in(X3,X2)
| X1 = union(X2)
| ~ in(sk1_esk3_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_3,axiom,
( ~ in(sk1_esk3_2(X2,X1),X1)
| ~ in(sk1_esk3_2(X2,X1),X3)
| ~ in(X3,X2)
| X1 = union(X2) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_0,axiom,
( in(X3,sk1_esk2_3(X2,X1,X3))
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( X1 != union(X2)
| in(X3,sk1_esk2_3(X2,X1,X3))
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_2,axiom,
( ~ in(X3,X1)
| X1 != union(X2)
| in(X3,sk1_esk2_3(X2,X1,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( in(sk1_esk2_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( X1 != union(X2)
| in(sk1_esk2_3(X2,X1,X3),X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_2,axiom,
( ~ in(X3,X1)
| X1 != union(X2)
| in(sk1_esk2_3(X2,X1,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_30_0,axiom,
( X1 = union(X2)
| in(sk1_esk3_2(X2,X1),X1)
| in(sk1_esk3_2(X2,X1),sk1_esk4_2(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( in(sk1_esk3_2(X2,X1),X1)
| X1 = union(X2)
| in(sk1_esk3_2(X2,X1),sk1_esk4_2(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_2,axiom,
( in(sk1_esk3_2(X2,X1),sk1_esk4_2(X2,X1))
| in(sk1_esk3_2(X2,X1),X1)
| X1 = union(X2) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_31_0,axiom,
( X1 = union(X2)
| in(sk1_esk3_2(X2,X1),X1)
| in(sk1_esk4_2(X2,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_1,axiom,
( in(sk1_esk3_2(X2,X1),X1)
| X1 = union(X2)
| in(sk1_esk4_2(X2,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_2,axiom,
( in(sk1_esk4_2(X2,X1),X2)
| in(sk1_esk3_2(X2,X1),X1)
| X1 = union(X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_32_0,axiom,
( subset(X1,X2)
| ~ in(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( ~ in(sk1_esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( X1 != union(X2)
| in(X3,X1)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_2,axiom,
( ~ in(X4,X2)
| X1 != union(X2)
| in(X3,X1)
| ~ in(X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_3,axiom,
( ~ in(X3,X4)
| ~ in(X4,X2)
| X1 != union(X2)
| in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( ~ in(X1,X3)
| in(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_2,axiom,
( ~ subset(X3,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_35_0,axiom,
( subset(X1,X2)
| in(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_1,axiom,
( in(sk1_esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_36_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_37_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_38_0,axiom,
$true,
inference(literals_permutation,[status(thm)],[c_0_38]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('<stdin>',l50_zfmisc_1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( in(esk1_0,esk2_0)
& ~ subset(esk1_0,union(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,
~ subset(esk1_0,union(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
~ subset(esk1_0,union(esk2_0)),
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
in(esk1_0,esk2_0),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_9,plain,
( in(X0,X1)
| X1 != union(X2)
| ~ in(X3,X2)
| ~ in(X0,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p',c_0_33_3) ).
cnf(c_65,plain,
( in(X0,X1)
| X1 != union(X2)
| ~ in(X3,X2)
| ~ in(X0,X3) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_15416,plain,
( ~ in(sk2_esk1_0,sk2_esk2_0)
| ~ in(X0,sk2_esk1_0)
| in(X0,X1)
| X1 != union(sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_15504,plain,
( ~ in(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0)),sk2_esk1_0)
| in(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0)),X0)
| ~ in(sk2_esk1_0,sk2_esk2_0)
| X0 != union(sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_15416]) ).
cnf(c_15600,plain,
( in(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0)),union(sk2_esk2_0))
| ~ in(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0)),sk2_esk1_0)
| ~ in(sk2_esk1_0,sk2_esk2_0)
| union(sk2_esk2_0) != union(sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_15504]) ).
cnf(c_15748,plain,
( in(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0)),union(sk2_esk2_0))
| ~ in(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0)),sk2_esk1_0)
| ~ in(sk2_esk1_0,sk2_esk2_0) ),
inference(equality_resolution_simp,[status(esa)],[c_15600]) ).
cnf(c_13,plain,
( subset(X0,X1)
| ~ in(sk1_esk1_2(X0,X1),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p',c_0_32_1) ).
cnf(c_69,plain,
( subset(X0,X1)
| ~ in(sk1_esk1_2(X0,X1),X1) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_15410,plain,
( subset(sk2_esk1_0,union(sk2_esk2_0))
| ~ in(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0)),union(sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_4,plain,
( subset(X0,X1)
| in(sk1_esk1_2(X0,X1),X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p',c_0_35_1) ).
cnf(c_60,plain,
( subset(X0,X1)
| in(sk1_esk1_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_15408,plain,
( subset(sk2_esk1_0,union(sk2_esk2_0))
| in(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0)),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_31,negated_conjecture,
~ subset(sk2_esk1_0,union(sk2_esk2_0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p',c_0_5) ).
cnf(c_32,negated_conjecture,
in(sk2_esk1_0,sk2_esk2_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p',c_0_6) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_15748,c_15410,c_15408,c_31,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 11:58:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % FOF problem with conjecture
% 0.21/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_dbb0d8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_0c01ea | grep -v "SZS"
% 0.21/0.43
% 0.21/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ iProver source info
% 0.21/0.43
% 0.21/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.43 % git: non_committed_changes: true
% 0.21/0.43 % git: last_make_outside_of_git: true
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.43 % --inst_prop_sim_new false
% 0.21/0.43 % --inst_orphan_elimination true
% 0.21/0.43 % --inst_learning_loop_flag true
% 0.21/0.43 % --inst_learning_start 3000
% 0.21/0.43 % --inst_learning_factor 2
% 0.21/0.43 % --inst_start_prop_sim_after_learn 3
% 0.21/0.43 % --inst_sel_renew solver
% 0.21/0.43 % --inst_lit_activity_flag true
% 0.21/0.43 % --inst_out_proof true
% 0.21/0.43
% 0.21/0.43 % ------ Resolution Options
% 0.21/0.43
% 0.21/0.43 % --resolution_flag true
% 0.21/0.43 % --res_lit_sel kbo_max
% 0.21/0.43 % --res_to_prop_solver none
% 0.21/0.43 % --res_prop_simpl_new false
% 0.21/0.43 % --res_prop_simpl_given false
% 0.21/0.43 % --res_passive_queue_type priority_queues
% 0.21/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.43 % --res_passive_queues_freq [15;5]
% 0.21/0.43 % --res_forward_subs full
% 0.21/0.43 % --res_backward_subs full
% 0.21/0.43 % --res_forward_subs_resolution true
% 0.21/0.43 % --res_backward_subs_resolution true
% 0.21/0.43 % --res_orphan_elimination false
% 0.21/0.43 % --res_time_limit 1000.
% 0.21/0.43 % --res_out_proof true
% 0.21/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_dbb0d8.s
% 0.21/0.43 % --modulo true
% 0.21/0.43
% 0.21/0.43 % ------ Combination Options
% 0.21/0.43
% 0.21/0.43 % --comb_res_mult 1000
% 0.21/0.43 % --comb_inst_mult 300
% 0.21/0.43 % ------
% 0.21/0.43
% 0.21/0.43 % ------ Parsing...% successful
% 0.21/0.43
% 0.21/0.43 % ------ 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.21/0.43
% 0.21/0.43 % ------ Proving...
% 0.21/0.43 % ------ Problem Properties
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % EPR false
% 0.21/0.43 % Horn false
% 0.21/0.43 % Has equality true
% 0.21/0.43
% 0.21/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 % % ------ Current options:
% 0.21/0.43
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_dbb0d8.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % warning: shown sat in sat incomplete mode
% 0.21/0.44 %
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 cnf(c_13,negated_conjecture,
% 0.21/0.44 ( in(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_6) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_25,negated_conjecture,
% 0.21/0.44 ( in(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_13]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_32,negated_conjecture,
% 0.21/0.44 ( in(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_25]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_33,negated_conjecture,
% 0.21/0.44 ( in(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_32]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_36,negated_conjecture,
% 0.21/0.44 ( in(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_33]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_77,negated_conjecture,
% 0.21/0.44 ( in(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_36]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_2,plain,
% 0.21/0.44 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_42_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_55,plain,
% 0.21/0.44 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_2]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_81,plain,
% 0.21/0.44 ( ~ in(sk3_esk2_0,sk3_esk1_0) ),
% 0.21/0.44 inference(resolution,[status(thm)],[c_77,c_55]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_82,plain,
% 0.21/0.44 ( ~ in(sk3_esk2_0,sk3_esk1_0) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_81]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_10,plain,
% 0.21/0.44 ( ~ in(X0,X1) | in(X0,sk1_esk2_3(X1,X2,X0)) | X1 != union(X2) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_34_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_71,plain,
% 0.21/0.44 ( ~ in(X0,X1) | in(X0,sk1_esk2_3(X1,X2,X0)) | X1 != union(X2) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_10]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_72,plain,
% 0.21/0.44 ( in(X0,sk1_esk2_3(X1,X2,X0)) | ~ in(X0,X1) | X1 != union(X2) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_71]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_9,plain,
% 0.21/0.44 ( ~ in(X0,X1) | in(sk1_esk2_3(X1,X2,X0),X2) | X1 != union(X2) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_35_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_69,plain,
% 0.21/0.44 ( ~ in(X0,X1) | in(sk1_esk2_3(X1,X2,X0),X2) | X1 != union(X2) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_9]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_70,plain,
% 0.21/0.44 ( in(sk1_esk2_3(X0,X1,X2),X1) | ~ in(X2,X0) | X0 != union(X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_69]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_7,plain,
% 0.21/0.44 ( in(sk1_esk4_2(X0,X1),X1) | in(sk1_esk3_2(X0,X1),X0) | X0 = union(X1) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_37_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_65,plain,
% 0.21/0.44 ( in(sk1_esk4_2(X0,X1),X1) | in(sk1_esk3_2(X0,X1),X0) | X0 = union(X1) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_7]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_66,plain,
% 0.21/0.44 ( in(sk1_esk3_2(X0,X1),X0) | in(sk1_esk4_2(X0,X1),X1) | X0 = union(X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_65]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_6,plain,
% 0.21/0.44 ( ~ in(sk1_esk1_2(X0,X1),X0) | subset(X1,X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_38_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_63,plain,
% 0.21/0.44 ( ~ in(sk1_esk1_2(X0,X1),X0) | subset(X1,X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_6]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_64,plain,
% 0.21/0.44 ( subset(X0,X1) | ~ in(sk1_esk1_2(X1,X0),X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_63]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_4,plain,
% 0.21/0.44 ( in(sk1_esk1_2(X0,X1),X1) | subset(X1,X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_40_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_59,plain,
% 0.21/0.44 ( in(sk1_esk1_2(X0,X1),X1) | subset(X1,X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_4]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_60,plain,
% 0.21/0.44 ( subset(X0,X1) | in(sk1_esk1_2(X1,X0),X0) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_59]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_3,plain,
% 0.21/0.44 ( ~ in(X0,X1) | in(X0,X2) | ~ subset(X1,X2) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_41_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_57,plain,
% 0.21/0.44 ( ~ in(X0,X1) | in(X0,X2) | ~ subset(X1,X2) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_3]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_58,plain,
% 0.21/0.44 ( ~ subset(X0,X1) | ~ in(X2,X0) | in(X2,X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_57]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_12,negated_conjecture,
% 0.21/0.44 ( ~ subset(sk3_esk1_0,union(sk3_esk2_0)) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_5) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_23,negated_conjecture,
% 0.21/0.44 ( ~ subset(sk3_esk1_0,union(sk3_esk2_0)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_12]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_31,negated_conjecture,
% 0.21/0.44 ( ~ subset(sk3_esk1_0,union(sk3_esk2_0)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_23]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_34,negated_conjecture,
% 0.21/0.44 ( ~ subset(sk3_esk1_0,union(sk3_esk2_0)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_31]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_35,negated_conjecture,
% 0.21/0.44 ( ~ subset(sk3_esk1_0,union(sk3_esk2_0)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_34]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_75,negated_conjecture,
% 0.21/0.44 ( ~ subset(sk3_esk1_0,union(sk3_esk2_0)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_35]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_11,plain,
% 0.21/0.44 ( ~ in(sk1_esk3_2(X0,X1),X0)
% 0.21/0.44 | ~ in(sk1_esk3_2(X0,X1),X2)
% 0.21/0.44 | ~ in(X2,X1)
% 0.21/0.44 | X0 = union(X1) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_33_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_73,plain,
% 0.21/0.44 ( ~ in(sk1_esk3_2(X0,X1),X0)
% 0.21/0.44 | ~ in(sk1_esk3_2(X0,X1),X2)
% 0.21/0.44 | ~ in(X2,X1)
% 0.21/0.44 | X0 = union(X1) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_11]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_8,plain,
% 0.21/0.44 ( in(sk1_esk3_2(X0,X1),sk1_esk4_2(X0,X1))
% 0.21/0.44 | in(sk1_esk3_2(X0,X1),X0)
% 0.21/0.44 | X0 = union(X1) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_36_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_67,plain,
% 0.21/0.44 ( in(sk1_esk3_2(X0,X1),sk1_esk4_2(X0,X1))
% 0.21/0.44 | in(sk1_esk3_2(X0,X1),X0)
% 0.21/0.44 | X0 = union(X1) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_8]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_5,plain,
% 0.21/0.44 ( ~ in(X0,X1) | ~ in(X1,X2) | in(X0,X3) | X3 != union(X2) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_39_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_61,plain,
% 0.21/0.44 ( ~ in(X0,X1) | ~ in(X1,X2) | in(X0,X3) | X3 != union(X2) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_5]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_1,plain,
% 0.21/0.44 ( subset(X0,X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_43_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_53,plain,( subset(X0,X0) ),inference(copy,[status(esa)],[c_1]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_0,plain,
% 0.21/0.44 ( $true ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p', c_0_44_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_51,plain,( $true ),inference(copy,[status(esa)],[c_0]) ).
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % ------ Statistics
% 0.21/0.44
% 0.21/0.44 % ------ General
% 0.21/0.44
% 0.21/0.44 % num_of_input_clauses: 14
% 0.21/0.44 % num_of_input_neg_conjectures: 2
% 0.21/0.44 % num_of_splits: 0
% 0.21/0.44 % num_of_split_atoms: 0
% 0.21/0.44 % num_of_sem_filtered_clauses: 0
% 0.21/0.44 % num_of_subtypes: 0
% 0.21/0.44 % monotx_restored_types: 0
% 0.21/0.44 % sat_num_of_epr_types: 0
% 0.21/0.44 % sat_num_of_non_cyclic_types: 0
% 0.21/0.44 % sat_guarded_non_collapsed_types: 0
% 0.21/0.44 % is_epr: 0
% 0.21/0.44 % is_horn: 0
% 0.21/0.44 % has_eq: 1
% 0.21/0.44 % num_pure_diseq_elim: 0
% 0.21/0.44 % simp_replaced_by: 0
% 0.21/0.44 % res_preprocessed: 4
% 0.21/0.44 % prep_upred: 0
% 0.21/0.44 % prep_unflattend: 0
% 0.21/0.44 % pred_elim_cands: 0
% 0.21/0.44 % pred_elim: 0
% 0.21/0.44 % pred_elim_cl: 0
% 0.21/0.44 % pred_elim_cycles: 0
% 0.21/0.44 % forced_gc_time: 0
% 0.21/0.44 % gc_basic_clause_elim: 0
% 0.21/0.44 % parsing_time: 0.
% 0.21/0.44 % sem_filter_time: 0.
% 0.21/0.44 % pred_elim_time: 0.
% 0.21/0.44 % out_proof_time: 0.
% 0.21/0.44 % monotx_time: 0.
% 0.21/0.44 % subtype_inf_time: 0.
% 0.21/0.44 % unif_index_cands_time: 0.
% 0.21/0.44 % unif_index_add_time: 0.
% 0.21/0.44 % total_time: 0.023
% 0.21/0.44 % num_of_symbols: 34
% 0.21/0.44 % num_of_terms: 100
% 0.21/0.44
% 0.21/0.44 % ------ Propositional Solver
% 0.21/0.44
% 0.21/0.44 % prop_solver_calls: 1
% 0.21/0.44 % prop_fast_solver_calls: 6
% 0.21/0.44 % prop_num_of_clauses: 23
% 0.21/0.44 % prop_preprocess_simplified: 43
% 0.21/0.44 % prop_fo_subsumed: 0
% 0.21/0.44 % prop_solver_time: 0.
% 0.21/0.44 % prop_fast_solver_time: 0.
% 0.21/0.44 % prop_unsat_core_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ QBF
% 0.21/0.44
% 0.21/0.44 % qbf_q_res: 0
% 0.21/0.44 % qbf_num_tautologies: 0
% 0.21/0.44 % qbf_prep_cycles: 0
% 0.21/0.44
% 0.21/0.44 % ------ BMC1
% 0.21/0.44
% 0.21/0.44 % bmc1_current_bound: -1
% 0.21/0.44 % bmc1_last_solved_bound: -1
% 0.21/0.44 % bmc1_unsat_core_size: -1
% 0.21/0.44 % bmc1_unsat_core_parents_size: -1
% 0.21/0.44 % bmc1_merge_next_fun: 0
% 0.21/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation
% 0.21/0.44
% 0.21/0.44 % inst_num_of_clauses: 14
% 0.21/0.44 % inst_num_in_passive: 0
% 0.21/0.44 % inst_num_in_active: 0
% 0.21/0.44 % inst_num_in_unprocessed: 14
% 0.21/0.44 % inst_num_of_loops: 0
% 0.21/0.44 % inst_num_of_learning_restarts: 0
% 0.21/0.44 % inst_num_moves_active_passive: 0
% 0.21/0.44 % inst_lit_activity: 0
% 0.21/0.44 % inst_lit_activity_moves: 0
% 0.21/0.44 % inst_num_tautologies: 0
% 0.21/0.44 % inst_num_prop_implied: 0
% 0.21/0.44 % inst_num_existing_simplified: 0
% 0.21/0.44 % inst_num_eq_res_simplified: 0
% 0.21/0.44 % inst_num_child_elim: 0
% 0.21/0.44 % inst_num_of_dismatching_blockings: 0
% 0.21/0.44 % inst_num_of_non_proper_insts: 0
% 0.21/0.44 % inst_num_of_duplicates: 0
% 0.21/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.44 % inst_dismatching_checking_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Resolution
% 0.21/0.44
% 0.21/0.44 % res_num_of_clauses: 21
% 0.21/0.44 % res_num_in_passive: 0
% 0.21/0.44 % res_num_in_active: 15
% 0.21/0.44 % res_num_of_loops: 6
% 0.21/0.44 % res_forward_subset_subsumed: 0
% 0.21/0.44 % res_backward_subset_subsumed: 0
% 0.21/0.44 % res_forward_subsumed: 2
% 0.21/0.44 % res_backward_subsumed: 0
% 0.21/0.44 % res_forward_subsumption_resolution: 0
% 0.21/0.44 % res_backward_subsumption_resolution: 0
% 0.21/0.44 % res_clause_to_clause_subsumption: 7
% 0.21/0.44 % res_orphan_elimination: 0
% 0.21/0.44 % res_tautology_del: 0
% 0.21/0.44 % res_num_eq_res_simplified: 0
% 0.21/0.44 % res_num_sel_changes: 0
% 0.21/0.44 % res_moves_from_active_to_pass: 0
% 0.21/0.44
% 0.21/0.44 % Status Unknown
% 0.21/0.48 % Orienting using strategy ClausalAll
% 0.21/0.48 % FOF problem with conjecture
% 0.21/0.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_dbb0d8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_7d0903.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_72c8a1 | grep -v "SZS"
% 0.21/0.50
% 0.21/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.50
% 0.21/0.50 %
% 0.21/0.50 % ------ iProver source info
% 0.21/0.50
% 0.21/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.50 % git: non_committed_changes: true
% 0.21/0.50 % git: last_make_outside_of_git: true
% 0.21/0.50
% 0.21/0.50 %
% 0.21/0.50 % ------ Input Options
% 0.21/0.50
% 0.21/0.50 % --out_options all
% 0.21/0.50 % --tptp_safe_out true
% 0.21/0.50 % --problem_path ""
% 0.21/0.50 % --include_path ""
% 0.21/0.50 % --clausifier .//eprover
% 0.21/0.50 % --clausifier_options --tstp-format
% 0.21/0.50 % --stdin false
% 0.21/0.50 % --dbg_backtrace false
% 0.21/0.50 % --dbg_dump_prop_clauses false
% 0.21/0.50 % --dbg_dump_prop_clauses_file -
% 0.21/0.50 % --dbg_out_stat false
% 0.21/0.50
% 0.21/0.50 % ------ General Options
% 0.21/0.50
% 0.21/0.50 % --fof false
% 0.21/0.50 % --time_out_real 150.
% 0.21/0.50 % --time_out_prep_mult 0.2
% 0.21/0.50 % --time_out_virtual -1.
% 0.21/0.50 % --schedule none
% 0.21/0.50 % --ground_splitting input
% 0.21/0.50 % --splitting_nvd 16
% 0.21/0.50 % --non_eq_to_eq false
% 0.21/0.50 % --prep_gs_sim true
% 0.21/0.50 % --prep_unflatten false
% 0.21/0.50 % --prep_res_sim true
% 0.21/0.50 % --prep_upred true
% 0.21/0.50 % --res_sim_input true
% 0.21/0.50 % --clause_weak_htbl true
% 0.21/0.50 % --gc_record_bc_elim false
% 0.21/0.50 % --symbol_type_check false
% 0.21/0.50 % --clausify_out false
% 0.21/0.50 % --large_theory_mode false
% 0.21/0.50 % --prep_sem_filter none
% 0.21/0.50 % --prep_sem_filter_out false
% 0.21/0.50 % --preprocessed_out false
% 0.21/0.50 % --sub_typing false
% 0.21/0.50 % --brand_transform false
% 0.21/0.50 % --pure_diseq_elim true
% 0.21/0.50 % --min_unsat_core false
% 0.21/0.50 % --pred_elim true
% 0.21/0.50 % --add_important_lit false
% 0.21/0.50 % --soft_assumptions false
% 0.21/0.50 % --reset_solvers false
% 0.21/0.50 % --bc_imp_inh []
% 0.21/0.50 % --conj_cone_tolerance 1.5
% 0.21/0.50 % --prolific_symb_bound 500
% 0.21/0.50 % --lt_threshold 2000
% 0.21/0.50
% 0.21/0.50 % ------ SAT Options
% 0.21/0.50
% 0.21/0.50 % --sat_mode false
% 0.21/0.50 % --sat_fm_restart_options ""
% 0.21/0.50 % --sat_gr_def false
% 0.21/0.50 % --sat_epr_types true
% 0.21/0.50 % --sat_non_cyclic_types false
% 0.21/0.50 % --sat_finite_models false
% 0.21/0.50 % --sat_fm_lemmas false
% 0.21/0.50 % --sat_fm_prep false
% 0.21/0.50 % --sat_fm_uc_incr true
% 0.21/0.50 % --sat_out_model small
% 0.21/0.50 % --sat_out_clauses false
% 0.21/0.50
% 0.21/0.50 % ------ QBF Options
% 0.21/0.50
% 0.21/0.50 % --qbf_mode false
% 0.21/0.50 % --qbf_elim_univ true
% 0.21/0.50 % --qbf_sk_in true
% 0.21/0.50 % --qbf_pred_elim true
% 0.21/0.50 % --qbf_split 32
% 0.21/0.50
% 0.21/0.50 % ------ BMC1 Options
% 0.21/0.50
% 0.21/0.50 % --bmc1_incremental false
% 0.21/0.50 % --bmc1_axioms reachable_all
% 0.21/0.50 % --bmc1_min_bound 0
% 0.21/0.50 % --bmc1_max_bound -1
% 0.21/0.50 % --bmc1_max_bound_default -1
% 0.21/0.50 % --bmc1_symbol_reachability true
% 0.21/0.50 % --bmc1_property_lemmas false
% 0.21/0.50 % --bmc1_k_induction false
% 0.21/0.50 % --bmc1_non_equiv_states false
% 0.21/0.50 % --bmc1_deadlock false
% 0.21/0.50 % --bmc1_ucm false
% 0.21/0.50 % --bmc1_add_unsat_core none
% 0.21/0.50 % --bmc1_unsat_core_children false
% 0.21/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.50 % --bmc1_out_stat full
% 0.21/0.50 % --bmc1_ground_init false
% 0.21/0.50 % --bmc1_pre_inst_next_state false
% 0.21/0.50 % --bmc1_pre_inst_state false
% 0.21/0.50 % --bmc1_pre_inst_reach_state false
% 0.21/0.50 % --bmc1_out_unsat_core false
% 0.21/0.50 % --bmc1_aig_witness_out false
% 0.21/0.50 % --bmc1_verbose false
% 0.21/0.50 % --bmc1_dump_clauses_tptp false
% 0.21/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.51 % --bmc1_dump_file -
% 0.21/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.51 % --bmc1_ucm_extend_mode 1
% 0.21/0.51 % --bmc1_ucm_init_mode 2
% 0.21/0.51 % --bmc1_ucm_cone_mode none
% 0.21/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.51 % --bmc1_ucm_relax_model 4
% 0.21/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.51 % --bmc1_ucm_layered_model none
% 0.21/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.51
% 0.21/0.51 % ------ AIG Options
% 0.21/0.51
% 0.21/0.51 % --aig_mode false
% 0.21/0.51
% 0.21/0.51 % ------ Instantiation Options
% 0.21/0.51
% 0.21/0.51 % --instantiation_flag true
% 0.21/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.51 % --inst_solver_per_active 750
% 0.21/0.51 % --inst_solver_calls_frac 0.5
% 0.21/0.51 % --inst_passive_queue_type priority_queues
% 0.21/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.51 % --inst_passive_queues_freq [25;2]
% 0.21/0.51 % --inst_dismatching true
% 0.21/0.51 % --inst_eager_unprocessed_to_passive true
% 0.21/0.51 % --inst_prop_sim_given true
% 0.21/0.51 % --inst_prop_sim_new false
% 0.21/0.51 % --inst_orphan_elimination true
% 0.21/0.51 % --inst_learning_loop_flag true
% 0.21/0.51 % --inst_learning_start 3000
% 0.21/0.51 % --inst_learning_factor 2
% 0.21/0.51 % --inst_start_prop_sim_after_learn 3
% 0.21/0.51 % --inst_sel_renew solver
% 0.21/0.51 % --inst_lit_activity_flag true
% 0.21/0.51 % --inst_out_proof true
% 0.21/0.51
% 0.21/0.51 % ------ Resolution Options
% 0.21/0.51
% 0.21/0.51 % --resolution_flag true
% 0.21/0.51 % --res_lit_sel kbo_max
% 0.21/0.51 % --res_to_prop_solver none
% 0.21/0.51 % --res_prop_simpl_new false
% 0.21/0.51 % --res_prop_simpl_given false
% 0.21/0.51 % --res_passive_queue_type priority_queues
% 0.21/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.51 % --res_passive_queues_freq [15;5]
% 0.21/0.51 % --res_forward_subs full
% 0.21/0.51 % --res_backward_subs full
% 0.21/0.51 % --res_forward_subs_resolution true
% 0.21/0.51 % --res_backward_subs_resolution true
% 0.21/0.51 % --res_orphan_elimination false
% 0.21/0.51 % --res_time_limit 1000.
% 0.21/0.51 % --res_out_proof true
% 0.21/0.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_dbb0d8.s
% 0.21/0.51 % --modulo true
% 0.21/0.51
% 0.21/0.51 % ------ Combination Options
% 0.21/0.51
% 0.21/0.51 % --comb_res_mult 1000
% 0.21/0.51 % --comb_inst_mult 300
% 0.21/0.51 % ------
% 0.21/0.51
% 0.21/0.51 % ------ Parsing...% successful
% 0.21/0.51
% 0.21/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.21/0.51
% 0.21/0.51 % ------ Proving...
% 0.21/0.51 % ------ Problem Properties
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % EPR false
% 0.21/0.51 % Horn false
% 0.21/0.51 % Has equality true
% 0.21/0.51
% 0.21/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.51
% 0.21/0.51
% 0.21/0.51 % % ------ Current options:
% 0.21/0.51
% 0.21/0.51 % ------ Input Options
% 0.21/0.51
% 0.21/0.51 % --out_options all
% 0.21/0.51 % --tptp_safe_out true
% 0.21/0.51 % --problem_path ""
% 0.21/0.51 % --include_path ""
% 0.21/0.51 % --clausifier .//eprover
% 0.21/0.51 % --clausifier_options --tstp-format
% 0.21/0.51 % --stdin false
% 0.21/0.51 % --dbg_backtrace false
% 0.21/0.51 % --dbg_dump_prop_clauses false
% 0.21/0.51 % --dbg_dump_prop_clauses_file -
% 0.21/0.51 % --dbg_out_stat false
% 0.21/0.51
% 0.21/0.51 % ------ General Options
% 0.21/0.51
% 0.21/0.51 % --fof false
% 0.21/0.51 % --time_out_real 150.
% 0.21/0.51 % --time_out_prep_mult 0.2
% 0.21/0.51 % --time_out_virtual -1.
% 0.21/0.51 % --schedule none
% 0.21/0.51 % --ground_splitting input
% 0.21/0.51 % --splitting_nvd 16
% 0.21/0.51 % --non_eq_to_eq false
% 0.21/0.51 % --prep_gs_sim true
% 0.21/0.51 % --prep_unflatten false
% 0.21/0.51 % --prep_res_sim true
% 0.21/0.51 % --prep_upred true
% 0.21/0.51 % --res_sim_input true
% 0.21/0.51 % --clause_weak_htbl true
% 0.21/0.51 % --gc_record_bc_elim false
% 0.21/0.51 % --symbol_type_check false
% 0.21/0.51 % --clausify_out false
% 0.21/0.51 % --large_theory_mode false
% 0.21/0.51 % --prep_sem_filter none
% 0.21/0.51 % --prep_sem_filter_out false
% 0.21/0.51 % --preprocessed_out false
% 0.21/0.51 % --sub_typing false
% 0.21/0.51 % --brand_transform false
% 0.21/0.51 % --pure_diseq_elim true
% 0.21/0.51 % --min_unsat_core false
% 0.21/0.51 % --pred_elim true
% 0.21/0.51 % --add_important_lit false
% 0.21/0.51 % --soft_assumptions false
% 0.21/0.51 % --reset_solvers false
% 0.21/0.51 % --bc_imp_inh []
% 0.21/0.51 % --conj_cone_tolerance 1.5
% 0.21/0.51 % --prolific_symb_bound 500
% 0.21/0.51 % --lt_threshold 2000
% 0.21/0.51
% 0.21/0.51 % ------ SAT Options
% 0.21/0.51
% 0.21/0.51 % --sat_mode false
% 0.21/0.51 % --sat_fm_restart_options ""
% 0.21/0.51 % --sat_gr_def false
% 0.21/0.51 % --sat_epr_types true
% 0.21/0.51 % --sat_non_cyclic_types false
% 0.21/0.51 % --sat_finite_models false
% 0.21/0.51 % --sat_fm_lemmas false
% 0.21/0.51 % --sat_fm_prep false
% 0.21/0.51 % --sat_fm_uc_incr true
% 0.21/0.51 % --sat_out_model small
% 0.21/0.51 % --sat_out_clauses false
% 0.21/0.51
% 0.21/0.51 % ------ QBF Options
% 0.21/0.51
% 0.21/0.51 % --qbf_mode false
% 0.21/0.51 % --qbf_elim_univ true
% 0.21/0.51 % --qbf_sk_in true
% 0.21/0.51 % --qbf_pred_elim true
% 0.21/0.51 % --qbf_split 32
% 0.21/0.51
% 0.21/0.51 % ------ BMC1 Options
% 0.21/0.51
% 0.21/0.51 % --bmc1_incremental false
% 0.21/0.51 % --bmc1_axioms reachable_all
% 0.21/0.51 % --bmc1_min_bound 0
% 0.21/0.51 % --bmc1_max_bound -1
% 0.21/0.51 % --bmc1_max_bound_default -1
% 0.21/0.51 % --bmc1_symbol_reachability true
% 0.21/0.51 % --bmc1_property_lemmas false
% 0.21/0.51 % --bmc1_k_induction false
% 0.21/0.51 % --bmc1_non_equiv_states false
% 0.21/0.51 % --bmc1_deadlock false
% 0.21/0.51 % --bmc1_ucm false
% 0.21/0.51 % --bmc1_add_unsat_core none
% 0.21/0.51 % --bmc1_unsat_core_children false
% 0.21/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.51 % --bmc1_out_stat full
% 0.21/0.51 % --bmc1_ground_init false
% 0.21/0.51 % --bmc1_pre_inst_next_state false
% 0.21/0.51 % --bmc1_pre_inst_state false
% 0.21/0.51 % --bmc1_pre_inst_reach_state false
% 0.21/0.51 % --bmc1_out_unsat_core false
% 0.21/0.51 % --bmc1_aig_witness_out false
% 0.21/0.51 % --bmc1_verbose false
% 0.21/0.51 % --bmc1_dump_clauses_tptp false
% 0.21/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.51 % --bmc1_dump_file -
% 0.21/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.51 % --bmc1_ucm_extend_mode 1
% 0.21/0.51 % --bmc1_ucm_init_mode 2
% 0.21/0.51 % --bmc1_ucm_cone_mode none
% 0.21/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.51 % --bmc1_ucm_relax_model 4
% 0.21/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.51 % --bmc1_ucm_layered_model none
% 0.21/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.51
% 0.21/0.51 % ------ AIG Options
% 0.21/0.51
% 0.21/0.51 % --aig_mode false
% 0.21/0.51
% 0.21/0.51 % ------ Instantiation Options
% 0.21/0.51
% 0.21/0.51 % --instantiation_flag true
% 0.21/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.51 % --inst_solver_per_active 750
% 0.21/0.51 % --inst_solver_calls_frac 0.5
% 0.21/0.51 % --inst_passive_queue_type priority_queues
% 0.21/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.51 % --inst_passive_queues_freq [25;2]
% 0.21/0.51 % --inst_dismatching true
% 0.21/0.51 % --inst_eager_unprocessed_to_passive true
% 0.21/0.51 % --inst_prop_sim_given true
% 1.12/1.32 % --inst_prop_sim_new false
% 1.12/1.32 % --inst_orphan_elimination true
% 1.12/1.32 % --inst_learning_loop_flag true
% 1.12/1.32 % --inst_learning_start 3000
% 1.12/1.32 % --inst_learning_factor 2
% 1.12/1.32 % --inst_start_prop_sim_after_learn 3
% 1.12/1.32 % --inst_sel_renew solver
% 1.12/1.32 % --inst_lit_activity_flag true
% 1.12/1.32 % --inst_out_proof true
% 1.12/1.32
% 1.12/1.32 % ------ Resolution Options
% 1.12/1.32
% 1.12/1.32 % --resolution_flag true
% 1.12/1.32 % --res_lit_sel kbo_max
% 1.12/1.32 % --res_to_prop_solver none
% 1.12/1.32 % --res_prop_simpl_new false
% 1.12/1.32 % --res_prop_simpl_given false
% 1.12/1.32 % --res_passive_queue_type priority_queues
% 1.12/1.32 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.12/1.32 % --res_passive_queues_freq [15;5]
% 1.12/1.32 % --res_forward_subs full
% 1.12/1.32 % --res_backward_subs full
% 1.12/1.32 % --res_forward_subs_resolution true
% 1.12/1.32 % --res_backward_subs_resolution true
% 1.12/1.32 % --res_orphan_elimination false
% 1.12/1.32 % --res_time_limit 1000.
% 1.12/1.32 % --res_out_proof true
% 1.12/1.32 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_dbb0d8.s
% 1.12/1.32 % --modulo true
% 1.12/1.32
% 1.12/1.32 % ------ Combination Options
% 1.12/1.32
% 1.12/1.32 % --comb_res_mult 1000
% 1.12/1.32 % --comb_inst_mult 300
% 1.12/1.32 % ------
% 1.12/1.32
% 1.12/1.32
% 1.12/1.32
% 1.12/1.32 % ------ Proving...
% 1.12/1.32 %
% 1.12/1.32
% 1.12/1.32
% 1.12/1.32 % ------ Statistics
% 1.12/1.32
% 1.12/1.32 % ------ General
% 1.12/1.32
% 1.12/1.32 % num_of_input_clauses: 33
% 1.12/1.32 % num_of_input_neg_conjectures: 2
% 1.12/1.32 % num_of_splits: 0
% 1.12/1.32 % num_of_split_atoms: 0
% 1.12/1.32 % num_of_sem_filtered_clauses: 0
% 1.12/1.32 % num_of_subtypes: 0
% 1.12/1.32 % monotx_restored_types: 0
% 1.12/1.32 % sat_num_of_epr_types: 0
% 1.12/1.32 % sat_num_of_non_cyclic_types: 0
% 1.12/1.32 % sat_guarded_non_collapsed_types: 0
% 1.12/1.32 % is_epr: 0
% 1.12/1.32 % is_horn: 0
% 1.12/1.32 % has_eq: 1
% 1.12/1.32 % num_pure_diseq_elim: 0
% 1.12/1.32 % simp_replaced_by: 0
% 1.12/1.32 % res_preprocessed: 4
% 1.12/1.32 % prep_upred: 0
% 1.12/1.32 % prep_unflattend: 0
% 1.12/1.32 % pred_elim_cands: 0
% 1.12/1.32 % pred_elim: 0
% 1.12/1.32 % pred_elim_cl: 0
% 1.12/1.32 % pred_elim_cycles: 0
% 1.12/1.32 % forced_gc_time: 0
% 1.12/1.32 % gc_basic_clause_elim: 0
% 1.12/1.32 % parsing_time: 0.001
% 1.12/1.32 % sem_filter_time: 0.
% 1.12/1.32 % pred_elim_time: 0.
% 1.12/1.32 % out_proof_time: 0.
% 1.12/1.32 % monotx_time: 0.
% 1.12/1.32 % subtype_inf_time: 0.
% 1.12/1.32 % unif_index_cands_time: 0.014
% 1.12/1.32 % unif_index_add_time: 0.004
% 1.12/1.32 % total_time: 0.831
% 1.12/1.32 % num_of_symbols: 34
% 1.12/1.32 % num_of_terms: 6776
% 1.12/1.32
% 1.12/1.32 % ------ Propositional Solver
% 1.12/1.32
% 1.12/1.32 % prop_solver_calls: 5
% 1.12/1.32 % prop_fast_solver_calls: 6
% 1.12/1.32 % prop_num_of_clauses: 146
% 1.12/1.32 % prop_preprocess_simplified: 393
% 1.12/1.32 % prop_fo_subsumed: 0
% 1.12/1.32 % prop_solver_time: 0.
% 1.12/1.32 % prop_fast_solver_time: 0.
% 1.12/1.32 % prop_unsat_core_time: 0.
% 1.12/1.32
% 1.12/1.32 % ------ QBF
% 1.12/1.32
% 1.12/1.32 % qbf_q_res: 0
% 1.12/1.32 % qbf_num_tautologies: 0
% 1.12/1.32 % qbf_prep_cycles: 0
% 1.12/1.32
% 1.12/1.32 % ------ BMC1
% 1.12/1.32
% 1.12/1.32 % bmc1_current_bound: -1
% 1.12/1.32 % bmc1_last_solved_bound: -1
% 1.12/1.32 % bmc1_unsat_core_size: -1
% 1.12/1.32 % bmc1_unsat_core_parents_size: -1
% 1.12/1.32 % bmc1_merge_next_fun: 0
% 1.12/1.32 % bmc1_unsat_core_clauses_time: 0.
% 1.12/1.32
% 1.12/1.32 % ------ Instantiation
% 1.12/1.32
% 1.12/1.32 % inst_num_of_clauses: 128
% 1.12/1.32 % inst_num_in_passive: 55
% 1.12/1.32 % inst_num_in_active: 67
% 1.12/1.32 % inst_num_in_unprocessed: 2
% 1.12/1.32 % inst_num_of_loops: 71
% 1.12/1.32 % inst_num_of_learning_restarts: 0
% 1.12/1.32 % inst_num_moves_active_passive: 0
% 1.12/1.32 % inst_lit_activity: 59
% 1.12/1.32 % inst_lit_activity_moves: 0
% 1.12/1.32 % inst_num_tautologies: 2
% 1.12/1.32 % inst_num_prop_implied: 0
% 1.12/1.32 % inst_num_existing_simplified: 0
% 1.12/1.32 % inst_num_eq_res_simplified: 1
% 1.12/1.32 % inst_num_child_elim: 0
% 1.12/1.32 % inst_num_of_dismatching_blockings: 60
% 1.12/1.32 % inst_num_of_non_proper_insts: 169
% 1.12/1.32 % inst_num_of_duplicates: 142
% 1.12/1.32 % inst_inst_num_from_inst_to_res: 0
% 1.12/1.32 % inst_dismatching_checking_time: 0.
% 1.12/1.32
% 1.12/1.32 % ------ Resolution
% 1.12/1.32
% 1.12/1.32 % res_num_of_clauses: 1592
% 1.12/1.32 % res_num_in_passive: 693
% 1.12/1.32 % res_num_in_active: 880
% 1.12/1.32 % res_num_of_loops: 1000
% 1.12/1.32 % res_forward_subset_subsumed: 195
% 1.12/1.32 % res_backward_subset_subsumed: 0
% 1.12/1.32 % res_forward_subsumed: 136
% 1.12/1.32 % res_backward_subsumed: 0
% 1.12/1.32 % res_forward_subsumption_resolution: 0
% 1.12/1.32 % res_backward_subsumption_resolution: 0
% 1.12/1.32 % res_clause_to_clause_subsumption: 29309
% 1.12/1.32 % res_orphan_elimination: 0
% 1.12/1.32 % res_tautology_del: 0
% 1.12/1.32 % res_num_eq_res_simplified: 0
% 1.12/1.32 % res_num_sel_changes: 0
% 1.12/1.32 % res_moves_from_active_to_pass: 0
% 1.12/1.32
% 1.12/1.32 % Status Unsatisfiable
% 1.12/1.32 % SZS status Theorem
% 1.12/1.32 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------