TSTP Solution File: SWC182+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC182+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 : art07.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:17:53 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP31565/SWC182+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31565/SWC182+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31565/SWC182+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 31661
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% 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(14, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(19, 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=X3)|~(X2=X4))|~(X1=X3))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|(~(memberP(X6,X5))&~(memberP(X7,X5)))))))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(nil=X3)|~(X2=X4))|~(X1=X3))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|(~(memberP(X6,X5))&~(memberP(X7,X5))))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(nil=X3)|~(X2=X4))|~(X1=X3))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(~(app(app(X6,cons(X5,nil)),X7)=X1)|(~(memberP(X6,X5))&~(memberP(X7,X5))))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(118, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(119, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[119])).
% cnf(121,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(144, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(145, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[144])).
% fof(146, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[145])).
% cnf(147,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[146])).
% fof(169, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(170, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[169])).
% cnf(171,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[170])).
% fof(188, 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)],[19])).
% fof(189, 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)],[188])).
% fof(190, 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)],[189])).
% fof(191, 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)],[190])).
% cnf(193,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[191])).
% cnf(194,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[191])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((nil=X3&X2=X4)&X1=X3)&?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&(app(app(X6,cons(X5,nil)),X7)=X1&(memberP(X6,X5)|memberP(X7,X5))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&(((nil=X10&X9=X11)&X8=X10)&?[X12]:(ssItem(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&(app(app(X13,cons(X12,nil)),X14)=X8&(memberP(X13,X12)|memberP(X14,X12))))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((nil=esk50_0&esk49_0=esk51_0)&esk48_0=esk50_0)&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0&(memberP(esk53_0,esk52_0)|memberP(esk54_0,esk52_0))))))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(memberP(esk54_0,esk52_0)|memberP(esk53_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(nil=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(583,negated_conjecture,(nil=esk48_0),inference(rw,[status(thm)],[576,578,theory(equality)])).
% cnf(588,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=nil),inference(rw,[status(thm)],[572,583,theory(equality)])).
% cnf(611,negated_conjecture,(nil=esk54_0|~ssList(esk54_0)|~ssList(app(esk53_0,cons(esk52_0,nil)))),inference(spm,[status(thm)],[194,588,theory(equality)])).
% cnf(614,negated_conjecture,(nil=esk54_0|$false|~ssList(app(esk53_0,cons(esk52_0,nil)))),inference(rw,[status(thm)],[611,573,theory(equality)])).
% cnf(615,negated_conjecture,(nil=esk54_0|~ssList(app(esk53_0,cons(esk52_0,nil)))),inference(cn,[status(thm)],[614,theory(equality)])).
% cnf(1371,negated_conjecture,(esk54_0=nil|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(spm,[status(thm)],[615,147,theory(equality)])).
% cnf(1372,negated_conjecture,(esk54_0=nil|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[1371,574,theory(equality)])).
% cnf(1373,negated_conjecture,(esk54_0=nil|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1372,theory(equality)])).
% cnf(1374,negated_conjecture,(esk54_0=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1373,121,theory(equality)])).
% cnf(1375,negated_conjecture,(esk54_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1374,122,theory(equality)])).
% cnf(1376,negated_conjecture,(esk54_0=nil|$false|$false),inference(rw,[status(thm)],[1375,575,theory(equality)])).
% cnf(1377,negated_conjecture,(esk54_0=nil),inference(cn,[status(thm)],[1376,theory(equality)])).
% cnf(1380,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),nil)=nil),inference(rw,[status(thm)],[588,1377,theory(equality)])).
% cnf(1381,negated_conjecture,(memberP(nil,esk52_0)|memberP(esk53_0,esk52_0)),inference(rw,[status(thm)],[571,1377,theory(equality)])).
% cnf(1407,negated_conjecture,(nil=app(esk53_0,cons(esk52_0,nil))|~ssList(nil)|~ssList(app(esk53_0,cons(esk52_0,nil)))),inference(spm,[status(thm)],[193,1380,theory(equality)])).
% cnf(1423,negated_conjecture,(nil=app(esk53_0,cons(esk52_0,nil))|$false|~ssList(app(esk53_0,cons(esk52_0,nil)))),inference(rw,[status(thm)],[1407,122,theory(equality)])).
% cnf(1424,negated_conjecture,(nil=app(esk53_0,cons(esk52_0,nil))|~ssList(app(esk53_0,cons(esk52_0,nil)))),inference(cn,[status(thm)],[1423,theory(equality)])).
% cnf(1456,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(spm,[status(thm)],[1424,147,theory(equality)])).
% cnf(1457,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[1456,574,theory(equality)])).
% cnf(1458,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1457,theory(equality)])).
% cnf(1459,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1458,121,theory(equality)])).
% cnf(1460,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1459,122,theory(equality)])).
% cnf(1461,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|$false|$false),inference(rw,[status(thm)],[1460,575,theory(equality)])).
% cnf(1462,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil),inference(cn,[status(thm)],[1461,theory(equality)])).
% cnf(1463,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(spm,[status(thm)],[193,1462,theory(equality)])).
% cnf(1488,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[1463,574,theory(equality)])).
% cnf(1489,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1488,theory(equality)])).
% cnf(1584,negated_conjecture,(esk53_0=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1489,121,theory(equality)])).
% cnf(1585,negated_conjecture,(esk53_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1584,122,theory(equality)])).
% cnf(1586,negated_conjecture,(esk53_0=nil|$false|$false),inference(rw,[status(thm)],[1585,575,theory(equality)])).
% cnf(1587,negated_conjecture,(esk53_0=nil),inference(cn,[status(thm)],[1586,theory(equality)])).
% cnf(1589,negated_conjecture,(memberP(nil,esk52_0)|memberP(nil,esk52_0)),inference(rw,[status(thm)],[1381,1587,theory(equality)])).
% cnf(1590,negated_conjecture,(memberP(nil,esk52_0)),inference(cn,[status(thm)],[1589,theory(equality)])).
% cnf(1599,negated_conjecture,(~ssItem(esk52_0)),inference(spm,[status(thm)],[171,1590,theory(equality)])).
% cnf(1618,negated_conjecture,($false),inference(rw,[status(thm)],[1599,575,theory(equality)])).
% cnf(1619,negated_conjecture,($false),inference(cn,[status(thm)],[1618,theory(equality)])).
% cnf(1620,negated_conjecture,($false),1619,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 213
% # ...of these trivial : 3
% # ...subsumed : 1
% # ...remaining for further processing: 209
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 12
% # Generated clauses : 629
% # ...of the previous two non-trivial : 525
% # Contextual simplify-reflections : 2
% # Paramodulations : 538
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 191
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 455
% # ...number of literals in the above : 3192
% # Clause-clause subsumption calls (NU) : 826
% # Rec. Clause-clause subsumption calls : 152
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 229 leaves, 1.35+/-1.145 terms/leaf
% # Paramod-from index: 103 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 194 leaves, 1.24+/-0.987 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.006 s
% # Total time : 0.073 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.26 WC
% FINAL PrfWatch: 0.19 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP31565/SWC182+1.tptp
%
%------------------------------------------------------------------------------