TSTP Solution File: SWC048+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC048+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 06:54:48 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/SystemOnTPTP12254/SWC048+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12254/SWC048+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12254/SWC048+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 12350
% 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(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>((rearsegP(X1,X2)&rearsegP(X2,X1))=>X1=X2))),file('/tmp/SRASS.s.p', ax48)).
% fof(5, axiom,![X1]:(ssList(X1)=>rearsegP(X1,X1)),file('/tmp/SRASS.s.p', ax49)).
% fof(6, axiom,![X1]:(ssList(X1)=>rearsegP(X1,nil)),file('/tmp/SRASS.s.p', ax51)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(X4,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))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),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))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&rearsegP(X2,X5))&rearsegP(X1,X5)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),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(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(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(rearsegP(X1,X2))|~(rearsegP(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(116, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(rearsegP(X3,X4))|~(rearsegP(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ssList(X4))|((~(rearsegP(X3,X4))|~(rearsegP(X4,X3)))|X3=X4))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[116])).
% cnf(118,plain,(X1=X2|~ssList(X1)|~rearsegP(X2,X1)|~rearsegP(X1,X2)|~ssList(X2)),inference(split_conjunct,[status(thm)],[117])).
% fof(119, plain,![X1]:(~(ssList(X1))|rearsegP(X1,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(120, plain,![X2]:(~(ssList(X2))|rearsegP(X2,X2)),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(rearsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(122, plain,![X1]:(~(ssList(X1))|rearsegP(X1,nil)),inference(fof_nnf,[status(thm)],[6])).
% fof(123, plain,![X2]:(~(ssList(X2))|rearsegP(X2,nil)),inference(variable_rename,[status(thm)],[122])).
% cnf(124,plain,(rearsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[123])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&((nil=X2&~(nil=X1))|(neq(X2,nil)&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(rearsegP(X2,X5)))|~(rearsegP(X1,X5))))))&((nil=X4&nil=X3)|(neq(X3,nil)&rearsegP(X4,X3)))))))),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)&((nil=X7&~(nil=X6))|(neq(X7,nil)&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(X7,X10)))|~(rearsegP(X6,X10))))))&((nil=X9&nil=X8)|(neq(X8,nil)&rearsegP(X9,X8)))))))),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)&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(esk49_0,X10)))|~(rearsegP(esk48_0,X10))))))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&rearsegP(esk51_0,esk50_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X10]:(((((((((((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(esk49_0,X10)))|~(rearsegP(esk48_0,X10)))&neq(esk49_0,nil))|(nil=esk49_0&~(nil=esk48_0)))&(esk49_0=esk51_0&esk48_0=esk50_0))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&rearsegP(esk51_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,![X10]:(((((((((nil=esk49_0|(((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(esk49_0,X10)))|~(rearsegP(esk48_0,X10))))&(~(nil=esk48_0)|(((~(ssList(X10))|~(neq(X10,nil)))|~(rearsegP(esk49_0,X10)))|~(rearsegP(esk48_0,X10)))))&((nil=esk49_0|neq(esk49_0,nil))&(~(nil=esk48_0)|neq(esk49_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&(((neq(esk50_0,nil)|nil=esk51_0)&(rearsegP(esk51_0,esk50_0)|nil=esk51_0))&((neq(esk50_0,nil)|nil=esk50_0)&(rearsegP(esk51_0,esk50_0)|nil=esk50_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=esk50_0|rearsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(nil=esk51_0|rearsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil=esk51_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(nil=esk49_0|~rearsegP(esk48_0,X1)|~rearsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,581,theory(equality)])).
% cnf(590,negated_conjecture,(neq(esk49_0,nil)|esk50_0!=nil),inference(rw,[status(thm)],[583,581,theory(equality)])).
% cnf(591,negated_conjecture,(esk50_0=nil|rearsegP(esk49_0,esk50_0)),inference(rw,[status(thm)],[577,582,theory(equality)])).
% cnf(592,negated_conjecture,(esk49_0=nil|neq(esk50_0,nil)),inference(rw,[status(thm)],[580,582,theory(equality)])).
% cnf(593,negated_conjecture,(esk49_0=nil|rearsegP(esk51_0,esk50_0)),inference(rw,[status(thm)],[579,582,theory(equality)])).
% cnf(594,negated_conjecture,(esk49_0=nil|rearsegP(esk49_0,esk50_0)),inference(rw,[status(thm)],[593,582,theory(equality)])).
% cnf(600,negated_conjecture,(esk49_0=nil|~ssList(X1)|~neq(X1,nil)|~rearsegP(esk50_0,X1)|~rearsegP(esk49_0,X1)),inference(rw,[status(thm)],[586,581,theory(equality)])).
% cnf(602,negated_conjecture,(esk49_0=nil|~rearsegP(esk49_0,esk50_0)|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[600,121,theory(equality)])).
% cnf(606,negated_conjecture,(esk49_0=nil|~rearsegP(esk49_0,esk50_0)|~neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[602,587,theory(equality)])).
% cnf(607,negated_conjecture,(esk49_0=nil|~rearsegP(esk49_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[606,theory(equality)])).
% cnf(615,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(666,negated_conjecture,(esk50_0=esk49_0|esk50_0=nil|~rearsegP(esk50_0,esk49_0)|~ssList(esk49_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[118,591,theory(equality)])).
% cnf(669,negated_conjecture,(esk50_0=esk49_0|esk50_0=nil|~rearsegP(esk50_0,esk49_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[666,574,theory(equality)])).
% cnf(670,negated_conjecture,(esk50_0=esk49_0|esk50_0=nil|~rearsegP(esk50_0,esk49_0)|$false|$false),inference(rw,[status(thm)],[669,587,theory(equality)])).
% cnf(671,negated_conjecture,(esk50_0=esk49_0|esk50_0=nil|~rearsegP(esk50_0,esk49_0)),inference(cn,[status(thm)],[670,theory(equality)])).
% cnf(1367,negated_conjecture,(esk49_0=nil|~rearsegP(esk49_0,esk50_0)),inference(csr,[status(thm)],[607,592])).
% cnf(1368,negated_conjecture,(esk49_0=nil),inference(csr,[status(thm)],[1367,594])).
% cnf(1373,negated_conjecture,(esk50_0=nil|esk50_0=nil|~rearsegP(esk50_0,esk49_0)),inference(rw,[status(thm)],[671,1368,theory(equality)])).
% cnf(1374,negated_conjecture,(esk50_0=nil|esk50_0=nil|~rearsegP(esk50_0,nil)),inference(rw,[status(thm)],[1373,1368,theory(equality)])).
% cnf(1375,negated_conjecture,(esk50_0=nil|~rearsegP(esk50_0,nil)),inference(cn,[status(thm)],[1374,theory(equality)])).
% cnf(1379,negated_conjecture,(neq(nil,nil)|esk50_0!=nil),inference(rw,[status(thm)],[590,1368,theory(equality)])).
% cnf(1400,negated_conjecture,(esk50_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[1375,124,theory(equality)])).
% cnf(1401,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[1400,587,theory(equality)])).
% cnf(1402,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1401,theory(equality)])).
% cnf(1410,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[1379,1402,theory(equality)])).
% cnf(1411,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[1410,theory(equality)])).
% cnf(1568,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[615,1411,theory(equality)])).
% cnf(1569,negated_conjecture,($false),inference(rw,[status(thm)],[1568,110,theory(equality)])).
% cnf(1570,negated_conjecture,($false),inference(cn,[status(thm)],[1569,theory(equality)])).
% cnf(1571,negated_conjecture,($false),1570,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 228
% # ...of these trivial : 3
% # ...subsumed : 3
% # ...remaining for further processing: 222
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 20
% # Generated clauses : 603
% # ...of the previous two non-trivial : 499
% # Contextual simplify-reflections : 4
% # Paramodulations : 512
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 195
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 170
% # Current number of unprocessed clauses: 445
% # ...number of literals in the above : 3182
% # Clause-clause subsumption calls (NU) : 890
% # Rec. Clause-clause subsumption calls : 178
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 232 leaves, 1.35+/-1.139 terms/leaf
% # Paramod-from index: 106 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 197 leaves, 1.24+/-0.983 terms/leaf
% # -------------------------------------------------
% # User time : 0.069 s
% # System time : 0.004 s
% # Total time : 0.073 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/SystemOnTPTP12254/SWC048+1.tptp
%
%------------------------------------------------------------------------------