TSTP Solution File: SWC415+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC415+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 08:05:42 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/SystemOnTPTP26447/SWC415+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26447/SWC415+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26447/SWC415+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 26543
% 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(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(3, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&~(X3=X5))&tl(X4)=X5)&neq(nil,X4)))|?[X6]:(((ssList(X6)&tl(X2)=X6)&X1=X6)&neq(nil,X2)))&(~(neq(X2,nil))|neq(X4,nil)))))))),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))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&~(X3=X5))&tl(X4)=X5)&neq(nil,X4)))|?[X6]:(((ssList(X6)&tl(X2)=X6)&X1=X6)&neq(nil,X2)))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&~(X3=X5))&tl(X4)=X5)&neq(nil,X4)))|?[X6]:(((ssList(X6)&tl(X2)=X6)&X1=X6)&neq(nil,X2)))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[106])).
% cnf(108,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[107])).
% cnf(109,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[107])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(111, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(112, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[111])).
% cnf(113,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[112])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:(((~(ssList(X5))|X3=X5)|~(tl(X4)=X5))|~(neq(nil,X4))))&![X6]:(((~(ssList(X6))|~(tl(X2)=X6))|~(X1=X6))|~(neq(nil,X2))))|(neq(X2,nil)&~(neq(X4,nil))))))))),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)&(((neq(X8,nil)&![X11]:(((~(ssList(X11))|X9=X11)|~(tl(X10)=X11))|~(neq(nil,X10))))&![X12]:(((~(ssList(X12))|~(tl(X8)=X12))|~(X7=X12))|~(neq(nil,X8))))|(neq(X8,nil)&~(neq(X10,nil))))))))),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)&(((neq(esk49_0,nil)&![X11]:(((~(ssList(X11))|esk50_0=X11)|~(tl(esk51_0)=X11))|~(neq(nil,esk51_0))))&![X12]:(((~(ssList(X12))|~(tl(esk49_0)=X12))|~(esk48_0=X12))|~(neq(nil,esk49_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:![X12]:((((((((((~(ssList(X12))|~(tl(esk49_0)=X12))|~(esk48_0=X12))|~(neq(nil,esk49_0)))&((((~(ssList(X11))|esk50_0=X11)|~(tl(esk51_0)=X11))|~(neq(nil,esk51_0)))&neq(esk49_0,nil)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:![X12]:((((((((neq(esk49_0,nil)|(((~(ssList(X12))|~(tl(esk49_0)=X12))|~(esk48_0=X12))|~(neq(nil,esk49_0))))&(~(neq(esk51_0,nil))|(((~(ssList(X12))|~(tl(esk49_0)=X12))|~(esk48_0=X12))|~(neq(nil,esk49_0)))))&(((neq(esk49_0,nil)|(((~(ssList(X11))|esk50_0=X11)|~(tl(esk51_0)=X11))|~(neq(nil,esk51_0))))&(~(neq(esk51_0,nil))|(((~(ssList(X11))|esk50_0=X11)|~(tl(esk51_0)=X11))|~(neq(nil,esk51_0)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk50_0=X1|~neq(nil,esk51_0)|tl(esk51_0)!=X1|~ssList(X1)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(~neq(nil,esk49_0)|esk48_0!=X1|tl(esk49_0)!=X1|~ssList(X1)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(590,negated_conjecture,(esk48_0!=X1|tl(esk49_0)!=X1|~ssList(X1)|~neq(nil,esk49_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),580,theory(equality)])).
% cnf(591,negated_conjecture,(esk48_0!=X1|tl(esk49_0)!=X1|~ssList(X1)|~neq(nil,esk49_0)),inference(cn,[status(thm)],[590,theory(equality)])).
% cnf(593,negated_conjecture,(esk48_0=X1|tl(esk51_0)!=X1|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,577,theory(equality)])).
% cnf(594,negated_conjecture,(esk48_0=X1|tl(esk49_0)!=X1|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[593,578,theory(equality)])).
% cnf(595,negated_conjecture,(esk48_0=X1|tl(esk49_0)!=X1|~ssList(X1)|~neq(nil,esk49_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[594,578,theory(equality)])).
% cnf(596,negated_conjecture,(esk48_0=X1|tl(esk49_0)!=X1|~ssList(X1)|~neq(nil,esk49_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[595,578,theory(equality)]),580,theory(equality)])).
% cnf(597,negated_conjecture,(esk48_0=X1|tl(esk49_0)!=X1|~ssList(X1)|~neq(nil,esk49_0)),inference(cn,[status(thm)],[596,theory(equality)])).
% cnf(598,negated_conjecture,(tl(esk49_0)!=X1|~neq(nil,esk49_0)|~ssList(X1)),inference(csr,[status(thm)],[597,591])).
% cnf(613,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(628,negated_conjecture,(nil=esk49_0|tl(esk49_0)!=X1|~ssList(X1)|~ssList(esk49_0)|~ssList(nil)),inference(spm,[status(thm)],[598,108,theory(equality)])).
% cnf(629,negated_conjecture,(nil=esk49_0|tl(esk49_0)!=X1|~ssList(X1)|$false|~ssList(nil)),inference(rw,[status(thm)],[628,574,theory(equality)])).
% cnf(630,negated_conjecture,(nil=esk49_0|tl(esk49_0)!=X1|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[629,110,theory(equality)])).
% cnf(631,negated_conjecture,(nil=esk49_0|tl(esk49_0)!=X1|~ssList(X1)),inference(cn,[status(thm)],[630,theory(equality)])).
% cnf(1493,negated_conjecture,(esk49_0=nil|~ssList(tl(esk49_0))),inference(er,[status(thm)],[631,theory(equality)])).
% cnf(1494,negated_conjecture,(esk49_0=nil|~ssList(esk49_0)),inference(spm,[status(thm)],[1493,113,theory(equality)])).
% cnf(1495,negated_conjecture,(esk49_0=nil|$false),inference(rw,[status(thm)],[1494,574,theory(equality)])).
% cnf(1496,negated_conjecture,(esk49_0=nil),inference(cn,[status(thm)],[1495,theory(equality)])).
% cnf(1503,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[580,1496,theory(equality)])).
% cnf(1509,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[613,1503,theory(equality)])).
% cnf(1510,negated_conjecture,($false),inference(rw,[status(thm)],[1509,110,theory(equality)])).
% cnf(1511,negated_conjecture,($false),inference(cn,[status(thm)],[1510,theory(equality)])).
% cnf(1512,negated_conjecture,($false),1511,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 220
% # ...of these trivial : 5
% # ...subsumed : 2
% # ...remaining for further processing: 213
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 10
% # Generated clauses : 594
% # ...of the previous two non-trivial : 487
% # Contextual simplify-reflections : 3
% # Paramodulations : 501
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 196
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 171
% # Current number of unprocessed clauses: 446
% # ...number of literals in the above : 3180
% # Clause-clause subsumption calls (NU) : 836
% # Rec. Clause-clause subsumption calls : 153
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 234 leaves, 1.35+/-1.134 terms/leaf
% # Paramod-from index: 106 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 199 leaves, 1.24+/-0.978 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.005 s
% # Total time : 0.072 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/SystemOnTPTP26447/SWC415+1.tptp
%
%------------------------------------------------------------------------------