TSTP Solution File: SET600+3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET600+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n006.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:29 EDT 2022
% Result : Theorem 6.00s 6.17s
% Output : CNFRefutation 6.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 150 ( 24 unt; 0 def)
% Number of atoms : 380 ( 105 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 396 ( 166 ~; 198 |; 16 &)
% ( 14 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 288 ( 23 sgn 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('<stdin>',equal_member_defn) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('<stdin>',union_defn) ).
fof(c_0_2,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('<stdin>',subset_defn) ).
fof(c_0_3,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',equal_defn) ).
fof(c_0_4,axiom,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
file('<stdin>',empty_defn) ).
fof(c_0_5,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('<stdin>',commutativity_of_union) ).
fof(c_0_6,axiom,
! [X1] : ~ member(X1,empty_set),
file('<stdin>',empty_set_defn) ).
fof(c_0_7,axiom,
! [X1] : subset(X1,X1),
file('<stdin>',reflexivity_of_subset) ).
fof(c_0_8,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
c_0_0 ).
fof(c_0_9,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
c_0_1 ).
fof(c_0_10,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_2 ).
fof(c_0_11,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_3 ).
fof(c_0_12,plain,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_13,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
c_0_5 ).
fof(c_0_14,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_15,axiom,
! [X1] : subset(X1,X1),
c_0_7 ).
fof(c_0_16,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ member(X6,X4)
| member(X6,X5)
| X4 != X5 )
& ( ~ member(X7,X5)
| member(X7,X4)
| X4 != X5 )
& ( ~ member(esk3_2(X8,X9),X8)
| ~ member(esk3_2(X8,X9),X9)
| X8 = X9 )
& ( member(esk3_2(X8,X9),X8)
| member(esk3_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_8])])])])])]) ).
fof(c_0_17,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X9,X7)
| member(X9,union(X7,X8)) )
& ( ~ member(X9,X8)
| member(X9,union(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_18,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_10])])])])])]) ).
fof(c_0_19,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_11])])])])]) ).
fof(c_0_20,plain,
! [X3,X4,X5] :
( ( ~ empty(X3)
| ~ member(X4,X3) )
& ( member(esk2_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_12])])])])]) ).
fof(c_0_21,plain,
! [X3,X4] : union(X3,X4) = union(X4,X3),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X2] : subset(X2,X2),
inference(variable_rename,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( X1 = X2
| ~ member(esk3_2(X1,X2),X2)
| ~ member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( X1 = X2
| member(esk3_2(X1,X2),X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,plain,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,plain,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_35,plain,
( ~ member(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_36,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_37,plain,
( empty(X1)
| member(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_38,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_39,plain,
( subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_40,plain,
( subset(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_41,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_42,plain,
( X1 = X2
| ~ member(esk3_2(X1,X2),X2)
| ~ member(esk3_2(X1,X2),X1) ),
c_0_24,
[final] ).
cnf(c_0_43,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
c_0_25,
[final] ).
cnf(c_0_44,plain,
( X1 = X2
| member(esk3_2(X1,X2),X2)
| member(esk3_2(X1,X2),X1) ),
c_0_26,
[final] ).
cnf(c_0_45,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
c_0_27,
[final] ).
cnf(c_0_46,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
c_0_28,
[final] ).
cnf(c_0_47,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
c_0_29,
[final] ).
cnf(c_0_48,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
c_0_30,
[final] ).
cnf(c_0_49,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
c_0_31,
[final] ).
cnf(c_0_50,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_32,
[final] ).
cnf(c_0_51,plain,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
c_0_33,
[final] ).
cnf(c_0_52,plain,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
c_0_34,
[final] ).
cnf(c_0_53,plain,
( ~ member(X1,X2)
| ~ empty(X2) ),
c_0_35,
[final] ).
cnf(c_0_54,plain,
union(X1,X2) = union(X2,X1),
c_0_36,
[final] ).
cnf(c_0_55,plain,
( empty(X1)
| member(esk2_1(X1),X1) ),
c_0_37,
[final] ).
cnf(c_0_56,plain,
~ member(X1,empty_set),
c_0_38,
[final] ).
cnf(c_0_57,plain,
( subset(X1,X2)
| X1 != X2 ),
c_0_39,
[final] ).
cnf(c_0_58,plain,
( subset(X2,X1)
| X1 != X2 ),
c_0_40,
[final] ).
cnf(c_0_59,plain,
subset(X1,X1),
c_0_41,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_42_0,axiom,
( X1 = X2
| ~ member(sk1_esk3_2(X1,X2),X2)
| ~ member(sk1_esk3_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_1,axiom,
( ~ member(sk1_esk3_2(X1,X2),X2)
| X1 = X2
| ~ member(sk1_esk3_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_2,axiom,
( ~ member(sk1_esk3_2(X1,X2),X1)
| ~ member(sk1_esk3_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_43_0,axiom,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_1,axiom,
( member(X1,X3)
| member(X1,X2)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_2,axiom,
( ~ member(X1,union(X3,X2))
| member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_44_0,axiom,
( X1 = X2
| member(sk1_esk3_2(X1,X2),X2)
| member(sk1_esk3_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( member(sk1_esk3_2(X1,X2),X2)
| X1 = X2
| member(sk1_esk3_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_2,axiom,
( member(sk1_esk3_2(X1,X2),X1)
| member(sk1_esk3_2(X1,X2),X2)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( subset(X1,X2)
| ~ member(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( ~ member(sk1_esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_47_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_1,axiom,
( ~ member(X1,X3)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_48_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ subset(X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( subset(X1,X2)
| member(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( member(sk1_esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_50_0,axiom,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_1,axiom,
( ~ subset(X2,X1)
| X1 = X2
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_2,axiom,
( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
( member(X3,X2)
| X1 != X2
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_1,axiom,
( X1 != X2
| member(X3,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_2,axiom,
( ~ member(X3,X1)
| X1 != X2
| member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_52_0,axiom,
( member(X3,X1)
| X1 != X2
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( X1 != X2
| member(X3,X1)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_2,axiom,
( ~ member(X3,X2)
| X1 != X2
| member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( ~ member(X1,X2)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( ~ empty(X2)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_55_0,axiom,
( empty(X1)
| member(sk1_esk2_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_1,axiom,
( member(sk1_esk2_1(X1),X1)
| empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_57_0,axiom,
( subset(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_1,axiom,
( X1 != X2
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_58_0,axiom,
( subset(X2,X1)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_1,axiom,
( X1 != X2
| subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_56_0,axiom,
~ member(X1,empty_set),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_54_0,axiom,
union(X1,X2) = union(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_59_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( union(X1,X2) = empty_set
<=> ( X1 = empty_set
& X2 = empty_set ) ),
file('<stdin>',prove_th59) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( union(X1,X2) = empty_set
<=> ( X1 = empty_set
& X2 = empty_set ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( ( union(esk1_0,esk2_0) != empty_set
| esk1_0 != empty_set
| esk2_0 != empty_set )
& ( esk1_0 = empty_set
| union(esk1_0,esk2_0) = empty_set )
& ( esk2_0 = empty_set
| union(esk1_0,esk2_0) = empty_set ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3_004,negated_conjecture,
( esk2_0 != empty_set
| esk1_0 != empty_set
| union(esk1_0,esk2_0) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( union(esk1_0,esk2_0) = empty_set
| esk1_0 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( union(esk1_0,esk2_0) = empty_set
| esk2_0 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
( empty_set != esk2_0
| esk1_0 != empty_set
| union(esk1_0,esk2_0) != empty_set ),
c_0_3,
[final] ).
cnf(c_0_7_008,negated_conjecture,
( union(esk1_0,esk2_0) = empty_set
| esk1_0 = empty_set ),
c_0_4,
[final] ).
cnf(c_0_8_009,negated_conjecture,
( union(esk1_0,esk2_0) = empty_set
| empty_set = esk2_0 ),
c_0_5,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_16,plain,
( ~ member(X0,X1)
| X1 != X2
| member(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_51_0) ).
cnf(c_93,plain,
( ~ member(X0,X1)
| X1 != X2
| member(X0,X2) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_38979,plain,
( ~ member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),X0)
| member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),X1)
| X0 != X1 ),
inference(instantiation,[status(thm)],[c_93]) ).
cnf(c_159309,plain,
( ~ member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk1_0)
| member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),X0)
| sk2_esk1_0 != X0 ),
inference(instantiation,[status(thm)],[c_38979]) ).
cnf(c_159313,plain,
( member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),empty_set)
| ~ member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk1_0)
| sk2_esk1_0 != empty_set ),
inference(instantiation,[status(thm)],[c_159309]) ).
cnf(c_26,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_47_0) ).
cnf(c_103,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_38690,plain,
( member(sk1_esk3_2(empty_set,sk2_esk2_0),union(X0,sk2_esk2_0))
| ~ member(sk1_esk3_2(empty_set,sk2_esk2_0),sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_103]) ).
cnf(c_159161,plain,
( member(sk1_esk3_2(empty_set,sk2_esk2_0),union(sk2_esk1_0,sk2_esk2_0))
| ~ member(sk1_esk3_2(empty_set,sk2_esk2_0),sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_38690]) ).
cnf(c_38906,plain,
( ~ member(sk1_esk3_2(empty_set,sk2_esk2_0),union(X0,sk2_esk2_0))
| member(sk1_esk3_2(empty_set,sk2_esk2_0),X1)
| union(X0,sk2_esk2_0) != X1 ),
inference(instantiation,[status(thm)],[c_93]) ).
cnf(c_159042,plain,
( ~ member(sk1_esk3_2(empty_set,sk2_esk2_0),union(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk3_2(empty_set,sk2_esk2_0),empty_set)
| union(sk2_esk1_0,sk2_esk2_0) != empty_set ),
inference(instantiation,[status(thm)],[c_38906]) ).
cnf(c_28,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_46_0) ).
cnf(c_105,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_38761,plain,
( member(sk1_esk3_2(sk2_esk1_0,empty_set),union(sk2_esk1_0,X0))
| ~ member(sk1_esk3_2(sk2_esk1_0,empty_set),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_105]) ).
cnf(c_158605,plain,
( member(sk1_esk3_2(sk2_esk1_0,empty_set),union(sk2_esk1_0,sk2_esk2_0))
| ~ member(sk1_esk3_2(sk2_esk1_0,empty_set),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_38761]) ).
cnf(c_39063,plain,
( ~ member(sk1_esk3_2(sk2_esk1_0,empty_set),union(sk2_esk1_0,X0))
| member(sk1_esk3_2(sk2_esk1_0,empty_set),X1)
| union(sk2_esk1_0,X0) != X1 ),
inference(instantiation,[status(thm)],[c_93]) ).
cnf(c_158476,plain,
( ~ member(sk1_esk3_2(sk2_esk1_0,empty_set),union(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk3_2(sk2_esk1_0,empty_set),empty_set)
| union(sk2_esk1_0,sk2_esk2_0) != empty_set ),
inference(instantiation,[status(thm)],[c_39063]) ).
cnf(c_13,plain,
( ~ member(X0,X1)
| X2 != X1
| member(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_52_0) ).
cnf(c_90,plain,
( ~ member(X0,X1)
| X2 != X1
| member(X0,X2) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_38981,plain,
( ~ member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),X0)
| member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),X1)
| X1 != X0 ),
inference(instantiation,[status(thm)],[c_90]) ).
cnf(c_39233,plain,
( ~ member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk2_0)
| member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),X0)
| X0 != sk2_esk2_0 ),
inference(instantiation,[status(thm)],[c_38981]) ).
cnf(c_39239,plain,
( member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),empty_set)
| ~ member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk2_0)
| empty_set != sk2_esk2_0 ),
inference(instantiation,[status(thm)],[c_39233]) ).
cnf(c_2,plain,
~ member(X0,empty_set),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_56_0) ).
cnf(c_79,plain,
~ member(X0,empty_set),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_38952,plain,
~ member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),empty_set),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_34,plain,
( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_43_2) ).
cnf(c_111,plain,
( member(X0,X1)
| member(X0,X2)
| ~ member(X0,union(X2,X1)) ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_38867,plain,
( ~ member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),union(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk2_0)
| member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_111]) ).
cnf(c_38732,plain,
~ member(sk1_esk3_2(sk2_esk1_0,empty_set),empty_set),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_33,plain,
( member(sk1_esk3_2(X0,X1),X0)
| member(sk1_esk3_2(X0,X1),X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_44_0) ).
cnf(c_110,plain,
( member(sk1_esk3_2(X0,X1),X0)
| member(sk1_esk3_2(X0,X1),X1)
| X0 = X1 ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_38717,plain,
( member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),union(sk2_esk1_0,sk2_esk2_0))
| member(sk1_esk3_2(union(sk2_esk1_0,sk2_esk2_0),empty_set),empty_set)
| union(sk2_esk1_0,sk2_esk2_0) = empty_set ),
inference(instantiation,[status(thm)],[c_110]) ).
cnf(c_38706,plain,
( member(sk1_esk3_2(sk2_esk1_0,empty_set),empty_set)
| member(sk1_esk3_2(sk2_esk1_0,empty_set),sk2_esk1_0)
| sk2_esk1_0 = empty_set ),
inference(instantiation,[status(thm)],[c_110]) ).
cnf(c_38659,plain,
~ member(sk1_esk3_2(empty_set,sk2_esk2_0),empty_set),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_31,plain,
( X0 = X1
| member(sk1_esk3_2(X0,X1),X1)
| member(sk1_esk3_2(X0,X1),X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_44_2) ).
cnf(c_108,plain,
( X0 = X1
| member(sk1_esk3_2(X0,X1),X1)
| member(sk1_esk3_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_38645,plain,
( member(sk1_esk3_2(empty_set,sk2_esk2_0),empty_set)
| member(sk1_esk3_2(empty_set,sk2_esk2_0),sk2_esk2_0)
| empty_set = sk2_esk2_0 ),
inference(instantiation,[status(thm)],[c_108]) ).
cnf(c_40,negated_conjecture,
( union(sk2_esk1_0,sk2_esk2_0) != empty_set
| empty_set != sk2_esk2_0
| sk2_esk1_0 != empty_set ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_6) ).
cnf(c_41,negated_conjecture,
( union(sk2_esk1_0,sk2_esk2_0) = empty_set
| sk2_esk1_0 = empty_set ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_7) ).
cnf(c_42,negated_conjecture,
( union(sk2_esk1_0,sk2_esk2_0) = empty_set
| empty_set = sk2_esk2_0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p',c_0_8) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_159313,c_159161,c_159042,c_158605,c_158476,c_39239,c_38952,c_38867,c_38732,c_38717,c_38706,c_38659,c_38645,c_40,c_41,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET600+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 23:17:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.42 % FOF problem with conjecture
% 0.20/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a46417.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_07b913.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_a065ce | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 0.20/0.45 % --inst_prop_sim_new false
% 0.20/0.45 % --inst_orphan_elimination true
% 0.20/0.45 % --inst_learning_loop_flag true
% 0.20/0.45 % --inst_learning_start 3000
% 0.20/0.45 % --inst_learning_factor 2
% 0.20/0.45 % --inst_start_prop_sim_after_learn 3
% 0.20/0.45 % --inst_sel_renew solver
% 0.20/0.45 % --inst_lit_activity_flag true
% 0.20/0.45 % --inst_out_proof true
% 0.20/0.45
% 0.20/0.45 % ------ Resolution Options
% 0.20/0.45
% 0.20/0.45 % --resolution_flag true
% 0.20/0.45 % --res_lit_sel kbo_max
% 0.20/0.45 % --res_to_prop_solver none
% 0.20/0.45 % --res_prop_simpl_new false
% 0.20/0.45 % --res_prop_simpl_given false
% 0.20/0.45 % --res_passive_queue_type priority_queues
% 0.20/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.45 % --res_passive_queues_freq [15;5]
% 0.20/0.45 % --res_forward_subs full
% 0.20/0.45 % --res_backward_subs full
% 0.20/0.45 % --res_forward_subs_resolution true
% 0.20/0.45 % --res_backward_subs_resolution true
% 0.20/0.45 % --res_orphan_elimination false
% 0.20/0.45 % --res_time_limit 1000.
% 0.20/0.45 % --res_out_proof true
% 0.20/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a46417.s
% 0.20/0.45 % --modulo true
% 0.20/0.45
% 0.20/0.45 % ------ Combination Options
% 0.20/0.45
% 0.20/0.45 % --comb_res_mult 1000
% 0.20/0.45 % --comb_inst_mult 300
% 0.20/0.45 % ------
% 0.20/0.45
% 0.20/0.45 % ------ Parsing...% successful
% 0.20/0.45
% 0.20/0.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.45
% 0.20/0.45 % ------ Proving...
% 0.20/0.45 % ------ Problem Properties
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % EPR false
% 0.20/0.45 % Horn false
% 0.20/0.45 % Has equality true
% 0.20/0.45
% 0.20/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % % ------ Current options:
% 0.20/0.45
% 0.20/0.45 % ------ Input Options
% 0.20/0.45
% 0.20/0.45 % --out_options all
% 0.20/0.45 % --tptp_safe_out true
% 0.20/0.45 % --problem_path ""
% 0.20/0.45 % --include_path ""
% 0.20/0.45 % --clausifier .//eprover
% 0.20/0.45 % --clausifier_options --tstp-format
% 0.20/0.45 % --stdin false
% 0.20/0.45 % --dbg_backtrace false
% 0.20/0.45 % --dbg_dump_prop_clauses false
% 0.20/0.45 % --dbg_dump_prop_clauses_file -
% 0.20/0.45 % --dbg_out_stat false
% 0.20/0.45
% 0.20/0.45 % ------ General Options
% 0.20/0.45
% 0.20/0.45 % --fof false
% 0.20/0.45 % --time_out_real 150.
% 0.20/0.45 % --time_out_prep_mult 0.2
% 0.20/0.45 % --time_out_virtual -1.
% 0.20/0.45 % --schedule none
% 0.20/0.45 % --ground_splitting input
% 0.20/0.45 % --splitting_nvd 16
% 0.20/0.45 % --non_eq_to_eq false
% 0.20/0.45 % --prep_gs_sim true
% 0.20/0.45 % --prep_unflatten false
% 0.20/0.45 % --prep_res_sim true
% 0.20/0.45 % --prep_upred true
% 0.20/0.45 % --res_sim_input true
% 0.20/0.45 % --clause_weak_htbl true
% 0.20/0.45 % --gc_record_bc_elim false
% 0.20/0.45 % --symbol_type_check false
% 0.20/0.45 % --clausify_out false
% 0.20/0.45 % --large_theory_mode false
% 0.20/0.45 % --prep_sem_filter none
% 0.20/0.45 % --prep_sem_filter_out false
% 0.20/0.45 % --preprocessed_out false
% 0.20/0.45 % --sub_typing false
% 0.20/0.45 % --brand_transform false
% 0.20/0.45 % --pure_diseq_elim true
% 0.20/0.45 % --min_unsat_core false
% 0.20/0.45 % --pred_elim true
% 0.20/0.45 % --add_important_lit false
% 0.20/0.45 % --soft_assumptions false
% 0.20/0.45 % --reset_solvers false
% 0.20/0.45 % --bc_imp_inh []
% 0.20/0.45 % --conj_cone_tolerance 1.5
% 0.20/0.45 % --prolific_symb_bound 500
% 0.20/0.45 % --lt_threshold 2000
% 0.20/0.45
% 0.20/0.45 % ------ SAT Options
% 0.20/0.45
% 0.20/0.45 % --sat_mode false
% 0.20/0.45 % --sat_fm_restart_options ""
% 0.20/0.45 % --sat_gr_def false
% 0.20/0.45 % --sat_epr_types true
% 0.20/0.45 % --sat_non_cyclic_types false
% 0.20/0.45 % --sat_finite_models false
% 0.20/0.45 % --sat_fm_lemmas false
% 0.20/0.45 % --sat_fm_prep false
% 0.20/0.45 % --sat_fm_uc_incr true
% 0.20/0.45 % --sat_out_model small
% 0.20/0.45 % --sat_out_clauses false
% 0.20/0.45
% 0.20/0.45 % ------ QBF Options
% 0.20/0.45
% 0.20/0.45 % --qbf_mode false
% 0.20/0.45 % --qbf_elim_univ true
% 0.20/0.45 % --qbf_sk_in true
% 0.20/0.45 % --qbf_pred_elim true
% 0.20/0.45 % --qbf_split 32
% 0.20/0.45
% 0.20/0.45 % ------ BMC1 Options
% 0.20/0.45
% 0.20/0.45 % --bmc1_incremental false
% 0.20/0.45 % --bmc1_axioms reachable_all
% 0.20/0.45 % --bmc1_min_bound 0
% 0.20/0.45 % --bmc1_max_bound -1
% 0.20/0.45 % --bmc1_max_bound_default -1
% 0.20/0.45 % --bmc1_symbol_reachability true
% 0.20/0.45 % --bmc1_property_lemmas false
% 0.20/0.45 % --bmc1_k_induction false
% 0.20/0.45 % --bmc1_non_equiv_states false
% 0.20/0.45 % --bmc1_deadlock false
% 0.20/0.45 % --bmc1_ucm false
% 0.20/0.45 % --bmc1_add_unsat_core none
% 0.20/0.45 % --bmc1_unsat_core_children false
% 0.20/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.45 % --bmc1_out_stat full
% 0.20/0.45 % --bmc1_ground_init false
% 0.20/0.45 % --bmc1_pre_inst_next_state false
% 0.20/0.45 % --bmc1_pre_inst_state false
% 0.20/0.45 % --bmc1_pre_inst_reach_state false
% 0.20/0.45 % --bmc1_out_unsat_core false
% 0.20/0.45 % --bmc1_aig_witness_out false
% 0.20/0.45 % --bmc1_verbose false
% 0.20/0.45 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 0.20/0.45 % --inst_prop_sim_new false
% 0.20/0.45 % --inst_orphan_elimination true
% 0.20/0.45 % --inst_learning_loop_flag true
% 0.20/0.45 % --inst_learning_start 3000
% 0.20/0.45 % --inst_learning_factor 2
% 0.20/0.45 % --inst_start_prop_sim_after_learn 3
% 0.20/0.45 % --inst_sel_renew solver
% 0.20/0.45 % --inst_lit_activity_flag true
% 0.20/0.45 % --inst_out_proof true
% 0.20/0.45
% 0.20/0.45 % ------ Resolution Options
% 0.20/0.45
% 0.20/0.45 % --resolution_flag true
% 0.20/0.45 % --res_lit_sel kbo_max
% 0.20/0.45 % --res_to_prop_solver none
% 0.20/0.45 % --res_prop_simpl_new false
% 0.20/0.45 % --res_prop_simpl_given false
% 0.20/0.45 % --res_passive_queue_type priority_queues
% 0.20/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.45 % --res_passive_queues_freq [15;5]
% 0.20/0.45 % --res_forward_subs full
% 0.20/0.45 % --res_backward_subs full
% 0.20/0.45 % --res_forward_subs_resolution true
% 0.20/0.45 % --res_backward_subs_resolution true
% 0.20/0.45 % --res_orphan_elimination false
% 0.20/0.45 % --res_time_limit 1000.
% 0.20/0.45 % --res_out_proof true
% 0.20/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a46417.s
% 0.20/0.45 % --modulo true
% 0.20/0.45
% 0.20/0.45 % ------ Combination Options
% 0.20/0.45
% 0.20/0.45 % --comb_res_mult 1000
% 0.20/0.45 % --comb_inst_mult 300
% 0.20/0.45 % ------
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % ------ Proving...
% 0.20/0.45 % warning: shown sat in sat incomplete mode
% 0.20/0.45 %
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 cnf(c_18,negated_conjecture,
% 0.20/0.45 ( empty_set != sk3_esk2_0
% 0.20/0.45 | union(sk3_esk1_0,sk3_esk2_0) != empty_set
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_6) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_34,negated_conjecture,
% 0.20/0.45 ( empty_set != sk3_esk2_0
% 0.20/0.45 | union(sk3_esk1_0,sk3_esk2_0) != empty_set
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_46,negated_conjecture,
% 0.20/0.45 ( empty_set != sk3_esk2_0
% 0.20/0.45 | union(sk3_esk1_0,sk3_esk2_0) != empty_set
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_51,negated_conjecture,
% 0.20/0.45 ( empty_set != sk3_esk2_0
% 0.20/0.45 | union(sk3_esk1_0,sk3_esk2_0) != empty_set
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_52,negated_conjecture,
% 0.20/0.45 ( empty_set != sk3_esk2_0
% 0.20/0.45 | union(sk3_esk1_0,sk3_esk2_0) != empty_set
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_51]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_112,negated_conjecture,
% 0.20/0.45 ( empty_set != sk3_esk2_0
% 0.20/0.45 | union(sk3_esk1_0,sk3_esk2_0) != empty_set
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_11,plain,
% 0.20/0.45 ( ~ subset(X0,X1) | ~ subset(X1,X0) | X0 = X1 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_63_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_98,plain,
% 0.20/0.45 ( ~ subset(X0,X1) | ~ subset(X1,X0) | X0 = X1 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_152,plain,
% 0.20/0.45 ( ~ subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | ~ subset(union(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_112,c_98]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_153,plain,
% 0.20/0.45 ( ~ subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | ~ subset(union(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_152]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_10,plain,
% 0.20/0.45 ( member(sk1_esk1_2(X0,X1),X1) | subset(X1,X0) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_64_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_96,plain,
% 0.20/0.45 ( member(sk1_esk1_2(X0,X1),X1) | subset(X1,X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_213,plain,
% 0.20/0.45 ( member(sk1_esk1_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | ~ subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_153,c_96]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_214,plain,
% 0.20/0.45 ( member(sk1_esk1_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | ~ subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_213]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_15,plain,
% 0.20/0.45 ( member(X0,X1) | member(X0,X2) | ~ member(X0,union(X1,X2)) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_59_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_106,plain,
% 0.20/0.45 ( member(X0,X1) | member(X0,X2) | ~ member(X0,union(X1,X2)) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_107,plain,
% 0.20/0.45 ( ~ member(X0,union(X1,X2)) | member(X0,X1) | member(X0,X2) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_106]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_243,plain,
% 0.20/0.45 ( member(sk1_esk1_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0)
% 0.20/0.45 | member(sk1_esk1_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.20/0.45 | ~ subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_214,c_107]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_244,plain,
% 0.20/0.45 ( member(sk1_esk1_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0)
% 0.20/0.45 | member(sk1_esk1_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.20/0.45 | ~ subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_243]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_16,plain,
% 0.20/0.45 ( member(sk1_esk3_2(X0,X1),X1) | member(sk1_esk3_2(X0,X1),X0) | X1 = X0 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_58_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_108,plain,
% 0.20/0.45 ( member(sk1_esk3_2(X0,X1),X1) | member(sk1_esk3_2(X0,X1),X0) | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_149,plain,
% 0.20/0.45 ( member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),empty_set)
% 0.20/0.45 | member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_112,c_108]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_150,plain,
% 0.20/0.45 ( member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),empty_set)
% 0.20/0.45 | member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_149]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_0,plain,
% 0.20/0.45 ( ~ member(X0,empty_set) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_74_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_76,plain,
% 0.20/0.45 ( ~ member(X0,empty_set) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_224,plain,
% 0.20/0.45 ( member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_150,c_76]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_225,plain,
% 0.20/0.45 ( member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_224]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_229,plain,
% 0.20/0.45 ( member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0)
% 0.20/0.45 | member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_225,c_107]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_230,plain,
% 0.20/0.45 ( member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk2_0)
% 0.20/0.45 | member(sk1_esk3_2(empty_set,union(sk3_esk1_0,sk3_esk2_0)),sk3_esk1_0)
% 0.20/0.45 | empty_set != sk3_esk2_0
% 0.20/0.45 | sk3_esk1_0 != empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_229]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_20,negated_conjecture,
% 0.20/0.45 ( empty_set = sk3_esk2_0 | union(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_8) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_38,negated_conjecture,
% 0.20/0.45 ( empty_set = sk3_esk2_0 | union(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_48,negated_conjecture,
% 0.20/0.45 ( empty_set = sk3_esk2_0 | union(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_38]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_49,negated_conjecture,
% 0.20/0.45 ( empty_set = sk3_esk2_0 | union(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_54,negated_conjecture,
% 0.20/0.45 ( empty_set = sk3_esk2_0 | union(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_49]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_116,negated_conjecture,
% 0.20/0.45 ( empty_set = sk3_esk2_0 | union(sk3_esk1_0,sk3_esk2_0) = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_54]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_9,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,X2) | X1 != X2 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_65_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_94,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,X2) | X1 != X2 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_140,plain,
% 0.20/0.45 ( member(X0,empty_set)
% 0.20/0.45 | ~ member(X0,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_116,c_94]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_141,plain,
% 0.20/0.45 ( member(X0,empty_set)
% 0.20/0.45 | ~ member(X0,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_140]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_196,plain,
% 0.20/0.45 ( ~ member(X0,union(sk3_esk1_0,sk3_esk2_0)) | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_141,c_76]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_197,plain,
% 0.20/0.45 ( ~ member(X0,union(sk3_esk1_0,sk3_esk2_0)) | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_196]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_13,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,union(X1,X2)) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_61_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_102,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,union(X1,X2)) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_103,plain,
% 0.20/0.45 ( member(X0,union(X1,X2)) | ~ member(X0,X1) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_102]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_202,plain,
% 0.20/0.45 ( ~ member(X0,sk3_esk1_0) | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_197,c_103]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_203,plain,
% 0.20/0.45 ( ~ member(X0,sk3_esk1_0) | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_202]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_19,negated_conjecture,
% 0.20/0.45 ( union(sk3_esk1_0,sk3_esk2_0) = empty_set | sk3_esk1_0 = empty_set ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_7) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_36,negated_conjecture,
% 0.20/0.45 ( union(sk3_esk1_0,sk3_esk2_0) = empty_set | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_47,negated_conjecture,
% 0.20/0.45 ( union(sk3_esk1_0,sk3_esk2_0) = empty_set | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_50,negated_conjecture,
% 0.20/0.45 ( union(sk3_esk1_0,sk3_esk2_0) = empty_set | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_53,negated_conjecture,
% 0.20/0.45 ( union(sk3_esk1_0,sk3_esk2_0) = empty_set | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_114,negated_conjecture,
% 0.20/0.45 ( union(sk3_esk1_0,sk3_esk2_0) = empty_set | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(copy,[status(esa)],[c_53]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_128,plain,
% 0.20/0.45 ( member(X0,empty_set)
% 0.20/0.45 | ~ member(X0,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_114,c_94]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_129,plain,
% 0.20/0.45 ( member(X0,empty_set)
% 0.20/0.45 | ~ member(X0,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_128]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_185,plain,
% 0.20/0.45 ( ~ member(X0,union(sk3_esk1_0,sk3_esk2_0)) | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_129,c_76]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_186,plain,
% 0.20/0.45 ( ~ member(X0,union(sk3_esk1_0,sk3_esk2_0)) | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_185]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_191,plain,
% 0.20/0.45 ( ~ member(X0,sk3_esk1_0) | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_186,c_103]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_192,plain,
% 0.20/0.45 ( ~ member(X0,sk3_esk1_0) | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_191]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_6,plain,
% 0.20/0.45 ( subset(X0,X1) | X0 != X1 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_68_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_88,plain,
% 0.20/0.45 ( subset(X0,X1) | X0 != X1 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_136,plain,
% 0.20/0.45 ( subset(union(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.45 | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_116,c_88]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_137,plain,
% 0.20/0.45 ( subset(union(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.45 | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_136]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_5,plain,
% 0.20/0.45 ( subset(X0,X1) | X1 != X0 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_69_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_86,plain,
% 0.20/0.45 ( subset(X0,X1) | X1 != X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_134,plain,
% 0.20/0.45 ( subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_116,c_86]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_135,plain,
% 0.20/0.45 ( subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | empty_set = sk3_esk2_0 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_134]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_124,plain,
% 0.20/0.45 ( subset(union(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.45 | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_114,c_88]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_125,plain,
% 0.20/0.45 ( subset(union(sk3_esk1_0,sk3_esk2_0),empty_set)
% 0.20/0.45 | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_124]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_122,plain,
% 0.20/0.45 ( subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_114,c_86]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_123,plain,
% 0.20/0.45 ( subset(empty_set,union(sk3_esk1_0,sk3_esk2_0))
% 0.20/0.45 | sk3_esk1_0 = empty_set ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_122]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_12,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,union(X2,X1)) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_62_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_100,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,union(X2,X1)) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_101,plain,
% 0.20/0.45 ( member(X0,union(X1,X2)) | ~ member(X0,X2) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_100]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_17,plain,
% 0.20/0.45 ( ~ member(sk1_esk3_2(X0,X1),X1)
% 0.20/0.45 | ~ member(sk1_esk3_2(X0,X1),X0)
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_57_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_110,plain,
% 0.20/0.45 ( ~ member(sk1_esk3_2(X0,X1),X1)
% 0.20/0.45 | ~ member(sk1_esk3_2(X0,X1),X0)
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_14,plain,
% 0.20/0.45 ( ~ member(sk1_esk1_2(X0,X1),X0) | subset(X1,X0) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_60_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_104,plain,
% 0.20/0.45 ( ~ member(sk1_esk1_2(X0,X1),X0) | subset(X1,X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_8,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,X2) | X2 != X1 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_66_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_92,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,X2) | X2 != X1 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_7,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_67_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_90,plain,
% 0.20/0.45 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_4,plain,
% 0.20/0.45 ( ~ member(X0,X1) | ~ empty(X1) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_70_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_84,plain,
% 0.20/0.45 ( ~ member(X0,X1) | ~ empty(X1) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_3,plain,
% 0.20/0.45 ( member(sk1_esk2_1(X0),X0) | empty(X0) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_71_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_82,plain,
% 0.20/0.45 ( member(sk1_esk2_1(X0),X0) | empty(X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_2,plain,
% 0.20/0.45 ( union(X0,X1) = union(X1,X0) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_72_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_80,plain,
% 0.20/0.45 ( union(X0,X1) = union(X1,X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_1,plain,
% 0.20/0.45 ( subset(X0,X0) ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_07b913.p', c_0_73_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_78,plain,( subset(X0,X0) ),inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % ------ Statistics
% 0.20/0.45
% 0.20/0.45 % ------ General
% 0.20/0.45
% 0.20/0.45 % num_of_input_clauses: 21
% 0.20/0.45 % num_of_input_neg_conjectures: 3
% 0.20/0.45 % num_of_splits: 0
% 0.20/0.45 % num_of_split_atoms: 0
% 0.20/0.45 % num_of_sem_filtered_clauses: 0
% 0.20/0.45 % num_of_subtypes: 0
% 0.20/0.45 % monotx_restored_types: 0
% 0.20/0.46 % sat_num_of_epr_types: 0
% 0.20/0.46 % sat_num_of_non_cyclic_types: 0
% 0.20/0.46 % sat_guarded_non_collapsed_types: 0
% 0.20/0.46 % is_epr: 0
% 0.20/0.46 % is_horn: 0
% 0.20/0.46 % has_eq: 1
% 0.20/0.46 % num_pure_diseq_elim: 0
% 0.20/0.46 % simp_replaced_by: 0
% 0.20/0.46 % res_preprocessed: 6
% 0.20/0.46 % prep_upred: 0
% 0.20/0.46 % prep_unflattend: 0
% 0.20/0.46 % pred_elim_cands: 0
% 0.20/0.46 % pred_elim: 0
% 0.20/0.46 % pred_elim_cl: 0
% 0.20/0.46 % pred_elim_cycles: 0
% 0.20/0.46 % forced_gc_time: 0
% 0.20/0.46 % gc_basic_clause_elim: 0
% 0.20/0.46 % parsing_time: 0.
% 0.20/0.46 % sem_filter_time: 0.
% 0.20/0.46 % pred_elim_time: 0.
% 0.20/0.46 % out_proof_time: 0.
% 0.20/0.46 % monotx_time: 0.
% 0.20/0.46 % subtype_inf_time: 0.
% 0.20/0.46 % unif_index_cands_time: 0.
% 0.20/0.46 % unif_index_add_time: 0.
% 0.20/0.46 % total_time: 0.03
% 0.20/0.46 % num_of_symbols: 35
% 0.20/0.46 % num_of_terms: 120
% 0.20/0.46
% 0.20/0.46 % ------ Propositional Solver
% 0.20/0.46
% 0.20/0.46 % prop_solver_calls: 1
% 0.20/0.46 % prop_fast_solver_calls: 21
% 0.20/0.46 % prop_num_of_clauses: 34
% 0.20/0.46 % prop_preprocess_simplified: 68
% 0.20/0.46 % prop_fo_subsumed: 0
% 0.20/0.46 % prop_solver_time: 0.
% 0.20/0.46 % prop_fast_solver_time: 0.
% 0.20/0.46 % prop_unsat_core_time: 0.
% 0.20/0.46
% 0.20/0.46 % ------ QBF
% 0.20/0.46
% 0.20/0.46 % qbf_q_res: 0
% 0.20/0.46 % qbf_num_tautologies: 0
% 0.20/0.46 % qbf_prep_cycles: 0
% 0.20/0.46
% 0.20/0.46 % ------ BMC1
% 0.20/0.46
% 0.20/0.46 % bmc1_current_bound: -1
% 0.20/0.46 % bmc1_last_solved_bound: -1
% 0.20/0.46 % bmc1_unsat_core_size: -1
% 0.20/0.46 % bmc1_unsat_core_parents_size: -1
% 0.20/0.46 % bmc1_merge_next_fun: 0
% 0.20/0.46 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.46
% 0.20/0.46 % ------ Instantiation
% 0.20/0.46
% 0.20/0.46 % inst_num_of_clauses: 21
% 0.20/0.46 % inst_num_in_passive: 0
% 0.20/0.46 % inst_num_in_active: 0
% 0.20/0.46 % inst_num_in_unprocessed: 21
% 0.20/0.46 % inst_num_of_loops: 0
% 0.20/0.46 % inst_num_of_learning_restarts: 0
% 0.20/0.46 % inst_num_moves_active_passive: 0
% 0.20/0.46 % inst_lit_activity: 0
% 0.20/0.46 % inst_lit_activity_moves: 0
% 0.20/0.46 % inst_num_tautologies: 0
% 0.20/0.46 % inst_num_prop_implied: 0
% 0.20/0.46 % inst_num_existing_simplified: 0
% 0.20/0.46 % inst_num_eq_res_simplified: 0
% 0.20/0.46 % inst_num_child_elim: 0
% 0.20/0.46 % inst_num_of_dismatching_blockings: 0
% 0.20/0.46 % inst_num_of_non_proper_insts: 0
% 0.20/0.46 % inst_num_of_duplicates: 0
% 0.20/0.46 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.46 % inst_dismatching_checking_time: 0.
% 0.20/0.46
% 0.20/0.46 % ------ Resolution
% 0.20/0.46
% 0.20/0.46 % res_num_of_clauses: 37
% 0.20/0.46 % res_num_in_passive: 0
% 0.20/0.46 % res_num_in_active: 34
% 0.20/0.46 % res_num_of_loops: 21
% 0.20/0.46 % res_forward_subset_subsumed: 6
% 0.20/0.46 % res_backward_subset_subsumed: 0
% 0.20/0.46 % res_forward_subsumed: 4
% 0.20/0.46 % res_backward_subsumed: 0
% 0.20/0.46 % res_forward_subsumption_resolution: 3
% 0.20/0.46 % res_backward_subsumption_resolution: 0
% 0.20/0.46 % res_clause_to_clause_subsumption: 69
% 0.20/0.46 % res_orphan_elimination: 0
% 0.20/0.46 % res_tautology_del: 12
% 0.20/0.46 % res_num_eq_res_simplified: 0
% 0.20/0.46 % res_num_sel_changes: 0
% 0.20/0.46 % res_moves_from_active_to_pass: 0
% 0.20/0.46
% 0.20/0.46 % Status Unknown
% 0.20/0.50 % Orienting using strategy ClausalAll
% 0.20/0.50 % FOF problem with conjecture
% 0.20/0.50 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a46417.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_07b913.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_b2cdca | grep -v "SZS"
% 0.20/0.53
% 0.20/0.53 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.53
% 0.20/0.53 %
% 0.20/0.53 % ------ iProver source info
% 0.20/0.53
% 0.20/0.53 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.53 % git: non_committed_changes: true
% 0.20/0.53 % git: last_make_outside_of_git: true
% 0.20/0.53
% 0.20/0.53 %
% 0.20/0.53 % ------ Input Options
% 0.20/0.53
% 0.20/0.53 % --out_options all
% 0.20/0.53 % --tptp_safe_out true
% 0.20/0.53 % --problem_path ""
% 0.20/0.53 % --include_path ""
% 0.20/0.53 % --clausifier .//eprover
% 0.20/0.53 % --clausifier_options --tstp-format
% 0.20/0.53 % --stdin false
% 0.20/0.53 % --dbg_backtrace false
% 0.20/0.53 % --dbg_dump_prop_clauses false
% 0.20/0.53 % --dbg_dump_prop_clauses_file -
% 0.20/0.53 % --dbg_out_stat false
% 0.20/0.53
% 0.20/0.53 % ------ General Options
% 0.20/0.53
% 0.20/0.53 % --fof false
% 0.20/0.53 % --time_out_real 150.
% 0.20/0.53 % --time_out_prep_mult 0.2
% 0.20/0.53 % --time_out_virtual -1.
% 0.20/0.53 % --schedule none
% 0.20/0.53 % --ground_splitting input
% 0.20/0.53 % --splitting_nvd 16
% 0.20/0.53 % --non_eq_to_eq false
% 0.20/0.53 % --prep_gs_sim true
% 0.20/0.53 % --prep_unflatten false
% 0.20/0.53 % --prep_res_sim true
% 0.20/0.53 % --prep_upred true
% 0.20/0.53 % --res_sim_input true
% 0.20/0.53 % --clause_weak_htbl true
% 0.20/0.53 % --gc_record_bc_elim false
% 0.20/0.53 % --symbol_type_check false
% 0.20/0.53 % --clausify_out false
% 0.20/0.53 % --large_theory_mode false
% 0.20/0.53 % --prep_sem_filter none
% 0.20/0.53 % --prep_sem_filter_out false
% 0.20/0.53 % --preprocessed_out false
% 0.20/0.53 % --sub_typing false
% 0.20/0.53 % --brand_transform false
% 0.20/0.53 % --pure_diseq_elim true
% 0.20/0.53 % --min_unsat_core false
% 0.20/0.53 % --pred_elim true
% 0.20/0.53 % --add_important_lit false
% 0.20/0.53 % --soft_assumptions false
% 0.20/0.53 % --reset_solvers false
% 0.20/0.53 % --bc_imp_inh []
% 0.20/0.53 % --conj_cone_tolerance 1.5
% 0.20/0.53 % --prolific_symb_bound 500
% 0.20/0.53 % --lt_threshold 2000
% 0.20/0.53
% 0.20/0.53 % ------ SAT Options
% 0.20/0.53
% 0.20/0.53 % --sat_mode false
% 0.20/0.53 % --sat_fm_restart_options ""
% 0.20/0.53 % --sat_gr_def false
% 0.20/0.53 % --sat_epr_types true
% 0.20/0.53 % --sat_non_cyclic_types false
% 0.20/0.53 % --sat_finite_models false
% 0.20/0.53 % --sat_fm_lemmas false
% 0.20/0.53 % --sat_fm_prep false
% 0.20/0.53 % --sat_fm_uc_incr true
% 0.20/0.53 % --sat_out_model small
% 0.20/0.53 % --sat_out_clauses false
% 0.20/0.53
% 0.20/0.53 % ------ QBF Options
% 0.20/0.53
% 0.20/0.53 % --qbf_mode false
% 0.20/0.53 % --qbf_elim_univ true
% 0.20/0.53 % --qbf_sk_in true
% 0.20/0.53 % --qbf_pred_elim true
% 0.20/0.53 % --qbf_split 32
% 0.20/0.53
% 0.20/0.53 % ------ BMC1 Options
% 0.20/0.53
% 0.20/0.53 % --bmc1_incremental false
% 0.20/0.53 % --bmc1_axioms reachable_all
% 0.20/0.53 % --bmc1_min_bound 0
% 0.20/0.53 % --bmc1_max_bound -1
% 0.20/0.53 % --bmc1_max_bound_default -1
% 0.20/0.53 % --bmc1_symbol_reachability true
% 0.20/0.53 % --bmc1_property_lemmas false
% 0.20/0.53 % --bmc1_k_induction false
% 0.20/0.53 % --bmc1_non_equiv_states false
% 0.20/0.53 % --bmc1_deadlock false
% 0.20/0.53 % --bmc1_ucm false
% 0.20/0.53 % --bmc1_add_unsat_core none
% 0.20/0.53 % --bmc1_unsat_core_children false
% 0.20/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.53 % --bmc1_out_stat full
% 0.20/0.53 % --bmc1_ground_init false
% 0.20/0.53 % --bmc1_pre_inst_next_state false
% 0.20/0.53 % --bmc1_pre_inst_state false
% 0.20/0.53 % --bmc1_pre_inst_reach_state false
% 0.20/0.53 % --bmc1_out_unsat_core false
% 0.20/0.53 % --bmc1_aig_witness_out false
% 0.20/0.53 % --bmc1_verbose false
% 0.20/0.53 % --bmc1_dump_clauses_tptp false
% 0.20/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.53 % --bmc1_dump_file -
% 0.20/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.53 % --bmc1_ucm_extend_mode 1
% 0.20/0.53 % --bmc1_ucm_init_mode 2
% 0.20/0.53 % --bmc1_ucm_cone_mode none
% 0.20/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.53 % --bmc1_ucm_relax_model 4
% 0.20/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.53 % --bmc1_ucm_layered_model none
% 0.20/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.53
% 0.20/0.53 % ------ AIG Options
% 0.20/0.53
% 0.20/0.53 % --aig_mode false
% 0.20/0.53
% 0.20/0.53 % ------ Instantiation Options
% 0.20/0.53
% 0.20/0.53 % --instantiation_flag true
% 0.20/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.53 % --inst_solver_per_active 750
% 0.20/0.53 % --inst_solver_calls_frac 0.5
% 0.20/0.53 % --inst_passive_queue_type priority_queues
% 0.20/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.53 % --inst_passive_queues_freq [25;2]
% 0.20/0.53 % --inst_dismatching true
% 0.20/0.53 % --inst_eager_unprocessed_to_passive true
% 0.20/0.53 % --inst_prop_sim_given true
% 0.20/0.53 % --inst_prop_sim_new false
% 0.20/0.53 % --inst_orphan_elimination true
% 0.20/0.53 % --inst_learning_loop_flag true
% 0.20/0.53 % --inst_learning_start 3000
% 0.20/0.53 % --inst_learning_factor 2
% 0.20/0.53 % --inst_start_prop_sim_after_learn 3
% 0.20/0.53 % --inst_sel_renew solver
% 0.20/0.53 % --inst_lit_activity_flag true
% 0.20/0.53 % --inst_out_proof true
% 0.20/0.53
% 0.20/0.53 % ------ Resolution Options
% 0.20/0.53
% 0.20/0.53 % --resolution_flag true
% 0.20/0.53 % --res_lit_sel kbo_max
% 0.20/0.53 % --res_to_prop_solver none
% 0.20/0.53 % --res_prop_simpl_new false
% 0.20/0.53 % --res_prop_simpl_given false
% 0.20/0.53 % --res_passive_queue_type priority_queues
% 0.20/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.53 % --res_passive_queues_freq [15;5]
% 0.20/0.53 % --res_forward_subs full
% 0.20/0.53 % --res_backward_subs full
% 0.20/0.53 % --res_forward_subs_resolution true
% 0.20/0.53 % --res_backward_subs_resolution true
% 0.20/0.53 % --res_orphan_elimination false
% 0.20/0.53 % --res_time_limit 1000.
% 0.20/0.53 % --res_out_proof true
% 0.20/0.53 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a46417.s
% 0.20/0.53 % --modulo true
% 0.20/0.53
% 0.20/0.53 % ------ Combination Options
% 0.20/0.53
% 0.20/0.53 % --comb_res_mult 1000
% 0.20/0.53 % --comb_inst_mult 300
% 0.20/0.53 % ------
% 0.20/0.53
% 0.20/0.53 % ------ Parsing...% successful
% 0.20/0.53
% 0.20/0.53 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.53
% 0.20/0.53 % ------ Proving...
% 0.20/0.53 % ------ Problem Properties
% 0.20/0.53
% 0.20/0.53 %
% 0.20/0.53 % EPR false
% 0.20/0.53 % Horn false
% 0.20/0.53 % Has equality true
% 0.20/0.53
% 0.20/0.53 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 % % ------ Current options:
% 0.20/0.53
% 0.20/0.53 % ------ Input Options
% 0.20/0.53
% 0.20/0.53 % --out_options all
% 0.20/0.53 % --tptp_safe_out true
% 0.20/0.53 % --problem_path ""
% 0.20/0.53 % --include_path ""
% 0.20/0.53 % --clausifier .//eprover
% 0.20/0.53 % --clausifier_options --tstp-format
% 0.20/0.53 % --stdin false
% 0.20/0.53 % --dbg_backtrace false
% 0.20/0.53 % --dbg_dump_prop_clauses false
% 0.20/0.53 % --dbg_dump_prop_clauses_file -
% 0.20/0.53 % --dbg_out_stat false
% 0.20/0.53
% 0.20/0.53 % ------ General Options
% 0.20/0.53
% 0.20/0.53 % --fof false
% 0.20/0.53 % --time_out_real 150.
% 0.20/0.53 % --time_out_prep_mult 0.2
% 0.20/0.53 % --time_out_virtual -1.
% 0.20/0.53 % --schedule none
% 0.20/0.53 % --ground_splitting input
% 0.20/0.53 % --splitting_nvd 16
% 0.20/0.53 % --non_eq_to_eq false
% 0.20/0.53 % --prep_gs_sim true
% 0.20/0.53 % --prep_unflatten false
% 0.20/0.53 % --prep_res_sim true
% 0.20/0.53 % --prep_upred true
% 0.20/0.53 % --res_sim_input true
% 0.20/0.53 % --clause_weak_htbl true
% 0.20/0.53 % --gc_record_bc_elim false
% 0.20/0.53 % --symbol_type_check false
% 0.20/0.53 % --clausify_out false
% 0.20/0.53 % --large_theory_mode false
% 0.20/0.53 % --prep_sem_filter none
% 0.20/0.53 % --prep_sem_filter_out false
% 0.20/0.53 % --preprocessed_out false
% 0.20/0.53 % --sub_typing false
% 0.20/0.53 % --brand_transform false
% 0.20/0.53 % --pure_diseq_elim true
% 0.20/0.53 % --min_unsat_core false
% 0.20/0.53 % --pred_elim true
% 0.20/0.53 % --add_important_lit false
% 0.20/0.53 % --soft_assumptions false
% 0.20/0.53 % --reset_solvers false
% 0.20/0.53 % --bc_imp_inh []
% 0.20/0.53 % --conj_cone_tolerance 1.5
% 0.20/0.53 % --prolific_symb_bound 500
% 0.20/0.53 % --lt_threshold 2000
% 0.20/0.53
% 0.20/0.53 % ------ SAT Options
% 0.20/0.53
% 0.20/0.53 % --sat_mode false
% 0.20/0.53 % --sat_fm_restart_options ""
% 0.20/0.53 % --sat_gr_def false
% 0.20/0.53 % --sat_epr_types true
% 0.20/0.53 % --sat_non_cyclic_types false
% 0.20/0.53 % --sat_finite_models false
% 0.20/0.53 % --sat_fm_lemmas false
% 0.20/0.53 % --sat_fm_prep false
% 0.20/0.53 % --sat_fm_uc_incr true
% 0.20/0.53 % --sat_out_model small
% 0.20/0.53 % --sat_out_clauses false
% 0.20/0.53
% 0.20/0.53 % ------ QBF Options
% 0.20/0.53
% 0.20/0.53 % --qbf_mode false
% 0.20/0.53 % --qbf_elim_univ true
% 0.20/0.53 % --qbf_sk_in true
% 0.20/0.53 % --qbf_pred_elim true
% 0.20/0.53 % --qbf_split 32
% 0.20/0.53
% 0.20/0.53 % ------ BMC1 Options
% 0.20/0.53
% 0.20/0.53 % --bmc1_incremental false
% 0.20/0.53 % --bmc1_axioms reachable_all
% 0.20/0.53 % --bmc1_min_bound 0
% 0.20/0.53 % --bmc1_max_bound -1
% 0.20/0.53 % --bmc1_max_bound_default -1
% 0.20/0.53 % --bmc1_symbol_reachability true
% 0.20/0.53 % --bmc1_property_lemmas false
% 0.20/0.53 % --bmc1_k_induction false
% 0.20/0.53 % --bmc1_non_equiv_states false
% 0.20/0.53 % --bmc1_deadlock false
% 0.20/0.53 % --bmc1_ucm false
% 0.20/0.53 % --bmc1_add_unsat_core none
% 0.20/0.53 % --bmc1_unsat_core_children false
% 0.20/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.53 % --bmc1_out_stat full
% 0.20/0.53 % --bmc1_ground_init false
% 0.20/0.53 % --bmc1_pre_inst_next_state false
% 0.20/0.53 % --bmc1_pre_inst_state false
% 0.20/0.53 % --bmc1_pre_inst_reach_state false
% 0.20/0.53 % --bmc1_out_unsat_core false
% 0.20/0.53 % --bmc1_aig_witness_out false
% 0.20/0.53 % --bmc1_verbose false
% 0.20/0.53 % --bmc1_dump_clauses_tptp false
% 0.20/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.53 % --bmc1_dump_file -
% 0.20/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.53 % --bmc1_ucm_extend_mode 1
% 0.20/0.53 % --bmc1_ucm_init_mode 2
% 0.20/0.53 % --bmc1_ucm_cone_mode none
% 0.20/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.53 % --bmc1_ucm_relax_model 4
% 0.20/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.53 % --bmc1_ucm_layered_model none
% 0.20/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.53
% 0.20/0.53 % ------ AIG Options
% 0.20/0.53
% 0.20/0.53 % --aig_mode false
% 0.20/0.53
% 0.20/0.53 % ------ Instantiation Options
% 0.20/0.53
% 0.20/0.53 % --instantiation_flag true
% 0.20/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.53 % --inst_solver_per_active 750
% 0.20/0.53 % --inst_solver_calls_frac 0.5
% 0.20/0.53 % --inst_passive_queue_type priority_queues
% 0.20/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.53 % --inst_passive_queues_freq [25;2]
% 0.20/0.53 % --inst_dismatching true
% 0.20/0.53 % --inst_eager_unprocessed_to_passive true
% 0.20/0.53 % --inst_prop_sim_given true
% 6.00/6.17 % --inst_prop_sim_new false
% 6.00/6.17 % --inst_orphan_elimination true
% 6.00/6.17 % --inst_learning_loop_flag true
% 6.00/6.17 % --inst_learning_start 3000
% 6.00/6.17 % --inst_learning_factor 2
% 6.00/6.17 % --inst_start_prop_sim_after_learn 3
% 6.00/6.17 % --inst_sel_renew solver
% 6.00/6.17 % --inst_lit_activity_flag true
% 6.00/6.17 % --inst_out_proof true
% 6.00/6.17
% 6.00/6.17 % ------ Resolution Options
% 6.00/6.17
% 6.00/6.17 % --resolution_flag true
% 6.00/6.17 % --res_lit_sel kbo_max
% 6.00/6.17 % --res_to_prop_solver none
% 6.00/6.17 % --res_prop_simpl_new false
% 6.00/6.17 % --res_prop_simpl_given false
% 6.00/6.17 % --res_passive_queue_type priority_queues
% 6.00/6.17 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 6.00/6.17 % --res_passive_queues_freq [15;5]
% 6.00/6.17 % --res_forward_subs full
% 6.00/6.17 % --res_backward_subs full
% 6.00/6.17 % --res_forward_subs_resolution true
% 6.00/6.17 % --res_backward_subs_resolution true
% 6.00/6.17 % --res_orphan_elimination false
% 6.00/6.17 % --res_time_limit 1000.
% 6.00/6.17 % --res_out_proof true
% 6.00/6.17 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a46417.s
% 6.00/6.17 % --modulo true
% 6.00/6.17
% 6.00/6.17 % ------ Combination Options
% 6.00/6.17
% 6.00/6.17 % --comb_res_mult 1000
% 6.00/6.17 % --comb_inst_mult 300
% 6.00/6.17 % ------
% 6.00/6.17
% 6.00/6.17
% 6.00/6.17
% 6.00/6.17 % ------ Proving...
% 6.00/6.17 %
% 6.00/6.17
% 6.00/6.17
% 6.00/6.17 % ------ Statistics
% 6.00/6.17
% 6.00/6.17 % ------ General
% 6.00/6.17
% 6.00/6.17 % num_of_input_clauses: 43
% 6.00/6.17 % num_of_input_neg_conjectures: 3
% 6.00/6.17 % num_of_splits: 0
% 6.00/6.17 % num_of_split_atoms: 0
% 6.00/6.17 % num_of_sem_filtered_clauses: 0
% 6.00/6.17 % num_of_subtypes: 0
% 6.00/6.17 % monotx_restored_types: 0
% 6.00/6.17 % sat_num_of_epr_types: 0
% 6.00/6.17 % sat_num_of_non_cyclic_types: 0
% 6.00/6.17 % sat_guarded_non_collapsed_types: 0
% 6.00/6.17 % is_epr: 0
% 6.00/6.17 % is_horn: 0
% 6.00/6.17 % has_eq: 1
% 6.00/6.17 % num_pure_diseq_elim: 0
% 6.00/6.17 % simp_replaced_by: 0
% 6.00/6.17 % res_preprocessed: 6
% 6.00/6.17 % prep_upred: 0
% 6.00/6.17 % prep_unflattend: 0
% 6.00/6.17 % pred_elim_cands: 0
% 6.00/6.17 % pred_elim: 0
% 6.00/6.17 % pred_elim_cl: 0
% 6.00/6.17 % pred_elim_cycles: 0
% 6.00/6.17 % forced_gc_time: 0
% 6.00/6.17 % gc_basic_clause_elim: 0
% 6.00/6.17 % parsing_time: 0.002
% 6.00/6.17 % sem_filter_time: 0.
% 6.00/6.17 % pred_elim_time: 0.
% 6.00/6.17 % out_proof_time: 0.001
% 6.00/6.17 % monotx_time: 0.
% 6.00/6.17 % subtype_inf_time: 0.
% 6.00/6.17 % unif_index_cands_time: 0.018
% 6.00/6.17 % unif_index_add_time: 0.005
% 6.00/6.17 % total_time: 5.657
% 6.00/6.17 % num_of_symbols: 35
% 6.00/6.17 % num_of_terms: 30511
% 6.00/6.17
% 6.00/6.17 % ------ Propositional Solver
% 6.00/6.17
% 6.00/6.17 % prop_solver_calls: 17
% 6.00/6.17 % prop_fast_solver_calls: 21
% 6.00/6.17 % prop_num_of_clauses: 1322
% 6.00/6.17 % prop_preprocess_simplified: 1823
% 6.00/6.17 % prop_fo_subsumed: 0
% 6.00/6.17 % prop_solver_time: 0.
% 6.00/6.17 % prop_fast_solver_time: 0.
% 6.00/6.17 % prop_unsat_core_time: 0.
% 6.00/6.17
% 6.00/6.17 % ------ QBF
% 6.00/6.17
% 6.00/6.17 % qbf_q_res: 0
% 6.00/6.17 % qbf_num_tautologies: 0
% 6.00/6.17 % qbf_prep_cycles: 0
% 6.00/6.17
% 6.00/6.17 % ------ BMC1
% 6.00/6.17
% 6.00/6.17 % bmc1_current_bound: -1
% 6.00/6.17 % bmc1_last_solved_bound: -1
% 6.00/6.17 % bmc1_unsat_core_size: -1
% 6.00/6.17 % bmc1_unsat_core_parents_size: -1
% 6.00/6.17 % bmc1_merge_next_fun: 0
% 6.00/6.17 % bmc1_unsat_core_clauses_time: 0.
% 6.00/6.17
% 6.00/6.17 % ------ Instantiation
% 6.00/6.17
% 6.00/6.17 % inst_num_of_clauses: 844
% 6.00/6.17 % inst_num_in_passive: 224
% 6.00/6.17 % inst_num_in_active: 332
% 6.00/6.17 % inst_num_in_unprocessed: 284
% 6.00/6.17 % inst_num_of_loops: 605
% 6.00/6.17 % inst_num_of_learning_restarts: 0
% 6.00/6.17 % inst_num_moves_active_passive: 259
% 6.00/6.17 % inst_lit_activity: 315
% 6.00/6.17 % inst_lit_activity_moves: 0
% 6.00/6.17 % inst_num_tautologies: 4
% 6.00/6.17 % inst_num_prop_implied: 0
% 6.00/6.17 % inst_num_existing_simplified: 0
% 6.00/6.17 % inst_num_eq_res_simplified: 0
% 6.00/6.17 % inst_num_child_elim: 0
% 6.00/6.17 % inst_num_of_dismatching_blockings: 260
% 6.00/6.17 % inst_num_of_non_proper_insts: 934
% 6.00/6.17 % inst_num_of_duplicates: 1279
% 6.00/6.17 % inst_inst_num_from_inst_to_res: 0
% 6.00/6.17 % inst_dismatching_checking_time: 0.001
% 6.00/6.17
% 6.00/6.17 % ------ Resolution
% 6.00/6.17
% 6.00/6.17 % res_num_of_clauses: 66157
% 6.00/6.17 % res_num_in_passive: 67017
% 6.00/6.17 % res_num_in_active: 1109
% 6.00/6.17 % res_num_of_loops: 3000
% 6.00/6.17 % res_forward_subset_subsumed: 44617
% 6.00/6.17 % res_backward_subset_subsumed: 2260
% 6.00/6.17 % res_forward_subsumed: 1224
% 6.00/6.17 % res_backward_subsumed: 390
% 6.00/6.17 % res_forward_subsumption_resolution: 1203
% 6.00/6.17 % res_backward_subsumption_resolution: 9
% 6.00/6.17 % res_clause_to_clause_subsumption: 139784
% 6.00/6.17 % res_orphan_elimination: 0
% 6.00/6.17 % res_tautology_del: 10697
% 6.00/6.17 % res_num_eq_res_simplified: 375
% 6.00/6.17 % res_num_sel_changes: 0
% 6.00/6.17 % res_moves_from_active_to_pass: 0
% 6.00/6.17
% 6.00/6.17 % Status Unsatisfiable
% 6.00/6.17 % SZS status Theorem
% 6.00/6.17 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------