%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV367+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 : art01.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:48:06 EST 2010
% Result : Theorem 1.20s
% Output : Solution 1.20s
% 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/SystemOnTPTP7125/SWV367+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7125/SWV367+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7125/SWV367+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 7221
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:i(triple(X1,create_slb,X2))=create_pq,file('/tmp/SRASS.s.p', ax54)).
% fof(16, axiom,![X1]:~(contains_pq(create_pq,X1)),file('/tmp/SRASS.s.p', ax8)).
% fof(63, conjecture,![X1]:![X2]:![X3]:(contains_pq(i(triple(X1,create_slb,X2)),X3)=>i(remove_cpq(triple(X1,create_slb,X2),X3))=remove_pq(i(triple(X1,create_slb,X2)),X3)),file('/tmp/SRASS.s.p', l3_co)).
% fof(64, negated_conjecture,~(![X1]:![X2]:![X3]:(contains_pq(i(triple(X1,create_slb,X2)),X3)=>i(remove_cpq(triple(X1,create_slb,X2),X3))=remove_pq(i(triple(X1,create_slb,X2)),X3))),inference(assume_negation,[status(cth)],[63])).
% fof(67, plain,![X1]:~(contains_pq(create_pq,X1)),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(76, plain,![X3]:![X4]:i(triple(X3,create_slb,X4))=create_pq,inference(variable_rename,[status(thm)],[1])).
% cnf(77,plain,(i(triple(X1,create_slb,X2))=create_pq),inference(split_conjunct,[status(thm)],[76])).
% fof(115, plain,![X2]:~(contains_pq(create_pq,X2)),inference(variable_rename,[status(thm)],[67])).
% cnf(116,plain,(~contains_pq(create_pq,X1)),inference(split_conjunct,[status(thm)],[115])).
% fof(276, negated_conjecture,?[X1]:?[X2]:?[X3]:(contains_pq(i(triple(X1,create_slb,X2)),X3)&~(i(remove_cpq(triple(X1,create_slb,X2),X3))=remove_pq(i(triple(X1,create_slb,X2)),X3))),inference(fof_nnf,[status(thm)],[64])).
% fof(277, negated_conjecture,?[X4]:?[X5]:?[X6]:(contains_pq(i(triple(X4,create_slb,X5)),X6)&~(i(remove_cpq(triple(X4,create_slb,X5),X6))=remove_pq(i(triple(X4,create_slb,X5)),X6))),inference(variable_rename,[status(thm)],[276])).
% fof(278, negated_conjecture,(contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0)&~(i(remove_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0))=remove_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0))),inference(skolemize,[status(esa)],[277])).
% cnf(280,negated_conjecture,(contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0)),inference(split_conjunct,[status(thm)],[278])).
% cnf(282,negated_conjecture,(contains_pq(create_pq,esk7_0)),inference(rw,[status(thm)],[280,77,theory(equality)])).
% cnf(283,negated_conjecture,($false),inference(sr,[status(thm)],[282,116,theory(equality)])).
% cnf(284,negated_conjecture,($false),283,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 12
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 12
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 74
% # ...number of literals in the above : 163
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 16 leaves, 1.00+/-0.000 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.14 CPU 0.18 WC
% FINAL PrfWatch: 0.14 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP7125/SWV367+1.tptp
%
%------------------------------------------------------------------------------