TSTP Solution File: SWC207+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC207+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:27:28 EST 2010
% Result : Theorem 1.50s
% Output : Solution 1.50s
% 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/SystemOnTPTP7579/SWC207+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7579/SWC207+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7579/SWC207+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 7711
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|neq(X1,nil))|(![X5]:(ssItem(X5)=>((~(cons(X5,nil)=X3)|~(memberP(X4,X5)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,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))|~(neq(X2,nil)))|neq(X1,nil))|(![X5]:(ssItem(X5)=>((~(cons(X5,nil)=X3)|~(memberP(X4,X5)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,X6))))&(~(nil=X4)|~(nil=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))|~(neq(X2,nil)))|neq(X1,nil))|(![X5]:(ssItem(X5)=>((~(cons(X5,nil)=X3)|~(memberP(X4,X5)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,X6))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, 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)],[117])).
% cnf(119,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[118])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(143, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(144, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[144])).
% cnf(146,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[145])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&neq(X2,nil))&~(neq(X1,nil)))&(?[X5]:(ssItem(X5)&((cons(X5,nil)=X3&memberP(X4,X5))&![X6]:(((~(ssItem(X6))|X5=X6)|~(memberP(X4,X6)))|~(leq(X5,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)&neq(X8,nil))&~(neq(X7,nil)))&(?[X11]:(ssItem(X11)&((cons(X11,nil)=X9&memberP(X10,X11))&![X12]:(((~(ssItem(X12))|X11=X12)|~(memberP(X10,X12)))|~(leq(X11,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)&neq(esk49_0,nil))&~(neq(esk48_0,nil)))&((ssItem(esk52_0)&((cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0))&![X12]:(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12)))))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:(((((((((((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12)))&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0)))&ssItem(esk52_0))|(nil=esk51_0&nil=esk50_0))&(((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil))&~(neq(esk48_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=esk51_0|(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12))))&(nil=esk50_0|(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12)))))&(((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0))&((nil=esk51_0|memberP(esk51_0,esk52_0))&(nil=esk50_0|memberP(esk51_0,esk52_0)))))&((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0))))&(((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil))&~(neq(esk48_0,nil))))&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(577,negated_conjecture,(~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(ssItem(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(~neq(esk50_0,nil)),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(590,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(594,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[578,580,theory(equality)])).
% cnf(704,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[589,119,theory(equality)])).
% cnf(705,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[704,125,theory(equality)])).
% cnf(706,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[705,590,theory(equality)])).
% cnf(707,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[706,theory(equality)])).
% cnf(1526,negated_conjecture,(~neq(nil,nil)),inference(rw,[status(thm)],[589,707,theory(equality)])).
% cnf(1528,negated_conjecture,(cons(esk52_0,nil)=nil|esk51_0=nil),inference(rw,[status(thm)],[586,707,theory(equality)])).
% cnf(1534,negated_conjecture,(esk51_0=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[146,1528,theory(equality)])).
% cnf(1570,negated_conjecture,(esk51_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1534,125,theory(equality)])).
% cnf(1571,negated_conjecture,(esk51_0=nil|~ssItem(esk52_0)),inference(cn,[status(thm)],[1570,theory(equality)])).
% cnf(1644,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[1571,582])).
% cnf(1650,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[594,1644,theory(equality)])).
% cnf(1651,negated_conjecture,($false),inference(sr,[status(thm)],[1650,1526,theory(equality)])).
% cnf(1652,negated_conjecture,($false),1651,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 210
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 207
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 15
% # Generated clauses : 665
% # ...of the previous two non-trivial : 553
% # Contextual simplify-reflections : 3
% # Paramodulations : 574
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 186
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 440
% # ...number of literals in the above : 3158
% # Clause-clause subsumption calls (NU) : 866
% # Rec. Clause-clause subsumption calls : 161
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 222 leaves, 1.36+/-1.161 terms/leaf
% # Paramod-from index: 97 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 187 leaves, 1.25+/-1.004 terms/leaf
% # -------------------------------------------------
% # User time : 0.063 s
% # System time : 0.008 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.26 WC
% FINAL PrfWatch: 0.20 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP7579/SWC207+1.tptp
%
%------------------------------------------------------------------------------