TSTP Solution File: SWC025+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC025+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 : art05.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:51:54 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP15887/SWC025+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15887/SWC025+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15887/SWC025+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 15983
% 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]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(5, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>![X3]:(ssList(X3)=>(memberP(cons(X2,X3),X1)<=>(X1=X2|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax37)).
% fof(7, axiom,![X1]:(ssList(X1)=>(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax20)).
% fof(10, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(63, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(duplicatefreeP(X3)))|?[X5]:(ssItem(X5)&((~(memberP(X4,X5))&memberP(X3,X5))|(~(memberP(X3,X5))&memberP(X4,X5)))))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2))))))),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))|~(duplicatefreeP(X3)))|?[X5]:(ssItem(X5)&((~(memberP(X4,X5))&memberP(X3,X5))|(~(memberP(X3,X5))&memberP(X4,X5)))))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(duplicatefreeP(X3)))|?[X5]:(ssItem(X5)&((~(memberP(X4,X5))&memberP(X3,X5))|(~(memberP(X3,X5))&memberP(X4,X5)))))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(110, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(111, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[110])).
% cnf(112,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(114, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssList(X3))|((~(memberP(cons(X2,X3),X1))|(X1=X2|memberP(X3,X1)))&((~(X1=X2)&~(memberP(X3,X1)))|memberP(cons(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[5])).
% fof(115, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[114])).
% fof(116, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4))))|~(ssItem(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[115])).
% fof(117, plain,![X4]:![X5]:![X6]:(((((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&(((((~(X4=X5)|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[116])).
% cnf(119,plain,(memberP(cons(X2,X3),X1)|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|X1!=X2),inference(split_conjunct,[status(thm)],[117])).
% fof(124, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(125, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk3_1(X4))&(ssItem(esk4_1(X4))&cons(esk4_1(X4),esk3_1(X4))=X4)))),inference(skolemize,[status(esa)],[125])).
% fof(127, plain,![X4]:(((ssList(esk3_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk4_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk4_1(X4),esk3_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[126])).
% cnf(128,plain,(nil=X1|cons(esk4_1(X1),esk3_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[127])).
% cnf(129,plain,(nil=X1|ssItem(esk4_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[127])).
% cnf(130,plain,(nil=X1|ssList(esk3_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[127])).
% fof(142, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(143, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[142])).
% cnf(144,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[143])).
% fof(374, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[63])).
% fof(375, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[374])).
% fof(376, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[375])).
% cnf(377,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[376])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&duplicatefreeP(X3))&![X5]:(~(ssItem(X5))|((memberP(X4,X5)|~(memberP(X3,X5)))&(memberP(X3,X5)|~(memberP(X4,X5))))))&((nil=X2&~(nil=X1))|(nil=X1&~(nil=X2)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&((((X7=X9&X6=X8)&duplicatefreeP(X8))&![X10]:(~(ssItem(X10))|((memberP(X9,X10)|~(memberP(X8,X10)))&(memberP(X8,X10)|~(memberP(X9,X10))))))&((nil=X7&~(nil=X6))|(nil=X6&~(nil=X7)))))))),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)&duplicatefreeP(esk50_0))&![X10]:(~(ssItem(X10))|((memberP(esk51_0,X10)|~(memberP(esk50_0,X10)))&(memberP(esk50_0,X10)|~(memberP(esk51_0,X10))))))&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X10]:(((((((~(ssItem(X10))|((memberP(esk51_0,X10)|~(memberP(esk50_0,X10)))&(memberP(esk50_0,X10)|~(memberP(esk51_0,X10)))))&((esk49_0=esk51_0&esk48_0=esk50_0)&duplicatefreeP(esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X10]:(((((((((memberP(esk51_0,X10)|~(memberP(esk50_0,X10)))|~(ssItem(X10)))&((memberP(esk50_0,X10)|~(memberP(esk51_0,X10)))|~(ssItem(X10))))&((esk49_0=esk51_0&esk48_0=esk50_0)&duplicatefreeP(esk50_0)))&(((nil=esk48_0|nil=esk49_0)&(~(nil=esk49_0)|nil=esk49_0))&((nil=esk48_0|~(nil=esk48_0))&(~(nil=esk49_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(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil=esk49_0|nil=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(memberP(esk50_0,X1)|~ssItem(X1)|~memberP(esk51_0,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(memberP(esk51_0,X1)|~ssItem(X1)|~memberP(esk50_0,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(esk50_0!=nil|esk49_0!=nil),inference(rw,[status(thm)],[577,582,theory(equality)])).
% cnf(587,negated_conjecture,(esk50_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[586,583,theory(equality)])).
% cnf(588,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,582,theory(equality)])).
% cnf(589,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,583,theory(equality)])).
% cnf(592,negated_conjecture,(esk50_0=nil|esk49_0=nil),inference(rw,[status(thm)],[580,582,theory(equality)])).
% cnf(593,negated_conjecture,(esk50_0=nil|esk51_0=nil),inference(rw,[status(thm)],[592,583,theory(equality)])).
% cnf(699,plain,(hd(X1)=esk4_1(X1)|nil=X1|~ssList(esk3_1(X1))|~ssItem(esk4_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[377,128,theory(equality)])).
% cnf(701,plain,(memberP(cons(X1,X2),X1)|~ssList(X2)|~ssItem(X1)),inference(er,[status(thm)],[119,theory(equality)])).
% cnf(2223,plain,(memberP(X1,esk4_1(X1))|nil=X1|~ssList(esk3_1(X1))|~ssItem(esk4_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[701,128,theory(equality)])).
% cnf(2359,plain,(esk4_1(X1)=hd(X1)|nil=X1|~ssList(esk3_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[699,129])).
% cnf(2360,plain,(esk4_1(X1)=hd(X1)|nil=X1|~ssList(X1)),inference(csr,[status(thm)],[2359,130])).
% cnf(3259,plain,(nil=X1|memberP(X1,esk4_1(X1))|~ssList(esk3_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[2223,129])).
% cnf(3260,plain,(nil=X1|memberP(X1,esk4_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[3259,130])).
% cnf(3261,negated_conjecture,(memberP(esk50_0,esk4_1(esk51_0))|nil=esk51_0|~ssItem(esk4_1(esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[584,3260,theory(equality)])).
% cnf(3262,negated_conjecture,(memberP(esk51_0,esk4_1(esk50_0))|nil=esk50_0|~ssItem(esk4_1(esk50_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[585,3260,theory(equality)])).
% cnf(3272,negated_conjecture,(memberP(esk50_0,esk4_1(esk51_0))|nil=esk51_0|~ssItem(esk4_1(esk51_0))|$false),inference(rw,[status(thm)],[3261,589,theory(equality)])).
% cnf(3273,negated_conjecture,(memberP(esk50_0,esk4_1(esk51_0))|nil=esk51_0|~ssItem(esk4_1(esk51_0))),inference(cn,[status(thm)],[3272,theory(equality)])).
% cnf(3274,negated_conjecture,(memberP(esk51_0,esk4_1(esk50_0))|nil=esk50_0|~ssItem(esk4_1(esk50_0))|$false),inference(rw,[status(thm)],[3262,588,theory(equality)])).
% cnf(3275,negated_conjecture,(memberP(esk51_0,esk4_1(esk50_0))|nil=esk50_0|~ssItem(esk4_1(esk50_0))),inference(cn,[status(thm)],[3274,theory(equality)])).
% cnf(3277,negated_conjecture,(esk51_0=nil|memberP(esk50_0,esk4_1(esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[3273,129,theory(equality)])).
% cnf(3280,negated_conjecture,(esk51_0=nil|memberP(esk50_0,esk4_1(esk51_0))|$false),inference(rw,[status(thm)],[3277,589,theory(equality)])).
% cnf(3281,negated_conjecture,(esk51_0=nil|memberP(esk50_0,esk4_1(esk51_0))),inference(cn,[status(thm)],[3280,theory(equality)])).
% cnf(3289,negated_conjecture,(esk51_0=nil|memberP(esk50_0,hd(esk51_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[3281,2360,theory(equality)])).
% cnf(3302,negated_conjecture,(esk51_0=nil|memberP(esk50_0,hd(esk51_0))|$false),inference(rw,[status(thm)],[3289,589,theory(equality)])).
% cnf(3303,negated_conjecture,(esk51_0=nil|memberP(esk50_0,hd(esk51_0))),inference(cn,[status(thm)],[3302,theory(equality)])).
% cnf(3324,negated_conjecture,(esk50_0=nil|memberP(esk51_0,esk4_1(esk50_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[3275,129,theory(equality)])).
% cnf(3327,negated_conjecture,(esk50_0=nil|memberP(esk51_0,esk4_1(esk50_0))|$false),inference(rw,[status(thm)],[3324,588,theory(equality)])).
% cnf(3328,negated_conjecture,(esk50_0=nil|memberP(esk51_0,esk4_1(esk50_0))),inference(cn,[status(thm)],[3327,theory(equality)])).
% cnf(3337,negated_conjecture,(esk50_0=nil|memberP(nil,esk4_1(esk50_0))),inference(spm,[status(thm)],[3328,593,theory(equality)])).
% cnf(3380,negated_conjecture,(esk50_0=nil|~ssItem(esk4_1(esk50_0))),inference(spm,[status(thm)],[112,3337,theory(equality)])).
% cnf(3397,negated_conjecture,(esk50_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[3380,129,theory(equality)])).
% cnf(3400,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[3397,588,theory(equality)])).
% cnf(3401,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[3400,theory(equality)])).
% cnf(3410,negated_conjecture,(esk51_0=nil|memberP(nil,hd(esk51_0))),inference(rw,[status(thm)],[3303,3401,theory(equality)])).
% cnf(3424,negated_conjecture,($false|esk51_0!=nil),inference(rw,[status(thm)],[587,3401,theory(equality)])).
% cnf(3425,negated_conjecture,(esk51_0!=nil),inference(cn,[status(thm)],[3424,theory(equality)])).
% cnf(3428,negated_conjecture,(memberP(nil,hd(esk51_0))),inference(sr,[status(thm)],[3410,3425,theory(equality)])).
% cnf(3435,negated_conjecture,(~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[112,3428,theory(equality)])).
% cnf(3448,negated_conjecture,(nil=esk51_0|~ssList(esk51_0)),inference(spm,[status(thm)],[3435,144,theory(equality)])).
% cnf(3449,negated_conjecture,(nil=esk51_0|$false),inference(rw,[status(thm)],[3448,589,theory(equality)])).
% cnf(3450,negated_conjecture,(nil=esk51_0),inference(cn,[status(thm)],[3449,theory(equality)])).
% cnf(3451,negated_conjecture,($false),inference(sr,[status(thm)],[3450,3425,theory(equality)])).
% cnf(3452,negated_conjecture,($false),3451,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 514
% # ...of these trivial : 2
% # ...subsumed : 189
% # ...remaining for further processing: 323
% # Other redundant clauses eliminated : 79
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 27
% # Generated clauses : 1434
% # ...of the previous two non-trivial : 1213
% # Contextual simplify-reflections : 232
% # Paramodulations : 1325
% # Factorizations : 0
% # Equation resolutions : 109
% # Current number of processed clauses: 282
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 255
% # Current number of unprocessed clauses: 788
% # ...number of literals in the above : 5365
% # Clause-clause subsumption calls (NU) : 4216
% # Rec. Clause-clause subsumption calls : 2624
% # Unit Clause-clause subsumption calls : 41
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 284 leaves, 1.35+/-1.063 terms/leaf
% # Paramod-from index: 162 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 261 leaves, 1.20+/-0.872 terms/leaf
% # -------------------------------------------------
% # User time : 0.117 s
% # System time : 0.008 s
% # Total time : 0.125 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.35 WC
% FINAL PrfWatch: 0.27 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP15887/SWC025+1.tptp
%
%------------------------------------------------------------------------------