TSTP Solution File: SWC106+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC106+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 : art01.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:04:26 EST 2010
% Result : Theorem 1.48s
% Output : Solution 1.48s
% 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/SystemOnTPTP32647/SWC106+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32647/SWC106+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32647/SWC106+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 32743
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>(~(cons(X5,nil)=X3)|~(app(X6,cons(X5,nil))=X4)))))|(neq(X1,nil)&rearsegP(X2,X1)))&(~(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]:(ssItem(X5)=>![X6]:(ssList(X6)=>(~(cons(X5,nil)=X3)|~(app(X6,cons(X5,nil))=X4)))))|(neq(X1,nil)&rearsegP(X2,X1)))&(~(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]:(ssItem(X5)=>![X6]:(ssList(X6)=>(~(cons(X5,nil)=X3)|~(app(X6,cons(X5,nil))=X4)))))|(neq(X1,nil)&rearsegP(X2,X1)))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, 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)],[3])).
% fof(116, 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)],[115])).
% fof(117, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(rearsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(esk3_2(X4,X5),X5)=X4))&(![X7]:(~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))&(~(rearsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(esk3_2(X4,X5),X5)=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X7,X5)=X4))|rearsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk3_2(X4,X5))|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(esk3_2(X4,X5),X5)=X4|~(rearsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[118])).
% cnf(122,plain,(rearsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X3,X2)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[119])).
% fof(123, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(124, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[124])).
% fof(126, 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)],[125])).
% cnf(127,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[126])).
% cnf(133,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(151, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(152, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[151])).
% fof(153, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[152])).
% cnf(154,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[153])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&(cons(X5,nil)=X3&app(X6,cons(X5,nil))=X4))))&(~(neq(X1,nil))|~(rearsegP(X2,X1))))|(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]:(ssItem(X11)&?[X12]:(ssList(X12)&(cons(X11,nil)=X9&app(X12,cons(X11,nil))=X10))))&(~(neq(X7,nil))|~(rearsegP(X8,X7))))|(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)&(ssItem(esk52_0)&(ssList(esk53_0)&(cons(esk52_0,nil)=esk50_0&app(esk53_0,cons(esk52_0,nil))=esk51_0))))&(~(neq(esk48_0,nil))|~(rearsegP(esk49_0,esk48_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),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)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))&(((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0)))&(((neq(esk49_0,nil)|ssList(esk53_0))&(~(neq(esk51_0,nil))|ssList(esk53_0)))&(((neq(esk49_0,nil)|cons(esk52_0,nil)=esk50_0)&(~(neq(esk51_0,nil))|cons(esk52_0,nil)=esk50_0))&((neq(esk49_0,nil)|app(esk53_0,cons(esk52_0,nil))=esk51_0)&(~(neq(esk51_0,nil))|app(esk53_0,cons(esk52_0,nil))=esk51_0))))))&((neq(esk49_0,nil)|(~(neq(esk48_0,nil))|~(rearsegP(esk49_0,esk48_0))))&(~(neq(esk51_0,nil))|(~(neq(esk48_0,nil))|~(rearsegP(esk49_0,esk48_0))))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(~rearsegP(esk49_0,esk48_0)|~neq(esk48_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(cons(esk52_0,nil)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(588,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(589,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(592,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[580,585,theory(equality)]),583,theory(equality)])).
% cnf(593,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(594,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[578,585,theory(equality)]),583,theory(equality)])).
% cnf(595,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[594,theory(equality)])).
% cnf(596,negated_conjecture,(cons(esk52_0,nil)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[576,584,theory(equality)])).
% cnf(597,negated_conjecture,(cons(esk52_0,nil)=esk48_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[596,585,theory(equality)]),583,theory(equality)])).
% cnf(598,negated_conjecture,(cons(esk52_0,nil)=esk48_0),inference(cn,[status(thm)],[597,theory(equality)])).
% cnf(611,negated_conjecture,(~neq(esk48_0,nil)|$false|~rearsegP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[572,585,theory(equality)]),583,theory(equality)])).
% cnf(612,negated_conjecture,(~neq(esk48_0,nil)|~rearsegP(esk49_0,esk48_0)),inference(cn,[status(thm)],[611,theory(equality)])).
% cnf(613,negated_conjecture,(app(esk53_0,esk48_0)=esk51_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[574,598,theory(equality)])).
% cnf(614,negated_conjecture,(app(esk53_0,esk48_0)=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[613,585,theory(equality)])).
% cnf(615,negated_conjecture,(app(esk53_0,esk48_0)=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[614,585,theory(equality)]),583,theory(equality)])).
% cnf(616,negated_conjecture,(app(esk53_0,esk48_0)=esk49_0),inference(cn,[status(thm)],[615,theory(equality)])).
% cnf(624,negated_conjecture,(esk48_0!=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[154,598,theory(equality)])).
% cnf(625,negated_conjecture,(esk48_0!=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[624,133,theory(equality)])).
% cnf(626,negated_conjecture,(esk48_0!=nil|$false|$false),inference(rw,[status(thm)],[625,593,theory(equality)])).
% cnf(627,negated_conjecture,(esk48_0!=nil),inference(cn,[status(thm)],[626,theory(equality)])).
% cnf(762,negated_conjecture,(rearsegP(X1,esk48_0)|esk49_0!=X1|~ssList(esk53_0)|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[122,616,theory(equality)])).
% cnf(766,negated_conjecture,(rearsegP(X1,esk48_0)|esk49_0!=X1|$false|~ssList(esk48_0)|~ssList(X1)),inference(rw,[status(thm)],[762,595,theory(equality)])).
% cnf(767,negated_conjecture,(rearsegP(X1,esk48_0)|esk49_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[766,589,theory(equality)])).
% cnf(768,negated_conjecture,(rearsegP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[767,theory(equality)])).
% cnf(2043,negated_conjecture,(rearsegP(esk49_0,esk48_0)|~ssList(esk49_0)),inference(er,[status(thm)],[768,theory(equality)])).
% cnf(2044,negated_conjecture,(rearsegP(esk49_0,esk48_0)|$false),inference(rw,[status(thm)],[2043,588,theory(equality)])).
% cnf(2045,negated_conjecture,(rearsegP(esk49_0,esk48_0)),inference(cn,[status(thm)],[2044,theory(equality)])).
% cnf(2051,negated_conjecture,($false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[612,2045,theory(equality)])).
% cnf(2052,negated_conjecture,(~neq(esk48_0,nil)),inference(cn,[status(thm)],[2051,theory(equality)])).
% cnf(2069,negated_conjecture,(esk48_0=nil|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[2052,127,theory(equality)])).
% cnf(2071,negated_conjecture,(esk48_0=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[2069,133,theory(equality)])).
% cnf(2072,negated_conjecture,(esk48_0=nil|$false|$false),inference(rw,[status(thm)],[2071,589,theory(equality)])).
% cnf(2073,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[2072,theory(equality)])).
% cnf(2074,negated_conjecture,($false),inference(sr,[status(thm)],[2073,627,theory(equality)])).
% cnf(2075,negated_conjecture,($false),2074,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 270
% # ...of these trivial : 9
% # ...subsumed : 15
% # ...remaining for further processing: 246
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 11
% # Generated clauses : 748
% # ...of the previous two non-trivial : 624
% # Contextual simplify-reflections : 3
% # Paramodulations : 655
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 228
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 185
% # Current number of unprocessed clauses: 499
% # ...number of literals in the above : 3447
% # Clause-clause subsumption calls (NU) : 892
% # Rec. Clause-clause subsumption calls : 200
% # Unit Clause-clause subsumption calls : 53
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 261 leaves, 1.31+/-1.079 terms/leaf
% # Paramod-from index: 125 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 224 leaves, 1.21+/-0.924 terms/leaf
% # -------------------------------------------------
% # User time : 0.075 s
% # System time : 0.006 s
% # Total time : 0.081 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.28 WC
% FINAL PrfWatch: 0.22 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP32647/SWC106+1.tptp
%
%------------------------------------------------------------------------------