TSTP Solution File: SWC092+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC092+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:02:25 EST 2010
% Result : Theorem 1.58s
% Output : Solution 1.58s
% 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/SystemOnTPTP17247/SWC092+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17247/SWC092+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17247/SWC092+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 17343
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.029 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)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(7, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(14, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(19, axiom,![X1]:(ssList(X1)=>segmentP(X1,X1)),file('/tmp/SRASS.s.p', ax55)).
% fof(21, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% 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))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(ssList(X6)=>((~(app(X3,X6)=X4)|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X6)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(X10,cons(X9,nil))=X3)<(X9,X7))))))))|(~(nil=X4)&nil=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)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(ssList(X6)=>((~(app(X3,X6)=X4)|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X6)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(X10,cons(X9,nil))=X3)<(X9,X7))))))))|(~(nil=X4)&nil=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)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(ssList(X6)=>((~(app(X3,X6)=X4)|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X6)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(X10,cons(X9,nil))=X3)<(X9,X7))))))))|(~(nil=X4)&nil=X3))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, 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)],[3])).
% fof(116, 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)],[115])).
% fof(117, 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)],[116])).
% fof(118, 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)],[117])).
% fof(119, 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)],[118])).
% cnf(123,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[119])).
% fof(137, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[5])).
% fof(138, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[138])).
% fof(140, 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)],[139])).
% cnf(141,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[140])).
% cnf(147,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[7])).
% fof(177, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[14])).
% fof(178, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[177])).
% cnf(179,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[178])).
% fof(196, plain,![X1]:(~(ssList(X1))|segmentP(X1,X1)),inference(fof_nnf,[status(thm)],[19])).
% fof(197, plain,![X2]:(~(ssList(X2))|segmentP(X2,X2)),inference(variable_rename,[status(thm)],[196])).
% cnf(198,plain,(segmentP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[197])).
% fof(203, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[21])).
% fof(204, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[203])).
% cnf(205,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[204])).
% 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)))|~(segmentP(X2,X5)))|~(segmentP(X1,X5))))&?[X6]:(ssList(X6)&((app(X3,X6)=X4&strictorderedP(X3))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(app(cons(X7,nil),X8)=X6))|![X9]:(~(ssItem(X9))|![X10]:((~(ssList(X10))|~(app(X10,cons(X9,nil))=X3))|~(lt(X9,X7)))))))))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&(((((X12=X14&X11=X13)&neq(X12,nil))&![X15]:(((~(ssList(X15))|~(neq(X15,nil)))|~(segmentP(X12,X15)))|~(segmentP(X11,X15))))&?[X16]:(ssList(X16)&((app(X13,X16)=X14&strictorderedP(X13))&![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(cons(X17,nil),X18)=X16))|![X19]:(~(ssItem(X19))|![X20]:((~(ssList(X20))|~(app(X20,cons(X19,nil))=X13))|~(lt(X19,X17)))))))))&(nil=X14|~(nil=X13))))))),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))&![X15]:(((~(ssList(X15))|~(neq(X15,nil)))|~(segmentP(esk49_0,X15)))|~(segmentP(esk48_0,X15))))&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0))&![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(cons(X17,nil),X18)=esk52_0))|![X19]:(~(ssItem(X19))|![X20]:((~(ssList(X20))|~(app(X20,cons(X19,nil))=esk50_0))|~(lt(X19,X17)))))))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X17]:![X18]:![X19]:![X20]:(((((((((((((~(ssList(X20))|~(app(X20,cons(X19,nil))=esk50_0))|~(lt(X19,X17)))|~(ssItem(X19)))|(~(ssList(X18))|~(app(cons(X17,nil),X18)=esk52_0)))|~(ssItem(X17)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&((((~(ssList(X15))|~(neq(X15,nil)))|~(segmentP(esk49_0,X15)))|~(segmentP(esk48_0,X15)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil))))&(nil=esk51_0|~(nil=esk50_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,(nil=esk51_0|nil!=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(neq(esk49_0,nil)),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,(~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,578,theory(equality)])).
% cnf(586,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(589,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(593,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[580,578,theory(equality)])).
% cnf(594,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[593,579,theory(equality)])).
% cnf(595,negated_conjecture,(~segmentP(esk51_0,nil)|~ssList(nil)|~neq(nil,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[594,205,theory(equality)])).
% cnf(596,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~ssList(esk50_0)|~neq(esk50_0,nil)),inference(spm,[status(thm)],[594,198,theory(equality)])).
% cnf(597,negated_conjecture,(~segmentP(esk51_0,nil)|$false|~neq(nil,nil)|~ssList(esk50_0)),inference(rw,[status(thm)],[595,147,theory(equality)])).
% cnf(598,negated_conjecture,(~segmentP(esk51_0,nil)|$false|~neq(nil,nil)|$false),inference(rw,[status(thm)],[597,585,theory(equality)])).
% cnf(599,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(600,negated_conjecture,(~segmentP(esk51_0,esk50_0)|$false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[596,585,theory(equality)])).
% cnf(601,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[600,theory(equality)])).
% cnf(849,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[123,179,theory(equality)])).
% cnf(856,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[849,147,theory(equality)])).
% cnf(857,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[856,theory(equality)])).
% cnf(1385,negated_conjecture,(~neq(nil,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[599,205,theory(equality)])).
% cnf(1386,negated_conjecture,(~neq(nil,nil)|$false),inference(rw,[status(thm)],[1385,586,theory(equality)])).
% cnf(1387,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1386,theory(equality)])).
% cnf(9581,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[857,583,theory(equality)])).
% cnf(9625,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[9581,581,theory(equality)])).
% cnf(9626,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[9625,585,theory(equality)])).
% cnf(9627,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[9626,theory(equality)])).
% cnf(9926,negated_conjecture,(segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[9627,theory(equality)])).
% cnf(9927,negated_conjecture,(segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[9926,586,theory(equality)])).
% cnf(9928,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[9927,theory(equality)])).
% cnf(9935,negated_conjecture,($false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[601,9928,theory(equality)])).
% cnf(9936,negated_conjecture,(~neq(esk50_0,nil)),inference(cn,[status(thm)],[9935,theory(equality)])).
% cnf(9956,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[9936,141,theory(equality)])).
% cnf(9957,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[9956,147,theory(equality)])).
% cnf(9958,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[9957,585,theory(equality)])).
% cnf(9959,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[9958,theory(equality)])).
% cnf(10098,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[576,9959,theory(equality)])).
% cnf(10099,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[10098,theory(equality)])).
% cnf(10350,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[589,10099,theory(equality)])).
% cnf(10351,negated_conjecture,($false),inference(sr,[status(thm)],[10350,1387,theory(equality)])).
% cnf(10352,negated_conjecture,($false),10351,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1176
% # ...of these trivial : 17
% # ...subsumed : 399
% # ...remaining for further processing: 760
% # Other redundant clauses eliminated : 109
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 60
% # Backward-rewritten : 346
% # Generated clauses : 3501
% # ...of the previous two non-trivial : 3096
% # Contextual simplify-reflections : 283
% # Paramodulations : 3347
% # Factorizations : 0
% # Equation resolutions : 154
% # Current number of processed clauses: 348
% # Positive orientable unit clauses: 54
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 291
% # Current number of unprocessed clauses: 1153
% # ...number of literals in the above : 7065
% # Clause-clause subsumption calls (NU) : 15291
% # Rec. Clause-clause subsumption calls : 11694
% # Unit Clause-clause subsumption calls : 253
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 50
% # Indexed BW rewrite successes : 36
% # Backwards rewriting index: 358 leaves, 1.30+/-0.993 terms/leaf
% # Paramod-from index: 188 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 323 leaves, 1.17+/-0.823 terms/leaf
% # -------------------------------------------------
% # User time : 0.256 s
% # System time : 0.011 s
% # Total time : 0.267 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.50 CPU 0.57 WC
% FINAL PrfWatch: 0.50 CPU 0.57 WC
% SZS output end Solution for /tmp/SystemOnTPTP17247/SWC092+1.tptp
%
%------------------------------------------------------------------------------