TSTP Solution File: SEU143+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU143+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 : art07.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:16:24 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP19421/SEU143+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19421/SEU143+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19421/SEU143+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 19517
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 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]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(9, conjecture,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:~(singleton(X1)=empty_set)),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(14, 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(15, 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)],[14])).
% fof(16, 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)],[15])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% cnf(21,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[18])).
% fof(23, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[11])).
% fof(24, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk2_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk2_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[25])).
% cnf(28,plain,(X1!=empty_set|~in(X2,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(41, negated_conjecture,?[X1]:singleton(X1)=empty_set,inference(fof_nnf,[status(thm)],[10])).
% fof(42, negated_conjecture,?[X2]:singleton(X2)=empty_set,inference(variable_rename,[status(thm)],[41])).
% fof(43, negated_conjecture,singleton(esk5_0)=empty_set,inference(skolemize,[status(esa)],[42])).
% cnf(44,negated_conjecture,(singleton(esk5_0)=empty_set),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[21,theory(equality)])).
% cnf(46,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[45,theory(equality)])).
% cnf(58,negated_conjecture,(in(esk5_0,empty_set)),inference(spm,[status(thm)],[46,44,theory(equality)])).
% cnf(62,negated_conjecture,($false),inference(spm,[status(thm)],[28,58,theory(equality)])).
% cnf(65,negated_conjecture,($false),62,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 26
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 20
% # ...of the previous two non-trivial : 14
% # Contextual simplify-reflections : 0
% # Paramodulations : 17
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 14
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 23
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 17 leaves, 1.18+/-0.513 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 16 leaves, 1.19+/-0.527 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.002 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP19421/SEU143+1.tptp
%
%------------------------------------------------------------------------------