TSTP Solution File: SWC124+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC124+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 : art04.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:07:05 EST 2010
% Result : Theorem 1.63s
% Output : Solution 1.63s
% 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/SystemOnTPTP24114/SWC124+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24114/SWC124+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24114/SWC124+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 24210
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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)=>(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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(totalorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)&leq(X8,X6))))))))|(~(nil=X4)&nil=X3))|(neq(X1,nil)&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))|~(neq(X2,nil)))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(totalorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)&leq(X8,X6))))))))|(~(nil=X4)&nil=X3))|(neq(X1,nil)&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))|~(neq(X2,nil)))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(totalorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)&leq(X8,X6))))))))|(~(nil=X4)&nil=X3))|(neq(X1,nil)&segmentP(X2,X1)))))))),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(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)&((app(X3,X5)=X4&totalorderedP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssItem(X8))|![X9]:((~(ssList(X9))|~(app(X9,cons(X8,nil))=X3))|~(leq(X8,X6)))))))))&(nil=X4|~(nil=X3)))&(~(neq(X1,nil))|~(segmentP(X2,X1)))))))),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)&neq(X11,nil))&?[X14]:(ssList(X14)&((app(X12,X14)=X13&totalorderedP(X12))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=X14))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=X12))|~(leq(X17,X15)))))))))&(nil=X13|~(nil=X12)))&(~(neq(X10,nil))|~(segmentP(X11,X10)))))))),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))&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&totalorderedP(esk50_0))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(leq(X17,X15)))))))))&(nil=esk51_0|~(nil=esk50_0)))&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:![X18]:((((((((((((((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(leq(X17,X15)))|~(ssItem(X17)))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&totalorderedP(esk50_0)))&ssList(esk52_0))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&(nil=esk51_0|~(nil=esk50_0)))&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,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,(~segmentP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(nil=esk51_0|nil!=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk49_0=esk51_0),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,579,theory(equality)])).
% cnf(586,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,580,theory(equality)])).
% cnf(589,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[578,580,theory(equality)])).
% cnf(590,negated_conjecture,(~neq(esk50_0,nil)|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[576,579,theory(equality)])).
% cnf(591,negated_conjecture,(~neq(esk50_0,nil)|~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[590,580,theory(equality)]),579,theory(equality)])).
% cnf(848,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(855,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[848,147,theory(equality)])).
% cnf(856,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[855,theory(equality)])).
% cnf(9881,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[856,583,theory(equality)])).
% cnf(9925,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[9881,581,theory(equality)])).
% cnf(9926,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[9925,585,theory(equality)])).
% cnf(9927,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[9926,theory(equality)])).
% cnf(10230,negated_conjecture,(segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[9927,theory(equality)])).
% cnf(10231,negated_conjecture,(segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[10230,586,theory(equality)])).
% cnf(10232,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[10231,theory(equality)])).
% cnf(10239,negated_conjecture,($false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[591,10232,theory(equality)])).
% cnf(10240,negated_conjecture,(~neq(esk50_0,nil)),inference(cn,[status(thm)],[10239,theory(equality)])).
% cnf(10260,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[10240,141,theory(equality)])).
% cnf(10261,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[10260,147,theory(equality)])).
% cnf(10262,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[10261,585,theory(equality)])).
% cnf(10263,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[10262,theory(equality)])).
% cnf(10410,negated_conjecture,(~neq(nil,nil)),inference(rw,[status(thm)],[10240,10263,theory(equality)])).
% cnf(10414,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[577,10263,theory(equality)])).
% cnf(10415,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[10414,theory(equality)])).
% cnf(10686,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[589,10415,theory(equality)])).
% cnf(10911,negated_conjecture,($false),inference(sr,[status(thm)],[10686,10410,theory(equality)])).
% cnf(10912,negated_conjecture,($false),10911,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1234
% # ...of these trivial : 23
% # ...subsumed : 428
% # ...remaining for further processing: 783
% # Other redundant clauses eliminated : 120
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 62
% # Backward-rewritten : 438
% # Generated clauses : 3642
% # ...of the previous two non-trivial : 3237
% # Contextual simplify-reflections : 318
% # Paramodulations : 3474
% # Factorizations : 0
% # Equation resolutions : 168
% # Current number of processed clauses: 276
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 250
% # Current number of unprocessed clauses: 1031
% # ...number of literals in the above : 6543
% # Clause-clause subsumption calls (NU) : 16318
% # Rec. Clause-clause subsumption calls : 12421
% # Unit Clause-clause subsumption calls : 305
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 54
% # Indexed BW rewrite successes : 35
% # Backwards rewriting index: 276 leaves, 1.40+/-1.123 terms/leaf
% # Paramod-from index: 144 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 246 leaves, 1.23+/-0.944 terms/leaf
% # -------------------------------------------------
% # User time : 0.270 s
% # System time : 0.015 s
% # Total time : 0.285 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.53 CPU 0.61 WC
% FINAL PrfWatch: 0.53 CPU 0.61 WC
% SZS output end Solution for /tmp/SystemOnTPTP24114/SWC124+1.tptp
%
%------------------------------------------------------------------------------