TSTP Solution File: SWC039+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC039+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 : art09.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 06:53:41 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/SystemOnTPTP14317/SWC039+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14317/SWC039+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14317/SWC039+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 14413
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(21, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|nil=X1)|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(((~(cons(X5,nil)=X3)|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5))))))&(~(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)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|nil=X1)|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(((~(cons(X5,nil)=X3)|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5))))))&(~(nil=X4)|~(nil=X3))))))))),inference(assume_negation,[status(cth)],[96])).
% cnf(121,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(143, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(144, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[144])).
% cnf(146,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[145])).
% fof(195, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[21])).
% fof(196, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[195])).
% fof(197, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[196])).
% fof(198, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[197])).
% cnf(200,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[198])).
% cnf(201,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[198])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((nil=X2&X2=X4)&X1=X3)&~(nil=X1))&(?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&(((cons(X5,nil)=X3&app(app(X6,X3),X7)=X4)&![X8]:((~(ssItem(X8))|~(memberP(X6,X8)))|~(lt(X5,X8))))&![X9]:((~(ssItem(X9))|~(memberP(X7,X9)))|~(lt(X9,X5)))))))|(nil=X4&nil=X3))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((nil=X11&X11=X13)&X10=X12)&~(nil=X10))&(?[X14]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&(((cons(X14,nil)=X12&app(app(X15,X12),X16)=X13)&![X17]:((~(ssItem(X17))|~(memberP(X15,X17)))|~(lt(X14,X17))))&![X18]:((~(ssItem(X18))|~(memberP(X16,X18)))|~(lt(X18,X14)))))))|(nil=X13&nil=X12))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((nil=esk49_0&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0))&((ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(((cons(esk52_0,nil)=esk50_0&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&![X17]:((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17))))&![X18]:((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))))))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[568])).
% fof(570, negated_conjecture,![X17]:![X18]:((((((((((((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))&(((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17)))&(cons(esk52_0,nil)=esk50_0&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)))&ssList(esk54_0))&ssList(esk53_0))&ssItem(esk52_0))|(nil=esk51_0&nil=esk50_0))&(((nil=esk49_0&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:(((((((((((nil=esk51_0|((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0))))&(nil=esk50_0|((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))))&(((nil=esk51_0|((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17))))&(nil=esk50_0|((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17)))))&(((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0))&((nil=esk51_0|app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&(nil=esk50_0|app(app(esk53_0,esk50_0),esk54_0)=esk51_0)))))&((nil=esk51_0|ssList(esk54_0))&(nil=esk50_0|ssList(esk54_0))))&((nil=esk51_0|ssList(esk53_0))&(nil=esk50_0|ssList(esk53_0))))&((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0))))&(((nil=esk49_0&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(nil=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssList(esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(ssList(esk54_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(app(app(esk53_0,esk50_0),esk54_0)=esk51_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(594,negated_conjecture,(esk50_0!=nil),inference(rw,[status(thm)],[576,577,theory(equality)])).
% cnf(595,negated_conjecture,(esk51_0=nil),inference(rw,[status(thm)],[578,579,theory(equality)])).
% cnf(596,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,577,theory(equality)])).
% cnf(604,negated_conjecture,(esk50_0=nil|app(app(esk53_0,esk50_0),esk54_0)=nil),inference(rw,[status(thm)],[586,595,theory(equality)])).
% cnf(1429,negated_conjecture,(ssList(esk53_0)),inference(sr,[status(thm)],[582,594,theory(equality)])).
% cnf(1430,negated_conjecture,(ssList(esk54_0)),inference(sr,[status(thm)],[584,594,theory(equality)])).
% cnf(1432,negated_conjecture,(app(app(esk53_0,esk50_0),esk54_0)=nil),inference(sr,[status(thm)],[604,594,theory(equality)])).
% cnf(1579,negated_conjecture,(nil=esk54_0|~ssList(esk54_0)|~ssList(app(esk53_0,esk50_0))),inference(spm,[status(thm)],[201,1432,theory(equality)])).
% cnf(1606,negated_conjecture,(nil=esk54_0|$false|~ssList(app(esk53_0,esk50_0))),inference(rw,[status(thm)],[1579,1430,theory(equality)])).
% cnf(1607,negated_conjecture,(nil=esk54_0|~ssList(app(esk53_0,esk50_0))),inference(cn,[status(thm)],[1606,theory(equality)])).
% cnf(1622,negated_conjecture,(esk54_0=nil|~ssList(esk50_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[1607,146,theory(equality)])).
% cnf(1623,negated_conjecture,(esk54_0=nil|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[1622,596,theory(equality)])).
% cnf(1624,negated_conjecture,(esk54_0=nil|$false|$false),inference(rw,[status(thm)],[1623,1429,theory(equality)])).
% cnf(1625,negated_conjecture,(esk54_0=nil),inference(cn,[status(thm)],[1624,theory(equality)])).
% cnf(1641,negated_conjecture,(app(app(esk53_0,esk50_0),nil)=nil),inference(rw,[status(thm)],[1432,1625,theory(equality)])).
% cnf(1643,negated_conjecture,(nil=app(esk53_0,esk50_0)|~ssList(nil)|~ssList(app(esk53_0,esk50_0))),inference(spm,[status(thm)],[200,1641,theory(equality)])).
% cnf(1659,negated_conjecture,(nil=app(esk53_0,esk50_0)|$false|~ssList(app(esk53_0,esk50_0))),inference(rw,[status(thm)],[1643,121,theory(equality)])).
% cnf(1660,negated_conjecture,(nil=app(esk53_0,esk50_0)|~ssList(app(esk53_0,esk50_0))),inference(cn,[status(thm)],[1659,theory(equality)])).
% cnf(1694,negated_conjecture,(app(esk53_0,esk50_0)=nil|~ssList(esk50_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[1660,146,theory(equality)])).
% cnf(1695,negated_conjecture,(app(esk53_0,esk50_0)=nil|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[1694,596,theory(equality)])).
% cnf(1696,negated_conjecture,(app(esk53_0,esk50_0)=nil|$false|$false),inference(rw,[status(thm)],[1695,1429,theory(equality)])).
% cnf(1697,negated_conjecture,(app(esk53_0,esk50_0)=nil),inference(cn,[status(thm)],[1696,theory(equality)])).
% cnf(1708,negated_conjecture,(nil=esk50_0|~ssList(esk50_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[201,1697,theory(equality)])).
% cnf(1747,negated_conjecture,(nil=esk50_0|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[1708,596,theory(equality)])).
% cnf(1748,negated_conjecture,(nil=esk50_0|$false|$false),inference(rw,[status(thm)],[1747,1429,theory(equality)])).
% cnf(1749,negated_conjecture,(nil=esk50_0),inference(cn,[status(thm)],[1748,theory(equality)])).
% cnf(1750,negated_conjecture,($false),inference(sr,[status(thm)],[1749,594,theory(equality)])).
% cnf(1751,negated_conjecture,($false),1750,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 224
% # ...of these trivial : 10
% # ...subsumed : 3
% # ...remaining for further processing: 211
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 684
% # ...of the previous two non-trivial : 573
% # Contextual simplify-reflections : 2
% # Paramodulations : 588
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 193
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 170
% # Current number of unprocessed clauses: 484
% # ...number of literals in the above : 3323
% # Clause-clause subsumption calls (NU) : 836
% # Rec. Clause-clause subsumption calls : 154
% # Unit Clause-clause subsumption calls : 68
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 232 leaves, 1.34+/-1.138 terms/leaf
% # Paramod-from index: 103 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 196 leaves, 1.23+/-0.983 terms/leaf
% # -------------------------------------------------
% # User time : 0.070 s
% # System time : 0.006 s
% # Total time : 0.076 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP14317/SWC039+1.tptp
%
%------------------------------------------------------------------------------