TSTP Solution File: SEU327+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU327+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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:34:01 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP11440/SEU327+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11440/SEU327+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11440/SEU327+1.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 11536
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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(8, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(9, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>(~(X2=empty_set)=>subset_difference(X1,cast_to_subset(X1),union_of_subsets(X1,X2))=meet_of_subsets(X1,complements_of_subsets(X1,X2)))),file('/tmp/SRASS.s.p', t47_setfam_1)).
% fof(19, axiom,![X1]:element(cast_to_subset(X1),powerset(X1)),file('/tmp/SRASS.s.p', dt_k2_subset_1)).
% fof(22, axiom,![X1]:![X2]:![X3]:((element(X2,powerset(X1))&element(X3,powerset(X1)))=>subset_difference(X1,X2,X3)=set_difference(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k6_subset_1)).
% fof(24, axiom,![X1]:cast_to_subset(X1)=X1,file('/tmp/SRASS.s.p', d4_subset_1)).
% fof(59, conjecture,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>(~(X2=empty_set)=>meet_of_subsets(X1,complements_of_subsets(X1,X2))=subset_complement(X1,union_of_subsets(X1,X2)))),file('/tmp/SRASS.s.p', t11_tops_2)).
% fof(60, negated_conjecture,~(![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>(~(X2=empty_set)=>meet_of_subsets(X1,complements_of_subsets(X1,X2))=subset_complement(X1,union_of_subsets(X1,X2))))),inference(assume_negation,[status(cth)],[59])).
% fof(68, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|element(union_of_subsets(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(69, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|element(union_of_subsets(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(element(union_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[69])).
% fof(86, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(87, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[86])).
% cnf(88,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[87])).
% fof(89, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|(X2=empty_set|subset_difference(X1,cast_to_subset(X1),union_of_subsets(X1,X2))=meet_of_subsets(X1,complements_of_subsets(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(90, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|(X4=empty_set|subset_difference(X3,cast_to_subset(X3),union_of_subsets(X3,X4))=meet_of_subsets(X3,complements_of_subsets(X3,X4)))),inference(variable_rename,[status(thm)],[89])).
% cnf(91,plain,(subset_difference(X1,cast_to_subset(X1),union_of_subsets(X1,X2))=meet_of_subsets(X1,complements_of_subsets(X1,X2))|X2=empty_set|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[90])).
% fof(122, plain,![X2]:element(cast_to_subset(X2),powerset(X2)),inference(variable_rename,[status(thm)],[19])).
% cnf(123,plain,(element(cast_to_subset(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[122])).
% fof(131, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|subset_difference(X1,X2,X3)=set_difference(X2,X3)),inference(fof_nnf,[status(thm)],[22])).
% fof(132, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|subset_difference(X4,X5,X6)=set_difference(X5,X6)),inference(variable_rename,[status(thm)],[131])).
% cnf(133,plain,(subset_difference(X1,X2,X3)=set_difference(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[132])).
% fof(137, plain,![X2]:cast_to_subset(X2)=X2,inference(variable_rename,[status(thm)],[24])).
% cnf(138,plain,(cast_to_subset(X1)=X1),inference(split_conjunct,[status(thm)],[137])).
% fof(291, negated_conjecture,?[X1]:?[X2]:(element(X2,powerset(powerset(X1)))&(~(X2=empty_set)&~(meet_of_subsets(X1,complements_of_subsets(X1,X2))=subset_complement(X1,union_of_subsets(X1,X2))))),inference(fof_nnf,[status(thm)],[60])).
% fof(292, negated_conjecture,?[X3]:?[X4]:(element(X4,powerset(powerset(X3)))&(~(X4=empty_set)&~(meet_of_subsets(X3,complements_of_subsets(X3,X4))=subset_complement(X3,union_of_subsets(X3,X4))))),inference(variable_rename,[status(thm)],[291])).
% fof(293, negated_conjecture,(element(esk6_0,powerset(powerset(esk5_0)))&(~(esk6_0=empty_set)&~(meet_of_subsets(esk5_0,complements_of_subsets(esk5_0,esk6_0))=subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))))),inference(skolemize,[status(esa)],[292])).
% cnf(294,negated_conjecture,(meet_of_subsets(esk5_0,complements_of_subsets(esk5_0,esk6_0))!=subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[293])).
% cnf(295,negated_conjecture,(esk6_0!=empty_set),inference(split_conjunct,[status(thm)],[293])).
% cnf(296,negated_conjecture,(element(esk6_0,powerset(powerset(esk5_0)))),inference(split_conjunct,[status(thm)],[293])).
% cnf(297,plain,(element(X1,powerset(X1))),inference(rw,[status(thm)],[123,138,theory(equality)]),['unfolding']).
% cnf(298,plain,(empty_set=X2|subset_difference(X1,X1,union_of_subsets(X1,X2))=meet_of_subsets(X1,complements_of_subsets(X1,X2))|~element(X2,powerset(powerset(X1)))),inference(rw,[status(thm)],[91,138,theory(equality)]),['unfolding']).
% cnf(725,plain,(meet_of_subsets(X1,complements_of_subsets(X1,X2))=set_difference(X1,union_of_subsets(X1,X2))|empty_set=X2|~element(union_of_subsets(X1,X2),powerset(X1))|~element(X1,powerset(X1))|~element(X2,powerset(powerset(X1)))),inference(spm,[status(thm)],[133,298,theory(equality)])).
% cnf(728,plain,(meet_of_subsets(X1,complements_of_subsets(X1,X2))=set_difference(X1,union_of_subsets(X1,X2))|empty_set=X2|~element(union_of_subsets(X1,X2),powerset(X1))|$false|~element(X2,powerset(powerset(X1)))),inference(rw,[status(thm)],[725,297,theory(equality)])).
% cnf(729,plain,(meet_of_subsets(X1,complements_of_subsets(X1,X2))=set_difference(X1,union_of_subsets(X1,X2))|empty_set=X2|~element(union_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1)))),inference(cn,[status(thm)],[728,theory(equality)])).
% cnf(3919,plain,(meet_of_subsets(X1,complements_of_subsets(X1,X2))=set_difference(X1,union_of_subsets(X1,X2))|empty_set=X2|~element(X2,powerset(powerset(X1)))),inference(csr,[status(thm)],[729,70])).
% cnf(3920,negated_conjecture,(empty_set=esk6_0|set_difference(esk5_0,union_of_subsets(esk5_0,esk6_0))!=subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))|~element(esk6_0,powerset(powerset(esk5_0)))),inference(spm,[status(thm)],[294,3919,theory(equality)])).
% cnf(3964,negated_conjecture,(empty_set=esk6_0|set_difference(esk5_0,union_of_subsets(esk5_0,esk6_0))!=subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))|$false),inference(rw,[status(thm)],[3920,296,theory(equality)])).
% cnf(3965,negated_conjecture,(empty_set=esk6_0|set_difference(esk5_0,union_of_subsets(esk5_0,esk6_0))!=subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))),inference(cn,[status(thm)],[3964,theory(equality)])).
% cnf(3966,negated_conjecture,(subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))!=set_difference(esk5_0,union_of_subsets(esk5_0,esk6_0))),inference(sr,[status(thm)],[3965,295,theory(equality)])).
% cnf(3978,negated_conjecture,(~element(union_of_subsets(esk5_0,esk6_0),powerset(esk5_0))),inference(spm,[status(thm)],[3966,88,theory(equality)])).
% cnf(3990,negated_conjecture,(~element(esk6_0,powerset(powerset(esk5_0)))),inference(spm,[status(thm)],[3978,70,theory(equality)])).
% cnf(3999,negated_conjecture,($false),inference(rw,[status(thm)],[3990,296,theory(equality)])).
% cnf(4000,negated_conjecture,($false),inference(cn,[status(thm)],[3999,theory(equality)])).
% cnf(4001,negated_conjecture,($false),4000,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1026
% # ...of these trivial : 1
% # ...subsumed : 380
% # ...remaining for further processing: 645
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 11
% # Generated clauses : 2119
% # ...of the previous two non-trivial : 1765
% # Contextual simplify-reflections : 264
% # Paramodulations : 2113
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 520
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 482
% # Current number of unprocessed clauses: 791
% # ...number of literals in the above : 3033
% # Clause-clause subsumption calls (NU) : 2835
% # Rec. Clause-clause subsumption calls : 2445
% # Unit Clause-clause subsumption calls : 1142
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 262 leaves, 1.23+/-0.725 terms/leaf
% # Paramod-from index: 167 leaves, 1.07+/-0.248 terms/leaf
% # Paramod-into index: 237 leaves, 1.13+/-0.473 terms/leaf
% # -------------------------------------------------
% # User time : 0.126 s
% # System time : 0.008 s
% # Total time : 0.134 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.34 WC
% FINAL PrfWatch: 0.26 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP11440/SEU327+1.tptp
%
%------------------------------------------------------------------------------