TSTP Solution File: SET064+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET064+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n007.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:09:39 EDT 2022
% Result : Theorem 0.62s 0.91s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 50
% Syntax : Number of formulae : 533 ( 130 unt; 0 def)
% Number of atoms : 1246 ( 205 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 1248 ( 535 ~; 558 |; 99 &)
% ( 38 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 11 con; 0-3 aty)
% Number of variables : 1117 ( 136 sgn 294 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X4,X7,X1] :
( member(ordered_pair(ordered_pair(X3,X4),X7),flip(X1))
<=> ( member(ordered_pair(ordered_pair(X3,X4),X7),cross_product(cross_product(universal_class,universal_class),universal_class))
& member(ordered_pair(ordered_pair(X4,X3),X7),X1) ) ),
file('<stdin>',flip_defn) ).
fof(c_0_1,axiom,
! [X1,X3,X4,X7] :
( member(ordered_pair(ordered_pair(X3,X4),X7),rotate(X1))
<=> ( member(ordered_pair(ordered_pair(X3,X4),X7),cross_product(cross_product(universal_class,universal_class),universal_class))
& member(ordered_pair(ordered_pair(X4,X7),X3),X1) ) ),
file('<stdin>',rotate_defn) ).
fof(c_0_2,axiom,
! [X6,X8,X3,X4] :
( member(ordered_pair(X3,X4),compose(X8,X6))
<=> ( member(X3,universal_class)
& member(X4,image(X8,image(X6,singleton(X3)))) ) ),
file('<stdin>',compose_defn2) ).
fof(c_0_3,axiom,
! [X9] :
( function(X9)
<=> ( subclass(X9,cross_product(universal_class,universal_class))
& subclass(compose(X9,inverse(X9)),identity_relation) ) ),
file('<stdin>',function_defn) ).
fof(c_0_4,axiom,
! [X1,X5] :
( member(X5,domain_of(X1))
<=> ( member(X5,universal_class)
& restrict(X1,singleton(X5),universal_class) != null_class ) ),
file('<stdin>',domain_of) ).
fof(c_0_5,axiom,
! [X1,X6] : image(X6,X1) = range_of(restrict(X6,X1,universal_class)),
file('<stdin>',image_defn) ).
fof(c_0_6,axiom,
! [X3,X4,X1,X2] :
( member(ordered_pair(X3,X4),cross_product(X1,X2))
<=> ( member(X3,X1)
& member(X4,X2) ) ),
file('<stdin>',cross_product_defn) ).
fof(c_0_7,axiom,
! [X1,X6,X2] : restrict(X6,X1,X2) = intersection(X6,cross_product(X1,X2)),
file('<stdin>',restrict_defn) ).
fof(c_0_8,axiom,
! [X1,X2,X5] :
( member(X5,union(X1,X2))
<=> ( member(X5,X1)
| member(X5,X2) ) ),
file('<stdin>',union_defn) ).
fof(c_0_9,axiom,
! [X1,X2,X5] :
( member(X5,cross_product(X1,X2))
=> X5 = ordered_pair(first(X5),second(X5)) ),
file('<stdin>',cross_product) ).
fof(c_0_10,axiom,
! [X1,X2] :
( member(ordered_pair(X1,X2),successor_relation)
<=> ( member(X1,universal_class)
& member(X2,universal_class)
& successor(X1) = X2 ) ),
file('<stdin>',successor_relation_defn2) ).
fof(c_0_11,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X1)
& member(X5,X2) ) ),
file('<stdin>',intersection) ).
fof(c_0_12,axiom,
! [X1] :
( inductive(X1)
<=> ( member(null_class,X1)
& subclass(image(successor_relation,X1),X1) ) ),
file('<stdin>',inductive_defn) ).
fof(c_0_13,axiom,
! [X1] : subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
file('<stdin>',flip) ).
fof(c_0_14,axiom,
! [X1] : subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
file('<stdin>',rotate) ).
fof(c_0_15,axiom,
! [X1,X2] :
( member(ordered_pair(X1,X2),element_relation)
<=> ( member(X2,universal_class)
& member(X1,X2) ) ),
file('<stdin>',element_relation_defn) ).
fof(c_0_16,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('<stdin>',subclass_defn) ).
fof(c_0_17,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('<stdin>',unordered_pair_defn) ).
fof(c_0_18,axiom,
! [X3,X1] :
( member(X3,sum_class(X1))
<=> ? [X2] :
( member(X3,X2)
& member(X2,X1) ) ),
file('<stdin>',sum_class_defn) ).
fof(c_0_19,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
file('<stdin>',ordered_pair_defn) ).
fof(c_0_20,axiom,
! [X1,X2] :
( ( member(X1,universal_class)
& member(X2,universal_class) )
=> ( first(ordered_pair(X1,X2)) = X1
& second(ordered_pair(X1,X2)) = X2 ) ),
file('<stdin>',first_second) ).
fof(c_0_21,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ! [X3] :
~ ( member(X3,X1)
& member(X3,X2) ) ),
file('<stdin>',disjoint_defn) ).
fof(c_0_22,axiom,
! [X1,X9] :
( ( member(X1,universal_class)
& function(X9) )
=> member(image(X9,X1),universal_class) ),
file('<stdin>',replacement) ).
fof(c_0_23,axiom,
! [X3,X1] :
( member(X3,power_class(X1))
<=> ( member(X3,universal_class)
& subclass(X3,X1) ) ),
file('<stdin>',power_class_defn) ).
fof(c_0_24,axiom,
! [X6,X8] : subclass(compose(X8,X6),cross_product(universal_class,universal_class)),
file('<stdin>',compose_defn1) ).
fof(c_0_25,axiom,
! [X2] : inverse(X2) = domain_of(flip(cross_product(X2,universal_class))),
file('<stdin>',inverse_defn) ).
fof(c_0_26,axiom,
? [X9] :
( function(X9)
& ! [X2] :
( member(X2,universal_class)
=> ( X2 = null_class
| member(apply(X9,X2),X2) ) ) ),
file('<stdin>',choice) ).
fof(c_0_27,axiom,
! [X5] :
( member(X5,identity_relation)
<=> ? [X1] :
( member(X1,universal_class)
& X5 = ordered_pair(X1,X1) ) ),
file('<stdin>',identity_relation) ).
fof(c_0_28,axiom,
! [X9,X2] : apply(X9,X2) = sum_class(image(X9,singleton(X2))),
file('<stdin>',apply_defn) ).
fof(c_0_29,axiom,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( member(X5,universal_class)
& ~ member(X5,X1) ) ),
file('<stdin>',complement) ).
fof(c_0_30,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
file('<stdin>',extensionality) ).
fof(c_0_31,axiom,
! [X3] :
( member(X3,universal_class)
=> member(power_class(X3),universal_class) ),
file('<stdin>',power_class) ).
fof(c_0_32,axiom,
! [X1] :
( member(X1,universal_class)
=> member(sum_class(X1),universal_class) ),
file('<stdin>',sum_class) ).
fof(c_0_33,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
file('<stdin>',unordered_pair) ).
fof(c_0_34,axiom,
subclass(successor_relation,cross_product(universal_class,universal_class)),
file('<stdin>',successor_relation_defn1) ).
fof(c_0_35,axiom,
subclass(element_relation,cross_product(universal_class,universal_class)),
file('<stdin>',element_relation) ).
fof(c_0_36,axiom,
! [X1] : successor(X1) = union(X1,singleton(X1)),
file('<stdin>',successor_defn) ).
fof(c_0_37,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( member(X3,universal_class)
& member(X3,X1)
& disjoint(X3,X1) ) ),
file('<stdin>',regularity) ).
fof(c_0_38,axiom,
! [X1] : ~ member(X1,null_class),
file('<stdin>',null_class_defn) ).
fof(c_0_39,axiom,
? [X1] :
( member(X1,universal_class)
& inductive(X1)
& ! [X2] :
( inductive(X2)
=> subclass(X1,X2) ) ),
file('<stdin>',infinity) ).
fof(c_0_40,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('<stdin>',singleton_set_defn) ).
fof(c_0_41,axiom,
! [X5] : range_of(X5) = domain_of(inverse(X5)),
file('<stdin>',range_of_defn) ).
fof(c_0_42,axiom,
! [X1] : subclass(X1,universal_class),
file('<stdin>',class_elements_are_sets) ).
fof(c_0_43,axiom,
! [X3,X4,X7,X1] :
( member(ordered_pair(ordered_pair(X3,X4),X7),flip(X1))
<=> ( member(ordered_pair(ordered_pair(X3,X4),X7),cross_product(cross_product(universal_class,universal_class),universal_class))
& member(ordered_pair(ordered_pair(X4,X3),X7),X1) ) ),
c_0_0 ).
fof(c_0_44,axiom,
! [X1,X3,X4,X7] :
( member(ordered_pair(ordered_pair(X3,X4),X7),rotate(X1))
<=> ( member(ordered_pair(ordered_pair(X3,X4),X7),cross_product(cross_product(universal_class,universal_class),universal_class))
& member(ordered_pair(ordered_pair(X4,X7),X3),X1) ) ),
c_0_1 ).
fof(c_0_45,axiom,
! [X6,X8,X3,X4] :
( member(ordered_pair(X3,X4),compose(X8,X6))
<=> ( member(X3,universal_class)
& member(X4,image(X8,image(X6,singleton(X3)))) ) ),
c_0_2 ).
fof(c_0_46,axiom,
! [X9] :
( function(X9)
<=> ( subclass(X9,cross_product(universal_class,universal_class))
& subclass(compose(X9,inverse(X9)),identity_relation) ) ),
c_0_3 ).
fof(c_0_47,axiom,
! [X1,X5] :
( member(X5,domain_of(X1))
<=> ( member(X5,universal_class)
& restrict(X1,singleton(X5),universal_class) != null_class ) ),
c_0_4 ).
fof(c_0_48,axiom,
! [X1,X6] : image(X6,X1) = range_of(restrict(X6,X1,universal_class)),
c_0_5 ).
fof(c_0_49,axiom,
! [X3,X4,X1,X2] :
( member(ordered_pair(X3,X4),cross_product(X1,X2))
<=> ( member(X3,X1)
& member(X4,X2) ) ),
c_0_6 ).
fof(c_0_50,axiom,
! [X1,X6,X2] : restrict(X6,X1,X2) = intersection(X6,cross_product(X1,X2)),
c_0_7 ).
fof(c_0_51,axiom,
! [X1,X2,X5] :
( member(X5,union(X1,X2))
<=> ( member(X5,X1)
| member(X5,X2) ) ),
c_0_8 ).
fof(c_0_52,axiom,
! [X1,X2,X5] :
( member(X5,cross_product(X1,X2))
=> X5 = ordered_pair(first(X5),second(X5)) ),
c_0_9 ).
fof(c_0_53,axiom,
! [X1,X2] :
( member(ordered_pair(X1,X2),successor_relation)
<=> ( member(X1,universal_class)
& member(X2,universal_class)
& successor(X1) = X2 ) ),
c_0_10 ).
fof(c_0_54,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X1)
& member(X5,X2) ) ),
c_0_11 ).
fof(c_0_55,axiom,
! [X1] :
( inductive(X1)
<=> ( member(null_class,X1)
& subclass(image(successor_relation,X1),X1) ) ),
c_0_12 ).
fof(c_0_56,axiom,
! [X1] : subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
c_0_13 ).
fof(c_0_57,axiom,
! [X1] : subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
c_0_14 ).
fof(c_0_58,axiom,
! [X1,X2] :
( member(ordered_pair(X1,X2),element_relation)
<=> ( member(X2,universal_class)
& member(X1,X2) ) ),
c_0_15 ).
fof(c_0_59,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_16 ).
fof(c_0_60,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
c_0_17 ).
fof(c_0_61,axiom,
! [X3,X1] :
( member(X3,sum_class(X1))
<=> ? [X2] :
( member(X3,X2)
& member(X2,X1) ) ),
c_0_18 ).
fof(c_0_62,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
c_0_19 ).
fof(c_0_63,axiom,
! [X1,X2] :
( ( member(X1,universal_class)
& member(X2,universal_class) )
=> ( first(ordered_pair(X1,X2)) = X1
& second(ordered_pair(X1,X2)) = X2 ) ),
c_0_20 ).
fof(c_0_64,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ! [X3] :
~ ( member(X3,X1)
& member(X3,X2) ) ),
c_0_21 ).
fof(c_0_65,axiom,
! [X1,X9] :
( ( member(X1,universal_class)
& function(X9) )
=> member(image(X9,X1),universal_class) ),
c_0_22 ).
fof(c_0_66,axiom,
! [X3,X1] :
( member(X3,power_class(X1))
<=> ( member(X3,universal_class)
& subclass(X3,X1) ) ),
c_0_23 ).
fof(c_0_67,axiom,
! [X6,X8] : subclass(compose(X8,X6),cross_product(universal_class,universal_class)),
c_0_24 ).
fof(c_0_68,axiom,
! [X2] : inverse(X2) = domain_of(flip(cross_product(X2,universal_class))),
c_0_25 ).
fof(c_0_69,axiom,
? [X9] :
( function(X9)
& ! [X2] :
( member(X2,universal_class)
=> ( X2 = null_class
| member(apply(X9,X2),X2) ) ) ),
c_0_26 ).
fof(c_0_70,axiom,
! [X5] :
( member(X5,identity_relation)
<=> ? [X1] :
( member(X1,universal_class)
& X5 = ordered_pair(X1,X1) ) ),
c_0_27 ).
fof(c_0_71,axiom,
! [X9,X2] : apply(X9,X2) = sum_class(image(X9,singleton(X2))),
c_0_28 ).
fof(c_0_72,plain,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( member(X5,universal_class)
& ~ member(X5,X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_29]) ).
fof(c_0_73,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
c_0_30 ).
fof(c_0_74,axiom,
! [X3] :
( member(X3,universal_class)
=> member(power_class(X3),universal_class) ),
c_0_31 ).
fof(c_0_75,axiom,
! [X1] :
( member(X1,universal_class)
=> member(sum_class(X1),universal_class) ),
c_0_32 ).
fof(c_0_76,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
c_0_33 ).
fof(c_0_77,axiom,
subclass(successor_relation,cross_product(universal_class,universal_class)),
c_0_34 ).
fof(c_0_78,axiom,
subclass(element_relation,cross_product(universal_class,universal_class)),
c_0_35 ).
fof(c_0_79,axiom,
! [X1] : successor(X1) = union(X1,singleton(X1)),
c_0_36 ).
fof(c_0_80,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( member(X3,universal_class)
& member(X3,X1)
& disjoint(X3,X1) ) ),
c_0_37 ).
fof(c_0_81,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[c_0_38]) ).
fof(c_0_82,axiom,
? [X1] :
( member(X1,universal_class)
& inductive(X1)
& ! [X2] :
( inductive(X2)
=> subclass(X1,X2) ) ),
c_0_39 ).
fof(c_0_83,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
c_0_40 ).
fof(c_0_84,axiom,
! [X5] : range_of(X5) = domain_of(inverse(X5)),
c_0_41 ).
fof(c_0_85,axiom,
! [X1] : subclass(X1,universal_class),
c_0_42 ).
fof(c_0_86,plain,
! [X8,X9,X10,X11,X12,X13,X14,X15] :
( ( member(ordered_pair(ordered_pair(X8,X9),X10),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X8,X9),X10),flip(X11)) )
& ( member(ordered_pair(ordered_pair(X9,X8),X10),X11)
| ~ member(ordered_pair(ordered_pair(X8,X9),X10),flip(X11)) )
& ( ~ member(ordered_pair(ordered_pair(X12,X13),X14),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X13,X12),X14),X15)
| member(ordered_pair(ordered_pair(X12,X13),X14),flip(X15)) ) ),
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_43])])])])]) ).
fof(c_0_87,plain,
! [X8,X9,X10,X11,X12,X13,X14,X15] :
( ( member(ordered_pair(ordered_pair(X9,X10),X11),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X9,X10),X11),rotate(X8)) )
& ( member(ordered_pair(ordered_pair(X10,X11),X9),X8)
| ~ member(ordered_pair(ordered_pair(X9,X10),X11),rotate(X8)) )
& ( ~ member(ordered_pair(ordered_pair(X13,X14),X15),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X14,X15),X13),X12)
| member(ordered_pair(ordered_pair(X13,X14),X15),rotate(X12)) ) ),
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_44])])])])]) ).
fof(c_0_88,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( member(X11,universal_class)
| ~ member(ordered_pair(X11,X12),compose(X10,X9)) )
& ( member(X12,image(X10,image(X9,singleton(X11))))
| ~ member(ordered_pair(X11,X12),compose(X10,X9)) )
& ( ~ member(X15,universal_class)
| ~ member(X16,image(X14,image(X13,singleton(X15))))
| member(ordered_pair(X15,X16),compose(X14,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_45])])])])]) ).
fof(c_0_89,plain,
! [X10,X11] :
( ( subclass(X10,cross_product(universal_class,universal_class))
| ~ function(X10) )
& ( subclass(compose(X10,inverse(X10)),identity_relation)
| ~ function(X10) )
& ( ~ subclass(X11,cross_product(universal_class,universal_class))
| ~ subclass(compose(X11,inverse(X11)),identity_relation)
| function(X11) ) ),
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_46])])])])]) ).
fof(c_0_90,plain,
! [X6,X7,X8,X9] :
( ( member(X7,universal_class)
| ~ member(X7,domain_of(X6)) )
& ( restrict(X6,singleton(X7),universal_class) != null_class
| ~ member(X7,domain_of(X6)) )
& ( ~ member(X9,universal_class)
| restrict(X8,singleton(X9),universal_class) = null_class
| member(X9,domain_of(X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])])])]) ).
fof(c_0_91,plain,
! [X7,X8] : image(X8,X7) = range_of(restrict(X8,X7,universal_class)),
inference(variable_rename,[status(thm)],[c_0_48]) ).
fof(c_0_92,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( member(X5,X7)
| ~ member(ordered_pair(X5,X6),cross_product(X7,X8)) )
& ( member(X6,X8)
| ~ member(ordered_pair(X5,X6),cross_product(X7,X8)) )
& ( ~ member(X9,X11)
| ~ member(X10,X12)
| member(ordered_pair(X9,X10),cross_product(X11,X12)) ) ),
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_49])])])])]) ).
fof(c_0_93,plain,
! [X7,X8,X9] : restrict(X8,X7,X9) = intersection(X8,cross_product(X7,X9)),
inference(variable_rename,[status(thm)],[c_0_50]) ).
fof(c_0_94,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( ~ member(X8,union(X6,X7))
| member(X8,X6)
| member(X8,X7) )
& ( ~ member(X11,X9)
| member(X11,union(X9,X10)) )
& ( ~ member(X11,X10)
| member(X11,union(X9,X10)) ) ),
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_51])])])])]) ).
fof(c_0_95,plain,
! [X6,X7,X8] :
( ~ member(X8,cross_product(X6,X7))
| X8 = ordered_pair(first(X8),second(X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])]) ).
fof(c_0_96,plain,
! [X3,X4,X5,X6] :
( ( member(X3,universal_class)
| ~ member(ordered_pair(X3,X4),successor_relation) )
& ( member(X4,universal_class)
| ~ member(ordered_pair(X3,X4),successor_relation) )
& ( successor(X3) = X4
| ~ member(ordered_pair(X3,X4),successor_relation) )
& ( ~ member(X5,universal_class)
| ~ member(X6,universal_class)
| successor(X5) != X6
| member(ordered_pair(X5,X6),successor_relation) ) ),
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_53])])])])]) ).
fof(c_0_97,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( member(X8,X6)
| ~ member(X8,intersection(X6,X7)) )
& ( member(X8,X7)
| ~ member(X8,intersection(X6,X7)) )
& ( ~ member(X11,X9)
| ~ member(X11,X10)
| member(X11,intersection(X9,X10)) ) ),
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_54])])])])]) ).
fof(c_0_98,plain,
! [X2,X3] :
( ( member(null_class,X2)
| ~ inductive(X2) )
& ( subclass(image(successor_relation,X2),X2)
| ~ inductive(X2) )
& ( ~ member(null_class,X3)
| ~ subclass(image(successor_relation,X3),X3)
| inductive(X3) ) ),
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_55])])])])]) ).
fof(c_0_99,plain,
! [X2] : subclass(flip(X2),cross_product(cross_product(universal_class,universal_class),universal_class)),
inference(variable_rename,[status(thm)],[c_0_56]) ).
fof(c_0_100,plain,
! [X2] : subclass(rotate(X2),cross_product(cross_product(universal_class,universal_class),universal_class)),
inference(variable_rename,[status(thm)],[c_0_57]) ).
fof(c_0_101,plain,
! [X3,X4,X5,X6] :
( ( member(X4,universal_class)
| ~ member(ordered_pair(X3,X4),element_relation) )
& ( member(X3,X4)
| ~ member(ordered_pair(X3,X4),element_relation) )
& ( ~ member(X6,universal_class)
| ~ member(X5,X6)
| member(ordered_pair(X5,X6),element_relation) ) ),
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_58])])])])]) ).
fof(c_0_102,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ subclass(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk1_2(X7,X8),X7)
| subclass(X7,X8) )
& ( ~ member(esk1_2(X7,X8),X8)
| subclass(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_59])])])])])]) ).
fof(c_0_103,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( member(X4,universal_class)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 = X5
| X4 = X6
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X7 != X8
| ~ member(X7,universal_class)
| member(X7,unordered_pair(X8,X9)) )
& ( X7 != X9
| ~ member(X7,universal_class)
| 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_60])])])])]) ).
fof(c_0_104,plain,
! [X4,X5,X7,X8,X9] :
( ( member(X4,esk3_2(X4,X5))
| ~ member(X4,sum_class(X5)) )
& ( member(esk3_2(X4,X5),X5)
| ~ member(X4,sum_class(X5)) )
& ( ~ member(X7,X9)
| ~ member(X9,X8)
| member(X7,sum_class(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_61])])])])])]) ).
fof(c_0_105,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(singleton(X3),unordered_pair(X3,singleton(X4))),
inference(variable_rename,[status(thm)],[c_0_62]) ).
fof(c_0_106,plain,
! [X3,X4] :
( ( first(ordered_pair(X3,X4)) = X3
| ~ member(X3,universal_class)
| ~ member(X4,universal_class) )
& ( second(ordered_pair(X3,X4)) = X4
| ~ member(X3,universal_class)
| ~ member(X4,universal_class) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])])]) ).
fof(c_0_107,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ disjoint(X4,X5)
| ~ member(X6,X4)
| ~ member(X6,X5) )
& ( member(esk5_2(X7,X8),X7)
| disjoint(X7,X8) )
& ( member(esk5_2(X7,X8),X8)
| disjoint(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_64])])])])])]) ).
fof(c_0_108,plain,
! [X10,X11] :
( ~ member(X10,universal_class)
| ~ function(X11)
| member(image(X11,X10),universal_class) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])]) ).
fof(c_0_109,plain,
! [X4,X5,X6,X7] :
( ( member(X4,universal_class)
| ~ member(X4,power_class(X5)) )
& ( subclass(X4,X5)
| ~ member(X4,power_class(X5)) )
& ( ~ member(X6,universal_class)
| ~ subclass(X6,X7)
| member(X6,power_class(X7)) ) ),
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_66])])])])]) ).
fof(c_0_110,plain,
! [X9,X10] : subclass(compose(X10,X9),cross_product(universal_class,universal_class)),
inference(variable_rename,[status(thm)],[c_0_67]) ).
fof(c_0_111,plain,
! [X3] : inverse(X3) = domain_of(flip(cross_product(X3,universal_class))),
inference(variable_rename,[status(thm)],[c_0_68]) ).
fof(c_0_112,plain,
! [X11] :
( function(esk7_0)
& ( ~ member(X11,universal_class)
| X11 = null_class
| member(apply(esk7_0,X11),X11) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_69])])])]) ).
fof(c_0_113,plain,
! [X6,X8,X9] :
( ( member(esk4_1(X6),universal_class)
| ~ member(X6,identity_relation) )
& ( X6 = ordered_pair(esk4_1(X6),esk4_1(X6))
| ~ member(X6,identity_relation) )
& ( ~ member(X9,universal_class)
| X8 != ordered_pair(X9,X9)
| member(X8,identity_relation) ) ),
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_70])])])])])]) ).
fof(c_0_114,plain,
! [X10,X11] : apply(X10,X11) = sum_class(image(X10,singleton(X11))),
inference(variable_rename,[status(thm)],[c_0_71]) ).
fof(c_0_115,plain,
! [X6,X7,X8,X9] :
( ( member(X7,universal_class)
| ~ member(X7,complement(X6)) )
& ( ~ member(X7,X6)
| ~ member(X7,complement(X6)) )
& ( ~ member(X9,universal_class)
| member(X9,X8)
| member(X9,complement(X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_72])])])])]) ).
fof(c_0_116,plain,
! [X3,X4,X5,X6] :
( ( subclass(X3,X4)
| X3 != X4 )
& ( subclass(X4,X3)
| X3 != X4 )
& ( ~ subclass(X5,X6)
| ~ subclass(X6,X5)
| X5 = X6 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])])])]) ).
fof(c_0_117,plain,
! [X4] :
( ~ member(X4,universal_class)
| member(power_class(X4),universal_class) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_74])]) ).
fof(c_0_118,plain,
! [X2] :
( ~ member(X2,universal_class)
| member(sum_class(X2),universal_class) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_75])]) ).
fof(c_0_119,plain,
! [X3,X4] : member(unordered_pair(X3,X4),universal_class),
inference(variable_rename,[status(thm)],[c_0_76]) ).
fof(c_0_120,axiom,
subclass(successor_relation,cross_product(universal_class,universal_class)),
c_0_77 ).
fof(c_0_121,axiom,
subclass(element_relation,cross_product(universal_class,universal_class)),
c_0_78 ).
fof(c_0_122,plain,
! [X2] : successor(X2) = union(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[c_0_79]) ).
fof(c_0_123,plain,
! [X4] :
( ( member(esk6_1(X4),universal_class)
| X4 = null_class )
& ( member(esk6_1(X4),X4)
| X4 = null_class )
& ( disjoint(esk6_1(X4),X4)
| X4 = null_class ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_80])])])]) ).
fof(c_0_124,plain,
! [X2] : ~ member(X2,null_class),
inference(variable_rename,[status(thm)],[c_0_81]) ).
fof(c_0_125,plain,
! [X4] :
( member(esk2_0,universal_class)
& inductive(esk2_0)
& ( ~ inductive(X4)
| subclass(esk2_0,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_82])])])]) ).
fof(c_0_126,plain,
! [X2] : singleton(X2) = unordered_pair(X2,X2),
inference(variable_rename,[status(thm)],[c_0_83]) ).
fof(c_0_127,plain,
! [X6] : range_of(X6) = domain_of(inverse(X6)),
inference(variable_rename,[status(thm)],[c_0_84]) ).
fof(c_0_128,plain,
! [X2] : subclass(X2,universal_class),
inference(variable_rename,[status(thm)],[c_0_85]) ).
cnf(c_0_129,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_130,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_131,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_132,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_133,plain,
( member(ordered_pair(X1,X2),compose(X3,X4))
| ~ member(X2,image(X3,image(X4,singleton(X1))))
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_134,plain,
( member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_135,plain,
( member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_136,plain,
( member(X2,image(X3,image(X4,singleton(X1))))
| ~ member(ordered_pair(X1,X2),compose(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_137,plain,
( function(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation)
| ~ subclass(X1,cross_product(universal_class,universal_class)) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_138,plain,
( ~ member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) != null_class ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_139,plain,
image(X1,X2) = range_of(restrict(X1,X2,universal_class)),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_140,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_141,plain,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_142,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),compose(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_143,plain,
( member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X2,X4)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_144,plain,
( member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_145,plain,
restrict(X1,X2,X3) = intersection(X1,cross_product(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_146,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_147,plain,
( X1 = ordered_pair(first(X1),second(X1))
| ~ member(X1,cross_product(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_148,plain,
( member(ordered_pair(X1,X2),successor_relation)
| successor(X1) != X2
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_149,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_150,plain,
( inductive(X1)
| ~ subclass(image(successor_relation,X1),X1)
| ~ member(null_class,X1) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_151,plain,
subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_152,plain,
subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_153,plain,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(X1,X2)
| ~ member(X2,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_154,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_155,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_156,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_157,plain,
( member(X1,universal_class)
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_158,plain,
( member(X1,X2)
| ~ member(ordered_pair(X1,X2),element_relation) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_159,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),successor_relation) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_160,plain,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),successor_relation) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_161,plain,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),element_relation) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_162,plain,
( member(X1,esk3_2(X1,X2))
| ~ member(X1,sum_class(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_163,plain,
( member(esk3_2(X1,X2),X2)
| ~ member(X1,sum_class(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_164,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_105]) ).
cnf(c_0_165,plain,
( first(ordered_pair(X2,X1)) = X2
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_166,plain,
( second(ordered_pair(X2,X1)) = X1
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_167,plain,
( ~ member(X1,X2)
| ~ member(X1,X3)
| ~ disjoint(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_168,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_169,plain,
( member(image(X1,X2),universal_class)
| ~ function(X1)
| ~ member(X2,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_108]) ).
cnf(c_0_170,plain,
( successor(X1) = X2
| ~ member(ordered_pair(X1,X2),successor_relation) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_171,plain,
( member(X1,sum_class(X2))
| ~ member(X3,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_172,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_173,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_174,plain,
( member(X1,power_class(X2))
| ~ subclass(X1,X2)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_175,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_176,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_177,plain,
subclass(compose(X1,X2),cross_product(universal_class,universal_class)),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_178,plain,
inverse(X1) = domain_of(flip(cross_product(X1,universal_class))),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_179,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_180,plain,
( member(apply(esk7_0,X1),X1)
| X1 = null_class
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_181,plain,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_182,plain,
( member(X1,identity_relation)
| X1 != ordered_pair(X2,X2)
| ~ member(X2,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_183,plain,
apply(X1,X2) = sum_class(image(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_184,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_185,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_186,plain,
( disjoint(X1,X2)
| member(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_187,plain,
( disjoint(X1,X2)
| member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_107]) ).
cnf(c_0_188,plain,
( subclass(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_189,plain,
( X1 = ordered_pair(esk4_1(X1),esk4_1(X1))
| ~ member(X1,identity_relation) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_190,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_191,plain,
( subclass(X1,X2)
| ~ member(X1,power_class(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_192,plain,
( member(X1,universal_class)
| ~ member(X1,power_class(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_193,plain,
( member(X1,universal_class)
| ~ member(X1,domain_of(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_194,plain,
( member(X1,universal_class)
| ~ member(X1,complement(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_195,plain,
( subclass(image(successor_relation,X1),X1)
| ~ inductive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_196,plain,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_197,plain,
( member(esk4_1(X1),universal_class)
| ~ member(X1,identity_relation) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_198,plain,
( member(power_class(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_199,plain,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_200,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_201,plain,
subclass(successor_relation,cross_product(universal_class,universal_class)),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_202,plain,
subclass(element_relation,cross_product(universal_class,universal_class)),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_203,plain,
successor(X1) = union(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_122]) ).
cnf(c_0_204,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_205,plain,
( X1 = null_class
| disjoint(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_206,plain,
( X1 = null_class
| member(esk6_1(X1),universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_207,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_208,plain,
( subclass(esk2_0,X1)
| ~ inductive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_209,plain,
( member(null_class,X1)
| ~ inductive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_210,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_211,plain,
( subclass(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_212,plain,
( subclass(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_213,plain,
range_of(X1) = domain_of(inverse(X1)),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_214,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_128]) ).
cnf(c_0_215,plain,
member(esk2_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_216,plain,
function(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_217,plain,
inductive(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_125]) ).
cnf(c_0_218,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
c_0_129,
[final] ).
cnf(c_0_219,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
c_0_130,
[final] ).
cnf(c_0_220,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)) ),
c_0_131,
[final] ).
cnf(c_0_221,plain,
( member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)) ),
c_0_132,
[final] ).
cnf(c_0_222,plain,
( member(ordered_pair(X1,X2),compose(X3,X4))
| ~ member(X2,image(X3,image(X4,singleton(X1))))
| ~ member(X1,universal_class) ),
c_0_133,
[final] ).
cnf(c_0_223,plain,
( member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)) ),
c_0_134,
[final] ).
cnf(c_0_224,plain,
( member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)) ),
c_0_135,
[final] ).
cnf(c_0_225,plain,
( member(X2,image(X3,image(X4,singleton(X1))))
| ~ member(ordered_pair(X1,X2),compose(X3,X4)) ),
c_0_136,
[final] ).
cnf(c_0_226,plain,
( function(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation)
| ~ subclass(X1,cross_product(universal_class,universal_class)) ),
c_0_137,
[final] ).
cnf(c_0_227,plain,
( ~ member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) != null_class ),
c_0_138,
[final] ).
cnf(c_0_228,plain,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
c_0_139,
[final] ).
cnf(c_0_229,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_140,
[final] ).
cnf(c_0_230,plain,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_141,
[final] ).
cnf(c_0_231,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),compose(X3,X4)) ),
c_0_142,
[final] ).
cnf(c_0_232,plain,
( member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X2,X4)
| ~ member(X1,X3) ),
c_0_143,
[final] ).
cnf(c_0_233,plain,
( member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class
| ~ member(X1,universal_class) ),
c_0_144,
[final] ).
cnf(c_0_234,plain,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
c_0_145,
[final] ).
cnf(c_0_235,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
c_0_146,
[final] ).
cnf(c_0_236,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
c_0_147,
[final] ).
cnf(c_0_237,plain,
( member(ordered_pair(X1,X2),successor_relation)
| successor(X1) != X2
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
c_0_148,
[final] ).
cnf(c_0_238,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
c_0_149,
[final] ).
cnf(c_0_239,plain,
( inductive(X1)
| ~ subclass(image(successor_relation,X1),X1)
| ~ member(null_class,X1) ),
c_0_150,
[final] ).
cnf(c_0_240,plain,
subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
c_0_151,
[final] ).
cnf(c_0_241,plain,
subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
c_0_152,
[final] ).
cnf(c_0_242,plain,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(X1,X2)
| ~ member(X2,universal_class) ),
c_0_153,
[final] ).
cnf(c_0_243,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_154,
[final] ).
cnf(c_0_244,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_155,
[final] ).
cnf(c_0_245,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
c_0_156,
[final] ).
cnf(c_0_246,plain,
( member(X1,universal_class)
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_157,
[final] ).
cnf(c_0_247,plain,
( member(X1,X2)
| ~ member(ordered_pair(X1,X2),element_relation) ),
c_0_158,
[final] ).
cnf(c_0_248,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),successor_relation) ),
c_0_159,
[final] ).
cnf(c_0_249,plain,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),successor_relation) ),
c_0_160,
[final] ).
cnf(c_0_250,plain,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),element_relation) ),
c_0_161,
[final] ).
cnf(c_0_251,plain,
( member(X1,esk3_2(X1,X2))
| ~ member(X1,sum_class(X2)) ),
c_0_162,
[final] ).
cnf(c_0_252,plain,
( member(esk3_2(X1,X2),X2)
| ~ member(X1,sum_class(X2)) ),
c_0_163,
[final] ).
cnf(c_0_253,plain,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
c_0_164,
[final] ).
cnf(c_0_254,plain,
( first(ordered_pair(X2,X1)) = X2
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
c_0_165,
[final] ).
cnf(c_0_255,plain,
( second(ordered_pair(X2,X1)) = X1
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
c_0_166,
[final] ).
cnf(c_0_256,plain,
( ~ member(X1,X2)
| ~ member(X1,X3)
| ~ disjoint(X3,X2) ),
c_0_167,
[final] ).
cnf(c_0_257,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_168,
[final] ).
cnf(c_0_258,plain,
( member(image(X1,X2),universal_class)
| ~ function(X1)
| ~ member(X2,universal_class) ),
c_0_169,
[final] ).
cnf(c_0_259,plain,
( successor(X1) = X2
| ~ member(ordered_pair(X1,X2),successor_relation) ),
c_0_170,
[final] ).
cnf(c_0_260,plain,
( member(X1,sum_class(X2))
| ~ member(X3,X2)
| ~ member(X1,X3) ),
c_0_171,
[final] ).
cnf(c_0_261,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X2 ),
c_0_172,
[final] ).
cnf(c_0_262,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X3 ),
c_0_173,
[final] ).
cnf(c_0_263,plain,
( member(X1,power_class(X2))
| ~ subclass(X1,X2)
| ~ member(X1,universal_class) ),
c_0_174,
[final] ).
cnf(c_0_264,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
c_0_175,
[final] ).
cnf(c_0_265,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
c_0_176,
[final] ).
cnf(c_0_266,plain,
subclass(compose(X1,X2),cross_product(universal_class,universal_class)),
c_0_177,
[final] ).
cnf(c_0_267,plain,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
c_0_178,
[final] ).
cnf(c_0_268,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
c_0_179,
[final] ).
cnf(c_0_269,plain,
( member(apply(esk7_0,X1),X1)
| X1 = null_class
| ~ member(X1,universal_class) ),
c_0_180,
[final] ).
cnf(c_0_270,plain,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ function(X1) ),
c_0_181,
[final] ).
cnf(c_0_271,plain,
( member(X1,identity_relation)
| X1 != ordered_pair(X2,X2)
| ~ member(X2,universal_class) ),
c_0_182,
[final] ).
cnf(c_0_272,plain,
sum_class(image(X1,singleton(X2))) = apply(X1,X2),
c_0_183,
[final] ).
cnf(c_0_273,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_184,
[final] ).
cnf(c_0_274,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_185,
[final] ).
cnf(c_0_275,plain,
( disjoint(X1,X2)
| member(esk5_2(X1,X2),X1) ),
c_0_186,
[final] ).
cnf(c_0_276,plain,
( disjoint(X1,X2)
| member(esk5_2(X1,X2),X2) ),
c_0_187,
[final] ).
cnf(c_0_277,plain,
( subclass(X1,X2)
| member(esk1_2(X1,X2),X1) ),
c_0_188,
[final] ).
cnf(c_0_278,plain,
( ordered_pair(esk4_1(X1),esk4_1(X1)) = X1
| ~ member(X1,identity_relation) ),
c_0_189,
[final] ).
cnf(c_0_279,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
c_0_190,
[final] ).
cnf(c_0_280,plain,
( subclass(X1,X2)
| ~ member(X1,power_class(X2)) ),
c_0_191,
[final] ).
cnf(c_0_281,plain,
( member(X1,universal_class)
| ~ member(X1,power_class(X2)) ),
c_0_192,
[final] ).
cnf(c_0_282,plain,
( member(X1,universal_class)
| ~ member(X1,domain_of(X2)) ),
c_0_193,
[final] ).
cnf(c_0_283,plain,
( member(X1,universal_class)
| ~ member(X1,complement(X2)) ),
c_0_194,
[final] ).
cnf(c_0_284,plain,
( subclass(image(successor_relation,X1),X1)
| ~ inductive(X1) ),
c_0_195,
[final] ).
cnf(c_0_285,plain,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
c_0_196,
[final] ).
cnf(c_0_286,plain,
( member(esk4_1(X1),universal_class)
| ~ member(X1,identity_relation) ),
c_0_197,
[final] ).
cnf(c_0_287,plain,
( member(power_class(X1),universal_class)
| ~ member(X1,universal_class) ),
c_0_198,
[final] ).
cnf(c_0_288,plain,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
c_0_199,
[final] ).
cnf(c_0_289,plain,
member(unordered_pair(X1,X2),universal_class),
c_0_200,
[final] ).
cnf(c_0_290,plain,
subclass(successor_relation,cross_product(universal_class,universal_class)),
c_0_201,
[final] ).
cnf(c_0_291,plain,
subclass(element_relation,cross_product(universal_class,universal_class)),
c_0_202,
[final] ).
cnf(c_0_292,plain,
union(X1,singleton(X1)) = successor(X1),
c_0_203,
[final] ).
cnf(c_0_293,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
c_0_204,
[final] ).
cnf(c_0_294,plain,
( X1 = null_class
| disjoint(esk6_1(X1),X1) ),
c_0_205,
[final] ).
cnf(c_0_295,plain,
( X1 = null_class
| member(esk6_1(X1),universal_class) ),
c_0_206,
[final] ).
cnf(c_0_296,plain,
~ member(X1,null_class),
c_0_207,
[final] ).
cnf(c_0_297,plain,
( subclass(esk2_0,X1)
| ~ inductive(X1) ),
c_0_208,
[final] ).
cnf(c_0_298,plain,
( member(null_class,X1)
| ~ inductive(X1) ),
c_0_209,
[final] ).
cnf(c_0_299,plain,
unordered_pair(X1,X1) = singleton(X1),
c_0_210,
[final] ).
cnf(c_0_300,plain,
( subclass(X1,X2)
| X1 != X2 ),
c_0_211,
[final] ).
cnf(c_0_301,plain,
( subclass(X2,X1)
| X1 != X2 ),
c_0_212,
[final] ).
cnf(c_0_302,plain,
domain_of(inverse(X1)) = range_of(X1),
c_0_213,
[final] ).
cnf(c_0_303,plain,
subclass(X1,universal_class),
c_0_214,
[final] ).
cnf(c_0_304,plain,
member(esk2_0,universal_class),
c_0_215,
[final] ).
cnf(c_0_305,plain,
function(esk7_0),
c_0_216,
[final] ).
cnf(c_0_306,plain,
inductive(esk2_0),
c_0_217,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_218_0,axiom,
( member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_218_1,axiom,
( ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_218_2,axiom,
( ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_218]) ).
cnf(c_0_219_0,axiom,
( member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_219_1,axiom,
( ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_219_2,axiom,
( ~ member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_219]) ).
cnf(c_0_220_0,axiom,
( member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_220_1,axiom,
( ~ member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_220]) ).
cnf(c_0_221_0,axiom,
( member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_221_1,axiom,
( ~ member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_221]) ).
cnf(c_0_222_0,axiom,
( member(ordered_pair(X1,X2),compose(X3,X4))
| ~ member(X2,image(X3,image(X4,singleton(X1))))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_222_1,axiom,
( ~ member(X2,image(X3,image(X4,singleton(X1))))
| member(ordered_pair(X1,X2),compose(X3,X4))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_222_2,axiom,
( ~ member(X1,universal_class)
| ~ member(X2,image(X3,image(X4,singleton(X1))))
| member(ordered_pair(X1,X2),compose(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_222]) ).
cnf(c_0_223_0,axiom,
( member(ordered_pair(ordered_pair(X2,X1),X3),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_223_1,axiom,
( ~ member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
| member(ordered_pair(ordered_pair(X2,X1),X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_223]) ).
cnf(c_0_224_0,axiom,
( member(ordered_pair(ordered_pair(X2,X3),X1),X4)
| ~ member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_224]) ).
cnf(c_0_224_1,axiom,
( ~ member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
| member(ordered_pair(ordered_pair(X2,X3),X1),X4) ),
inference(literals_permutation,[status(thm)],[c_0_224]) ).
cnf(c_0_225_0,axiom,
( member(X2,image(X3,image(X4,singleton(X1))))
| ~ member(ordered_pair(X1,X2),compose(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_225_1,axiom,
( ~ member(ordered_pair(X1,X2),compose(X3,X4))
| member(X2,image(X3,image(X4,singleton(X1)))) ),
inference(literals_permutation,[status(thm)],[c_0_225]) ).
cnf(c_0_226_0,axiom,
( function(X1)
| ~ subclass(compose(X1,inverse(X1)),identity_relation)
| ~ subclass(X1,cross_product(universal_class,universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_226]) ).
cnf(c_0_226_1,axiom,
( ~ subclass(compose(X1,inverse(X1)),identity_relation)
| function(X1)
| ~ subclass(X1,cross_product(universal_class,universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_226]) ).
cnf(c_0_226_2,axiom,
( ~ subclass(X1,cross_product(universal_class,universal_class))
| ~ subclass(compose(X1,inverse(X1)),identity_relation)
| function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_226]) ).
cnf(c_0_227_0,axiom,
( ~ member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) != null_class ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_227_1,axiom,
( restrict(X2,singleton(X1),universal_class) != null_class
| ~ member(X1,domain_of(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_227]) ).
cnf(c_0_229_0,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_229]) ).
cnf(c_0_229_1,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_229]) ).
cnf(c_0_230_0,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_230]) ).
cnf(c_0_230_1,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_230]) ).
cnf(c_0_231_0,axiom,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),compose(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_231_1,axiom,
( ~ member(ordered_pair(X1,X2),compose(X3,X4))
| member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_231]) ).
cnf(c_0_232_0,axiom,
( member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X2,X4)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_232_1,axiom,
( ~ member(X2,X4)
| member(ordered_pair(X1,X2),cross_product(X3,X4))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_232_2,axiom,
( ~ member(X1,X3)
| ~ member(X2,X4)
| member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_232]) ).
cnf(c_0_233_0,axiom,
( member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_233_1,axiom,
( restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_233_2,axiom,
( ~ member(X1,universal_class)
| restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_233]) ).
cnf(c_0_235_0,axiom,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_235]) ).
cnf(c_0_235_1,axiom,
( member(X1,X3)
| member(X1,X2)
| ~ member(X1,union(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_235]) ).
cnf(c_0_235_2,axiom,
( ~ member(X1,union(X3,X2))
| member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_235]) ).
cnf(c_0_236_0,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_236]) ).
cnf(c_0_236_1,axiom,
( ~ member(X1,cross_product(X2,X3))
| ordered_pair(first(X1),second(X1)) = X1 ),
inference(literals_permutation,[status(thm)],[c_0_236]) ).
cnf(c_0_237_0,axiom,
( member(ordered_pair(X1,X2),successor_relation)
| successor(X1) != X2
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_237_1,axiom,
( successor(X1) != X2
| member(ordered_pair(X1,X2),successor_relation)
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_237_2,axiom,
( ~ member(X2,universal_class)
| successor(X1) != X2
| member(ordered_pair(X1,X2),successor_relation)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_237_3,axiom,
( ~ member(X1,universal_class)
| ~ member(X2,universal_class)
| successor(X1) != X2
| member(ordered_pair(X1,X2),successor_relation) ),
inference(literals_permutation,[status(thm)],[c_0_237]) ).
cnf(c_0_238_0,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_238]) ).
cnf(c_0_238_1,axiom,
( ~ member(X1,X3)
| member(X1,intersection(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_238]) ).
cnf(c_0_238_2,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_238]) ).
cnf(c_0_239_0,axiom,
( inductive(X1)
| ~ subclass(image(successor_relation,X1),X1)
| ~ member(null_class,X1) ),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_239_1,axiom,
( ~ subclass(image(successor_relation,X1),X1)
| inductive(X1)
| ~ member(null_class,X1) ),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_239_2,axiom,
( ~ member(null_class,X1)
| ~ subclass(image(successor_relation,X1),X1)
| inductive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_239]) ).
cnf(c_0_242_0,axiom,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(X1,X2)
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_242]) ).
cnf(c_0_242_1,axiom,
( ~ member(X1,X2)
| member(ordered_pair(X1,X2),element_relation)
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_242]) ).
cnf(c_0_242_2,axiom,
( ~ member(X2,universal_class)
| ~ member(X1,X2)
| member(ordered_pair(X1,X2),element_relation) ),
inference(literals_permutation,[status(thm)],[c_0_242]) ).
cnf(c_0_243_0,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_243]) ).
cnf(c_0_243_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_243]) ).
cnf(c_0_244_0,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_244]) ).
cnf(c_0_244_1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_244]) ).
cnf(c_0_245_0,axiom,
( subclass(X1,X2)
| ~ member(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_245]) ).
cnf(c_0_245_1,axiom,
( ~ member(sk1_esk1_2(X1,X2),X2)
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_245]) ).
cnf(c_0_246_0,axiom,
( member(X1,universal_class)
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_246]) ).
cnf(c_0_246_1,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_246]) ).
cnf(c_0_247_0,axiom,
( member(X1,X2)
| ~ member(ordered_pair(X1,X2),element_relation) ),
inference(literals_permutation,[status(thm)],[c_0_247]) ).
cnf(c_0_247_1,axiom,
( ~ member(ordered_pair(X1,X2),element_relation)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_247]) ).
cnf(c_0_248_0,axiom,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),successor_relation) ),
inference(literals_permutation,[status(thm)],[c_0_248]) ).
cnf(c_0_248_1,axiom,
( ~ member(ordered_pair(X1,X2),successor_relation)
| member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_248]) ).
cnf(c_0_249_0,axiom,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),successor_relation) ),
inference(literals_permutation,[status(thm)],[c_0_249]) ).
cnf(c_0_249_1,axiom,
( ~ member(ordered_pair(X1,X2),successor_relation)
| member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_249]) ).
cnf(c_0_250_0,axiom,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),element_relation) ),
inference(literals_permutation,[status(thm)],[c_0_250]) ).
cnf(c_0_250_1,axiom,
( ~ member(ordered_pair(X1,X2),element_relation)
| member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_250]) ).
cnf(c_0_251_0,axiom,
( member(X1,sk1_esk3_2(X1,X2))
| ~ member(X1,sum_class(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_251]) ).
cnf(c_0_251_1,axiom,
( ~ member(X1,sum_class(X2))
| member(X1,sk1_esk3_2(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_251]) ).
cnf(c_0_252_0,axiom,
( member(sk1_esk3_2(X1,X2),X2)
| ~ member(X1,sum_class(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_252]) ).
cnf(c_0_252_1,axiom,
( ~ member(X1,sum_class(X2))
| member(sk1_esk3_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_252]) ).
cnf(c_0_254_0,axiom,
( first(ordered_pair(X2,X1)) = X2
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_254]) ).
cnf(c_0_254_1,axiom,
( ~ member(X1,universal_class)
| first(ordered_pair(X2,X1)) = X2
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_254]) ).
cnf(c_0_254_2,axiom,
( ~ member(X2,universal_class)
| ~ member(X1,universal_class)
| first(ordered_pair(X2,X1)) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_254]) ).
cnf(c_0_255_0,axiom,
( second(ordered_pair(X2,X1)) = X1
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_255]) ).
cnf(c_0_255_1,axiom,
( ~ member(X1,universal_class)
| second(ordered_pair(X2,X1)) = X1
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_255]) ).
cnf(c_0_255_2,axiom,
( ~ member(X2,universal_class)
| ~ member(X1,universal_class)
| second(ordered_pair(X2,X1)) = X1 ),
inference(literals_permutation,[status(thm)],[c_0_255]) ).
cnf(c_0_256_0,axiom,
( ~ member(X1,X2)
| ~ member(X1,X3)
| ~ disjoint(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_256]) ).
cnf(c_0_256_1,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| ~ disjoint(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_256]) ).
cnf(c_0_256_2,axiom,
( ~ disjoint(X3,X2)
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_256]) ).
cnf(c_0_257_0,axiom,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_257]) ).
cnf(c_0_257_1,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_257]) ).
cnf(c_0_257_2,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X2
| X1 = X3 ),
inference(literals_permutation,[status(thm)],[c_0_257]) ).
cnf(c_0_258_0,axiom,
( member(image(X1,X2),universal_class)
| ~ function(X1)
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_258]) ).
cnf(c_0_258_1,axiom,
( ~ function(X1)
| member(image(X1,X2),universal_class)
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_258]) ).
cnf(c_0_258_2,axiom,
( ~ member(X2,universal_class)
| ~ function(X1)
| member(image(X1,X2),universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_258]) ).
cnf(c_0_259_0,axiom,
( successor(X1) = X2
| ~ member(ordered_pair(X1,X2),successor_relation) ),
inference(literals_permutation,[status(thm)],[c_0_259]) ).
cnf(c_0_259_1,axiom,
( ~ member(ordered_pair(X1,X2),successor_relation)
| successor(X1) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_259]) ).
cnf(c_0_260_0,axiom,
( member(X1,sum_class(X2))
| ~ member(X3,X2)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_260]) ).
cnf(c_0_260_1,axiom,
( ~ member(X3,X2)
| member(X1,sum_class(X2))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_260]) ).
cnf(c_0_260_2,axiom,
( ~ member(X1,X3)
| ~ member(X3,X2)
| member(X1,sum_class(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_260]) ).
cnf(c_0_261_0,axiom,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_261]) ).
cnf(c_0_261_1,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_261]) ).
cnf(c_0_261_2,axiom,
( X1 != X2
| ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_261]) ).
cnf(c_0_262_0,axiom,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_262]) ).
cnf(c_0_262_1,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
inference(literals_permutation,[status(thm)],[c_0_262]) ).
cnf(c_0_262_2,axiom,
( X1 != X3
| ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_262]) ).
cnf(c_0_263_0,axiom,
( member(X1,power_class(X2))
| ~ subclass(X1,X2)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_263]) ).
cnf(c_0_263_1,axiom,
( ~ subclass(X1,X2)
| member(X1,power_class(X2))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_263]) ).
cnf(c_0_263_2,axiom,
( ~ member(X1,universal_class)
| ~ subclass(X1,X2)
| member(X1,power_class(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_263]) ).
cnf(c_0_264_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_264]) ).
cnf(c_0_264_1,axiom,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_264]) ).
cnf(c_0_265_0,axiom,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_265]) ).
cnf(c_0_265_1,axiom,
( ~ member(X1,X3)
| member(X1,union(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_265]) ).
cnf(c_0_268_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_268_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ subclass(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_268_2,axiom,
( ~ subclass(X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_268]) ).
cnf(c_0_269_0,axiom,
( member(apply(sk1_esk7_0,X1),X1)
| X1 = null_class
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_269_1,axiom,
( X1 = null_class
| member(apply(sk1_esk7_0,X1),X1)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_269_2,axiom,
( ~ member(X1,universal_class)
| X1 = null_class
| member(apply(sk1_esk7_0,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_269]) ).
cnf(c_0_270_0,axiom,
( subclass(compose(X1,inverse(X1)),identity_relation)
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_270_1,axiom,
( ~ function(X1)
| subclass(compose(X1,inverse(X1)),identity_relation) ),
inference(literals_permutation,[status(thm)],[c_0_270]) ).
cnf(c_0_271_0,axiom,
( member(X1,identity_relation)
| X1 != ordered_pair(X2,X2)
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_271_1,axiom,
( X1 != ordered_pair(X2,X2)
| member(X1,identity_relation)
| ~ member(X2,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_271_2,axiom,
( ~ member(X2,universal_class)
| X1 != ordered_pair(X2,X2)
| member(X1,identity_relation) ),
inference(literals_permutation,[status(thm)],[c_0_271]) ).
cnf(c_0_273_0,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_273_1,axiom,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_273_2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_273]) ).
cnf(c_0_274_0,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_274_1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_274]) ).
cnf(c_0_275_0,axiom,
( disjoint(X1,X2)
| member(sk1_esk5_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_275]) ).
cnf(c_0_275_1,axiom,
( member(sk1_esk5_2(X1,X2),X1)
| disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_275]) ).
cnf(c_0_276_0,axiom,
( disjoint(X1,X2)
| member(sk1_esk5_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_276_1,axiom,
( member(sk1_esk5_2(X1,X2),X2)
| disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_276]) ).
cnf(c_0_277_0,axiom,
( subclass(X1,X2)
| member(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_277_1,axiom,
( member(sk1_esk1_2(X1,X2),X1)
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_277]) ).
cnf(c_0_278_0,axiom,
( ordered_pair(sk1_esk4_1(X1),sk1_esk4_1(X1)) = X1
| ~ member(X1,identity_relation) ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_278_1,axiom,
( ~ member(X1,identity_relation)
| ordered_pair(sk1_esk4_1(X1),sk1_esk4_1(X1)) = X1 ),
inference(literals_permutation,[status(thm)],[c_0_278]) ).
cnf(c_0_279_0,axiom,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_1,axiom,
( ~ subclass(X2,X1)
| X1 = X2
| ~ subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_279_2,axiom,
( ~ subclass(X1,X2)
| ~ subclass(X2,X1)
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_279]) ).
cnf(c_0_280_0,axiom,
( subclass(X1,X2)
| ~ member(X1,power_class(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_280]) ).
cnf(c_0_280_1,axiom,
( ~ member(X1,power_class(X2))
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_280]) ).
cnf(c_0_281_0,axiom,
( member(X1,universal_class)
| ~ member(X1,power_class(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_281_1,axiom,
( ~ member(X1,power_class(X2))
| member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_281]) ).
cnf(c_0_282_0,axiom,
( member(X1,universal_class)
| ~ member(X1,domain_of(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_282_1,axiom,
( ~ member(X1,domain_of(X2))
| member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_282]) ).
cnf(c_0_283_0,axiom,
( member(X1,universal_class)
| ~ member(X1,complement(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_283_1,axiom,
( ~ member(X1,complement(X2))
| member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_283]) ).
cnf(c_0_284_0,axiom,
( subclass(image(successor_relation,X1),X1)
| ~ inductive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_284_1,axiom,
( ~ inductive(X1)
| subclass(image(successor_relation,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_284]) ).
cnf(c_0_285_0,axiom,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_285_1,axiom,
( ~ function(X1)
| subclass(X1,cross_product(universal_class,universal_class)) ),
inference(literals_permutation,[status(thm)],[c_0_285]) ).
cnf(c_0_286_0,axiom,
( member(sk1_esk4_1(X1),universal_class)
| ~ member(X1,identity_relation) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_286_1,axiom,
( ~ member(X1,identity_relation)
| member(sk1_esk4_1(X1),universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_286]) ).
cnf(c_0_287_0,axiom,
( member(power_class(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_287_1,axiom,
( ~ member(X1,universal_class)
| member(power_class(X1),universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_287]) ).
cnf(c_0_288_0,axiom,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_288_1,axiom,
( ~ member(X1,universal_class)
| member(sum_class(X1),universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_288]) ).
cnf(c_0_293_0,axiom,
( X1 = null_class
| member(sk1_esk6_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_293_1,axiom,
( member(sk1_esk6_1(X1),X1)
| X1 = null_class ),
inference(literals_permutation,[status(thm)],[c_0_293]) ).
cnf(c_0_294_0,axiom,
( X1 = null_class
| disjoint(sk1_esk6_1(X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_294_1,axiom,
( disjoint(sk1_esk6_1(X1),X1)
| X1 = null_class ),
inference(literals_permutation,[status(thm)],[c_0_294]) ).
cnf(c_0_295_0,axiom,
( X1 = null_class
| member(sk1_esk6_1(X1),universal_class) ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_295_1,axiom,
( member(sk1_esk6_1(X1),universal_class)
| X1 = null_class ),
inference(literals_permutation,[status(thm)],[c_0_295]) ).
cnf(c_0_297_0,axiom,
( subclass(sk1_esk2_0,X1)
| ~ inductive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_297_1,axiom,
( ~ inductive(X1)
| subclass(sk1_esk2_0,X1) ),
inference(literals_permutation,[status(thm)],[c_0_297]) ).
cnf(c_0_298_0,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_298_1,axiom,
( ~ inductive(X1)
| member(null_class,X1) ),
inference(literals_permutation,[status(thm)],[c_0_298]) ).
cnf(c_0_300_0,axiom,
( subclass(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_300_1,axiom,
( X1 != X2
| subclass(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_300]) ).
cnf(c_0_301_0,axiom,
( subclass(X2,X1)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_301_1,axiom,
( X1 != X2
| subclass(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_301]) ).
cnf(c_0_296_0,axiom,
~ member(X1,null_class),
inference(literals_permutation,[status(thm)],[c_0_296]) ).
cnf(c_0_228_0,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
inference(literals_permutation,[status(thm)],[c_0_228]) ).
cnf(c_0_234_0,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
inference(literals_permutation,[status(thm)],[c_0_234]) ).
cnf(c_0_240_0,axiom,
subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
inference(literals_permutation,[status(thm)],[c_0_240]) ).
cnf(c_0_241_0,axiom,
subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class)),
inference(literals_permutation,[status(thm)],[c_0_241]) ).
cnf(c_0_253_0,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
inference(literals_permutation,[status(thm)],[c_0_253]) ).
cnf(c_0_266_0,axiom,
subclass(compose(X1,X2),cross_product(universal_class,universal_class)),
inference(literals_permutation,[status(thm)],[c_0_266]) ).
cnf(c_0_267_0,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inference(literals_permutation,[status(thm)],[c_0_267]) ).
cnf(c_0_272_0,axiom,
sum_class(image(X1,singleton(X2))) = apply(X1,X2),
inference(literals_permutation,[status(thm)],[c_0_272]) ).
cnf(c_0_289_0,axiom,
member(unordered_pair(X1,X2),universal_class),
inference(literals_permutation,[status(thm)],[c_0_289]) ).
cnf(c_0_290_0,axiom,
subclass(successor_relation,cross_product(universal_class,universal_class)),
inference(literals_permutation,[status(thm)],[c_0_290]) ).
cnf(c_0_291_0,axiom,
subclass(element_relation,cross_product(universal_class,universal_class)),
inference(literals_permutation,[status(thm)],[c_0_291]) ).
cnf(c_0_292_0,axiom,
union(X1,singleton(X1)) = successor(X1),
inference(literals_permutation,[status(thm)],[c_0_292]) ).
cnf(c_0_299_0,axiom,
unordered_pair(X1,X1) = singleton(X1),
inference(literals_permutation,[status(thm)],[c_0_299]) ).
cnf(c_0_302_0,axiom,
domain_of(inverse(X1)) = range_of(X1),
inference(literals_permutation,[status(thm)],[c_0_302]) ).
cnf(c_0_303_0,axiom,
subclass(X1,universal_class),
inference(literals_permutation,[status(thm)],[c_0_303]) ).
cnf(c_0_304_0,axiom,
member(sk1_esk2_0,universal_class),
inference(literals_permutation,[status(thm)],[c_0_304]) ).
cnf(c_0_305_0,axiom,
function(sk1_esk7_0),
inference(literals_permutation,[status(thm)],[c_0_305]) ).
cnf(c_0_306_0,axiom,
inductive(sk1_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_306]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1] :
( X1 = null_class
| ? [X2] : member(X2,X1) ),
file('<stdin>',null_class_is_unique) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1] :
( X1 = null_class
| ? [X2] : member(X2,X1) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
! [X4] :
( esk1_0 != null_class
& ~ member(X4,esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3_004,negated_conjecture,
~ member(X1,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
esk1_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
~ member(X1,esk1_0),
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
null_class != esk1_0,
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_185,negated_conjecture,
~ member(X0,sk2_esk1_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p',c_0_5) ).
cnf(c_261,negated_conjecture,
~ member(X0,sk2_esk1_0),
inference(copy,[status(esa)],[c_185]) ).
cnf(c_269,negated_conjecture,
~ member(X0,sk2_esk1_0),
inference(copy,[status(esa)],[c_261]) ).
cnf(c_272,negated_conjecture,
~ member(X0,sk2_esk1_0),
inference(copy,[status(esa)],[c_269]) ).
cnf(c_273,negated_conjecture,
~ member(X0,sk2_esk1_0),
inference(copy,[status(esa)],[c_272]) ).
cnf(c_824,plain,
~ member(X0,sk2_esk1_0),
inference(copy,[status(esa)],[c_273]) ).
cnf(c_56,plain,
( subclass(X0,X1)
| member(sk1_esk1_2(X0,X1),X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p',c_0_277_1) ).
cnf(c_566,plain,
( subclass(X0,X1)
| member(sk1_esk1_2(X0,X1),X0) ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_567,plain,
( member(sk1_esk1_2(X0,X1),X0)
| subclass(X0,X1) ),
inference(rewriting,[status(thm)],[c_566]) ).
cnf(c_832,plain,
subclass(sk2_esk1_0,X0),
inference(resolution,[status(thm)],[c_824,c_567]) ).
cnf(c_833,plain,
subclass(sk2_esk1_0,X0),
inference(rewriting,[status(thm)],[c_832]) ).
cnf(c_51,plain,
( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p',c_0_279_2) ).
cnf(c_556,plain,
( X0 = X1
| ~ subclass(X1,X0)
| ~ subclass(X0,X1) ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_557,plain,
( ~ subclass(X0,X1)
| ~ subclass(X1,X0)
| X1 = X0 ),
inference(rewriting,[status(thm)],[c_556]) ).
cnf(c_848,plain,
( ~ subclass(X0,sk2_esk1_0)
| X0 = sk2_esk1_0 ),
inference(resolution,[status(thm)],[c_833,c_557]) ).
cnf(c_849,plain,
( ~ subclass(X0,sk2_esk1_0)
| X0 = sk2_esk1_0 ),
inference(rewriting,[status(thm)],[c_848]) ).
cnf(c_186,negated_conjecture,
null_class != sk2_esk1_0,
file('/export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p',c_0_6) ).
cnf(c_263,negated_conjecture,
null_class != sk2_esk1_0,
inference(copy,[status(esa)],[c_186]) ).
cnf(c_270,negated_conjecture,
null_class != sk2_esk1_0,
inference(copy,[status(esa)],[c_263]) ).
cnf(c_271,negated_conjecture,
null_class != sk2_esk1_0,
inference(copy,[status(esa)],[c_270]) ).
cnf(c_274,negated_conjecture,
null_class != sk2_esk1_0,
inference(copy,[status(esa)],[c_271]) ).
cnf(c_826,negated_conjecture,
null_class != sk2_esk1_0,
inference(copy,[status(esa)],[c_274]) ).
cnf(c_918,plain,
~ subclass(null_class,sk2_esk1_0),
inference(resolution,[status(thm)],[c_849,c_826]) ).
cnf(c_919,plain,
~ subclass(null_class,sk2_esk1_0),
inference(rewriting,[status(thm)],[c_918]) ).
cnf(c_31,plain,
( X0 = null_class
| member(sk1_esk6_1(X0),X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p',c_0_293_1) ).
cnf(c_516,plain,
( X0 = null_class
| member(sk1_esk6_1(X0),X0) ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_517,plain,
( member(sk1_esk6_1(X0),X0)
| X0 = null_class ),
inference(rewriting,[status(thm)],[c_516]) ).
cnf(c_830,plain,
sk2_esk1_0 = null_class,
inference(resolution,[status(thm)],[c_824,c_517]) ).
cnf(c_831,plain,
sk2_esk1_0 = null_class,
inference(rewriting,[status(thm)],[c_830]) ).
cnf(c_19,plain,
( subclass(X0,X1)
| X1 != X0 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p',c_0_301_1) ).
cnf(c_492,plain,
( subclass(X0,X1)
| X1 != X0 ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_870,plain,
subclass(null_class,sk2_esk1_0),
inference(resolution,[status(thm)],[c_831,c_492]) ).
cnf(c_871,plain,
subclass(null_class,sk2_esk1_0),
inference(rewriting,[status(thm)],[c_870]) ).
cnf(c_921,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_919,c_871]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET064+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n007.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 13:29:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % FOF problem with conjecture
% 0.20/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_e7c32d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_c0e4ad | 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.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_e7c32d.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...%
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 35
% 0.20/0.43 % num_of_input_neg_conjectures: 0
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 0
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 0
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % uFatal error: exception Failure("Parse error in: /export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p line: 38 near token: '!='")
% 0.20/0.43 nif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.019
% 0.20/0.43 % num_of_symbols: 57
% 0.20/0.43 % num_of_terms: 121
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 0
% 0.20/0.43 % prop_fast_solver_calls: 0
% 0.20/0.43 % prop_num_of_clauses: 0
% 0.20/0.43 % prop_preprocess_simplified: 0
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: undef
% 0.20/0.43 % inst_num_in_passive: undef
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 0
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: undef
% 0.20/0.43 % res_num_in_passive: undef
% 0.20/0.43 % res_num_in_active: 0
% 0.20/0.43 % res_num_of_loops: 0
% 0.20/0.43 % res_forward_subset_subsumed: 0
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 0
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 0
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 0
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 0
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unknown
% 0.20/0.48 % Orienting using strategy ClausalAll
% 0.20/0.48 % FOF problem with conjecture
% 0.20/0.48 % 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_e7c32d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_2693e3.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_0df5d2 | grep -v "SZS"
% 0.20/0.50
% 0.20/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ iProver source info
% 0.20/0.50
% 0.20/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.50 % git: non_committed_changes: true
% 0.20/0.50 % git: last_make_outside_of_git: true
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.62/0.90 % --bmc1_dump_unsat_core_tptp false
% 0.62/0.90 % --bmc1_dump_file -
% 0.62/0.90 % --bmc1_ucm_expand_uc_limit 128
% 0.62/0.90 % --bmc1_ucm_n_expand_iterations 6
% 0.62/0.90 % --bmc1_ucm_extend_mode 1
% 0.62/0.90 % --bmc1_ucm_init_mode 2
% 0.62/0.90 % --bmc1_ucm_cone_mode none
% 0.62/0.90 % --bmc1_ucm_reduced_relation_type 0
% 0.62/0.90 % --bmc1_ucm_relax_model 4
% 0.62/0.90 % --bmc1_ucm_full_tr_after_sat true
% 0.62/0.90 % --bmc1_ucm_expand_neg_assumptions false
% 0.62/0.90 % --bmc1_ucm_layered_model none
% 0.62/0.90 % --bmc1_ucm_max_lemma_size 10
% 0.62/0.90
% 0.62/0.90 % ------ AIG Options
% 0.62/0.90
% 0.62/0.90 % --aig_mode false
% 0.62/0.90
% 0.62/0.90 % ------ Instantiation Options
% 0.62/0.90
% 0.62/0.90 % --instantiation_flag true
% 0.62/0.90 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.62/0.90 % --inst_solver_per_active 750
% 0.62/0.90 % --inst_solver_calls_frac 0.5
% 0.62/0.90 % --inst_passive_queue_type priority_queues
% 0.62/0.90 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.62/0.90 % --inst_passive_queues_freq [25;2]
% 0.62/0.90 % --inst_dismatching true
% 0.62/0.90 % --inst_eager_unprocessed_to_passive true
% 0.62/0.90 % --inst_prop_sim_given true
% 0.62/0.90 % --inst_prop_sim_new false
% 0.62/0.90 % --inst_orphan_elimination true
% 0.62/0.90 % --inst_learning_loop_flag true
% 0.62/0.90 % --inst_learning_start 3000
% 0.62/0.90 % --inst_learning_factor 2
% 0.62/0.90 % --inst_start_prop_sim_after_learn 3
% 0.62/0.90 % --inst_sel_renew solver
% 0.62/0.90 % --inst_lit_activity_flag true
% 0.62/0.90 % --inst_out_proof true
% 0.62/0.90
% 0.62/0.90 % ------ Resolution Options
% 0.62/0.90
% 0.62/0.90 % --resolution_flag true
% 0.62/0.90 % --res_lit_sel kbo_max
% 0.62/0.90 % --res_to_prop_solver none
% 0.62/0.90 % --res_prop_simpl_new false
% 0.62/0.90 % --res_prop_simpl_given false
% 0.62/0.90 % --res_passive_queue_type priority_queues
% 0.62/0.90 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.62/0.90 % --res_passive_queues_freq [15;5]
% 0.62/0.90 % --res_forward_subs full
% 0.62/0.90 % --res_backward_subs full
% 0.62/0.90 % --res_forward_subs_resolution true
% 0.62/0.90 % --res_backward_subs_resolution true
% 0.62/0.90 % --res_orphan_elimination false
% 0.62/0.90 % --res_time_limit 1000.
% 0.62/0.90 % --res_out_proof true
% 0.62/0.90 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_e7c32d.s
% 0.62/0.90 % --modulo true
% 0.62/0.90
% 0.62/0.90 % ------ Combination Options
% 0.62/0.90
% 0.62/0.90 % --comb_res_mult 1000
% 0.62/0.90 % --comb_inst_mult 300
% 0.62/0.90 % ------
% 0.62/0.90
% 0.62/0.90 % ------ Parsing...% successful
% 0.62/0.90
% 0.62/0.90 % ------ 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.62/0.90
% 0.62/0.90 % ------ Proving...
% 0.62/0.90 % ------ Problem Properties
% 0.62/0.90
% 0.62/0.90 %
% 0.62/0.90 % EPR false
% 0.62/0.90 % Horn false
% 0.62/0.90 % Has equality true
% 0.62/0.90
% 0.62/0.90 % % ------ Input Options Time Limit: Unbounded
% 0.62/0.90
% 0.62/0.90
% 0.62/0.90 Compiling...
% 0.62/0.90 Loading plugin: done.
% 0.62/0.90 Compiling...
% 0.62/0.90 Loading plugin: done.
% 0.62/0.90 Compiling...
% 0.62/0.90 Loading plugin: done.
% 0.62/0.90 Compiling...
% 0.62/0.90 Loading plugin: done.
% 0.62/0.90 % % ------ Current options:
% 0.62/0.90
% 0.62/0.90 % ------ Input Options
% 0.62/0.90
% 0.62/0.90 % --out_options all
% 0.62/0.90 % --tptp_safe_out true
% 0.62/0.90 % --problem_path ""
% 0.62/0.90 % --include_path ""
% 0.62/0.90 % --clausifier .//eprover
% 0.62/0.90 % --clausifier_options --tstp-format
% 0.62/0.90 % --stdin false
% 0.62/0.90 % --dbg_backtrace false
% 0.62/0.90 % --dbg_dump_prop_clauses false
% 0.62/0.90 % --dbg_dump_prop_clauses_file -
% 0.62/0.90 % --dbg_out_stat false
% 0.62/0.90
% 0.62/0.90 % ------ General Options
% 0.62/0.90
% 0.62/0.90 % --fof false
% 0.62/0.90 % --time_out_real 150.
% 0.62/0.90 % --time_out_prep_mult 0.2
% 0.62/0.90 % --time_out_virtual -1.
% 0.62/0.90 % --schedule none
% 0.62/0.90 % --ground_splitting input
% 0.62/0.90 % --splitting_nvd 16
% 0.62/0.90 % --non_eq_to_eq false
% 0.62/0.90 % --prep_gs_sim true
% 0.62/0.90 % --prep_unflatten false
% 0.62/0.90 % --prep_res_sim true
% 0.62/0.90 % --prep_upred true
% 0.62/0.90 % --res_sim_input true
% 0.62/0.90 % --clause_weak_htbl true
% 0.62/0.90 % --gc_record_bc_elim false
% 0.62/0.90 % --symbol_type_check false
% 0.62/0.90 % --clausify_out false
% 0.62/0.90 % --large_theory_mode false
% 0.62/0.90 % --prep_sem_filter none
% 0.62/0.90 % --prep_sem_filter_out false
% 0.62/0.90 % --preprocessed_out false
% 0.62/0.90 % --sub_typing false
% 0.62/0.90 % --brand_transform false
% 0.62/0.90 % --pure_diseq_elim true
% 0.62/0.90 % --min_unsat_core false
% 0.62/0.90 % --pred_elim true
% 0.62/0.90 % --add_important_lit false
% 0.62/0.90 % --soft_assumptions false
% 0.62/0.90 % --reset_solvers false
% 0.62/0.90 % --bc_imp_inh []
% 0.62/0.90 % --conj_cone_tolerance 1.5
% 0.62/0.90 % --prolific_symb_bound 500
% 0.62/0.90 % --lt_threshold 2000
% 0.62/0.90
% 0.62/0.90 % ------ SAT Options
% 0.62/0.90
% 0.62/0.90 % --sat_mode false
% 0.62/0.90 % --sat_fm_restart_options ""
% 0.62/0.90 % --sat_gr_def false
% 0.62/0.90 % --sat_epr_types true
% 0.62/0.90 % --sat_non_cyclic_types false
% 0.62/0.90 % --sat_finite_models false
% 0.62/0.90 % --sat_fm_lemmas false
% 0.62/0.90 % --sat_fm_prep false
% 0.62/0.90 % --sat_fm_uc_incr true
% 0.62/0.90 % --sat_out_model small
% 0.62/0.90 % --sat_out_clauses false
% 0.62/0.90
% 0.62/0.90 % ------ QBF Options
% 0.62/0.90
% 0.62/0.90 % --qbf_mode false
% 0.62/0.90 % --qbf_elim_univ true
% 0.62/0.90 % --qbf_sk_in true
% 0.62/0.90 % --qbf_pred_elim true
% 0.62/0.90 % --qbf_split 32
% 0.62/0.90
% 0.62/0.90 % ------ BMC1 Options
% 0.62/0.90
% 0.62/0.90 % --bmc1_incremental false
% 0.62/0.90 % --bmc1_axioms reachable_all
% 0.62/0.90 % --bmc1_min_bound 0
% 0.62/0.90 % --bmc1_max_bound -1
% 0.62/0.90 % --bmc1_max_bound_default -1
% 0.62/0.90 % --bmc1_symbol_reachability true
% 0.62/0.90 % --bmc1_property_lemmas false
% 0.62/0.90 % --bmc1_k_induction false
% 0.62/0.90 % --bmc1_non_equiv_states false
% 0.62/0.90 % --bmc1_deadlock false
% 0.62/0.90 % --bmc1_ucm false
% 0.62/0.90 % --bmc1_add_unsat_core none
% 0.62/0.90 % --bmc1_unsat_core_children false
% 0.62/0.90 % --bmc1_unsat_core_extrapolate_axioms false
% 0.62/0.90 % --bmc1_out_stat full
% 0.62/0.90 % --bmc1_ground_init false
% 0.62/0.90 % --bmc1_pre_inst_next_state false
% 0.62/0.90 % --bmc1_pre_inst_state false
% 0.62/0.90 % --bmc1_pre_inst_reach_state false
% 0.62/0.90 % --bmc1_out_unsat_core false
% 0.62/0.90 % --bmc1_aig_witness_out false
% 0.62/0.90 % --bmc1_verbose false
% 0.62/0.90 % --bmc1_dump_clauses_tptp false
% 0.62/0.90 % --bmc1_dump_unsat_core_tptp false
% 0.62/0.90 % --bmc1_dump_file -
% 0.62/0.90 % --bmc1_ucm_expand_uc_limit 128
% 0.62/0.90 % --bmc1_ucm_n_expand_iterations 6
% 0.62/0.90 % --bmc1_ucm_extend_mode 1
% 0.62/0.90 % --bmc1_ucm_init_mode 2
% 0.62/0.90 % --bmc1_ucm_cone_mode none
% 0.62/0.90 % --bmc1_ucm_reduced_relation_type 0
% 0.62/0.90 % --bmc1_ucm_relax_model 4
% 0.62/0.90 % --bmc1_ucm_full_tr_after_sat true
% 0.62/0.90 % --bmc1_ucm_expand_neg_assumptions false
% 0.62/0.90 % --bmc1_ucm_layered_model none
% 0.62/0.90 % --bmc1_ucm_max_lemma_size 10
% 0.62/0.90
% 0.62/0.90 % ------ AIG Options
% 0.62/0.90
% 0.62/0.90 % --aig_mode false
% 0.62/0.90
% 0.62/0.90 % ------ Instantiation Options
% 0.62/0.90
% 0.62/0.90 % --instantiation_flag true
% 0.62/0.90 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.62/0.90 % --inst_solver_per_active 750
% 0.62/0.90 % --inst_solver_calls_frac 0.5
% 0.62/0.90 % --inst_passive_queue_type priority_queues
% 0.62/0.90 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.62/0.90 % --inst_passive_queues_freq [25;2]
% 0.62/0.91 % --inst_dismatching true
% 0.62/0.91 % --inst_eager_unprocessed_to_passive true
% 0.62/0.91 % --inst_prop_sim_given true
% 0.62/0.91 % --inst_prop_sim_new false
% 0.62/0.91 % --inst_orphan_elimination true
% 0.62/0.91 % --inst_learning_loop_flag true
% 0.62/0.91 % --inst_learning_start 3000
% 0.62/0.91 % --inst_learning_factor 2
% 0.62/0.91 % --inst_start_prop_sim_after_learn 3
% 0.62/0.91 % --inst_sel_renew solver
% 0.62/0.91 % --inst_lit_activity_flag true
% 0.62/0.91 % --inst_out_proof true
% 0.62/0.91
% 0.62/0.91 % ------ Resolution Options
% 0.62/0.91
% 0.62/0.91 % --resolution_flag true
% 0.62/0.91 % --res_lit_sel kbo_max
% 0.62/0.91 % --res_to_prop_solver none
% 0.62/0.91 % --res_prop_simpl_new false
% 0.62/0.91 % --res_prop_simpl_given false
% 0.62/0.91 % --res_passive_queue_type priority_queues
% 0.62/0.91 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.62/0.91 % --res_passive_queues_freq [15;5]
% 0.62/0.91 % --res_forward_subs full
% 0.62/0.91 % --res_backward_subs full
% 0.62/0.91 % --res_forward_subs_resolution true
% 0.62/0.91 % --res_backward_subs_resolution true
% 0.62/0.91 % --res_orphan_elimination false
% 0.62/0.91 % --res_time_limit 1000.
% 0.62/0.91 % --res_out_proof true
% 0.62/0.91 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_e7c32d.s
% 0.62/0.91 % --modulo true
% 0.62/0.91
% 0.62/0.91 % ------ Combination Options
% 0.62/0.91
% 0.62/0.91 % --comb_res_mult 1000
% 0.62/0.91 % --comb_inst_mult 300
% 0.62/0.91 % ------
% 0.62/0.91
% 0.62/0.91
% 0.62/0.91
% 0.62/0.91 % ------ Proving...
% 0.62/0.91 %
% 0.62/0.91
% 0.62/0.91
% 0.62/0.91 % Resolution empty clause
% 0.62/0.91
% 0.62/0.91 % ------ Statistics
% 0.62/0.91
% 0.62/0.91 % ------ General
% 0.62/0.91
% 0.62/0.91 % num_of_input_clauses: 187
% 0.62/0.91 % num_of_input_neg_conjectures: 2
% 0.62/0.91 % num_of_splits: 0
% 0.62/0.91 % num_of_split_atoms: 0
% 0.62/0.91 % num_of_sem_filtered_clauses: 0
% 0.62/0.91 % num_of_subtypes: 0
% 0.62/0.91 % monotx_restored_types: 0
% 0.62/0.91 % sat_num_of_epr_types: 0
% 0.62/0.91 % sat_num_of_non_cyclic_types: 0
% 0.62/0.91 % sat_guarded_non_collapsed_types: 0
% 0.62/0.91 % is_epr: 0
% 0.62/0.91 % is_horn: 0
% 0.62/0.91 % has_eq: 1
% 0.62/0.91 % num_pure_diseq_elim: 0
% 0.62/0.91 % simp_replaced_by: 0
% 0.62/0.91 % res_preprocessed: 4
% 0.62/0.91 % prep_upred: 0
% 0.62/0.91 % prep_unflattend: 0
% 0.62/0.91 % pred_elim_cands: 0
% 0.62/0.91 % pred_elim: 0
% 0.62/0.91 % pred_elim_cl: 0
% 0.62/0.91 % pred_elim_cycles: 0
% 0.62/0.91 % forced_gc_time: 0
% 0.62/0.91 % gc_basic_clause_elim: 0
% 0.62/0.91 % parsing_time: 0.007
% 0.62/0.91 % sem_filter_time: 0.
% 0.62/0.91 % pred_elim_time: 0.
% 0.62/0.91 % out_proof_time: 0.
% 0.62/0.91 % monotx_time: 0.
% 0.62/0.91 % subtype_inf_time: 0.
% 0.62/0.91 % unif_index_cands_time: 0.
% 0.62/0.91 % unif_index_add_time: 0.
% 0.62/0.91 % total_time: 0.419
% 0.62/0.91 % num_of_symbols: 64
% 0.62/0.91 % num_of_terms: 489
% 0.62/0.91
% 0.62/0.91 % ------ Propositional Solver
% 0.62/0.91
% 0.62/0.91 % prop_solver_calls: 1
% 0.62/0.91 % prop_fast_solver_calls: 6
% 0.62/0.91 % prop_num_of_clauses: 186
% 0.62/0.91 % prop_preprocess_simplified: 574
% 0.62/0.91 % prop_fo_subsumed: 0
% 0.62/0.91 % prop_solver_time: 0.
% 0.62/0.91 % prop_fast_solver_time: 0.
% 0.62/0.91 % prop_unsat_core_time: 0.
% 0.62/0.91
% 0.62/0.91 % ------ QBF
% 0.62/0.91
% 0.62/0.91 % qbf_q_res: 0
% 0.62/0.91 % qbf_num_tautologies: 0
% 0.62/0.91 % qbf_prep_cycles: 0
% 0.62/0.91
% 0.62/0.91 % ------ BMC1
% 0.62/0.91
% 0.62/0.91 % bmc1_current_bound: -1
% 0.62/0.91 % bmc1_last_solved_bound: -1
% 0.62/0.91 % bmc1_unsat_core_size: -1
% 0.62/0.91 % bmc1_unsat_core_parents_size: -1
% 0.62/0.91 % bmc1_merge_next_fun: 0
% 0.62/0.91 % bmc1_unsat_core_clauses_time: 0.
% 0.62/0.91
% 0.62/0.91 % ------ Instantiation
% 0.62/0.91
% 0.62/0.91 % inst_num_of_clauses: 187
% 0.62/0.91 % inst_num_in_passive: 0
% 0.62/0.91 % inst_num_in_active: 0
% 0.62/0.91 % inst_num_in_unprocessed: 187
% 0.62/0.91 % inst_num_of_loops: 0
% 0.62/0.91 % inst_num_of_learning_restarts: 0
% 0.62/0.91 % inst_num_moves_active_passive: 0
% 0.62/0.91 % inst_lit_activity: 0
% 0.62/0.91 % inst_lit_activity_moves: 0
% 0.62/0.91 % inst_num_tautologies: 0
% 0.62/0.91 % inst_num_prop_implied: 0
% 0.62/0.91 % inst_num_existing_simplified: 0
% 0.62/0.91 % inst_num_eq_res_simplified: 0
% 0.62/0.91 % inst_num_child_elim: 0
% 0.62/0.91 % inst_num_of_dismatching_blockings: 0
% 0.62/0.91 % inst_num_of_non_proper_insts: 0
% 0.62/0.91 % inst_num_of_duplicates: 0
% 0.62/0.91 % inst_inst_num_from_inst_to_res: 0
% 0.62/0.91 % inst_dismatching_checking_time: 0.
% 0.62/0.91
% 0.62/0.91 % ------ Resolution
% 0.62/0.91
% 0.62/0.91 % res_num_of_clauses: 226
% 0.62/0.91 % res_num_in_passive: 13
% 0.62/0.91 % res_num_in_active: 102
% 0.62/0.91 % res_num_of_loops: 12
% 0.62/0.91 % res_forward_subset_subsumed: 94
% 0.62/0.91 % res_backward_subset_subsumed: 0
% 0.62/0.91 % res_forward_subsumed: 1
% 0.62/0.91 % res_backward_subsumed: 0
% 0.62/0.91 % res_forward_subsumption_resolution: 1
% 0.62/0.91 % res_backward_subsumption_resolution: 0
% 0.62/0.91 % res_clause_to_clause_subsumption: 11
% 0.62/0.91 % res_orphan_elimination: 0
% 0.62/0.91 % res_tautology_del: 1
% 0.62/0.91 % res_num_eq_res_simplified: 0
% 0.62/0.91 % res_num_sel_changes: 0
% 0.62/0.91 % res_moves_from_active_to_pass: 0
% 0.62/0.91
% 0.62/0.91 % Status Unsatisfiable
% 0.62/0.91 % SZS status Theorem
% 0.62/0.91 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------