TSTP Solution File: SET045+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET045+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 : art04.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:53:14 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/SystemOnTPTP19412/SET045+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19412/SET045+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19412/SET045+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 19508
% 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(1, axiom,![X1]:?[X2]:![X3]:(element(X3,X2)<=>(element(X3,X1)&~(element(X3,X3)))),file('/tmp/SRASS.s.p', pel41_1)).
% fof(2, conjecture,~(?[X1]:![X3]:element(X3,X1)),file('/tmp/SRASS.s.p', pel41)).
% fof(3, negated_conjecture,~(~(?[X1]:![X3]:element(X3,X1))),inference(assume_negation,[status(cth)],[2])).
% fof(4, plain,![X1]:?[X2]:![X3]:(element(X3,X2)<=>(element(X3,X1)&~(element(X3,X3)))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(5, plain,![X1]:?[X2]:![X3]:((~(element(X3,X2))|(element(X3,X1)&~(element(X3,X3))))&((~(element(X3,X1))|element(X3,X3))|element(X3,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(6, plain,![X4]:?[X5]:![X6]:((~(element(X6,X5))|(element(X6,X4)&~(element(X6,X6))))&((~(element(X6,X4))|element(X6,X6))|element(X6,X5))),inference(variable_rename,[status(thm)],[5])).
% fof(7, plain,![X4]:![X6]:((~(element(X6,esk1_1(X4)))|(element(X6,X4)&~(element(X6,X6))))&((~(element(X6,X4))|element(X6,X6))|element(X6,esk1_1(X4)))),inference(skolemize,[status(esa)],[6])).
% fof(8, plain,![X4]:![X6]:(((element(X6,X4)|~(element(X6,esk1_1(X4))))&(~(element(X6,X6))|~(element(X6,esk1_1(X4)))))&((~(element(X6,X4))|element(X6,X6))|element(X6,esk1_1(X4)))),inference(distribute,[status(thm)],[7])).
% cnf(9,plain,(element(X1,esk1_1(X2))|element(X1,X1)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[8])).
% cnf(10,plain,(~element(X1,esk1_1(X2))|~element(X1,X1)),inference(split_conjunct,[status(thm)],[8])).
% fof(12, negated_conjecture,?[X1]:![X3]:element(X3,X1),inference(fof_nnf,[status(thm)],[3])).
% fof(13, negated_conjecture,?[X4]:![X5]:element(X5,X4),inference(variable_rename,[status(thm)],[12])).
% fof(14, negated_conjecture,![X5]:element(X5,esk2_0),inference(skolemize,[status(esa)],[13])).
% cnf(15,negated_conjecture,(element(X1,esk2_0)),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,negated_conjecture,(element(X1,esk1_1(esk2_0))|element(X1,X1)),inference(spm,[status(thm)],[9,15,theory(equality)])).
% cnf(20,negated_conjecture,(element(esk1_1(X1),esk1_1(esk2_0))|~element(esk1_1(X1),esk1_1(X1))),inference(spm,[status(thm)],[10,16,theory(equality)])).
% cnf(26,negated_conjecture,(element(esk1_1(X1),esk1_1(esk2_0))),inference(csr,[status(thm)],[20,16])).
% cnf(29,negated_conjecture,(~element(esk1_1(X1),esk1_1(X1))),inference(spm,[status(thm)],[10,26,theory(equality)])).
% cnf(32,negated_conjecture,($false),inference(spm,[status(thm)],[29,26,theory(equality)])).
% cnf(34,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 : 14
% # ...of the previous two non-trivial : 9
% # Contextual simplify-reflections : 1
% # Paramodulations : 12
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 7
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 11
% # Clause-clause subsumption calls (NU) : 7
% # Rec. Clause-clause subsumption calls : 7
% # 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: 10 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 9 leaves, 1.22+/-0.416 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/SystemOnTPTP19412/SET045+1.tptp
%
%------------------------------------------------------------------------------