TSTP Solution File: SWC050+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC050+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 : art03.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:54:55 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP15179/SWC050+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15179/SWC050+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15179/SWC050+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 15277
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 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))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))|![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(rearsegP(X4,X6)))|~(rearsegP(X3,X6)))))&(~(neq(X2,nil))|neq(X4,nil)))))))),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(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))|![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(rearsegP(X4,X6)))|~(rearsegP(X3,X6)))))&(~(neq(X2,nil))|neq(X4,nil))))))))),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))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))|![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(rearsegP(X4,X6)))|~(rearsegP(X3,X6)))))&(~(neq(X2,nil))|neq(X4,nil))))))))),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)&(((neq(X2,nil)&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(rearsegP(X2,X5)))|~(rearsegP(X1,X5))))&?[X6]:(ssList(X6)&((neq(X6,nil)&rearsegP(X4,X6))&rearsegP(X3,X6))))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&((X8=X10&X7=X9)&(((neq(X8,nil)&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(rearsegP(X8,X11)))|~(rearsegP(X7,X11))))&?[X12]:(ssList(X12)&((neq(X12,nil)&rearsegP(X10,X12))&rearsegP(X9,X12))))|(neq(X8,nil)&~(neq(X10,nil))))))))),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)&(((neq(esk49_0,nil)&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(rearsegP(esk49_0,X11)))|~(rearsegP(esk48_0,X11))))&(ssList(esk52_0)&((neq(esk52_0,nil)&rearsegP(esk51_0,esk52_0))&rearsegP(esk50_0,esk52_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:(((((((((((~(ssList(X11))|~(neq(X11,nil)))|~(rearsegP(esk49_0,X11)))|~(rearsegP(esk48_0,X11)))&neq(esk49_0,nil))&(ssList(esk52_0)&((neq(esk52_0,nil)&rearsegP(esk51_0,esk52_0))&rearsegP(esk50_0,esk52_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:(((((((((neq(esk49_0,nil)|(((~(ssList(X11))|~(neq(X11,nil)))|~(rearsegP(esk49_0,X11)))|~(rearsegP(esk48_0,X11))))&(~(neq(esk51_0,nil))|(((~(ssList(X11))|~(neq(X11,nil)))|~(rearsegP(esk49_0,X11)))|~(rearsegP(esk48_0,X11)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&(((neq(esk49_0,nil)|ssList(esk52_0))&(~(neq(esk51_0,nil))|ssList(esk52_0)))&((((neq(esk49_0,nil)|neq(esk52_0,nil))&(~(neq(esk51_0,nil))|neq(esk52_0,nil)))&((neq(esk49_0,nil)|rearsegP(esk51_0,esk52_0))&(~(neq(esk51_0,nil))|rearsegP(esk51_0,esk52_0))))&((neq(esk49_0,nil)|rearsegP(esk50_0,esk52_0))&(~(neq(esk51_0,nil))|rearsegP(esk50_0,esk52_0))))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(rearsegP(esk50_0,esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(rearsegP(esk51_0,esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(neq(esk52_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(~rearsegP(esk48_0,X1)|~rearsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssList(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,578,theory(equality)]),588,theory(equality)])).
% cnf(594,negated_conjecture,(ssList(esk52_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(598,negated_conjecture,(neq(esk52_0,nil)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),588,theory(equality)])).
% cnf(599,negated_conjecture,(neq(esk52_0,nil)),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(600,negated_conjecture,(rearsegP(esk48_0,esk52_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,577,theory(equality)])).
% cnf(601,negated_conjecture,(rearsegP(esk48_0,esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[600,578,theory(equality)]),588,theory(equality)])).
% cnf(602,negated_conjecture,(rearsegP(esk48_0,esk52_0)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(603,negated_conjecture,(rearsegP(esk49_0,esk52_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(604,negated_conjecture,(rearsegP(esk49_0,esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[603,578,theory(equality)]),588,theory(equality)])).
% cnf(605,negated_conjecture,(rearsegP(esk49_0,esk52_0)),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(621,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~rearsegP(esk48_0,X1)|~rearsegP(esk49_0,X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[589,578,theory(equality)]),588,theory(equality)])).
% cnf(622,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~rearsegP(esk48_0,X1)|~rearsegP(esk49_0,X1)),inference(cn,[status(thm)],[621,theory(equality)])).
% cnf(625,negated_conjecture,(~rearsegP(esk49_0,esk52_0)|~neq(esk52_0,nil)|~ssList(esk52_0)),inference(spm,[status(thm)],[622,602,theory(equality)])).
% cnf(631,negated_conjecture,($false|~neq(esk52_0,nil)|~ssList(esk52_0)),inference(rw,[status(thm)],[625,605,theory(equality)])).
% cnf(632,negated_conjecture,($false|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[631,599,theory(equality)])).
% cnf(633,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[632,594,theory(equality)])).
% cnf(634,negated_conjecture,($false),inference(cn,[status(thm)],[633,theory(equality)])).
% cnf(635,negated_conjecture,($false),634,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 40
% # ...of these trivial : 7
% # ...subsumed : 0
% # ...remaining for further processing: 33
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 33
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 169
% # ...number of literals in the above : 676
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 7
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 43 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 24 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 37 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.003 s
% # Total time : 0.034 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP15179/SWC050+1.tptp
%
%------------------------------------------------------------------------------