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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC328+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 : art02.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 07:49:56 EST 2010

% Result   : Theorem 1.22s
% Output   : Solution 1.22s
% 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/SystemOnTPTP13301/SWC328+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP13301/SWC328+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13301/SWC328+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 13397
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(7, axiom,equalelemsP(nil),file('/tmp/SRASS.s.p', ax74)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(nil=X3)|~(X2=X4))|~(X1=X3))|(segmentP(X2,X1)&equalelemsP(X1))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(nil=X3)|~(X2=X4))|~(X1=X3))|(segmentP(X2,X1)&equalelemsP(X1)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(115, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[5])).
% fof(116, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[115])).
% cnf(117,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[116])).
% cnf(123,plain,(equalelemsP(nil)),inference(split_conjunct,[status(thm)],[7])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((nil=X3&X2=X4)&X1=X3)&(~(segmentP(X2,X1))|~(equalelemsP(X1)))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&(((nil=X7&X6=X8)&X5=X7)&(~(segmentP(X6,X5))|~(equalelemsP(X5)))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((nil=esk50_0&esk49_0=esk51_0)&esk48_0=esk50_0)&(~(segmentP(esk49_0,esk48_0))|~(equalelemsP(esk48_0)))))))),inference(skolemize,[status(esa)],[568])).
% cnf(570,negated_conjecture,(~equalelemsP(esk48_0)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(571,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(573,negated_conjecture,(nil=esk50_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(576,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(578,negated_conjecture,(nil=esk48_0),inference(rw,[status(thm)],[571,573,theory(equality)])).
% cnf(582,negated_conjecture,($false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[570,578,theory(equality)]),123,theory(equality)])).
% cnf(583,negated_conjecture,($false|~segmentP(esk49_0,nil)),inference(rw,[status(thm)],[582,578,theory(equality)])).
% cnf(584,negated_conjecture,(~segmentP(esk49_0,nil)),inference(cn,[status(thm)],[583,theory(equality)])).
% cnf(585,negated_conjecture,(~ssList(esk49_0)),inference(spm,[status(thm)],[584,117,theory(equality)])).
% cnf(586,negated_conjecture,($false),inference(rw,[status(thm)],[585,576,theory(equality)])).
% cnf(587,negated_conjecture,($false),inference(cn,[status(thm)],[586,theory(equality)])).
% cnf(588,negated_conjecture,($false),587,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 21
% # ...of these trivial                : 3
% # ...subsumed                        : 0
% # ...remaining for further processing: 18
% # 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: 18
% #    Positive orientable unit clauses: 14
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 1
% # Current number of unprocessed clauses: 175
% # ...number of literals in the above : 691
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    23 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:           15 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           21 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.026 s
% # System time            : 0.006 s
% # Total time             : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP13301/SWC328+1.tptp
% 
%------------------------------------------------------------------------------