TSTP Solution File: SWC339+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC339+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 : art02.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:51:33 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/SystemOnTPTP14079/SWC339+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14079/SWC339+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14079/SWC339+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 14175
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(totalorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)&leq(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)&leq(X13,X11)))))))))|(~(nil=X4)&nil=X3))|(segmentP(X2,X1)&totalorderedP(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))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(totalorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)&leq(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)&leq(X13,X11)))))))))|(~(nil=X4)&nil=X3))|(segmentP(X2,X1)&totalorderedP(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))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(totalorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)&leq(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)&leq(X13,X11)))))))))|(~(nil=X4)&nil=X3))|(segmentP(X2,X1)&totalorderedP(X1)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(109, 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)],[2])).
% fof(110, 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)],[109])).
% fof(111, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[110])).
% fof(112, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk4_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[112])).
% cnf(117,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[113])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(((app(app(X5,X3),X6)=X4&totalorderedP(X3))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(app(X8,cons(X7,nil))=X5))|![X9]:(~(ssItem(X9))|![X10]:((~(ssList(X10))|~(app(cons(X9,nil),X10)=X3))|~(leq(X7,X9)))))))&![X11]:(~(ssItem(X11))|![X12]:((~(ssList(X12))|~(app(cons(X11,nil),X12)=X6))|![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(app(X14,cons(X13,nil))=X3))|~(leq(X13,X11))))))))))&(nil=X4|~(nil=X3)))&(~(segmentP(X2,X1))|~(totalorderedP(X1)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&((((X16=X18&X15=X17)&?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&(((app(app(X19,X17),X20)=X18&totalorderedP(X17))&![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(X22,cons(X21,nil))=X19))|![X23]:(~(ssItem(X23))|![X24]:((~(ssList(X24))|~(app(cons(X23,nil),X24)=X17))|~(leq(X21,X23)))))))&![X25]:(~(ssItem(X25))|![X26]:((~(ssList(X26))|~(app(cons(X25,nil),X26)=X20))|![X27]:(~(ssItem(X27))|![X28]:((~(ssList(X28))|~(app(X28,cons(X27,nil))=X17))|~(leq(X27,X25))))))))))&(nil=X18|~(nil=X17)))&(~(segmentP(X16,X15))|~(totalorderedP(X15)))))))),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)&(ssList(esk52_0)&(ssList(esk53_0)&(((app(app(esk52_0,esk50_0),esk53_0)=esk51_0&totalorderedP(esk50_0))&![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(X22,cons(X21,nil))=esk52_0))|![X23]:(~(ssItem(X23))|![X24]:((~(ssList(X24))|~(app(cons(X23,nil),X24)=esk50_0))|~(leq(X21,X23)))))))&![X25]:(~(ssItem(X25))|![X26]:((~(ssList(X26))|~(app(cons(X25,nil),X26)=esk53_0))|![X27]:(~(ssItem(X27))|![X28]:((~(ssList(X28))|~(app(X28,cons(X27,nil))=esk50_0))|~(leq(X27,X25))))))))))&(nil=esk51_0|~(nil=esk50_0)))&(~(segmentP(esk49_0,esk48_0))|~(totalorderedP(esk48_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X21]:![X22]:![X23]:![X24]:![X25]:![X26]:![X27]:![X28]:(((((((((((((((~(ssList(X28))|~(app(X28,cons(X27,nil))=esk50_0))|~(leq(X27,X25)))|~(ssItem(X27)))|(~(ssList(X26))|~(app(cons(X25,nil),X26)=esk53_0)))|~(ssItem(X25)))&((((((~(ssList(X24))|~(app(cons(X23,nil),X24)=esk50_0))|~(leq(X21,X23)))|~(ssItem(X23)))|(~(ssList(X22))|~(app(X22,cons(X21,nil))=esk52_0)))|~(ssItem(X21)))&(app(app(esk52_0,esk50_0),esk53_0)=esk51_0&totalorderedP(esk50_0))))&ssList(esk53_0))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0)))&(~(segmentP(esk49_0,esk48_0))|~(totalorderedP(esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(~totalorderedP(esk48_0)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(totalorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(app(app(esk52_0,esk50_0),esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,578,theory(equality)])).
% cnf(587,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(590,negated_conjecture,($false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[576,578,theory(equality)]),582,theory(equality)])).
% cnf(591,negated_conjecture,($false|~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[590,579,theory(equality)]),578,theory(equality)])).
% cnf(592,negated_conjecture,(~segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[591,theory(equality)])).
% cnf(848,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(esk53_0)|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[117,583,theory(equality)])).
% cnf(857,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[848,581,theory(equality)])).
% cnf(858,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[857,580,theory(equality)])).
% cnf(859,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[858,586,theory(equality)])).
% cnf(860,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[859,theory(equality)])).
% cnf(1803,negated_conjecture,(segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[860,theory(equality)])).
% cnf(1804,negated_conjecture,(segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[1803,587,theory(equality)])).
% cnf(1805,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[1804,theory(equality)])).
% cnf(1806,negated_conjecture,($false),inference(sr,[status(thm)],[1805,592,theory(equality)])).
% cnf(1807,negated_conjecture,($false),1806,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 238
% # ...of these trivial : 2
% # ...subsumed : 7
% # ...remaining for further processing: 229
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 10
% # Generated clauses : 692
% # ...of the previous two non-trivial : 572
% # Contextual simplify-reflections : 2
% # Paramodulations : 599
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 212
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 182
% # Current number of unprocessed clauses: 475
% # ...number of literals in the above : 3364
% # Clause-clause subsumption calls (NU) : 921
% # Rec. Clause-clause subsumption calls : 202
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 248 leaves, 1.33+/-1.131 terms/leaf
% # Paramod-from index: 112 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 210 leaves, 1.22+/-0.951 terms/leaf
% # -------------------------------------------------
% # User time : 0.072 s
% # System time : 0.004 s
% # Total time : 0.076 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.26 WC
% FINAL PrfWatch: 0.19 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP14079/SWC339+1.tptp
%
%------------------------------------------------------------------------------