%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET636+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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:58 EDT 2022
% Result : Theorem 20.34s 20.60s
% Output : CNFRefutation 20.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 29
% Syntax : Number of formulae : 204 ( 24 unt; 0 def)
% Number of atoms : 490 ( 66 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 526 ( 240 ~; 244 |; 20 &)
% ( 18 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-2 aty)
% Number of variables : 407 ( 27 sgn 89 !; 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,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] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('<stdin>',intersect_defn) ).
fof(c_0_4,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',equal_defn) ).
fof(c_0_5,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('<stdin>',disjoint_defn) ).
fof(c_0_6,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
file('<stdin>',symmetry_of_intersect) ).
fof(c_0_7,axiom,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
file('<stdin>',empty_defn) ).
fof(c_0_8,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('<stdin>',commutativity_of_intersection) ).
fof(c_0_9,axiom,
! [X1] : ~ member(X1,empty_set),
file('<stdin>',empty_set_defn) ).
fof(c_0_10,axiom,
! [X1] : subset(X1,X1),
file('<stdin>',reflexivity_of_subset) ).
fof(c_0_11,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
c_0_0 ).
fof(c_0_12,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
c_0_1 ).
fof(c_0_13,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_2 ).
fof(c_0_14,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
c_0_3 ).
fof(c_0_15,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_4 ).
fof(c_0_16,plain,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_17,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
c_0_6 ).
fof(c_0_18,plain,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_19,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
c_0_8 ).
fof(c_0_20,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_21,axiom,
! [X1] : subset(X1,X1),
c_0_10 ).
fof(c_0_22,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ member(X6,X4)
| member(X6,X5)
| X4 != X5 )
& ( ~ member(X7,X5)
| member(X7,X4)
| X4 != X5 )
& ( ~ member(esk4_2(X8,X9),X8)
| ~ member(esk4_2(X8,X9),X9)
| X8 = X9 )
& ( member(esk4_2(X8,X9),X8)
| member(esk4_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_11])])])])])]) ).
fof(c_0_23,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_12])])])])]) ).
fof(c_0_24,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk2_2(X7,X8),X7)
| subset(X7,X8) )
& ( ~ member(esk2_2(X7,X8),X8)
| subset(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])]) ).
fof(c_0_25,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_14])])])])])]) ).
fof(c_0_26,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_15])])])])]) ).
fof(c_0_27,plain,
! [X3,X4,X5,X6] :
( ( ~ disjoint(X3,X4)
| ~ intersect(X3,X4) )
& ( intersect(X5,X6)
| disjoint(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_28,plain,
! [X3,X4] :
( ~ intersect(X3,X4)
| intersect(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
fof(c_0_29,plain,
! [X3,X4,X5] :
( ( ~ empty(X3)
| ~ member(X4,X3) )
& ( member(esk3_1(X5),X5)
| empty(X5) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
fof(c_0_30,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_32,plain,
! [X2] : subset(X2,X2),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ member(esk4_2(X1,X2),X2)
| ~ member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
( X1 = X2
| member(esk4_2(X1,X2),X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_39,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_40,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_41,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_42,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_43,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_44,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_45,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_46,plain,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_47,plain,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_48,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_49,plain,
( ~ member(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_50,plain,
( disjoint(X1,X2)
| intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_51,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_52,plain,
( empty(X1)
| member(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_53,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_54,plain,
( subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_55,plain,
( subset(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_56,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_57,plain,
( X1 = X2
| ~ member(esk4_2(X1,X2),X2)
| ~ member(esk4_2(X1,X2),X1) ),
c_0_33,
[final] ).
cnf(c_0_58,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
c_0_34,
[final] ).
cnf(c_0_59,plain,
( X1 = X2
| member(esk4_2(X1,X2),X2)
| member(esk4_2(X1,X2),X1) ),
c_0_35,
[final] ).
cnf(c_0_60,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
c_0_36,
[final] ).
cnf(c_0_61,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_37,
[final] ).
cnf(c_0_62,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_38,
[final] ).
cnf(c_0_63,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
c_0_39,
[final] ).
cnf(c_0_64,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
c_0_40,
[final] ).
cnf(c_0_65,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
c_0_41,
[final] ).
cnf(c_0_66,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
c_0_42,
[final] ).
cnf(c_0_67,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
c_0_43,
[final] ).
cnf(c_0_68,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_44,
[final] ).
cnf(c_0_69,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
c_0_45,
[final] ).
cnf(c_0_70,plain,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
c_0_46,
[final] ).
cnf(c_0_71,plain,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
c_0_47,
[final] ).
cnf(c_0_72,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
c_0_48,
[final] ).
cnf(c_0_73,plain,
( ~ member(X1,X2)
| ~ empty(X2) ),
c_0_49,
[final] ).
cnf(c_0_74,plain,
( disjoint(X1,X2)
| intersect(X1,X2) ),
c_0_50,
[final] ).
cnf(c_0_75,plain,
intersection(X1,X2) = intersection(X2,X1),
c_0_51,
[final] ).
cnf(c_0_76,plain,
( empty(X1)
| member(esk3_1(X1),X1) ),
c_0_52,
[final] ).
cnf(c_0_77,plain,
~ member(X1,empty_set),
c_0_53,
[final] ).
cnf(c_0_78,plain,
( subset(X1,X2)
| X1 != X2 ),
c_0_54,
[final] ).
cnf(c_0_79,plain,
( subset(X2,X1)
| X1 != X2 ),
c_0_55,
[final] ).
cnf(c_0_80,plain,
subset(X1,X1),
c_0_56,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_57_0,axiom,
( X1 = X2
| ~ member(sk1_esk4_2(X1,X2),X2)
| ~ member(sk1_esk4_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_1,axiom,
( ~ member(sk1_esk4_2(X1,X2),X2)
| X1 = X2
| ~ member(sk1_esk4_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_2,axiom,
( ~ member(sk1_esk4_2(X1,X2),X1)
| ~ member(sk1_esk4_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_58_0,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_1,axiom,
( ~ member(X1,X3)
| member(X1,intersection(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_2,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_59_0,axiom,
( X1 = X2
| member(sk1_esk4_2(X1,X2),X2)
| member(sk1_esk4_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_1,axiom,
( member(sk1_esk4_2(X1,X2),X2)
| X1 = X2
| member(sk1_esk4_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_2,axiom,
( member(sk1_esk4_2(X1,X2),X1)
| member(sk1_esk4_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_60_0,axiom,
( subset(X1,X2)
| ~ member(sk1_esk2_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_60_1,axiom,
( ~ member(sk1_esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_61_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_61_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_62_0,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_62_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_63_0,axiom,
( member(sk1_esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_63_1,axiom,
( ~ intersect(X1,X2)
| member(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_64_0,axiom,
( member(sk1_esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_1,axiom,
( ~ intersect(X1,X2)
| member(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_65_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_2,axiom,
( ~ subset(X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_66_0,axiom,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_1,axiom,
( ~ member(X3,X2)
| intersect(X1,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_2,axiom,
( ~ member(X3,X1)
| ~ member(X3,X2)
| intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_67_0,axiom,
( subset(X1,X2)
| member(sk1_esk2_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_67_1,axiom,
( member(sk1_esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_68_0,axiom,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_1,axiom,
( ~ subset(X2,X1)
| X1 = X2
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_2,axiom,
( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_69_0,axiom,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_69_1,axiom,
( ~ disjoint(X1,X2)
| ~ intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_70_0,axiom,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_1,axiom,
( X1 != X2
| member(X3,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_2,axiom,
( ~ member(X3,X1)
| X1 != X2
| member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_71_0,axiom,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_1,axiom,
( X1 != X2
| member(X3,X1)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_2,axiom,
( ~ member(X3,X2)
| X1 != X2
| member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_72_0,axiom,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_1,axiom,
( ~ intersect(X2,X1)
| intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_73_0,axiom,
( ~ member(X1,X2)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_1,axiom,
( ~ empty(X2)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_74_0,axiom,
( disjoint(X1,X2)
| intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_1,axiom,
( intersect(X1,X2)
| disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_76_0,axiom,
( empty(X1)
| member(sk1_esk3_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_1,axiom,
( member(sk1_esk3_1(X1),X1)
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_78_0,axiom,
( subset(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( X1 != X2
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( subset(X2,X1)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( X1 != X2
| subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_77_0,axiom,
~ member(X1,empty_set),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_75_0,axiom,
intersection(X1,X2) = intersection(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_80_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( disjoint(X1,X2)
<=> intersection(X1,X2) = empty_set ),
file('<stdin>',prove_th118) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( disjoint(X1,X2)
<=> intersection(X1,X2) = empty_set ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( ( ~ disjoint(esk1_0,esk2_0)
| intersection(esk1_0,esk2_0) != empty_set )
& ( disjoint(esk1_0,esk2_0)
| intersection(esk1_0,esk2_0) = empty_set ) ),
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) != empty_set
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( intersection(esk1_0,esk2_0) = empty_set
| disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( intersection(esk1_0,esk2_0) != empty_set
| ~ disjoint(esk1_0,esk2_0) ),
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
( intersection(esk1_0,esk2_0) = empty_set
| disjoint(esk1_0,esk2_0) ),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_2,plain,
~ member(X0,empty_set),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_77_0) ).
cnf(c_88,plain,
~ member(X0,empty_set),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_183834,plain,
~ member(sk1_esk3_1(X0),empty_set),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_973244,plain,
~ member(sk1_esk3_1(intersection(sk2_esk1_0,sk2_esk2_0)),empty_set),
inference(instantiation,[status(thm)],[c_183834]) ).
cnf(c_28,plain,
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_66_2) ).
cnf(c_114,plain,
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_38501,plain,
( ~ member(X0,intersection(X1,X2))
| ~ member(X0,X3)
| intersect(X3,intersection(X1,X2)) ),
inference(instantiation,[status(thm)],[c_114]) ).
cnf(c_39145,plain,
( ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),intersection(X0,X1))
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0)
| intersect(sk2_esk1_0,intersection(X0,X1)) ),
inference(instantiation,[status(thm)],[c_38501]) ).
cnf(c_545475,plain,
( ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),intersection(sk2_esk1_0,sk2_esk2_0))
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0)
| intersect(sk2_esk1_0,intersection(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_39145]) ).
cnf(c_31,plain,
( member(X0,X1)
| ~ member(X0,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_65_2) ).
cnf(c_117,plain,
( member(X0,X1)
| ~ member(X0,X2)
| ~ subset(X2,X1) ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_93534,plain,
( ~ subset(X0,X1)
| member(sk1_esk3_1(X0),X1)
| ~ member(sk1_esk3_1(X0),X0) ),
inference(instantiation,[status(thm)],[c_117]) ).
cnf(c_183831,plain,
( ~ subset(X0,empty_set)
| member(sk1_esk3_1(X0),empty_set)
| ~ member(sk1_esk3_1(X0),X0) ),
inference(instantiation,[status(thm)],[c_93534]) ).
cnf(c_544602,plain,
( ~ subset(intersection(sk2_esk1_0,sk2_esk2_0),empty_set)
| ~ member(sk1_esk3_1(intersection(sk2_esk1_0,sk2_esk2_0)),intersection(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk3_1(intersection(sk2_esk1_0,sk2_esk2_0)),empty_set) ),
inference(instantiation,[status(thm)],[c_183831]) ).
cnf(c_34,plain,
( member(sk1_esk1_2(X0,X1),X1)
| ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_64_1) ).
cnf(c_120,plain,
( member(sk1_esk1_2(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_38396,plain,
( member(sk1_esk1_2(X0,intersection(X1,X2)),intersection(X1,X2))
| ~ intersect(X0,intersection(X1,X2)) ),
inference(instantiation,[status(thm)],[c_120]) ).
cnf(c_185003,plain,
( member(sk1_esk1_2(X0,intersection(sk2_esk1_0,sk2_esk2_0)),intersection(sk2_esk1_0,sk2_esk2_0))
| ~ intersect(X0,intersection(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_38396]) ).
cnf(c_185004,plain,
( member(sk1_esk1_2(sk2_esk1_0,intersection(sk2_esk1_0,sk2_esk2_0)),intersection(sk2_esk1_0,sk2_esk2_0))
| ~ intersect(sk2_esk1_0,intersection(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_185003]) ).
cnf(c_11,plain,
( ~ member(X0,X1)
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_73_1) ).
cnf(c_97,plain,
( ~ member(X0,X1)
| ~ empty(X1) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_38383,plain,
( ~ member(sk1_esk1_2(X0,X1),X1)
| ~ empty(X1) ),
inference(instantiation,[status(thm)],[c_97]) ).
cnf(c_38595,plain,
( ~ member(sk1_esk1_2(X0,intersection(X1,X2)),intersection(X1,X2))
| ~ empty(intersection(X1,X2)) ),
inference(instantiation,[status(thm)],[c_38383]) ).
cnf(c_93217,plain,
( ~ member(sk1_esk1_2(X0,intersection(sk2_esk1_0,sk2_esk2_0)),intersection(sk2_esk1_0,sk2_esk2_0))
| ~ empty(intersection(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_38595]) ).
cnf(c_93218,plain,
( ~ member(sk1_esk1_2(sk2_esk1_0,intersection(sk2_esk1_0,sk2_esk2_0)),intersection(sk2_esk1_0,sk2_esk2_0))
| ~ empty(intersection(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_93217]) ).
cnf(c_47,plain,
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_58_2) ).
cnf(c_133,plain,
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_38393,plain,
( member(sk1_esk1_2(X0,X1),intersection(X2,X1))
| ~ member(sk1_esk1_2(X0,X1),X1)
| ~ member(sk1_esk1_2(X0,X1),X2) ),
inference(instantiation,[status(thm)],[c_133]) ).
cnf(c_39181,plain,
( member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),intersection(X0,sk2_esk2_0))
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk2_0)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),X0) ),
inference(instantiation,[status(thm)],[c_38393]) ).
cnf(c_39190,plain,
( member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),intersection(sk2_esk1_0,sk2_esk2_0))
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_39181]) ).
cnf(c_38435,plain,
( ~ member(X0,sk2_esk1_0)
| ~ member(X0,sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_114]) ).
cnf(c_38796,plain,
( ~ member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk1_0)
| ~ member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk2_0)
| intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_38435]) ).
cnf(c_37,plain,
( ~ intersect(X0,X1)
| member(sk1_esk1_2(X0,X1),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_63_0) ).
cnf(c_123,plain,
( ~ intersect(X0,X1)
| member(sk1_esk1_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_38670,plain,
( member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0)
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_123]) ).
cnf(c_35,plain,
( ~ intersect(X0,X1)
| member(sk1_esk1_2(X0,X1),X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_64_0) ).
cnf(c_121,plain,
( ~ intersect(X0,X1)
| member(sk1_esk1_2(X0,X1),X1) ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_38672,plain,
( member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk2_0)
| ~ intersect(sk2_esk1_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_38535,plain,
~ member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),empty_set),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_8,plain,
( member(sk1_esk3_1(X0),X0)
| empty(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_76_0) ).
cnf(c_94,plain,
( member(sk1_esk3_1(X0),X0)
| empty(X0) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_38533,plain,
( member(sk1_esk3_1(intersection(sk2_esk1_0,sk2_esk2_0)),intersection(sk2_esk1_0,sk2_esk2_0))
| empty(intersection(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_94]) ).
cnf(c_41,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_61_0) ).
cnf(c_127,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_38469,plain,
( ~ member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),intersection(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_127]) ).
cnf(c_39,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_62_0) ).
cnf(c_125,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_38471,plain,
( ~ member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),intersection(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_6,plain,
( X0 != X1
| subset(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_78_0) ).
cnf(c_92,plain,
( X0 != X1
| subset(X0,X1) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_38447,plain,
( subset(intersection(sk2_esk1_0,sk2_esk2_0),empty_set)
| intersection(sk2_esk1_0,sk2_esk2_0) != empty_set ),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_10,plain,
( intersect(X0,X1)
| disjoint(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_74_0) ).
cnf(c_96,plain,
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_38437,plain,
( intersect(sk2_esk1_0,sk2_esk2_0)
| disjoint(sk2_esk1_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_96]) ).
cnf(c_44,plain,
( X0 = X1
| member(sk1_esk4_2(X0,X1),X1)
| member(sk1_esk4_2(X0,X1),X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_59_2) ).
cnf(c_130,plain,
( X0 = X1
| member(sk1_esk4_2(X0,X1),X1)
| member(sk1_esk4_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_38373,plain,
( member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),intersection(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk4_2(intersection(sk2_esk1_0,sk2_esk2_0),empty_set),empty_set)
| intersection(sk2_esk1_0,sk2_esk2_0) = empty_set ),
inference(instantiation,[status(thm)],[c_130]) ).
cnf(c_21,plain,
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_69_1) ).
cnf(c_107,plain,
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_38368,plain,
( ~ intersect(sk2_esk1_0,sk2_esk2_0)
| ~ disjoint(sk2_esk1_0,sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_107]) ).
cnf(c_53,negated_conjecture,
( ~ disjoint(sk2_esk1_0,sk2_esk2_0)
| intersection(sk2_esk1_0,sk2_esk2_0) != empty_set ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_5) ).
cnf(c_54,negated_conjecture,
( disjoint(sk2_esk1_0,sk2_esk2_0)
| intersection(sk2_esk1_0,sk2_esk2_0) = empty_set ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p',c_0_6) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_973244,c_545475,c_544602,c_185004,c_93218,c_39190,c_38796,c_38670,c_38672,c_38535,c_38533,c_38469,c_38471,c_38447,c_38437,c_38373,c_38368,c_53,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET636+3 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.12 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 04:14:58 EDT 2022
% 0.20/0.33 % CPUTime :
% 0.20/0.34 % Running in mono-core mode
% 0.20/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.39 % FOF problem with conjecture
% 0.20/0.39 % 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_3fb9c6.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_f48338 | 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_3fb9c6.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.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_3fb9c6.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
% 0.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % warning: shown sat in sat incomplete mode
% 0.20/0.42 %
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 cnf(c_24,negated_conjecture,
% 0.20/0.42 ( ~ disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.42 | intersection(sk3_esk1_0,sk3_esk2_0) != empty_set ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_5) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_43,negated_conjecture,
% 0.20/0.42 ( ~ disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.42 | intersection(sk3_esk1_0,sk3_esk2_0) != empty_set ),
% 0.20/0.42 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_51,negated_conjecture,
% 0.20/0.42 ( ~ disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.42 | intersection(sk3_esk1_0,sk3_esk2_0) != empty_set ),
% 0.20/0.42 inference(copy,[status(esa)],[c_43]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_54,negated_conjecture,
% 0.20/0.42 ( ~ disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.42 | intersection(sk3_esk1_0,sk3_esk2_0) != empty_set ),
% 0.20/0.42 inference(copy,[status(esa)],[c_51]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_55,negated_conjecture,
% 0.20/0.42 ( ~ disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.42 | intersection(sk3_esk1_0,sk3_esk2_0) != empty_set ),
% 0.20/0.42 inference(copy,[status(esa)],[c_54]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_131,negated_conjecture,
% 0.20/0.42 ( ~ disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.42 | intersection(sk3_esk1_0,sk3_esk2_0) != empty_set ),
% 0.20/0.42 inference(copy,[status(esa)],[c_55]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_17,plain,
% 0.20/0.42 ( ~ subset(X0,X1) | ~ subset(X1,X0) | X0 = X1 ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_84_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_117,plain,
% 0.20/0.42 ( ~ subset(X0,X1) | ~ subset(X1,X0) | X0 = X1 ),
% 0.20/0.42 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_155,plain,
% 0.20/0.42 ( ~ subset(empty_set,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.42 | ~ subset(intersection(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.42 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.42 inference(resolution,[status(thm)],[c_131,c_117]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_156,plain,
% 0.20/0.42 ( ~ subset(empty_set,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.42 | ~ subset(intersection(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.42 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_155]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_15,plain,
% 0.20/0.42 ( member(sk1_esk2_2(X0,X1),X1) | subset(X1,X0) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_86_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_113,plain,
% 0.20/0.42 ( member(sk1_esk2_2(X0,X1),X1) | subset(X1,X0) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_187,plain,
% 0.20/0.42 ( member(sk1_esk2_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.42 | ~ subset(empty_set,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.42 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.42 inference(resolution,[status(thm)],[c_156,c_113]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_188,plain,
% 0.20/0.42 ( member(sk1_esk2_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.42 | ~ subset(empty_set,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.42 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_187]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_19,plain,
% 0.20/0.43 ( member(X0,X1) | ~ member(X0,intersection(X1,X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_82_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_121,plain,
% 0.20/0.43 ( member(X0,X1) | ~ member(X0,intersection(X1,X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_122,plain,
% 0.20/0.43 ( ~ member(X0,intersection(X1,X2)) | member(X0,X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_121]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_213,plain,
% 0.20/0.43 ( member(sk1_esk2_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.20/0.43 | ~ subset(empty_set,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_188,c_122]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_214,plain,
% 0.20/0.43 ( member(sk1_esk2_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.20/0.43 | ~ subset(empty_set,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_213]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_21,plain,
% 0.20/0.43 ( member(sk1_esk4_2(X0,X1),X1) | member(sk1_esk4_2(X0,X1),X0) | X1 = X0 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_80_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_125,plain,
% 0.20/0.43 ( member(sk1_esk4_2(X0,X1),X1) | member(sk1_esk4_2(X0,X1),X0) | X1 = X0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_152,plain,
% 0.20/0.43 ( member(sk1_esk4_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),empty_set)
% 0.20/0.43 | member(sk1_esk4_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_131,c_125]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_153,plain,
% 0.20/0.43 ( member(sk1_esk4_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),empty_set)
% 0.20/0.43 | member(sk1_esk4_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_152]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( ~ member(X0,empty_set) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_101_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_83,plain,
% 0.20/0.43 ( ~ member(X0,empty_set) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_195,plain,
% 0.20/0.43 ( member(sk1_esk4_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_153,c_83]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_196,plain,
% 0.20/0.43 ( member(sk1_esk4_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_195]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_201,plain,
% 0.20/0.43 ( member(sk1_esk4_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.20/0.43 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_196,c_122]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_202,plain,
% 0.20/0.43 ( member(sk1_esk4_2(empty_set,intersection(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.20/0.43 | ~ disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_201]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_25,negated_conjecture,
% 0.20/0.43 ( disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersection(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_6) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_45,negated_conjecture,
% 0.20/0.43 ( disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersection(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_52,negated_conjecture,
% 0.20/0.43 ( disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersection(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_53,negated_conjecture,
% 0.20/0.43 ( disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersection(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_56,negated_conjecture,
% 0.20/0.43 ( disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersection(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_53]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_133,negated_conjecture,
% 0.20/0.43 ( disjoint(sk3_esk1_0,sk3_esk2_0)
% 0.20/0.43 | intersection(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_56]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_12,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | X1 != X2 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_89_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_107,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | X1 != X2 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_145,plain,
% 0.20/0.43 ( member(X0,empty_set)
% 0.20/0.43 | ~ member(X0,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_133,c_107]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_146,plain,
% 0.20/0.43 ( member(X0,empty_set)
% 0.20/0.43 | ~ member(X0,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_145]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_174,plain,
% 0.20/0.43 ( ~ member(X0,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_146,c_83]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_175,plain,
% 0.20/0.43 ( ~ member(X0,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_174]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_22,plain,
% 0.20/0.43 ( ~ member(X0,X1) | ~ member(X0,X2) | member(X0,intersection(X1,X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_79_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_127,plain,
% 0.20/0.43 ( ~ member(X0,X1) | ~ member(X0,X2) | member(X0,intersection(X1,X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_128,plain,
% 0.20/0.43 ( member(X0,intersection(X1,X2)) | ~ member(X0,X1) | ~ member(X0,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_127]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_178,plain,
% 0.20/0.43 ( ~ member(X0,sk3_esk1_0)
% 0.20/0.43 | ~ member(X0,sk3_esk2_0)
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_175,c_128]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_179,plain,
% 0.20/0.43 ( ~ member(X0,sk3_esk1_0)
% 0.20/0.43 | ~ member(X0,sk3_esk2_0)
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_178]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_7,plain,
% 0.20/0.43 ( subset(X0,X1) | X0 != X1 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_94_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_97,plain,
% 0.20/0.43 ( subset(X0,X1) | X0 != X1 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_141,plain,
% 0.20/0.43 ( subset(intersection(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_133,c_97]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_142,plain,
% 0.20/0.43 ( subset(intersection(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_141]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_6,plain,
% 0.20/0.43 ( subset(X0,X1) | X1 != X0 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_95_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_95,plain,
% 0.20/0.43 ( subset(X0,X1) | X1 != X0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_139,plain,
% 0.20/0.43 ( subset(empty_set,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_133,c_95]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_140,plain,
% 0.20/0.43 ( subset(empty_set,intersection(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.43 | disjoint(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_139]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_18,plain,
% 0.20/0.43 ( member(X0,X1) | ~ member(X0,intersection(X2,X1)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_83_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_119,plain,
% 0.20/0.43 ( member(X0,X1) | ~ member(X0,intersection(X2,X1)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_120,plain,
% 0.20/0.43 ( ~ member(X0,intersection(X1,X2)) | member(X0,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_119]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_9,plain,
% 0.20/0.43 ( ~ intersect(X0,X1) | ~ disjoint(X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_92_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_101,plain,
% 0.20/0.43 ( ~ intersect(X0,X1) | ~ disjoint(X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_102,plain,
% 0.20/0.43 ( ~ disjoint(X0,X1) | ~ intersect(X0,X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_101]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_5,plain,
% 0.20/0.43 ( intersect(X0,X1) | disjoint(X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_96_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_93,plain,
% 0.20/0.43 ( intersect(X0,X1) | disjoint(X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_94,plain,
% 0.20/0.43 ( disjoint(X0,X1) | intersect(X0,X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_93]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_23,plain,
% 0.20/0.43 ( ~ member(sk1_esk4_2(X0,X1),X1)
% 0.20/0.43 | ~ member(sk1_esk4_2(X0,X1),X0)
% 0.20/0.43 | X1 = X0 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_78_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_129,plain,
% 0.20/0.43 ( ~ member(sk1_esk4_2(X0,X1),X1)
% 0.20/0.43 | ~ member(sk1_esk4_2(X0,X1),X0)
% 0.20/0.43 | X1 = X0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_23]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_20,plain,
% 0.20/0.43 ( ~ member(sk1_esk2_2(X0,X1),X0) | subset(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_81_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_123,plain,
% 0.20/0.43 ( ~ member(sk1_esk2_2(X0,X1),X0) | subset(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_16,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_d9b3c8.p', c_0_85_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_115,plain,
% 0.20/0.43 ( ~ member(X0,X1) | ~ member(X0,X2) | intersect(X1,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_14,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_d9b3c8.p', c_0_87_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_111,plain,
% 0.20/0.43 ( member(sk1_esk1_2(X0,X1),X1) | ~ intersect(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_13,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_d9b3c8.p', c_0_88_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_109,plain,
% 0.20/0.43 ( member(sk1_esk1_2(X0,X1),X0) | ~ intersect(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_11,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | X2 != X1 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_90_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_105,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | X2 != X1 ),
% 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(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_91_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_103,plain,
% 0.20/0.43 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_8,plain,
% 0.20/0.43 ( intersect(X0,X1) | ~ intersect(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_93_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_99,plain,
% 0.20/0.43 ( intersect(X0,X1) | ~ intersect(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_4,plain,
% 0.20/0.43 ( ~ member(X0,X1) | ~ empty(X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_97_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_91,plain,
% 0.20/0.43 ( ~ member(X0,X1) | ~ empty(X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_3,plain,
% 0.20/0.43 ( member(sk1_esk3_1(X0),X0) | empty(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_98_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_89,plain,
% 0.20/0.43 ( member(sk1_esk3_1(X0),X0) | empty(X0) ),
% 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 ( intersection(X0,X1) = intersection(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_99_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_87,plain,
% 0.20/0.43 ( intersection(X0,X1) = intersection(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_1,plain,
% 0.20/0.43 ( subset(X0,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p', c_0_100_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_85,plain,( subset(X0,X0) ),inference(copy,[status(esa)],[c_1]) ).
% 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: 26
% 0.20/0.43 % num_of_input_neg_conjectures: 2
% 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: 4
% 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.026
% 0.20/0.43 % num_of_symbols: 38
% 0.20/0.43 % num_of_terms: 137
% 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: 12
% 0.20/0.43 % prop_num_of_clauses: 43
% 0.20/0.43 % prop_preprocess_simplified: 73
% 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: 26
% 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: 26
% 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: 40
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 35
% 0.20/0.43 % res_num_of_loops: 16
% 0.20/0.43 % res_forward_subset_subsumed: 3
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 4
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 2
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 22
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 4
% 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.47 % Orienting using strategy ClausalAll
% 0.20/0.47 % FOF problem with conjecture
% 0.20/0.47 % 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_3fb9c6.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_d9b3c8.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_bc67e7 | grep -v "SZS"
% 0.20/0.49
% 0.20/0.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ iProver source info
% 0.20/0.49
% 0.20/0.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.49 % git: non_committed_changes: true
% 0.20/0.49 % git: last_make_outside_of_git: true
% 0.20/0.49
% 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.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.50 % --inst_prop_sim_new false
% 0.20/0.50 % --inst_orphan_elimination true
% 0.20/0.50 % --inst_learning_loop_flag true
% 0.20/0.50 % --inst_learning_start 3000
% 0.20/0.50 % --inst_learning_factor 2
% 0.20/0.50 % --inst_start_prop_sim_after_learn 3
% 0.20/0.50 % --inst_sel_renew solver
% 0.20/0.50 % --inst_lit_activity_flag true
% 0.20/0.50 % --inst_out_proof true
% 0.20/0.50
% 0.20/0.50 % ------ Resolution Options
% 0.20/0.50
% 0.20/0.50 % --resolution_flag true
% 0.20/0.50 % --res_lit_sel kbo_max
% 0.20/0.50 % --res_to_prop_solver none
% 0.20/0.50 % --res_prop_simpl_new false
% 0.20/0.50 % --res_prop_simpl_given false
% 0.20/0.50 % --res_passive_queue_type priority_queues
% 0.20/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.50 % --res_passive_queues_freq [15;5]
% 0.20/0.50 % --res_forward_subs full
% 0.20/0.50 % --res_backward_subs full
% 0.20/0.50 % --res_forward_subs_resolution true
% 0.20/0.50 % --res_backward_subs_resolution true
% 0.20/0.50 % --res_orphan_elimination false
% 0.20/0.50 % --res_time_limit 1000.
% 0.20/0.50 % --res_out_proof true
% 0.20/0.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_3fb9c6.s
% 0.20/0.50 % --modulo true
% 0.20/0.50
% 0.20/0.50 % ------ Combination Options
% 0.20/0.50
% 0.20/0.50 % --comb_res_mult 1000
% 0.20/0.50 % --comb_inst_mult 300
% 0.20/0.50 % ------
% 0.20/0.50
% 0.20/0.50 % ------ Parsing...% successful
% 0.20/0.50
% 0.20/0.50 % ------ 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.50
% 0.20/0.50 % ------ Proving...
% 0.20/0.50 % ------ Problem Properties
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % EPR false
% 0.20/0.50 % Horn false
% 0.20/0.50 % Has equality true
% 0.20/0.50
% 0.20/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 % % ------ Current options:
% 0.20/0.50
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 20.34/20.60 % --inst_prop_sim_new false
% 20.34/20.60 % --inst_orphan_elimination true
% 20.34/20.60 % --inst_learning_loop_flag true
% 20.34/20.60 % --inst_learning_start 3000
% 20.34/20.60 % --inst_learning_factor 2
% 20.34/20.60 % --inst_start_prop_sim_after_learn 3
% 20.34/20.60 % --inst_sel_renew solver
% 20.34/20.60 % --inst_lit_activity_flag true
% 20.34/20.60 % --inst_out_proof true
% 20.34/20.60
% 20.34/20.60 % ------ Resolution Options
% 20.34/20.60
% 20.34/20.60 % --resolution_flag true
% 20.34/20.60 % --res_lit_sel kbo_max
% 20.34/20.60 % --res_to_prop_solver none
% 20.34/20.60 % --res_prop_simpl_new false
% 20.34/20.60 % --res_prop_simpl_given false
% 20.34/20.60 % --res_passive_queue_type priority_queues
% 20.34/20.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 20.34/20.60 % --res_passive_queues_freq [15;5]
% 20.34/20.60 % --res_forward_subs full
% 20.34/20.60 % --res_backward_subs full
% 20.34/20.60 % --res_forward_subs_resolution true
% 20.34/20.60 % --res_backward_subs_resolution true
% 20.34/20.60 % --res_orphan_elimination false
% 20.34/20.60 % --res_time_limit 1000.
% 20.34/20.60 % --res_out_proof true
% 20.34/20.60 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_3fb9c6.s
% 20.34/20.60 % --modulo true
% 20.34/20.60
% 20.34/20.60 % ------ Combination Options
% 20.34/20.60
% 20.34/20.60 % --comb_res_mult 1000
% 20.34/20.60 % --comb_inst_mult 300
% 20.34/20.60 % ------
% 20.34/20.60
% 20.34/20.60
% 20.34/20.60
% 20.34/20.60 % ------ Proving...
% 20.34/20.60 %
% 20.34/20.60
% 20.34/20.60
% 20.34/20.60 % ------ Statistics
% 20.34/20.60
% 20.34/20.60 % ------ General
% 20.34/20.60
% 20.34/20.60 % num_of_input_clauses: 55
% 20.34/20.60 % num_of_input_neg_conjectures: 2
% 20.34/20.60 % num_of_splits: 0
% 20.34/20.60 % num_of_split_atoms: 0
% 20.34/20.60 % num_of_sem_filtered_clauses: 0
% 20.34/20.60 % num_of_subtypes: 0
% 20.34/20.60 % monotx_restored_types: 0
% 20.34/20.60 % sat_num_of_epr_types: 0
% 20.34/20.60 % sat_num_of_non_cyclic_types: 0
% 20.34/20.60 % sat_guarded_non_collapsed_types: 0
% 20.34/20.60 % is_epr: 0
% 20.34/20.60 % is_horn: 0
% 20.34/20.60 % has_eq: 1
% 20.34/20.60 % num_pure_diseq_elim: 0
% 20.34/20.60 % simp_replaced_by: 0
% 20.34/20.60 % res_preprocessed: 4
% 20.34/20.60 % prep_upred: 0
% 20.34/20.60 % prep_unflattend: 0
% 20.34/20.60 % pred_elim_cands: 0
% 20.34/20.60 % pred_elim: 0
% 20.34/20.60 % pred_elim_cl: 0
% 20.34/20.60 % pred_elim_cycles: 0
% 20.34/20.60 % forced_gc_time: 0
% 20.34/20.60 % gc_basic_clause_elim: 0
% 20.34/20.60 % parsing_time: 0.001
% 20.34/20.60 % sem_filter_time: 0.
% 20.34/20.60 % pred_elim_time: 0.
% 20.34/20.60 % out_proof_time: 0.001
% 20.34/20.60 % monotx_time: 0.
% 20.34/20.60 % subtype_inf_time: 0.
% 20.34/20.60 % unif_index_cands_time: 0.06
% 20.34/20.60 % unif_index_add_time: 0.013
% 20.34/20.60 % total_time: 20.123
% 20.34/20.60 % num_of_symbols: 38
% 20.34/20.60 % num_of_terms: 68680
% 20.34/20.60
% 20.34/20.60 % ------ Propositional Solver
% 20.34/20.60
% 20.34/20.60 % prop_solver_calls: 15
% 20.34/20.60 % prop_fast_solver_calls: 12
% 20.34/20.60 % prop_num_of_clauses: 4562
% 20.34/20.60 % prop_preprocess_simplified: 7663
% 20.34/20.60 % prop_fo_subsumed: 0
% 20.34/20.60 % prop_solver_time: 0.001
% 20.34/20.60 % prop_fast_solver_time: 0.
% 20.34/20.60 % prop_unsat_core_time: 0.
% 20.34/20.60
% 20.34/20.60 % ------ QBF
% 20.34/20.60
% 20.34/20.60 % qbf_q_res: 0
% 20.34/20.60 % qbf_num_tautologies: 0
% 20.34/20.60 % qbf_prep_cycles: 0
% 20.34/20.60
% 20.34/20.60 % ------ BMC1
% 20.34/20.60
% 20.34/20.60 % bmc1_current_bound: -1
% 20.34/20.60 % bmc1_last_solved_bound: -1
% 20.34/20.60 % bmc1_unsat_core_size: -1
% 20.34/20.60 % bmc1_unsat_core_parents_size: -1
% 20.34/20.60 % bmc1_merge_next_fun: 0
% 20.34/20.60 % bmc1_unsat_core_clauses_time: 0.
% 20.34/20.60
% 20.34/20.60 % ------ Instantiation
% 20.34/20.60
% 20.34/20.60 % inst_num_of_clauses: 3641
% 20.34/20.60 % inst_num_in_passive: 1865
% 20.34/20.60 % inst_num_in_active: 1752
% 20.34/20.60 % inst_num_in_unprocessed: 3
% 20.34/20.60 % inst_num_of_loops: 2130
% 20.34/20.60 % inst_num_of_learning_restarts: 0
% 20.34/20.60 % inst_num_moves_active_passive: 358
% 20.34/20.60 % inst_lit_activity: 509
% 20.34/20.60 % inst_lit_activity_moves: 1
% 20.34/20.60 % inst_num_tautologies: 15
% 20.34/20.60 % inst_num_prop_implied: 0
% 20.34/20.60 % inst_num_existing_simplified: 1
% 20.34/20.60 % inst_num_eq_res_simplified: 1
% 20.34/20.60 % inst_num_child_elim: 0
% 20.34/20.60 % inst_num_of_dismatching_blockings: 20002
% 20.34/20.60 % inst_num_of_non_proper_insts: 11061
% 20.34/20.60 % inst_num_of_duplicates: 2827
% 20.34/20.60 % inst_inst_num_from_inst_to_res: 0
% 20.34/20.60 % inst_dismatching_checking_time: 0.022
% 20.34/20.60
% 20.34/20.60 % ------ Resolution
% 20.34/20.60
% 20.34/20.60 % res_num_of_clauses: 257211
% 20.34/20.60 % res_num_in_passive: 254816
% 20.34/20.60 % res_num_in_active: 3025
% 20.34/20.60 % res_num_of_loops: 8000
% 20.34/20.60 % res_forward_subset_subsumed: 189811
% 20.34/20.60 % res_backward_subset_subsumed: 817
% 20.34/20.60 % res_forward_subsumed: 4355
% 20.34/20.60 % res_backward_subsumed: 290
% 20.34/20.60 % res_forward_subsumption_resolution: 757
% 20.34/20.60 % res_backward_subsumption_resolution: 18
% 20.34/20.60 % res_clause_to_clause_subsumption: 559564
% 20.34/20.60 % res_orphan_elimination: 0
% 20.34/20.60 % res_tautology_del: 2195
% 20.34/20.60 % res_num_eq_res_simplified: 411
% 20.34/20.60 % res_num_sel_changes: 0
% 20.34/20.60 % res_moves_from_active_to_pass: 0
% 20.34/20.60
% 20.34/20.60 % Status Unsatisfiable
% 20.34/20.60 % SZS status Theorem
% 20.34/20.60 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------