TSTP Solution File: SEU326+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU326+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 : art02.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:54 EST 2010
% Result : Theorem 73.60s
% Output : Solution 73.60s
% 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/SystemOnTPTP32100/SEU326+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32100/SEU326+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32100/SEU326+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 32196
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.02 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.91 CPU 10.03 WC
% PrfWatch: 11.90 CPU 12.04 WC
% PrfWatch: 13.54 CPU 14.04 WC
% PrfWatch: 15.16 CPU 16.05 WC
% PrfWatch: 17.16 CPU 18.05 WC
% PrfWatch: 19.15 CPU 20.06 WC
% PrfWatch: 21.14 CPU 22.06 WC
% PrfWatch: 23.13 CPU 24.07 WC
% PrfWatch: 25.12 CPU 26.07 WC
% PrfWatch: 27.11 CPU 28.08 WC
% PrfWatch: 29.10 CPU 30.08 WC
% PrfWatch: 31.09 CPU 32.08 WC
% PrfWatch: 33.07 CPU 34.09 WC
% PrfWatch: 35.06 CPU 36.09 WC
% PrfWatch: 37.05 CPU 38.10 WC
% PrfWatch: 39.04 CPU 40.10 WC
% PrfWatch: 41.03 CPU 42.11 WC
% PrfWatch: 43.02 CPU 44.11 WC
% # Preprocessing time : 0.240 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 45.02 CPU 46.12 WC
% PrfWatch: 47.01 CPU 48.12 WC
% PrfWatch: 49.00 CPU 50.13 WC
% PrfWatch: 51.00 CPU 52.13 WC
% PrfWatch: 52.78 CPU 54.14 WC
% PrfWatch: 54.31 CPU 56.14 WC
% PrfWatch: 56.28 CPU 58.16 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>element(complements_of_subsets(X1,X2),powerset(powerset(X1)))),file('/tmp/SRASS.s.p', dt_k7_setfam_1)).
% fof(3, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2),file('/tmp/SRASS.s.p', involutiveness_k7_setfam_1)).
% fof(4, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>~((~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set))),file('/tmp/SRASS.s.p', t46_setfam_1)).
% fof(14, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(19, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(22, axiom,![X1]:element(cast_to_subset(X1),powerset(X1)),file('/tmp/SRASS.s.p', dt_k2_subset_1)).
% fof(23, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>element(subset_complement(X1,X2),powerset(X1))),file('/tmp/SRASS.s.p', dt_k3_subset_1)).
% fof(29, axiom,![X1]:set_intersection2(X1,empty_set)=empty_set,file('/tmp/SRASS.s.p', t2_boole)).
% fof(30, axiom,![X1]:set_difference(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t3_boole)).
% fof(35, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(172, axiom,![X1]:cast_to_subset(X1)=X1,file('/tmp/SRASS.s.p', d4_subset_1)).
% fof(190, axiom,![X1]:![X2]:set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2),file('/tmp/SRASS.s.p', t48_xboole_1)).
% fof(494, 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(539, conjecture,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>(~((~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set))&~((~(complements_of_subsets(X1,X2)=empty_set)&X2=empty_set)))),file('/tmp/SRASS.s.p', t10_tops_2)).
% fof(540, negated_conjecture,~(![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>(~((~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set))&~((~(complements_of_subsets(X1,X2)=empty_set)&X2=empty_set))))),inference(assume_negation,[status(cth)],[539])).
% fof(623, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|element(complements_of_subsets(X1,X2),powerset(powerset(X1)))),inference(fof_nnf,[status(thm)],[1])).
% fof(624, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|element(complements_of_subsets(X3,X4),powerset(powerset(X3)))),inference(variable_rename,[status(thm)],[623])).
% cnf(625,plain,(element(complements_of_subsets(X1,X2),powerset(powerset(X1)))|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[624])).
% fof(629, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2),inference(fof_nnf,[status(thm)],[3])).
% fof(630, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|complements_of_subsets(X3,complements_of_subsets(X3,X4))=X4),inference(variable_rename,[status(thm)],[629])).
% cnf(631,plain,(complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[630])).
% fof(632, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|(X2=empty_set|~(complements_of_subsets(X1,X2)=empty_set))),inference(fof_nnf,[status(thm)],[4])).
% fof(633, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|(X4=empty_set|~(complements_of_subsets(X3,X4)=empty_set))),inference(variable_rename,[status(thm)],[632])).
% cnf(634,plain,(X2=empty_set|complements_of_subsets(X1,X2)!=empty_set|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[633])).
% fof(674, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(675, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[674])).
% cnf(676,plain,(element(X1,powerset(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[675])).
% cnf(677,plain,(subset(X1,X2)|~element(X1,powerset(X2))),inference(split_conjunct,[status(thm)],[675])).
% fof(695, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[19])).
% fof(696, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[695])).
% cnf(697,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[696])).
% fof(706, plain,![X2]:element(cast_to_subset(X2),powerset(X2)),inference(variable_rename,[status(thm)],[22])).
% cnf(707,plain,(element(cast_to_subset(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[706])).
% fof(708, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|element(subset_complement(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(709, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|element(subset_complement(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[708])).
% cnf(710,plain,(element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[709])).
% fof(725, plain,![X2]:set_intersection2(X2,empty_set)=empty_set,inference(variable_rename,[status(thm)],[29])).
% cnf(726,plain,(set_intersection2(X1,empty_set)=empty_set),inference(split_conjunct,[status(thm)],[725])).
% fof(727, plain,![X2]:set_difference(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[30])).
% cnf(728,plain,(set_difference(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[727])).
% fof(742, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[35])).
% fof(743, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[742])).
% cnf(744,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[743])).
% fof(1630, plain,![X2]:cast_to_subset(X2)=X2,inference(variable_rename,[status(thm)],[172])).
% cnf(1631,plain,(cast_to_subset(X1)=X1),inference(split_conjunct,[status(thm)],[1630])).
% fof(1940, plain,![X3]:![X4]:set_difference(X3,set_difference(X3,X4))=set_intersection2(X3,X4),inference(variable_rename,[status(thm)],[190])).
% cnf(1941,plain,(set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2)),inference(split_conjunct,[status(thm)],[1940])).
% fof(3976, 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)],[494])).
% fof(3977, 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)],[3976])).
% cnf(3981,plain,(empty(esk340_0)),inference(split_conjunct,[status(thm)],[3977])).
% fof(4096, negated_conjecture,?[X1]:?[X2]:(element(X2,powerset(powerset(X1)))&((~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set)|(~(complements_of_subsets(X1,X2)=empty_set)&X2=empty_set))),inference(fof_nnf,[status(thm)],[540])).
% fof(4097, negated_conjecture,?[X3]:?[X4]:(element(X4,powerset(powerset(X3)))&((~(X4=empty_set)&complements_of_subsets(X3,X4)=empty_set)|(~(complements_of_subsets(X3,X4)=empty_set)&X4=empty_set))),inference(variable_rename,[status(thm)],[4096])).
% fof(4098, negated_conjecture,(element(esk343_0,powerset(powerset(esk342_0)))&((~(esk343_0=empty_set)&complements_of_subsets(esk342_0,esk343_0)=empty_set)|(~(complements_of_subsets(esk342_0,esk343_0)=empty_set)&esk343_0=empty_set))),inference(skolemize,[status(esa)],[4097])).
% fof(4099, negated_conjecture,(element(esk343_0,powerset(powerset(esk342_0)))&(((~(complements_of_subsets(esk342_0,esk343_0)=empty_set)|~(esk343_0=empty_set))&(esk343_0=empty_set|~(esk343_0=empty_set)))&((~(complements_of_subsets(esk342_0,esk343_0)=empty_set)|complements_of_subsets(esk342_0,esk343_0)=empty_set)&(esk343_0=empty_set|complements_of_subsets(esk342_0,esk343_0)=empty_set)))),inference(distribute,[status(thm)],[4098])).
% cnf(4100,negated_conjecture,(complements_of_subsets(esk342_0,esk343_0)=empty_set|esk343_0=empty_set),inference(split_conjunct,[status(thm)],[4099])).
% cnf(4103,negated_conjecture,(esk343_0!=empty_set|complements_of_subsets(esk342_0,esk343_0)!=empty_set),inference(split_conjunct,[status(thm)],[4099])).
% cnf(4104,negated_conjecture,(element(esk343_0,powerset(powerset(esk342_0)))),inference(split_conjunct,[status(thm)],[4099])).
% cnf(4187,plain,(element(X1,powerset(X1))),inference(rw,[status(thm)],[707,1631,theory(equality)]),['unfolding']).
% cnf(4436,plain,(set_difference(X1,set_difference(X1,empty_set))=empty_set),inference(rw,[status(thm)],[726,1941,theory(equality)]),['unfolding']).
% cnf(4966,plain,(set_difference(X1,X1)=empty_set),inference(rw,[status(thm)],[4436,728,theory(equality)])).
% cnf(5676,plain,(empty_set=esk340_0),inference(spm,[status(thm)],[697,3981,theory(equality)])).
% cnf(6205,plain,(subset_complement(X1,X1)=set_difference(X1,X1)),inference(spm,[status(thm)],[744,4187,theory(equality)])).
% cnf(6208,plain,(subset_complement(X1,X1)=empty_set),inference(rw,[status(thm)],[6205,4966,theory(equality)])).
% cnf(6435,plain,(subset(complements_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1)))),inference(spm,[status(thm)],[677,625,theory(equality)])).
% cnf(106357,plain,(esk340_0=X1|complements_of_subsets(X2,X1)!=empty_set|~element(X1,powerset(powerset(X2)))),inference(rw,[status(thm)],[634,5676,theory(equality)])).
% cnf(106358,plain,(esk340_0=X1|complements_of_subsets(X2,X1)!=esk340_0|~element(X1,powerset(powerset(X2)))),inference(rw,[status(thm)],[106357,5676,theory(equality)])).
% cnf(106400,negated_conjecture,(complements_of_subsets(esk342_0,esk343_0)!=esk340_0|empty_set!=esk343_0),inference(rw,[status(thm)],[4103,5676,theory(equality)])).
% cnf(106401,negated_conjecture,(complements_of_subsets(esk342_0,esk343_0)!=esk340_0|esk340_0!=esk343_0),inference(rw,[status(thm)],[106400,5676,theory(equality)])).
% cnf(106424,negated_conjecture,(complements_of_subsets(esk342_0,esk343_0)=esk340_0|empty_set=esk343_0),inference(rw,[status(thm)],[4100,5676,theory(equality)])).
% cnf(106425,negated_conjecture,(complements_of_subsets(esk342_0,esk343_0)=esk340_0|esk340_0=esk343_0),inference(rw,[status(thm)],[106424,5676,theory(equality)])).
% cnf(107115,plain,(subset_complement(X1,X1)=esk340_0),inference(rw,[status(thm)],[6208,5676,theory(equality)])).
% cnf(107118,plain,(element(esk340_0,powerset(X1))|~element(X1,powerset(X1))),inference(spm,[status(thm)],[710,107115,theory(equality)])).
% cnf(107125,plain,(element(esk340_0,powerset(X1))|$false),inference(rw,[status(thm)],[107118,4187,theory(equality)])).
% cnf(107126,plain,(element(esk340_0,powerset(X1))),inference(cn,[status(thm)],[107125,theory(equality)])).
% cnf(107264,plain,(complements_of_subsets(X1,complements_of_subsets(X1,esk340_0))=esk340_0),inference(spm,[status(thm)],[631,107126,theory(equality)])).
% cnf(124323,negated_conjecture,(esk340_0=esk343_0|complements_of_subsets(esk342_0,esk343_0)!=esk340_0),inference(spm,[status(thm)],[106358,4104,theory(equality)])).
% cnf(124351,plain,(esk340_0=X1|complements_of_subsets(X2,X1)!=esk340_0|~subset(X1,powerset(X2))),inference(spm,[status(thm)],[106358,676,theory(equality)])).
% cnf(124516,negated_conjecture,(esk343_0=esk340_0),inference(csr,[status(thm)],[124323,106425])).
% cnf(124618,negated_conjecture,(complements_of_subsets(esk342_0,esk340_0)!=esk340_0|esk343_0!=esk340_0),inference(rw,[status(thm)],[106401,124516,theory(equality)])).
% cnf(124619,negated_conjecture,(complements_of_subsets(esk342_0,esk340_0)!=esk340_0|$false),inference(rw,[status(thm)],[124618,124516,theory(equality)])).
% cnf(124620,negated_conjecture,(complements_of_subsets(esk342_0,esk340_0)!=esk340_0),inference(cn,[status(thm)],[124619,theory(equality)])).
% cnf(168185,plain,(subset(complements_of_subsets(X1,esk340_0),powerset(X1))),inference(spm,[status(thm)],[6435,107126,theory(equality)])).
% cnf(833266,plain,(esk340_0=complements_of_subsets(X1,esk340_0)|complements_of_subsets(X1,complements_of_subsets(X1,esk340_0))!=esk340_0),inference(spm,[status(thm)],[124351,168185,theory(equality)])).
% cnf(833326,plain,(esk340_0=complements_of_subsets(X1,esk340_0)|$false),inference(rw,[status(thm)],[833266,107264,theory(equality)])).
% cnf(833327,plain,(esk340_0=complements_of_subsets(X1,esk340_0)),inference(cn,[status(thm)],[833326,theory(equality)])).
% cnf(833660,negated_conjecture,($false),inference(rw,[status(thm)],[124620,833327,theory(equality)])).
% cnf(833661,negated_conjecture,($false),inference(cn,[status(thm)],[833660,theory(equality)])).
% cnf(833662,negated_conjecture,($false),833661,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30031
% # ...of these trivial : 525
% # ...subsumed : 17650
% # ...remaining for further processing: 11856
% # Other redundant clauses eliminated : 1242
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 187
% # Backward-rewritten : 886
% # Generated clauses : 737110
% # ...of the previous two non-trivial : 689716
% # Contextual simplify-reflections : 4442
% # Paramodulations : 735669
% # Factorizations : 20
% # Equation resolutions : 1455
% # Current number of processed clauses: 8670
% # Positive orientable unit clauses: 1286
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 496
% # Non-unit-clauses : 6883
% # Current number of unprocessed clauses: 590795
% # ...number of literals in the above : 2712000
% # Clause-clause subsumption calls (NU) : 4891078
% # Rec. Clause-clause subsumption calls : 1959692
% # Unit Clause-clause subsumption calls : 359460
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3064
% # Indexed BW rewrite successes : 201
% # Backwards rewriting index: 5739 leaves, 1.51+/-2.377 terms/leaf
% # Paramod-from index: 2519 leaves, 1.30+/-1.510 terms/leaf
% # Paramod-into index: 4730 leaves, 1.46+/-2.114 terms/leaf
% # -------------------------------------------------
% # User time : 43.286 s
% # System time : 1.040 s
% # Total time : 44.326 s
% # Maximum resident set size: 0 pages
% PrfWatch: 57.58 CPU 59.48 WC
% FINAL PrfWatch: 57.58 CPU 59.48 WC
% SZS output end Solution for /tmp/SystemOnTPTP32100/SEU326+2.tptp
%
%------------------------------------------------------------------------------