TSTP Solution File: SET693+4 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET693+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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:15:27 EDT 2022
% Result : Theorem 7.28s 7.50s
% Output : CNFRefutation 7.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 22
% Syntax : Number of formulae : 199 ( 7 unt; 0 def)
% Number of atoms : 505 ( 38 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 533 ( 227 ~; 253 |; 27 &)
% ( 22 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 5 con; 0-2 aty)
% Number of variables : 467 ( 41 sgn 110 !; 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,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('<stdin>',union) ).
fof(c_0_1,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('<stdin>',difference) ).
fof(c_0_2,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('<stdin>',intersection) ).
fof(c_0_3,axiom,
! [X3,X1] :
( member(X3,product(X1))
<=> ! [X5] :
( member(X5,X1)
=> member(X3,X5) ) ),
file('<stdin>',product) ).
fof(c_0_4,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('<stdin>',subset) ).
fof(c_0_5,axiom,
! [X3,X1] :
( member(X3,sum(X1))
<=> ? [X5] :
( member(X5,X1)
& member(X3,X5) ) ),
file('<stdin>',sum) ).
fof(c_0_6,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
file('<stdin>',unordered_pair) ).
fof(c_0_7,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',equal_set) ).
fof(c_0_8,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('<stdin>',power_set) ).
fof(c_0_9,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('<stdin>',singleton) ).
fof(c_0_10,axiom,
! [X3] : ~ member(X3,empty_set),
file('<stdin>',empty_set) ).
fof(c_0_11,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
c_0_0 ).
fof(c_0_12,plain,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_13,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
c_0_2 ).
fof(c_0_14,axiom,
! [X3,X1] :
( member(X3,product(X1))
<=> ! [X5] :
( member(X5,X1)
=> member(X3,X5) ) ),
c_0_3 ).
fof(c_0_15,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_4 ).
fof(c_0_16,axiom,
! [X3,X1] :
( member(X3,sum(X1))
<=> ? [X5] :
( member(X5,X1)
& member(X3,X5) ) ),
c_0_5 ).
fof(c_0_17,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
c_0_6 ).
fof(c_0_18,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_7 ).
fof(c_0_19,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
c_0_8 ).
fof(c_0_20,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
c_0_9 ).
fof(c_0_21,plain,
! [X3] : ~ member(X3,empty_set),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ member(X4,union(X5,X6))
| member(X4,X5)
| member(X4,X6) )
& ( ~ member(X7,X8)
| member(X7,union(X8,X9)) )
& ( ~ member(X7,X9)
| member(X7,union(X8,X9)) ) ),
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_11])])])])]) ).
fof(c_0_23,plain,
! [X5,X6,X7,X8,X9,X10] :
( ( member(X5,X7)
| ~ member(X5,difference(X7,X6)) )
& ( ~ member(X5,X6)
| ~ member(X5,difference(X7,X6)) )
& ( ~ member(X8,X10)
| member(X8,X9)
| member(X8,difference(X10,X9)) ) ),
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,X9] :
( ( member(X4,X5)
| ~ member(X4,intersection(X5,X6)) )
& ( member(X4,X6)
| ~ member(X4,intersection(X5,X6)) )
& ( ~ member(X7,X8)
| ~ member(X7,X9)
| member(X7,intersection(X8,X9)) ) ),
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_13])])])])]) ).
fof(c_0_25,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ member(X6,product(X7))
| ~ member(X8,X7)
| member(X6,X8) )
& ( member(esk3_2(X9,X10),X10)
| member(X9,product(X10)) )
& ( ~ member(X9,esk3_2(X9,X10))
| member(X9,product(X10)) ) ),
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,
! [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_15])])])])])]) ).
fof(c_0_27,plain,
! [X6,X7,X9,X10,X11] :
( ( member(esk2_2(X6,X7),X7)
| ~ member(X6,sum(X7)) )
& ( member(X6,esk2_2(X6,X7))
| ~ member(X6,sum(X7)) )
& ( ~ member(X11,X10)
| ~ member(X9,X11)
| member(X9,sum(X10)) ) ),
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_16])])])])])]) ).
fof(c_0_28,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ member(X4,unordered_pair(X5,X6))
| X4 = X5
| X4 = X6 )
& ( X7 != X8
| member(X7,unordered_pair(X8,X9)) )
& ( X7 != X9
| member(X7,unordered_pair(X8,X9)) ) ),
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_17])])])])]) ).
fof(c_0_29,plain,
! [X3,X4,X5,X6] :
( ( subset(X3,X4)
| ~ equal_set(X3,X4) )
& ( subset(X4,X3)
| ~ equal_set(X3,X4) )
& ( ~ subset(X5,X6)
| ~ subset(X6,X5)
| equal_set(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_18])])])])]) ).
fof(c_0_30,plain,
! [X4,X5,X6,X7] :
( ( ~ member(X4,power_set(X5))
| subset(X4,X5) )
& ( ~ subset(X6,X7)
| member(X6,power_set(X7)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
fof(c_0_31,plain,
! [X4,X5,X6,X7] :
( ( ~ member(X4,singleton(X5))
| X4 = X5 )
& ( X6 != X7
| member(X6,singleton(X7)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
fof(c_0_32,plain,
! [X4] : ~ member(X4,empty_set),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
( member(X1,product(X2))
| ~ member(X1,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_39,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_40,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_41,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_42,plain,
( member(esk2_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_43,plain,
( member(X1,esk2_2(X1,X2))
| ~ member(X1,sum(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_44,plain,
( member(X1,X2)
| ~ member(X2,X3)
| ~ member(X1,product(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_45,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_46,plain,
( member(X1,sum(X2))
| ~ member(X1,X3)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_47,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_48,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_49,plain,
( member(X1,product(X2))
| member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_50,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_51,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_52,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_53,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_54,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_55,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_56,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_57,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_58,plain,
( subset(X2,X1)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_59,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_60,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_61,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_62,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
c_0_33,
[final] ).
cnf(c_0_63,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
c_0_34,
[final] ).
cnf(c_0_64,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
c_0_35,
[final] ).
cnf(c_0_65,plain,
( member(X1,product(X2))
| ~ member(X1,esk3_2(X1,X2)) ),
c_0_36,
[final] ).
cnf(c_0_66,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
c_0_37,
[final] ).
cnf(c_0_67,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_38,
[final] ).
cnf(c_0_68,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_39,
[final] ).
cnf(c_0_69,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
c_0_40,
[final] ).
cnf(c_0_70,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
c_0_41,
[final] ).
cnf(c_0_71,plain,
( member(esk2_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
c_0_42,
[final] ).
cnf(c_0_72,plain,
( member(X1,esk2_2(X1,X2))
| ~ member(X1,sum(X2)) ),
c_0_43,
[final] ).
cnf(c_0_73,plain,
( member(X1,X2)
| ~ member(X2,X3)
| ~ member(X1,product(X3)) ),
c_0_44,
[final] ).
cnf(c_0_74,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
c_0_45,
[final] ).
cnf(c_0_75,plain,
( member(X1,sum(X2))
| ~ member(X1,X3)
| ~ member(X3,X2) ),
c_0_46,
[final] ).
cnf(c_0_76,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
c_0_47,
[final] ).
cnf(c_0_77,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
c_0_48,
[final] ).
cnf(c_0_78,plain,
( member(X1,product(X2))
| member(esk3_2(X1,X2),X2) ),
c_0_49,
[final] ).
cnf(c_0_79,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_50,
[final] ).
cnf(c_0_80,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
c_0_51,
[final] ).
cnf(c_0_81,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
c_0_52,
[final] ).
cnf(c_0_82,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
c_0_53,
[final] ).
cnf(c_0_83,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
c_0_54,
[final] ).
cnf(c_0_84,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
c_0_55,
[final] ).
cnf(c_0_85,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
c_0_56,
[final] ).
cnf(c_0_86,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
c_0_57,
[final] ).
cnf(c_0_87,plain,
( subset(X2,X1)
| ~ equal_set(X1,X2) ),
c_0_58,
[final] ).
cnf(c_0_88,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
c_0_59,
[final] ).
cnf(c_0_89,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
c_0_60,
[final] ).
cnf(c_0_90,plain,
~ member(X1,empty_set),
c_0_61,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_62_0,axiom,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_62_1,axiom,
( member(X1,X3)
| member(X1,X2)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_62_2,axiom,
( ~ member(X1,union(X3,X2))
| member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_63_0,axiom,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_63_1,axiom,
( ~ member(X1,X3)
| ~ member(X1,difference(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_64_0,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_1,axiom,
( ~ member(X1,X3)
| member(X1,intersection(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_2,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_65_0,axiom,
( member(X1,product(X2))
| ~ member(X1,sk1_esk3_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_1,axiom,
( ~ member(X1,sk1_esk3_2(X1,X2))
| member(X1,product(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_66_0,axiom,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_1,axiom,
( ~ member(X1,difference(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_67_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_67_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_68_0,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_69_0,axiom,
( subset(X1,X2)
| ~ member(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_69_1,axiom,
( ~ member(sk1_esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_70_0,axiom,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_1,axiom,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_2,axiom,
( ~ member(X1,X2)
| member(X1,X3)
| member(X1,difference(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_71_0,axiom,
( member(sk1_esk2_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_1,axiom,
( ~ member(X1,sum(X2))
| member(sk1_esk2_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_72_0,axiom,
( member(X1,sk1_esk2_2(X1,X2))
| ~ member(X1,sum(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_1,axiom,
( ~ member(X1,sum(X2))
| member(X1,sk1_esk2_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_73_0,axiom,
( member(X1,X2)
| ~ member(X2,X3)
| ~ member(X1,product(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_1,axiom,
( ~ member(X2,X3)
| member(X1,X2)
| ~ member(X1,product(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_2,axiom,
( ~ member(X1,product(X3))
| ~ member(X2,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_74_0,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_1,axiom,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_2,axiom,
( ~ member(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_75_0,axiom,
( member(X1,sum(X2))
| ~ member(X1,X3)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_1,axiom,
( ~ member(X1,X3)
| member(X1,sum(X2))
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_2,axiom,
( ~ member(X3,X2)
| ~ member(X1,X3)
| member(X1,sum(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_76_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_1,axiom,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_77_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_1,axiom,
( ~ member(X1,X3)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_78_0,axiom,
( member(X1,product(X2))
| member(sk1_esk3_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( member(sk1_esk3_2(X1,X2),X2)
| member(X1,product(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( ~ subset(X2,X1)
| equal_set(X1,X2)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_2,axiom,
( ~ subset(X1,X2)
| ~ subset(X2,X1)
| equal_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_80_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_80_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_80_2,axiom,
( ~ subset(X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_81_0,axiom,
( subset(X1,X2)
| member(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_81_1,axiom,
( member(sk1_esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_82_0,axiom,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_1,axiom,
( ~ member(X1,power_set(X2))
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_83_0,axiom,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_1,axiom,
( X1 != X2
| member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_84_0,axiom,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_84_1,axiom,
( X1 != X3
| member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_85_0,axiom,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_85_1,axiom,
( ~ subset(X1,X2)
| member(X1,power_set(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_85]) ).
cnf(c_0_86_0,axiom,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_86_1,axiom,
( ~ equal_set(X1,X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_86]) ).
cnf(c_0_87_0,axiom,
( subset(X2,X1)
| ~ equal_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_87_1,axiom,
( ~ equal_set(X1,X2)
| subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_87]) ).
cnf(c_0_88_0,axiom,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_88_1,axiom,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_88]) ).
cnf(c_0_89_0,axiom,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
cnf(c_0_89_1,axiom,
( X1 != X2
| member(X1,singleton(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_89]) ).
cnf(c_0_90_0,axiom,
~ member(X1,empty_set),
inference(literals_permutation,[status(thm)],[c_0_90]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( equal_set(X1,union(X1,X2))
<=> subset(X2,X1) ),
file('<stdin>',thI20) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( equal_set(X1,union(X1,X2))
<=> subset(X2,X1) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( ( ~ equal_set(esk1_0,union(esk1_0,esk2_0))
| ~ subset(esk2_0,esk1_0) )
& ( equal_set(esk1_0,union(esk1_0,esk2_0))
| subset(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,
( ~ subset(esk2_0,esk1_0)
| ~ equal_set(esk1_0,union(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( subset(esk2_0,esk1_0)
| equal_set(esk1_0,union(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( ~ subset(esk2_0,esk1_0)
| ~ equal_set(esk1_0,union(esk1_0,esk2_0)) ),
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
( subset(esk2_0,esk1_0)
| equal_set(esk1_0,union(esk1_0,esk2_0)) ),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_30,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_76_0) ).
cnf(c_133,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_49680,plain,
( member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)),union(sk2_esk1_0,X0))
| ~ member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_133]) ).
cnf(c_223553,plain,
( member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)),union(sk2_esk1_0,sk2_esk2_0))
| ~ member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_49680]) ).
cnf(c_19,plain,
( member(X0,X1)
| ~ member(X0,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_80_2) ).
cnf(c_122,plain,
( member(X0,X1)
| ~ member(X0,X2)
| ~ subset(X2,X1) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_150558,plain,
( ~ member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),union(X0,sk2_esk2_0))
| member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),X1)
| ~ subset(union(X0,sk2_esk2_0),X1) ),
inference(instantiation,[status(thm)],[c_122]) ).
cnf(c_150561,plain,
( ~ member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),union(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),sk2_esk1_0)
| ~ subset(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_150558]) ).
cnf(c_148934,plain,
( ~ member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk2_0)
| member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),X0)
| ~ subset(sk2_esk2_0,X0) ),
inference(instantiation,[status(thm)],[c_122]) ).
cnf(c_148936,plain,
( ~ member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk2_0)
| member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0)
| ~ subset(sk2_esk2_0,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_148934]) ).
cnf(c_27,plain,
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_77_1) ).
cnf(c_130,plain,
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_50440,plain,
( member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),union(X0,sk2_esk2_0))
| ~ member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_130]) ).
cnf(c_50441,plain,
( member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),union(sk2_esk1_0,sk2_esk2_0))
| ~ member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_50440]) ).
cnf(c_62,plain,
( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_62_2) ).
cnf(c_165,plain,
( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X2,X1)) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_49225,plain,
( ~ member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),union(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk2_0)
| member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_165]) ).
cnf(c_48,plain,
( ~ member(sk1_esk1_2(X0,X1),X1)
| subset(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_69_0) ).
cnf(c_151,plain,
( ~ member(sk1_esk1_2(X0,X1),X1)
| subset(X0,X1) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_48920,plain,
( ~ member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),sk2_esk1_0)
| subset(sk2_esk2_0,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_18,plain,
( member(sk1_esk1_2(X0,X1),X0)
| subset(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_81_0) ).
cnf(c_121,plain,
( member(sk1_esk1_2(X0,X1),X0)
| subset(X0,X1) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_48922,plain,
( member(sk1_esk1_2(sk2_esk2_0,sk2_esk1_0),sk2_esk2_0)
| subset(sk2_esk2_0,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_48787,plain,
( ~ member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)),union(sk2_esk1_0,sk2_esk2_0))
| subset(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_48789,plain,
( member(sk1_esk1_2(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)),sk2_esk1_0)
| subset(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_48707,plain,
( ~ member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),sk2_esk1_0)
| subset(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_48709,plain,
( member(sk1_esk1_2(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),union(sk2_esk1_0,sk2_esk2_0))
| subset(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_121]) ).
cnf(c_5,plain,
( subset(X0,X1)
| ~ equal_set(X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_87_1) ).
cnf(c_108,plain,
( subset(X0,X1)
| ~ equal_set(X1,X0) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_48715,plain,
( ~ equal_set(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0))
| subset(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_108]) ).
cnf(c_22,plain,
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_79_2) ).
cnf(c_125,plain,
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_48652,plain,
( equal_set(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0))
| ~ subset(union(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0)
| ~ subset(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0)) ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_65,negated_conjecture,
( ~ equal_set(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0))
| ~ subset(sk2_esk2_0,sk2_esk1_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_5) ).
cnf(c_66,negated_conjecture,
( equal_set(sk2_esk1_0,union(sk2_esk1_0,sk2_esk2_0))
| subset(sk2_esk2_0,sk2_esk1_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p',c_0_6) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_223553,c_150561,c_148936,c_50441,c_49225,c_48920,c_48922,c_48787,c_48789,c_48707,c_48709,c_48715,c_48652,c_65,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : SET693+4 : TPTP v8.1.0. Released v2.2.0.
% 0.14/0.15 % Command : iprover_modulo %s %d
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jul 11 06:07:03 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % Running in mono-core mode
% 0.22/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.44 % FOF problem with conjecture
% 0.22/0.44 % 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_12866d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_d31229.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_dfa7d2 | grep -v "SZS"
% 0.22/0.47
% 0.22/0.47 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % ------ iProver source info
% 0.22/0.47
% 0.22/0.47 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.47 % git: non_committed_changes: true
% 0.22/0.47 % git: last_make_outside_of_git: true
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % ------ Input Options
% 0.22/0.47
% 0.22/0.47 % --out_options all
% 0.22/0.47 % --tptp_safe_out true
% 0.22/0.47 % --problem_path ""
% 0.22/0.47 % --include_path ""
% 0.22/0.47 % --clausifier .//eprover
% 0.22/0.47 % --clausifier_options --tstp-format
% 0.22/0.47 % --stdin false
% 0.22/0.47 % --dbg_backtrace false
% 0.22/0.47 % --dbg_dump_prop_clauses false
% 0.22/0.47 % --dbg_dump_prop_clauses_file -
% 0.22/0.47 % --dbg_out_stat false
% 0.22/0.47
% 0.22/0.47 % ------ General Options
% 0.22/0.47
% 0.22/0.47 % --fof false
% 0.22/0.47 % --time_out_real 150.
% 0.22/0.47 % --time_out_prep_mult 0.2
% 0.22/0.47 % --time_out_virtual -1.
% 0.22/0.47 % --schedule none
% 0.22/0.47 % --ground_splitting input
% 0.22/0.47 % --splitting_nvd 16
% 0.22/0.47 % --non_eq_to_eq false
% 0.22/0.47 % --prep_gs_sim true
% 0.22/0.47 % --prep_unflatten false
% 0.22/0.47 % --prep_res_sim true
% 0.22/0.47 % --prep_upred true
% 0.22/0.47 % --res_sim_input true
% 0.22/0.47 % --clause_weak_htbl true
% 0.22/0.47 % --gc_record_bc_elim false
% 0.22/0.47 % --symbol_type_check false
% 0.22/0.47 % --clausify_out false
% 0.22/0.47 % --large_theory_mode false
% 0.22/0.47 % --prep_sem_filter none
% 0.22/0.47 % --prep_sem_filter_out false
% 0.22/0.47 % --preprocessed_out false
% 0.22/0.47 % --sub_typing false
% 0.22/0.47 % --brand_transform false
% 0.22/0.47 % --pure_diseq_elim true
% 0.22/0.47 % --min_unsat_core false
% 0.22/0.47 % --pred_elim true
% 0.22/0.47 % --add_important_lit false
% 0.22/0.47 % --soft_assumptions false
% 0.22/0.47 % --reset_solvers false
% 0.22/0.47 % --bc_imp_inh []
% 0.22/0.47 % --conj_cone_tolerance 1.5
% 0.22/0.47 % --prolific_symb_bound 500
% 0.22/0.47 % --lt_threshold 2000
% 0.22/0.47
% 0.22/0.47 % ------ SAT Options
% 0.22/0.47
% 0.22/0.47 % --sat_mode false
% 0.22/0.47 % --sat_fm_restart_options ""
% 0.22/0.47 % --sat_gr_def false
% 0.22/0.47 % --sat_epr_types true
% 0.22/0.47 % --sat_non_cyclic_types false
% 0.22/0.47 % --sat_finite_models false
% 0.22/0.47 % --sat_fm_lemmas false
% 0.22/0.47 % --sat_fm_prep false
% 0.22/0.47 % --sat_fm_uc_incr true
% 0.22/0.47 % --sat_out_model small
% 0.22/0.47 % --sat_out_clauses false
% 0.22/0.47
% 0.22/0.47 % ------ QBF Options
% 0.22/0.47
% 0.22/0.47 % --qbf_mode false
% 0.22/0.47 % --qbf_elim_univ true
% 0.22/0.47 % --qbf_sk_in true
% 0.22/0.47 % --qbf_pred_elim true
% 0.22/0.47 % --qbf_split 32
% 0.22/0.47
% 0.22/0.47 % ------ BMC1 Options
% 0.22/0.47
% 0.22/0.47 % --bmc1_incremental false
% 0.22/0.47 % --bmc1_axioms reachable_all
% 0.22/0.47 % --bmc1_min_bound 0
% 0.22/0.47 % --bmc1_max_bound -1
% 0.22/0.47 % --bmc1_max_bound_default -1
% 0.22/0.47 % --bmc1_symbol_reachability true
% 0.22/0.47 % --bmc1_property_lemmas false
% 0.22/0.47 % --bmc1_k_induction false
% 0.22/0.47 % --bmc1_non_equiv_states false
% 0.22/0.47 % --bmc1_deadlock false
% 0.22/0.47 % --bmc1_ucm false
% 0.22/0.47 % --bmc1_add_unsat_core none
% 0.22/0.47 % --bmc1_unsat_core_children false
% 0.22/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.47 % --bmc1_out_stat full
% 0.22/0.47 % --bmc1_ground_init false
% 0.22/0.47 % --bmc1_pre_inst_next_state false
% 0.22/0.47 % --bmc1_pre_inst_state false
% 0.22/0.47 % --bmc1_pre_inst_reach_state false
% 0.22/0.47 % --bmc1_out_unsat_core false
% 0.22/0.47 % --bmc1_aig_witness_out false
% 0.22/0.47 % --bmc1_verbose false
% 0.22/0.47 % --bmc1_dump_clauses_tptp false
% 0.22/0.47 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.47 % --bmc1_dump_file -
% 0.22/0.47 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.47 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.47 % --bmc1_ucm_extend_mode 1
% 0.22/0.47 % --bmc1_ucm_init_mode 2
% 0.22/0.47 % --bmc1_ucm_cone_mode none
% 0.22/0.47 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.47 % --bmc1_ucm_relax_model 4
% 0.22/0.47 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.47 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.47 % --bmc1_ucm_layered_model none
% 0.22/0.47 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.47
% 0.22/0.47 % ------ AIG Options
% 0.22/0.47
% 0.22/0.47 % --aig_mode false
% 0.22/0.47
% 0.22/0.47 % ------ Instantiation Options
% 0.22/0.47
% 0.22/0.47 % --instantiation_flag true
% 0.22/0.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.47 % --inst_solver_per_active 750
% 0.22/0.47 % --inst_solver_calls_frac 0.5
% 0.22/0.47 % --inst_passive_queue_type priority_queues
% 0.22/0.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.47 % --inst_passive_queues_freq [25;2]
% 0.22/0.47 % --inst_dismatching true
% 0.22/0.47 % --inst_eager_unprocessed_to_passive true
% 0.22/0.47 % --inst_prop_sim_given true
% 0.22/0.47 % --inst_prop_sim_new false
% 0.22/0.47 % --inst_orphan_elimination true
% 0.22/0.47 % --inst_learning_loop_flag true
% 0.22/0.47 % --inst_learning_start 3000
% 0.22/0.47 % --inst_learning_factor 2
% 0.22/0.47 % --inst_start_prop_sim_after_learn 3
% 0.22/0.47 % --inst_sel_renew solver
% 0.22/0.47 % --inst_lit_activity_flag true
% 0.22/0.47 % --inst_out_proof true
% 0.22/0.47
% 0.22/0.47 % ------ Resolution Options
% 0.22/0.47
% 0.22/0.47 % --resolution_flag true
% 0.22/0.47 % --res_lit_sel kbo_max
% 0.22/0.47 % --res_to_prop_solver none
% 0.22/0.47 % --res_prop_simpl_new false
% 0.22/0.47 % --res_prop_simpl_given false
% 0.22/0.47 % --res_passive_queue_type priority_queues
% 0.22/0.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.47 % --res_passive_queues_freq [15;5]
% 0.22/0.47 % --res_forward_subs full
% 0.22/0.47 % --res_backward_subs full
% 0.22/0.47 % --res_forward_subs_resolution true
% 0.22/0.47 % --res_backward_subs_resolution true
% 0.22/0.47 % --res_orphan_elimination false
% 0.22/0.47 % --res_time_limit 1000.
% 0.22/0.47 % --res_out_proof true
% 0.22/0.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_12866d.s
% 0.22/0.47 % --modulo true
% 0.22/0.47
% 0.22/0.47 % ------ Combination Options
% 0.22/0.47
% 0.22/0.47 % --comb_res_mult 1000
% 0.22/0.47 % --comb_inst_mult 300
% 0.22/0.47 % ------
% 0.22/0.47
% 0.22/0.47 % ------ Parsing...% successful
% 0.22/0.47
% 0.22/0.47 % ------ 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.22/0.47
% 0.22/0.47 % ------ Proving...
% 0.22/0.47 % ------ Problem Properties
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % EPR false
% 0.22/0.47 % Horn false
% 0.22/0.47 % Has equality true
% 0.22/0.47
% 0.22/0.47 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.47
% 0.22/0.47
% 0.22/0.47 % % ------ Current options:
% 0.22/0.47
% 0.22/0.47 % ------ Input Options
% 0.22/0.47
% 0.22/0.47 % --out_options all
% 0.22/0.47 % --tptp_safe_out true
% 0.22/0.47 % --problem_path ""
% 0.22/0.47 % --include_path ""
% 0.22/0.47 % --clausifier .//eprover
% 0.22/0.47 % --clausifier_options --tstp-format
% 0.22/0.47 % --stdin false
% 0.22/0.47 % --dbg_backtrace false
% 0.22/0.47 % --dbg_dump_prop_clauses false
% 0.22/0.47 % --dbg_dump_prop_clauses_file -
% 0.22/0.47 % --dbg_out_stat false
% 0.22/0.47
% 0.22/0.47 % ------ General Options
% 0.22/0.47
% 0.22/0.47 % --fof false
% 0.22/0.47 % --time_out_real 150.
% 0.22/0.47 % --time_out_prep_mult 0.2
% 0.22/0.47 % --time_out_virtual -1.
% 0.22/0.47 % --schedule none
% 0.22/0.47 % --ground_splitting input
% 0.22/0.47 % --splitting_nvd 16
% 0.22/0.47 % --non_eq_to_eq false
% 0.22/0.47 % --prep_gs_sim true
% 0.22/0.47 % --prep_unflatten false
% 0.22/0.47 % --prep_res_sim true
% 0.22/0.47 % --prep_upred true
% 0.22/0.47 % --res_sim_input true
% 0.22/0.47 % --clause_weak_htbl true
% 0.22/0.47 % --gc_record_bc_elim false
% 0.22/0.47 % --symbol_type_check false
% 0.22/0.47 % --clausify_out false
% 0.22/0.47 % --large_theory_mode false
% 0.22/0.47 % --prep_sem_filter none
% 0.22/0.47 % --prep_sem_filter_out false
% 0.22/0.47 % --preprocessed_out false
% 0.22/0.47 % --sub_typing false
% 0.22/0.47 % --brand_transform false
% 0.22/0.47 % --pure_diseq_elim true
% 0.22/0.47 % --min_unsat_core false
% 0.22/0.47 % --pred_elim true
% 0.22/0.47 % --add_important_lit false
% 0.22/0.47 % --soft_assumptions false
% 0.22/0.47 % --reset_solvers false
% 0.22/0.47 % --bc_imp_inh []
% 0.22/0.47 % --conj_cone_tolerance 1.5
% 0.22/0.47 % --prolific_symb_bound 500
% 0.22/0.47 % --lt_threshold 2000
% 0.22/0.47
% 0.22/0.47 % ------ SAT Options
% 0.22/0.47
% 0.22/0.47 % --sat_mode false
% 0.22/0.47 % --sat_fm_restart_options ""
% 0.22/0.47 % --sat_gr_def false
% 0.22/0.47 % --sat_epr_types true
% 0.22/0.47 % --sat_non_cyclic_types false
% 0.22/0.47 % --sat_finite_models false
% 0.22/0.47 % --sat_fm_lemmas false
% 0.22/0.47 % --sat_fm_prep false
% 0.22/0.47 % --sat_fm_uc_incr true
% 0.22/0.47 % --sat_out_model small
% 0.22/0.47 % --sat_out_clauses false
% 0.22/0.47
% 0.22/0.47 % ------ QBF Options
% 0.22/0.47
% 0.22/0.47 % --qbf_mode false
% 0.22/0.47 % --qbf_elim_univ true
% 0.22/0.47 % --qbf_sk_in true
% 0.22/0.47 % --qbf_pred_elim true
% 0.22/0.47 % --qbf_split 32
% 0.22/0.47
% 0.22/0.47 % ------ BMC1 Options
% 0.22/0.47
% 0.22/0.47 % --bmc1_incremental false
% 0.22/0.47 % --bmc1_axioms reachable_all
% 0.22/0.47 % --bmc1_min_bound 0
% 0.22/0.47 % --bmc1_max_bound -1
% 0.22/0.47 % --bmc1_max_bound_default -1
% 0.22/0.47 % --bmc1_symbol_reachability true
% 0.22/0.47 % --bmc1_property_lemmas false
% 0.22/0.47 % --bmc1_k_induction false
% 0.22/0.47 % --bmc1_non_equiv_states false
% 0.22/0.47 % --bmc1_deadlock false
% 0.22/0.47 % --bmc1_ucm false
% 0.22/0.47 % --bmc1_add_unsat_core none
% 0.22/0.47 % --bmc1_unsat_core_children false
% 0.22/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.47 % --bmc1_out_stat full
% 0.22/0.47 % --bmc1_ground_init false
% 0.22/0.47 % --bmc1_pre_inst_next_state false
% 0.22/0.47 % --bmc1_pre_inst_state false
% 0.22/0.47 % --bmc1_pre_inst_reach_state false
% 0.22/0.47 % --bmc1_out_unsat_core false
% 0.22/0.47 % --bmc1_aig_witness_out false
% 0.22/0.47 % --bmc1_verbose false
% 0.22/0.47 % --bmc1_dump_clauses_tptp false
% 0.22/0.47 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.47 % --bmc1_dump_file -
% 0.22/0.47 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.47 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.47 % --bmc1_ucm_extend_mode 1
% 0.22/0.47 % --bmc1_ucm_init_mode 2
% 0.22/0.47 % --bmc1_ucm_cone_mode none
% 0.22/0.47 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.47 % --bmc1_ucm_relax_model 4
% 0.22/0.47 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.47 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.47 % --bmc1_ucm_layered_model none
% 0.22/0.47 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.47
% 0.22/0.47 % ------ AIG Options
% 0.22/0.47
% 0.22/0.47 % --aig_mode false
% 0.22/0.47
% 0.22/0.47 % ------ Instantiation Options
% 0.22/0.47
% 0.22/0.47 % --instantiation_flag true
% 0.22/0.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.47 % --inst_solver_per_active 750
% 0.22/0.47 % --inst_solver_calls_frac 0.5
% 0.22/0.47 % --inst_passive_queue_type priority_queues
% 0.22/0.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.47 % --inst_passive_queues_freq [25;2]
% 0.22/0.47 % --inst_dismatching true
% 0.22/0.47 % --inst_eager_unprocessed_to_passive true
% 0.22/0.47 % --inst_prop_sim_given true
% 0.22/0.47 % --inst_prop_sim_new false
% 0.22/0.47 % --inst_orphan_elimination true
% 0.22/0.47 % --inst_learning_loop_flag true
% 0.22/0.47 % --inst_learning_start 3000
% 0.22/0.47 % --inst_learning_factor 2
% 0.22/0.47 % --inst_start_prop_sim_after_learn 3
% 0.22/0.47 % --inst_sel_renew solver
% 0.22/0.47 % --inst_lit_activity_flag true
% 0.22/0.47 % --inst_out_proof true
% 0.22/0.47
% 0.22/0.47 % ------ Resolution Options
% 0.22/0.47
% 0.22/0.47 % --resolution_flag true
% 0.22/0.47 % --res_lit_sel kbo_max
% 0.22/0.47 % --res_to_prop_solver none
% 0.22/0.47 % --res_prop_simpl_new false
% 0.22/0.47 % --res_prop_simpl_given false
% 0.22/0.47 % --res_passive_queue_type priority_queues
% 0.22/0.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.47 % --res_passive_queues_freq [15;5]
% 0.22/0.47 % --res_forward_subs full
% 0.22/0.47 % --res_backward_subs full
% 0.22/0.47 % --res_forward_subs_resolution true
% 0.22/0.47 % --res_backward_subs_resolution true
% 0.22/0.47 % --res_orphan_elimination false
% 0.22/0.47 % --res_time_limit 1000.
% 0.22/0.47 % --res_out_proof true
% 0.22/0.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_12866d.s
% 0.22/0.47 % --modulo true
% 0.22/0.47
% 0.22/0.47 % ------ Combination Options
% 0.22/0.47
% 0.22/0.47 % --comb_res_mult 1000
% 0.22/0.47 % --comb_inst_mult 300
% 0.22/0.47 % ------
% 0.22/0.47
% 0.22/0.47
% 0.22/0.47
% 0.22/0.47 % ------ Proving...
% 0.22/0.47 % warning: shown sat in sat incomplete mode
% 0.22/0.47 %
% 0.22/0.47
% 0.22/0.47
% 0.22/0.47
% 0.22/0.47
% 0.22/0.47 cnf(c_29,negated_conjecture,
% 0.22/0.47 ( ~ equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_5) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_53,negated_conjecture,
% 0.22/0.47 ( ~ equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.47 inference(copy,[status(esa)],[c_29]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_61,negated_conjecture,
% 0.22/0.47 ( ~ equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.47 inference(copy,[status(esa)],[c_53]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_64,negated_conjecture,
% 0.22/0.47 ( ~ equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.47 inference(copy,[status(esa)],[c_61]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_65,negated_conjecture,
% 0.22/0.47 ( ~ equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.47 inference(copy,[status(esa)],[c_64]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_156,negated_conjecture,
% 0.22/0.47 ( ~ equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.47 inference(copy,[status(esa)],[c_65]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_16,plain,
% 0.22/0.47 ( ~ subset(X0,X1) | ~ subset(X1,X0) | equal_set(X0,X1) ),
% 0.22/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_104_0) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_130,plain,
% 0.22/0.47 ( ~ subset(X0,X1) | ~ subset(X1,X0) | equal_set(X0,X1) ),
% 0.22/0.47 inference(copy,[status(esa)],[c_16]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_131,plain,
% 0.22/0.47 ( equal_set(X0,X1) | ~ subset(X0,X1) | ~ subset(X1,X0) ),
% 0.22/0.47 inference(rewriting,[status(thm)],[c_130]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_172,plain,
% 0.22/0.47 ( ~ subset(union(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0)
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.47 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.47 inference(resolution,[status(thm)],[c_156,c_131]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_173,plain,
% 0.22/0.47 ( ~ subset(union(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0)
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.47 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.47 inference(rewriting,[status(thm)],[c_172]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_9,plain,
% 0.22/0.47 ( member(sk1_esk1_2(X0,X1),X1) | subset(X1,X0) ),
% 0.22/0.47 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_111_0) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_116,plain,
% 0.22/0.47 ( member(sk1_esk1_2(X0,X1),X1) | subset(X1,X0) ),
% 0.22/0.47 inference(copy,[status(esa)],[c_9]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_189,plain,
% 0.22/0.47 ( member(sk1_esk1_2(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)),union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.47 | ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.47 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.47 inference(resolution,[status(thm)],[c_173,c_116]) ).
% 0.22/0.47
% 0.22/0.47 cnf(c_190,plain,
% 0.22/0.47 ( member(sk1_esk1_2(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)),union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_189]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_26,plain,
% 0.22/0.48 ( member(X0,X1) | member(X0,X2) | ~ member(X0,union(X1,X2)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_94_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_150,plain,
% 0.22/0.48 ( member(X0,X1) | member(X0,X2) | ~ member(X0,union(X1,X2)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_26]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_151,plain,
% 0.22/0.48 ( ~ member(X0,union(X1,X2)) | member(X0,X1) | member(X0,X2) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_150]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_204,plain,
% 0.22/0.48 ( member(sk1_esk1_2(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0)
% 0.22/0.48 | member(sk1_esk1_2(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(resolution,[status(thm)],[c_190,c_151]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_205,plain,
% 0.22/0.48 ( member(sk1_esk1_2(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0)
% 0.22/0.48 | member(sk1_esk1_2(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_204]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_24,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(X0,X1),X0) | subset(X1,X0) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_96_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_146,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(X0,X1),X0) | subset(X1,X0) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_24]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_188,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(resolution,[status(thm)],[c_173,c_146]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_191,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_188]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_7,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_113_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_112,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_7]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_210,plain,
% 0.22/0.48 ( ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(forward_subsumption_resolution,
% 0.22/0.48 [status(thm)],
% 0.22/0.48 [c_205,c_191,c_112]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_211,plain,
% 0.22/0.48 ( ~ subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_210]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_214,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(union(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0),union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(resolution,[status(thm)],[c_211,c_146]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_217,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(union(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0),union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_214]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_22,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X0,union(X1,X2)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_98_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_142,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X0,union(X1,X2)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_22]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_143,plain,
% 0.22/0.48 ( member(X0,union(X1,X2)) | ~ member(X0,X1) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_142]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_230,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(union(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0),sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(resolution,[status(thm)],[c_217,c_143]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_231,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(union(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0),sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_230]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_215,plain,
% 0.22/0.48 ( member(sk1_esk1_2(union(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0),sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(resolution,[status(thm)],[c_211,c_116]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_216,plain,
% 0.22/0.48 ( member(sk1_esk1_2(union(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0),sk3_esk1_0)
% 0.22/0.48 | ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_215]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_234,plain,
% 0.22/0.48 ( ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(forward_subsumption_resolution,[status(thm)],[c_231,c_216]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_235,negated_conjecture,
% 0.22/0.48 ( ~ subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_234]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_242,plain,
% 0.22/0.48 ( member(sk1_esk1_2(sk3_esk1_0,sk3_esk2_0),sk3_esk2_0) ),
% 0.22/0.48 inference(resolution,[status(thm)],[c_235,c_116]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_243,plain,
% 0.22/0.48 ( member(sk1_esk1_2(sk3_esk1_0,sk3_esk2_0),sk3_esk2_0) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_242]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_241,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0) ),
% 0.22/0.48 inference(resolution,[status(thm)],[c_235,c_146]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_244,plain,
% 0.22/0.48 ( ~ member(sk1_esk1_2(sk3_esk1_0,sk3_esk2_0),sk3_esk1_0) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_241]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_30,negated_conjecture,
% 0.22/0.48 ( equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_6) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_55,negated_conjecture,
% 0.22/0.48 ( equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_30]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_62,negated_conjecture,
% 0.22/0.48 ( equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_55]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_63,negated_conjecture,
% 0.22/0.48 ( equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_62]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_66,negated_conjecture,
% 0.22/0.48 ( equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_63]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_158,negated_conjecture,
% 0.22/0.48 ( equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0))
% 0.22/0.48 | subset(sk3_esk2_0,sk3_esk1_0) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_66]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_4,plain,
% 0.22/0.48 ( subset(X0,X1) | ~ equal_set(X0,X1) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_116_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_106,plain,
% 0.22/0.48 ( subset(X0,X1) | ~ equal_set(X0,X1) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_4]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_107,plain,
% 0.22/0.48 ( ~ equal_set(X0,X1) | subset(X0,X1) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_106]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_166,plain,
% 0.22/0.48 ( subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(resolution,[status(thm)],[c_158,c_107]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_167,plain,
% 0.22/0.48 ( subset(sk3_esk2_0,sk3_esk1_0)
% 0.22/0.48 | subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_166]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_238,plain,
% 0.22/0.48 ( subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(backward_subsumption_resolution,[status(thm)],[c_235,c_167]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_239,plain,
% 0.22/0.48 ( subset(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_238]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_237,negated_conjecture,
% 0.22/0.48 ( equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(backward_subsumption_resolution,[status(thm)],[c_235,c_158]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_240,plain,
% 0.22/0.48 ( equal_set(sk3_esk1_0,union(sk3_esk1_0,sk3_esk2_0)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_237]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_28,plain,
% 0.22/0.48 ( ~ member(X0,X1) | ~ member(X0,X2) | member(X0,intersection(X1,X2)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_92_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_154,plain,
% 0.22/0.48 ( ~ member(X0,X1) | ~ member(X0,X2) | member(X0,intersection(X1,X2)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_28]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_155,plain,
% 0.22/0.48 ( member(X0,intersection(X1,X2)) | ~ member(X0,X1) | ~ member(X0,X2) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_154]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_27,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X0,X2) | member(X0,difference(X1,X2)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_93_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_152,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X0,X2) | member(X0,difference(X1,X2)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_27]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_153,plain,
% 0.22/0.48 ( member(X0,difference(X1,X2)) | ~ member(X0,X1) | member(X0,X2) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_152]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_25,plain,
% 0.22/0.48 ( ~ member(X0,sk1_esk3_2(X0,X1)) | member(X0,product(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_95_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_148,plain,
% 0.22/0.48 ( ~ member(X0,sk1_esk3_2(X0,X1)) | member(X0,product(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_25]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_149,plain,
% 0.22/0.48 ( member(X0,product(X1)) | ~ member(X0,sk1_esk3_2(X0,X1)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_148]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_23,plain,
% 0.22/0.48 ( ~ member(X0,X1) | ~ member(X0,difference(X2,X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_97_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_144,plain,
% 0.22/0.48 ( ~ member(X0,X1) | ~ member(X0,difference(X2,X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_23]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_145,plain,
% 0.22/0.48 ( ~ member(X0,difference(X1,X2)) | ~ member(X0,X2) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_144]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_21,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X0,union(X2,X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_99_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_140,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X0,union(X2,X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_21]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_141,plain,
% 0.22/0.48 ( member(X0,union(X1,X2)) | ~ member(X0,X2) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_140]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_20,plain,
% 0.22/0.48 ( member(X0,X1) | ~ member(X0,difference(X1,X2)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_100_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_138,plain,
% 0.22/0.48 ( member(X0,X1) | ~ member(X0,difference(X1,X2)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_20]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_139,plain,
% 0.22/0.48 ( ~ member(X0,difference(X1,X2)) | member(X0,X1) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_138]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_19,plain,
% 0.22/0.48 ( member(X0,X1) | ~ member(X0,intersection(X1,X2)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_101_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_136,plain,
% 0.22/0.48 ( member(X0,X1) | ~ member(X0,intersection(X1,X2)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_19]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_137,plain,
% 0.22/0.48 ( ~ member(X0,intersection(X1,X2)) | member(X0,X1) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_136]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_18,plain,
% 0.22/0.48 ( member(X0,X1) | ~ member(X0,intersection(X2,X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_102_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_134,plain,
% 0.22/0.48 ( member(X0,X1) | ~ member(X0,intersection(X2,X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_18]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_135,plain,
% 0.22/0.48 ( ~ member(X0,intersection(X1,X2)) | member(X0,X2) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_134]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_17,plain,
% 0.22/0.48 ( ~ member(X0,X1) | ~ member(X2,X0) | member(X2,sum(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_103_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_132,plain,
% 0.22/0.48 ( ~ member(X0,X1) | ~ member(X2,X0) | member(X2,sum(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_17]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_133,plain,
% 0.22/0.48 ( member(X0,sum(X1)) | ~ member(X2,X1) | ~ member(X0,X2) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_132]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_15,plain,
% 0.22/0.48 ( X0 = X1 | X0 = X2 | ~ member(X0,unordered_pair(X1,X2)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_105_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_128,plain,
% 0.22/0.48 ( X0 = X1 | X0 = X2 | ~ member(X0,unordered_pair(X1,X2)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_15]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_129,plain,
% 0.22/0.48 ( ~ member(X0,unordered_pair(X1,X2)) | X0 = X1 | X0 = X2 ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_128]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_14,plain,
% 0.22/0.48 ( X0 != X1 | member(X0,unordered_pair(X1,X2)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_106_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_126,plain,
% 0.22/0.48 ( X0 != X1 | member(X0,unordered_pair(X1,X2)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_14]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_127,plain,
% 0.22/0.48 ( member(X0,unordered_pair(X1,X2)) | X0 != X1 ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_126]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_13,plain,
% 0.22/0.48 ( X0 != X1 | member(X0,unordered_pair(X2,X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_107_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_124,plain,
% 0.22/0.48 ( X0 != X1 | member(X0,unordered_pair(X2,X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_13]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_125,plain,
% 0.22/0.48 ( member(X0,unordered_pair(X1,X2)) | X0 != X2 ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_124]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_10,plain,
% 0.22/0.48 ( member(X0,sk1_esk2_2(X0,X1)) | ~ member(X0,sum(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_110_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_118,plain,
% 0.22/0.48 ( member(X0,sk1_esk2_2(X0,X1)) | ~ member(X0,sum(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_10]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_119,plain,
% 0.22/0.48 ( ~ member(X0,sum(X1)) | member(X0,sk1_esk2_2(X0,X1)) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_118]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_8,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X2,X0) | ~ member(X2,product(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_112_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_114,plain,
% 0.22/0.48 ( ~ member(X0,X1) | member(X2,X0) | ~ member(X2,product(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_8]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_115,plain,
% 0.22/0.48 ( ~ member(X0,product(X1)) | ~ member(X2,X1) | member(X0,X2) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_114]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_6,plain,
% 0.22/0.48 ( ~ subset(X0,X1) | member(X0,power_set(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_114_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_110,plain,
% 0.22/0.48 ( ~ subset(X0,X1) | member(X0,power_set(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_6]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_111,plain,
% 0.22/0.48 ( member(X0,power_set(X1)) | ~ subset(X0,X1) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_110]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_5,plain,
% 0.22/0.48 ( subset(X0,X1) | ~ member(X0,power_set(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_115_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_108,plain,
% 0.22/0.48 ( subset(X0,X1) | ~ member(X0,power_set(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_5]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_109,plain,
% 0.22/0.48 ( ~ member(X0,power_set(X1)) | subset(X0,X1) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_108]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_3,plain,
% 0.22/0.48 ( subset(X0,X1) | ~ equal_set(X1,X0) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_117_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_104,plain,
% 0.22/0.48 ( subset(X0,X1) | ~ equal_set(X1,X0) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_3]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_105,plain,
% 0.22/0.48 ( ~ equal_set(X0,X1) | subset(X1,X0) ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_104]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_2,plain,
% 0.22/0.48 ( X0 != X1 | member(X0,singleton(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_118_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_102,plain,
% 0.22/0.48 ( X0 != X1 | member(X0,singleton(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_2]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_103,plain,
% 0.22/0.48 ( member(X0,singleton(X1)) | X0 != X1 ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_102]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_1,plain,
% 0.22/0.48 ( X0 = X1 | ~ member(X0,singleton(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_119_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_100,plain,
% 0.22/0.48 ( X0 = X1 | ~ member(X0,singleton(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_1]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_101,plain,
% 0.22/0.48 ( ~ member(X0,singleton(X1)) | X0 = X1 ),
% 0.22/0.48 inference(rewriting,[status(thm)],[c_100]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_12,plain,
% 0.22/0.48 ( member(sk1_esk3_2(X0,X1),X1) | member(X0,product(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_108_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_122,plain,
% 0.22/0.48 ( member(sk1_esk3_2(X0,X1),X1) | member(X0,product(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_12]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_11,plain,
% 0.22/0.48 ( member(sk1_esk2_2(X0,X1),X1) | ~ member(X0,sum(X1)) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_109_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_120,plain,
% 0.22/0.48 ( member(sk1_esk2_2(X0,X1),X1) | ~ member(X0,sum(X1)) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_11]) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_0,plain,
% 0.22/0.48 ( ~ member(X0,empty_set) ),
% 0.22/0.48 file('/export/starexec/sandbox2/tmp/iprover_modulo_d31229.p', c_0_120_0) ).
% 0.22/0.48
% 0.22/0.48 cnf(c_98,plain,
% 0.22/0.48 ( ~ member(X0,empty_set) ),
% 0.22/0.48 inference(copy,[status(esa)],[c_0]) ).
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48 % ------ Statistics
% 0.22/0.48
% 0.22/0.48 % ------ General
% 0.22/0.48
% 0.22/0.48 % num_of_input_clauses: 31
% 0.22/0.48 % num_of_input_neg_conjectures: 2
% 0.22/0.48 % num_of_splits: 0
% 0.22/0.48 % num_of_split_atoms: 0
% 0.22/0.48 % num_of_sem_filtered_clauses: 0
% 0.22/0.48 % num_of_subtypes: 0
% 0.22/0.48 % monotx_restored_types: 0
% 0.22/0.48 % sat_num_of_epr_types: 0
% 0.22/0.48 % sat_num_of_non_cyclic_types: 0
% 0.22/0.48 % sat_guarded_non_collapsed_types: 0
% 0.22/0.48 % is_epr: 0
% 0.22/0.48 % is_horn: 0
% 0.22/0.48 % has_eq: 1
% 0.22/0.48 % num_pure_diseq_elim: 0
% 0.22/0.48 % simp_replaced_by: 0
% 0.22/0.48 % res_preprocessed: 4
% 0.22/0.48 % prep_upred: 0
% 0.22/0.48 % prep_unflattend: 0
% 0.22/0.48 % pred_elim_cands: 0
% 0.22/0.48 % pred_elim: 0
% 0.22/0.48 % pred_elim_cl: 0
% 0.22/0.48 % pred_elim_cycles: 0
% 0.22/0.48 % forced_gc_time: 0
% 0.22/0.48 % gc_basic_clause_elim: 0
% 0.22/0.48 % parsing_time: 0.001
% 0.22/0.48 % sem_filter_time: 0.
% 0.22/0.48 % pred_elim_time: 0.
% 0.22/0.48 % out_proof_time: 0.
% 0.22/0.48 % monotx_time: 0.
% 0.22/0.48 % subtype_inf_time: 0.
% 0.22/0.48 % unif_index_cands_time: 0.
% 0.22/0.48 % unif_index_add_time: 0.
% 0.22/0.48 % total_time: 0.029
% 0.22/0.48 % num_of_symbols: 42
% 0.22/0.48 % num_of_terms: 175
% 0.22/0.48
% 0.22/0.48 % ------ Propositional Solver
% 0.22/0.48
% 0.22/0.48 % prop_solver_calls: 1
% 0.22/0.48 % prop_fast_solver_calls: 12
% 0.22/0.48 % prop_num_of_clauses: 53
% 0.22/0.48 % prop_preprocess_simplified: 83
% 0.22/0.48 % prop_fo_subsumed: 0
% 0.22/0.48 % prop_solver_time: 0.
% 0.22/0.48 % prop_fast_solver_time: 0.
% 0.22/0.48 % prop_unsat_core_time: 0.
% 0.22/0.48
% 0.22/0.48 % ------ QBF
% 0.22/0.48
% 0.22/0.48 % qbf_q_res: 0
% 0.22/0.48 % qbf_num_tautologies: 0
% 0.22/0.48 % qbf_prep_cycles: 0
% 0.22/0.48
% 0.22/0.48 % ------ BMC1
% 0.22/0.48
% 0.22/0.48 % bmc1_current_bound: -1
% 0.22/0.48 % bmc1_last_solved_bound: -1
% 0.22/0.48 % bmc1_unsat_core_size: -1
% 0.22/0.48 % bmc1_unsat_core_parents_size: -1
% 0.22/0.48 % bmc1_merge_next_fun: 0
% 0.22/0.48 % bmc1_unsat_core_clauses_time: 0.
% 0.22/0.48
% 0.22/0.48 % ------ Instantiation
% 0.22/0.48
% 0.22/0.48 % inst_num_of_clauses: 31
% 0.22/0.48 % inst_num_in_passive: 0
% 0.22/0.48 % inst_num_in_active: 0
% 0.22/0.48 % inst_num_in_unprocessed: 31
% 0.22/0.48 % inst_num_of_loops: 0
% 0.22/0.48 % inst_num_of_learning_restarts: 0
% 0.22/0.48 % inst_num_moves_active_passive: 0
% 0.22/0.48 % inst_lit_activity: 0
% 0.22/0.48 % inst_lit_activity_moves: 0
% 0.22/0.48 % inst_num_tautologies: 0
% 0.22/0.48 % inst_num_prop_implied: 0
% 0.22/0.48 % inst_num_existing_simplified: 0
% 0.22/0.48 % inst_num_eq_res_simplified: 0
% 0.22/0.48 % inst_num_child_elim: 0
% 0.22/0.48 % inst_num_of_dismatching_blockings: 0
% 0.22/0.48 % inst_num_of_non_proper_insts: 0
% 0.22/0.48 % inst_num_of_duplicates: 0
% 0.22/0.48 % inst_inst_num_from_inst_to_res: 0
% 0.22/0.48 % inst_dismatching_checking_time: 0.
% 0.22/0.48
% 0.22/0.48 % ------ Resolution
% 0.22/0.48
% 0.22/0.48 % res_num_of_clauses: 57
% 0.22/0.48 % res_num_in_passive: 0
% 0.22/0.48 % res_num_in_active: 34
% 0.22/0.48 % res_num_of_loops: 19
% 0.22/0.48 % res_forward_subset_subsumed: 2
% 0.22/0.48 % res_backward_subset_subsumed: 1
% 0.22/0.48 % res_forward_subsumed: 4
% 0.22/0.48 % res_backward_subsumed: 6
% 0.22/0.48 % res_forward_subsumption_resolution: 3
% 0.22/0.48 % res_backward_subsumption_resolution: 2
% 0.22/0.48 % res_clause_to_clause_subsumption: 27
% 0.22/0.48 % res_orphan_elimination: 0
% 0.22/0.48 % res_tautology_del: 2
% 0.22/0.48 % res_num_eq_res_simplified: 0
% 0.22/0.48 % res_num_sel_changes: 0
% 0.22/0.48 % res_moves_from_active_to_pass: 0
% 0.22/0.48
% 0.22/0.48 % Status Unknown
% 0.22/0.53 % Orienting using strategy ClausalAll
% 0.22/0.53 % FOF problem with conjecture
% 0.22/0.53 % 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_12866d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_d31229.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_b6675c | grep -v "SZS"
% 0.37/0.56
% 0.37/0.56 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.37/0.56
% 0.37/0.56 %
% 0.37/0.56 % ------ iProver source info
% 0.37/0.56
% 0.37/0.56 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.37/0.56 % git: non_committed_changes: true
% 0.37/0.56 % git: last_make_outside_of_git: true
% 0.37/0.56
% 0.37/0.56 %
% 0.37/0.56 % ------ Input Options
% 0.37/0.56
% 0.37/0.56 % --out_options all
% 0.37/0.56 % --tptp_safe_out true
% 0.37/0.56 % --problem_path ""
% 0.37/0.56 % --include_path ""
% 0.37/0.56 % --clausifier .//eprover
% 0.37/0.56 % --clausifier_options --tstp-format
% 0.37/0.56 % --stdin false
% 0.37/0.56 % --dbg_backtrace false
% 0.37/0.56 % --dbg_dump_prop_clauses false
% 0.37/0.56 % --dbg_dump_prop_clauses_file -
% 0.37/0.56 % --dbg_out_stat false
% 0.37/0.56
% 0.37/0.56 % ------ General Options
% 0.37/0.56
% 0.37/0.56 % --fof false
% 0.37/0.56 % --time_out_real 150.
% 0.37/0.56 % --time_out_prep_mult 0.2
% 0.37/0.56 % --time_out_virtual -1.
% 0.37/0.56 % --schedule none
% 0.37/0.56 % --ground_splitting input
% 0.37/0.56 % --splitting_nvd 16
% 0.37/0.56 % --non_eq_to_eq false
% 0.37/0.56 % --prep_gs_sim true
% 0.37/0.56 % --prep_unflatten false
% 0.37/0.56 % --prep_res_sim true
% 0.37/0.56 % --prep_upred true
% 0.37/0.56 % --res_sim_input true
% 0.37/0.56 % --clause_weak_htbl true
% 0.37/0.56 % --gc_record_bc_elim false
% 0.37/0.56 % --symbol_type_check false
% 0.37/0.56 % --clausify_out false
% 0.37/0.56 % --large_theory_mode false
% 0.37/0.56 % --prep_sem_filter none
% 0.37/0.56 % --prep_sem_filter_out false
% 0.37/0.56 % --preprocessed_out false
% 0.37/0.56 % --sub_typing false
% 0.37/0.56 % --brand_transform false
% 0.37/0.56 % --pure_diseq_elim true
% 0.37/0.56 % --min_unsat_core false
% 0.37/0.56 % --pred_elim true
% 0.37/0.56 % --add_important_lit false
% 0.37/0.56 % --soft_assumptions false
% 0.37/0.56 % --reset_solvers false
% 0.37/0.56 % --bc_imp_inh []
% 0.37/0.56 % --conj_cone_tolerance 1.5
% 0.37/0.56 % --prolific_symb_bound 500
% 0.37/0.56 % --lt_threshold 2000
% 0.37/0.56
% 0.37/0.56 % ------ SAT Options
% 0.37/0.56
% 0.37/0.56 % --sat_mode false
% 0.37/0.56 % --sat_fm_restart_options ""
% 0.37/0.56 % --sat_gr_def false
% 0.37/0.56 % --sat_epr_types true
% 0.37/0.56 % --sat_non_cyclic_types false
% 0.37/0.56 % --sat_finite_models false
% 0.37/0.56 % --sat_fm_lemmas false
% 0.37/0.56 % --sat_fm_prep false
% 0.37/0.56 % --sat_fm_uc_incr true
% 0.37/0.56 % --sat_out_model small
% 0.37/0.56 % --sat_out_clauses false
% 0.37/0.56
% 0.37/0.56 % ------ QBF Options
% 0.37/0.56
% 0.37/0.56 % --qbf_mode false
% 0.37/0.56 % --qbf_elim_univ true
% 0.37/0.56 % --qbf_sk_in true
% 0.37/0.56 % --qbf_pred_elim true
% 0.37/0.56 % --qbf_split 32
% 0.37/0.56
% 0.37/0.56 % ------ BMC1 Options
% 0.37/0.56
% 0.37/0.56 % --bmc1_incremental false
% 0.37/0.56 % --bmc1_axioms reachable_all
% 0.37/0.56 % --bmc1_min_bound 0
% 0.37/0.56 % --bmc1_max_bound -1
% 0.37/0.56 % --bmc1_max_bound_default -1
% 0.37/0.56 % --bmc1_symbol_reachability true
% 0.37/0.56 % --bmc1_property_lemmas false
% 0.37/0.56 % --bmc1_k_induction false
% 0.37/0.56 % --bmc1_non_equiv_states false
% 0.37/0.56 % --bmc1_deadlock false
% 0.37/0.56 % --bmc1_ucm false
% 0.37/0.56 % --bmc1_add_unsat_core none
% 0.37/0.56 % --bmc1_unsat_core_children false
% 0.37/0.56 % --bmc1_unsat_core_extrapolate_axioms false
% 0.37/0.56 % --bmc1_out_stat full
% 0.37/0.56 % --bmc1_ground_init false
% 0.37/0.56 % --bmc1_pre_inst_next_state false
% 0.37/0.56 % --bmc1_pre_inst_state false
% 0.37/0.56 % --bmc1_pre_inst_reach_state false
% 0.37/0.56 % --bmc1_out_unsat_core false
% 0.37/0.56 % --bmc1_aig_witness_out false
% 0.37/0.56 % --bmc1_verbose false
% 0.37/0.56 % --bmc1_dump_clauses_tptp false
% 0.37/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.37/0.56 % --bmc1_dump_file -
% 0.37/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.37/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.37/0.56 % --bmc1_ucm_extend_mode 1
% 0.37/0.56 % --bmc1_ucm_init_mode 2
% 0.37/0.56 % --bmc1_ucm_cone_mode none
% 0.37/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.37/0.56 % --bmc1_ucm_relax_model 4
% 0.37/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.37/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.37/0.56 % --bmc1_ucm_layered_model none
% 0.37/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.37/0.56
% 0.37/0.56 % ------ AIG Options
% 0.37/0.56
% 0.37/0.56 % --aig_mode false
% 0.37/0.56
% 0.37/0.56 % ------ Instantiation Options
% 0.37/0.56
% 0.37/0.56 % --instantiation_flag true
% 0.37/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.37/0.56 % --inst_solver_per_active 750
% 0.37/0.56 % --inst_solver_calls_frac 0.5
% 0.37/0.56 % --inst_passive_queue_type priority_queues
% 0.37/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.37/0.56 % --inst_passive_queues_freq [25;2]
% 0.37/0.56 % --inst_dismatching true
% 0.37/0.56 % --inst_eager_unprocessed_to_passive true
% 0.37/0.56 % --inst_prop_sim_given true
% 0.37/0.56 % --inst_prop_sim_new false
% 0.37/0.56 % --inst_orphan_elimination true
% 0.37/0.56 % --inst_learning_loop_flag true
% 0.37/0.56 % --inst_learning_start 3000
% 0.37/0.56 % --inst_learning_factor 2
% 0.37/0.56 % --inst_start_prop_sim_after_learn 3
% 0.37/0.56 % --inst_sel_renew solver
% 0.37/0.56 % --inst_lit_activity_flag true
% 0.37/0.56 % --inst_out_proof true
% 0.37/0.56
% 0.37/0.56 % ------ Resolution Options
% 0.37/0.56
% 0.37/0.56 % --resolution_flag true
% 0.37/0.56 % --res_lit_sel kbo_max
% 0.37/0.56 % --res_to_prop_solver none
% 0.37/0.56 % --res_prop_simpl_new false
% 0.37/0.56 % --res_prop_simpl_given false
% 0.37/0.56 % --res_passive_queue_type priority_queues
% 0.37/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.37/0.56 % --res_passive_queues_freq [15;5]
% 0.37/0.56 % --res_forward_subs full
% 0.37/0.56 % --res_backward_subs full
% 0.37/0.56 % --res_forward_subs_resolution true
% 0.37/0.56 % --res_backward_subs_resolution true
% 0.37/0.56 % --res_orphan_elimination false
% 0.37/0.56 % --res_time_limit 1000.
% 0.37/0.56 % --res_out_proof true
% 0.37/0.56 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_12866d.s
% 0.37/0.56 % --modulo true
% 0.37/0.56
% 0.37/0.56 % ------ Combination Options
% 0.37/0.56
% 0.37/0.56 % --comb_res_mult 1000
% 0.37/0.56 % --comb_inst_mult 300
% 0.37/0.56 % ------
% 0.37/0.56
% 0.37/0.56 % ------ Parsing...% successful
% 0.37/0.56
% 0.37/0.56 % ------ 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.37/0.56
% 0.37/0.56 % ------ Proving...
% 0.37/0.56 % ------ Problem Properties
% 0.37/0.56
% 0.37/0.56 %
% 0.37/0.56 % EPR false
% 0.37/0.56 % Horn false
% 0.37/0.56 % Has equality true
% 0.37/0.56
% 0.37/0.56 % % ------ Input Options Time Limit: Unbounded
% 0.37/0.56
% 0.37/0.56
% 0.37/0.56 % % ------ Current options:
% 0.37/0.56
% 0.37/0.56 % ------ Input Options
% 0.37/0.56
% 0.37/0.56 % --out_options all
% 0.37/0.56 % --tptp_safe_out true
% 0.37/0.56 % --problem_path ""
% 0.37/0.56 % --include_path ""
% 0.37/0.56 % --clausifier .//eprover
% 0.37/0.56 % --clausifier_options --tstp-format
% 0.37/0.56 % --stdin false
% 0.37/0.56 % --dbg_backtrace false
% 0.37/0.56 % --dbg_dump_prop_clauses false
% 0.37/0.56 % --dbg_dump_prop_clauses_file -
% 0.37/0.56 % --dbg_out_stat false
% 0.37/0.56
% 0.37/0.56 % ------ General Options
% 0.37/0.56
% 0.37/0.56 % --fof false
% 0.37/0.56 % --time_out_real 150.
% 0.37/0.56 % --time_out_prep_mult 0.2
% 0.37/0.56 % --time_out_virtual -1.
% 0.37/0.56 % --schedule none
% 0.37/0.56 % --ground_splitting input
% 0.37/0.56 % --splitting_nvd 16
% 0.37/0.56 % --non_eq_to_eq false
% 0.37/0.56 % --prep_gs_sim true
% 0.37/0.56 % --prep_unflatten false
% 0.37/0.56 % --prep_res_sim true
% 0.37/0.56 % --prep_upred true
% 0.37/0.56 % --res_sim_input true
% 0.37/0.56 % --clause_weak_htbl true
% 0.37/0.56 % --gc_record_bc_elim false
% 0.37/0.56 % --symbol_type_check false
% 0.37/0.56 % --clausify_out false
% 0.37/0.56 % --large_theory_mode false
% 0.37/0.56 % --prep_sem_filter none
% 0.37/0.56 % --prep_sem_filter_out false
% 0.37/0.56 % --preprocessed_out false
% 0.37/0.56 % --sub_typing false
% 0.37/0.56 % --brand_transform false
% 0.37/0.56 % --pure_diseq_elim true
% 0.37/0.56 % --min_unsat_core false
% 0.37/0.56 % --pred_elim true
% 0.37/0.56 % --add_important_lit false
% 0.37/0.56 % --soft_assumptions false
% 0.37/0.56 % --reset_solvers false
% 0.37/0.56 % --bc_imp_inh []
% 0.37/0.56 % --conj_cone_tolerance 1.5
% 0.37/0.56 % --prolific_symb_bound 500
% 0.37/0.56 % --lt_threshold 2000
% 0.37/0.56
% 0.37/0.56 % ------ SAT Options
% 0.37/0.56
% 0.37/0.56 % --sat_mode false
% 0.37/0.56 % --sat_fm_restart_options ""
% 0.37/0.56 % --sat_gr_def false
% 0.37/0.56 % --sat_epr_types true
% 0.37/0.56 % --sat_non_cyclic_types false
% 0.37/0.56 % --sat_finite_models false
% 0.37/0.56 % --sat_fm_lemmas false
% 0.37/0.56 % --sat_fm_prep false
% 0.37/0.56 % --sat_fm_uc_incr true
% 0.37/0.56 % --sat_out_model small
% 0.37/0.56 % --sat_out_clauses false
% 0.37/0.56
% 0.37/0.56 % ------ QBF Options
% 0.37/0.56
% 0.37/0.56 % --qbf_mode false
% 0.37/0.56 % --qbf_elim_univ true
% 0.37/0.56 % --qbf_sk_in true
% 0.37/0.56 % --qbf_pred_elim true
% 0.37/0.56 % --qbf_split 32
% 0.37/0.56
% 0.37/0.56 % ------ BMC1 Options
% 0.37/0.56
% 0.37/0.56 % --bmc1_incremental false
% 0.37/0.56 % --bmc1_axioms reachable_all
% 0.37/0.56 % --bmc1_min_bound 0
% 0.37/0.56 % --bmc1_max_bound -1
% 0.37/0.56 % --bmc1_max_bound_default -1
% 0.37/0.56 % --bmc1_symbol_reachability true
% 0.37/0.56 % --bmc1_property_lemmas false
% 0.37/0.56 % --bmc1_k_induction false
% 0.37/0.56 % --bmc1_non_equiv_states false
% 0.37/0.56 % --bmc1_deadlock false
% 0.37/0.56 % --bmc1_ucm false
% 0.37/0.56 % --bmc1_add_unsat_core none
% 0.37/0.56 % --bmc1_unsat_core_children false
% 0.37/0.56 % --bmc1_unsat_core_extrapolate_axioms false
% 0.37/0.56 % --bmc1_out_stat full
% 0.37/0.56 % --bmc1_ground_init false
% 0.37/0.56 % --bmc1_pre_inst_next_state false
% 0.37/0.56 % --bmc1_pre_inst_state false
% 0.37/0.56 % --bmc1_pre_inst_reach_state false
% 0.37/0.56 % --bmc1_out_unsat_core false
% 0.37/0.56 % --bmc1_aig_witness_out false
% 0.37/0.56 % --bmc1_verbose false
% 0.37/0.56 % --bmc1_dump_clauses_tptp false
% 0.37/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.37/0.56 % --bmc1_dump_file -
% 0.37/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.37/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.37/0.56 % --bmc1_ucm_extend_mode 1
% 0.37/0.56 % --bmc1_ucm_init_mode 2
% 0.37/0.56 % --bmc1_ucm_cone_mode none
% 0.37/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.37/0.56 % --bmc1_ucm_relax_model 4
% 0.37/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.37/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.37/0.56 % --bmc1_ucm_layered_model none
% 0.37/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.37/0.56
% 0.37/0.56 % ------ AIG Options
% 0.37/0.56
% 0.37/0.56 % --aig_mode false
% 0.37/0.56
% 0.37/0.56 % ------ Instantiation Options
% 0.37/0.56
% 0.37/0.56 % --instantiation_flag true
% 0.37/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.37/0.56 % --inst_solver_per_active 750
% 0.37/0.56 % --inst_solver_calls_frac 0.5
% 0.37/0.56 % --inst_passive_queue_type priority_queues
% 0.37/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.37/0.56 % --inst_passive_queues_freq [25;2]
% 0.37/0.56 % --inst_dismatching true
% 0.37/0.56 % --inst_eager_unprocessed_to_passive true
% 0.37/0.56 % --inst_prop_sim_given true
% 7.28/7.50 % --inst_prop_sim_new false
% 7.28/7.50 % --inst_orphan_elimination true
% 7.28/7.50 % --inst_learning_loop_flag true
% 7.28/7.50 % --inst_learning_start 3000
% 7.28/7.50 % --inst_learning_factor 2
% 7.28/7.50 % --inst_start_prop_sim_after_learn 3
% 7.28/7.50 % --inst_sel_renew solver
% 7.28/7.50 % --inst_lit_activity_flag true
% 7.28/7.50 % --inst_out_proof true
% 7.28/7.50
% 7.28/7.50 % ------ Resolution Options
% 7.28/7.50
% 7.28/7.50 % --resolution_flag true
% 7.28/7.50 % --res_lit_sel kbo_max
% 7.28/7.50 % --res_to_prop_solver none
% 7.28/7.50 % --res_prop_simpl_new false
% 7.28/7.50 % --res_prop_simpl_given false
% 7.28/7.50 % --res_passive_queue_type priority_queues
% 7.28/7.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.28/7.50 % --res_passive_queues_freq [15;5]
% 7.28/7.50 % --res_forward_subs full
% 7.28/7.50 % --res_backward_subs full
% 7.28/7.50 % --res_forward_subs_resolution true
% 7.28/7.50 % --res_backward_subs_resolution true
% 7.28/7.50 % --res_orphan_elimination false
% 7.28/7.50 % --res_time_limit 1000.
% 7.28/7.50 % --res_out_proof true
% 7.28/7.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_12866d.s
% 7.28/7.50 % --modulo true
% 7.28/7.50
% 7.28/7.50 % ------ Combination Options
% 7.28/7.50
% 7.28/7.50 % --comb_res_mult 1000
% 7.28/7.50 % --comb_inst_mult 300
% 7.28/7.50 % ------
% 7.28/7.50
% 7.28/7.50
% 7.28/7.50
% 7.28/7.50 % ------ Proving...
% 7.28/7.50 %
% 7.28/7.50
% 7.28/7.50
% 7.28/7.50 % ------ Statistics
% 7.28/7.50
% 7.28/7.50 % ------ General
% 7.28/7.50
% 7.28/7.50 % num_of_input_clauses: 67
% 7.28/7.50 % num_of_input_neg_conjectures: 2
% 7.28/7.50 % num_of_splits: 0
% 7.28/7.50 % num_of_split_atoms: 0
% 7.28/7.50 % num_of_sem_filtered_clauses: 0
% 7.28/7.50 % num_of_subtypes: 0
% 7.28/7.50 % monotx_restored_types: 0
% 7.28/7.50 % sat_num_of_epr_types: 0
% 7.28/7.50 % sat_num_of_non_cyclic_types: 0
% 7.28/7.50 % sat_guarded_non_collapsed_types: 0
% 7.28/7.50 % is_epr: 0
% 7.28/7.50 % is_horn: 0
% 7.28/7.50 % has_eq: 1
% 7.28/7.50 % num_pure_diseq_elim: 0
% 7.28/7.50 % simp_replaced_by: 0
% 7.28/7.50 % res_preprocessed: 4
% 7.28/7.50 % prep_upred: 0
% 7.28/7.50 % prep_unflattend: 0
% 7.28/7.50 % pred_elim_cands: 0
% 7.28/7.50 % pred_elim: 0
% 7.28/7.50 % pred_elim_cl: 0
% 7.28/7.50 % pred_elim_cycles: 0
% 7.28/7.50 % forced_gc_time: 0
% 7.28/7.50 % gc_basic_clause_elim: 0
% 7.28/7.50 % parsing_time: 0.002
% 7.28/7.50 % sem_filter_time: 0.
% 7.28/7.50 % pred_elim_time: 0.
% 7.28/7.50 % out_proof_time: 0.001
% 7.28/7.50 % monotx_time: 0.
% 7.28/7.50 % subtype_inf_time: 0.
% 7.28/7.50 % unif_index_cands_time: 0.048
% 7.28/7.50 % unif_index_add_time: 0.013
% 7.28/7.50 % total_time: 6.96
% 7.28/7.50 % num_of_symbols: 42
% 7.28/7.50 % num_of_terms: 136338
% 7.28/7.50
% 7.28/7.50 % ------ Propositional Solver
% 7.28/7.50
% 7.28/7.50 % prop_solver_calls: 11
% 7.28/7.50 % prop_fast_solver_calls: 12
% 7.28/7.50 % prop_num_of_clauses: 3644
% 7.28/7.50 % prop_preprocess_simplified: 4421
% 7.28/7.50 % prop_fo_subsumed: 0
% 7.28/7.50 % prop_solver_time: 0.001
% 7.28/7.50 % prop_fast_solver_time: 0.
% 7.28/7.50 % prop_unsat_core_time: 0.
% 7.28/7.50
% 7.28/7.50 % ------ QBF
% 7.28/7.50
% 7.28/7.50 % qbf_q_res: 0
% 7.28/7.50 % qbf_num_tautologies: 0
% 7.28/7.50 % qbf_prep_cycles: 0
% 7.28/7.50
% 7.28/7.50 % ------ BMC1
% 7.28/7.50
% 7.28/7.50 % bmc1_current_bound: -1
% 7.28/7.50 % bmc1_last_solved_bound: -1
% 7.28/7.50 % bmc1_unsat_core_size: -1
% 7.28/7.50 % bmc1_unsat_core_parents_size: -1
% 7.28/7.50 % bmc1_merge_next_fun: 0
% 7.28/7.50 % bmc1_unsat_core_clauses_time: 0.
% 7.28/7.50
% 7.28/7.50 % ------ Instantiation
% 7.28/7.50
% 7.28/7.50 % inst_num_of_clauses: 2091
% 7.28/7.50 % inst_num_in_passive: 1471
% 7.28/7.50 % inst_num_in_active: 543
% 7.28/7.50 % inst_num_in_unprocessed: 72
% 7.28/7.50 % inst_num_of_loops: 823
% 7.28/7.50 % inst_num_of_learning_restarts: 0
% 7.28/7.50 % inst_num_moves_active_passive: 274
% 7.28/7.50 % inst_lit_activity: 262
% 7.28/7.50 % inst_lit_activity_moves: 0
% 7.28/7.50 % inst_num_tautologies: 3
% 7.28/7.50 % inst_num_prop_implied: 0
% 7.28/7.50 % inst_num_existing_simplified: 0
% 7.28/7.50 % inst_num_eq_res_simplified: 0
% 7.28/7.50 % inst_num_child_elim: 0
% 7.28/7.50 % inst_num_of_dismatching_blockings: 2421
% 7.28/7.50 % inst_num_of_non_proper_insts: 3040
% 7.28/7.50 % inst_num_of_duplicates: 2362
% 7.28/7.50 % inst_inst_num_from_inst_to_res: 0
% 7.28/7.50 % inst_dismatching_checking_time: 0.01
% 7.28/7.50
% 7.28/7.50 % ------ Resolution
% 7.28/7.50
% 7.28/7.50 % res_num_of_clauses: 83094
% 7.28/7.50 % res_num_in_passive: 80293
% 7.28/7.50 % res_num_in_active: 2768
% 7.28/7.50 % res_num_of_loops: 3000
% 7.28/7.50 % res_forward_subset_subsumed: 14188
% 7.28/7.50 % res_backward_subset_subsumed: 0
% 7.28/7.50 % res_forward_subsumed: 269
% 7.28/7.50 % res_backward_subsumed: 0
% 7.28/7.50 % res_forward_subsumption_resolution: 0
% 7.28/7.50 % res_backward_subsumption_resolution: 0
% 7.28/7.50 % res_clause_to_clause_subsumption: 31220
% 7.28/7.50 % res_orphan_elimination: 0
% 7.28/7.50 % res_tautology_del: 116
% 7.28/7.50 % res_num_eq_res_simplified: 0
% 7.28/7.50 % res_num_sel_changes: 0
% 7.28/7.50 % res_moves_from_active_to_pass: 0
% 7.28/7.50
% 7.28/7.50 % Status Unsatisfiable
% 7.28/7.50 % SZS status Theorem
% 7.28/7.50 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------