TSTP Solution File: SET947+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET947+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 00:22:09 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP1289/SET947+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1289/SET947+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1289/SET947+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 1386
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(in(X1,X2)=>subset(X1,union(X2))),file('/tmp/SRASS.s.p', l50_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:(X2=powerset(X1)<=>![X3]:(in(X3,X2)<=>subset(X3,X1))),file('/tmp/SRASS.s.p', d1_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(8, conjecture,![X1]:subset(X1,powerset(union(X1))),file('/tmp/SRASS.s.p', t100_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:subset(X1,powerset(union(X1)))),inference(assume_negation,[status(cth)],[8])).
% fof(14, plain,![X1]:![X2]:(~(in(X1,X2))|subset(X1,union(X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(15, plain,![X3]:![X4]:(~(in(X3,X4))|subset(X3,union(X4))),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(subset(X1,union(X2))|~in(X1,X2)),inference(split_conjunct,[status(thm)],[15])).
% fof(20, plain,![X1]:![X2]:((~(X2=powerset(X1))|![X3]:((~(in(X3,X2))|subset(X3,X1))&(~(subset(X3,X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(subset(X3,X1)))&(in(X3,X2)|subset(X3,X1)))|X2=powerset(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(21, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(subset(X7,X4)))&(in(X7,X5)|subset(X7,X4)))|X5=powerset(X4))),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(subset(esk1_2(X4,X5),X4)))&(in(esk1_2(X4,X5),X5)|subset(esk1_2(X4,X5),X4)))|X5=powerset(X4))),inference(skolemize,[status(esa)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5)))|~(X5=powerset(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(subset(esk1_2(X4,X5),X4)))&(in(esk1_2(X4,X5),X5)|subset(esk1_2(X4,X5),X4)))|X5=powerset(X4))),inference(shift_quantors,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))|~(X5=powerset(X4)))&((~(subset(X6,X4))|in(X6,X5))|~(X5=powerset(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(subset(esk1_2(X4,X5),X4)))|X5=powerset(X4))&((in(esk1_2(X4,X5),X5)|subset(esk1_2(X4,X5),X4))|X5=powerset(X4)))),inference(distribute,[status(thm)],[23])).
% cnf(27,plain,(in(X3,X1)|X1!=powerset(X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(29, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(30, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(subset(X1,X2)|~in(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(subset(X1,X2)|in(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(43, negated_conjecture,?[X1]:~(subset(X1,powerset(union(X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(44, negated_conjecture,?[X2]:~(subset(X2,powerset(union(X2)))),inference(variable_rename,[status(thm)],[43])).
% fof(45, negated_conjecture,~(subset(esk5_0,powerset(union(esk5_0)))),inference(skolemize,[status(esa)],[44])).
% cnf(46,negated_conjecture,(~subset(esk5_0,powerset(union(esk5_0)))),inference(split_conjunct,[status(thm)],[45])).
% cnf(51,plain,(in(X1,X2)|powerset(union(X3))!=X2|~in(X1,X3)),inference(spm,[status(thm)],[27,16,theory(equality)])).
% cnf(67,plain,(in(X1,powerset(union(X2)))|~in(X1,X2)),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(68,plain,(subset(X1,powerset(union(X2)))|~in(esk2_2(X1,powerset(union(X2))),X2)),inference(spm,[status(thm)],[34,67,theory(equality)])).
% cnf(119,plain,(subset(X1,powerset(union(X1)))),inference(spm,[status(thm)],[68,35,theory(equality)])).
% cnf(122,negated_conjecture,($false),inference(rw,[status(thm)],[46,119,theory(equality)])).
% cnf(123,negated_conjecture,($false),inference(cn,[status(thm)],[122,theory(equality)])).
% cnf(124,negated_conjecture,($false),123,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 60
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 56
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 73
% # ...of the previous two non-trivial : 67
% # Contextual simplify-reflections : 0
% # Paramodulations : 68
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 42
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 28
% # Current number of unprocessed clauses: 33
% # ...number of literals in the above : 77
% # Clause-clause subsumption calls (NU) : 66
% # Rec. Clause-clause subsumption calls : 65
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 42 leaves, 2.10+/-1.616 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 41 leaves, 1.88+/-1.501 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.006 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP1289/SET947+1.tptp
%
%------------------------------------------------------------------------------