TSTP Solution File: SWC243+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC243+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:33:12 EST 2010
% Result : Theorem 1.60s
% Output : Solution 1.60s
% 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/SystemOnTPTP14285/SWC243+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14285/SWC243+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14285/SWC243+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 14417
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 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(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(8, axiom,![X1]:(ssList(X1)=>(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax20)).
% fof(12, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(20, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(25, 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))|~(totalorderedP(X3)))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8))))))))))),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))|~(totalorderedP(X3)))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8)))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(99, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(totalorderedP(X3)))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8)))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(131, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(132, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[132])).
% cnf(134,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[133])).
% cnf(135,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(146, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(147, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[146])).
% fof(148, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk10_1(X4))&(ssItem(esk11_1(X4))&cons(esk11_1(X4),esk10_1(X4))=X4)))),inference(skolemize,[status(esa)],[147])).
% fof(149, plain,![X4]:(((ssList(esk10_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk11_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk11_1(X4),esk10_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[148])).
% cnf(150,plain,(nil=X1|cons(esk11_1(X1),esk10_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[149])).
% cnf(151,plain,(nil=X1|ssItem(esk11_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[149])).
% cnf(152,plain,(nil=X1|ssList(esk10_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[149])).
% fof(165, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(166, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[165])).
% cnf(167,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[166])).
% fof(201, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(202, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[201])).
% cnf(203,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[202])).
% fof(216, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[25])).
% fof(217, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[216])).
% fof(218, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[217])).
% cnf(219,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[218])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&totalorderedP(X3))&~(nil=X1))&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X1))|?[X8]:(ssItem(X8)&(((memberP(X6,X8)&memberP(X7,X8))<(X5,X8))&~(leq(X5,X8)))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&((((X10=X12&X9=X11)&totalorderedP(X11))&~(nil=X9))&![X13]:(~(ssItem(X13))|![X14]:(~(ssList(X14))|![X15]:((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=X9))|?[X16]:(ssItem(X16)&(((memberP(X14,X16)&memberP(X15,X16))<(X13,X16))&~(leq(X13,X16)))))))))))),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)&totalorderedP(esk50_0))&~(nil=esk48_0))&![X13]:(~(ssItem(X13))|![X14]:(~(ssList(X14))|![X15]:((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0))|(ssItem(esk52_3(X13,X14,X15))&(((memberP(X14,esk52_3(X13,X14,X15))&memberP(X15,esk52_3(X13,X14,X15)))<(X13,esk52_3(X13,X14,X15)))&~(leq(X13,esk52_3(X13,X14,X15))))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:![X15]:(((((((((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0))|(ssItem(esk52_3(X13,X14,X15))&(((memberP(X14,esk52_3(X13,X14,X15))&memberP(X15,esk52_3(X13,X14,X15)))<(X13,esk52_3(X13,X14,X15)))&~(leq(X13,esk52_3(X13,X14,X15))))))|~(ssList(X14)))|~(ssItem(X13)))&(((esk49_0=esk51_0&esk48_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,![X13]:![X14]:![X15]:(((((((((ssItem(esk52_3(X13,X14,X15))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13)))&((((((memberP(X14,esk52_3(X13,X14,X15))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13)))&(((memberP(X15,esk52_3(X13,X14,X15))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13))))&(((lt(X13,esk52_3(X13,X14,X15))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13))))&(((~(leq(X13,esk52_3(X13,X14,X15)))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13)))))&(((esk49_0=esk51_0&esk48_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(584,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(585,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(1079,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)],[203,584,theory(equality)])).
% cnf(1082,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)],[1079,135,theory(equality)])).
% cnf(1083,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)],[1082,theory(equality)])).
% cnf(1884,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1083,585,theory(equality)])).
% cnf(1885,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[1884,135,theory(equality)])).
% cnf(1886,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1885,theory(equality)])).
% cnf(1919,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[1886,167,theory(equality)])).
% cnf(1992,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[1919,219,theory(equality)])).
% cnf(2011,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1992,134,theory(equality)])).
% cnf(2012,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2011,135,theory(equality)])).
% cnf(2013,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2012,theory(equality)])).
% cnf(2015,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk10_1(X1))|~ssItem(esk11_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[2013,150,theory(equality)])).
% cnf(3381,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk10_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[2015,151])).
% cnf(3382,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(X1)),inference(csr,[status(thm)],[3381,152])).
% cnf(3384,negated_conjecture,(nil=esk48_0),inference(spm,[status(thm)],[3382,573,theory(equality)])).
% cnf(3416,negated_conjecture,($false),inference(sr,[status(thm)],[3384,577,theory(equality)])).
% cnf(3417,negated_conjecture,($false),3416,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 654
% # ...of these trivial : 9
% # ...subsumed : 154
% # ...remaining for further processing: 491
% # Other redundant clauses eliminated : 106
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 2
% # Generated clauses : 1847
% # ...of the previous two non-trivial : 1570
% # Contextual simplify-reflections : 196
% # Paramodulations : 1712
% # Factorizations : 0
% # Equation resolutions : 135
% # Current number of processed clauses: 279
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 260
% # Current number of unprocessed clauses: 1242
% # ...number of literals in the above : 9750
% # Clause-clause subsumption calls (NU) : 4244
% # Rec. Clause-clause subsumption calls : 1126
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 272 leaves, 1.44+/-1.226 terms/leaf
% # Paramod-from index: 141 leaves, 1.04+/-0.185 terms/leaf
% # Paramod-into index: 251 leaves, 1.28+/-0.954 terms/leaf
% # -------------------------------------------------
% # User time : 0.138 s
% # System time : 0.013 s
% # Total time : 0.151 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.31 CPU 0.37 WC
% FINAL PrfWatch: 0.31 CPU 0.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP14285/SWC243+1.tptp
%
%------------------------------------------------------------------------------