TSTP Solution File: NUM387+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM387+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:49:08 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP16526/NUM387+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP16526/NUM387+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16526/NUM387+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 16622
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:in(X1,succ(X1)),file('/tmp/SRASS.s.p', t10_ordinal1)).
% fof(6, axiom,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_hidden)).
% fof(7, axiom,![X1]:succ(X1)=set_union2(X1,singleton(X1)),file('/tmp/SRASS.s.p', d1_ordinal1)).
% fof(33, conjecture,![X1]:~(X1=succ(X1)),file('/tmp/SRASS.s.p', t14_ordinal1)).
% fof(34, negated_conjecture,~(![X1]:~(X1=succ(X1))),inference(assume_negation,[status(cth)],[33])).
% fof(36, plain,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(46, plain,![X2]:in(X2,succ(X2)),inference(variable_rename,[status(thm)],[3])).
% cnf(47,plain,(in(X1,succ(X1))),inference(split_conjunct,[status(thm)],[46])).
% fof(52, plain,![X1]:![X2]:(~(in(X1,X2))|~(in(X2,X1))),inference(fof_nnf,[status(thm)],[36])).
% fof(53, plain,![X3]:![X4]:(~(in(X3,X4))|~(in(X4,X3))),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(~in(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X2]:succ(X2)=set_union2(X2,singleton(X2)),inference(variable_rename,[status(thm)],[7])).
% cnf(56,plain,(succ(X1)=set_union2(X1,singleton(X1))),inference(split_conjunct,[status(thm)],[55])).
% fof(143, negated_conjecture,?[X1]:X1=succ(X1),inference(fof_nnf,[status(thm)],[34])).
% fof(144, negated_conjecture,?[X2]:X2=succ(X2),inference(variable_rename,[status(thm)],[143])).
% fof(145, negated_conjecture,esk12_0=succ(esk12_0),inference(skolemize,[status(esa)],[144])).
% cnf(146,negated_conjecture,(esk12_0=succ(esk12_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(147,negated_conjecture,(set_union2(esk12_0,singleton(esk12_0))=esk12_0),inference(rw,[status(thm)],[146,56,theory(equality)]),['unfolding']).
% cnf(148,plain,(in(X1,set_union2(X1,singleton(X1)))),inference(rw,[status(thm)],[47,56,theory(equality)]),['unfolding']).
% cnf(166,negated_conjecture,(in(esk12_0,esk12_0)),inference(spm,[status(thm)],[148,147,theory(equality)])).
% cnf(182,plain,(~in(set_union2(X1,singleton(X1)),X1)),inference(spm,[status(thm)],[54,148,theory(equality)])).
% cnf(192,negated_conjecture,(~in(esk12_0,esk12_0)),inference(spm,[status(thm)],[182,147,theory(equality)])).
% cnf(212,negated_conjecture,($false),inference(sr,[status(thm)],[166,192,theory(equality)])).
% cnf(213,negated_conjecture,($false),212,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 103
% # ...of these trivial : 3
% # ...subsumed : 1
% # ...remaining for further processing: 99
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 41
% # ...of the previous two non-trivial : 26
% # Contextual simplify-reflections : 2
% # Paramodulations : 41
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 48
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 8
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 22
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 58 leaves, 1.10+/-0.357 terms/leaf
% # Paramod-from index: 32 leaves, 1.06+/-0.348 terms/leaf
% # Paramod-into index: 57 leaves, 1.07+/-0.317 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.003 s
% # Total time : 0.018 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/SystemOnTPTP16526/NUM387+1.tptp
%
%------------------------------------------------------------------------------