TSTP Solution File: SWB002+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWB002+2 : TPTP v5.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 Feb 16 02:55:37 EST 2011
% Result : Theorem 0.49s
% Output : Solution 0.49s
% 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/SystemOnTPTP25639/SWB002+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25639/SWB002+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25639/SWB002+2.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 25727
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.008 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,?[X1]:(iext(uri_ex_p,uri_ex_s,X1)&iext(uri_ex_q,X1,uri_ex_s)),file('/tmp/SRASS.s.p', testcase_premise_fullish_002_Existential_Blank_Nodes)).
% fof(2, conjecture,?[X2]:?[X3]:(iext(uri_ex_p,X2,X3)&iext(uri_ex_q,X3,X2)),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_002_Existential_Blank_Nodes)).
% fof(3, negated_conjecture,~(?[X2]:?[X3]:(iext(uri_ex_p,X2,X3)&iext(uri_ex_q,X3,X2))),inference(assume_negation,[status(cth)],[2])).
% fof(4, plain,?[X2]:(iext(uri_ex_p,uri_ex_s,X2)&iext(uri_ex_q,X2,uri_ex_s)),inference(variable_rename,[status(thm)],[1])).
% fof(5, plain,(iext(uri_ex_p,uri_ex_s,esk1_0)&iext(uri_ex_q,esk1_0,uri_ex_s)),inference(skolemize,[status(esa)],[4])).
% cnf(6,plain,(iext(uri_ex_q,esk1_0,uri_ex_s)),inference(split_conjunct,[status(thm)],[5])).
% cnf(7,plain,(iext(uri_ex_p,uri_ex_s,esk1_0)),inference(split_conjunct,[status(thm)],[5])).
% fof(8, negated_conjecture,![X2]:![X3]:(~(iext(uri_ex_p,X2,X3))|~(iext(uri_ex_q,X3,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(9, negated_conjecture,![X4]:![X5]:(~(iext(uri_ex_p,X4,X5))|~(iext(uri_ex_q,X5,X4))),inference(variable_rename,[status(thm)],[8])).
% cnf(10,negated_conjecture,(~iext(uri_ex_q,X1,X2)|~iext(uri_ex_p,X2,X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(11,negated_conjecture,(~iext(uri_ex_q,esk1_0,uri_ex_s)),inference(spm,[status(thm)],[10,7,theory(equality)])).
% cnf(12,negated_conjecture,($false),inference(rw,[status(thm)],[11,6,theory(equality)])).
% cnf(13,negated_conjecture,($false),inference(cn,[status(thm)],[12,theory(equality)])).
% cnf(14,negated_conjecture,($false),13,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 6
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 7 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.002 s
% # Total time : 0.008 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP25639/SWB002+2.tptp
%
%------------------------------------------------------------------------------