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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC095+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 07:03:04 EST 2010

% Result   : Theorem 1.29s
% Output   : Solution 1.29s
% 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/SystemOnTPTP21710/SWC095+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP21710/SWC095+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21710/SWC095+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 21806
% 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X1)&app(X5,X7)=X2))))|![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>![X10]:((~(ssList(X10))|~(app(app(X8,X9),X10)=X3))|~(app(X8,X10)=X4)))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X1)&app(X5,X7)=X2))))|![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>![X10]:((~(ssList(X10))|~(app(app(X8,X9),X10)=X3))|~(app(X8,X10)=X4))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X1)&app(X5,X7)=X2))))|![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>![X10]:((~(ssList(X10))|~(app(app(X8,X9),X10)=X3))|~(app(X8,X10)=X4))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X5,X6),X7)=X1))|~(app(X5,X7)=X2)))))&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:((ssList(X10)&app(app(X8,X9),X10)=X3)&app(X8,X10)=X4))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:((((ssList(X14)&X12=X14)&X11=X13)&![X15]:(~(ssList(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X15,X16),X17)=X11))|~(app(X15,X17)=X12)))))&?[X18]:(ssList(X18)&?[X19]:(ssList(X19)&?[X20]:((ssList(X20)&app(app(X18,X19),X20)=X13)&app(X18,X20)=X14))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&((((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&![X15]:(~(ssList(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X15,X16),X17)=esk48_0))|~(app(X15,X17)=esk49_0)))))&(ssList(esk52_0)&(ssList(esk53_0)&((ssList(esk54_0)&app(app(esk52_0,esk53_0),esk54_0)=esk50_0)&app(esk52_0,esk54_0)=esk51_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:(((((((((~(ssList(X17))|~(app(app(X15,X16),X17)=esk48_0))|~(app(X15,X17)=esk49_0))|~(ssList(X16)))|~(ssList(X15)))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&(ssList(esk52_0)&(ssList(esk53_0)&((ssList(esk54_0)&app(app(esk52_0,esk53_0),esk54_0)=esk50_0)&app(esk52_0,esk54_0)=esk51_0))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(575,negated_conjecture,(app(esk52_0,esk54_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(app(app(esk52_0,esk53_0),esk54_0)=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(~ssList(X1)|~ssList(X2)|app(X1,X3)!=esk49_0|app(app(X1,X2),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(app(app(esk52_0,esk53_0),esk54_0)=esk48_0),inference(rw,[status(thm)],[576,580,theory(equality)])).
% cnf(636,negated_conjecture,(app(X1,X3)!=esk51_0|app(app(X1,X2),X3)!=esk48_0|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[583,581,theory(equality)])).
% cnf(637,negated_conjecture,(app(app(esk52_0,X1),esk54_0)!=esk48_0|~ssList(esk54_0)|~ssList(X1)|~ssList(esk52_0)),inference(spm,[status(thm)],[636,575,theory(equality)])).
% cnf(641,negated_conjecture,(app(app(esk52_0,X1),esk54_0)!=esk48_0|$false|~ssList(X1)|~ssList(esk52_0)),inference(rw,[status(thm)],[637,577,theory(equality)])).
% cnf(642,negated_conjecture,(app(app(esk52_0,X1),esk54_0)!=esk48_0|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[641,579,theory(equality)])).
% cnf(643,negated_conjecture,(app(app(esk52_0,X1),esk54_0)!=esk48_0|~ssList(X1)),inference(cn,[status(thm)],[642,theory(equality)])).
% cnf(1479,negated_conjecture,(~ssList(esk53_0)),inference(spm,[status(thm)],[643,587,theory(equality)])).
% cnf(1489,negated_conjecture,($false),inference(rw,[status(thm)],[1479,578,theory(equality)])).
% cnf(1490,negated_conjecture,($false),inference(cn,[status(thm)],[1489,theory(equality)])).
% cnf(1491,negated_conjecture,($false),1490,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 208
% # ...of these trivial                : 2
% # ...subsumed                        : 1
% # ...remaining for further processing: 205
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 603
% # ...of the previous two non-trivial : 498
% # Contextual simplify-reflections    : 2
% # Paramodulations                    : 512
% # Factorizations                     : 0
% # Equation resolutions               : 91
% # Current number of processed clauses: 199
% #    Positive orientable unit clauses: 20
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 177
% # Current number of unprocessed clauses: 490
% # ...number of literals in the above : 3367
% # Clause-clause subsumption calls (NU) : 863
% # Rec. Clause-clause subsumption calls : 182
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:   238 leaves,   1.34+/-1.195 terms/leaf
% # Paramod-from index:          103 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          201 leaves,   1.24+/-1.066 terms/leaf
% # -------------------------------------------------
% # User time              : 0.066 s
% # System time            : 0.006 s
% # Total time             : 0.072 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP21710/SWC095+1.tptp
% 
%------------------------------------------------------------------------------