TSTP Solution File: SWV376+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV376+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 : art09.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:49:33 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP21210/SWV376+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21210/SWV376+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21210/SWV376+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 21306
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,(![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))=>(~(ok(triple(X4,X5,X6)))=>~(ok(im_succ_cpq(triple(X4,X5,X6))))))=>![X7]:![X8]:![X9]:(~(ok(triple(X7,X8,X9)))=>![X10]:![X11]:![X12]:(succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))=>~(ok(triple(X10,X11,X12)))))),file('/tmp/SRASS.s.p', l12_induction)).
% fof(3, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(im_succ_cpq(triple(X1,X2,X3))))),file('/tmp/SRASS.s.p', l12_l13)).
% fof(4, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),file('/tmp/SRASS.s.p', ax41)).
% fof(9, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(44, conjecture,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>![X4]:![X5]:![X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))=>~(ok(triple(X4,X5,X6))))),file('/tmp/SRASS.s.p', l12_co)).
% fof(45, negated_conjecture,~(![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>![X4]:![X5]:![X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))=>~(ok(triple(X4,X5,X6)))))),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,(![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))=>(~(ok(triple(X4,X5,X6)))=>~(ok(im_succ_cpq(triple(X4,X5,X6))))))=>![X7]:![X8]:![X9]:(~(ok(triple(X7,X8,X9)))=>![X10]:![X11]:![X12]:(succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))=>~(ok(triple(X10,X11,X12)))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(47, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(im_succ_cpq(triple(X1,X2,X3))))),inference(fof_simplification,[status(thm)],[3,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)],[9,theory(equality)])).
% fof(57, negated_conjecture,~(![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>![X4]:![X5]:![X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))=>~(ok(triple(X4,X5,X6)))))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(60, plain,(?[X1]:?[X2]:?[X3]:?[X4]:?[X5]:?[X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))&(~(ok(triple(X4,X5,X6)))&ok(im_succ_cpq(triple(X4,X5,X6)))))|![X7]:![X8]:![X9]:(ok(triple(X7,X8,X9))|![X10]:![X11]:![X12]:(~(succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12)))|~(ok(triple(X10,X11,X12)))))),inference(fof_nnf,[status(thm)],[46])).
% fof(61, plain,(?[X13]:?[X14]:?[X15]:?[X16]:?[X17]:?[X18]:(succ_cpq(triple(X13,X14,X15),triple(X16,X17,X18))&(~(ok(triple(X16,X17,X18)))&ok(im_succ_cpq(triple(X16,X17,X18)))))|![X19]:![X20]:![X21]:(ok(triple(X19,X20,X21))|![X22]:![X23]:![X24]:(~(succ_cpq(triple(X19,X20,X21),triple(X22,X23,X24)))|~(ok(triple(X22,X23,X24)))))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,((succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))&(~(ok(triple(esk4_0,esk5_0,esk6_0)))&ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))))|![X19]:![X20]:![X21]:(ok(triple(X19,X20,X21))|![X22]:![X23]:![X24]:(~(succ_cpq(triple(X19,X20,X21),triple(X22,X23,X24)))|~(ok(triple(X22,X23,X24)))))),inference(skolemize,[status(esa)],[61])).
% fof(63, plain,![X19]:![X20]:![X21]:![X22]:![X23]:![X24]:(((~(succ_cpq(triple(X19,X20,X21),triple(X22,X23,X24)))|~(ok(triple(X22,X23,X24))))|ok(triple(X19,X20,X21)))|(succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))&(~(ok(triple(esk4_0,esk5_0,esk6_0)))&ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))))),inference(shift_quantors,[status(thm)],[62])).
% fof(64, plain,![X19]:![X20]:![X21]:![X22]:![X23]:![X24]:((succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))|((~(succ_cpq(triple(X19,X20,X21),triple(X22,X23,X24)))|~(ok(triple(X22,X23,X24))))|ok(triple(X19,X20,X21))))&((~(ok(triple(esk4_0,esk5_0,esk6_0)))|((~(succ_cpq(triple(X19,X20,X21),triple(X22,X23,X24)))|~(ok(triple(X22,X23,X24))))|ok(triple(X19,X20,X21))))&(ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))|((~(succ_cpq(triple(X19,X20,X21),triple(X22,X23,X24)))|~(ok(triple(X22,X23,X24))))|ok(triple(X19,X20,X21)))))),inference(distribute,[status(thm)],[63])).
% cnf(65,plain,(ok(triple(X1,X2,X3))|ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))|~ok(triple(X4,X5,X6))|~succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(ok(triple(X1,X2,X3))|~ok(triple(X4,X5,X6))|~succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))|~ok(triple(esk4_0,esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[64])).
% fof(68, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|~(ok(im_succ_cpq(triple(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[47])).
% fof(69, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|~(ok(im_succ_cpq(triple(X4,X5,X6))))),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(ok(triple(X1,X2,X3))|~ok(im_succ_cpq(triple(X1,X2,X3)))),inference(split_conjunct,[status(thm)],[69])).
% fof(71, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|X3=bad),inference(fof_nnf,[status(thm)],[48])).
% fof(72, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|X6=bad),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(X1=bad|ok(triple(X2,X3,X1))),inference(split_conjunct,[status(thm)],[72])).
% fof(86, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[49])).
% cnf(87,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[86])).
% fof(186, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(ok(triple(X1,X2,X3)))&?[X4]:?[X5]:?[X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))&ok(triple(X4,X5,X6)))),inference(fof_nnf,[status(thm)],[57])).
% fof(187, negated_conjecture,?[X7]:?[X8]:?[X9]:(~(ok(triple(X7,X8,X9)))&?[X10]:?[X11]:?[X12]:(succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))&ok(triple(X10,X11,X12)))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,(~(ok(triple(esk7_0,esk8_0,esk9_0)))&(succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0))&ok(triple(esk10_0,esk11_0,esk12_0)))),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(ok(triple(esk10_0,esk11_0,esk12_0))),inference(split_conjunct,[status(thm)],[188])).
% cnf(190,negated_conjecture,(succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0))),inference(split_conjunct,[status(thm)],[188])).
% cnf(191,negated_conjecture,(~ok(triple(esk7_0,esk8_0,esk9_0))),inference(split_conjunct,[status(thm)],[188])).
% cnf(198,negated_conjecture,(bad=esk9_0),inference(spm,[status(thm)],[191,73,theory(equality)])).
% cnf(349,negated_conjecture,(succ_cpq(triple(esk7_0,esk8_0,bad),triple(esk10_0,esk11_0,esk12_0))),inference(rw,[status(thm)],[190,198,theory(equality)])).
% cnf(352,negated_conjecture,(ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))|ok(triple(esk7_0,esk8_0,bad))|~ok(triple(esk10_0,esk11_0,esk12_0))),inference(spm,[status(thm)],[65,349,theory(equality)])).
% cnf(357,negated_conjecture,(ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))|ok(triple(esk7_0,esk8_0,bad))|$false),inference(rw,[status(thm)],[352,189,theory(equality)])).
% cnf(358,negated_conjecture,(ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))|ok(triple(esk7_0,esk8_0,bad))),inference(cn,[status(thm)],[357,theory(equality)])).
% cnf(359,negated_conjecture,(ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))),inference(sr,[status(thm)],[358,87,theory(equality)])).
% cnf(363,negated_conjecture,(ok(triple(esk4_0,esk5_0,esk6_0))),inference(spm,[status(thm)],[70,359,theory(equality)])).
% cnf(365,plain,(ok(triple(X1,X2,X3))|$false|~ok(triple(X4,X5,X6))|~succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))),inference(rw,[status(thm)],[66,363,theory(equality)])).
% cnf(366,plain,(ok(triple(X1,X2,X3))|~ok(triple(X4,X5,X6))|~succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))),inference(cn,[status(thm)],[365,theory(equality)])).
% cnf(396,negated_conjecture,(ok(triple(esk7_0,esk8_0,bad))|~ok(triple(esk10_0,esk11_0,esk12_0))),inference(spm,[status(thm)],[366,349,theory(equality)])).
% cnf(398,negated_conjecture,(ok(triple(esk7_0,esk8_0,bad))|$false),inference(rw,[status(thm)],[396,189,theory(equality)])).
% cnf(399,negated_conjecture,(ok(triple(esk7_0,esk8_0,bad))),inference(cn,[status(thm)],[398,theory(equality)])).
% cnf(400,negated_conjecture,($false),inference(sr,[status(thm)],[399,87,theory(equality)])).
% cnf(401,negated_conjecture,($false),400,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 125
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 123
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 157
% # ...of the previous two non-trivial : 140
% # Contextual simplify-reflections : 2
% # Paramodulations : 153
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 61
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 36
% # Current number of unprocessed clauses: 97
% # ...number of literals in the above : 325
% # Clause-clause subsumption calls (NU) : 47
% # Rec. Clause-clause subsumption calls : 42
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 94 leaves, 1.66+/-1.411 terms/leaf
% # Paramod-from index: 35 leaves, 1.23+/-0.483 terms/leaf
% # Paramod-into index: 85 leaves, 1.47+/-1.242 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.003 s
% # Total time : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP21210/SWV376+1.tptp
%
%------------------------------------------------------------------------------