TSTP Solution File: SEU158+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU158+3 : TPTP v5.0.0. Released v3.2.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:21:05 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP21788/SEU158+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP21788/SEU158+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21788/SEU158+3.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 21884
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(6, conjecture,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', t37_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2))),inference(assume_negation,[status(cth)],[6])).
% fof(15, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[15])).
% cnf(17,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(in(X1,X2)|~subset(singleton(X1),X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(25, negated_conjecture,?[X1]:?[X2]:((~(subset(singleton(X1),X2))|~(in(X1,X2)))&(subset(singleton(X1),X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(26, negated_conjecture,?[X3]:?[X4]:((~(subset(singleton(X3),X4))|~(in(X3,X4)))&(subset(singleton(X3),X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[25])).
% fof(27, negated_conjecture,((~(subset(singleton(esk3_0),esk4_0))|~(in(esk3_0,esk4_0)))&(subset(singleton(esk3_0),esk4_0)|in(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[26])).
% cnf(28,negated_conjecture,(in(esk3_0,esk4_0)|subset(singleton(esk3_0),esk4_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,negated_conjecture,(~in(esk3_0,esk4_0)|~subset(singleton(esk3_0),esk4_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(31,negated_conjecture,(~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[29,17,theory(equality)])).
% cnf(35,negated_conjecture,(subset(singleton(esk3_0),esk4_0)),inference(sr,[status(thm)],[28,31,theory(equality)])).
% cnf(36,negated_conjecture,(in(esk3_0,esk4_0)),inference(spm,[status(thm)],[18,35,theory(equality)])).
% cnf(39,negated_conjecture,($false),inference(sr,[status(thm)],[36,31,theory(equality)])).
% cnf(40,negated_conjecture,($false),39,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 7
% # ...of the previous two non-trivial : 5
% # Contextual simplify-reflections : 0
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 14 leaves, 1.07+/-0.258 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 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.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP21788/SEU158+3.tptp
%
%------------------------------------------------------------------------------