TSTP Solution File: SET813+4 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET813+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n011.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:16:27 EDT 2022
% Result : Theorem 196.92s 197.11s
% Output : CNFRefutation 196.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 24
% Syntax : Number of formulae : 448 ( 13 unt; 0 def)
% Number of atoms : 1433 ( 57 equ)
% Maximal formula atoms : 84 ( 3 avg)
% Number of connectives : 1520 ( 535 ~; 837 |; 92 &)
% ( 34 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 41 ( 41 usr; 5 con; 0-3 aty)
% Number of variables : 1124 ( 65 sgn 204 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X6,X4,X7] :
( least(X7,X6,X4)
<=> ( member(X7,X4)
& ! [X3] :
( member(X3,X4)
=> ( X7 = X3
| apply(X6,X7,X3) ) ) ) ),
file('<stdin>',least) ).
fof(c_0_1,axiom,
! [X6,X4] :
( strict_order(X6,X4)
<=> ( ! [X3,X5] :
( ( member(X3,X4)
& member(X5,X4) )
=> ~ ( apply(X6,X3,X5)
& apply(X6,X5,X3) ) )
& ! [X3,X5,X8] :
( ( member(X3,X4)
& member(X5,X4)
& member(X8,X4) )
=> ( ( apply(X6,X3,X5)
& apply(X6,X5,X8) )
=> apply(X6,X3,X8) ) ) ) ),
file('<stdin>',strict_order) ).
fof(c_0_2,axiom,
! [X3,X6,X1,X5] :
( member(X5,initial_segment(X3,X6,X1))
<=> ( member(X5,X1)
& apply(X6,X5,X3) ) ),
file('<stdin>',initial_segment) ).
fof(c_0_3,axiom,
! [X6,X4] :
( strict_well_order(X6,X4)
<=> ( strict_order(X6,X4)
& ! [X1] :
( ( subset(X1,X4)
& ? [X3] : member(X3,X1) )
=> ? [X5] : least(X5,X6,X1) ) ) ),
file('<stdin>',strict_well_order) ).
fof(c_0_4,axiom,
! [X1,X3] :
( member(X3,suc(X1))
<=> member(X3,union(X1,singleton(X1))) ),
file('<stdin>',successor) ).
fof(c_0_5,axiom,
! [X3,X5] :
( apply(member_predicate,X3,X5)
<=> member(X3,X5) ),
file('<stdin>',rel_member) ).
fof(c_0_6,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('<stdin>',union) ).
fof(c_0_7,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('<stdin>',difference) ).
fof(c_0_8,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('<stdin>',intersection) ).
fof(c_0_9,axiom,
! [X3,X1] :
( member(X3,product(X1))
<=> ! [X5] :
( member(X5,X1)
=> member(X3,X5) ) ),
file('<stdin>',product) ).
fof(c_0_10,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('<stdin>',subset) ).
fof(c_0_11,axiom,
! [X1] :
( member(X1,on)
<=> ( set(X1)
& strict_well_order(member_predicate,X1)
& ! [X3] :
( member(X3,X1)
=> subset(X3,X1) ) ) ),
file('<stdin>',ordinal_number) ).
fof(c_0_12,axiom,
! [X3,X1] :
( member(X3,sum(X1))
<=> ? [X5] :
( member(X5,X1)
& member(X3,X5) ) ),
file('<stdin>',sum) ).
fof(c_0_13,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
file('<stdin>',unordered_pair) ).
fof(c_0_14,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('<stdin>',equal_set) ).
fof(c_0_15,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('<stdin>',power_set) ).
fof(c_0_16,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('<stdin>',singleton) ).
fof(c_0_17,axiom,
! [X3] :
( set(X3)
=> ! [X5] :
( member(X5,X3)
=> set(X5) ) ),
file('<stdin>',set_member) ).
fof(c_0_18,axiom,
! [X3] : ~ member(X3,empty_set),
file('<stdin>',empty_set) ).
fof(c_0_19,axiom,
! [X6,X4,X7] :
( least(X7,X6,X4)
<=> ( member(X7,X4)
& ! [X3] :
( member(X3,X4)
=> ( X7 = X3
| apply(X6,X7,X3) ) ) ) ),
c_0_0 ).
fof(c_0_20,axiom,
! [X6,X4] :
( strict_order(X6,X4)
<=> ( ! [X3,X5] :
( ( member(X3,X4)
& member(X5,X4) )
=> ~ ( apply(X6,X3,X5)
& apply(X6,X5,X3) ) )
& ! [X3,X5,X8] :
( ( member(X3,X4)
& member(X5,X4)
& member(X8,X4) )
=> ( ( apply(X6,X3,X5)
& apply(X6,X5,X8) )
=> apply(X6,X3,X8) ) ) ) ),
c_0_1 ).
fof(c_0_21,axiom,
! [X3,X6,X1,X5] :
( member(X5,initial_segment(X3,X6,X1))
<=> ( member(X5,X1)
& apply(X6,X5,X3) ) ),
c_0_2 ).
fof(c_0_22,axiom,
! [X6,X4] :
( strict_well_order(X6,X4)
<=> ( strict_order(X6,X4)
& ! [X1] :
( ( subset(X1,X4)
& ? [X3] : member(X3,X1) )
=> ? [X5] : least(X5,X6,X1) ) ) ),
c_0_3 ).
fof(c_0_23,axiom,
! [X1,X3] :
( member(X3,suc(X1))
<=> member(X3,union(X1,singleton(X1))) ),
c_0_4 ).
fof(c_0_24,axiom,
! [X3,X5] :
( apply(member_predicate,X3,X5)
<=> member(X3,X5) ),
c_0_5 ).
fof(c_0_25,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
c_0_6 ).
fof(c_0_26,plain,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_27,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
c_0_8 ).
fof(c_0_28,axiom,
! [X3,X1] :
( member(X3,product(X1))
<=> ! [X5] :
( member(X5,X1)
=> member(X3,X5) ) ),
c_0_9 ).
fof(c_0_29,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_10 ).
fof(c_0_30,axiom,
! [X1] :
( member(X1,on)
<=> ( set(X1)
& strict_well_order(member_predicate,X1)
& ! [X3] :
( member(X3,X1)
=> subset(X3,X1) ) ) ),
c_0_11 ).
fof(c_0_31,axiom,
! [X3,X1] :
( member(X3,sum(X1))
<=> ? [X5] :
( member(X5,X1)
& member(X3,X5) ) ),
c_0_12 ).
fof(c_0_32,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
c_0_13 ).
fof(c_0_33,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
c_0_14 ).
fof(c_0_34,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
c_0_15 ).
fof(c_0_35,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
c_0_16 ).
fof(c_0_36,axiom,
! [X3] :
( set(X3)
=> ! [X5] :
( member(X5,X3)
=> set(X5) ) ),
c_0_17 ).
fof(c_0_37,plain,
! [X3] : ~ member(X3,empty_set),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_38,plain,
! [X8,X9,X10,X11,X12,X13,X14] :
( ( member(X10,X9)
| ~ least(X10,X8,X9) )
& ( ~ member(X11,X9)
| X10 = X11
| apply(X8,X10,X11)
| ~ least(X10,X8,X9) )
& ( member(esk8_3(X12,X13,X14),X13)
| ~ member(X14,X13)
| least(X14,X12,X13) )
& ( X14 != esk8_3(X12,X13,X14)
| ~ member(X14,X13)
| least(X14,X12,X13) )
& ( ~ apply(X12,X14,esk8_3(X12,X13,X14))
| ~ member(X14,X13)
| least(X14,X12,X13) ) ),
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_19])])])])])]) ).
fof(c_0_39,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16,X17] :
( ( ~ member(X11,X10)
| ~ member(X12,X10)
| ~ apply(X9,X11,X12)
| ~ apply(X9,X12,X11)
| ~ strict_order(X9,X10) )
& ( ~ member(X13,X10)
| ~ member(X14,X10)
| ~ member(X15,X10)
| ~ apply(X9,X13,X14)
| ~ apply(X9,X14,X15)
| apply(X9,X13,X15)
| ~ strict_order(X9,X10) )
& ( member(esk11_2(X16,X17),X17)
| member(esk9_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( member(esk12_2(X16,X17),X17)
| member(esk9_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( member(esk13_2(X16,X17),X17)
| member(esk9_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( apply(X16,esk11_2(X16,X17),esk12_2(X16,X17))
| member(esk9_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( apply(X16,esk12_2(X16,X17),esk13_2(X16,X17))
| member(esk9_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( ~ apply(X16,esk11_2(X16,X17),esk13_2(X16,X17))
| member(esk9_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( member(esk11_2(X16,X17),X17)
| member(esk10_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( member(esk12_2(X16,X17),X17)
| member(esk10_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( member(esk13_2(X16,X17),X17)
| member(esk10_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( apply(X16,esk11_2(X16,X17),esk12_2(X16,X17))
| member(esk10_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( apply(X16,esk12_2(X16,X17),esk13_2(X16,X17))
| member(esk10_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( ~ apply(X16,esk11_2(X16,X17),esk13_2(X16,X17))
| member(esk10_2(X16,X17),X17)
| strict_order(X16,X17) )
& ( member(esk11_2(X16,X17),X17)
| apply(X16,esk9_2(X16,X17),esk10_2(X16,X17))
| strict_order(X16,X17) )
& ( member(esk12_2(X16,X17),X17)
| apply(X16,esk9_2(X16,X17),esk10_2(X16,X17))
| strict_order(X16,X17) )
& ( member(esk13_2(X16,X17),X17)
| apply(X16,esk9_2(X16,X17),esk10_2(X16,X17))
| strict_order(X16,X17) )
& ( apply(X16,esk11_2(X16,X17),esk12_2(X16,X17))
| apply(X16,esk9_2(X16,X17),esk10_2(X16,X17))
| strict_order(X16,X17) )
& ( apply(X16,esk12_2(X16,X17),esk13_2(X16,X17))
| apply(X16,esk9_2(X16,X17),esk10_2(X16,X17))
| strict_order(X16,X17) )
& ( ~ apply(X16,esk11_2(X16,X17),esk13_2(X16,X17))
| apply(X16,esk9_2(X16,X17),esk10_2(X16,X17))
| strict_order(X16,X17) )
& ( member(esk11_2(X16,X17),X17)
| apply(X16,esk10_2(X16,X17),esk9_2(X16,X17))
| strict_order(X16,X17) )
& ( member(esk12_2(X16,X17),X17)
| apply(X16,esk10_2(X16,X17),esk9_2(X16,X17))
| strict_order(X16,X17) )
& ( member(esk13_2(X16,X17),X17)
| apply(X16,esk10_2(X16,X17),esk9_2(X16,X17))
| strict_order(X16,X17) )
& ( apply(X16,esk11_2(X16,X17),esk12_2(X16,X17))
| apply(X16,esk10_2(X16,X17),esk9_2(X16,X17))
| strict_order(X16,X17) )
& ( apply(X16,esk12_2(X16,X17),esk13_2(X16,X17))
| apply(X16,esk10_2(X16,X17),esk9_2(X16,X17))
| strict_order(X16,X17) )
& ( ~ apply(X16,esk11_2(X16,X17),esk13_2(X16,X17))
| apply(X16,esk10_2(X16,X17),esk9_2(X16,X17))
| strict_order(X16,X17) ) ),
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_20])])])])])]) ).
fof(c_0_40,plain,
! [X7,X8,X9,X10,X11,X12,X13,X14] :
( ( member(X10,X9)
| ~ member(X10,initial_segment(X7,X8,X9)) )
& ( apply(X8,X10,X7)
| ~ member(X10,initial_segment(X7,X8,X9)) )
& ( ~ member(X14,X13)
| ~ apply(X12,X14,X11)
| member(X14,initial_segment(X11,X12,X13)) ) ),
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_21])])])])]) ).
fof(c_0_41,plain,
! [X7,X8,X9,X10,X12,X13,X16] :
( ( strict_order(X7,X8)
| ~ strict_well_order(X7,X8) )
& ( ~ subset(X9,X8)
| ~ member(X10,X9)
| least(esk5_3(X7,X8,X9),X7,X9)
| ~ strict_well_order(X7,X8) )
& ( subset(esk6_2(X12,X13),X13)
| ~ strict_order(X12,X13)
| strict_well_order(X12,X13) )
& ( member(esk7_2(X12,X13),esk6_2(X12,X13))
| ~ strict_order(X12,X13)
| strict_well_order(X12,X13) )
& ( ~ least(X16,X12,esk6_2(X12,X13))
| ~ strict_order(X12,X13)
| strict_well_order(X12,X13) ) ),
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_22])])])])])]) ).
fof(c_0_42,plain,
! [X4,X5,X6,X7] :
( ( ~ member(X5,suc(X4))
| member(X5,union(X4,singleton(X4))) )
& ( ~ member(X7,union(X6,singleton(X6)))
| member(X7,suc(X6)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
fof(c_0_43,plain,
! [X6,X7,X8,X9] :
( ( ~ apply(member_predicate,X6,X7)
| member(X6,X7) )
& ( ~ member(X8,X9)
| apply(member_predicate,X8,X9) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
fof(c_0_44,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_25])])])])]) ).
fof(c_0_45,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_26])])])])]) ).
fof(c_0_46,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_27])])])])]) ).
fof(c_0_47,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_28])])])])])]) ).
fof(c_0_48,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_29])])])])])]) ).
fof(c_0_49,plain,
! [X4,X5,X6] :
( ( set(X4)
| ~ member(X4,on) )
& ( strict_well_order(member_predicate,X4)
| ~ member(X4,on) )
& ( ~ member(X5,X4)
| subset(X5,X4)
| ~ member(X4,on) )
& ( member(esk4_1(X6),X6)
| ~ strict_well_order(member_predicate,X6)
| ~ set(X6)
| member(X6,on) )
& ( ~ subset(esk4_1(X6),X6)
| ~ strict_well_order(member_predicate,X6)
| ~ set(X6)
| member(X6,on) ) ),
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_30])])])])])]) ).
fof(c_0_50,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_31])])])])])]) ).
fof(c_0_51,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_32])])])])]) ).
fof(c_0_52,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_33])])])])]) ).
fof(c_0_53,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_34])])])]) ).
fof(c_0_54,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_35])])])]) ).
fof(c_0_55,plain,
! [X6,X7] :
( ~ set(X6)
| ~ member(X7,X6)
| set(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])]) ).
fof(c_0_56,plain,
! [X4] : ~ member(X4,empty_set),
inference(variable_rename,[status(thm)],[c_0_37]) ).
cnf(c_0_57,plain,
( least(X1,X2,X3)
| ~ member(X1,X3)
| ~ apply(X2,X1,esk8_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_58,plain,
( apply(X1,X3,X4)
| ~ strict_order(X1,X2)
| ~ apply(X1,X5,X4)
| ~ apply(X1,X3,X5)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_59,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| ~ apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_60,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| ~ apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_61,plain,
( apply(X3,X1,X2)
| ~ member(X1,initial_segment(X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_62,plain,
( ~ strict_order(X1,X2)
| ~ apply(X1,X3,X4)
| ~ apply(X1,X4,X3)
| ~ member(X3,X2)
| ~ member(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_63,plain,
( member(X1,initial_segment(X2,X3,X4))
| ~ apply(X3,X1,X2)
| ~ member(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_64,plain,
( least(esk5_3(X1,X2,X3),X1,X3)
| ~ strict_well_order(X1,X2)
| ~ member(X4,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_65,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_66,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_67,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_68,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_69,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| ~ apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_70,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| ~ apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_71,plain,
( member(X1,X4)
| ~ member(X1,initial_segment(X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_72,plain,
( least(X1,X2,X3)
| member(esk8_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_73,plain,
( apply(X2,X1,X4)
| X1 = X4
| ~ least(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_74,plain,
( least(X1,X2,X3)
| ~ member(X1,X3)
| X1 != esk8_3(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_75,plain,
( strict_well_order(X1,X2)
| ~ strict_order(X1,X2)
| ~ least(X3,X1,esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_76,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_77,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_78,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_79,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_80,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| member(esk11_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_81,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| member(esk12_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_82,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| member(esk13_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_83,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| member(esk11_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_84,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| member(esk12_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_85,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| member(esk13_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_86,plain,
( strict_well_order(X1,X2)
| member(esk7_2(X1,X2),esk6_2(X1,X2))
| ~ strict_order(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_87,plain,
( member(X1,suc(X2))
| ~ member(X1,union(X2,singleton(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_88,plain,
( member(X1,X3)
| ~ least(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_89,plain,
( member(X1,X2)
| ~ apply(member_predicate,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_90,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| member(esk11_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_91,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| member(esk12_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_92,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| member(esk13_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_93,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| member(esk11_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_94,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| member(esk12_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_95,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| member(esk13_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_96,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_97,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_98,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_99,plain,
( member(X1,union(X2,singleton(X2)))
| ~ member(X1,suc(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_100,plain,
( member(X1,product(X2))
| ~ member(X1,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_101,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_102,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_103,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_104,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_105,plain,
( strict_well_order(X1,X2)
| subset(esk6_2(X1,X2),X2)
| ~ strict_order(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_106,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_107,plain,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_108,plain,
( member(X1,on)
| ~ set(X1)
| ~ strict_well_order(member_predicate,X1)
| ~ subset(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_109,plain,
( member(esk2_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_110,plain,
( member(X1,esk2_2(X1,X2))
| ~ member(X1,sum(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_111,plain,
( member(X1,X2)
| ~ member(X2,X3)
| ~ member(X1,product(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_112,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_113,plain,
( member(X1,sum(X2))
| ~ member(X1,X3)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_114,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_115,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_116,plain,
( member(X1,on)
| member(esk4_1(X1),X1)
| ~ set(X1)
| ~ strict_well_order(member_predicate,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_117,plain,
( member(X1,product(X2))
| member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_118,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_119,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_120,plain,
( subset(X2,X1)
| ~ member(X1,on)
| ~ member(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_121,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_122,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_123,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_124,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_125,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_126,plain,
( strict_order(X1,X2)
| ~ strict_well_order(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_127,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_128,plain,
( subset(X2,X1)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_129,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_130,plain,
( set(X1)
| ~ member(X1,X2)
| ~ set(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_131,plain,
( strict_well_order(member_predicate,X1)
| ~ member(X1,on) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_132,plain,
( set(X1)
| ~ member(X1,on) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_133,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_134,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_135,plain,
( least(X1,X2,X3)
| ~ member(X1,X3)
| ~ apply(X2,X1,esk8_3(X2,X3,X1)) ),
c_0_57,
[final] ).
cnf(c_0_136,plain,
( apply(X1,X3,X4)
| ~ strict_order(X1,X2)
| ~ apply(X1,X5,X4)
| ~ apply(X1,X3,X5)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X3,X2) ),
c_0_58,
[final] ).
cnf(c_0_137,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| ~ apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)) ),
c_0_59,
[final] ).
cnf(c_0_138,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| ~ apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)) ),
c_0_60,
[final] ).
cnf(c_0_139,plain,
( apply(X3,X1,X2)
| ~ member(X1,initial_segment(X2,X3,X4)) ),
c_0_61,
[final] ).
cnf(c_0_140,plain,
( ~ strict_order(X1,X2)
| ~ apply(X1,X3,X4)
| ~ apply(X1,X4,X3)
| ~ member(X3,X2)
| ~ member(X4,X2) ),
c_0_62,
[final] ).
cnf(c_0_141,plain,
( member(X1,initial_segment(X2,X3,X4))
| ~ apply(X3,X1,X2)
| ~ member(X1,X4) ),
c_0_63,
[final] ).
cnf(c_0_142,plain,
( least(esk5_3(X1,X2,X3),X1,X3)
| ~ strict_well_order(X1,X2)
| ~ member(X4,X3)
| ~ subset(X3,X2) ),
c_0_64,
[final] ).
cnf(c_0_143,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)) ),
c_0_65,
[final] ).
cnf(c_0_144,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)) ),
c_0_66,
[final] ).
cnf(c_0_145,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)) ),
c_0_67,
[final] ).
cnf(c_0_146,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)) ),
c_0_68,
[final] ).
cnf(c_0_147,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| ~ apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)) ),
c_0_69,
[final] ).
cnf(c_0_148,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| ~ apply(X1,esk11_2(X1,X2),esk13_2(X1,X2)) ),
c_0_70,
[final] ).
cnf(c_0_149,plain,
( member(X1,X4)
| ~ member(X1,initial_segment(X2,X3,X4)) ),
c_0_71,
[final] ).
cnf(c_0_150,plain,
( least(X1,X2,X3)
| member(esk8_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
c_0_72,
[final] ).
cnf(c_0_151,plain,
( apply(X2,X1,X4)
| X1 = X4
| ~ least(X1,X2,X3)
| ~ member(X4,X3) ),
c_0_73,
[final] ).
cnf(c_0_152,plain,
( least(X1,X2,X3)
| ~ member(X1,X3)
| esk8_3(X2,X3,X1) != X1 ),
c_0_74,
[final] ).
cnf(c_0_153,plain,
( strict_well_order(X1,X2)
| ~ strict_order(X1,X2)
| ~ least(X3,X1,esk6_2(X1,X2)) ),
c_0_75,
[final] ).
cnf(c_0_154,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)) ),
c_0_76,
[final] ).
cnf(c_0_155,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)) ),
c_0_77,
[final] ).
cnf(c_0_156,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| apply(X1,esk11_2(X1,X2),esk12_2(X1,X2)) ),
c_0_78,
[final] ).
cnf(c_0_157,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| apply(X1,esk12_2(X1,X2),esk13_2(X1,X2)) ),
c_0_79,
[final] ).
cnf(c_0_158,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| member(esk11_2(X1,X2),X2) ),
c_0_80,
[final] ).
cnf(c_0_159,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| member(esk12_2(X1,X2),X2) ),
c_0_81,
[final] ).
cnf(c_0_160,plain,
( strict_order(X1,X2)
| apply(X1,esk9_2(X1,X2),esk10_2(X1,X2))
| member(esk13_2(X1,X2),X2) ),
c_0_82,
[final] ).
cnf(c_0_161,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| member(esk11_2(X1,X2),X2) ),
c_0_83,
[final] ).
cnf(c_0_162,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| member(esk12_2(X1,X2),X2) ),
c_0_84,
[final] ).
cnf(c_0_163,plain,
( strict_order(X1,X2)
| apply(X1,esk10_2(X1,X2),esk9_2(X1,X2))
| member(esk13_2(X1,X2),X2) ),
c_0_85,
[final] ).
cnf(c_0_164,plain,
( strict_well_order(X1,X2)
| member(esk7_2(X1,X2),esk6_2(X1,X2))
| ~ strict_order(X1,X2) ),
c_0_86,
[final] ).
cnf(c_0_165,plain,
( member(X1,suc(X2))
| ~ member(X1,union(X2,singleton(X2))) ),
c_0_87,
[final] ).
cnf(c_0_166,plain,
( member(X1,X3)
| ~ least(X1,X2,X3) ),
c_0_88,
[final] ).
cnf(c_0_167,plain,
( member(X1,X2)
| ~ apply(member_predicate,X1,X2) ),
c_0_89,
[final] ).
cnf(c_0_168,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| member(esk11_2(X1,X2),X2) ),
c_0_90,
[final] ).
cnf(c_0_169,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| member(esk12_2(X1,X2),X2) ),
c_0_91,
[final] ).
cnf(c_0_170,plain,
( strict_order(X1,X2)
| member(esk9_2(X1,X2),X2)
| member(esk13_2(X1,X2),X2) ),
c_0_92,
[final] ).
cnf(c_0_171,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| member(esk11_2(X1,X2),X2) ),
c_0_93,
[final] ).
cnf(c_0_172,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| member(esk12_2(X1,X2),X2) ),
c_0_94,
[final] ).
cnf(c_0_173,plain,
( strict_order(X1,X2)
| member(esk10_2(X1,X2),X2)
| member(esk13_2(X1,X2),X2) ),
c_0_95,
[final] ).
cnf(c_0_174,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
c_0_96,
[final] ).
cnf(c_0_175,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
c_0_97,
[final] ).
cnf(c_0_176,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
c_0_98,
[final] ).
cnf(c_0_177,plain,
( member(X1,union(X2,singleton(X2)))
| ~ member(X1,suc(X2)) ),
c_0_99,
[final] ).
cnf(c_0_178,plain,
( member(X1,product(X2))
| ~ member(X1,esk3_2(X1,X2)) ),
c_0_100,
[final] ).
cnf(c_0_179,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
c_0_101,
[final] ).
cnf(c_0_180,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_102,
[final] ).
cnf(c_0_181,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_103,
[final] ).
cnf(c_0_182,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
c_0_104,
[final] ).
cnf(c_0_183,plain,
( strict_well_order(X1,X2)
| subset(esk6_2(X1,X2),X2)
| ~ strict_order(X1,X2) ),
c_0_105,
[final] ).
cnf(c_0_184,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
c_0_106,
[final] ).
cnf(c_0_185,plain,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
c_0_107,
[final] ).
cnf(c_0_186,plain,
( member(X1,on)
| ~ set(X1)
| ~ strict_well_order(member_predicate,X1)
| ~ subset(esk4_1(X1),X1) ),
c_0_108,
[final] ).
cnf(c_0_187,plain,
( member(esk2_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
c_0_109,
[final] ).
cnf(c_0_188,plain,
( member(X1,esk2_2(X1,X2))
| ~ member(X1,sum(X2)) ),
c_0_110,
[final] ).
cnf(c_0_189,plain,
( member(X1,X2)
| ~ member(X2,X3)
| ~ member(X1,product(X3)) ),
c_0_111,
[final] ).
cnf(c_0_190,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
c_0_112,
[final] ).
cnf(c_0_191,plain,
( member(X1,sum(X2))
| ~ member(X1,X3)
| ~ member(X3,X2) ),
c_0_113,
[final] ).
cnf(c_0_192,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
c_0_114,
[final] ).
cnf(c_0_193,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
c_0_115,
[final] ).
cnf(c_0_194,plain,
( member(X1,on)
| member(esk4_1(X1),X1)
| ~ set(X1)
| ~ strict_well_order(member_predicate,X1) ),
c_0_116,
[final] ).
cnf(c_0_195,plain,
( member(X1,product(X2))
| member(esk3_2(X1,X2),X2) ),
c_0_117,
[final] ).
cnf(c_0_196,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_118,
[final] ).
cnf(c_0_197,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
c_0_119,
[final] ).
cnf(c_0_198,plain,
( subset(X2,X1)
| ~ member(X1,on)
| ~ member(X2,X1) ),
c_0_120,
[final] ).
cnf(c_0_199,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
c_0_121,
[final] ).
cnf(c_0_200,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
c_0_122,
[final] ).
cnf(c_0_201,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
c_0_123,
[final] ).
cnf(c_0_202,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
c_0_124,
[final] ).
cnf(c_0_203,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
c_0_125,
[final] ).
cnf(c_0_204,plain,
( strict_order(X1,X2)
| ~ strict_well_order(X1,X2) ),
c_0_126,
[final] ).
cnf(c_0_205,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
c_0_127,
[final] ).
cnf(c_0_206,plain,
( subset(X2,X1)
| ~ equal_set(X1,X2) ),
c_0_128,
[final] ).
cnf(c_0_207,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
c_0_129,
[final] ).
cnf(c_0_208,plain,
( set(X1)
| ~ member(X1,X2)
| ~ set(X2) ),
c_0_130,
[final] ).
cnf(c_0_209,plain,
( strict_well_order(member_predicate,X1)
| ~ member(X1,on) ),
c_0_131,
[final] ).
cnf(c_0_210,plain,
( set(X1)
| ~ member(X1,on) ),
c_0_132,
[final] ).
cnf(c_0_211,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
c_0_133,
[final] ).
cnf(c_0_212,plain,
~ member(X1,empty_set),
c_0_134,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_135_0,axiom,
( least(X1,X2,X3)
| ~ member(X1,X3)
| ~ apply(X2,X1,sk1_esk8_3(X2,X3,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_135_1,axiom,
( ~ member(X1,X3)
| least(X1,X2,X3)
| ~ apply(X2,X1,sk1_esk8_3(X2,X3,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_135_2,axiom,
( ~ apply(X2,X1,sk1_esk8_3(X2,X3,X1))
| ~ member(X1,X3)
| least(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_136_0,axiom,
( apply(X1,X3,X4)
| ~ strict_order(X1,X2)
| ~ apply(X1,X5,X4)
| ~ apply(X1,X3,X5)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_1,axiom,
( ~ strict_order(X1,X2)
| apply(X1,X3,X4)
| ~ apply(X1,X5,X4)
| ~ apply(X1,X3,X5)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_2,axiom,
( ~ apply(X1,X5,X4)
| ~ strict_order(X1,X2)
| apply(X1,X3,X4)
| ~ apply(X1,X3,X5)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_3,axiom,
( ~ apply(X1,X3,X5)
| ~ apply(X1,X5,X4)
| ~ strict_order(X1,X2)
| apply(X1,X3,X4)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_4,axiom,
( ~ member(X4,X2)
| ~ apply(X1,X3,X5)
| ~ apply(X1,X5,X4)
| ~ strict_order(X1,X2)
| apply(X1,X3,X4)
| ~ member(X5,X2)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_5,axiom,
( ~ member(X5,X2)
| ~ member(X4,X2)
| ~ apply(X1,X3,X5)
| ~ apply(X1,X5,X4)
| ~ strict_order(X1,X2)
| apply(X1,X3,X4)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_6,axiom,
( ~ member(X3,X2)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ apply(X1,X3,X5)
| ~ apply(X1,X5,X4)
| ~ strict_order(X1,X2)
| apply(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_137_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_1,axiom,
( apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2)
| ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_2,axiom,
( ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2))
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_138_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_138_1,axiom,
( apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2)
| ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_138_2,axiom,
( ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2))
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_139_0,axiom,
( apply(X3,X1,X2)
| ~ member(X1,initial_segment(X2,X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_139_1,axiom,
( ~ member(X1,initial_segment(X2,X3,X4))
| apply(X3,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_140_0,axiom,
( ~ strict_order(X1,X2)
| ~ apply(X1,X3,X4)
| ~ apply(X1,X4,X3)
| ~ member(X3,X2)
| ~ member(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_140_1,axiom,
( ~ apply(X1,X3,X4)
| ~ strict_order(X1,X2)
| ~ apply(X1,X4,X3)
| ~ member(X3,X2)
| ~ member(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_140_2,axiom,
( ~ apply(X1,X4,X3)
| ~ apply(X1,X3,X4)
| ~ strict_order(X1,X2)
| ~ member(X3,X2)
| ~ member(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_140_3,axiom,
( ~ member(X3,X2)
| ~ apply(X1,X4,X3)
| ~ apply(X1,X3,X4)
| ~ strict_order(X1,X2)
| ~ member(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_140_4,axiom,
( ~ member(X4,X2)
| ~ member(X3,X2)
| ~ apply(X1,X4,X3)
| ~ apply(X1,X3,X4)
| ~ strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_141_0,axiom,
( member(X1,initial_segment(X2,X3,X4))
| ~ apply(X3,X1,X2)
| ~ member(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_141_1,axiom,
( ~ apply(X3,X1,X2)
| member(X1,initial_segment(X2,X3,X4))
| ~ member(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_141_2,axiom,
( ~ member(X1,X4)
| ~ apply(X3,X1,X2)
| member(X1,initial_segment(X2,X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_142_0,axiom,
( least(sk1_esk5_3(X1,X2,X3),X1,X3)
| ~ strict_well_order(X1,X2)
| ~ member(X4,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_1,axiom,
( ~ strict_well_order(X1,X2)
| least(sk1_esk5_3(X1,X2,X3),X1,X3)
| ~ member(X4,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_2,axiom,
( ~ member(X4,X3)
| ~ strict_well_order(X1,X2)
| least(sk1_esk5_3(X1,X2,X3),X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_3,axiom,
( ~ subset(X3,X2)
| ~ member(X4,X3)
| ~ strict_well_order(X1,X2)
| least(sk1_esk5_3(X1,X2,X3),X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_143_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_143_1,axiom,
( apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2)
| apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_143_2,axiom,
( apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2))
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_144_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_144_1,axiom,
( apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2)
| apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_144_2,axiom,
( apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2))
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_145_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_145]) ).
cnf(c_0_145_1,axiom,
( apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2)
| apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_145]) ).
cnf(c_0_145_2,axiom,
( apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2))
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_145]) ).
cnf(c_0_146_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_146]) ).
cnf(c_0_146_1,axiom,
( apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2)
| apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_146]) ).
cnf(c_0_146_2,axiom,
( apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2))
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_146]) ).
cnf(c_0_147_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk9_2(X1,X2),X2)
| ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_147]) ).
cnf(c_0_147_1,axiom,
( member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2)
| ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_147]) ).
cnf(c_0_147_2,axiom,
( ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2))
| member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_147]) ).
cnf(c_0_148_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk10_2(X1,X2),X2)
| ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_148_1,axiom,
( member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2)
| ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_148_2,axiom,
( ~ apply(X1,sk1_esk11_2(X1,X2),sk1_esk13_2(X1,X2))
| member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_149_0,axiom,
( member(X1,X4)
| ~ member(X1,initial_segment(X2,X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_149]) ).
cnf(c_0_149_1,axiom,
( ~ member(X1,initial_segment(X2,X3,X4))
| member(X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_149]) ).
cnf(c_0_150_0,axiom,
( least(X1,X2,X3)
| member(sk1_esk8_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_150]) ).
cnf(c_0_150_1,axiom,
( member(sk1_esk8_3(X2,X3,X1),X3)
| least(X1,X2,X3)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_150]) ).
cnf(c_0_150_2,axiom,
( ~ member(X1,X3)
| member(sk1_esk8_3(X2,X3,X1),X3)
| least(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_150]) ).
cnf(c_0_151_0,axiom,
( apply(X2,X1,X4)
| X1 = X4
| ~ least(X1,X2,X3)
| ~ member(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_151_1,axiom,
( X1 = X4
| apply(X2,X1,X4)
| ~ least(X1,X2,X3)
| ~ member(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_151_2,axiom,
( ~ least(X1,X2,X3)
| X1 = X4
| apply(X2,X1,X4)
| ~ member(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_151_3,axiom,
( ~ member(X4,X3)
| ~ least(X1,X2,X3)
| X1 = X4
| apply(X2,X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_152_0,axiom,
( least(X1,X2,X3)
| ~ member(X1,X3)
| sk1_esk8_3(X2,X3,X1) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_152_1,axiom,
( ~ member(X1,X3)
| least(X1,X2,X3)
| sk1_esk8_3(X2,X3,X1) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_152_2,axiom,
( sk1_esk8_3(X2,X3,X1) != X1
| ~ member(X1,X3)
| least(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_153_0,axiom,
( strict_well_order(X1,X2)
| ~ strict_order(X1,X2)
| ~ least(X3,X1,sk1_esk6_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_153_1,axiom,
( ~ strict_order(X1,X2)
| strict_well_order(X1,X2)
| ~ least(X3,X1,sk1_esk6_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_153_2,axiom,
( ~ least(X3,X1,sk1_esk6_2(X1,X2))
| ~ strict_order(X1,X2)
| strict_well_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_154_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk9_2(X1,X2),X2)
| apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_154]) ).
cnf(c_0_154_1,axiom,
( member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2)
| apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_154]) ).
cnf(c_0_154_2,axiom,
( apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2))
| member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_154]) ).
cnf(c_0_155_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk9_2(X1,X2),X2)
| apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_1,axiom,
( member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2)
| apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_2,axiom,
( apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2))
| member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_156_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk10_2(X1,X2),X2)
| apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_156_1,axiom,
( member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2)
| apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_156_2,axiom,
( apply(X1,sk1_esk11_2(X1,X2),sk1_esk12_2(X1,X2))
| member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_157_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk10_2(X1,X2),X2)
| apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_1,axiom,
( member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2)
| apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_2,axiom,
( apply(X1,sk1_esk12_2(X1,X2),sk1_esk13_2(X1,X2))
| member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_158_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| member(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_1,axiom,
( apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2)
| member(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_2,axiom,
( member(sk1_esk11_2(X1,X2),X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_159_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| member(sk1_esk12_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_159]) ).
cnf(c_0_159_1,axiom,
( apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2)
| member(sk1_esk12_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_159]) ).
cnf(c_0_159_2,axiom,
( member(sk1_esk12_2(X1,X2),X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_159]) ).
cnf(c_0_160_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| member(sk1_esk13_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_160_1,axiom,
( apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2)
| member(sk1_esk13_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_160_2,axiom,
( member(sk1_esk13_2(X1,X2),X2)
| apply(X1,sk1_esk9_2(X1,X2),sk1_esk10_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_161_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| member(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_161_1,axiom,
( apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2)
| member(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_161_2,axiom,
( member(sk1_esk11_2(X1,X2),X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_162_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| member(sk1_esk12_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_162_1,axiom,
( apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2)
| member(sk1_esk12_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_162_2,axiom,
( member(sk1_esk12_2(X1,X2),X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_163_0,axiom,
( strict_order(X1,X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| member(sk1_esk13_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_163_1,axiom,
( apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2)
| member(sk1_esk13_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_163_2,axiom,
( member(sk1_esk13_2(X1,X2),X2)
| apply(X1,sk1_esk10_2(X1,X2),sk1_esk9_2(X1,X2))
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_164_0,axiom,
( strict_well_order(X1,X2)
| member(sk1_esk7_2(X1,X2),sk1_esk6_2(X1,X2))
| ~ strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_164_1,axiom,
( member(sk1_esk7_2(X1,X2),sk1_esk6_2(X1,X2))
| strict_well_order(X1,X2)
| ~ strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_164_2,axiom,
( ~ strict_order(X1,X2)
| member(sk1_esk7_2(X1,X2),sk1_esk6_2(X1,X2))
| strict_well_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_165_0,axiom,
( member(X1,suc(X2))
| ~ member(X1,union(X2,singleton(X2))) ),
inference(literals_permutation,[status(thm)],[c_0_165]) ).
cnf(c_0_165_1,axiom,
( ~ member(X1,union(X2,singleton(X2)))
| member(X1,suc(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_165]) ).
cnf(c_0_166_0,axiom,
( member(X1,X3)
| ~ least(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_166]) ).
cnf(c_0_166_1,axiom,
( ~ least(X1,X2,X3)
| member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_166]) ).
cnf(c_0_167_0,axiom,
( member(X1,X2)
| ~ apply(member_predicate,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_167]) ).
cnf(c_0_167_1,axiom,
( ~ apply(member_predicate,X1,X2)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_167]) ).
cnf(c_0_168_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk9_2(X1,X2),X2)
| member(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_168_1,axiom,
( member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2)
| member(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_168_2,axiom,
( member(sk1_esk11_2(X1,X2),X2)
| member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_169_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk9_2(X1,X2),X2)
| member(sk1_esk12_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_169]) ).
cnf(c_0_169_1,axiom,
( member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2)
| member(sk1_esk12_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_169]) ).
cnf(c_0_169_2,axiom,
( member(sk1_esk12_2(X1,X2),X2)
| member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_169]) ).
cnf(c_0_170_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk9_2(X1,X2),X2)
| member(sk1_esk13_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_170]) ).
cnf(c_0_170_1,axiom,
( member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2)
| member(sk1_esk13_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_170]) ).
cnf(c_0_170_2,axiom,
( member(sk1_esk13_2(X1,X2),X2)
| member(sk1_esk9_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_170]) ).
cnf(c_0_171_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk10_2(X1,X2),X2)
| member(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_171]) ).
cnf(c_0_171_1,axiom,
( member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2)
| member(sk1_esk11_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_171]) ).
cnf(c_0_171_2,axiom,
( member(sk1_esk11_2(X1,X2),X2)
| member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_171]) ).
cnf(c_0_172_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk10_2(X1,X2),X2)
| member(sk1_esk12_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_172]) ).
cnf(c_0_172_1,axiom,
( member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2)
| member(sk1_esk12_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_172]) ).
cnf(c_0_172_2,axiom,
( member(sk1_esk12_2(X1,X2),X2)
| member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_172]) ).
cnf(c_0_173_0,axiom,
( strict_order(X1,X2)
| member(sk1_esk10_2(X1,X2),X2)
| member(sk1_esk13_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_173]) ).
cnf(c_0_173_1,axiom,
( member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2)
| member(sk1_esk13_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_173]) ).
cnf(c_0_173_2,axiom,
( member(sk1_esk13_2(X1,X2),X2)
| member(sk1_esk10_2(X1,X2),X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_173]) ).
cnf(c_0_174_0,axiom,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_174_1,axiom,
( member(X1,X3)
| member(X1,X2)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_174_2,axiom,
( ~ member(X1,union(X3,X2))
| member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_174]) ).
cnf(c_0_175_0,axiom,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_175]) ).
cnf(c_0_175_1,axiom,
( ~ member(X1,X3)
| ~ member(X1,difference(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_175]) ).
cnf(c_0_176_0,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_176]) ).
cnf(c_0_176_1,axiom,
( ~ member(X1,X3)
| member(X1,intersection(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_176]) ).
cnf(c_0_176_2,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_176]) ).
cnf(c_0_177_0,axiom,
( member(X1,union(X2,singleton(X2)))
| ~ member(X1,suc(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_177]) ).
cnf(c_0_177_1,axiom,
( ~ member(X1,suc(X2))
| member(X1,union(X2,singleton(X2))) ),
inference(literals_permutation,[status(thm)],[c_0_177]) ).
cnf(c_0_178_0,axiom,
( member(X1,product(X2))
| ~ member(X1,sk1_esk3_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_178]) ).
cnf(c_0_178_1,axiom,
( ~ member(X1,sk1_esk3_2(X1,X2))
| member(X1,product(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_178]) ).
cnf(c_0_179_0,axiom,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_179]) ).
cnf(c_0_179_1,axiom,
( ~ member(X1,difference(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_179]) ).
cnf(c_0_180_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_180]) ).
cnf(c_0_180_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_180]) ).
cnf(c_0_181_0,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_181]) ).
cnf(c_0_181_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_181]) ).
cnf(c_0_182_0,axiom,
( subset(X1,X2)
| ~ member(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_182]) ).
cnf(c_0_182_1,axiom,
( ~ member(sk1_esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_182]) ).
cnf(c_0_183_0,axiom,
( strict_well_order(X1,X2)
| subset(sk1_esk6_2(X1,X2),X2)
| ~ strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_183]) ).
cnf(c_0_183_1,axiom,
( subset(sk1_esk6_2(X1,X2),X2)
| strict_well_order(X1,X2)
| ~ strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_183]) ).
cnf(c_0_183_2,axiom,
( ~ strict_order(X1,X2)
| subset(sk1_esk6_2(X1,X2),X2)
| strict_well_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_183]) ).
cnf(c_0_184_0,axiom,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_184]) ).
cnf(c_0_184_1,axiom,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_184]) ).
cnf(c_0_184_2,axiom,
( ~ member(X1,X2)
| member(X1,X3)
| member(X1,difference(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_184]) ).
cnf(c_0_185_0,axiom,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_185_1,axiom,
( ~ member(X1,X2)
| apply(member_predicate,X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_185]) ).
cnf(c_0_186_0,axiom,
( member(X1,on)
| ~ set(X1)
| ~ strict_well_order(member_predicate,X1)
| ~ subset(sk1_esk4_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_186_1,axiom,
( ~ set(X1)
| member(X1,on)
| ~ strict_well_order(member_predicate,X1)
| ~ subset(sk1_esk4_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_186_2,axiom,
( ~ strict_well_order(member_predicate,X1)
| ~ set(X1)
| member(X1,on)
| ~ subset(sk1_esk4_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_186_3,axiom,
( ~ subset(sk1_esk4_1(X1),X1)
| ~ strict_well_order(member_predicate,X1)
| ~ set(X1)
| member(X1,on) ),
inference(literals_permutation,[status(thm)],[c_0_186]) ).
cnf(c_0_187_0,axiom,
( member(sk1_esk2_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_187]) ).
cnf(c_0_187_1,axiom,
( ~ member(X1,sum(X2))
| member(sk1_esk2_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_187]) ).
cnf(c_0_188_0,axiom,
( member(X1,sk1_esk2_2(X1,X2))
| ~ member(X1,sum(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_188]) ).
cnf(c_0_188_1,axiom,
( ~ member(X1,sum(X2))
| member(X1,sk1_esk2_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_188]) ).
cnf(c_0_189_0,axiom,
( member(X1,X2)
| ~ member(X2,X3)
| ~ member(X1,product(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_189]) ).
cnf(c_0_189_1,axiom,
( ~ member(X2,X3)
| member(X1,X2)
| ~ member(X1,product(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_189]) ).
cnf(c_0_189_2,axiom,
( ~ member(X1,product(X3))
| ~ member(X2,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_189]) ).
cnf(c_0_190_0,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_190]) ).
cnf(c_0_190_1,axiom,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_190]) ).
cnf(c_0_190_2,axiom,
( ~ member(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_190]) ).
cnf(c_0_191_0,axiom,
( member(X1,sum(X2))
| ~ member(X1,X3)
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_191]) ).
cnf(c_0_191_1,axiom,
( ~ member(X1,X3)
| member(X1,sum(X2))
| ~ member(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_191]) ).
cnf(c_0_191_2,axiom,
( ~ member(X3,X2)
| ~ member(X1,X3)
| member(X1,sum(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_191]) ).
cnf(c_0_192_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_192]) ).
cnf(c_0_192_1,axiom,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_192]) ).
cnf(c_0_193_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_193]) ).
cnf(c_0_193_1,axiom,
( ~ member(X1,X3)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_193]) ).
cnf(c_0_194_0,axiom,
( member(X1,on)
| member(sk1_esk4_1(X1),X1)
| ~ set(X1)
| ~ strict_well_order(member_predicate,X1) ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_194_1,axiom,
( member(sk1_esk4_1(X1),X1)
| member(X1,on)
| ~ set(X1)
| ~ strict_well_order(member_predicate,X1) ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_194_2,axiom,
( ~ set(X1)
| member(sk1_esk4_1(X1),X1)
| member(X1,on)
| ~ strict_well_order(member_predicate,X1) ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_194_3,axiom,
( ~ strict_well_order(member_predicate,X1)
| ~ set(X1)
| member(sk1_esk4_1(X1),X1)
| member(X1,on) ),
inference(literals_permutation,[status(thm)],[c_0_194]) ).
cnf(c_0_195_0,axiom,
( member(X1,product(X2))
| member(sk1_esk3_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_195]) ).
cnf(c_0_195_1,axiom,
( member(sk1_esk3_2(X1,X2),X2)
| member(X1,product(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_195]) ).
cnf(c_0_196_0,axiom,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_196]) ).
cnf(c_0_196_1,axiom,
( ~ subset(X2,X1)
| equal_set(X1,X2)
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_196]) ).
cnf(c_0_196_2,axiom,
( ~ subset(X1,X2)
| ~ subset(X2,X1)
| equal_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_196]) ).
cnf(c_0_197_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_197]) ).
cnf(c_0_197_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_197]) ).
cnf(c_0_197_2,axiom,
( ~ subset(X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_197]) ).
cnf(c_0_198_0,axiom,
( subset(X2,X1)
| ~ member(X1,on)
| ~ member(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_198]) ).
cnf(c_0_198_1,axiom,
( ~ member(X1,on)
| subset(X2,X1)
| ~ member(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_198]) ).
cnf(c_0_198_2,axiom,
( ~ member(X2,X1)
| ~ member(X1,on)
| subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_198]) ).
cnf(c_0_199_0,axiom,
( subset(X1,X2)
| member(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_199_1,axiom,
( member(sk1_esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_199]) ).
cnf(c_0_200_0,axiom,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_200_1,axiom,
( ~ member(X1,power_set(X2))
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_200]) ).
cnf(c_0_201_0,axiom,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_201]) ).
cnf(c_0_201_1,axiom,
( X1 != X2
| member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_201]) ).
cnf(c_0_202_0,axiom,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_202]) ).
cnf(c_0_202_1,axiom,
( X1 != X3
| member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_202]) ).
cnf(c_0_203_0,axiom,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_203]) ).
cnf(c_0_203_1,axiom,
( ~ subset(X1,X2)
| member(X1,power_set(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_203]) ).
cnf(c_0_204_0,axiom,
( strict_order(X1,X2)
| ~ strict_well_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_204]) ).
cnf(c_0_204_1,axiom,
( ~ strict_well_order(X1,X2)
| strict_order(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_204]) ).
cnf(c_0_205_0,axiom,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_205]) ).
cnf(c_0_205_1,axiom,
( ~ equal_set(X1,X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_205]) ).
cnf(c_0_206_0,axiom,
( subset(X2,X1)
| ~ equal_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_206]) ).
cnf(c_0_206_1,axiom,
( ~ equal_set(X1,X2)
| subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_206]) ).
cnf(c_0_207_0,axiom,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_207_1,axiom,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_207]) ).
cnf(c_0_208_0,axiom,
( set(X1)
| ~ member(X1,X2)
| ~ set(X2) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_208_1,axiom,
( ~ member(X1,X2)
| set(X1)
| ~ set(X2) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_208_2,axiom,
( ~ set(X2)
| ~ member(X1,X2)
| set(X1) ),
inference(literals_permutation,[status(thm)],[c_0_208]) ).
cnf(c_0_209_0,axiom,
( strict_well_order(member_predicate,X1)
| ~ member(X1,on) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_209_1,axiom,
( ~ member(X1,on)
| strict_well_order(member_predicate,X1) ),
inference(literals_permutation,[status(thm)],[c_0_209]) ).
cnf(c_0_210_0,axiom,
( set(X1)
| ~ member(X1,on) ),
inference(literals_permutation,[status(thm)],[c_0_210]) ).
cnf(c_0_210_1,axiom,
( ~ member(X1,on)
| set(X1) ),
inference(literals_permutation,[status(thm)],[c_0_210]) ).
cnf(c_0_211_0,axiom,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_211]) ).
cnf(c_0_211_1,axiom,
( X1 != X2
| member(X1,singleton(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_211]) ).
cnf(c_0_212_0,axiom,
~ member(X1,empty_set),
inference(literals_permutation,[status(thm)],[c_0_212]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1] :
( member(X1,on)
=> member(X1,suc(X1)) ),
file('<stdin>',thV12) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1] :
( member(X1,on)
=> member(X1,suc(X1)) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( member(esk1_0,on)
& ~ member(esk1_0,suc(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,
~ member(esk1_0,suc(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
member(esk1_0,on),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
~ member(esk1_0,suc(esk1_0)),
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
member(esk1_0,on),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_2,plain,
( X0 != X1
| member(X0,singleton(X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dc0b5c.p',c_0_211_0) ).
cnf(c_299,plain,
( X0 != X1
| member(X0,singleton(X1)) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_48511,plain,
( member(sk2_esk1_0,singleton(X0))
| sk2_esk1_0 != X0 ),
inference(instantiation,[status(thm)],[c_299]) ).
cnf(c_860801,plain,
( member(sk2_esk1_0,singleton(sk2_esk1_0))
| sk2_esk1_0 != sk2_esk1_0 ),
inference(instantiation,[status(thm)],[c_48511]) ).
cnf(c_1580206,plain,
member(sk2_esk1_0,singleton(sk2_esk1_0)),
inference(equality_resolution_simp,[status(esa)],[c_860801]) ).
cnf(c_44,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dc0b5c.p',c_0_193_0) ).
cnf(c_341,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_46861,plain,
( member(sk2_esk1_0,union(X0,X1))
| ~ member(sk2_esk1_0,X1) ),
inference(instantiation,[status(thm)],[c_341]) ).
cnf(c_136570,plain,
( ~ member(sk2_esk1_0,singleton(X0))
| member(sk2_esk1_0,union(X0,singleton(X0))) ),
inference(instantiation,[status(thm)],[c_46861]) ).
cnf(c_403644,plain,
( ~ member(sk2_esk1_0,singleton(sk2_esk1_0))
| member(sk2_esk1_0,union(sk2_esk1_0,singleton(sk2_esk1_0))) ),
inference(instantiation,[status(thm)],[c_136570]) ).
cnf(c_115,plain,
( ~ member(X0,union(X1,singleton(X1)))
| member(X0,suc(X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dc0b5c.p',c_0_165_0) ).
cnf(c_412,plain,
( ~ member(X0,union(X1,singleton(X1)))
| member(X0,suc(X1)) ),
inference(copy,[status(esa)],[c_115]) ).
cnf(c_136563,plain,
( ~ member(sk2_esk1_0,union(X0,singleton(X0)))
| member(sk2_esk1_0,suc(X0)) ),
inference(instantiation,[status(thm)],[c_412]) ).
cnf(c_402366,plain,
( ~ member(sk2_esk1_0,union(sk2_esk1_0,singleton(sk2_esk1_0)))
| member(sk2_esk1_0,suc(sk2_esk1_0)) ),
inference(instantiation,[status(thm)],[c_136563]) ).
cnf(c_212,negated_conjecture,
~ member(sk2_esk1_0,suc(sk2_esk1_0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dc0b5c.p',c_0_5) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_1580206,c_403644,c_402366,c_212]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET813+4 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 16:30:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.13/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.41 % FOF problem with conjecture
% 0.13/0.41 % 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_13786e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_dc0b5c.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_75f3b2 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --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_13786e.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
% 150.22/150.43 % --inst_prop_sim_new false
% 150.22/150.43 % --inst_orphan_elimination true
% 150.22/150.43 % --inst_learning_loop_flag true
% 150.22/150.43 % --inst_learning_start 3000
% 150.22/150.43 % --inst_learning_factor 2
% 150.22/150.43 % --inst_start_prop_sim_after_learn 3
% 150.22/150.43 % --inst_sel_renew solver
% 150.22/150.43 % --inst_lit_activity_flag true
% 150.22/150.43 % --inst_out_proof true
% 150.22/150.43
% 150.22/150.43 % ------ Resolution Options
% 150.22/150.43
% 150.22/150.43 % --resolution_flag true
% 150.22/150.43 % --res_lit_sel kbo_max
% 150.22/150.43 % --res_to_prop_solver none
% 150.22/150.43 % --res_prop_simpl_new false
% 150.22/150.43 % --res_prop_simpl_given false
% 150.22/150.43 % --res_passive_queue_type priority_queues
% 150.22/150.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.22/150.43 % --res_passive_queues_freq [15;5]
% 150.22/150.43 % --res_forward_subs full
% 150.22/150.43 % --res_backward_subs full
% 150.22/150.43 % --res_forward_subs_resolution true
% 150.22/150.43 % --res_backward_subs_resolution true
% 150.22/150.43 % --res_orphan_elimination false
% 150.22/150.43 % --res_time_limit 1000.
% 150.22/150.43 % --res_out_proof true
% 150.22/150.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_13786e.s
% 150.22/150.43 % --modulo true
% 150.22/150.43
% 150.22/150.43 % ------ Combination Options
% 150.22/150.43
% 150.22/150.43 % --comb_res_mult 1000
% 150.22/150.43 % --comb_inst_mult 300
% 150.22/150.43 % ------
% 150.22/150.43
% 150.22/150.43
% 150.22/150.43
% 150.22/150.43 % ------ Proving...
% 150.22/150.43 %
% 150.22/150.43
% 150.22/150.43
% 150.22/150.43 % Time Out Real
% 150.22/150.43
% 150.22/150.43 % ------ Statistics
% 150.22/150.43
% 150.22/150.43 % ------ General
% 150.22/150.43
% 150.22/150.43 % num_of_input_clauses: 80
% 150.22/150.43 % num_of_input_neg_conjectures: 2
% 150.22/150.43 % num_of_splits: 0
% 150.22/150.43 % num_of_split_atoms: 0
% 150.22/150.43 % num_of_sem_filtered_clauses: 0
% 150.22/150.43 % num_of_subtypes: 0
% 150.22/150.43 % monotx_restored_types: 0
% 150.22/150.43 % sat_num_of_epr_types: 0
% 150.22/150.43 % sat_num_of_non_cyclic_types: 0
% 150.22/150.43 % sat_guarded_non_collapsed_types: 0
% 150.22/150.43 % is_epr: 0
% 150.22/150.43 % is_horn: 0
% 150.22/150.43 % has_eq: 1
% 150.22/150.43 % num_pure_diseq_elim: 0
% 150.22/150.43 % simp_replaced_by: 0
% 150.22/150.43 % res_preprocessed: 4
% 150.22/150.43 % prep_upred: 0
% 150.22/150.43 % prep_unflattend: 0
% 150.22/150.43 % pred_elim_cands: 0
% 150.22/150.43 % pred_elim: 0
% 150.22/150.43 % pred_elim_cl: 0
% 150.22/150.43 % pred_elim_cycles: 0
% 150.22/150.43 % forced_gc_time: 0
% 150.22/150.43 % gc_basic_clause_elim: 0
% 150.22/150.43 % parsing_time: 0.004
% 150.22/150.43 % sem_filter_time: 0.
% 150.22/150.43 % pred_elim_time: 0.
% 150.22/150.43 % out_proof_time: 0.
% 150.22/150.43 % monotx_time: 0.
% 150.22/150.43 % subtype_inf_time: 0.
% 150.22/150.43 % unif_index_cands_time: 0.26
% 150.22/150.43 % unif_index_add_time: 0.022
% 150.22/150.43 % total_time: 150.017
% 150.22/150.43 % num_of_symbols: 60
% 150.22/150.43 % num_of_terms: 1077724
% 150.22/150.43
% 150.22/150.43 % ------ Propositional Solver
% 150.22/150.43
% 150.22/150.43 % prop_solver_calls: 15
% 150.22/150.43 % prop_fast_solver_calls: 6
% 150.22/150.43 % prop_num_of_clauses: 9103
% 150.22/150.43 % prop_preprocess_simplified: 10927
% 150.22/150.43 % prop_fo_subsumed: 0
% 150.22/150.43 % prop_solver_time: 0.002
% 150.22/150.43 % prop_fast_solver_time: 0.
% 150.22/150.43 % prop_unsat_core_time: 0.
% 150.22/150.43
% 150.22/150.43 % ------ QBF
% 150.22/150.43
% 150.22/150.43 % qbf_q_res: 0
% 150.22/150.43 % qbf_num_tautologies: 0
% 150.22/150.43 % qbf_prep_cycles: 0
% 150.22/150.43
% 150.22/150.43 % ------ BMC1
% 150.22/150.43
% 150.22/150.43 % bmc1_current_bound: -1
% 150.22/150.43 % bmc1_last_solved_bound: -1
% 150.22/150.43 % bmc1_unsat_core_size: -1
% 150.22/150.43 % bmc1_unsat_core_parents_size: -1
% 150.22/150.43 % bmc1_merge_next_fun: 0
% 150.22/150.43 % bmc1_unsat_core_clauses_time: 0.
% 150.22/150.43
% 150.22/150.43 % ------ Instantiation
% 150.22/150.43
% 150.22/150.43 % inst_num_of_clauses: 5948
% 150.22/150.43 % inst_num_in_passive: 4058
% 150.22/150.43 % inst_num_in_active: 1553
% 150.22/150.43 % inst_num_in_unprocessed: 326
% 150.22/150.43 % inst_num_of_loops: 2100
% 150.22/150.44 % inst_num_of_learning_restarts: 0
% 150.22/150.44 % inst_num_moves_active_passive: 535
% 150.22/150.44 % inst_lit_activity: 610
% 150.22/150.44 % inst_lit_activity_moves: 1
% 150.22/150.44 % inst_num_tautologies: 11
% 150.22/150.44 % inst_num_prop_implied: 0
% 150.22/150.44 % inst_num_existing_simplified: 0
% 150.22/150.44 % inst_num_eq_res_simplified: 0
% 150.22/150.44 % inst_num_child_elim: 0
% 150.22/150.44 % inst_num_of_dismatching_blockings: 13406
% 150.22/150.44 % inst_num_of_non_proper_insts: 10497
% 150.22/150.44 % inst_num_of_duplicates: 2679
% 150.22/150.44 % inst_inst_num_from_inst_to_res: 0
% 150.22/150.44 % inst_dismatching_checking_time: 0.062
% 150.22/150.44
% 150.22/150.44 % ------ Resolution
% 150.22/150.44
% 150.22/150.44 % res_num_of_clauses: 650512
% 150.22/150.44 % res_num_in_passive: 647486
% 150.22/150.44 % res_num_in_active: 2998
% 150.22/150.44 % res_num_of_loops: 7667
% 150.22/150.44 % res_forward_subset_subsumed: 104931
% 150.22/150.44 % res_backward_subset_subsumed: 40
% 150.22/150.44 % res_forward_subsumed: 4742
% 150.22/150.44 % res_backward_subsumed: 2
% 150.22/150.44 % res_forward_subsumption_resolution: 123
% 150.22/150.44 % res_backward_subsumption_resolution: 0
% 150.22/150.44 % res_clause_to_clause_subsumption: 503908
% 150.22/150.44 % res_orphan_elimination: 0
% 150.22/150.44 % res_tautology_del: 21
% 150.22/150.44 % res_num_eq_res_simplified: 0
% 150.22/150.44 % res_num_sel_changes: 0
% 150.22/150.44 % res_moves_from_active_to_pass: 0
% 150.22/150.44
% 150.22/150.44 % Status Unknown
% 150.22/150.49 % Orienting using strategy ClausalAll
% 150.22/150.49 % FOF problem with conjecture
% 150.22/150.49 % 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_13786e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_dc0b5c.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_4d86be | grep -v "SZS"
% 150.33/150.51
% 150.33/150.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.33/150.51
% 150.33/150.51 %
% 150.33/150.51 % ------ iProver source info
% 150.33/150.51
% 150.33/150.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.33/150.51 % git: non_committed_changes: true
% 150.33/150.51 % git: last_make_outside_of_git: true
% 150.33/150.51
% 150.33/150.51 %
% 150.33/150.51 % ------ Input Options
% 150.33/150.51
% 150.33/150.51 % --out_options all
% 150.33/150.51 % --tptp_safe_out true
% 150.33/150.51 % --problem_path ""
% 150.33/150.51 % --include_path ""
% 150.33/150.51 % --clausifier .//eprover
% 150.33/150.51 % --clausifier_options --tstp-format
% 150.33/150.51 % --stdin false
% 150.33/150.51 % --dbg_backtrace false
% 150.33/150.51 % --dbg_dump_prop_clauses false
% 150.33/150.51 % --dbg_dump_prop_clauses_file -
% 150.33/150.51 % --dbg_out_stat false
% 150.33/150.51
% 150.33/150.51 % ------ General Options
% 150.33/150.51
% 150.33/150.51 % --fof false
% 150.33/150.51 % --time_out_real 150.
% 150.33/150.51 % --time_out_prep_mult 0.2
% 150.33/150.51 % --time_out_virtual -1.
% 150.33/150.51 % --schedule none
% 150.33/150.51 % --ground_splitting input
% 150.33/150.51 % --splitting_nvd 16
% 150.33/150.51 % --non_eq_to_eq false
% 150.33/150.51 % --prep_gs_sim true
% 150.33/150.51 % --prep_unflatten false
% 150.33/150.51 % --prep_res_sim true
% 150.33/150.51 % --prep_upred true
% 150.33/150.51 % --res_sim_input true
% 150.33/150.51 % --clause_weak_htbl true
% 150.33/150.51 % --gc_record_bc_elim false
% 150.33/150.51 % --symbol_type_check false
% 150.33/150.51 % --clausify_out false
% 150.33/150.51 % --large_theory_mode false
% 150.33/150.51 % --prep_sem_filter none
% 150.33/150.51 % --prep_sem_filter_out false
% 150.33/150.51 % --preprocessed_out false
% 150.33/150.51 % --sub_typing false
% 150.33/150.51 % --brand_transform false
% 150.33/150.51 % --pure_diseq_elim true
% 150.33/150.51 % --min_unsat_core false
% 150.33/150.51 % --pred_elim true
% 150.33/150.51 % --add_important_lit false
% 150.33/150.51 % --soft_assumptions false
% 150.33/150.51 % --reset_solvers false
% 150.33/150.51 % --bc_imp_inh []
% 150.33/150.51 % --conj_cone_tolerance 1.5
% 150.33/150.51 % --prolific_symb_bound 500
% 150.33/150.51 % --lt_threshold 2000
% 150.33/150.51
% 150.33/150.51 % ------ SAT Options
% 150.33/150.51
% 150.33/150.51 % --sat_mode false
% 150.33/150.51 % --sat_fm_restart_options ""
% 150.33/150.51 % --sat_gr_def false
% 150.33/150.51 % --sat_epr_types true
% 150.33/150.51 % --sat_non_cyclic_types false
% 150.33/150.51 % --sat_finite_models false
% 150.33/150.51 % --sat_fm_lemmas false
% 150.33/150.51 % --sat_fm_prep false
% 150.33/150.51 % --sat_fm_uc_incr true
% 150.33/150.51 % --sat_out_model small
% 150.33/150.51 % --sat_out_clauses false
% 150.33/150.51
% 150.33/150.51 % ------ QBF Options
% 150.33/150.51
% 150.33/150.51 % --qbf_mode false
% 150.33/150.51 % --qbf_elim_univ true
% 150.33/150.51 % --qbf_sk_in true
% 150.33/150.51 % --qbf_pred_elim true
% 150.33/150.51 % --qbf_split 32
% 150.33/150.51
% 150.33/150.51 % ------ BMC1 Options
% 150.33/150.51
% 150.33/150.51 % --bmc1_incremental false
% 150.33/150.51 % --bmc1_axioms reachable_all
% 150.33/150.51 % --bmc1_min_bound 0
% 150.33/150.51 % --bmc1_max_bound -1
% 150.33/150.51 % --bmc1_max_bound_default -1
% 150.33/150.51 % --bmc1_symbol_reachability true
% 150.33/150.51 % --bmc1_property_lemmas false
% 150.33/150.51 % --bmc1_k_induction false
% 150.33/150.51 % --bmc1_non_equiv_states false
% 150.33/150.51 % --bmc1_deadlock false
% 150.33/150.51 % --bmc1_ucm false
% 150.33/150.51 % --bmc1_add_unsat_core none
% 150.33/150.51 % --bmc1_unsat_core_children false
% 150.33/150.51 % --bmc1_unsat_core_extrapolate_axioms false
% 150.33/150.51 % --bmc1_out_stat full
% 150.33/150.51 % --bmc1_ground_init false
% 150.33/150.51 % --bmc1_pre_inst_next_state false
% 150.33/150.51 % --bmc1_pre_inst_state false
% 150.33/150.51 % --bmc1_pre_inst_reach_state false
% 150.33/150.51 % --bmc1_out_unsat_core false
% 150.33/150.51 % --bmc1_aig_witness_out false
% 150.33/150.51 % --bmc1_verbose false
% 150.33/150.51 % --bmc1_dump_clauses_tptp false
% 150.33/150.52 % --bmc1_dump_unsat_core_tptp false
% 150.33/150.52 % --bmc1_dump_file -
% 150.33/150.52 % --bmc1_ucm_expand_uc_limit 128
% 150.33/150.52 % --bmc1_ucm_n_expand_iterations 6
% 150.33/150.52 % --bmc1_ucm_extend_mode 1
% 150.33/150.52 % --bmc1_ucm_init_mode 2
% 150.33/150.52 % --bmc1_ucm_cone_mode none
% 150.33/150.52 % --bmc1_ucm_reduced_relation_type 0
% 150.33/150.52 % --bmc1_ucm_relax_model 4
% 150.33/150.52 % --bmc1_ucm_full_tr_after_sat true
% 150.33/150.52 % --bmc1_ucm_expand_neg_assumptions false
% 150.33/150.52 % --bmc1_ucm_layered_model none
% 150.33/150.52 % --bmc1_ucm_max_lemma_size 10
% 150.33/150.52
% 150.33/150.52 % ------ AIG Options
% 150.33/150.52
% 150.33/150.52 % --aig_mode false
% 150.33/150.52
% 150.33/150.52 % ------ Instantiation Options
% 150.33/150.52
% 150.33/150.52 % --instantiation_flag true
% 150.33/150.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.33/150.52 % --inst_solver_per_active 750
% 150.33/150.52 % --inst_solver_calls_frac 0.5
% 150.33/150.52 % --inst_passive_queue_type priority_queues
% 150.33/150.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.33/150.52 % --inst_passive_queues_freq [25;2]
% 150.33/150.52 % --inst_dismatching true
% 150.33/150.52 % --inst_eager_unprocessed_to_passive true
% 150.33/150.52 % --inst_prop_sim_given true
% 150.33/150.52 % --inst_prop_sim_new false
% 150.33/150.52 % --inst_orphan_elimination true
% 150.33/150.52 % --inst_learning_loop_flag true
% 150.33/150.52 % --inst_learning_start 3000
% 150.33/150.52 % --inst_learning_factor 2
% 150.33/150.52 % --inst_start_prop_sim_after_learn 3
% 150.33/150.52 % --inst_sel_renew solver
% 150.33/150.52 % --inst_lit_activity_flag true
% 150.33/150.52 % --inst_out_proof true
% 150.33/150.52
% 150.33/150.52 % ------ Resolution Options
% 150.33/150.52
% 150.33/150.52 % --resolution_flag true
% 150.33/150.52 % --res_lit_sel kbo_max
% 150.33/150.52 % --res_to_prop_solver none
% 150.33/150.52 % --res_prop_simpl_new false
% 150.33/150.52 % --res_prop_simpl_given false
% 150.33/150.52 % --res_passive_queue_type priority_queues
% 150.33/150.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.33/150.52 % --res_passive_queues_freq [15;5]
% 150.33/150.52 % --res_forward_subs full
% 150.33/150.52 % --res_backward_subs full
% 150.33/150.52 % --res_forward_subs_resolution true
% 150.33/150.52 % --res_backward_subs_resolution true
% 150.33/150.52 % --res_orphan_elimination false
% 150.33/150.52 % --res_time_limit 1000.
% 150.33/150.52 % --res_out_proof true
% 150.33/150.52 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_13786e.s
% 150.33/150.52 % --modulo true
% 150.33/150.52
% 150.33/150.52 % ------ Combination Options
% 150.33/150.52
% 150.33/150.52 % --comb_res_mult 1000
% 150.33/150.52 % --comb_inst_mult 300
% 150.33/150.52 % ------
% 150.33/150.52
% 150.33/150.52 % ------ Parsing...% successful
% 150.33/150.52
% 150.33/150.52 % ------ 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 %
% 150.33/150.52
% 150.33/150.52 % ------ Proving...
% 150.33/150.52 % ------ Problem Properties
% 150.33/150.52
% 150.33/150.52 %
% 150.33/150.52 % EPR false
% 150.33/150.52 % Horn false
% 150.33/150.52 % Has equality true
% 150.33/150.52
% 150.33/150.52 % % ------ Input Options Time Limit: Unbounded
% 150.33/150.52
% 150.33/150.52
% 150.33/150.52 % % ------ Current options:
% 150.33/150.52
% 150.33/150.52 % ------ Input Options
% 150.33/150.52
% 150.33/150.52 % --out_options all
% 150.33/150.52 % --tptp_safe_out true
% 150.33/150.52 % --problem_path ""
% 150.33/150.52 % --include_path ""
% 150.33/150.52 % --clausifier .//eprover
% 150.33/150.52 % --clausifier_options --tstp-format
% 150.33/150.52 % --stdin false
% 150.33/150.52 % --dbg_backtrace false
% 150.33/150.52 % --dbg_dump_prop_clauses false
% 150.33/150.52 % --dbg_dump_prop_clauses_file -
% 150.33/150.52 % --dbg_out_stat false
% 150.33/150.52
% 150.33/150.52 % ------ General Options
% 150.33/150.52
% 150.33/150.52 % --fof false
% 150.33/150.52 % --time_out_real 150.
% 150.33/150.52 % --time_out_prep_mult 0.2
% 150.33/150.52 % --time_out_virtual -1.
% 150.33/150.52 % --schedule none
% 150.33/150.52 % --ground_splitting input
% 150.33/150.52 % --splitting_nvd 16
% 150.33/150.52 % --non_eq_to_eq false
% 150.33/150.52 % --prep_gs_sim true
% 150.33/150.52 % --prep_unflatten false
% 150.33/150.52 % --prep_res_sim true
% 150.33/150.52 % --prep_upred true
% 150.33/150.52 % --res_sim_input true
% 150.33/150.52 % --clause_weak_htbl true
% 150.33/150.52 % --gc_record_bc_elim false
% 150.33/150.52 % --symbol_type_check false
% 150.33/150.52 % --clausify_out false
% 150.33/150.52 % --large_theory_mode false
% 150.33/150.52 % --prep_sem_filter none
% 150.33/150.52 % --prep_sem_filter_out false
% 150.33/150.52 % --preprocessed_out false
% 150.33/150.52 % --sub_typing false
% 150.33/150.52 % --brand_transform false
% 150.33/150.52 % --pure_diseq_elim true
% 150.33/150.52 % --min_unsat_core false
% 150.33/150.52 % --pred_elim true
% 150.33/150.52 % --add_important_lit false
% 150.33/150.52 % --soft_assumptions false
% 150.33/150.52 % --reset_solvers false
% 150.33/150.52 % --bc_imp_inh []
% 150.33/150.52 % --conj_cone_tolerance 1.5
% 150.33/150.52 % --prolific_symb_bound 500
% 150.33/150.52 % --lt_threshold 2000
% 150.33/150.52
% 150.33/150.52 % ------ SAT Options
% 150.33/150.52
% 150.33/150.52 % --sat_mode false
% 150.33/150.52 % --sat_fm_restart_options ""
% 150.33/150.52 % --sat_gr_def false
% 150.33/150.52 % --sat_epr_types true
% 150.33/150.52 % --sat_non_cyclic_types false
% 150.33/150.52 % --sat_finite_models false
% 150.33/150.52 % --sat_fm_lemmas false
% 150.33/150.52 % --sat_fm_prep false
% 150.33/150.52 % --sat_fm_uc_incr true
% 150.33/150.52 % --sat_out_model small
% 150.33/150.52 % --sat_out_clauses false
% 150.33/150.52
% 150.33/150.52 % ------ QBF Options
% 150.33/150.52
% 150.33/150.52 % --qbf_mode false
% 150.33/150.52 % --qbf_elim_univ true
% 150.33/150.52 % --qbf_sk_in true
% 150.33/150.52 % --qbf_pred_elim true
% 150.33/150.52 % --qbf_split 32
% 150.33/150.52
% 150.33/150.52 % ------ BMC1 Options
% 150.33/150.52
% 150.33/150.52 % --bmc1_incremental false
% 150.33/150.52 % --bmc1_axioms reachable_all
% 150.33/150.52 % --bmc1_min_bound 0
% 150.33/150.52 % --bmc1_max_bound -1
% 150.33/150.52 % --bmc1_max_bound_default -1
% 150.33/150.52 % --bmc1_symbol_reachability true
% 150.33/150.52 % --bmc1_property_lemmas false
% 150.33/150.52 % --bmc1_k_induction false
% 150.33/150.52 % --bmc1_non_equiv_states false
% 150.33/150.52 % --bmc1_deadlock false
% 150.33/150.52 % --bmc1_ucm false
% 150.33/150.52 % --bmc1_add_unsat_core none
% 150.33/150.52 % --bmc1_unsat_core_children false
% 150.33/150.52 % --bmc1_unsat_core_extrapolate_axioms false
% 150.33/150.52 % --bmc1_out_stat full
% 150.33/150.52 % --bmc1_ground_init false
% 150.33/150.52 % --bmc1_pre_inst_next_state false
% 150.33/150.52 % --bmc1_pre_inst_state false
% 150.33/150.52 % --bmc1_pre_inst_reach_state false
% 150.33/150.52 % --bmc1_out_unsat_core false
% 150.33/150.52 % --bmc1_aig_witness_out false
% 150.33/150.52 % --bmc1_verbose false
% 150.33/150.52 % --bmc1_dump_clauses_tptp false
% 150.33/150.52 % --bmc1_dump_unsat_core_tptp false
% 150.33/150.52 % --bmc1_dump_file -
% 150.33/150.52 % --bmc1_ucm_expand_uc_limit 128
% 150.33/150.52 % --bmc1_ucm_n_expand_iterations 6
% 150.33/150.52 % --bmc1_ucm_extend_mode 1
% 150.33/150.52 % --bmc1_ucm_init_mode 2
% 150.33/150.52 % --bmc1_ucm_cone_mode none
% 150.33/150.52 % --bmc1_ucm_reduced_relation_type 0
% 150.33/150.52 % --bmc1_ucm_relax_model 4
% 150.33/150.52 % --bmc1_ucm_full_tr_after_sat true
% 150.33/150.52 % --bmc1_ucm_expand_neg_assumptions false
% 150.33/150.52 % --bmc1_ucm_layered_model none
% 150.33/150.52 % --bmc1_ucm_max_lemma_size 10
% 150.33/150.52
% 150.33/150.52 % ------ AIG Options
% 150.33/150.52
% 150.33/150.52 % --aig_mode false
% 150.33/150.52
% 150.33/150.52 % ------ Instantiation Options
% 150.33/150.52
% 150.33/150.52 % --instantiation_flag true
% 150.33/150.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.33/150.52 % --inst_solver_per_active 750
% 150.33/150.52 % --inst_solver_calls_frac 0.5
% 150.33/150.52 % --inst_passive_queue_type priority_queues
% 150.33/150.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.33/150.52 % --inst_passive_queues_freq [25;2]
% 150.33/150.52 % --inst_dismatching true
% 150.33/150.52 % --inst_eager_unprocessed_to_passive true
% 150.33/150.52 % --inst_prop_sim_given true
% 196.92/197.10 % --inst_prop_sim_new false
% 196.92/197.10 % --inst_orphan_elimination true
% 196.92/197.10 % --inst_learning_loop_flag true
% 196.92/197.10 % --inst_learning_start 3000
% 196.92/197.10 % --inst_learning_factor 2
% 196.92/197.10 % --inst_start_prop_sim_after_learn 3
% 196.92/197.10 % --inst_sel_renew solver
% 196.92/197.10 % --inst_lit_activity_flag true
% 196.92/197.10 % --inst_out_proof true
% 196.92/197.10
% 196.92/197.10 % ------ Resolution Options
% 196.92/197.10
% 196.92/197.10 % --resolution_flag true
% 196.92/197.10 % --res_lit_sel kbo_max
% 196.92/197.10 % --res_to_prop_solver none
% 196.92/197.10 % --res_prop_simpl_new false
% 196.92/197.10 % --res_prop_simpl_given false
% 196.92/197.10 % --res_passive_queue_type priority_queues
% 196.92/197.10 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 196.92/197.10 % --res_passive_queues_freq [15;5]
% 196.92/197.10 % --res_forward_subs full
% 196.92/197.10 % --res_backward_subs full
% 196.92/197.10 % --res_forward_subs_resolution true
% 196.92/197.10 % --res_backward_subs_resolution true
% 196.92/197.10 % --res_orphan_elimination false
% 196.92/197.10 % --res_time_limit 1000.
% 196.92/197.10 % --res_out_proof true
% 196.92/197.10 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_13786e.s
% 196.92/197.10 % --modulo true
% 196.92/197.10
% 196.92/197.10 % ------ Combination Options
% 196.92/197.10
% 196.92/197.10 % --comb_res_mult 1000
% 196.92/197.10 % --comb_inst_mult 300
% 196.92/197.10 % ------
% 196.92/197.10
% 196.92/197.10
% 196.92/197.10
% 196.92/197.10 % ------ Proving...
% 196.92/197.10 %
% 196.92/197.10
% 196.92/197.10
% 196.92/197.10 % ------ Statistics
% 196.92/197.10
% 196.92/197.10 % ------ General
% 196.92/197.10
% 196.92/197.10 % num_of_input_clauses: 214
% 196.92/197.10 % num_of_input_neg_conjectures: 2
% 196.92/197.10 % num_of_splits: 0
% 196.92/197.10 % num_of_split_atoms: 0
% 196.92/197.10 % num_of_sem_filtered_clauses: 0
% 196.92/197.10 % num_of_subtypes: 0
% 196.92/197.10 % monotx_restored_types: 0
% 196.92/197.10 % sat_num_of_epr_types: 0
% 196.92/197.10 % sat_num_of_non_cyclic_types: 0
% 196.92/197.10 % sat_guarded_non_collapsed_types: 0
% 196.92/197.10 % is_epr: 0
% 196.92/197.10 % is_horn: 0
% 196.92/197.10 % has_eq: 1
% 196.92/197.10 % num_pure_diseq_elim: 0
% 196.92/197.10 % simp_replaced_by: 0
% 196.92/197.10 % res_preprocessed: 4
% 196.92/197.10 % prep_upred: 0
% 196.92/197.10 % prep_unflattend: 0
% 196.92/197.10 % pred_elim_cands: 0
% 196.92/197.10 % pred_elim: 0
% 196.92/197.10 % pred_elim_cl: 0
% 196.92/197.10 % pred_elim_cycles: 0
% 196.92/197.10 % forced_gc_time: 0
% 196.92/197.10 % gc_basic_clause_elim: 0
% 196.92/197.10 % parsing_time: 0.004
% 196.92/197.10 % sem_filter_time: 0.
% 196.92/197.10 % pred_elim_time: 0.
% 196.92/197.10 % out_proof_time: 0.001
% 196.92/197.10 % monotx_time: 0.
% 196.92/197.10 % subtype_inf_time: 0.
% 196.92/197.10 % unif_index_cands_time: 0.335
% 196.92/197.10 % unif_index_add_time: 0.031
% 196.92/197.10 % total_time: 46.608
% 196.92/197.10 % num_of_symbols: 60
% 196.92/197.10 % num_of_terms: 620377
% 196.92/197.10
% 196.92/197.10 % ------ Propositional Solver
% 196.92/197.10
% 196.92/197.10 % prop_solver_calls: 14
% 196.92/197.10 % prop_fast_solver_calls: 6
% 196.92/197.10 % prop_num_of_clauses: 10703
% 196.92/197.10 % prop_preprocess_simplified: 14525
% 196.92/197.10 % prop_fo_subsumed: 0
% 196.92/197.10 % prop_solver_time: 0.004
% 196.92/197.10 % prop_fast_solver_time: 0.
% 196.92/197.10 % prop_unsat_core_time: 0.001
% 196.92/197.10
% 196.92/197.10 % ------ QBF
% 196.92/197.10
% 196.92/197.10 % qbf_q_res: 0
% 196.92/197.10 % qbf_num_tautologies: 0
% 196.92/197.10 % qbf_prep_cycles: 0
% 196.92/197.10
% 196.92/197.10 % ------ BMC1
% 196.92/197.10
% 196.92/197.10 % bmc1_current_bound: -1
% 196.92/197.10 % bmc1_last_solved_bound: -1
% 196.92/197.10 % bmc1_unsat_core_size: -1
% 196.92/197.10 % bmc1_unsat_core_parents_size: -1
% 196.92/197.10 % bmc1_merge_next_fun: 0
% 196.92/197.10 % bmc1_unsat_core_clauses_time: 0.
% 196.92/197.10
% 196.92/197.10 % ------ Instantiation
% 196.92/197.10
% 196.92/197.10 % inst_num_of_clauses: 7289
% 196.92/197.10 % inst_num_in_passive: 4110
% 196.92/197.10 % inst_num_in_active: 2146
% 196.92/197.10 % inst_num_in_unprocessed: 1000
% 196.92/197.10 % inst_num_of_loops: 2595
% 196.92/197.11 % inst_num_of_learning_restarts: 0
% 196.92/197.11 % inst_num_moves_active_passive: 415
% 196.92/197.11 % inst_lit_activity: 717
% 196.92/197.11 % inst_lit_activity_moves: 1
% 196.92/197.11 % inst_num_tautologies: 31
% 196.92/197.11 % inst_num_prop_implied: 0
% 196.92/197.11 % inst_num_existing_simplified: 0
% 196.92/197.11 % inst_num_eq_res_simplified: 1
% 196.92/197.11 % inst_num_child_elim: 0
% 196.92/197.11 % inst_num_of_dismatching_blockings: 28791
% 196.92/197.11 % inst_num_of_non_proper_insts: 15038
% 196.92/197.11 % inst_num_of_duplicates: 6537
% 196.92/197.11 % inst_inst_num_from_inst_to_res: 0
% 196.92/197.11 % inst_dismatching_checking_time: 0.086
% 196.92/197.11
% 196.92/197.11 % ------ Resolution
% 196.92/197.11
% 196.92/197.11 % res_num_of_clauses: 672022
% 196.92/197.11 % res_num_in_passive: 665014
% 196.92/197.11 % res_num_in_active: 6944
% 196.92/197.11 % res_num_of_loops: 9000
% 196.92/197.11 % res_forward_subset_subsumed: 60053
% 196.92/197.11 % res_backward_subset_subsumed: 241
% 196.92/197.11 % res_forward_subsumed: 2001
% 196.92/197.11 % res_backward_subsumed: 16
% 196.92/197.11 % res_forward_subsumption_resolution: 421
% 196.92/197.11 % res_backward_subsumption_resolution: 14
% 196.92/197.11 % res_clause_to_clause_subsumption: 222083
% 196.92/197.11 % res_orphan_elimination: 0
% 196.92/197.11 % res_tautology_del: 3340
% 196.92/197.11 % res_num_eq_res_simplified: 0
% 196.92/197.11 % res_num_sel_changes: 0
% 196.92/197.11 % res_moves_from_active_to_pass: 0
% 196.92/197.11
% 196.92/197.11 % Status Unsatisfiable
% 196.92/197.11 % SZS status Theorem
% 196.92/197.11 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------