TSTP Solution File: SET183+3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET183+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n014.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:11:23 EDT 2022
% Result : Theorem 5.59s 5.77s
% Output : CNFRefutation 5.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 116 ( 25 unt; 0 def)
% Number of atoms : 289 ( 62 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 300 ( 127 ~; 145 |; 14 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 251 ( 13 sgn 62 !; 0 ?)
% 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,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('<stdin>',intersection_defn) ).
fof(c_0_2,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('<stdin>',subset_defn) ).
fof(c_0_3,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',equal_defn) ).
fof(c_0_4,axiom,
! [X1,X2] : subset(intersection(X1,X2),X1),
file('<stdin>',intersection_is_subset) ).
fof(c_0_5,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('<stdin>',commutativity_of_intersection) ).
fof(c_0_6,axiom,
! [X1] : subset(X1,X1),
file('<stdin>',reflexivity_of_subset) ).
fof(c_0_7,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
c_0_0 ).
fof(c_0_8,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
c_0_1 ).
fof(c_0_9,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_2 ).
fof(c_0_10,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_3 ).
fof(c_0_11,axiom,
! [X1,X2] : subset(intersection(X1,X2),X1),
c_0_4 ).
fof(c_0_12,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
c_0_5 ).
fof(c_0_13,axiom,
! [X1] : subset(X1,X1),
c_0_6 ).
fof(c_0_14,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_7])])])])])]) ).
fof(c_0_15,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( member(X6,X4)
| ~ member(X6,intersection(X4,X5)) )
& ( member(X6,X5)
| ~ member(X6,intersection(X4,X5)) )
& ( ~ member(X9,X7)
| ~ member(X9,X8)
| member(X9,intersection(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_8])])])])]) ).
fof(c_0_16,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk1_2(X7,X8),X7)
| subset(X7,X8) )
& ( ~ member(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_9])])])])])]) ).
fof(c_0_17,plain,
! [X3,X4,X5,X6] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X5,X6)
| ~ subset(X6,X5)
| X5 = X6 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_18,plain,
! [X3,X4] : subset(intersection(X3,X4),X3),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X2] : subset(X2,X2),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_31,plain,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,plain,
subset(intersection(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,plain,
( subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_35,plain,
( subset(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_36,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_37,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
c_0_21,
[final] ).
cnf(c_0_38,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
c_0_22,
[final] ).
cnf(c_0_39,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
c_0_23,
[final] ).
cnf(c_0_40,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
c_0_24,
[final] ).
cnf(c_0_41,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_25,
[final] ).
cnf(c_0_42,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_26,
[final] ).
cnf(c_0_43,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
c_0_27,
[final] ).
cnf(c_0_44,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
c_0_28,
[final] ).
cnf(c_0_45,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_29,
[final] ).
cnf(c_0_46,plain,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
c_0_30,
[final] ).
cnf(c_0_47,plain,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
c_0_31,
[final] ).
cnf(c_0_48,plain,
subset(intersection(X1,X2),X1),
c_0_32,
[final] ).
cnf(c_0_49,plain,
intersection(X1,X2) = intersection(X2,X1),
c_0_33,
[final] ).
cnf(c_0_50,plain,
( subset(X1,X2)
| X1 != X2 ),
c_0_34,
[final] ).
cnf(c_0_51,plain,
( subset(X2,X1)
| X1 != X2 ),
c_0_35,
[final] ).
cnf(c_0_52,plain,
subset(X1,X1),
c_0_36,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_37_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_37]) ).
cnf(c_0_37_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_37]) ).
cnf(c_0_37_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_37]) ).
cnf(c_0_38_0,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_1,axiom,
( ~ member(X1,X3)
| member(X1,intersection(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_2,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_39_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_39]) ).
cnf(c_0_39_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_39]) ).
cnf(c_0_39_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_39]) ).
cnf(c_0_40_0,axiom,
( subset(X1,X2)
| ~ member(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_1,axiom,
( ~ member(sk1_esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_41_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_41_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_42_0,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_43_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_2,axiom,
( ~ subset(X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_44_0,axiom,
( subset(X1,X2)
| member(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( member(sk1_esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( ~ subset(X2,X1)
| X1 = X2
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_2,axiom,
( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( X1 != X2
| member(X3,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_2,axiom,
( ~ member(X3,X1)
| X1 != X2
| member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_47_0,axiom,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_1,axiom,
( X1 != X2
| member(X3,X1)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_2,axiom,
( ~ member(X3,X2)
| X1 != X2
| member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_50_0,axiom,
( subset(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_1,axiom,
( X1 != X2
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
( subset(X2,X1)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_1,axiom,
( X1 != X2
| subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_48_0,axiom,
subset(intersection(X1,X2),X1),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
intersection(X1,X2) = intersection(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_52_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> intersection(X1,X2) = X1 ),
file('<stdin>',prove_subset_intersection) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> intersection(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( subset(esk1_0,esk2_0)
& intersection(esk1_0,esk2_0) != esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
intersection(esk1_0,esk2_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
intersection(esk1_0,esk2_0) != esk1_0,
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
subset(esk1_0,esk2_0),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_18,plain,
( member(X0,X1)
| ~ member(X0,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p',c_0_43_2) ).
cnf(c_81,plain,
( member(X0,X1)
| ~ member(X0,X2)
| ~ subset(X2,X1) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_57470,plain,
( ~ subset(sk2_esk1_0,X0)
| ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0)
| member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),X0) ),
inference(instantiation,[status(thm)],[c_81]) ).
cnf(c_57576,plain,
( ~ subset(sk2_esk1_0,sk2_esk2_0)
| ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0)
| member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_57470]) ).
cnf(c_32,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p',c_0_38_0) ).
cnf(c_95,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_57474,plain,
( member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),intersection(sk2_esk1_0,X0))
| ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0)
| ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),X0) ),
inference(instantiation,[status(thm)],[c_95]) ).
cnf(c_57573,plain,
( member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),intersection(sk2_esk1_0,sk2_esk2_0))
| ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0)
| ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_57474]) ).
cnf(c_24,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p',c_0_41_0) ).
cnf(c_87,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_57457,plain,
( ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),intersection(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_33,plain,
( X0 = X1
| ~ member(sk1_esk2_2(X0,X1),X1)
| ~ member(sk1_esk2_2(X0,X1),X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p',c_0_37_2) ).
cnf(c_96,plain,
( X0 = X1
| ~ member(sk1_esk2_2(X0,X1),X1)
| ~ member(sk1_esk2_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_57429,plain,
( ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),intersection(sk2_esk1_0,sk2_esk2_0))
| ~ member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0)
| intersection(sk2_esk1_0,sk2_esk2_0) = sk2_esk1_0 ),
inference(instantiation,[status(thm)],[c_96]) ).
cnf(c_27,plain,
( X0 = X1
| member(sk1_esk2_2(X0,X1),X1)
| member(sk1_esk2_2(X0,X1),X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p',c_0_39_2) ).
cnf(c_90,plain,
( X0 = X1
| member(sk1_esk2_2(X0,X1),X1)
| member(sk1_esk2_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_57426,plain,
( member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),intersection(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk2_2(intersection(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0)
| intersection(sk2_esk1_0,sk2_esk2_0) = sk2_esk1_0 ),
inference(instantiation,[status(thm)],[c_90]) ).
cnf(c_36,negated_conjecture,
intersection(sk2_esk1_0,sk2_esk2_0) != sk2_esk1_0,
file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p',c_0_5) ).
cnf(c_37,negated_conjecture,
subset(sk2_esk1_0,sk2_esk2_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p',c_0_6) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_57576,c_57573,c_57457,c_57429,c_57426,c_36,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET183+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jul 10 21:58:35 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % Running in mono-core mode
% 0.21/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42 % FOF problem with conjecture
% 0.21/0.42 % 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_111bcb.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_19a9aa | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_111bcb.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45 % ------ Parsing...% successful
% 0.21/0.45
% 0.21/0.45 % ------ 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.45
% 0.21/0.45 % ------ Proving...
% 0.21/0.45 % ------ Problem Properties
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % EPR false
% 0.21/0.45 % Horn false
% 0.21/0.45 % Has equality true
% 0.21/0.45
% 0.21/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % % ------ Current options:
% 0.21/0.45
% 0.21/0.45 % ------ Input Options
% 0.21/0.45
% 0.21/0.45 % --out_options all
% 0.21/0.45 % --tptp_safe_out true
% 0.21/0.45 % --problem_path ""
% 0.21/0.45 % --include_path ""
% 0.21/0.45 % --clausifier .//eprover
% 0.21/0.45 % --clausifier_options --tstp-format
% 0.21/0.45 % --stdin false
% 0.21/0.45 % --dbg_backtrace false
% 0.21/0.45 % --dbg_dump_prop_clauses false
% 0.21/0.45 % --dbg_dump_prop_clauses_file -
% 0.21/0.45 % --dbg_out_stat false
% 0.21/0.45
% 0.21/0.45 % ------ General Options
% 0.21/0.45
% 0.21/0.45 % --fof false
% 0.21/0.45 % --time_out_real 150.
% 0.21/0.45 % --time_out_prep_mult 0.2
% 0.21/0.45 % --time_out_virtual -1.
% 0.21/0.45 % --schedule none
% 0.21/0.45 % --ground_splitting input
% 0.21/0.45 % --splitting_nvd 16
% 0.21/0.45 % --non_eq_to_eq false
% 0.21/0.45 % --prep_gs_sim true
% 0.21/0.45 % --prep_unflatten false
% 0.21/0.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_111bcb.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % ------ Proving...
% 0.21/0.45 % warning: shown sat in sat incomplete mode
% 0.21/0.45 %
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 cnf(c_16,negated_conjecture,
% 0.21/0.45 ( intersection(sk3_esk1_0,sk3_esk2_0) != sk3_esk1_0 ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_5) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_29,negated_conjecture,
% 0.21/0.45 ( intersection(sk3_esk1_0,sk3_esk2_0) != sk3_esk1_0 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_16]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_37,negated_conjecture,
% 0.21/0.45 ( intersection(sk3_esk1_0,sk3_esk2_0) != sk3_esk1_0 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_29]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_40,negated_conjecture,
% 0.21/0.45 ( intersection(sk3_esk1_0,sk3_esk2_0) != sk3_esk1_0 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_37]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_41,negated_conjecture,
% 0.21/0.45 ( intersection(sk3_esk1_0,sk3_esk2_0) != sk3_esk1_0 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_40]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_93,negated_conjecture,
% 0.21/0.45 ( intersection(sk3_esk1_0,sk3_esk2_0) != sk3_esk1_0 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_41]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_15,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(X0,X1),X1)
% 0.21/0.45 | ~ member(sk1_esk2_2(X0,X1),X0)
% 0.21/0.45 | X1 = X0 ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_49_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_91,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(X0,X1),X1)
% 0.21/0.45 | ~ member(sk1_esk2_2(X0,X1),X0)
% 0.21/0.45 | X1 = X0 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_15]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_103,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.21/0.45 | ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0) ),
% 0.21/0.45 inference(resolution,[status(thm)],[c_93,c_91]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_106,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.21/0.45 | ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_103]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_11,plain,
% 0.21/0.45 ( member(X0,X1) | ~ member(X0,intersection(X1,X2)) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_53_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_83,plain,
% 0.21/0.45 ( member(X0,X1) | ~ member(X0,intersection(X1,X2)) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_11]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_84,plain,
% 0.21/0.45 ( ~ member(X0,intersection(X1,X2)) | member(X0,X1) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_83]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_125,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0)) ),
% 0.21/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_106,c_84]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_126,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0)) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_125]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_14,plain,
% 0.21/0.45 ( ~ member(X0,X1) | ~ member(X0,X2) | member(X0,intersection(X1,X2)) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_50_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_89,plain,
% 0.21/0.45 ( ~ member(X0,X1) | ~ member(X0,X2) | member(X0,intersection(X1,X2)) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_14]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_90,plain,
% 0.21/0.45 ( member(X0,intersection(X1,X2)) | ~ member(X0,X1) | ~ member(X0,X2) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_89]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_128,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.21/0.45 | ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0) ),
% 0.21/0.45 inference(resolution,[status(thm)],[c_126,c_90]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_129,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.21/0.45 | ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_128]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_13,plain,
% 0.21/0.45 ( member(sk1_esk2_2(X0,X1),X1) | member(sk1_esk2_2(X0,X1),X0) | X1 = X0 ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_51_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_87,plain,
% 0.21/0.45 ( member(sk1_esk2_2(X0,X1),X1) | member(sk1_esk2_2(X0,X1),X0) | X1 = X0 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_13]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_104,plain,
% 0.21/0.45 ( member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.21/0.45 | member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0) ),
% 0.21/0.45 inference(resolution,[status(thm)],[c_93,c_87]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_105,plain,
% 0.21/0.45 ( member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.21/0.45 | member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_104]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_120,plain,
% 0.21/0.45 ( member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0) ),
% 0.21/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_105,c_84]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_121,plain,
% 0.21/0.45 ( member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_120]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_132,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0) ),
% 0.21/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_129,c_121]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_133,plain,
% 0.21/0.45 ( ~ member(sk1_esk2_2(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_132]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_9,plain,
% 0.21/0.45 ( ~ subset(X0,X1) | ~ subset(X1,X0) | X0 = X1 ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_55_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_79,plain,
% 0.21/0.45 ( ~ subset(X0,X1) | ~ subset(X1,X0) | X0 = X1 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_9]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_107,plain,
% 0.21/0.45 ( ~ subset(intersection(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0)
% 0.21/0.45 | ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)) ),
% 0.21/0.45 inference(resolution,[status(thm)],[c_93,c_79]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_108,plain,
% 0.21/0.45 ( ~ subset(intersection(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0)
% 0.21/0.45 | ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_107]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_1,plain,
% 0.21/0.45 ( subset(intersection(X0,X1),X0) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_63_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_63,plain,
% 0.21/0.45 ( subset(intersection(X0,X1),X0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_1]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_111,plain,
% 0.21/0.45 ( ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)) ),
% 0.21/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_108,c_63]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_112,plain,
% 0.21/0.45 ( ~ subset(sk3_esk1_0,intersection(sk3_esk1_0,sk3_esk2_0)) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_111]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_12,plain,
% 0.21/0.45 ( ~ member(sk1_esk1_2(X0,X1),X0) | subset(X1,X0) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_52_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_85,plain,
% 0.21/0.45 ( ~ member(sk1_esk1_2(X0,X1),X0) | subset(X1,X0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_12]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_86,plain,
% 0.21/0.45 ( subset(X0,X1) | ~ member(sk1_esk1_2(X1,X0),X1) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_85]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_10,plain,
% 0.21/0.45 ( member(X0,X1) | ~ member(X0,intersection(X2,X1)) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_54_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_81,plain,
% 0.21/0.45 ( member(X0,X1) | ~ member(X0,intersection(X2,X1)) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_10]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_82,plain,
% 0.21/0.45 ( ~ member(X0,intersection(X1,X2)) | member(X0,X2) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_81]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_8,plain,
% 0.21/0.45 ( member(sk1_esk1_2(X0,X1),X1) | subset(X1,X0) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_56_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_77,plain,
% 0.21/0.45 ( member(sk1_esk1_2(X0,X1),X1) | subset(X1,X0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_8]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_78,plain,
% 0.21/0.45 ( subset(X0,X1) | member(sk1_esk1_2(X1,X0),X0) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_77]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_5,plain,
% 0.21/0.45 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_59_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_71,plain,
% 0.21/0.45 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_5]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_72,plain,
% 0.21/0.45 ( ~ subset(X0,X1) | ~ member(X2,X0) | member(X2,X1) ),
% 0.21/0.45 inference(rewriting,[status(thm)],[c_71]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_17,negated_conjecture,
% 0.21/0.45 ( subset(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_6) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_31,negated_conjecture,
% 0.21/0.45 ( subset(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_17]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_38,negated_conjecture,
% 0.21/0.45 ( subset(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_31]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_39,negated_conjecture,
% 0.21/0.45 ( subset(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_38]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_42,negated_conjecture,
% 0.21/0.45 ( subset(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_39]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_95,negated_conjecture,
% 0.21/0.45 ( subset(sk3_esk1_0,sk3_esk2_0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_42]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_7,plain,
% 0.21/0.45 ( ~ member(X0,X1) | member(X0,X2) | X1 != X2 ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_57_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_75,plain,
% 0.21/0.45 ( ~ member(X0,X1) | member(X0,X2) | X1 != X2 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_7]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_6,plain,
% 0.21/0.45 ( ~ member(X0,X1) | member(X0,X2) | X2 != X1 ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_58_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_73,plain,
% 0.21/0.45 ( ~ member(X0,X1) | member(X0,X2) | X2 != X1 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_6]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_4,plain,
% 0.21/0.45 ( subset(X0,X1) | X0 != X1 ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_60_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_69,plain,
% 0.21/0.45 ( subset(X0,X1) | X0 != X1 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_4]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_3,plain,
% 0.21/0.45 ( subset(X0,X1) | X1 != X0 ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_61_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_67,plain,
% 0.21/0.45 ( subset(X0,X1) | X1 != X0 ),
% 0.21/0.45 inference(copy,[status(esa)],[c_3]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_2,plain,
% 0.21/0.45 ( intersection(X0,X1) = intersection(X1,X0) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_62_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_65,plain,
% 0.21/0.45 ( intersection(X0,X1) = intersection(X1,X0) ),
% 0.21/0.45 inference(copy,[status(esa)],[c_2]) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_0,plain,
% 0.21/0.45 ( subset(X0,X0) ),
% 0.21/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p', c_0_64_0) ).
% 0.21/0.45
% 0.21/0.45 cnf(c_61,plain,( subset(X0,X0) ),inference(copy,[status(esa)],[c_0]) ).
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % ------ Statistics
% 0.21/0.45
% 0.21/0.45 % ------ General
% 0.21/0.45
% 0.21/0.45 % num_of_input_clauses: 18
% 0.21/0.45 % num_of_input_neg_conjectures: 2
% 0.21/0.45 % num_of_splits: 0
% 0.21/0.45 % num_of_split_atoms: 0
% 0.21/0.45 % num_of_sem_filtered_clauses: 0
% 0.21/0.45 % num_of_subtypes: 0
% 0.21/0.45 % monotx_restored_types: 0
% 0.21/0.45 % sat_num_of_epr_types: 0
% 0.21/0.45 % sat_num_of_non_cyclic_types: 0
% 0.21/0.45 % sat_guarded_non_collapsed_types: 0
% 0.21/0.45 % is_epr: 0
% 0.21/0.45 % is_horn: 0
% 0.21/0.45 % has_eq: 1
% 0.21/0.45 % num_pure_diseq_elim: 0
% 0.21/0.45 % simp_replaced_by: 0
% 0.21/0.45 % res_preprocessed: 4
% 0.21/0.45 % prep_upred: 0
% 0.21/0.45 % prep_unflattend: 0
% 0.21/0.45 % pred_elim_cands: 0
% 0.21/0.45 % pred_elim: 0
% 0.21/0.45 % pred_elim_cl: 0
% 0.21/0.45 % pred_elim_cycles: 0
% 0.21/0.45 % forced_gc_time: 0
% 0.21/0.45 % gc_basic_clause_elim: 0
% 0.21/0.45 % parsing_time: 0.
% 0.21/0.45 % sem_filter_time: 0.
% 0.21/0.45 % pred_elim_time: 0.
% 0.21/0.45 % out_proof_time: 0.
% 0.21/0.45 % monotx_time: 0.
% 0.21/0.45 % subtype_inf_time: 0.
% 0.21/0.45 % unif_index_cands_time: 0.
% 0.21/0.45 % unif_index_add_time: 0.
% 0.21/0.45 % total_time: 0.027
% 0.21/0.45 % num_of_symbols: 32
% 0.21/0.45 % num_of_terms: 104
% 0.21/0.45
% 0.21/0.45 % ------ Propositional Solver
% 0.21/0.45
% 0.21/0.45 % prop_solver_calls: 1
% 0.21/0.45 % prop_fast_solver_calls: 6
% 0.21/0.45 % prop_num_of_clauses: 29
% 0.21/0.45 % prop_preprocess_simplified: 55
% 0.21/0.45 % prop_fo_subsumed: 0
% 0.21/0.45 % prop_solver_time: 0.
% 0.21/0.45 % prop_fast_solver_time: 0.
% 0.21/0.45 % prop_unsat_core_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ QBF
% 0.21/0.45
% 0.21/0.45 % qbf_q_res: 0
% 0.21/0.45 % qbf_num_tautologies: 0
% 0.21/0.45 % qbf_prep_cycles: 0
% 0.21/0.45
% 0.21/0.45 % ------ BMC1
% 0.21/0.45
% 0.21/0.45 % bmc1_current_bound: -1
% 0.21/0.45 % bmc1_last_solved_bound: -1
% 0.21/0.45 % bmc1_unsat_core_size: -1
% 0.21/0.45 % bmc1_unsat_core_parents_size: -1
% 0.21/0.45 % bmc1_merge_next_fun: 0
% 0.21/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation
% 0.21/0.45
% 0.21/0.45 % inst_num_of_clauses: 18
% 0.21/0.45 % inst_num_in_passive: 0
% 0.21/0.45 % inst_num_in_active: 0
% 0.21/0.45 % inst_num_in_unprocessed: 18
% 0.21/0.45 % inst_num_of_loops: 0
% 0.21/0.45 % inst_num_of_learning_restarts: 0
% 0.21/0.45 % inst_num_moves_active_passive: 0
% 0.21/0.45 % inst_lit_activity: 0
% 0.21/0.45 % inst_lit_activity_moves: 0
% 0.21/0.45 % inst_num_tautologies: 0
% 0.21/0.45 % inst_num_prop_implied: 0
% 0.21/0.45 % inst_num_existing_simplified: 0
% 0.21/0.45 % inst_num_eq_res_simplified: 0
% 0.21/0.45 % inst_num_child_elim: 0
% 0.21/0.45 % inst_num_of_dismatching_blockings: 0
% 0.21/0.45 % inst_num_of_non_proper_insts: 0
% 0.21/0.45 % inst_num_of_duplicates: 0
% 0.21/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.45 % inst_dismatching_checking_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Resolution
% 0.21/0.45
% 0.21/0.45 % res_num_of_clauses: 28
% 0.21/0.45 % res_num_in_passive: 0
% 0.21/0.45 % res_num_in_active: 22
% 0.21/0.45 % res_num_of_loops: 10
% 0.21/0.45 % res_forward_subset_subsumed: 0
% 0.21/0.45 % res_backward_subset_subsumed: 0
% 0.21/0.45 % res_forward_subsumed: 3
% 0.21/0.45 % res_backward_subsumed: 0
% 0.21/0.45 % res_forward_subsumption_resolution: 4
% 0.21/0.45 % res_backward_subsumption_resolution: 0
% 0.21/0.45 % res_clause_to_clause_subsumption: 15
% 0.21/0.45 % res_orphan_elimination: 0
% 0.21/0.45 % res_tautology_del: 0
% 0.21/0.45 % res_num_eq_res_simplified: 0
% 0.21/0.45 % res_num_sel_changes: 0
% 0.21/0.45 % res_moves_from_active_to_pass: 0
% 0.21/0.45
% 0.21/0.45 % Status Unknown
% 0.21/0.50 % Orienting using strategy ClausalAll
% 0.21/0.50 % FOF problem with conjecture
% 0.21/0.50 % 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_111bcb.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_ce79ca.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_55e04a | grep -v "SZS"
% 0.21/0.52
% 0.21/0.52 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.52
% 0.21/0.52 %
% 0.21/0.52 % ------ iProver source info
% 0.21/0.52
% 0.21/0.52 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.52 % git: non_committed_changes: true
% 0.21/0.52 % git: last_make_outside_of_git: true
% 0.21/0.52
% 0.21/0.52 %
% 0.21/0.52 % ------ Input Options
% 0.21/0.52
% 0.21/0.52 % --out_options all
% 0.21/0.52 % --tptp_safe_out true
% 0.21/0.52 % --problem_path ""
% 0.21/0.52 % --include_path ""
% 0.21/0.52 % --clausifier .//eprover
% 0.21/0.52 % --clausifier_options --tstp-format
% 0.21/0.52 % --stdin false
% 0.21/0.52 % --dbg_backtrace false
% 0.21/0.52 % --dbg_dump_prop_clauses false
% 0.21/0.52 % --dbg_dump_prop_clauses_file -
% 0.21/0.52 % --dbg_out_stat false
% 0.21/0.52
% 0.21/0.52 % ------ General Options
% 0.21/0.52
% 0.21/0.52 % --fof false
% 0.21/0.52 % --time_out_real 150.
% 0.21/0.52 % --time_out_prep_mult 0.2
% 0.21/0.52 % --time_out_virtual -1.
% 0.21/0.52 % --schedule none
% 0.21/0.52 % --ground_splitting input
% 0.21/0.52 % --splitting_nvd 16
% 0.21/0.52 % --non_eq_to_eq false
% 0.21/0.52 % --prep_gs_sim true
% 0.21/0.52 % --prep_unflatten false
% 0.21/0.52 % --prep_res_sim true
% 0.21/0.52 % --prep_upred true
% 0.21/0.52 % --res_sim_input true
% 0.21/0.52 % --clause_weak_htbl true
% 0.21/0.52 % --gc_record_bc_elim false
% 0.21/0.52 % --symbol_type_check false
% 0.21/0.52 % --clausify_out false
% 0.21/0.52 % --large_theory_mode false
% 0.21/0.52 % --prep_sem_filter none
% 0.21/0.52 % --prep_sem_filter_out false
% 0.21/0.52 % --preprocessed_out false
% 0.21/0.52 % --sub_typing false
% 0.21/0.52 % --brand_transform false
% 0.21/0.52 % --pure_diseq_elim true
% 0.21/0.52 % --min_unsat_core false
% 0.21/0.52 % --pred_elim true
% 0.21/0.52 % --add_important_lit false
% 0.21/0.52 % --soft_assumptions false
% 0.21/0.52 % --reset_solvers false
% 0.21/0.52 % --bc_imp_inh []
% 0.21/0.52 % --conj_cone_tolerance 1.5
% 0.21/0.52 % --prolific_symb_bound 500
% 0.21/0.52 % --lt_threshold 2000
% 0.21/0.52
% 0.21/0.52 % ------ SAT Options
% 0.21/0.52
% 0.21/0.52 % --sat_mode false
% 0.21/0.52 % --sat_fm_restart_options ""
% 0.21/0.52 % --sat_gr_def false
% 0.21/0.52 % --sat_epr_types true
% 0.21/0.52 % --sat_non_cyclic_types false
% 0.21/0.52 % --sat_finite_models false
% 0.21/0.52 % --sat_fm_lemmas false
% 0.21/0.52 % --sat_fm_prep false
% 0.21/0.52 % --sat_fm_uc_incr true
% 0.21/0.52 % --sat_out_model small
% 0.21/0.52 % --sat_out_clauses false
% 0.21/0.52
% 0.21/0.52 % ------ QBF Options
% 0.21/0.52
% 0.21/0.52 % --qbf_mode false
% 0.21/0.52 % --qbf_elim_univ true
% 0.21/0.52 % --qbf_sk_in true
% 0.21/0.52 % --qbf_pred_elim true
% 0.21/0.52 % --qbf_split 32
% 0.21/0.52
% 0.21/0.52 % ------ BMC1 Options
% 0.21/0.52
% 0.21/0.52 % --bmc1_incremental false
% 0.21/0.52 % --bmc1_axioms reachable_all
% 0.21/0.52 % --bmc1_min_bound 0
% 0.21/0.52 % --bmc1_max_bound -1
% 0.21/0.52 % --bmc1_max_bound_default -1
% 0.21/0.52 % --bmc1_symbol_reachability true
% 0.21/0.52 % --bmc1_property_lemmas false
% 0.21/0.52 % --bmc1_k_induction false
% 0.21/0.52 % --bmc1_non_equiv_states false
% 0.21/0.52 % --bmc1_deadlock false
% 0.21/0.52 % --bmc1_ucm false
% 0.21/0.52 % --bmc1_add_unsat_core none
% 0.21/0.52 % --bmc1_unsat_core_children false
% 0.21/0.52 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.52 % --bmc1_out_stat full
% 0.21/0.52 % --bmc1_ground_init false
% 0.21/0.52 % --bmc1_pre_inst_next_state false
% 0.21/0.52 % --bmc1_pre_inst_state false
% 0.21/0.52 % --bmc1_pre_inst_reach_state false
% 0.21/0.52 % --bmc1_out_unsat_core false
% 0.21/0.52 % --bmc1_aig_witness_out false
% 0.21/0.52 % --bmc1_verbose false
% 0.21/0.52 % --bmc1_dump_clauses_tptp false
% 0.21/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.53 % --bmc1_dump_file -
% 0.21/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.53 % --bmc1_ucm_extend_mode 1
% 0.21/0.53 % --bmc1_ucm_init_mode 2
% 0.21/0.53 % --bmc1_ucm_cone_mode none
% 0.21/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.53 % --bmc1_ucm_relax_model 4
% 0.21/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.53 % --bmc1_ucm_layered_model none
% 0.21/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.53
% 0.21/0.53 % ------ AIG Options
% 0.21/0.53
% 0.21/0.53 % --aig_mode false
% 0.21/0.53
% 0.21/0.53 % ------ Instantiation Options
% 0.21/0.53
% 0.21/0.53 % --instantiation_flag true
% 0.21/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.53 % --inst_solver_per_active 750
% 0.21/0.53 % --inst_solver_calls_frac 0.5
% 0.21/0.53 % --inst_passive_queue_type priority_queues
% 0.21/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.53 % --inst_passive_queues_freq [25;2]
% 0.21/0.53 % --inst_dismatching true
% 0.21/0.53 % --inst_eager_unprocessed_to_passive true
% 0.21/0.53 % --inst_prop_sim_given true
% 0.21/0.53 % --inst_prop_sim_new false
% 0.21/0.53 % --inst_orphan_elimination true
% 0.21/0.53 % --inst_learning_loop_flag true
% 0.21/0.53 % --inst_learning_start 3000
% 0.21/0.53 % --inst_learning_factor 2
% 0.21/0.53 % --inst_start_prop_sim_after_learn 3
% 0.21/0.53 % --inst_sel_renew solver
% 0.21/0.53 % --inst_lit_activity_flag true
% 0.21/0.53 % --inst_out_proof true
% 0.21/0.53
% 0.21/0.53 % ------ Resolution Options
% 0.21/0.53
% 0.21/0.53 % --resolution_flag true
% 0.21/0.53 % --res_lit_sel kbo_max
% 0.21/0.53 % --res_to_prop_solver none
% 0.21/0.53 % --res_prop_simpl_new false
% 0.21/0.53 % --res_prop_simpl_given false
% 0.21/0.53 % --res_passive_queue_type priority_queues
% 0.21/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.53 % --res_passive_queues_freq [15;5]
% 0.21/0.53 % --res_forward_subs full
% 0.21/0.53 % --res_backward_subs full
% 0.21/0.53 % --res_forward_subs_resolution true
% 0.21/0.53 % --res_backward_subs_resolution true
% 0.21/0.53 % --res_orphan_elimination false
% 0.21/0.53 % --res_time_limit 1000.
% 0.21/0.53 % --res_out_proof true
% 0.21/0.53 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_111bcb.s
% 0.21/0.53 % --modulo true
% 0.21/0.53
% 0.21/0.53 % ------ Combination Options
% 0.21/0.53
% 0.21/0.53 % --comb_res_mult 1000
% 0.21/0.53 % --comb_inst_mult 300
% 0.21/0.53 % ------
% 0.21/0.53
% 0.21/0.53 % ------ Parsing...% successful
% 0.21/0.53
% 0.21/0.53 % ------ 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.53
% 0.21/0.53 % ------ Proving...
% 0.21/0.53 % ------ Problem Properties
% 0.21/0.53
% 0.21/0.53 %
% 0.21/0.53 % EPR false
% 0.21/0.53 % Horn false
% 0.21/0.53 % Has equality true
% 0.21/0.53
% 0.21/0.53 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.53
% 0.21/0.53
% 0.21/0.53 % % ------ Current options:
% 0.21/0.53
% 0.21/0.53 % ------ Input Options
% 0.21/0.53
% 0.21/0.53 % --out_options all
% 0.21/0.53 % --tptp_safe_out true
% 0.21/0.53 % --problem_path ""
% 0.21/0.53 % --include_path ""
% 0.21/0.53 % --clausifier .//eprover
% 0.21/0.53 % --clausifier_options --tstp-format
% 0.21/0.53 % --stdin false
% 0.21/0.53 % --dbg_backtrace false
% 0.21/0.53 % --dbg_dump_prop_clauses false
% 0.21/0.53 % --dbg_dump_prop_clauses_file -
% 0.21/0.53 % --dbg_out_stat false
% 0.21/0.53
% 0.21/0.53 % ------ General Options
% 0.21/0.53
% 0.21/0.53 % --fof false
% 0.21/0.53 % --time_out_real 150.
% 0.21/0.53 % --time_out_prep_mult 0.2
% 0.21/0.53 % --time_out_virtual -1.
% 0.21/0.53 % --schedule none
% 0.21/0.53 % --ground_splitting input
% 0.21/0.53 % --splitting_nvd 16
% 0.21/0.53 % --non_eq_to_eq false
% 0.21/0.53 % --prep_gs_sim true
% 0.21/0.53 % --prep_unflatten false
% 0.21/0.53 % --prep_res_sim true
% 0.21/0.53 % --prep_upred true
% 0.21/0.53 % --res_sim_input true
% 0.21/0.53 % --clause_weak_htbl true
% 0.21/0.53 % --gc_record_bc_elim false
% 0.21/0.53 % --symbol_type_check false
% 0.21/0.53 % --clausify_out false
% 0.21/0.53 % --large_theory_mode false
% 0.21/0.53 % --prep_sem_filter none
% 0.21/0.53 % --prep_sem_filter_out false
% 0.21/0.53 % --preprocessed_out false
% 0.21/0.53 % --sub_typing false
% 0.21/0.53 % --brand_transform false
% 0.21/0.53 % --pure_diseq_elim true
% 0.21/0.53 % --min_unsat_core false
% 0.21/0.53 % --pred_elim true
% 0.21/0.53 % --add_important_lit false
% 0.21/0.53 % --soft_assumptions false
% 0.21/0.53 % --reset_solvers false
% 0.21/0.53 % --bc_imp_inh []
% 0.21/0.53 % --conj_cone_tolerance 1.5
% 0.21/0.53 % --prolific_symb_bound 500
% 0.21/0.53 % --lt_threshold 2000
% 0.21/0.53
% 0.21/0.53 % ------ SAT Options
% 0.21/0.53
% 0.21/0.53 % --sat_mode false
% 0.21/0.53 % --sat_fm_restart_options ""
% 0.21/0.53 % --sat_gr_def false
% 0.21/0.53 % --sat_epr_types true
% 0.21/0.53 % --sat_non_cyclic_types false
% 0.21/0.53 % --sat_finite_models false
% 0.21/0.53 % --sat_fm_lemmas false
% 0.21/0.53 % --sat_fm_prep false
% 0.21/0.53 % --sat_fm_uc_incr true
% 0.21/0.53 % --sat_out_model small
% 0.21/0.53 % --sat_out_clauses false
% 0.21/0.53
% 0.21/0.53 % ------ QBF Options
% 0.21/0.53
% 0.21/0.53 % --qbf_mode false
% 0.21/0.53 % --qbf_elim_univ true
% 0.21/0.53 % --qbf_sk_in true
% 0.21/0.53 % --qbf_pred_elim true
% 0.21/0.53 % --qbf_split 32
% 0.21/0.53
% 0.21/0.53 % ------ BMC1 Options
% 0.21/0.53
% 0.21/0.53 % --bmc1_incremental false
% 0.21/0.53 % --bmc1_axioms reachable_all
% 0.21/0.53 % --bmc1_min_bound 0
% 0.21/0.53 % --bmc1_max_bound -1
% 0.21/0.53 % --bmc1_max_bound_default -1
% 0.21/0.53 % --bmc1_symbol_reachability true
% 0.21/0.53 % --bmc1_property_lemmas false
% 0.21/0.53 % --bmc1_k_induction false
% 0.21/0.53 % --bmc1_non_equiv_states false
% 0.21/0.53 % --bmc1_deadlock false
% 0.21/0.53 % --bmc1_ucm false
% 0.21/0.53 % --bmc1_add_unsat_core none
% 0.21/0.53 % --bmc1_unsat_core_children false
% 0.21/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.53 % --bmc1_out_stat full
% 0.21/0.53 % --bmc1_ground_init false
% 0.21/0.53 % --bmc1_pre_inst_next_state false
% 0.21/0.53 % --bmc1_pre_inst_state false
% 0.21/0.53 % --bmc1_pre_inst_reach_state false
% 0.21/0.53 % --bmc1_out_unsat_core false
% 0.21/0.53 % --bmc1_aig_witness_out false
% 0.21/0.53 % --bmc1_verbose false
% 0.21/0.53 % --bmc1_dump_clauses_tptp false
% 0.21/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.53 % --bmc1_dump_file -
% 0.21/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.53 % --bmc1_ucm_extend_mode 1
% 0.21/0.53 % --bmc1_ucm_init_mode 2
% 0.21/0.53 % --bmc1_ucm_cone_mode none
% 0.21/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.53 % --bmc1_ucm_relax_model 4
% 0.21/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.53 % --bmc1_ucm_layered_model none
% 0.21/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.53
% 0.21/0.53 % ------ AIG Options
% 0.21/0.53
% 0.21/0.53 % --aig_mode false
% 0.21/0.53
% 0.21/0.53 % ------ Instantiation Options
% 0.21/0.53
% 0.21/0.53 % --instantiation_flag true
% 0.21/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.53 % --inst_solver_per_active 750
% 0.21/0.53 % --inst_solver_calls_frac 0.5
% 0.21/0.53 % --inst_passive_queue_type priority_queues
% 0.21/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.53 % --inst_passive_queues_freq [25;2]
% 0.21/0.53 % --inst_dismatching true
% 0.21/0.53 % --inst_eager_unprocessed_to_passive true
% 0.21/0.53 % --inst_prop_sim_given true
% 5.59/5.77 % --inst_prop_sim_new false
% 5.59/5.77 % --inst_orphan_elimination true
% 5.59/5.77 % --inst_learning_loop_flag true
% 5.59/5.77 % --inst_learning_start 3000
% 5.59/5.77 % --inst_learning_factor 2
% 5.59/5.77 % --inst_start_prop_sim_after_learn 3
% 5.59/5.77 % --inst_sel_renew solver
% 5.59/5.77 % --inst_lit_activity_flag true
% 5.59/5.77 % --inst_out_proof true
% 5.59/5.77
% 5.59/5.77 % ------ Resolution Options
% 5.59/5.77
% 5.59/5.77 % --resolution_flag true
% 5.59/5.77 % --res_lit_sel kbo_max
% 5.59/5.77 % --res_to_prop_solver none
% 5.59/5.77 % --res_prop_simpl_new false
% 5.59/5.77 % --res_prop_simpl_given false
% 5.59/5.77 % --res_passive_queue_type priority_queues
% 5.59/5.77 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.59/5.77 % --res_passive_queues_freq [15;5]
% 5.59/5.77 % --res_forward_subs full
% 5.59/5.77 % --res_backward_subs full
% 5.59/5.77 % --res_forward_subs_resolution true
% 5.59/5.77 % --res_backward_subs_resolution true
% 5.59/5.77 % --res_orphan_elimination false
% 5.59/5.77 % --res_time_limit 1000.
% 5.59/5.77 % --res_out_proof true
% 5.59/5.77 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_111bcb.s
% 5.59/5.77 % --modulo true
% 5.59/5.77
% 5.59/5.77 % ------ Combination Options
% 5.59/5.77
% 5.59/5.77 % --comb_res_mult 1000
% 5.59/5.77 % --comb_inst_mult 300
% 5.59/5.77 % ------
% 5.59/5.77
% 5.59/5.77
% 5.59/5.77
% 5.59/5.77 % ------ Proving...
% 5.59/5.77 %
% 5.59/5.77
% 5.59/5.77
% 5.59/5.77 % ------ Statistics
% 5.59/5.77
% 5.59/5.77 % ------ General
% 5.59/5.77
% 5.59/5.77 % num_of_input_clauses: 38
% 5.59/5.77 % num_of_input_neg_conjectures: 2
% 5.59/5.77 % num_of_splits: 0
% 5.59/5.77 % num_of_split_atoms: 0
% 5.59/5.77 % num_of_sem_filtered_clauses: 0
% 5.59/5.77 % num_of_subtypes: 0
% 5.59/5.77 % monotx_restored_types: 0
% 5.59/5.77 % sat_num_of_epr_types: 0
% 5.59/5.77 % sat_num_of_non_cyclic_types: 0
% 5.59/5.77 % sat_guarded_non_collapsed_types: 0
% 5.59/5.77 % is_epr: 0
% 5.59/5.77 % is_horn: 0
% 5.59/5.77 % has_eq: 1
% 5.59/5.77 % num_pure_diseq_elim: 0
% 5.59/5.77 % simp_replaced_by: 0
% 5.59/5.77 % res_preprocessed: 4
% 5.59/5.77 % prep_upred: 0
% 5.59/5.77 % prep_unflattend: 0
% 5.59/5.77 % pred_elim_cands: 0
% 5.59/5.77 % pred_elim: 0
% 5.59/5.77 % pred_elim_cl: 0
% 5.59/5.77 % pred_elim_cycles: 0
% 5.59/5.77 % forced_gc_time: 0
% 5.59/5.77 % gc_basic_clause_elim: 0
% 5.59/5.77 % parsing_time: 0.002
% 5.59/5.77 % sem_filter_time: 0.
% 5.59/5.77 % pred_elim_time: 0.
% 5.59/5.77 % out_proof_time: 0.
% 5.59/5.77 % monotx_time: 0.
% 5.59/5.77 % subtype_inf_time: 0.
% 5.59/5.77 % unif_index_cands_time: 0.009
% 5.59/5.77 % unif_index_add_time: 0.003
% 5.59/5.77 % total_time: 5.267
% 5.59/5.77 % num_of_symbols: 32
% 5.59/5.77 % num_of_terms: 284897
% 5.59/5.77
% 5.59/5.77 % ------ Propositional Solver
% 5.59/5.77
% 5.59/5.77 % prop_solver_calls: 5
% 5.59/5.77 % prop_fast_solver_calls: 6
% 5.59/5.77 % prop_num_of_clauses: 88
% 5.59/5.77 % prop_preprocess_simplified: 321
% 5.59/5.77 % prop_fo_subsumed: 0
% 5.59/5.77 % prop_solver_time: 0.
% 5.59/5.77 % prop_fast_solver_time: 0.
% 5.59/5.77 % prop_unsat_core_time: 0.
% 5.59/5.77
% 5.59/5.77 % ------ QBF
% 5.59/5.77
% 5.59/5.77 % qbf_q_res: 0
% 5.59/5.77 % qbf_num_tautologies: 0
% 5.59/5.77 % qbf_prep_cycles: 0
% 5.59/5.77
% 5.59/5.77 % ------ BMC1
% 5.59/5.77
% 5.59/5.77 % bmc1_current_bound: -1
% 5.59/5.77 % bmc1_last_solved_bound: -1
% 5.59/5.77 % bmc1_unsat_core_size: -1
% 5.59/5.77 % bmc1_unsat_core_parents_size: -1
% 5.59/5.77 % bmc1_merge_next_fun: 0
% 5.59/5.77 % bmc1_unsat_core_clauses_time: 0.
% 5.59/5.77
% 5.59/5.77 % ------ Instantiation
% 5.59/5.77
% 5.59/5.77 % inst_num_of_clauses: 95
% 5.59/5.77 % inst_num_in_passive: 26
% 5.59/5.77 % inst_num_in_active: 62
% 5.59/5.77 % inst_num_in_unprocessed: 0
% 5.59/5.77 % inst_num_of_loops: 70
% 5.59/5.77 % inst_num_of_learning_restarts: 0
% 5.59/5.77 % inst_num_moves_active_passive: 3
% 5.59/5.77 % inst_lit_activity: 35
% 5.59/5.77 % inst_lit_activity_moves: 0
% 5.59/5.77 % inst_num_tautologies: 0
% 5.59/5.77 % inst_num_prop_implied: 0
% 5.59/5.77 % inst_num_existing_simplified: 0
% 5.59/5.77 % inst_num_eq_res_simplified: 0
% 5.59/5.77 % inst_num_child_elim: 0
% 5.59/5.77 % inst_num_of_dismatching_blockings: 36
% 5.59/5.77 % inst_num_of_non_proper_insts: 80
% 5.59/5.77 % inst_num_of_duplicates: 54
% 5.59/5.77 % inst_inst_num_from_inst_to_res: 0
% 5.59/5.77 % inst_dismatching_checking_time: 0.
% 5.59/5.77
% 5.59/5.77 % ------ Resolution
% 5.59/5.77
% 5.59/5.77 % res_num_of_clauses: 22325
% 5.59/5.77 % res_num_in_passive: 21420
% 5.59/5.77 % res_num_in_active: 885
% 5.59/5.77 % res_num_of_loops: 1000
% 5.59/5.77 % res_forward_subset_subsumed: 735
% 5.59/5.77 % res_backward_subset_subsumed: 0
% 5.59/5.77 % res_forward_subsumed: 136
% 5.59/5.77 % res_backward_subsumed: 0
% 5.59/5.77 % res_forward_subsumption_resolution: 1
% 5.59/5.77 % res_backward_subsumption_resolution: 1
% 5.59/5.77 % res_clause_to_clause_subsumption: 63034
% 5.59/5.77 % res_orphan_elimination: 0
% 5.59/5.77 % res_tautology_del: 32
% 5.59/5.77 % res_num_eq_res_simplified: 0
% 5.59/5.77 % res_num_sel_changes: 0
% 5.59/5.77 % res_moves_from_active_to_pass: 0
% 5.59/5.77
% 5.59/5.77 % Status Unsatisfiable
% 5.59/5.77 % SZS status Theorem
% 5.59/5.77 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------