TSTP Solution File: SEU325+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU325+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 03:33:23 EST 2010
% Result : Theorem 46.14s
% Output : Solution 46.14s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP30779/SEU325+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30779/SEU325+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30779/SEU325+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 30875
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.73 CPU 2.02 WC
% PrfWatch: 3.32 CPU 4.11 WC
% PrfWatch: 5.27 CPU 6.12 WC
% PrfWatch: 7.26 CPU 8.12 WC
% PrfWatch: 9.25 CPU 10.13 WC
% PrfWatch: 11.25 CPU 12.13 WC
% PrfWatch: 13.24 CPU 14.14 WC
% PrfWatch: 15.23 CPU 16.14 WC
% PrfWatch: 17.23 CPU 18.15 WC
% PrfWatch: 19.21 CPU 20.15 WC
% PrfWatch: 21.21 CPU 22.16 WC
% PrfWatch: 23.20 CPU 24.16 WC
% # Preprocessing time : 0.242 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 25.20 CPU 26.17 WC
% PrfWatch: 27.19 CPU 28.17 WC
% PrfWatch: 29.18 CPU 30.18 WC
% # SZS output start CNFRefutation.
% fof(12, axiom,![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>(is_a_cover_of_carrier(X1,X2)<=>cast_as_carrier_subset(X1)=union_of_subsets(the_carrier(X1),X2)))),file('/tmp/SRASS.s.p', d8_pre_topc)).
% fof(26, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(29, axiom,![X1]:(subset(X1,empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', t3_xboole_1)).
% fof(31, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(34, axiom,![X1]:element(cast_to_subset(X1),powerset(X1)),file('/tmp/SRASS.s.p', dt_k2_subset_1)).
% fof(35, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>element(subset_complement(X1,X2),powerset(X1))),file('/tmp/SRASS.s.p', dt_k3_subset_1)).
% fof(36, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>element(union_of_subsets(X1,X2),powerset(X1))),file('/tmp/SRASS.s.p', dt_k5_setfam_1)).
% fof(42, axiom,![X1]:set_intersection2(X1,empty_set)=empty_set,file('/tmp/SRASS.s.p', t2_boole)).
% fof(43, axiom,![X1]:set_difference(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t3_boole)).
% fof(54, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(57, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>union_of_subsets(X1,X2)=union(X2)),file('/tmp/SRASS.s.p', redefinition_k5_setfam_1)).
% fof(67, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(cast_as_carrier_subset(X1)))),file('/tmp/SRASS.s.p', fc2_pre_topc)).
% fof(147, axiom,![X1]:(relation(X1)=>((relation_dom(X1)=empty_set|relation_rng(X1)=empty_set)=>X1=empty_set)),file('/tmp/SRASS.s.p', t64_relat_1)).
% fof(216, axiom,![X1]:cast_to_subset(X1)=X1,file('/tmp/SRASS.s.p', d4_subset_1)).
% fof(234, axiom,![X1]:![X2]:set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2),file('/tmp/SRASS.s.p', t48_xboole_1)).
% fof(394, axiom,![X1]:(empty(X1)=>(empty(relation_dom(X1))&relation(relation_dom(X1)))),file('/tmp/SRASS.s.p', fc7_relat_1)).
% fof(447, axiom,![X1]:?[X2]:(((relation(X2)&function(X2))&relation_dom(X2)=X1)&![X3]:(in(X3,X1)=>apply(X2,X3)=singleton(X3))),file('/tmp/SRASS.s.p', s3_funct_1__e16_22__wellord2)).
% fof(497, axiom,?[X1]:((((((relation(X1)&function(X1))&one_to_one(X1))&empty(X1))&epsilon_transitive(X1))&epsilon_connected(X1))&ordinal(X1)),file('/tmp/SRASS.s.p', rc2_ordinal1)).
% fof(538, conjecture,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>~((is_a_cover_of_carrier(X1,X2)&X2=empty_set)))),file('/tmp/SRASS.s.p', t5_tops_2)).
% fof(539, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>~((is_a_cover_of_carrier(X1,X2)&X2=empty_set))))),inference(assume_negation,[status(cth)],[538])).
% fof(553, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(cast_as_carrier_subset(X1)))),inference(fof_simplification,[status(thm)],[67,theory(equality)])).
% fof(615, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>~((is_a_cover_of_carrier(X1,X2)&X2=empty_set))))),inference(fof_simplification,[status(thm)],[539,theory(equality)])).
% fof(661, plain,![X1]:(~(one_sorted_str(X1))|![X2]:(~(element(X2,powerset(powerset(the_carrier(X1)))))|((~(is_a_cover_of_carrier(X1,X2))|cast_as_carrier_subset(X1)=union_of_subsets(the_carrier(X1),X2))&(~(cast_as_carrier_subset(X1)=union_of_subsets(the_carrier(X1),X2))|is_a_cover_of_carrier(X1,X2))))),inference(fof_nnf,[status(thm)],[12])).
% fof(662, plain,![X3]:(~(one_sorted_str(X3))|![X4]:(~(element(X4,powerset(powerset(the_carrier(X3)))))|((~(is_a_cover_of_carrier(X3,X4))|cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))&(~(cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))|is_a_cover_of_carrier(X3,X4))))),inference(variable_rename,[status(thm)],[661])).
% fof(663, plain,![X3]:![X4]:((~(element(X4,powerset(powerset(the_carrier(X3)))))|((~(is_a_cover_of_carrier(X3,X4))|cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))&(~(cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))|is_a_cover_of_carrier(X3,X4))))|~(one_sorted_str(X3))),inference(shift_quantors,[status(thm)],[662])).
% fof(664, plain,![X3]:![X4]:((((~(is_a_cover_of_carrier(X3,X4))|cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))|~(element(X4,powerset(powerset(the_carrier(X3))))))|~(one_sorted_str(X3)))&(((~(cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))|is_a_cover_of_carrier(X3,X4))|~(element(X4,powerset(powerset(the_carrier(X3))))))|~(one_sorted_str(X3)))),inference(distribute,[status(thm)],[663])).
% cnf(666,plain,(cast_as_carrier_subset(X1)=union_of_subsets(the_carrier(X1),X2)|~one_sorted_str(X1)|~element(X2,powerset(powerset(the_carrier(X1))))|~is_a_cover_of_carrier(X1,X2)),inference(split_conjunct,[status(thm)],[664])).
% fof(716, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[26])).
% fof(717, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[716])).
% cnf(719,plain,(subset(X1,X2)|~element(X1,powerset(X2))),inference(split_conjunct,[status(thm)],[717])).
% fof(730, plain,![X1]:(~(subset(X1,empty_set))|X1=empty_set),inference(fof_nnf,[status(thm)],[29])).
% fof(731, plain,![X2]:(~(subset(X2,empty_set))|X2=empty_set),inference(variable_rename,[status(thm)],[730])).
% cnf(732,plain,(X1=empty_set|~subset(X1,empty_set)),inference(split_conjunct,[status(thm)],[731])).
% fof(737, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[31])).
% fof(738, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[737])).
% cnf(739,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[738])).
% fof(748, plain,![X2]:element(cast_to_subset(X2),powerset(X2)),inference(variable_rename,[status(thm)],[34])).
% cnf(749,plain,(element(cast_to_subset(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[748])).
% fof(750, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|element(subset_complement(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[35])).
% fof(751, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|element(subset_complement(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[750])).
% cnf(752,plain,(element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[751])).
% fof(753, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|element(union_of_subsets(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[36])).
% fof(754, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|element(union_of_subsets(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[753])).
% cnf(755,plain,(element(union_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[754])).
% fof(770, plain,![X2]:set_intersection2(X2,empty_set)=empty_set,inference(variable_rename,[status(thm)],[42])).
% cnf(771,plain,(set_intersection2(X1,empty_set)=empty_set),inference(split_conjunct,[status(thm)],[770])).
% fof(772, plain,![X2]:set_difference(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[43])).
% cnf(773,plain,(set_difference(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[772])).
% fof(806, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[54])).
% fof(807, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[806])).
% cnf(808,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[807])).
% fof(815, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|union_of_subsets(X1,X2)=union(X2)),inference(fof_nnf,[status(thm)],[57])).
% fof(816, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|union_of_subsets(X3,X4)=union(X4)),inference(variable_rename,[status(thm)],[815])).
% cnf(817,plain,(union_of_subsets(X1,X2)=union(X2)|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[816])).
% fof(846, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|~(empty(cast_as_carrier_subset(X1)))),inference(fof_nnf,[status(thm)],[553])).
% fof(847, plain,![X2]:((empty_carrier(X2)|~(one_sorted_str(X2)))|~(empty(cast_as_carrier_subset(X2)))),inference(variable_rename,[status(thm)],[846])).
% cnf(848,plain,(empty_carrier(X1)|~empty(cast_as_carrier_subset(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[847])).
% fof(1377, plain,![X1]:(~(relation(X1))|((~(relation_dom(X1)=empty_set)&~(relation_rng(X1)=empty_set))|X1=empty_set)),inference(fof_nnf,[status(thm)],[147])).
% fof(1378, plain,![X2]:(~(relation(X2))|((~(relation_dom(X2)=empty_set)&~(relation_rng(X2)=empty_set))|X2=empty_set)),inference(variable_rename,[status(thm)],[1377])).
% fof(1379, plain,![X2]:(((~(relation_dom(X2)=empty_set)|X2=empty_set)|~(relation(X2)))&((~(relation_rng(X2)=empty_set)|X2=empty_set)|~(relation(X2)))),inference(distribute,[status(thm)],[1378])).
% cnf(1381,plain,(X1=empty_set|~relation(X1)|relation_dom(X1)!=empty_set),inference(split_conjunct,[status(thm)],[1379])).
% fof(1960, plain,![X2]:cast_to_subset(X2)=X2,inference(variable_rename,[status(thm)],[216])).
% cnf(1961,plain,(cast_to_subset(X1)=X1),inference(split_conjunct,[status(thm)],[1960])).
% fof(2270, plain,![X3]:![X4]:set_difference(X3,set_difference(X3,X4))=set_intersection2(X3,X4),inference(variable_rename,[status(thm)],[234])).
% cnf(2271,plain,(set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2)),inference(split_conjunct,[status(thm)],[2270])).
% fof(3317, plain,![X1]:(~(empty(X1))|(empty(relation_dom(X1))&relation(relation_dom(X1)))),inference(fof_nnf,[status(thm)],[394])).
% fof(3318, plain,![X2]:(~(empty(X2))|(empty(relation_dom(X2))&relation(relation_dom(X2)))),inference(variable_rename,[status(thm)],[3317])).
% fof(3319, plain,![X2]:((empty(relation_dom(X2))|~(empty(X2)))&(relation(relation_dom(X2))|~(empty(X2)))),inference(distribute,[status(thm)],[3318])).
% cnf(3321,plain,(empty(relation_dom(X1))|~empty(X1)),inference(split_conjunct,[status(thm)],[3319])).
% fof(3688, plain,![X1]:?[X2]:(((relation(X2)&function(X2))&relation_dom(X2)=X1)&![X3]:(~(in(X3,X1))|apply(X2,X3)=singleton(X3))),inference(fof_nnf,[status(thm)],[447])).
% fof(3689, plain,![X4]:?[X5]:(((relation(X5)&function(X5))&relation_dom(X5)=X4)&![X6]:(~(in(X6,X4))|apply(X5,X6)=singleton(X6))),inference(variable_rename,[status(thm)],[3688])).
% fof(3690, plain,![X4]:(((relation(esk320_1(X4))&function(esk320_1(X4)))&relation_dom(esk320_1(X4))=X4)&![X6]:(~(in(X6,X4))|apply(esk320_1(X4),X6)=singleton(X6))),inference(skolemize,[status(esa)],[3689])).
% fof(3691, plain,![X4]:![X6]:((~(in(X6,X4))|apply(esk320_1(X4),X6)=singleton(X6))&((relation(esk320_1(X4))&function(esk320_1(X4)))&relation_dom(esk320_1(X4))=X4)),inference(shift_quantors,[status(thm)],[3690])).
% cnf(3692,plain,(relation_dom(esk320_1(X1))=X1),inference(split_conjunct,[status(thm)],[3691])).
% cnf(3694,plain,(relation(esk320_1(X1))),inference(split_conjunct,[status(thm)],[3691])).
% fof(3991, plain,?[X2]:((((((relation(X2)&function(X2))&one_to_one(X2))&empty(X2))&epsilon_transitive(X2))&epsilon_connected(X2))&ordinal(X2)),inference(variable_rename,[status(thm)],[497])).
% fof(3992, plain,((((((relation(esk340_0)&function(esk340_0))&one_to_one(esk340_0))&empty(esk340_0))&epsilon_transitive(esk340_0))&epsilon_connected(esk340_0))&ordinal(esk340_0)),inference(skolemize,[status(esa)],[3991])).
% cnf(3996,plain,(empty(esk340_0)),inference(split_conjunct,[status(thm)],[3992])).
% fof(4091, negated_conjecture,?[X1]:((~(empty_carrier(X1))&one_sorted_str(X1))&?[X2]:(element(X2,powerset(powerset(the_carrier(X1))))&(is_a_cover_of_carrier(X1,X2)&X2=empty_set))),inference(fof_nnf,[status(thm)],[615])).
% fof(4092, negated_conjecture,?[X3]:((~(empty_carrier(X3))&one_sorted_str(X3))&?[X4]:(element(X4,powerset(powerset(the_carrier(X3))))&(is_a_cover_of_carrier(X3,X4)&X4=empty_set))),inference(variable_rename,[status(thm)],[4091])).
% fof(4093, negated_conjecture,((~(empty_carrier(esk342_0))&one_sorted_str(esk342_0))&(element(esk343_0,powerset(powerset(the_carrier(esk342_0))))&(is_a_cover_of_carrier(esk342_0,esk343_0)&esk343_0=empty_set))),inference(skolemize,[status(esa)],[4092])).
% cnf(4094,negated_conjecture,(esk343_0=empty_set),inference(split_conjunct,[status(thm)],[4093])).
% cnf(4095,negated_conjecture,(is_a_cover_of_carrier(esk342_0,esk343_0)),inference(split_conjunct,[status(thm)],[4093])).
% cnf(4097,negated_conjecture,(one_sorted_str(esk342_0)),inference(split_conjunct,[status(thm)],[4093])).
% cnf(4098,negated_conjecture,(~empty_carrier(esk342_0)),inference(split_conjunct,[status(thm)],[4093])).
% cnf(4181,plain,(element(X1,powerset(X1))),inference(rw,[status(thm)],[749,1961,theory(equality)]),['unfolding']).
% cnf(4430,plain,(set_difference(X1,set_difference(X1,empty_set))=empty_set),inference(rw,[status(thm)],[771,2271,theory(equality)]),['unfolding']).
% cnf(4974,plain,(set_difference(X1,esk343_0)=X1),inference(rw,[status(thm)],[773,4094,theory(equality)])).
% cnf(4979,plain,(esk343_0=X1|~empty(X1)),inference(rw,[status(thm)],[739,4094,theory(equality)])).
% cnf(4981,plain,(esk343_0=X1|~subset(X1,empty_set)),inference(rw,[status(thm)],[732,4094,theory(equality)])).
% cnf(4982,plain,(esk343_0=X1|~subset(X1,esk343_0)),inference(rw,[status(thm)],[4981,4094,theory(equality)])).
% cnf(4997,plain,(set_difference(X1,X1)=empty_set),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4430,4094,theory(equality)]),4974,theory(equality)])).
% cnf(4998,plain,(set_difference(X1,X1)=esk343_0),inference(rw,[status(thm)],[4997,4094,theory(equality)])).
% cnf(5007,plain,(esk343_0=X1|relation_dom(X1)!=empty_set|~relation(X1)),inference(rw,[status(thm)],[1381,4094,theory(equality)])).
% cnf(5008,plain,(esk343_0=X1|relation_dom(X1)!=esk343_0|~relation(X1)),inference(rw,[status(thm)],[5007,4094,theory(equality)])).
% cnf(5952,plain,(esk343_0=esk340_0),inference(spm,[status(thm)],[4979,3996,theory(equality)])).
% cnf(5984,negated_conjecture,(~empty(cast_as_carrier_subset(esk342_0))|~one_sorted_str(esk342_0)),inference(spm,[status(thm)],[4098,848,theory(equality)])).
% cnf(5986,negated_conjecture,(~empty(cast_as_carrier_subset(esk342_0))|$false),inference(rw,[status(thm)],[5984,4097,theory(equality)])).
% cnf(5987,negated_conjecture,(~empty(cast_as_carrier_subset(esk342_0))),inference(cn,[status(thm)],[5986,theory(equality)])).
% cnf(6018,plain,(empty(X1)|~empty(esk320_1(X1))),inference(spm,[status(thm)],[3321,3692,theory(equality)])).
% cnf(6409,plain,(subset_complement(X1,X1)=set_difference(X1,X1)),inference(spm,[status(thm)],[808,4181,theory(equality)])).
% cnf(6413,plain,(subset_complement(X1,X1)=esk343_0),inference(rw,[status(thm)],[6409,4998,theory(equality)])).
% cnf(8651,plain,(union_of_subsets(the_carrier(X1),subset_complement(powerset(the_carrier(X1)),X2))=cast_as_carrier_subset(X1)|~is_a_cover_of_carrier(X1,subset_complement(powerset(the_carrier(X1)),X2))|~one_sorted_str(X1)|~element(X2,powerset(powerset(the_carrier(X1))))),inference(spm,[status(thm)],[666,752,theory(equality)])).
% cnf(105765,plain,(esk340_0=X1|~subset(X1,esk343_0)),inference(rw,[status(thm)],[4982,5952,theory(equality)])).
% cnf(105766,plain,(esk340_0=X1|~subset(X1,esk340_0)),inference(rw,[status(thm)],[105765,5952,theory(equality)])).
% cnf(105777,plain,(esk340_0=X1|relation_dom(X1)!=esk343_0|~relation(X1)),inference(rw,[status(thm)],[5008,5952,theory(equality)])).
% cnf(105778,plain,(esk340_0=X1|relation_dom(X1)!=esk340_0|~relation(X1)),inference(rw,[status(thm)],[105777,5952,theory(equality)])).
% cnf(105793,negated_conjecture,(is_a_cover_of_carrier(esk342_0,esk340_0)),inference(rw,[status(thm)],[4095,5952,theory(equality)])).
% cnf(107031,plain,(subset_complement(X1,X1)=esk340_0),inference(rw,[status(thm)],[6413,5952,theory(equality)])).
% cnf(107034,plain,(element(esk340_0,powerset(X1))|~element(X1,powerset(X1))),inference(spm,[status(thm)],[752,107031,theory(equality)])).
% cnf(107041,plain,(element(esk340_0,powerset(X1))|$false),inference(rw,[status(thm)],[107034,4181,theory(equality)])).
% cnf(107042,plain,(element(esk340_0,powerset(X1))),inference(cn,[status(thm)],[107041,theory(equality)])).
% cnf(107069,plain,(union_of_subsets(X1,esk340_0)=union(esk340_0)),inference(spm,[status(thm)],[817,107042,theory(equality)])).
% cnf(107072,plain,(element(union_of_subsets(X1,esk340_0),powerset(X1))),inference(spm,[status(thm)],[755,107042,theory(equality)])).
% cnf(113226,plain,(element(union(esk340_0),powerset(X1))),inference(rw,[status(thm)],[107072,107069,theory(equality)])).
% cnf(113529,plain,(subset(union(esk340_0),X1)),inference(spm,[status(thm)],[719,113226,theory(equality)])).
% cnf(113627,plain,(esk340_0=union(esk340_0)),inference(spm,[status(thm)],[105766,113529,theory(equality)])).
% cnf(113647,plain,(union_of_subsets(X1,esk340_0)=esk340_0),inference(rw,[status(thm)],[107069,113627,theory(equality)])).
% cnf(120874,plain,(esk340_0=esk320_1(X1)|X1!=esk340_0|~relation(esk320_1(X1))),inference(spm,[status(thm)],[105778,3692,theory(equality)])).
% cnf(120883,plain,(esk340_0=esk320_1(X1)|X1!=esk340_0|$false),inference(rw,[status(thm)],[120874,3694,theory(equality)])).
% cnf(120884,plain,(esk340_0=esk320_1(X1)|X1!=esk340_0),inference(cn,[status(thm)],[120883,theory(equality)])).
% cnf(132656,plain,(empty(X1)|~empty(esk340_0)|X1!=esk340_0),inference(spm,[status(thm)],[6018,120884,theory(equality)])).
% cnf(132657,plain,(empty(X1)|$false|X1!=esk340_0),inference(rw,[status(thm)],[132656,3996,theory(equality)])).
% cnf(132658,plain,(empty(X1)|X1!=esk340_0),inference(cn,[status(thm)],[132657,theory(equality)])).
% cnf(132725,negated_conjecture,(cast_as_carrier_subset(esk342_0)!=esk340_0),inference(spm,[status(thm)],[5987,132658,theory(equality)])).
% cnf(422284,plain,(union_of_subsets(the_carrier(X1),subset_complement(powerset(the_carrier(X1)),powerset(the_carrier(X1))))=cast_as_carrier_subset(X1)|~is_a_cover_of_carrier(X1,subset_complement(powerset(the_carrier(X1)),powerset(the_carrier(X1))))|~one_sorted_str(X1)),inference(spm,[status(thm)],[8651,4181,theory(equality)])).
% cnf(422357,plain,(esk340_0=cast_as_carrier_subset(X1)|~is_a_cover_of_carrier(X1,subset_complement(powerset(the_carrier(X1)),powerset(the_carrier(X1))))|~one_sorted_str(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[422284,107031,theory(equality)]),113647,theory(equality)])).
% cnf(422358,plain,(esk340_0=cast_as_carrier_subset(X1)|~is_a_cover_of_carrier(X1,esk340_0)|~one_sorted_str(X1)),inference(rw,[status(thm)],[422357,107031,theory(equality)])).
% cnf(422644,negated_conjecture,(cast_as_carrier_subset(esk342_0)=esk340_0|~one_sorted_str(esk342_0)),inference(spm,[status(thm)],[422358,105793,theory(equality)])).
% cnf(422645,negated_conjecture,(cast_as_carrier_subset(esk342_0)=esk340_0|$false),inference(rw,[status(thm)],[422644,4097,theory(equality)])).
% cnf(422646,negated_conjecture,(cast_as_carrier_subset(esk342_0)=esk340_0),inference(cn,[status(thm)],[422645,theory(equality)])).
% cnf(422647,negated_conjecture,($false),inference(sr,[status(thm)],[422646,132725,theory(equality)])).
% cnf(422648,negated_conjecture,($false),422647,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17006
% # ...of these trivial : 396
% # ...subsumed : 8496
% # ...remaining for further processing: 8114
% # Other redundant clauses eliminated : 843
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 39
% # Backward-rewritten : 369
% # Generated clauses : 372145
% # ...of the previous two non-trivial : 351729
% # Contextual simplify-reflections : 2476
% # Paramodulations : 371190
% # Factorizations : 14
% # Equation resolutions : 996
% # Current number of processed clauses: 5609
% # Positive orientable unit clauses: 937
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 195
% # Non-unit-clauses : 4472
% # Current number of unprocessed clauses: 315391
% # ...number of literals in the above : 1564622
% # Clause-clause subsumption calls (NU) : 5515962
% # Rec. Clause-clause subsumption calls : 1142579
% # Unit Clause-clause subsumption calls : 194491
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1711
% # Indexed BW rewrite successes : 126
% # Backwards rewriting index: 3539 leaves, 1.59+/-2.752 terms/leaf
% # Paramod-from index: 1529 leaves, 1.30+/-1.576 terms/leaf
% # Paramod-into index: 2806 leaves, 1.51+/-2.423 terms/leaf
% # -------------------------------------------------
% # User time : 22.865 s
% # System time : 0.544 s
% # Total time : 23.408 s
% # Maximum resident set size: 0 pages
% PrfWatch: 30.13 CPU 31.14 WC
% FINAL PrfWatch: 30.13 CPU 31.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP30779/SEU325+2.tptp
%
%------------------------------------------------------------------------------