TSTP Solution File: SEU147+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU147+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 : art03.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:18:13 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP27993/SEU147+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP27993/SEU147+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27993/SEU147+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 28089
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(2, axiom,![X1]:(subset(X1,empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', t3_xboole_1)).
% fof(3, axiom,![X1]:![X2]:(X2=powerset(X1)<=>![X3]:(in(X3,X2)<=>subset(X3,X1))),file('/tmp/SRASS.s.p', d1_zfmisc_1)).
% fof(8, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(13, conjecture,powerset(empty_set)=singleton(empty_set),file('/tmp/SRASS.s.p', t1_zfmisc_1)).
% fof(14, negated_conjecture,~(powerset(empty_set)=singleton(empty_set)),inference(assume_negation,[status(cth)],[13])).
% fof(17, negated_conjecture,~(powerset(empty_set)=singleton(empty_set)),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(18, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(19, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[21])).
% cnf(23,plain,(X1=singleton(X2)|esk1_2(X2,X1)=X2|in(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[22])).
% cnf(25,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[22])).
% cnf(26,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(27, plain,![X1]:(~(subset(X1,empty_set))|X1=empty_set),inference(fof_nnf,[status(thm)],[2])).
% fof(28, plain,![X2]:(~(subset(X2,empty_set))|X2=empty_set),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(X1=empty_set|~subset(X1,empty_set)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, 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)],[3])).
% fof(31, 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)],[30])).
% fof(32, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(((~(in(esk2_2(X4,X5),X5))|~(subset(esk2_2(X4,X5),X4)))&(in(esk2_2(X4,X5),X5)|subset(esk2_2(X4,X5),X4)))|X5=powerset(X4))),inference(skolemize,[status(esa)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5)))|~(X5=powerset(X4)))&(((~(in(esk2_2(X4,X5),X5))|~(subset(esk2_2(X4,X5),X4)))&(in(esk2_2(X4,X5),X5)|subset(esk2_2(X4,X5),X4)))|X5=powerset(X4))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))|~(X5=powerset(X4)))&((~(subset(X6,X4))|in(X6,X5))|~(X5=powerset(X4))))&(((~(in(esk2_2(X4,X5),X5))|~(subset(esk2_2(X4,X5),X4)))|X5=powerset(X4))&((in(esk2_2(X4,X5),X5)|subset(esk2_2(X4,X5),X4))|X5=powerset(X4)))),inference(distribute,[status(thm)],[33])).
% cnf(37,plain,(in(X3,X1)|X1!=powerset(X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[34])).
% cnf(38,plain,(subset(X3,X2)|X1!=powerset(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(49, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(50,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[49])).
% cnf(60,negated_conjecture,(powerset(empty_set)!=singleton(empty_set)),inference(split_conjunct,[status(thm)],[17])).
% cnf(61,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[25,theory(equality)])).
% cnf(62,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[61,theory(equality)])).
% cnf(63,plain,(in(X1,X2)|powerset(X1)!=X2),inference(spm,[status(thm)],[37,50,theory(equality)])).
% cnf(66,plain,(subset(esk1_2(X1,X2),X3)|esk1_2(X1,X2)=X1|singleton(X1)=X2|powerset(X3)!=X2),inference(spm,[status(thm)],[38,23,theory(equality)])).
% cnf(84,plain,(X1=X2|singleton(X1)!=singleton(X2)),inference(spm,[status(thm)],[26,62,theory(equality)])).
% cnf(87,plain,(in(X1,powerset(X1))),inference(er,[status(thm)],[63,theory(equality)])).
% cnf(118,plain,(empty_set=esk1_2(X1,X2)|esk1_2(X1,X2)=X1|singleton(X1)=X2|powerset(empty_set)!=X2),inference(spm,[status(thm)],[29,66,theory(equality)])).
% cnf(124,plain,(esk1_2(X1,powerset(empty_set))=empty_set|esk1_2(X1,powerset(empty_set))=X1|singleton(X1)=powerset(empty_set)),inference(er,[status(thm)],[118,theory(equality)])).
% cnf(126,plain,(esk1_2(X3,powerset(empty_set))=empty_set|singleton(X3)=powerset(empty_set)|X3!=empty_set),inference(ef,[status(thm)],[124,theory(equality)])).
% cnf(136,plain,(singleton(X1)=powerset(empty_set)|empty_set!=X1|~in(empty_set,powerset(empty_set))),inference(spm,[status(thm)],[24,126,theory(equality)])).
% cnf(140,plain,(singleton(X1)=powerset(empty_set)|empty_set!=X1|$false),inference(rw,[status(thm)],[136,87,theory(equality)])).
% cnf(141,plain,(singleton(X1)=powerset(empty_set)|empty_set!=X1),inference(cn,[status(thm)],[140,theory(equality)])).
% cnf(149,negated_conjecture,(singleton(X1)!=singleton(empty_set)|empty_set!=X1),inference(spm,[status(thm)],[60,141,theory(equality)])).
% cnf(173,negated_conjecture,(singleton(X1)!=singleton(empty_set)),inference(csr,[status(thm)],[149,84])).
% cnf(174,negated_conjecture,($false),inference(er,[status(thm)],[173,theory(equality)])).
% cnf(176,negated_conjecture,($false),174,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 64
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 62
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 96
% # ...of the previous two non-trivial : 70
% # Contextual simplify-reflections : 3
% # Paramodulations : 76
% # Factorizations : 6
% # Equation resolutions : 14
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 40
% # ...number of literals in the above : 142
% # Clause-clause subsumption calls (NU) : 54
% # Rec. Clause-clause subsumption calls : 47
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 35 leaves, 1.40+/-0.800 terms/leaf
% # Paramod-from index: 16 leaves, 1.06+/-0.242 terms/leaf
% # Paramod-into index: 34 leaves, 1.24+/-0.546 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.003 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP27993/SEU147+1.tptp
%
%------------------------------------------------------------------------------