TSTP Solution File: SEU171+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU171+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 : 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 01:25:05 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP23855/SEU171+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP23855/SEU171+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23855/SEU171+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 23951
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(6, axiom,![X1]:![X2]:((~(empty(X1))=>(element(X2,X1)<=>in(X2,X1)))&(empty(X1)=>(element(X2,X1)<=>empty(X2)))),file('/tmp/SRASS.s.p', d2_subset_1)).
% fof(7, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(10, axiom,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),file('/tmp/SRASS.s.p', d4_xboole_0)).
% fof(23, conjecture,![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2)))))),file('/tmp/SRASS.s.p', t50_subset_1)).
% fof(24, negated_conjecture,~(![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2))))))),inference(assume_negation,[status(cth)],[23])).
% fof(26, plain,![X1]:![X2]:((~(empty(X1))=>(element(X2,X1)<=>in(X2,X1)))&(empty(X1)=>(element(X2,X1)<=>empty(X2)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(28, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(31, negated_conjecture,~(![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2))))))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(44, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(45, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X1]:![X2]:((empty(X1)|((~(element(X2,X1))|in(X2,X1))&(~(in(X2,X1))|element(X2,X1))))&(~(empty(X1))|((~(element(X2,X1))|empty(X2))&(~(empty(X2))|element(X2,X1))))),inference(fof_nnf,[status(thm)],[26])).
% fof(48, plain,![X3]:![X4]:((empty(X3)|((~(element(X4,X3))|in(X4,X3))&(~(in(X4,X3))|element(X4,X3))))&(~(empty(X3))|((~(element(X4,X3))|empty(X4))&(~(empty(X4))|element(X4,X3))))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X3]:![X4]:((((~(element(X4,X3))|in(X4,X3))|empty(X3))&((~(in(X4,X3))|element(X4,X3))|empty(X3)))&(((~(element(X4,X3))|empty(X4))|~(empty(X3)))&((~(empty(X4))|element(X4,X3))|~(empty(X3))))),inference(distribute,[status(thm)],[48])).
% cnf(53,plain,(empty(X1)|in(X2,X1)|~element(X2,X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(54, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[7])).
% fof(55, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[54])).
% cnf(56,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(67, plain,![X1]:![X2]:![X3]:((~(X3=set_difference(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&~(in(X4,X2))))&((~(in(X4,X1))|in(X4,X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|in(X4,X2)))&(in(X4,X3)|(in(X4,X1)&~(in(X4,X2)))))|X3=set_difference(X1,X2))),inference(fof_nnf,[status(thm)],[28])).
% fof(68, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|in(X9,X6)))&(in(X9,X7)|(in(X9,X5)&~(in(X9,X6)))))|X7=set_difference(X5,X6))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))|in(esk4_3(X5,X6,X7),X6)))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)&~(in(esk4_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7)))|~(X7=set_difference(X5,X6)))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))|in(esk4_3(X5,X6,X7),X6)))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)&~(in(esk4_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_difference(X5,X6)))&((~(in(X8,X6))|~(in(X8,X7)))|~(X7=set_difference(X5,X6))))&(((~(in(X8,X5))|in(X8,X6))|in(X8,X7))|~(X7=set_difference(X5,X6))))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))|in(esk4_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk4_3(X5,X6,X7),X6))|in(esk4_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[70])).
% cnf(75,plain,(in(X4,X1)|in(X4,X3)|X1!=set_difference(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[71])).
% fof(101, negated_conjecture,?[X1]:(~(X1=empty_set)&?[X2]:(element(X2,powerset(X1))&?[X3]:(element(X3,X1)&(~(in(X3,X2))&~(in(X3,subset_complement(X1,X2))))))),inference(fof_nnf,[status(thm)],[31])).
% fof(102, negated_conjecture,?[X4]:(~(X4=empty_set)&?[X5]:(element(X5,powerset(X4))&?[X6]:(element(X6,X4)&(~(in(X6,X5))&~(in(X6,subset_complement(X4,X5))))))),inference(variable_rename,[status(thm)],[101])).
% fof(103, negated_conjecture,(~(esk7_0=empty_set)&(element(esk8_0,powerset(esk7_0))&(element(esk9_0,esk7_0)&(~(in(esk9_0,esk8_0))&~(in(esk9_0,subset_complement(esk7_0,esk8_0))))))),inference(skolemize,[status(esa)],[102])).
% cnf(104,negated_conjecture,(~in(esk9_0,subset_complement(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[103])).
% cnf(105,negated_conjecture,(~in(esk9_0,esk8_0)),inference(split_conjunct,[status(thm)],[103])).
% cnf(106,negated_conjecture,(element(esk9_0,esk7_0)),inference(split_conjunct,[status(thm)],[103])).
% cnf(107,negated_conjecture,(element(esk8_0,powerset(esk7_0))),inference(split_conjunct,[status(thm)],[103])).
% cnf(108,negated_conjecture,(esk7_0!=empty_set),inference(split_conjunct,[status(thm)],[103])).
% cnf(112,negated_conjecture,(empty(esk7_0)|in(esk9_0,esk7_0)),inference(spm,[status(thm)],[53,106,theory(equality)])).
% cnf(137,negated_conjecture,(~in(esk9_0,set_difference(esk7_0,esk8_0))|~element(esk8_0,powerset(esk7_0))),inference(spm,[status(thm)],[104,46,theory(equality)])).
% cnf(141,negated_conjecture,(~in(esk9_0,set_difference(esk7_0,esk8_0))|$false),inference(rw,[status(thm)],[137,107,theory(equality)])).
% cnf(142,negated_conjecture,(~in(esk9_0,set_difference(esk7_0,esk8_0))),inference(cn,[status(thm)],[141,theory(equality)])).
% cnf(151,plain,(in(X1,X2)|in(X1,set_difference(X3,X2))|~in(X1,X3)),inference(er,[status(thm)],[75,theory(equality)])).
% cnf(365,negated_conjecture,(in(esk9_0,esk8_0)|~in(esk9_0,esk7_0)),inference(spm,[status(thm)],[142,151,theory(equality)])).
% cnf(376,negated_conjecture,(~in(esk9_0,esk7_0)),inference(sr,[status(thm)],[365,105,theory(equality)])).
% cnf(377,negated_conjecture,(empty(esk7_0)),inference(sr,[status(thm)],[112,376,theory(equality)])).
% cnf(378,negated_conjecture,(empty_set=esk7_0),inference(spm,[status(thm)],[56,377,theory(equality)])).
% cnf(391,negated_conjecture,($false),inference(sr,[status(thm)],[378,108,theory(equality)])).
% cnf(392,negated_conjecture,($false),391,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 156
% # ...of these trivial : 1
% # ...subsumed : 33
% # ...remaining for further processing: 122
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 200
% # ...of the previous two non-trivial : 150
% # Contextual simplify-reflections : 9
% # Paramodulations : 183
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 77
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 45
% # Current number of unprocessed clauses: 56
% # ...number of literals in the above : 149
% # Clause-clause subsumption calls (NU) : 154
% # Rec. Clause-clause subsumption calls : 142
% # Unit Clause-clause subsumption calls : 78
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 22
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 67 leaves, 1.22+/-0.729 terms/leaf
% # Paramod-from index: 36 leaves, 1.06+/-0.229 terms/leaf
% # Paramod-into index: 66 leaves, 1.14+/-0.422 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.002 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP23855/SEU171+1.tptp
%
%------------------------------------------------------------------------------