TSTP Solution File: SWC028+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC028+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:52:18 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/SystemOnTPTP16146/SWC028+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16146/SWC028+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16146/SWC028+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 16242
% 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(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)&(~(nil=X1)|nil=X2)))|((~(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)&(~(nil=X1)|nil=X2)))|((~(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)&(~(nil=X1)|nil=X2)))|((~(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(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))|(nil=X1&~(nil=X2))))&((nil=X4&nil=X3)|(neq(X3,nil)&rearsegP(X4,X3)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&(((X6=X8&X5=X7)&((nil=X6&~(nil=X5))|(nil=X5&~(nil=X6))))&((nil=X8&nil=X7)|(neq(X7,nil)&rearsegP(X8,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)&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_0))))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&rearsegP(esk51_0,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)&(((nil=esk48_0|nil=esk49_0)&(~(nil=esk49_0)|nil=esk49_0))&((nil=esk48_0|~(nil=esk48_0))&(~(nil=esk49_0)|~(nil=esk48_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)))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(nil=esk50_0|rearsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(nil=esk51_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(nil=esk49_0|nil=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(esk50_0!=nil|esk49_0!=nil),inference(rw,[status(thm)],[576,580,theory(equality)])).
% cnf(587,negated_conjecture,(esk50_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[586,581,theory(equality)])).
% cnf(588,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[585,580,theory(equality)])).
% cnf(589,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[584,581,theory(equality)])).
% cnf(592,negated_conjecture,(esk50_0=nil|esk49_0=nil),inference(rw,[status(thm)],[579,580,theory(equality)])).
% cnf(593,negated_conjecture,(esk50_0=nil|esk51_0=nil),inference(rw,[status(thm)],[592,581,theory(equality)])).
% cnf(607,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(658,negated_conjecture,(esk50_0=esk51_0|esk50_0=nil|~rearsegP(esk50_0,esk51_0)|~ssList(esk51_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[118,572,theory(equality)])).
% cnf(661,negated_conjecture,(esk50_0=esk51_0|esk50_0=nil|~rearsegP(esk50_0,esk51_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[658,589,theory(equality)])).
% cnf(662,negated_conjecture,(esk50_0=esk51_0|esk50_0=nil|~rearsegP(esk50_0,esk51_0)|$false|$false),inference(rw,[status(thm)],[661,588,theory(equality)])).
% cnf(663,negated_conjecture,(esk50_0=esk51_0|esk50_0=nil|~rearsegP(esk50_0,esk51_0)),inference(cn,[status(thm)],[662,theory(equality)])).
% cnf(1356,negated_conjecture,(esk50_0=nil|~rearsegP(esk50_0,nil)),inference(spm,[status(thm)],[663,593,theory(equality)])).
% cnf(1357,negated_conjecture,(esk50_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[1356,124,theory(equality)])).
% cnf(1358,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[1357,588,theory(equality)])).
% cnf(1359,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1358,theory(equality)])).
% cnf(1367,negated_conjecture,(esk51_0=nil|neq(nil,nil)),inference(rw,[status(thm)],[575,1359,theory(equality)])).
% cnf(1373,negated_conjecture,($false|esk51_0!=nil),inference(rw,[status(thm)],[587,1359,theory(equality)])).
% cnf(1374,negated_conjecture,(esk51_0!=nil),inference(cn,[status(thm)],[1373,theory(equality)])).
% cnf(1411,negated_conjecture,(neq(nil,nil)),inference(sr,[status(thm)],[1367,1374,theory(equality)])).
% cnf(1674,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[607,1411,theory(equality)])).
% cnf(1675,negated_conjecture,($false),inference(rw,[status(thm)],[1674,110,theory(equality)])).
% cnf(1676,negated_conjecture,($false),inference(cn,[status(thm)],[1675,theory(equality)])).
% cnf(1677,negated_conjecture,($false),1676,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 227
% # ...of these trivial : 2
% # ...subsumed : 3
% # ...remaining for further processing: 222
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 16
% # Generated clauses : 634
% # ...of the previous two non-trivial : 524
% # Contextual simplify-reflections : 2
% # Paramodulations : 543
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 200
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 170
% # Current number of unprocessed clauses: 455
% # ...number of literals in the above : 3207
% # Clause-clause subsumption calls (NU) : 865
% # Rec. Clause-clause subsumption calls : 169
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 237 leaves, 1.34+/-1.128 terms/leaf
% # Paramod-from index: 109 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 202 leaves, 1.24+/-0.971 terms/leaf
% # -------------------------------------------------
% # User time : 0.068 s
% # System time : 0.007 s
% # Total time : 0.075 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/SystemOnTPTP16146/SWC028+1.tptp
%
%------------------------------------------------------------------------------