TSTP Solution File: SWC247+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC247+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:28:52 EST 2010
% Result : Theorem 1.68s
% Output : Solution 1.68s
% 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/SystemOnTPTP18580/SWC247+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18580/SWC247+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18580/SWC247+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 18676
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(9, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(12, axiom,![X1]:(ssList(X1)=>(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax20)).
% fof(16, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(24, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(42, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(totalorderedP(X3)))|nil=X1)|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&totalorderedP(X5)))|?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:((ssList(X8)&app(app(X7,cons(X6,nil)),X8)=X1)&![X9]:(ssItem(X9)=>(((~(memberP(X7,X9))|~(memberP(X8,X9)))|~(lt(X6,X9)))|leq(X6,X9))))))))))),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))|~(frontsegP(X4,X3)))|~(totalorderedP(X3)))|nil=X1)|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&totalorderedP(X5)))|?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:((ssList(X8)&app(app(X7,cons(X6,nil)),X8)=X1)&![X9]:(ssItem(X9)=>(((~(memberP(X7,X9))|~(memberP(X8,X9)))|~(lt(X6,X9)))|leq(X6,X9)))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(99, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(totalorderedP(X3)))|nil=X1)|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&totalorderedP(X5)))|?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:((ssList(X8)&app(app(X7,cons(X6,nil)),X8)=X1)&![X9]:(ssItem(X9)=>(((~(memberP(X7,X9))|~(memberP(X8,X9)))|~(lt(X6,X9)))|leq(X6,X9)))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(160, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(161, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[161])).
% cnf(163,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[162])).
% cnf(164,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[9])).
% fof(175, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(176, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[175])).
% fof(177, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk13_1(X4))&(ssItem(esk14_1(X4))&cons(esk14_1(X4),esk13_1(X4))=X4)))),inference(skolemize,[status(esa)],[176])).
% fof(178, plain,![X4]:(((ssList(esk13_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk14_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk14_1(X4),esk13_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[177])).
% cnf(179,plain,(nil=X1|cons(esk14_1(X1),esk13_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[178])).
% cnf(180,plain,(nil=X1|ssItem(esk14_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[178])).
% cnf(181,plain,(nil=X1|ssList(esk13_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[178])).
% fof(194, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[16])).
% fof(195, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[194])).
% cnf(196,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[195])).
% fof(230, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(231, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[230])).
% cnf(232,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[231])).
% fof(298, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[42])).
% fof(299, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[298])).
% fof(300, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[299])).
% cnf(301,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[300])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((((X2=X4&X1=X3)&frontsegP(X4,X3))&totalorderedP(X3))&~(nil=X1))&![X5]:((((~(ssList(X5))|~(neq(X3,X5)))|~(frontsegP(X4,X5)))|~(segmentP(X5,X3)))|~(totalorderedP(X5))))&![X6]:(~(ssItem(X6))|![X7]:(~(ssList(X7))|![X8]:((~(ssList(X8))|~(app(app(X7,cons(X6,nil)),X8)=X1))|?[X9]:(ssItem(X9)&(((memberP(X7,X9)&memberP(X8,X9))<(X6,X9))&~(leq(X6,X9)))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((((X11=X13&X10=X12)&frontsegP(X13,X12))&totalorderedP(X12))&~(nil=X10))&![X14]:((((~(ssList(X14))|~(neq(X12,X14)))|~(frontsegP(X13,X14)))|~(segmentP(X14,X12)))|~(totalorderedP(X14))))&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=X10))|?[X18]:(ssItem(X18)&(((memberP(X16,X18)&memberP(X17,X18))<(X15,X18))&~(leq(X15,X18)))))))))))),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)&frontsegP(esk51_0,esk50_0))&totalorderedP(esk50_0))&~(nil=esk48_0))&![X14]:((((~(ssList(X14))|~(neq(esk50_0,X14)))|~(frontsegP(esk51_0,X14)))|~(segmentP(X14,esk50_0)))|~(totalorderedP(X14))))&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0))|(ssItem(esk52_3(X15,X16,X17))&(((memberP(X16,esk52_3(X15,X16,X17))&memberP(X17,esk52_3(X15,X16,X17)))<(X15,esk52_3(X15,X16,X17)))&~(leq(X15,esk52_3(X15,X16,X17))))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X14]:![X15]:![X16]:![X17]:(((((((((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0))|(ssItem(esk52_3(X15,X16,X17))&(((memberP(X16,esk52_3(X15,X16,X17))&memberP(X17,esk52_3(X15,X16,X17)))<(X15,esk52_3(X15,X16,X17)))&~(leq(X15,esk52_3(X15,X16,X17))))))|~(ssList(X16)))|~(ssItem(X15)))&(((((~(ssList(X14))|~(neq(esk50_0,X14)))|~(frontsegP(esk51_0,X14)))|~(segmentP(X14,esk50_0)))|~(totalorderedP(X14)))&((((esk49_0=esk51_0&esk48_0=esk50_0)&frontsegP(esk51_0,esk50_0))&totalorderedP(esk50_0))&~(nil=esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X14]:![X15]:![X16]:![X17]:(((((((((ssItem(esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))&((((((memberP(X16,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))&(((memberP(X17,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15))))&(((lt(X15,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15))))&(((~(leq(X15,esk52_3(X15,X16,X17)))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))))&(((((~(ssList(X14))|~(neq(esk50_0,X14)))|~(frontsegP(esk51_0,X14)))|~(segmentP(X14,esk50_0)))|~(totalorderedP(X14)))&((((esk49_0=esk51_0&esk48_0=esk50_0)&frontsegP(esk51_0,esk50_0))&totalorderedP(esk50_0))&~(nil=esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(memberP(X2,esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(ssItem(esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(1145,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssList(nil)|~ssItem(X1)),inference(spm,[status(thm)],[232,586,theory(equality)])).
% cnf(1148,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|$false|~ssItem(X1)),inference(rw,[status(thm)],[1145,164,theory(equality)])).
% cnf(1149,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1148,theory(equality)])).
% cnf(1922,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1149,587,theory(equality)])).
% cnf(1923,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[1922,164,theory(equality)])).
% cnf(1924,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1923,theory(equality)])).
% cnf(1958,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[1924,196,theory(equality)])).
% cnf(2181,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[1958,301,theory(equality)])).
% cnf(2188,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2181,163,theory(equality)])).
% cnf(2189,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2188,164,theory(equality)])).
% cnf(2190,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2189,theory(equality)])).
% cnf(2192,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk13_1(X1))|~ssItem(esk14_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[2190,179,theory(equality)])).
% cnf(4978,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk13_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[2192,180])).
% cnf(4979,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(X1)),inference(csr,[status(thm)],[4978,181])).
% cnf(4981,negated_conjecture,(nil=esk48_0),inference(spm,[status(thm)],[4979,573,theory(equality)])).
% cnf(5014,negated_conjecture,($false),inference(sr,[status(thm)],[4981,577,theory(equality)])).
% cnf(5015,negated_conjecture,($false),5014,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 897
% # ...of these trivial : 10
% # ...subsumed : 318
% # ...remaining for further processing: 569
% # Other redundant clauses eliminated : 129
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 4
% # Generated clauses : 2785
% # ...of the previous two non-trivial : 2451
% # Contextual simplify-reflections : 380
% # Paramodulations : 2620
% # Factorizations : 0
% # Equation resolutions : 165
% # Current number of processed clauses: 349
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 327
% # Current number of unprocessed clauses: 1880
% # ...number of literals in the above : 14995
% # Clause-clause subsumption calls (NU) : 6766
% # Rec. Clause-clause subsumption calls : 2008
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 322 leaves, 1.41+/-1.187 terms/leaf
% # Paramod-from index: 165 leaves, 1.04+/-0.202 terms/leaf
% # Paramod-into index: 287 leaves, 1.28+/-0.945 terms/leaf
% # -------------------------------------------------
% # User time : 0.212 s
% # System time : 0.011 s
% # Total time : 0.223 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.41 CPU 0.47 WC
% FINAL PrfWatch: 0.41 CPU 0.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP18580/SWC247+1.tptp
%
%------------------------------------------------------------------------------