TSTP Solution File: SWV385+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV385+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 08:51:54 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP19800/SWV385+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19800/SWV385+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19800/SWV385+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 19896
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(im_succ_cpq(triple(X1,X2,X3))))),file('/tmp/SRASS.s.p', l21_li1316)).
% fof(2, axiom,![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>(~(check_cpq(im_succ_cpq(triple(X1,X2,X3))))|~(ok(im_succ_cpq(triple(X1,X2,X3)))))),file('/tmp/SRASS.s.p', l21_li2225)).
% fof(4, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),file('/tmp/SRASS.s.p', ax41)).
% fof(8, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(44, conjecture,![X1]:![X2]:![X3]:((~(check_cpq(triple(X1,X2,X3)))|~(ok(triple(X1,X2,X3))))=>(~(check_cpq(im_succ_cpq(triple(X1,X2,X3))))|~(ok(im_succ_cpq(triple(X1,X2,X3)))))),file('/tmp/SRASS.s.p', l21_co)).
% fof(45, negated_conjecture,~(![X1]:![X2]:![X3]:((~(check_cpq(triple(X1,X2,X3)))|~(ok(triple(X1,X2,X3))))=>(~(check_cpq(im_succ_cpq(triple(X1,X2,X3))))|~(ok(im_succ_cpq(triple(X1,X2,X3))))))),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(im_succ_cpq(triple(X1,X2,X3))))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(47, plain,![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>(~(check_cpq(im_succ_cpq(triple(X1,X2,X3))))|~(ok(im_succ_cpq(triple(X1,X2,X3)))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(48, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(49, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(57, negated_conjecture,~(![X1]:![X2]:![X3]:((~(check_cpq(triple(X1,X2,X3)))|~(ok(triple(X1,X2,X3))))=>(~(check_cpq(im_succ_cpq(triple(X1,X2,X3))))|~(ok(im_succ_cpq(triple(X1,X2,X3))))))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(58, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|~(ok(im_succ_cpq(triple(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[46])).
% fof(59, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|~(ok(im_succ_cpq(triple(X4,X5,X6))))),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(ok(triple(X1,X2,X3))|~ok(im_succ_cpq(triple(X1,X2,X3)))),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X2]:![X3]:(check_cpq(triple(X1,X2,X3))|(~(check_cpq(im_succ_cpq(triple(X1,X2,X3))))|~(ok(im_succ_cpq(triple(X1,X2,X3)))))),inference(fof_nnf,[status(thm)],[47])).
% fof(62, plain,![X4]:![X5]:![X6]:(check_cpq(triple(X4,X5,X6))|(~(check_cpq(im_succ_cpq(triple(X4,X5,X6))))|~(ok(im_succ_cpq(triple(X4,X5,X6)))))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(check_cpq(triple(X1,X2,X3))|~ok(im_succ_cpq(triple(X1,X2,X3)))|~check_cpq(im_succ_cpq(triple(X1,X2,X3)))),inference(split_conjunct,[status(thm)],[62])).
% fof(66, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|X3=bad),inference(fof_nnf,[status(thm)],[48])).
% fof(67, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|X6=bad),inference(variable_rename,[status(thm)],[66])).
% cnf(68,plain,(X1=bad|ok(triple(X2,X3,X1))),inference(split_conjunct,[status(thm)],[67])).
% fof(76, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[49])).
% cnf(77,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[76])).
% fof(181, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(check_cpq(triple(X1,X2,X3)))|~(ok(triple(X1,X2,X3))))&(check_cpq(im_succ_cpq(triple(X1,X2,X3)))&ok(im_succ_cpq(triple(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[57])).
% fof(182, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(check_cpq(triple(X4,X5,X6)))|~(ok(triple(X4,X5,X6))))&(check_cpq(im_succ_cpq(triple(X4,X5,X6)))&ok(im_succ_cpq(triple(X4,X5,X6))))),inference(variable_rename,[status(thm)],[181])).
% fof(183, negated_conjecture,((~(check_cpq(triple(esk1_0,esk2_0,esk3_0)))|~(ok(triple(esk1_0,esk2_0,esk3_0))))&(check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0)))&ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))))),inference(skolemize,[status(esa)],[182])).
% cnf(184,negated_conjecture,(ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[183])).
% cnf(185,negated_conjecture,(check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[183])).
% cnf(186,negated_conjecture,(~ok(triple(esk1_0,esk2_0,esk3_0))|~check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[183])).
% cnf(193,negated_conjecture,(ok(triple(esk1_0,esk2_0,esk3_0))),inference(spm,[status(thm)],[60,184,theory(equality)])).
% cnf(194,negated_conjecture,(bad=esk3_0|~check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(spm,[status(thm)],[186,68,theory(equality)])).
% cnf(203,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|~check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0)))),inference(spm,[status(thm)],[63,184,theory(equality)])).
% cnf(204,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|$false),inference(rw,[status(thm)],[203,185,theory(equality)])).
% cnf(205,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(cn,[status(thm)],[204,theory(equality)])).
% cnf(327,negated_conjecture,(esk3_0=bad|$false),inference(rw,[status(thm)],[194,205,theory(equality)])).
% cnf(328,negated_conjecture,(esk3_0=bad),inference(cn,[status(thm)],[327,theory(equality)])).
% cnf(329,negated_conjecture,(ok(triple(esk1_0,esk2_0,bad))),inference(rw,[status(thm)],[193,328,theory(equality)])).
% cnf(330,negated_conjecture,($false),inference(sr,[status(thm)],[329,77,theory(equality)])).
% cnf(331,negated_conjecture,($false),330,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 115
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 115
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 115
% # ...of the previous two non-trivial : 107
% # Contextual simplify-reflections : 2
% # Paramodulations : 111
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 54
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 34
% # Current number of unprocessed clauses: 98
% # ...number of literals in the above : 321
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 25
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 74 leaves, 1.76+/-1.514 terms/leaf
% # Paramod-from index: 29 leaves, 1.28+/-0.518 terms/leaf
% # Paramod-into index: 63 leaves, 1.59+/-1.410 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.004 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP19800/SWV385+1.tptp
%
%------------------------------------------------------------------------------