%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC035+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 : art09.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 06:53:11 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP13799/SWC035+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13799/SWC035+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13799/SWC035+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 13895
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|~(X4=X3))|nil=X1))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|~(X4=X3))|nil=X1)))))),inference(assume_negation,[status(cth)],[96])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((nil=X2&X2=X4)&X1=X3)&X4=X3)&~(nil=X1)))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&((((nil=X6&X6=X8)&X5=X7)&X8=X7)&~(nil=X5)))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((nil=esk49_0&esk49_0=esk51_0)&esk48_0=esk50_0)&esk51_0=esk50_0)&~(nil=esk48_0)))))),inference(skolemize,[status(esa)],[568])).
% cnf(570,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(571,negated_conjecture,(esk51_0=esk50_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(572,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(573,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(574,negated_conjecture,(nil=esk49_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(579,negated_conjecture,(esk50_0!=nil),inference(rw,[status(thm)],[570,572,theory(equality)])).
% cnf(580,negated_conjecture,(esk51_0=nil),inference(rw,[status(thm)],[573,574,theory(equality)])).
% cnf(581,negated_conjecture,(nil=esk50_0),inference(rw,[status(thm)],[571,580,theory(equality)])).
% cnf(1294,negated_conjecture,($false),inference(rw,[status(thm)],[579,581,theory(equality)])).
% cnf(1295,negated_conjecture,($false),inference(cn,[status(thm)],[1294,theory(equality)])).
% cnf(1296,negated_conjecture,($false),1295,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 198
% # ...of these trivial : 4
% # ...subsumed : 1
% # ...remaining for further processing: 193
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 539
% # ...of the previous two non-trivial : 440
% # Contextual simplify-reflections : 2
% # Paramodulations : 448
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 184
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 439
% # ...number of literals in the above : 3156
% # Clause-clause subsumption calls (NU) : 832
% # Rec. Clause-clause subsumption calls : 149
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 220 leaves, 1.37+/-1.238 terms/leaf
% # Paramod-from index: 96 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 185 leaves, 1.26+/-1.110 terms/leaf
% # -------------------------------------------------
% # User time : 0.063 s
% # System time : 0.005 s
% # Total time : 0.068 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP13799/SWC035+1.tptp
%
%------------------------------------------------------------------------------