TSTP Solution File: SET913+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET913+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 : 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 00:18:25 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/SystemOnTPTP3978/SET913+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3978/SET913+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3978/SET913+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 4074
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:~((disjoint(singleton(X1),X2)&in(X1,X2))),file('/tmp/SRASS.s.p', l25_zfmisc_1)).
% fof(6, conjecture,![X1]:![X2]:~((disjoint(singleton(X1),X2)&in(X1,X2))),file('/tmp/SRASS.s.p', t54_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:~((disjoint(singleton(X1),X2)&in(X1,X2)))),inference(assume_negation,[status(cth)],[6])).
% fof(16, plain,![X1]:![X2]:(~(disjoint(singleton(X1),X2))|~(in(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(17, plain,![X3]:![X4]:(~(disjoint(singleton(X3),X4))|~(in(X3,X4))),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(~in(X1,X2)|~disjoint(singleton(X1),X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(25, negated_conjecture,?[X1]:?[X2]:(disjoint(singleton(X1),X2)&in(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(26, negated_conjecture,?[X3]:?[X4]:(disjoint(singleton(X3),X4)&in(X3,X4)),inference(variable_rename,[status(thm)],[25])).
% fof(27, negated_conjecture,(disjoint(singleton(esk3_0),esk4_0)&in(esk3_0,esk4_0)),inference(skolemize,[status(esa)],[26])).
% cnf(28,negated_conjecture,(in(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,negated_conjecture,(disjoint(singleton(esk3_0),esk4_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,negated_conjecture,(~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[18,29,theory(equality)])).
% cnf(31,negated_conjecture,($false),inference(rw,[status(thm)],[30,28,theory(equality)])).
% cnf(32,negated_conjecture,($false),inference(cn,[status(thm)],[31,theory(equality)])).
% cnf(33,negated_conjecture,($false),32,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 11
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 5
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 9 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.002 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP3978/SET913+1.tptp
%
%------------------------------------------------------------------------------