TSTP Solution File: SWV387+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWV387+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:52:17 EST 2010

% Result   : Theorem 0.95s
% Output   : Solution 0.95s
% 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/SystemOnTPTP20318/SWV387+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP20318/SWV387+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20318/SWV387+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 20414
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))=>check_cpq(triple(X1,X2,X3))),file('/tmp/SRASS.s.p', l23_l027)).
% fof(43, conjecture,![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:(~(check_cpq(remove_cpq(triple(X1,X2,X3),X4)))|~(ok(remove_cpq(triple(X1,X2,X3),X4))))),file('/tmp/SRASS.s.p', l23_co)).
% fof(44, negated_conjecture,~(![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:(~(check_cpq(remove_cpq(triple(X1,X2,X3),X4)))|~(ok(remove_cpq(triple(X1,X2,X3),X4)))))),inference(assume_negation,[status(cth)],[43])).
% fof(54, negated_conjecture,~(![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:(~(check_cpq(remove_cpq(triple(X1,X2,X3),X4)))|~(ok(remove_cpq(triple(X1,X2,X3),X4)))))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(55, plain,![X1]:![X2]:![X3]:![X4]:((~(check_cpq(remove_cpq(triple(X1,X2,X3),X4)))|~(ok(remove_cpq(triple(X1,X2,X3),X4))))|check_cpq(triple(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(56, plain,![X5]:![X6]:![X7]:![X8]:((~(check_cpq(remove_cpq(triple(X5,X6,X7),X8)))|~(ok(remove_cpq(triple(X5,X6,X7),X8))))|check_cpq(triple(X5,X6,X7))),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(check_cpq(triple(X1,X2,X3))|~ok(remove_cpq(triple(X1,X2,X3),X4))|~check_cpq(remove_cpq(triple(X1,X2,X3),X4))),inference(split_conjunct,[status(thm)],[56])).
% fof(175, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(check_cpq(triple(X1,X2,X3)))&?[X4]:(check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))),inference(fof_nnf,[status(thm)],[54])).
% fof(176, negated_conjecture,?[X5]:?[X6]:?[X7]:(~(check_cpq(triple(X5,X6,X7)))&?[X8]:(check_cpq(remove_cpq(triple(X5,X6,X7),X8))&ok(remove_cpq(triple(X5,X6,X7),X8)))),inference(variable_rename,[status(thm)],[175])).
% fof(177, negated_conjecture,(~(check_cpq(triple(esk1_0,esk2_0,esk3_0)))&(check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))&ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)))),inference(skolemize,[status(esa)],[176])).
% cnf(178,negated_conjecture,(ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))),inference(split_conjunct,[status(thm)],[177])).
% cnf(179,negated_conjecture,(check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))),inference(split_conjunct,[status(thm)],[177])).
% cnf(180,negated_conjecture,(~check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[177])).
% cnf(205,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|~check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))),inference(spm,[status(thm)],[57,178,theory(equality)])).
% cnf(206,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|$false),inference(rw,[status(thm)],[205,179,theory(equality)])).
% cnf(207,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(cn,[status(thm)],[206,theory(equality)])).
% cnf(208,negated_conjecture,($false),inference(sr,[status(thm)],[207,180,theory(equality)])).
% cnf(209,negated_conjecture,($false),208,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 86
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 86
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 16
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections    : 2
% # Paramodulations                    : 12
% # Factorizations                     : 2
% # Equation resolutions               : 3
% # Current number of processed clauses: 32
% #    Positive orientable unit clauses: 13
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 5
% #    Non-unit-clauses                : 14
% # Current number of unprocessed clauses: 29
% # ...number of literals in the above : 73
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 17
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 5
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    50 leaves,   1.20+/-0.566 terms/leaf
% # Paramod-from index:           22 leaves,   1.09+/-0.417 terms/leaf
% # Paramod-into index:           45 leaves,   1.16+/-0.556 terms/leaf
% # -------------------------------------------------
% # User time              : 0.020 s
% # System time            : 0.003 s
% # Total time             : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP20318/SWV387+1.tptp
% 
%------------------------------------------------------------------------------