TSTP Solution File: SWC032+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC032+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 : art03.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:47 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP14404/SWC032+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14404/SWC032+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14404/SWC032+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 14500
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(20, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2))))))),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))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2)))))))),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))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(187, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[20])).
% fof(188, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[187])).
% fof(189, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[188])).
% fof(190, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[189])).
% cnf(192,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[190])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&((app(X3,X5)=X4&strictorderedP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssItem(X8))|![X9]:((~(ssList(X9))|~(app(X9,cons(X8,nil))=X3))|~(lt(X8,X6)))))))))&(nil=X4|~(nil=X3)))&((nil=X2&~(nil=X1))|(nil=X1&~(nil=X2)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((X11=X13&X10=X12)&?[X14]:(ssList(X14)&((app(X12,X14)=X13&strictorderedP(X12))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=X14))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=X12))|~(lt(X17,X15)))))))))&(nil=X13|~(nil=X12)))&((nil=X11&~(nil=X10))|(nil=X10&~(nil=X11)))))))),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)&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(lt(X17,X15)))))))))&(nil=esk51_0|~(nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:![X18]:((((((((((((((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(lt(X17,X15)))|~(ssItem(X17)))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X15]:![X16]:![X17]:![X18]:((((((((((((((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(lt(X17,X15)))|~(ssItem(X17)))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=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)))))&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,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil=esk49_0|nil=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(nil=esk51_0|nil!=esk50_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,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(esk50_0!=nil|esk49_0!=nil),inference(rw,[status(thm)],[577,582,theory(equality)])).
% cnf(589,negated_conjecture,(esk50_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[588,583,theory(equality)])).
% cnf(590,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,582,theory(equality)])).
% cnf(594,negated_conjecture,(esk50_0!=nil),inference(csr,[status(thm)],[581,589])).
% cnf(595,negated_conjecture,(esk50_0=nil|esk49_0=nil),inference(rw,[status(thm)],[580,582,theory(equality)])).
% cnf(596,negated_conjecture,(esk50_0=nil|esk51_0=nil),inference(rw,[status(thm)],[595,583,theory(equality)])).
% cnf(597,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[596,594,theory(equality)])).
% cnf(602,negated_conjecture,(app(esk50_0,esk52_0)=nil),inference(rw,[status(thm)],[586,597,theory(equality)])).
% cnf(632,negated_conjecture,(nil=esk50_0|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[192,602,theory(equality)])).
% cnf(634,negated_conjecture,(nil=esk50_0|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[632,584,theory(equality)])).
% cnf(635,negated_conjecture,(nil=esk50_0|$false|$false),inference(rw,[status(thm)],[634,590,theory(equality)])).
% cnf(636,negated_conjecture,(nil=esk50_0),inference(cn,[status(thm)],[635,theory(equality)])).
% cnf(637,negated_conjecture,($false),inference(sr,[status(thm)],[636,594,theory(equality)])).
% cnf(638,negated_conjecture,($false),637,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 63
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 61
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 12
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 1
% # Paramodulations : 9
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 58
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 39
% # Current number of unprocessed clauses: 146
% # ...number of literals in the above : 612
% # Clause-clause subsumption calls (NU) : 34
% # Rec. Clause-clause subsumption calls : 32
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 64 leaves, 1.03+/-0.174 terms/leaf
% # Paramod-from index: 43 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 61 leaves, 1.02+/-0.127 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.003 s
% # Total time : 0.034 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP14404/SWC032+1.tptp
%
%------------------------------------------------------------------------------