%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV011+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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:08:43 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP1543/SWV011+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1543/SWV011+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1543/SWV011+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 1639
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,b_holds(key(generate_key(an_a_nonce),a)),file('/tmp/SRASS.s.p', ax1)).
% fof(2, axiom,a_holds(key(generate_key(an_a_nonce),b)),file('/tmp/SRASS.s.p', ax3)).
% fof(17, conjecture,?[X1]:(a_holds(key(X1,b))&b_holds(key(X1,a))),file('/tmp/SRASS.s.p', co1)).
% fof(18, negated_conjecture,~(?[X1]:(a_holds(key(X1,b))&b_holds(key(X1,a)))),inference(assume_negation,[status(cth)],[17])).
% cnf(19,plain,(b_holds(key(generate_key(an_a_nonce),a))),inference(split_conjunct,[status(thm)],[1])).
% cnf(20,plain,(a_holds(key(generate_key(an_a_nonce),b))),inference(split_conjunct,[status(thm)],[2])).
% fof(35, negated_conjecture,![X1]:(~(a_holds(key(X1,b)))|~(b_holds(key(X1,a)))),inference(fof_nnf,[status(thm)],[18])).
% fof(36, negated_conjecture,![X2]:(~(a_holds(key(X2,b)))|~(b_holds(key(X2,a)))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,negated_conjecture,(~b_holds(key(X1,a))|~a_holds(key(X1,b))),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,negated_conjecture,(~b_holds(key(generate_key(an_a_nonce),a))),inference(spm,[status(thm)],[37,20,theory(equality)])).
% cnf(39,negated_conjecture,($false),inference(rw,[status(thm)],[38,19,theory(equality)])).
% cnf(40,negated_conjecture,($false),inference(cn,[status(thm)],[39,theory(equality)])).
% cnf(41,negated_conjecture,($false),40,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 29
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 5
% # 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 : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 30 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 27 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.004 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP1543/SWV011+1.tptp
%
%------------------------------------------------------------------------------