TSTP Solution File: SWC131+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC131+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 : art06.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:08:03 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/SystemOnTPTP15057/SWC131+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15057/SWC131+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15057/SWC131+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 15153
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(3, axiom,cyclefreeP(nil),file('/tmp/SRASS.s.p', ax60)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|neq(X4,nil))|cyclefreeP(X2)))))),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))|neq(X4,nil))|cyclefreeP(X2))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(104, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[103])).
% fof(105, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[105])).
% cnf(107,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[106])).
% cnf(109,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% cnf(110,plain,(cyclefreeP(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&~(neq(X4,nil)))&~(cyclefreeP(X2))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&(((X6=X8&X5=X7)&~(neq(X8,nil)))&~(cyclefreeP(X6))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((esk49_0=esk51_0&esk48_0=esk50_0)&~(neq(esk51_0,nil)))&~(cyclefreeP(esk49_0))))))),inference(skolemize,[status(esa)],[568])).
% cnf(570,negated_conjecture,(~cyclefreeP(esk49_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(571,negated_conjecture,(~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[569])).
% cnf(573,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(576,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(578,negated_conjecture,(~cyclefreeP(esk51_0)),inference(rw,[status(thm)],[570,573,theory(equality)])).
% cnf(579,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[576,573,theory(equality)])).
% cnf(607,negated_conjecture,(esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[571,107,theory(equality)])).
% cnf(608,negated_conjecture,(esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[607,109,theory(equality)])).
% cnf(609,negated_conjecture,(esk51_0=nil|$false|$false),inference(rw,[status(thm)],[608,579,theory(equality)])).
% cnf(610,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[609,theory(equality)])).
% cnf(1295,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[578,610,theory(equality)]),110,theory(equality)])).
% cnf(1296,negated_conjecture,($false),inference(cn,[status(thm)],[1295,theory(equality)])).
% cnf(1297,negated_conjecture,($false),1296,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 197
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 194
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 541
% # ...of the previous two non-trivial : 441
% # Contextual simplify-reflections : 2
% # Paramodulations : 450
% # 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) : 868
% # Rec. Clause-clause subsumption calls : 162
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 221 leaves, 1.36+/-1.163 terms/leaf
% # Paramod-from index: 96 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 186 leaves, 1.25+/-1.008 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.005 s
% # Total time : 0.070 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP15057/SWC131+1.tptp
%
%------------------------------------------------------------------------------