%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV397+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 : art05.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:54:05 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/SystemOnTPTP31400/SWV397+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31400/SWV397+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31400/SWV397+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 31496
% 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(1, axiom,![X1]:![X2]:![X3]:![X4]:(~(contains_slb(X2,X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),file('/tmp/SRASS.s.p', ax43)).
% fof(10, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(42, conjecture,![X1]:![X2]:![X3]:![X4]:(ok(remove_cpq(triple(X1,X2,X3),X4))=>contains_slb(X2,X4)),file('/tmp/SRASS.s.p', l33_co)).
% fof(43, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(ok(remove_cpq(triple(X1,X2,X3),X4))=>contains_slb(X2,X4))),inference(assume_negation,[status(cth)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:![X4]:(~(contains_slb(X2,X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(47, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(53, plain,![X1]:![X2]:![X3]:![X4]:(contains_slb(X2,X4)|remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),inference(fof_nnf,[status(thm)],[44])).
% fof(54, plain,![X5]:![X6]:![X7]:![X8]:(contains_slb(X6,X8)|remove_cpq(triple(X5,X6,X7),X8)=triple(X5,X6,bad)),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[54])).
% fof(77, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[47])).
% cnf(78,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[77])).
% fof(170, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(ok(remove_cpq(triple(X1,X2,X3),X4))&~(contains_slb(X2,X4))),inference(fof_nnf,[status(thm)],[43])).
% fof(171, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(ok(remove_cpq(triple(X5,X6,X7),X8))&~(contains_slb(X6,X8))),inference(variable_rename,[status(thm)],[170])).
% fof(172, negated_conjecture,(ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))&~(contains_slb(esk2_0,esk4_0))),inference(skolemize,[status(esa)],[171])).
% cnf(173,negated_conjecture,(~contains_slb(esk2_0,esk4_0)),inference(split_conjunct,[status(thm)],[172])).
% cnf(174,negated_conjecture,(ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))),inference(split_conjunct,[status(thm)],[172])).
% cnf(190,negated_conjecture,(ok(triple(esk1_0,esk2_0,bad))|contains_slb(esk2_0,esk4_0)),inference(spm,[status(thm)],[174,55,theory(equality)])).
% cnf(191,negated_conjecture,(contains_slb(esk2_0,esk4_0)),inference(sr,[status(thm)],[190,78,theory(equality)])).
% cnf(192,negated_conjecture,($false),inference(sr,[status(thm)],[191,173,theory(equality)])).
% cnf(193,negated_conjecture,($false),192,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 79
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 79
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 10
% # ...of the previous two non-trivial : 5
% # Contextual simplify-reflections : 2
% # Paramodulations : 6
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 26
% # ...number of literals in the above : 64
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 13
% # 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: 40 leaves, 1.25+/-0.622 terms/leaf
% # Paramod-from index: 18 leaves, 1.11+/-0.458 terms/leaf
% # Paramod-into index: 37 leaves, 1.19+/-0.608 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.005 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31400/SWV397+1.tptp
%
%------------------------------------------------------------------------------