TSTP Solution File: NUM405+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM405+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 : 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 : Wed Dec 29 18:51:16 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP17821/NUM405+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17821/NUM405+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17821/NUM405+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 17917
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:?[X2]:![X3]:(in(X3,X2)<=>(in(X3,X1)&ordinal(X3))),file('/tmp/SRASS.s.p', s1_xboole_0__e2_43__ordinal1)).
% fof(3, axiom,![X1]:~(![X2]:(in(X2,X1)<=>ordinal(X2))),file('/tmp/SRASS.s.p', t37_ordinal1)).
% fof(33, conjecture,![X1]:~(![X2]:(ordinal(X2)=>in(X2,X1))),file('/tmp/SRASS.s.p', t38_ordinal1)).
% fof(34, negated_conjecture,~(![X1]:~(![X2]:(ordinal(X2)=>in(X2,X1)))),inference(assume_negation,[status(cth)],[33])).
% fof(42, plain,![X1]:?[X2]:![X3]:((~(in(X3,X2))|(in(X3,X1)&ordinal(X3)))&((~(in(X3,X1))|~(ordinal(X3)))|in(X3,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(43, plain,![X4]:?[X5]:![X6]:((~(in(X6,X5))|(in(X6,X4)&ordinal(X6)))&((~(in(X6,X4))|~(ordinal(X6)))|in(X6,X5))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X4]:![X6]:((~(in(X6,esk1_1(X4)))|(in(X6,X4)&ordinal(X6)))&((~(in(X6,X4))|~(ordinal(X6)))|in(X6,esk1_1(X4)))),inference(skolemize,[status(esa)],[43])).
% fof(45, plain,![X4]:![X6]:(((in(X6,X4)|~(in(X6,esk1_1(X4))))&(ordinal(X6)|~(in(X6,esk1_1(X4)))))&((~(in(X6,X4))|~(ordinal(X6)))|in(X6,esk1_1(X4)))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(in(X1,esk1_1(X2))|~ordinal(X1)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,plain,(ordinal(X1)|~in(X1,esk1_1(X2))),inference(split_conjunct,[status(thm)],[45])).
% fof(49, plain,![X1]:?[X2]:((~(in(X2,X1))|~(ordinal(X2)))&(in(X2,X1)|ordinal(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(50, plain,![X3]:?[X4]:((~(in(X4,X3))|~(ordinal(X4)))&(in(X4,X3)|ordinal(X4))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X3]:((~(in(esk2_1(X3),X3))|~(ordinal(esk2_1(X3))))&(in(esk2_1(X3),X3)|ordinal(esk2_1(X3)))),inference(skolemize,[status(esa)],[50])).
% cnf(52,plain,(ordinal(esk2_1(X1))|in(esk2_1(X1),X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(~ordinal(esk2_1(X1))|~in(esk2_1(X1),X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(174, negated_conjecture,?[X1]:![X2]:(~(ordinal(X2))|in(X2,X1)),inference(fof_nnf,[status(thm)],[34])).
% fof(175, negated_conjecture,?[X3]:![X4]:(~(ordinal(X4))|in(X4,X3)),inference(variable_rename,[status(thm)],[174])).
% fof(176, negated_conjecture,![X4]:(~(ordinal(X4))|in(X4,esk17_0)),inference(skolemize,[status(esa)],[175])).
% cnf(177,negated_conjecture,(in(X1,esk17_0)|~ordinal(X1)),inference(split_conjunct,[status(thm)],[176])).
% cnf(215,plain,(ordinal(esk2_1(esk1_1(X1)))),inference(spm,[status(thm)],[47,52,theory(equality)])).
% cnf(221,plain,(~ordinal(esk2_1(esk1_1(X1)))|~in(esk2_1(esk1_1(X1)),X1)),inference(spm,[status(thm)],[53,46,theory(equality)])).
% cnf(277,plain,($false|~in(esk2_1(esk1_1(X1)),X1)),inference(rw,[status(thm)],[221,215,theory(equality)])).
% cnf(278,plain,(~in(esk2_1(esk1_1(X1)),X1)),inference(cn,[status(thm)],[277,theory(equality)])).
% cnf(280,negated_conjecture,(~ordinal(esk2_1(esk1_1(esk17_0)))),inference(spm,[status(thm)],[278,177,theory(equality)])).
% cnf(282,negated_conjecture,($false),inference(rw,[status(thm)],[280,215,theory(equality)])).
% cnf(283,negated_conjecture,($false),inference(cn,[status(thm)],[282,theory(equality)])).
% cnf(284,negated_conjecture,($false),283,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 171
% # ...of these trivial : 7
% # ...subsumed : 11
% # ...remaining for further processing: 153
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 13
% # Generated clauses : 64
% # ...of the previous two non-trivial : 49
% # Contextual simplify-reflections : 3
% # Paramodulations : 64
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 74
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 12
% # ...number of literals in the above : 30
% # Clause-clause subsumption calls (NU) : 33
% # Rec. Clause-clause subsumption calls : 32
% # Unit Clause-clause subsumption calls : 22
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 82 leaves, 1.05+/-0.215 terms/leaf
% # Paramod-from index: 50 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 79 leaves, 1.05+/-0.219 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.005 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP17821/NUM405+1.tptp
%
%------------------------------------------------------------------------------