TSTP Solution File: SET624+3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET624+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n025.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 02:14:49 EDT 2022
% Result : Theorem 0.46s 0.65s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 16
% Syntax : Number of formulae : 152 ( 19 unt; 0 def)
% Number of atoms : 378 ( 32 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 376 ( 150 ~; 203 |; 11 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 247 ( 22 sgn 51 !; 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] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('<stdin>',equal_member_defn) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('<stdin>',union_defn) ).
fof(c_0_2,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('<stdin>',intersect_defn) ).
fof(c_0_3,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
file('<stdin>',symmetry_of_intersect) ).
fof(c_0_4,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('<stdin>',commutativity_of_union) ).
fof(c_0_5,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
c_0_0 ).
fof(c_0_6,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
c_0_1 ).
fof(c_0_7,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
c_0_2 ).
fof(c_0_8,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
c_0_3 ).
fof(c_0_9,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
c_0_4 ).
fof(c_0_10,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ member(X6,X4)
| member(X6,X5)
| X4 != X5 )
& ( ~ member(X7,X5)
| member(X7,X4)
| X4 != X5 )
& ( ~ member(esk2_2(X8,X9),X8)
| ~ member(esk2_2(X8,X9),X9)
| X8 = X9 )
& ( member(esk2_2(X8,X9),X8)
| member(esk2_2(X8,X9),X9)
| X8 = X9 ) ),
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,X9] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X9,X7)
| member(X9,union(X7,X8)) )
& ( ~ member(X9,X8)
| member(X9,union(X7,X8)) ) ),
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_6])])])])]) ).
fof(c_0_12,plain,
! [X4,X5,X7,X8,X9] :
( ( member(esk1_2(X4,X5),X4)
| ~ intersect(X4,X5) )
& ( member(esk1_2(X4,X5),X5)
| ~ intersect(X4,X5) )
& ( ~ member(X9,X7)
| ~ member(X9,X8)
| intersect(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_7])])])])])]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ intersect(X3,X4)
| intersect(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_14,plain,
! [X3,X4] : union(X3,X4) = union(X4,X3),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
c_0_15,
[final] ).
cnf(c_0_28,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
c_0_16,
[final] ).
cnf(c_0_29,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
c_0_17,
[final] ).
cnf(c_0_30,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
c_0_18,
[final] ).
cnf(c_0_31,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
c_0_19,
[final] ).
cnf(c_0_32,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
c_0_20,
[final] ).
cnf(c_0_33,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
c_0_21,
[final] ).
cnf(c_0_34,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
c_0_22,
[final] ).
cnf(c_0_35,plain,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
c_0_23,
[final] ).
cnf(c_0_36,plain,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
c_0_24,
[final] ).
cnf(c_0_37,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
c_0_25,
[final] ).
cnf(c_0_38,plain,
union(X1,X2) = union(X2,X1),
c_0_26,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_27_0,axiom,
( X1 = X2
| ~ member(sk1_esk2_2(X1,X2),X2)
| ~ member(sk1_esk2_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( ~ member(sk1_esk2_2(X1,X2),X2)
| X1 = X2
| ~ member(sk1_esk2_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_2,axiom,
( ~ member(sk1_esk2_2(X1,X2),X1)
| ~ member(sk1_esk2_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_0,axiom,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( member(X1,X3)
| member(X1,X2)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_2,axiom,
( ~ member(X1,union(X3,X2))
| member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( X1 = X2
| member(sk1_esk2_2(X1,X2),X2)
| member(sk1_esk2_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( member(sk1_esk2_2(X1,X2),X2)
| X1 = X2
| member(sk1_esk2_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_2,axiom,
( member(sk1_esk2_2(X1,X2),X1)
| member(sk1_esk2_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_30_0,axiom,
( member(sk1_esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( ~ intersect(X1,X2)
| member(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_31_0,axiom,
( member(sk1_esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_31_1,axiom,
( ~ intersect(X1,X2)
| member(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_32_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_32_1,axiom,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
cnf(c_0_33_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( ~ member(X1,X3)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( ~ member(X3,X2)
| intersect(X1,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_2,axiom,
( ~ member(X3,X1)
| ~ member(X3,X2)
| intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_35_0,axiom,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_1,axiom,
( X1 != X2
| member(X3,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_2,axiom,
( ~ member(X3,X1)
| X1 != X2
| member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_36_0,axiom,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_1,axiom,
( X1 != X2
| member(X3,X1)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_2,axiom,
( ~ member(X3,X2)
| X1 != X2
| member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_37_0,axiom,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_1,axiom,
( ~ intersect(X2,X1)
| intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_38_0,axiom,
union(X1,X2) = union(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2,X3] :
( intersect(X1,union(X2,X3))
<=> ( intersect(X1,X2)
| intersect(X1,X3) ) ),
file('<stdin>',prove_intersect_with_union) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2,X3] :
( intersect(X1,union(X2,X3))
<=> ( intersect(X1,X2)
| intersect(X1,X3) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( ( ~ intersect(esk1_0,esk2_0)
| ~ intersect(esk1_0,union(esk2_0,esk3_0)) )
& ( ~ intersect(esk1_0,esk3_0)
| ~ intersect(esk1_0,union(esk2_0,esk3_0)) )
& ( intersect(esk1_0,union(esk2_0,esk3_0))
| intersect(esk1_0,esk2_0)
| intersect(esk1_0,esk3_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3_004,negated_conjecture,
( ~ intersect(esk1_0,union(esk2_0,esk3_0))
| ~ intersect(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( ~ intersect(esk1_0,union(esk2_0,esk3_0))
| ~ intersect(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( intersect(esk1_0,esk3_0)
| intersect(esk1_0,esk2_0)
| intersect(esk1_0,union(esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
( ~ intersect(esk1_0,union(esk2_0,esk3_0))
| ~ intersect(esk1_0,esk2_0) ),
c_0_3,
[final] ).
cnf(c_0_7_008,negated_conjecture,
( ~ intersect(esk1_0,union(esk2_0,esk3_0))
| ~ intersect(esk1_0,esk3_0) ),
c_0_4,
[final] ).
cnf(c_0_8_009,negated_conjecture,
( intersect(esk1_0,esk3_0)
| intersect(esk1_0,esk2_0)
| intersect(esk1_0,union(esk2_0,esk3_0)) ),
c_0_5,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_31,negated_conjecture,
( intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_8) ).
cnf(c_43,negated_conjecture,
( intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_53,negated_conjecture,
( intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_54,negated_conjecture,
( intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_59,negated_conjecture,
( intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_154,plain,
( intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_18,plain,
( member(sk1_esk1_2(X0,X1),X0)
| ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_30_1) ).
cnf(c_128,plain,
( member(sk1_esk1_2(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_129,plain,
( ~ intersect(X0,X1)
| member(sk1_esk1_2(X0,X1),X0) ),
inference(rewriting,[status(thm)],[c_128]) ).
cnf(c_176,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_154,c_129]) ).
cnf(c_179,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_176]) ).
cnf(c_9,plain,
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_34_2) ).
cnf(c_110,plain,
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_228,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| intersect(sk2_esk1_0,X0)
| ~ member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),X0) ),
inference(resolution,[status(thm)],[c_179,c_110]) ).
cnf(c_229,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| intersect(sk2_esk1_0,X0)
| ~ member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),X0) ),
inference(rewriting,[status(thm)],[c_228]) ).
cnf(c_25,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_28_0) ).
cnf(c_142,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_336,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| intersect(sk2_esk1_0,X0)
| ~ member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),union(X1,X0))
| member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),X1) ),
inference(resolution,[status(thm)],[c_229,c_142]) ).
cnf(c_337,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| intersect(sk2_esk1_0,X0)
| ~ member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),union(X1,X0))
| member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),X1) ),
inference(rewriting,[status(thm)],[c_336]) ).
cnf(c_16,plain,
( member(sk1_esk1_2(X0,X1),X1)
| ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_31_1) ).
cnf(c_124,plain,
( member(sk1_esk1_2(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_125,plain,
( ~ intersect(X0,X1)
| member(sk1_esk1_2(X0,X1),X1) ),
inference(rewriting,[status(thm)],[c_124]) ).
cnf(c_177,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),union(sk2_esk2_0,sk2_esk3_0)) ),
inference(resolution,[status(thm)],[c_154,c_125]) ).
cnf(c_178,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),union(sk2_esk2_0,sk2_esk3_0)) ),
inference(rewriting,[status(thm)],[c_177]) ).
cnf(c_3596,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),sk2_esk2_0) ),
inference(resolution,[status(thm)],[c_337,c_178]) ).
cnf(c_3597,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0)
| member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0)),sk2_esk2_0) ),
inference(rewriting,[status(thm)],[c_3596]) ).
cnf(c_4507,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(resolution,[status(thm)],[c_3597,c_229]) ).
cnf(c_4508,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(rewriting,[status(thm)],[c_4507]) ).
cnf(c_8972,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| member(sk1_esk1_2(sk2_esk1_0,sk2_esk3_0),sk2_esk3_0) ),
inference(resolution,[status(thm)],[c_4508,c_125]) ).
cnf(c_8973,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| member(sk1_esk1_2(sk2_esk1_0,sk2_esk3_0),sk2_esk3_0) ),
inference(rewriting,[status(thm)],[c_8972]) ).
cnf(c_12,plain,
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_33_1) ).
cnf(c_116,plain,
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_8989,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| member(sk1_esk1_2(sk2_esk1_0,sk2_esk3_0),union(X0,sk2_esk3_0)) ),
inference(resolution,[status(thm)],[c_8973,c_116]) ).
cnf(c_8996,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| member(sk1_esk1_2(sk2_esk1_0,sk2_esk3_0),union(X0,sk2_esk3_0)) ),
inference(rewriting,[status(thm)],[c_8989]) ).
cnf(c_8971,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| member(sk1_esk1_2(sk2_esk1_0,sk2_esk3_0),sk2_esk1_0) ),
inference(resolution,[status(thm)],[c_4508,c_129]) ).
cnf(c_8974,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| member(sk1_esk1_2(sk2_esk1_0,sk2_esk3_0),sk2_esk1_0) ),
inference(rewriting,[status(thm)],[c_8971]) ).
cnf(c_9015,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,X0)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk3_0),X0) ),
inference(resolution,[status(thm)],[c_8974,c_110]) ).
cnf(c_9016,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| intersect(sk2_esk1_0,X0)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk3_0),X0) ),
inference(rewriting,[status(thm)],[c_9015]) ).
cnf(c_9123,plain,
( intersect(sk2_esk1_0,union(X0,sk2_esk3_0))
| intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(resolution,[status(thm)],[c_8996,c_9016]) ).
cnf(c_9126,plain,
( intersect(sk2_esk1_0,union(X0,sk2_esk3_0))
| intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(rewriting,[status(thm)],[c_9123]) ).
cnf(c_30,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk3_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_7) ).
cnf(c_41,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_52,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_55,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_58,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_152,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_9147,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| ~ intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(resolution,[status(thm)],[c_9126,c_152]) ).
cnf(c_9150,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| ~ intersect(sk2_esk1_0,sk2_esk3_0) ),
inference(rewriting,[status(thm)],[c_9147]) ).
cnf(c_9153,plain,
intersect(sk2_esk1_0,sk2_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_9150,c_4508]) ).
cnf(c_9154,plain,
intersect(sk2_esk1_0,sk2_esk2_0),
inference(rewriting,[status(thm)],[c_9153]) ).
cnf(c_9163,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk2_0),
inference(resolution,[status(thm)],[c_9154,c_125]) ).
cnf(c_9164,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk2_0),
inference(rewriting,[status(thm)],[c_9163]) ).
cnf(c_14,plain,
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_32_1) ).
cnf(c_120,plain,
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_9192,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),union(sk2_esk2_0,X0)),
inference(resolution,[status(thm)],[c_9164,c_120]) ).
cnf(c_9193,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),union(sk2_esk2_0,X0)),
inference(rewriting,[status(thm)],[c_9192]) ).
cnf(c_9334,plain,
( intersect(union(sk2_esk2_0,X0),X1)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),X1) ),
inference(resolution,[status(thm)],[c_9193,c_110]) ).
cnf(c_9335,plain,
( intersect(union(sk2_esk2_0,X0),X1)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),X1) ),
inference(rewriting,[status(thm)],[c_9334]) ).
cnf(c_9162,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),
inference(resolution,[status(thm)],[c_9154,c_129]) ).
cnf(c_9165,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),
inference(rewriting,[status(thm)],[c_9162]) ).
cnf(c_9420,plain,
intersect(union(sk2_esk2_0,X0),sk2_esk1_0),
inference(resolution,[status(thm)],[c_9335,c_9165]) ).
cnf(c_9421,plain,
intersect(union(sk2_esk2_0,X0),sk2_esk1_0),
inference(rewriting,[status(thm)],[c_9420]) ).
cnf(c_29,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_6) ).
cnf(c_39,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_51,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_56,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_57,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_150,negated_conjecture,
( ~ intersect(sk2_esk1_0,union(sk2_esk2_0,sk2_esk3_0))
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_2,plain,
( ~ intersect(X0,X1)
| intersect(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p',c_0_37_0) ).
cnf(c_96,plain,
( ~ intersect(X0,X1)
| intersect(X1,X0) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_160,plain,
( ~ intersect(union(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(resolution,[status(thm)],[c_150,c_96]) ).
cnf(c_161,plain,
( ~ intersect(union(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0)
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(rewriting,[status(thm)],[c_160]) ).
cnf(c_9156,plain,
~ intersect(union(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0),
inference(backward_subsumption_resolution,[status(thm)],[c_9154,c_161]) ).
cnf(c_9159,plain,
~ intersect(union(sk2_esk2_0,sk2_esk3_0),sk2_esk1_0),
inference(rewriting,[status(thm)],[c_9156]) ).
cnf(c_9432,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_9421,c_9159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET624+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 21:22:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a6c02a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_0f13e4 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a6c02a.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ 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.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn false
% 0.20/0.42 % Has equality true
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 0.20/0.42
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a6c02a.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % warning: shown sat in sat incomplete mode
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 cnf(c_14,negated_conjecture,
% 0.20/0.43 ( intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_8) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_26,negated_conjecture,
% 0.20/0.43 ( intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_36,negated_conjecture,
% 0.20/0.43 ( intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_37,negated_conjecture,
% 0.20/0.43 ( intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_42,negated_conjecture,
% 0.20/0.43 ( intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_37]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_86,negated_conjecture,
% 0.20/0.43 ( intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_42]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_1,plain,
% 0.20/0.43 ( intersect(X0,X1) | ~ intersect(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_46_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_60,plain,
% 0.20/0.43 ( intersect(X0,X1) | ~ intersect(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_108,plain,
% 0.20/0.43 ( intersect(union(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_86,c_60]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_109,plain,
% 0.20/0.43 ( intersect(union(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_108]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_9,plain,
% 0.20/0.43 ( member(X0,X1) | member(X0,X2) | ~ member(X0,union(X1,X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_38_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_76,plain,
% 0.20/0.43 ( member(X0,X1) | member(X0,X2) | ~ member(X0,union(X1,X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_77,plain,
% 0.20/0.43 ( ~ member(X0,union(X1,X2)) | member(X0,X1) | member(X0,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_76]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_8,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,union(X1,X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_39_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_74,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,union(X1,X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_75,plain,
% 0.20/0.43 ( member(X0,union(X1,X2)) | ~ member(X0,X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_74]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_7,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,union(X2,X1)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_40_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_72,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,union(X2,X1)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_73,plain,
% 0.20/0.43 ( member(X0,union(X1,X2)) | ~ member(X0,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_72]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_6,plain,
% 0.20/0.43 ( ~ member(X0,X1) | ~ member(X0,X2) | intersect(X1,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_41_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_70,plain,
% 0.20/0.43 ( ~ member(X0,X1) | ~ member(X0,X2) | intersect(X1,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_71,plain,
% 0.20/0.43 ( intersect(X0,X1) | ~ member(X2,X0) | ~ member(X2,X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_70]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_5,plain,
% 0.20/0.43 ( member(sk1_esk1_2(X0,X1),X1) | ~ intersect(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_42_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_68,plain,
% 0.20/0.43 ( member(sk1_esk1_2(X0,X1),X1) | ~ intersect(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_69,plain,
% 0.20/0.43 ( ~ intersect(X0,X1) | member(sk1_esk1_2(X1,X0),X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_68]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_4,plain,
% 0.20/0.43 ( member(sk1_esk1_2(X0,X1),X0) | ~ intersect(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_43_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_66,plain,
% 0.20/0.43 ( member(sk1_esk1_2(X0,X1),X0) | ~ intersect(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_67,plain,
% 0.20/0.43 ( ~ intersect(X0,X1) | member(sk1_esk1_2(X1,X0),X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_66]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_13,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_7) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_24,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_35,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_38,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_35]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_41,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_38]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_84,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_41]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_12,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_6) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_22,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_34,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_39,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_40,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_82,negated_conjecture,
% 0.20/0.43 ( ~ intersect(sk3_esk1_0,union(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | ~ intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_40]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_11,plain,
% 0.20/0.43 ( ~ member(sk1_esk2_2(X0,X1),X1)
% 0.20/0.43 | ~ member(sk1_esk2_2(X0,X1),X0)
% 0.20/0.43 | X1 = X0 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_36_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_80,plain,
% 0.20/0.43 ( ~ member(sk1_esk2_2(X0,X1),X1)
% 0.20/0.43 | ~ member(sk1_esk2_2(X0,X1),X0)
% 0.20/0.43 | X1 = X0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_10,plain,
% 0.20/0.43 ( member(sk1_esk2_2(X0,X1),X1) | member(sk1_esk2_2(X0,X1),X0) | X1 = X0 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_37_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_78,plain,
% 0.20/0.43 ( member(sk1_esk2_2(X0,X1),X1) | member(sk1_esk2_2(X0,X1),X0) | X1 = X0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_3,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | X1 != X2 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_44_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_64,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | X1 != X2 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_2,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | X2 != X1 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_45_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_62,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | X2 != X1 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( union(X0,X1) = union(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p', c_0_47_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_58,plain,
% 0.20/0.43 ( union(X0,X1) = union(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 15
% 0.20/0.43 % num_of_input_neg_conjectures: 3
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 1
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 6
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.001
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.017
% 0.20/0.43 % num_of_symbols: 33
% 0.20/0.43 % num_of_terms: 100
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 21
% 0.20/0.43 % prop_num_of_clauses: 22
% 0.20/0.43 % prop_preprocess_simplified: 56
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 15
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 15
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 22
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 16
% 0.20/0.43 % res_num_of_loops: 11
% 0.20/0.43 % res_forward_subset_subsumed: 1
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 6
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 0
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 26
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 2
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unknown
% 0.20/0.46 % Orienting using strategy ClausalAll
% 0.20/0.46 % FOF problem with conjecture
% 0.20/0.46 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a6c02a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a1ca2f.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_21d106 | grep -v "SZS"
% 0.20/0.48
% 0.20/0.48 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.48
% 0.20/0.48 %
% 0.20/0.48 % ------ iProver source info
% 0.20/0.48
% 0.20/0.48 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.48 % git: non_committed_changes: true
% 0.20/0.48 % git: last_make_outside_of_git: true
% 0.20/0.48
% 0.20/0.48 %
% 0.20/0.48 % ------ Input Options
% 0.20/0.48
% 0.20/0.48 % --out_options all
% 0.20/0.48 % --tptp_safe_out true
% 0.20/0.48 % --problem_path ""
% 0.20/0.48 % --include_path ""
% 0.20/0.48 % --clausifier .//eprover
% 0.20/0.48 % --clausifier_options --tstp-format
% 0.20/0.48 % --stdin false
% 0.20/0.48 % --dbg_backtrace false
% 0.20/0.48 % --dbg_dump_prop_clauses false
% 0.20/0.48 % --dbg_dump_prop_clauses_file -
% 0.20/0.48 % --dbg_out_stat false
% 0.20/0.48
% 0.20/0.48 % ------ General Options
% 0.20/0.48
% 0.20/0.48 % --fof false
% 0.20/0.48 % --time_out_real 150.
% 0.20/0.48 % --time_out_prep_mult 0.2
% 0.20/0.48 % --time_out_virtual -1.
% 0.20/0.48 % --schedule none
% 0.20/0.48 % --ground_splitting input
% 0.20/0.48 % --splitting_nvd 16
% 0.20/0.48 % --non_eq_to_eq false
% 0.20/0.48 % --prep_gs_sim true
% 0.20/0.48 % --prep_unflatten false
% 0.20/0.48 % --prep_res_sim true
% 0.20/0.48 % --prep_upred true
% 0.20/0.48 % --res_sim_input true
% 0.20/0.48 % --clause_weak_htbl true
% 0.20/0.48 % --gc_record_bc_elim false
% 0.20/0.48 % --symbol_type_check false
% 0.20/0.48 % --clausify_out false
% 0.20/0.48 % --large_theory_mode false
% 0.20/0.48 % --prep_sem_filter none
% 0.20/0.48 % --prep_sem_filter_out false
% 0.20/0.48 % --preprocessed_out false
% 0.20/0.48 % --sub_typing false
% 0.20/0.48 % --brand_transform false
% 0.20/0.48 % --pure_diseq_elim true
% 0.20/0.48 % --min_unsat_core false
% 0.20/0.48 % --pred_elim true
% 0.20/0.48 % --add_important_lit false
% 0.20/0.48 % --soft_assumptions false
% 0.20/0.48 % --reset_solvers false
% 0.20/0.48 % --bc_imp_inh []
% 0.20/0.48 % --conj_cone_tolerance 1.5
% 0.20/0.48 % --prolific_symb_bound 500
% 0.20/0.48 % --lt_threshold 2000
% 0.20/0.48
% 0.20/0.48 % ------ SAT Options
% 0.20/0.48
% 0.20/0.48 % --sat_mode false
% 0.20/0.48 % --sat_fm_restart_options ""
% 0.20/0.48 % --sat_gr_def false
% 0.20/0.48 % --sat_epr_types true
% 0.20/0.48 % --sat_non_cyclic_types false
% 0.20/0.48 % --sat_finite_models false
% 0.20/0.48 % --sat_fm_lemmas false
% 0.20/0.48 % --sat_fm_prep false
% 0.20/0.48 % --sat_fm_uc_incr true
% 0.20/0.48 % --sat_out_model small
% 0.20/0.48 % --sat_out_clauses false
% 0.20/0.48
% 0.20/0.48 % ------ QBF Options
% 0.20/0.48
% 0.20/0.48 % --qbf_mode false
% 0.20/0.48 % --qbf_elim_univ true
% 0.20/0.48 % --qbf_sk_in true
% 0.20/0.48 % --qbf_pred_elim true
% 0.20/0.48 % --qbf_split 32
% 0.20/0.48
% 0.20/0.48 % ------ BMC1 Options
% 0.20/0.48
% 0.20/0.48 % --bmc1_incremental false
% 0.20/0.48 % --bmc1_axioms reachable_all
% 0.20/0.48 % --bmc1_min_bound 0
% 0.20/0.48 % --bmc1_max_bound -1
% 0.20/0.48 % --bmc1_max_bound_default -1
% 0.20/0.48 % --bmc1_symbol_reachability true
% 0.20/0.48 % --bmc1_property_lemmas false
% 0.20/0.48 % --bmc1_k_induction false
% 0.20/0.48 % --bmc1_non_equiv_states false
% 0.20/0.48 % --bmc1_deadlock false
% 0.20/0.48 % --bmc1_ucm false
% 0.20/0.48 % --bmc1_add_unsat_core none
% 0.20/0.48 % --bmc1_unsat_core_children false
% 0.20/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.48 % --bmc1_out_stat full
% 0.20/0.48 % --bmc1_ground_init false
% 0.20/0.48 % --bmc1_pre_inst_next_state false
% 0.20/0.48 % --bmc1_pre_inst_state false
% 0.20/0.48 % --bmc1_pre_inst_reach_state false
% 0.20/0.48 % --bmc1_out_unsat_core false
% 0.20/0.48 % --bmc1_aig_witness_out false
% 0.20/0.48 % --bmc1_verbose false
% 0.20/0.48 % --bmc1_dump_clauses_tptp false
% 0.20/0.49 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.49 % --bmc1_dump_file -
% 0.20/0.49 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.49 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.49 % --bmc1_ucm_extend_mode 1
% 0.20/0.49 % --bmc1_ucm_init_mode 2
% 0.20/0.49 % --bmc1_ucm_cone_mode none
% 0.20/0.49 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.49 % --bmc1_ucm_relax_model 4
% 0.20/0.49 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.49 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.49 % --bmc1_ucm_layered_model none
% 0.20/0.49 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.49
% 0.20/0.49 % ------ AIG Options
% 0.20/0.49
% 0.20/0.49 % --aig_mode false
% 0.20/0.49
% 0.20/0.49 % ------ Instantiation Options
% 0.20/0.49
% 0.20/0.49 % --instantiation_flag true
% 0.20/0.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.49 % --inst_solver_per_active 750
% 0.20/0.49 % --inst_solver_calls_frac 0.5
% 0.20/0.49 % --inst_passive_queue_type priority_queues
% 0.20/0.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.49 % --inst_passive_queues_freq [25;2]
% 0.20/0.49 % --inst_dismatching true
% 0.20/0.49 % --inst_eager_unprocessed_to_passive true
% 0.20/0.49 % --inst_prop_sim_given true
% 0.20/0.49 % --inst_prop_sim_new false
% 0.20/0.49 % --inst_orphan_elimination true
% 0.20/0.49 % --inst_learning_loop_flag true
% 0.20/0.49 % --inst_learning_start 3000
% 0.20/0.49 % --inst_learning_factor 2
% 0.20/0.49 % --inst_start_prop_sim_after_learn 3
% 0.20/0.49 % --inst_sel_renew solver
% 0.20/0.49 % --inst_lit_activity_flag true
% 0.20/0.49 % --inst_out_proof true
% 0.20/0.49
% 0.20/0.49 % ------ Resolution Options
% 0.20/0.49
% 0.20/0.49 % --resolution_flag true
% 0.20/0.49 % --res_lit_sel kbo_max
% 0.20/0.49 % --res_to_prop_solver none
% 0.20/0.49 % --res_prop_simpl_new false
% 0.20/0.49 % --res_prop_simpl_given false
% 0.20/0.49 % --res_passive_queue_type priority_queues
% 0.20/0.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.49 % --res_passive_queues_freq [15;5]
% 0.20/0.49 % --res_forward_subs full
% 0.20/0.49 % --res_backward_subs full
% 0.20/0.49 % --res_forward_subs_resolution true
% 0.20/0.49 % --res_backward_subs_resolution true
% 0.20/0.49 % --res_orphan_elimination false
% 0.20/0.49 % --res_time_limit 1000.
% 0.20/0.49 % --res_out_proof true
% 0.20/0.49 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a6c02a.s
% 0.20/0.49 % --modulo true
% 0.20/0.49
% 0.20/0.49 % ------ Combination Options
% 0.20/0.49
% 0.20/0.49 % --comb_res_mult 1000
% 0.20/0.49 % --comb_inst_mult 300
% 0.20/0.49 % ------
% 0.20/0.49
% 0.20/0.49 % ------ Parsing...% successful
% 0.20/0.49
% 0.20/0.49 % ------ 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.49
% 0.20/0.49 % ------ Proving...
% 0.20/0.49 % ------ Problem Properties
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % EPR false
% 0.20/0.49 % Horn false
% 0.20/0.49 % Has equality true
% 0.20/0.49
% 0.20/0.49 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 % % ------ Current options:
% 0.20/0.49
% 0.20/0.49 % ------ Input Options
% 0.20/0.49
% 0.20/0.49 % --out_options all
% 0.20/0.49 % --tptp_safe_out true
% 0.20/0.49 % --problem_path ""
% 0.20/0.49 % --include_path ""
% 0.20/0.49 % --clausifier .//eprover
% 0.20/0.49 % --clausifier_options --tstp-format
% 0.20/0.49 % --stdin false
% 0.20/0.49 % --dbg_backtrace false
% 0.20/0.49 % --dbg_dump_prop_clauses false
% 0.20/0.49 % --dbg_dump_prop_clauses_file -
% 0.20/0.49 % --dbg_out_stat false
% 0.20/0.49
% 0.20/0.49 % ------ General Options
% 0.20/0.49
% 0.20/0.49 % --fof false
% 0.20/0.49 % --time_out_real 150.
% 0.20/0.49 % --time_out_prep_mult 0.2
% 0.20/0.49 % --time_out_virtual -1.
% 0.20/0.49 % --schedule none
% 0.20/0.49 % --ground_splitting input
% 0.20/0.49 % --splitting_nvd 16
% 0.20/0.49 % --non_eq_to_eq false
% 0.20/0.49 % --prep_gs_sim true
% 0.20/0.49 % --prep_unflatten false
% 0.20/0.49 % --prep_res_sim true
% 0.20/0.49 % --prep_upred true
% 0.20/0.49 % --res_sim_input true
% 0.20/0.49 % --clause_weak_htbl true
% 0.20/0.49 % --gc_record_bc_elim false
% 0.20/0.49 % --symbol_type_check false
% 0.20/0.49 % --clausify_out false
% 0.20/0.49 % --large_theory_mode false
% 0.20/0.49 % --prep_sem_filter none
% 0.20/0.49 % --prep_sem_filter_out false
% 0.20/0.49 % --preprocessed_out false
% 0.20/0.49 % --sub_typing false
% 0.20/0.49 % --brand_transform false
% 0.20/0.49 % --pure_diseq_elim true
% 0.20/0.49 % --min_unsat_core false
% 0.20/0.49 % --pred_elim true
% 0.20/0.49 % --add_important_lit false
% 0.20/0.49 % --soft_assumptions false
% 0.20/0.49 % --reset_solvers false
% 0.20/0.49 % --bc_imp_inh []
% 0.20/0.49 % --conj_cone_tolerance 1.5
% 0.20/0.49 % --prolific_symb_bound 500
% 0.20/0.49 % --lt_threshold 2000
% 0.20/0.49
% 0.20/0.49 % ------ SAT Options
% 0.20/0.49
% 0.20/0.49 % --sat_mode false
% 0.20/0.49 % --sat_fm_restart_options ""
% 0.20/0.49 % --sat_gr_def false
% 0.20/0.49 % --sat_epr_types true
% 0.20/0.49 % --sat_non_cyclic_types false
% 0.20/0.49 % --sat_finite_models false
% 0.20/0.49 % --sat_fm_lemmas false
% 0.20/0.49 % --sat_fm_prep false
% 0.20/0.49 % --sat_fm_uc_incr true
% 0.20/0.49 % --sat_out_model small
% 0.20/0.49 % --sat_out_clauses false
% 0.20/0.49
% 0.20/0.49 % ------ QBF Options
% 0.20/0.49
% 0.20/0.49 % --qbf_mode false
% 0.20/0.49 % --qbf_elim_univ true
% 0.20/0.49 % --qbf_sk_in true
% 0.20/0.49 % --qbf_pred_elim true
% 0.20/0.49 % --qbf_split 32
% 0.20/0.49
% 0.20/0.49 % ------ BMC1 Options
% 0.20/0.49
% 0.20/0.49 % --bmc1_incremental false
% 0.20/0.49 % --bmc1_axioms reachable_all
% 0.20/0.49 % --bmc1_min_bound 0
% 0.20/0.49 % --bmc1_max_bound -1
% 0.20/0.49 % --bmc1_max_bound_default -1
% 0.20/0.49 % --bmc1_symbol_reachability true
% 0.20/0.49 % --bmc1_property_lemmas false
% 0.20/0.49 % --bmc1_k_induction false
% 0.20/0.49 % --bmc1_non_equiv_states false
% 0.20/0.49 % --bmc1_deadlock false
% 0.20/0.49 % --bmc1_ucm false
% 0.20/0.49 % --bmc1_add_unsat_core none
% 0.20/0.49 % --bmc1_unsat_core_children false
% 0.20/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.49 % --bmc1_out_stat full
% 0.20/0.49 % --bmc1_ground_init false
% 0.20/0.49 % --bmc1_pre_inst_next_state false
% 0.20/0.49 % --bmc1_pre_inst_state false
% 0.20/0.49 % --bmc1_pre_inst_reach_state false
% 0.20/0.49 % --bmc1_out_unsat_core false
% 0.20/0.49 % --bmc1_aig_witness_out false
% 0.20/0.49 % --bmc1_verbose false
% 0.20/0.49 % --bmc1_dump_clauses_tptp false
% 0.20/0.49 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.49 % --bmc1_dump_file -
% 0.20/0.49 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.49 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.49 % --bmc1_ucm_extend_mode 1
% 0.20/0.49 % --bmc1_ucm_init_mode 2
% 0.20/0.49 % --bmc1_ucm_cone_mode none
% 0.20/0.49 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.49 % --bmc1_ucm_relax_model 4
% 0.20/0.49 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.49 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.49 % --bmc1_ucm_layered_model none
% 0.20/0.49 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.49
% 0.20/0.49 % ------ AIG Options
% 0.20/0.49
% 0.20/0.49 % --aig_mode false
% 0.20/0.49
% 0.20/0.49 % ------ Instantiation Options
% 0.20/0.49
% 0.20/0.49 % --instantiation_flag true
% 0.20/0.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.49 % --inst_solver_per_active 750
% 0.20/0.49 % --inst_solver_calls_frac 0.5
% 0.20/0.49 % --inst_passive_queue_type priority_queues
% 0.20/0.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.49 % --inst_passive_queues_freq [25;2]
% 0.20/0.49 % --inst_dismatching true
% 0.20/0.49 % --inst_eager_unprocessed_to_passive true
% 0.20/0.49 % --inst_prop_sim_given true
% 0.46/0.65 % --inst_prop_sim_new false
% 0.46/0.65 % --inst_orphan_elimination true
% 0.46/0.65 % --inst_learning_loop_flag true
% 0.46/0.65 % --inst_learning_start 3000
% 0.46/0.65 % --inst_learning_factor 2
% 0.46/0.65 % --inst_start_prop_sim_after_learn 3
% 0.46/0.65 % --inst_sel_renew solver
% 0.46/0.65 % --inst_lit_activity_flag true
% 0.46/0.65 % --inst_out_proof true
% 0.46/0.65
% 0.46/0.65 % ------ Resolution Options
% 0.46/0.65
% 0.46/0.65 % --resolution_flag true
% 0.46/0.65 % --res_lit_sel kbo_max
% 0.46/0.65 % --res_to_prop_solver none
% 0.46/0.65 % --res_prop_simpl_new false
% 0.46/0.65 % --res_prop_simpl_given false
% 0.46/0.65 % --res_passive_queue_type priority_queues
% 0.46/0.65 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.46/0.65 % --res_passive_queues_freq [15;5]
% 0.46/0.65 % --res_forward_subs full
% 0.46/0.65 % --res_backward_subs full
% 0.46/0.65 % --res_forward_subs_resolution true
% 0.46/0.65 % --res_backward_subs_resolution true
% 0.46/0.65 % --res_orphan_elimination false
% 0.46/0.65 % --res_time_limit 1000.
% 0.46/0.65 % --res_out_proof true
% 0.46/0.65 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a6c02a.s
% 0.46/0.65 % --modulo true
% 0.46/0.65
% 0.46/0.65 % ------ Combination Options
% 0.46/0.65
% 0.46/0.65 % --comb_res_mult 1000
% 0.46/0.65 % --comb_inst_mult 300
% 0.46/0.65 % ------
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 % ------ Proving...
% 0.46/0.65 %
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 % Resolution empty clause
% 0.46/0.65
% 0.46/0.65 % ------ Statistics
% 0.46/0.65
% 0.46/0.65 % ------ General
% 0.46/0.65
% 0.46/0.65 % num_of_input_clauses: 32
% 0.46/0.65 % num_of_input_neg_conjectures: 3
% 0.46/0.65 % num_of_splits: 0
% 0.46/0.65 % num_of_split_atoms: 0
% 0.46/0.65 % num_of_sem_filtered_clauses: 0
% 0.46/0.65 % num_of_subtypes: 0
% 0.46/0.65 % monotx_restored_types: 0
% 0.46/0.65 % sat_num_of_epr_types: 0
% 0.46/0.65 % sat_num_of_non_cyclic_types: 0
% 0.46/0.65 % sat_guarded_non_collapsed_types: 0
% 0.46/0.65 % is_epr: 0
% 0.46/0.65 % is_horn: 0
% 0.46/0.65 % has_eq: 1
% 0.46/0.65 % num_pure_diseq_elim: 0
% 0.46/0.65 % simp_replaced_by: 0
% 0.46/0.65 % res_preprocessed: 6
% 0.46/0.65 % prep_upred: 0
% 0.46/0.65 % prep_unflattend: 0
% 0.46/0.65 % pred_elim_cands: 0
% 0.46/0.65 % pred_elim: 0
% 0.46/0.65 % pred_elim_cl: 0
% 0.46/0.65 % pred_elim_cycles: 0
% 0.46/0.65 % forced_gc_time: 0
% 0.46/0.65 % gc_basic_clause_elim: 0
% 0.46/0.65 % parsing_time: 0.
% 0.46/0.65 % sem_filter_time: 0.
% 0.46/0.65 % pred_elim_time: 0.
% 0.46/0.65 % out_proof_time: 0.001
% 0.46/0.65 % monotx_time: 0.
% 0.46/0.65 % subtype_inf_time: 0.
% 0.46/0.65 % unif_index_cands_time: 0.
% 0.46/0.65 % unif_index_add_time: 0.001
% 0.46/0.65 % total_time: 0.182
% 0.46/0.65 % num_of_symbols: 33
% 0.46/0.65 % num_of_terms: 1886
% 0.46/0.65
% 0.46/0.65 % ------ Propositional Solver
% 0.46/0.65
% 0.46/0.65 % prop_solver_calls: 1
% 0.46/0.65 % prop_fast_solver_calls: 21
% 0.46/0.65 % prop_num_of_clauses: 28
% 0.46/0.65 % prop_preprocess_simplified: 118
% 0.46/0.65 % prop_fo_subsumed: 0
% 0.46/0.65 % prop_solver_time: 0.
% 0.46/0.65 % prop_fast_solver_time: 0.
% 0.46/0.65 % prop_unsat_core_time: 0.
% 0.46/0.65
% 0.46/0.65 % ------ QBF
% 0.46/0.65
% 0.46/0.65 % qbf_q_res: 0
% 0.46/0.65 % qbf_num_tautologies: 0
% 0.46/0.65 % qbf_prep_cycles: 0
% 0.46/0.65
% 0.46/0.65 % ------ BMC1
% 0.46/0.65
% 0.46/0.65 % bmc1_current_bound: -1
% 0.46/0.65 % bmc1_last_solved_bound: -1
% 0.46/0.65 % bmc1_unsat_core_size: -1
% 0.46/0.65 % bmc1_unsat_core_parents_size: -1
% 0.46/0.65 % bmc1_merge_next_fun: 0
% 0.46/0.65 % bmc1_unsat_core_clauses_time: 0.
% 0.46/0.65
% 0.46/0.65 % ------ Instantiation
% 0.46/0.65
% 0.46/0.65 % inst_num_of_clauses: 32
% 0.46/0.65 % inst_num_in_passive: 0
% 0.46/0.65 % inst_num_in_active: 0
% 0.46/0.65 % inst_num_in_unprocessed: 32
% 0.46/0.65 % inst_num_of_loops: 0
% 0.46/0.65 % inst_num_of_learning_restarts: 0
% 0.46/0.65 % inst_num_moves_active_passive: 0
% 0.46/0.65 % inst_lit_activity: 0
% 0.46/0.65 % inst_lit_activity_moves: 0
% 0.46/0.65 % inst_num_tautologies: 0
% 0.46/0.65 % inst_num_prop_implied: 0
% 0.46/0.65 % inst_num_existing_simplified: 0
% 0.46/0.65 % inst_num_eq_res_simplified: 0
% 0.46/0.65 % inst_num_child_elim: 0
% 0.46/0.65 % inst_num_of_dismatching_blockings: 0
% 0.46/0.65 % inst_num_of_non_proper_insts: 0
% 0.46/0.65 % inst_num_of_duplicates: 0
% 0.46/0.65 % inst_inst_num_from_inst_to_res: 0
% 0.46/0.65 % inst_dismatching_checking_time: 0.
% 0.46/0.65
% 0.46/0.65 % ------ Resolution
% 0.46/0.65
% 0.46/0.65 % res_num_of_clauses: 137
% 0.46/0.65 % res_num_in_passive: 93
% 0.46/0.65 % res_num_in_active: 45
% 0.46/0.65 % res_num_of_loops: 657
% 0.46/0.65 % res_forward_subset_subsumed: 1312
% 0.46/0.65 % res_backward_subset_subsumed: 546
% 0.46/0.65 % res_forward_subsumed: 86
% 0.46/0.65 % res_backward_subsumed: 443
% 0.46/0.65 % res_forward_subsumption_resolution: 4
% 0.46/0.65 % res_backward_subsumption_resolution: 3
% 0.46/0.65 % res_clause_to_clause_subsumption: 14951
% 0.46/0.65 % res_orphan_elimination: 0
% 0.46/0.65 % res_tautology_del: 57
% 0.46/0.65 % res_num_eq_res_simplified: 0
% 0.46/0.65 % res_num_sel_changes: 0
% 0.46/0.65 % res_moves_from_active_to_pass: 0
% 0.46/0.65
% 0.46/0.65 % Status Unsatisfiable
% 0.46/0.65 % SZS status Theorem
% 0.46/0.65 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------