TSTP Solution File: SWB002+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWB002+1 : TPTP v5.2.0. Released v5.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 Feb 16 02:55:16 EST 2011
% Result : Theorem 17.19s
% Output : Solution 17.19s
% 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/SystemOnTPTP5045/SWB002+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% WARNING: TreeLimitedRun lost 0.65s, total lost is 0.65s
% found
% SZS status THM for /tmp/SystemOnTPTP5045/SWB002+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5045/SWB002+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 5169
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.141 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(560, conjecture,?[X43]:?[X44]:(iext(uri_ex_p,X43,X44)&iext(uri_ex_q,X44,X43)),file('/tmp/SRASS.s.p', testcase_conclusion_fullish_002_Existential_Blank_Nodes)).
% fof(561, negated_conjecture,~(?[X43]:?[X44]:(iext(uri_ex_p,X43,X44)&iext(uri_ex_q,X44,X43))),inference(assume_negation,[status(cth)],[560])).
% fof(588, 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(589, plain,(iext(uri_ex_p,uri_ex_s,esk1_0)&iext(uri_ex_q,esk1_0,uri_ex_s)),inference(skolemize,[status(esa)],[588])).
% cnf(590,plain,(iext(uri_ex_q,esk1_0,uri_ex_s)),inference(split_conjunct,[status(thm)],[589])).
% cnf(591,plain,(iext(uri_ex_p,uri_ex_s,esk1_0)),inference(split_conjunct,[status(thm)],[589])).
% fof(2831, negated_conjecture,![X43]:![X44]:(~(iext(uri_ex_p,X43,X44))|~(iext(uri_ex_q,X44,X43))),inference(fof_nnf,[status(thm)],[561])).
% fof(2832, negated_conjecture,![X45]:![X46]:(~(iext(uri_ex_p,X45,X46))|~(iext(uri_ex_q,X46,X45))),inference(variable_rename,[status(thm)],[2831])).
% cnf(2833,negated_conjecture,(~iext(uri_ex_q,X1,X2)|~iext(uri_ex_p,X2,X1)),inference(split_conjunct,[status(thm)],[2832])).
% cnf(3171,negated_conjecture,(~iext(uri_ex_p,uri_ex_s,esk1_0)),inference(spm,[status(thm)],[2833,590,theory(equality)])).
% cnf(3172,negated_conjecture,($false),inference(rw,[status(thm)],[3171,591,theory(equality)])).
% cnf(3173,negated_conjecture,($false),inference(cn,[status(thm)],[3172,theory(equality)])).
% cnf(3174,negated_conjecture,($false),3173,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1326
% # ...of these trivial : 3
% # ...subsumed : 56
% # ...remaining for further processing: 1267
% # Other redundant clauses eliminated : 16
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 0
% # Generated clauses : 76
% # ...of the previous two non-trivial : 75
% # Contextual simplify-reflections : 88
% # Paramodulations : 60
% # Factorizations : 0
% # Equation resolutions : 16
% # Current number of processed clauses: 152
% # Positive orientable unit clauses: 142
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 7
% # Current number of unprocessed clauses: 1000
% # ...number of literals in the above : 4840
% # Clause-clause subsumption calls (NU) : 460926
% # Rec. Clause-clause subsumption calls : 28004
% # Unit Clause-clause subsumption calls : 861
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 293 leaves, 1.00+/-0.058 terms/leaf
% # Paramod-from index: 143 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 289 leaves, 1.00+/-0.059 terms/leaf
% # -------------------------------------------------
% # User time : 0.469 s
% # System time : 0.010 s
% # Total time : 0.479 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.72 CPU 0.78 WC
% FINAL PrfWatch: 0.72 CPU 0.78 WC
% SZS output end Solution for /tmp/SystemOnTPTP5045/SWB002+1.tptp
%
%------------------------------------------------------------------------------