TSTP Solution File: SWC016+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC016+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:50:34 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP14333/SWC016+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14333/SWC016+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14333/SWC016+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 14429
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|(~(nil=X3)&nil=X4))|(![X5]:(ssList(X5)=>((~(neq(X5,nil))|~(frontsegP(X4,X5)))|~(frontsegP(X3,X5))))&neq(X4,nil)))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:(((ssList(X6)&neq(X6,nil))&frontsegP(X2,X6))&frontsegP(X1,X6))))))))),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=X3)&nil=X4))|(![X5]:(ssList(X5)=>((~(neq(X5,nil))|~(frontsegP(X4,X5)))|~(frontsegP(X3,X5))))&neq(X4,nil)))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:(((ssList(X6)&neq(X6,nil))&frontsegP(X2,X6))&frontsegP(X1,X6)))))))))),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=X3)&nil=X4))|(![X5]:(ssList(X5)=>((~(neq(X5,nil))|~(frontsegP(X4,X5)))|~(frontsegP(X3,X5))))&neq(X4,nil)))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:(((ssList(X6)&neq(X6,nil))&frontsegP(X2,X6))&frontsegP(X1,X6)))))))))),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(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&(nil=X3|~(nil=X4)))&(?[X5]:(ssList(X5)&((neq(X5,nil)&frontsegP(X4,X5))&frontsegP(X3,X5)))|~(neq(X4,nil))))&((nil=X2&~(nil=X1))|(neq(X2,nil)&![X6]:(((~(ssList(X6))|~(neq(X6,nil)))|~(frontsegP(X2,X6)))|~(frontsegP(X1,X6)))))))))),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)&(nil=X9|~(nil=X10)))&(?[X11]:(ssList(X11)&((neq(X11,nil)&frontsegP(X10,X11))&frontsegP(X9,X11)))|~(neq(X10,nil))))&((nil=X8&~(nil=X7))|(neq(X8,nil)&![X12]:(((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(X8,X12)))|~(frontsegP(X7,X12)))))))))),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=esk50_0|~(nil=esk51_0)))&((ssList(esk52_0)&((neq(esk52_0,nil)&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_0)))|~(neq(esk51_0,nil))))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&![X12]:(((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(esk49_0,X12)))|~(frontsegP(esk48_0,X12)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:((((((((((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(esk49_0,X12)))|~(frontsegP(esk48_0,X12)))&neq(esk49_0,nil))|(nil=esk49_0&~(nil=esk48_0)))&(((esk49_0=esk51_0&esk48_0=esk50_0)&(nil=esk50_0|~(nil=esk51_0)))&((ssList(esk52_0)&((neq(esk52_0,nil)&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_0)))|~(neq(esk51_0,nil)))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X12]:((((((((nil=esk49_0|(((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(esk49_0,X12)))|~(frontsegP(esk48_0,X12))))&(~(nil=esk48_0)|(((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(esk49_0,X12)))|~(frontsegP(esk48_0,X12)))))&((nil=esk49_0|neq(esk49_0,nil))&(~(nil=esk48_0)|neq(esk49_0,nil))))&(((esk49_0=esk51_0&esk48_0=esk50_0)&(nil=esk50_0|~(nil=esk51_0)))&((ssList(esk52_0)|~(neq(esk51_0,nil)))&(((neq(esk52_0,nil)|~(neq(esk51_0,nil)))&(frontsegP(esk51_0,esk52_0)|~(neq(esk51_0,nil))))&(frontsegP(esk50_0,esk52_0)|~(neq(esk51_0,nil)))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(frontsegP(esk50_0,esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(frontsegP(esk51_0,esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(neq(esk52_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(ssList(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(neq(esk49_0,nil)|nil=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(nil=esk49_0|~frontsegP(esk48_0,X1)|~frontsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(esk48_0=nil|esk51_0!=nil),inference(rw,[status(thm)],[581,582,theory(equality)])).
% cnf(592,negated_conjecture,(neq(esk51_0,nil)|esk48_0!=nil),inference(rw,[status(thm)],[584,583,theory(equality)])).
% cnf(593,negated_conjecture,(esk51_0=nil|neq(esk49_0,nil)),inference(rw,[status(thm)],[585,583,theory(equality)])).
% cnf(594,negated_conjecture,(esk51_0=nil|neq(esk51_0,nil)),inference(rw,[status(thm)],[593,583,theory(equality)])).
% cnf(595,negated_conjecture,(ssList(esk52_0)|esk51_0=nil),inference(spm,[status(thm)],[580,594,theory(equality)])).
% cnf(596,negated_conjecture,(neq(esk52_0,nil)|esk51_0=nil),inference(spm,[status(thm)],[579,594,theory(equality)])).
% cnf(597,negated_conjecture,(frontsegP(esk48_0,esk52_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[577,582,theory(equality)])).
% cnf(598,negated_conjecture,(frontsegP(esk48_0,esk52_0)|esk51_0=nil),inference(spm,[status(thm)],[597,594,theory(equality)])).
% cnf(599,negated_conjecture,(frontsegP(esk51_0,esk52_0)|esk51_0=nil),inference(spm,[status(thm)],[578,594,theory(equality)])).
% cnf(604,negated_conjecture,(esk51_0=nil|~ssList(X1)|~neq(X1,nil)|~frontsegP(esk48_0,X1)|~frontsegP(esk49_0,X1)),inference(rw,[status(thm)],[587,583,theory(equality)])).
% cnf(605,negated_conjecture,(esk51_0=nil|~ssList(X1)|~neq(X1,nil)|~frontsegP(esk48_0,X1)|~frontsegP(esk51_0,X1)),inference(rw,[status(thm)],[604,583,theory(equality)])).
% cnf(620,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(1354,negated_conjecture,(esk51_0=nil|~frontsegP(esk51_0,esk52_0)|~neq(esk52_0,nil)|~ssList(esk52_0)),inference(spm,[status(thm)],[605,598,theory(equality)])).
% cnf(1385,negated_conjecture,(esk51_0=nil|~frontsegP(esk51_0,esk52_0)|~neq(esk52_0,nil)),inference(csr,[status(thm)],[1354,595])).
% cnf(1386,negated_conjecture,(esk51_0=nil|~frontsegP(esk51_0,esk52_0)),inference(csr,[status(thm)],[1385,596])).
% cnf(1387,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[1386,599])).
% cnf(1407,negated_conjecture,(neq(nil,nil)|esk48_0!=nil),inference(rw,[status(thm)],[592,1387,theory(equality)])).
% cnf(1412,negated_conjecture,(esk48_0=nil|$false),inference(rw,[status(thm)],[591,1387,theory(equality)])).
% cnf(1413,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[1412,theory(equality)])).
% cnf(1429,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[1407,1413,theory(equality)])).
% cnf(1430,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[1429,theory(equality)])).
% cnf(1620,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[620,1430,theory(equality)])).
% cnf(1621,negated_conjecture,($false),inference(rw,[status(thm)],[1620,110,theory(equality)])).
% cnf(1622,negated_conjecture,($false),inference(cn,[status(thm)],[1621,theory(equality)])).
% cnf(1623,negated_conjecture,($false),1622,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 242
% # ...of these trivial : 4
% # ...subsumed : 7
% # ...remaining for further processing: 231
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 28
% # Generated clauses : 621
% # ...of the previous two non-trivial : 521
% # Contextual simplify-reflections : 7
% # Paramodulations : 530
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 196
% # Positive orientable unit clauses: 24
% # 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) : 928
% # Rec. Clause-clause subsumption calls : 205
% # Unit Clause-clause subsumption calls : 26
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 233 leaves, 1.36+/-1.207 terms/leaf
% # Paramod-from index: 107 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 198 leaves, 1.25+/-1.076 terms/leaf
% # -------------------------------------------------
% # User time : 0.069 s
% # System time : 0.007 s
% # Total time : 0.076 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/SystemOnTPTP14333/SWC016+1.tptp
%
%------------------------------------------------------------------------------