TSTP Solution File: SWV383+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV383+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:20 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP19281/SWV383+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19281/SWV383+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19281/SWV383+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 19378
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:((~(check_cpq(triple(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)))|~(check_cpq(triple(X4,X5,X6)))))),file('/tmp/SRASS.s.p', l19_l20)).
% fof(43, conjecture,![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:![X5]:![X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))=>(~(ok(triple(X4,X5,X6)))|~(check_cpq(triple(X4,X5,X6)))))),file('/tmp/SRASS.s.p', l19_co)).
% fof(44, negated_conjecture,~(![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:![X5]:![X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))=>(~(ok(triple(X4,X5,X6)))|~(check_cpq(triple(X4,X5,X6))))))),inference(assume_negation,[status(cth)],[43])).
% fof(45, plain,![X1]:![X2]:![X3]:((~(check_cpq(triple(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)))|~(check_cpq(triple(X4,X5,X6)))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(55, negated_conjecture,~(![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:![X5]:![X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))=>(~(ok(triple(X4,X5,X6)))|~(check_cpq(triple(X4,X5,X6))))))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(58, plain,![X1]:![X2]:![X3]:((check_cpq(triple(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)))|~(check_cpq(triple(X4,X5,X6)))))),inference(fof_nnf,[status(thm)],[45])).
% fof(59, plain,![X7]:![X8]:![X9]:((check_cpq(triple(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)))|~(check_cpq(triple(X10,X11,X12)))))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((~(succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12)))|(~(ok(triple(X10,X11,X12)))|~(check_cpq(triple(X10,X11,X12)))))|(check_cpq(triple(X7,X8,X9))&ok(triple(X7,X8,X9)))),inference(shift_quantors,[status(thm)],[59])).
% fof(61, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((check_cpq(triple(X7,X8,X9))|(~(succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12)))|(~(ok(triple(X10,X11,X12)))|~(check_cpq(triple(X10,X11,X12))))))&(ok(triple(X7,X8,X9))|(~(succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12)))|(~(ok(triple(X10,X11,X12)))|~(check_cpq(triple(X10,X11,X12))))))),inference(distribute,[status(thm)],[60])).
% cnf(63,plain,(check_cpq(triple(X4,X5,X6))|~check_cpq(triple(X1,X2,X3))|~ok(triple(X1,X2,X3))|~succ_cpq(triple(X4,X5,X6),triple(X1,X2,X3))),inference(split_conjunct,[status(thm)],[61])).
% fof(179, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(check_cpq(triple(X1,X2,X3)))&?[X4]:?[X5]:?[X6]:(succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))&(ok(triple(X4,X5,X6))&check_cpq(triple(X4,X5,X6))))),inference(fof_nnf,[status(thm)],[55])).
% fof(180, negated_conjecture,?[X7]:?[X8]:?[X9]:(~(check_cpq(triple(X7,X8,X9)))&?[X10]:?[X11]:?[X12]:(succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))&(ok(triple(X10,X11,X12))&check_cpq(triple(X10,X11,X12))))),inference(variable_rename,[status(thm)],[179])).
% fof(181, negated_conjecture,(~(check_cpq(triple(esk1_0,esk2_0,esk3_0)))&(succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))&(ok(triple(esk4_0,esk5_0,esk6_0))&check_cpq(triple(esk4_0,esk5_0,esk6_0))))),inference(skolemize,[status(esa)],[180])).
% cnf(182,negated_conjecture,(check_cpq(triple(esk4_0,esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[181])).
% cnf(183,negated_conjecture,(ok(triple(esk4_0,esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[181])).
% cnf(184,negated_conjecture,(succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[181])).
% cnf(185,negated_conjecture,(~check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[181])).
% cnf(246,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|~ok(triple(esk4_0,esk5_0,esk6_0))|~check_cpq(triple(esk4_0,esk5_0,esk6_0))),inference(spm,[status(thm)],[63,184,theory(equality)])).
% cnf(247,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|$false|~check_cpq(triple(esk4_0,esk5_0,esk6_0))),inference(rw,[status(thm)],[246,183,theory(equality)])).
% cnf(248,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|$false|$false),inference(rw,[status(thm)],[247,182,theory(equality)])).
% cnf(249,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(cn,[status(thm)],[248,theory(equality)])).
% cnf(250,negated_conjecture,($false),inference(sr,[status(thm)],[249,185,theory(equality)])).
% cnf(251,negated_conjecture,($false),250,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 46
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 50
% # ...of the previous two non-trivial : 39
% # Contextual simplify-reflections : 1
% # Paramodulations : 46
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 25
% # Current number of unprocessed clauses: 47
% # ...number of literals in the above : 128
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 9
% # 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: 65 leaves, 1.71+/-1.586 terms/leaf
% # Paramod-from index: 28 leaves, 1.11+/-0.409 terms/leaf
% # Paramod-into index: 58 leaves, 1.52+/-1.380 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP19281/SWV383+1.tptp
%
%------------------------------------------------------------------------------