TSTP Solution File: SWC373+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC373+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 : art07.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:58:49 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/SystemOnTPTP23896/SWC373+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23896/SWC373+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23896/SWC373+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 23992
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(rearsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax6)).
% fof(10, 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(19, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(29, 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))|~(rearsegP(X4,X3)))|segmentP(X2,X1)))))),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))|~(rearsegP(X4,X3)))|segmentP(X2,X1))))))),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))|~(rearsegP(X4,X3)))|segmentP(X2,X1))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(136, 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)],[9])).
% fof(137, 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)],[136])).
% fof(138, 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)],[137])).
% fof(139, 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)],[138])).
% fof(140, 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)],[139])).
% cnf(141,plain,(app(esk1_2(X1,X2),X2)=X1|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[140])).
% cnf(142,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~rearsegP(X1,X2)),inference(split_conjunct,[status(thm)],[140])).
% fof(144, 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)],[10])).
% fof(145, 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)],[144])).
% fof(146, 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)],[145])).
% fof(147, 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)],[146])).
% fof(148, 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)],[147])).
% cnf(152,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[148])).
% cnf(184,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[19])).
% fof(226, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[29])).
% fof(227, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[226])).
% cnf(228,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[227])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&rearsegP(X4,X3))&~(segmentP(X2,X1))))))),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)&rearsegP(X8,X7))&~(segmentP(X6,X5))))))),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)&rearsegP(esk51_0,esk50_0))&~(segmentP(esk49_0,esk48_0))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(rearsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(~segmentP(esk51_0,esk48_0)),inference(rw,[status(thm)],[571,574,theory(equality)])).
% cnf(580,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[577,574,theory(equality)])).
% cnf(583,negated_conjecture,(rearsegP(esk51_0,esk48_0)),inference(rw,[status(thm)],[572,573,theory(equality)])).
% cnf(611,negated_conjecture,(ssList(esk1_2(esk51_0,esk48_0))|~ssList(esk48_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[142,583,theory(equality)])).
% cnf(614,negated_conjecture,(ssList(esk1_2(esk51_0,esk48_0))|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[611,578,theory(equality)])).
% cnf(615,negated_conjecture,(ssList(esk1_2(esk51_0,esk48_0))|$false|$false),inference(rw,[status(thm)],[614,580,theory(equality)])).
% cnf(616,negated_conjecture,(ssList(esk1_2(esk51_0,esk48_0))),inference(cn,[status(thm)],[615,theory(equality)])).
% cnf(767,negated_conjecture,(app(esk1_2(esk51_0,esk48_0),esk48_0)=esk51_0|~ssList(esk48_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[141,583,theory(equality)])).
% cnf(770,negated_conjecture,(app(esk1_2(esk51_0,esk48_0),esk48_0)=esk51_0|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[767,578,theory(equality)])).
% cnf(771,negated_conjecture,(app(esk1_2(esk51_0,esk48_0),esk48_0)=esk51_0|$false|$false),inference(rw,[status(thm)],[770,580,theory(equality)])).
% cnf(772,negated_conjecture,(app(esk1_2(esk51_0,esk48_0),esk48_0)=esk51_0),inference(cn,[status(thm)],[771,theory(equality)])).
% cnf(1345,negated_conjecture,(segmentP(X1,esk48_0)|app(esk51_0,X2)!=X1|~ssList(X2)|~ssList(esk1_2(esk51_0,esk48_0))|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[152,772,theory(equality)])).
% cnf(1374,negated_conjecture,(segmentP(X1,esk48_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|~ssList(esk48_0)|~ssList(X1)),inference(rw,[status(thm)],[1345,616,theory(equality)])).
% cnf(1375,negated_conjecture,(segmentP(X1,esk48_0)|app(esk51_0,X2)!=X1|~ssList(X2)|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[1374,578,theory(equality)])).
% cnf(1376,negated_conjecture,(segmentP(X1,esk48_0)|app(esk51_0,X2)!=X1|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[1375,theory(equality)])).
% cnf(1751,negated_conjecture,(segmentP(X1,esk48_0)|esk51_0!=X1|~ssList(nil)|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[1376,228,theory(equality)])).
% cnf(1752,negated_conjecture,(segmentP(X1,esk48_0)|esk51_0!=X1|$false|~ssList(X1)|~ssList(esk51_0)),inference(rw,[status(thm)],[1751,184,theory(equality)])).
% cnf(1753,negated_conjecture,(segmentP(X1,esk48_0)|esk51_0!=X1|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[1752,580,theory(equality)])).
% cnf(1754,negated_conjecture,(segmentP(X1,esk48_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[1753,theory(equality)])).
% cnf(1755,negated_conjecture,(segmentP(esk51_0,esk48_0)|~ssList(esk51_0)),inference(er,[status(thm)],[1754,theory(equality)])).
% cnf(1756,negated_conjecture,(segmentP(esk51_0,esk48_0)|$false),inference(rw,[status(thm)],[1755,580,theory(equality)])).
% cnf(1757,negated_conjecture,(segmentP(esk51_0,esk48_0)),inference(cn,[status(thm)],[1756,theory(equality)])).
% cnf(1758,negated_conjecture,($false),inference(sr,[status(thm)],[1757,579,theory(equality)])).
% cnf(1759,negated_conjecture,($false),1758,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 269
% # ...of these trivial : 2
% # ...subsumed : 22
% # ...remaining for further processing: 245
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 674
% # ...of the previous two non-trivial : 549
% # Contextual simplify-reflections : 6
% # Paramodulations : 578
% # Factorizations : 0
% # Equation resolutions : 96
% # Current number of processed clauses: 233
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 203
% # Current number of unprocessed clauses: 440
% # ...number of literals in the above : 3194
% # Clause-clause subsumption calls (NU) : 1032
% # Rec. Clause-clause subsumption calls : 319
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 268 leaves, 1.33+/-1.075 terms/leaf
% # Paramod-from index: 123 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 235 leaves, 1.20+/-0.904 terms/leaf
% # -------------------------------------------------
% # User time : 0.070 s
% # System time : 0.007 s
% # Total time : 0.077 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.27 WC
% FINAL PrfWatch: 0.20 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP23896/SWC373+1.tptp
%
%------------------------------------------------------------------------------