TSTP Solution File: SET043+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET043+1 : TPTP v5.0.0. Released v2.0.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 : Wed Dec 29 22:52:56 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP15938/SET043+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15938/SET043+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15938/SET043+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 16034
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,~(?[X1]:![X2]:(element(X2,X1)<=>~(element(X2,X2)))),file('/tmp/SRASS.s.p', pel39)).
% fof(2, negated_conjecture,~(~(?[X1]:![X2]:(element(X2,X1)<=>~(element(X2,X2))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~(~(?[X1]:![X2]:(element(X2,X1)<=>~(element(X2,X2))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,?[X1]:![X2]:((~(element(X2,X1))|~(element(X2,X2)))&(element(X2,X2)|element(X2,X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,?[X3]:![X4]:((~(element(X4,X3))|~(element(X4,X4)))&(element(X4,X4)|element(X4,X3))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,![X4]:((~(element(X4,esk1_0))|~(element(X4,X4)))&(element(X4,X4)|element(X4,esk1_0))),inference(skolemize,[status(esa)],[5])).
% cnf(7,negated_conjecture,(element(X1,esk1_0)|element(X1,X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~element(X1,X1)|~element(X1,esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(element(esk1_0,esk1_0)),inference(ef,[status(thm)],[7,theory(equality)])).
% cnf(12,negated_conjecture,(~element(esk1_0,esk1_0)),inference(spm,[status(thm)],[8,9,theory(equality)])).
% cnf(13,negated_conjecture,($false),inference(rw,[status(thm)],[12,9,theory(equality)])).
% cnf(14,negated_conjecture,($false),inference(cn,[status(thm)],[13,theory(equality)])).
% cnf(15,negated_conjecture,($false),14,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 5
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # 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: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 4 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.003 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP15938/SET043+1.tptp
%
%------------------------------------------------------------------------------