TSTP Solution File: SWC122+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC122+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:06:40 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP23855/SWC122+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23855/SWC122+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23855/SWC122+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 23951
% 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(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(14, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% fof(18, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|(~(nil=X3)&nil=X4))|(neq(X1,nil)&segmentP(X2,X1)))|(neq(X4,nil)&(~(neq(X3,nil))|~(rearsegP(X4,X3))))))))),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)))|(~(nil=X3)&nil=X4))|(neq(X1,nil)&segmentP(X2,X1)))|(neq(X4,nil)&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),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)))|(~(nil=X3)&nil=X4))|(neq(X1,nil)&segmentP(X2,X1)))|(neq(X4,nil)&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(155, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(rearsegP(X1,X2))|?[X3]:(ssList(X3)&app(X3,X2)=X1))&(![X3]:(~(ssList(X3))|~(app(X3,X2)=X1))|rearsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[14])).
% fof(156, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|?[X6]:(ssList(X6)&app(X6,X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(variable_rename,[status(thm)],[155])).
% fof(157, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(esk1_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[156])).
% fof(158, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(esk1_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[157])).
% fof(159, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk1_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk1_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[158])).
% cnf(160,plain,(app(esk1_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% cnf(161,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% fof(163, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(app(X3,X2),X4)=X1)))|segmentP(X1,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(164, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(app(X7,X6),X8)=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(variable_rename,[status(thm)],[163])).
% fof(165, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk2_2(X5,X6))&(ssList(esk3_2(X5,X6))&app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[164])).
% fof(166, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk2_2(X5,X6))&(ssList(esk3_2(X5,X6))&app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[165])).
% fof(167, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk2_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[166])).
% cnf(171,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[167])).
% fof(182, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[18])).
% fof(183, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[182])).
% cnf(184,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[183])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&neq(X2,nil))&(nil=X3|~(nil=X4)))&(~(neq(X1,nil))|~(segmentP(X2,X1))))&(~(neq(X4,nil))|(neq(X3,nil)&rearsegP(X4,X3)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&(((((X6=X8&X5=X7)&neq(X6,nil))&(nil=X7|~(nil=X8)))&(~(neq(X5,nil))|~(segmentP(X6,X5))))&(~(neq(X8,nil))|(neq(X7,nil)&rearsegP(X8,X7)))))))),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))&(nil=esk50_0|~(nil=esk51_0)))&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0))))&(~(neq(esk51_0,nil))|(neq(esk50_0,nil)&rearsegP(esk51_0,esk50_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, 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))&(nil=esk50_0|~(nil=esk51_0)))&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0))))&((neq(esk50_0,nil)|~(neq(esk51_0,nil)))&(rearsegP(esk51_0,esk50_0)|~(neq(esk51_0,nil))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(rearsegP(esk51_0,esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(neq(esk50_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(~segmentP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[582,577,theory(equality)])).
% cnf(584,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(587,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[576,578,theory(equality)])).
% cnf(588,negated_conjecture,(~neq(esk50_0,nil)|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[574,577,theory(equality)])).
% cnf(589,negated_conjecture,(~neq(esk50_0,nil)|~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[588,578,theory(equality)]),577,theory(equality)])).
% cnf(590,negated_conjecture,(neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[573,587,theory(equality)])).
% cnf(591,negated_conjecture,(neq(esk50_0,nil)),inference(cn,[status(thm)],[590,theory(equality)])).
% cnf(592,negated_conjecture,(~segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[589,591,theory(equality)])).
% cnf(593,negated_conjecture,(~segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(594,negated_conjecture,(rearsegP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[572,587,theory(equality)])).
% cnf(595,negated_conjecture,(rearsegP(esk51_0,esk50_0)),inference(cn,[status(thm)],[594,theory(equality)])).
% cnf(626,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,595,theory(equality)])).
% cnf(629,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[626,583,theory(equality)])).
% cnf(630,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|$false|$false),inference(rw,[status(thm)],[629,584,theory(equality)])).
% cnf(631,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))),inference(cn,[status(thm)],[630,theory(equality)])).
% cnf(781,negated_conjecture,(app(esk1_2(esk51_0,esk50_0),esk50_0)=esk51_0|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[160,595,theory(equality)])).
% cnf(784,negated_conjecture,(app(esk1_2(esk51_0,esk50_0),esk50_0)=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[781,583,theory(equality)])).
% cnf(785,negated_conjecture,(app(esk1_2(esk51_0,esk50_0),esk50_0)=esk51_0|$false|$false),inference(rw,[status(thm)],[784,584,theory(equality)])).
% cnf(786,negated_conjecture,(app(esk1_2(esk51_0,esk50_0),esk50_0)=esk51_0),inference(cn,[status(thm)],[785,theory(equality)])).
% cnf(1369,negated_conjecture,(segmentP(X1,esk50_0)|app(esk51_0,X2)!=X1|~ssList(X2)|~ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[171,786,theory(equality)])).
% cnf(1398,negated_conjecture,(segmentP(X1,esk50_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[1369,631,theory(equality)])).
% cnf(1399,negated_conjecture,(segmentP(X1,esk50_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[1398,583,theory(equality)])).
% cnf(1400,negated_conjecture,(segmentP(X1,esk50_0)|app(esk51_0,X2)!=X1|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[1399,theory(equality)])).
% cnf(2533,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(nil)|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[1400,184,theory(equality)])).
% cnf(2535,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(X1)|~ssList(esk51_0)),inference(rw,[status(thm)],[2533,110,theory(equality)])).
% cnf(2536,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[2535,584,theory(equality)])).
% cnf(2537,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[2536,theory(equality)])).
% cnf(2540,negated_conjecture,(segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[2537,theory(equality)])).
% cnf(2541,negated_conjecture,(segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[2540,584,theory(equality)])).
% cnf(2542,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[2541,theory(equality)])).
% cnf(2543,negated_conjecture,($false),inference(sr,[status(thm)],[2542,593,theory(equality)])).
% cnf(2544,negated_conjecture,($false),2543,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 335
% # ...of these trivial : 2
% # ...subsumed : 47
% # ...remaining for further processing: 286
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 17
% # Generated clauses : 913
% # ...of the previous two non-trivial : 742
% # Contextual simplify-reflections : 27
% # Paramodulations : 815
% # Factorizations : 0
% # Equation resolutions : 98
% # Current number of processed clauses: 261
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 224
% # Current number of unprocessed clauses: 501
% # ...number of literals in the above : 3505
% # Clause-clause subsumption calls (NU) : 1247
% # Rec. Clause-clause subsumption calls : 506
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 284 leaves, 1.32+/-1.047 terms/leaf
% # Paramod-from index: 139 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 252 leaves, 1.19+/-0.876 terms/leaf
% # -------------------------------------------------
% # User time : 0.081 s
% # System time : 0.010 s
% # Total time : 0.091 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.31 WC
% FINAL PrfWatch: 0.22 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP23855/SWC122+1.tptp
%
%------------------------------------------------------------------------------