TSTP Solution File: SWC407+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC407+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 : art02.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 08:04:27 EST 2010
% Result : Theorem 1.31s
% Output : Solution 1.31s
% 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/SystemOnTPTP22195/SWC407+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22195/SWC407+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22195/SWC407+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 22291
% 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,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(8, 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(9, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(13, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(41, axiom,~(singletonP(nil)),file('/tmp/SRASS.s.p', ax39)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))|(![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6))))&(~(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)=>(((~(X2=X4)|~(X1=X3))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))|(![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6))))&(~(nil=X4)|~(nil=X3))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(99, plain,~(singletonP(nil)),inference(fof_simplification,[status(thm)],[41,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))|(![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(113,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(135, 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)],[8])).
% fof(136, 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)],[135])).
% fof(137, 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)],[136])).
% fof(138, 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)],[137])).
% cnf(141,plain,(memberP(X3,X1)|X1=X2|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|~memberP(cons(X2,X3),X1)),inference(split_conjunct,[status(thm)],[138])).
% fof(142, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(143, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[142])).
% cnf(144,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[143])).
% fof(162, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(163, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[162])).
% fof(164, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk7_1(X3))&cons(esk7_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[163])).
% fof(165, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk7_1(X3))&cons(esk7_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[164])).
% fof(166, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk7_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk7_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[165])).
% cnf(169,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[166])).
% cnf(298,plain,(~singletonP(nil)),inference(split_conjunct,[status(thm)],[99])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&?[X5]:(ssItem(X5)&(memberP(X1,X5)&~(memberP(X2,X5)))))&(?[X6]:(ssItem(X6)&(cons(X6,nil)=X3&memberP(X4,X6)))|(nil=X4&nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&(((X8=X10&X7=X9)&?[X11]:(ssItem(X11)&(memberP(X7,X11)&~(memberP(X8,X11)))))&(?[X12]:(ssItem(X12)&(cons(X12,nil)=X9&memberP(X10,X12)))|(nil=X10&nil=X9))))))),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)&(ssItem(esk52_0)&(memberP(esk48_0,esk52_0)&~(memberP(esk49_0,esk52_0)))))&((ssItem(esk53_0)&(cons(esk53_0,nil)=esk50_0&memberP(esk51_0,esk53_0)))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((esk49_0=esk51_0&esk48_0=esk50_0)&(ssItem(esk52_0)&(memberP(esk48_0,esk52_0)&~(memberP(esk49_0,esk52_0)))))&(((nil=esk51_0|ssItem(esk53_0))&(nil=esk50_0|ssItem(esk53_0)))&(((nil=esk51_0|cons(esk53_0,nil)=esk50_0)&(nil=esk50_0|cons(esk53_0,nil)=esk50_0))&((nil=esk51_0|memberP(esk51_0,esk53_0))&(nil=esk50_0|memberP(esk51_0,esk53_0)))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(memberP(esk51_0,esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(cons(esk53_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(cons(esk53_0,nil)=esk50_0|nil=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(ssItem(esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(ssItem(esk53_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(~memberP(esk49_0,esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(memberP(esk48_0,esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(~memberP(esk51_0,esk52_0)),inference(rw,[status(thm)],[578,582,theory(equality)])).
% cnf(588,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[586,581,theory(equality)])).
% cnf(592,negated_conjecture,(memberP(esk50_0,esk52_0)),inference(rw,[status(thm)],[579,581,theory(equality)])).
% cnf(654,plain,(singletonP(cons(X1,nil))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(er,[status(thm)],[169,theory(equality)])).
% cnf(934,negated_conjecture,(X1=esk53_0|memberP(nil,X1)|esk50_0=nil|~memberP(esk50_0,X1)|~ssList(nil)|~ssItem(esk53_0)|~ssItem(X1)),inference(spm,[status(thm)],[141,574,theory(equality)])).
% cnf(939,negated_conjecture,(X1=esk53_0|memberP(nil,X1)|esk50_0=nil|~memberP(esk50_0,X1)|$false|~ssItem(esk53_0)|~ssItem(X1)),inference(rw,[status(thm)],[934,113,theory(equality)])).
% cnf(940,negated_conjecture,(X1=esk53_0|memberP(nil,X1)|esk50_0=nil|~memberP(esk50_0,X1)|~ssItem(esk53_0)|~ssItem(X1)),inference(cn,[status(thm)],[939,theory(equality)])).
% cnf(2214,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|~ssList(esk50_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[654,575,theory(equality)])).
% cnf(2220,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2214,588,theory(equality)])).
% cnf(2221,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|~ssItem(esk53_0)),inference(cn,[status(thm)],[2220,theory(equality)])).
% cnf(2234,negated_conjecture,(esk51_0=nil|singletonP(esk50_0)),inference(csr,[status(thm)],[2221,577])).
% cnf(2339,negated_conjecture,(esk50_0=nil|X1=esk53_0|memberP(nil,X1)|~memberP(esk50_0,X1)|~ssItem(X1)),inference(csr,[status(thm)],[940,576])).
% cnf(2340,negated_conjecture,(esk50_0=nil|X1=esk53_0|~memberP(esk50_0,X1)|~ssItem(X1)),inference(csr,[status(thm)],[2339,144])).
% cnf(2341,negated_conjecture,(esk50_0=nil|esk52_0=esk53_0|~ssItem(esk52_0)),inference(spm,[status(thm)],[2340,592,theory(equality)])).
% cnf(2342,negated_conjecture,(esk50_0=nil|esk52_0=esk53_0|$false),inference(rw,[status(thm)],[2341,580,theory(equality)])).
% cnf(2343,negated_conjecture,(esk50_0=nil|esk52_0=esk53_0),inference(cn,[status(thm)],[2342,theory(equality)])).
% cnf(2346,negated_conjecture,(esk50_0=nil|~memberP(esk51_0,esk53_0)),inference(spm,[status(thm)],[587,2343,theory(equality)])).
% cnf(2353,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[2346,572])).
% cnf(2355,negated_conjecture,(esk51_0=nil|singletonP(nil)),inference(rw,[status(thm)],[2234,2353,theory(equality)])).
% cnf(2356,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[2355,298,theory(equality)])).
% cnf(2426,negated_conjecture,(memberP(nil,esk52_0)),inference(rw,[status(thm)],[592,2353,theory(equality)])).
% cnf(2442,negated_conjecture,(~memberP(nil,esk52_0)),inference(rw,[status(thm)],[587,2356,theory(equality)])).
% cnf(2453,negated_conjecture,($false),inference(sr,[status(thm)],[2426,2442,theory(equality)])).
% cnf(2454,negated_conjecture,($false),2453,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 333
% # ...of these trivial : 3
% # ...subsumed : 51
% # ...remaining for further processing: 279
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 66
% # Generated clauses : 913
% # ...of the previous two non-trivial : 795
% # Contextual simplify-reflections : 81
% # Paramodulations : 818
% # Factorizations : 0
% # Equation resolutions : 95
% # Current number of processed clauses: 205
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 179
% # Current number of unprocessed clauses: 440
% # ...number of literals in the above : 3162
% # Clause-clause subsumption calls (NU) : 1556
% # Rec. Clause-clause subsumption calls : 635
% # Unit Clause-clause subsumption calls : 28
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 242 leaves, 1.33+/-1.117 terms/leaf
% # Paramod-from index: 111 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 207 leaves, 1.23+/-0.959 terms/leaf
% # -------------------------------------------------
% # User time : 0.091 s
% # System time : 0.003 s
% # Total time : 0.094 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP22195/SWC407+1.tptp
%
%------------------------------------------------------------------------------