TSTP Solution File: SWC096+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC096+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 : art04.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 07:03:13 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/SystemOnTPTP21969/SWC096+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21969/SWC096+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21969/SWC096+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 22065
% 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(((~(ssList(X4))|~(X2=X4))|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:((ssList(X6)&cons(X5,nil)=X1)&app(X6,cons(X5,nil))=X2)))|![X7]:(ssItem(X7)=>![X8]:((~(ssList(X8))|~(cons(X7,nil)=X3))|~(app(X8,cons(X7,nil))=X4))))&(~(neq(X2,nil))|neq(X4,nil))))))),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))|?[X5]:(ssItem(X5)&?[X6]:((ssList(X6)&cons(X5,nil)=X1)&app(X6,cons(X5,nil))=X2)))|![X7]:(ssItem(X7)=>![X8]:((~(ssList(X8))|~(cons(X7,nil)=X3))|~(app(X8,cons(X7,nil))=X4))))&(~(neq(X2,nil))|neq(X4,nil)))))))),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))|?[X5]:(ssItem(X5)&?[X6]:((ssList(X6)&cons(X5,nil)=X1)&app(X6,cons(X5,nil))=X2)))|![X7]:(ssItem(X7)=>![X8]:((~(ssList(X8))|~(cons(X7,nil)=X3))|~(app(X8,cons(X7,nil))=X4))))&(~(neq(X2,nil))|neq(X4,nil)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(((ssList(X4)&X2=X4)&X1=X3)&(((neq(X2,nil)&![X5]:(~(ssItem(X5))|![X6]:((~(ssList(X6))|~(cons(X5,nil)=X1))|~(app(X6,cons(X5,nil))=X2))))&?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&cons(X7,nil)=X3)&app(X8,cons(X7,nil))=X4)))|(neq(X2,nil)&~(neq(X4,nil)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(((ssList(X12)&X10=X12)&X9=X11)&(((neq(X10,nil)&![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(cons(X13,nil)=X9))|~(app(X14,cons(X13,nil))=X10))))&?[X15]:(ssItem(X15)&?[X16]:((ssList(X16)&cons(X15,nil)=X11)&app(X16,cons(X15,nil))=X12)))|(neq(X10,nil)&~(neq(X12,nil)))))))),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)&![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(cons(X13,nil)=esk48_0))|~(app(X14,cons(X13,nil))=esk49_0))))&(ssItem(esk52_0)&((ssList(esk53_0)&cons(esk52_0,nil)=esk50_0)&app(esk53_0,cons(esk52_0,nil))=esk51_0)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:((((((((((~(ssList(X14))|~(cons(X13,nil)=esk48_0))|~(app(X14,cons(X13,nil))=esk49_0))|~(ssItem(X13)))&neq(esk49_0,nil))&(ssItem(esk52_0)&((ssList(esk53_0)&cons(esk52_0,nil)=esk50_0)&app(esk53_0,cons(esk52_0,nil))=esk51_0)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X13]:![X14]:((((((((neq(esk49_0,nil)|(((~(ssList(X14))|~(cons(X13,nil)=esk48_0))|~(app(X14,cons(X13,nil))=esk49_0))|~(ssItem(X13))))&(~(neq(esk51_0,nil))|(((~(ssList(X14))|~(cons(X13,nil)=esk48_0))|~(app(X14,cons(X13,nil))=esk49_0))|~(ssItem(X13)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&(((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0)))&((((neq(esk49_0,nil)|ssList(esk53_0))&(~(neq(esk51_0,nil))|ssList(esk53_0)))&((neq(esk49_0,nil)|cons(esk52_0,nil)=esk50_0)&(~(neq(esk51_0,nil))|cons(esk52_0,nil)=esk50_0)))&((neq(esk49_0,nil)|app(esk53_0,cons(esk52_0,nil))=esk51_0)&(~(neq(esk51_0,nil))|app(esk53_0,cons(esk52_0,nil))=esk51_0)))))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(cons(esk52_0,nil)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(~ssItem(X1)|app(X2,cons(X1,nil))!=esk49_0|cons(X1,nil)!=esk48_0|~ssList(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,577,theory(equality)]),588,theory(equality)])).
% cnf(594,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(595,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,577,theory(equality)]),588,theory(equality)])).
% cnf(596,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(597,negated_conjecture,(cons(esk52_0,nil)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,576,theory(equality)])).
% cnf(598,negated_conjecture,(cons(esk52_0,nil)=esk48_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[597,577,theory(equality)]),588,theory(equality)])).
% cnf(599,negated_conjecture,(cons(esk52_0,nil)=esk48_0),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(612,negated_conjecture,(app(esk53_0,esk48_0)=esk51_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,599,theory(equality)])).
% cnf(613,negated_conjecture,(app(esk53_0,esk48_0)=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[612,577,theory(equality)])).
% cnf(614,negated_conjecture,(app(esk53_0,esk48_0)=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[613,577,theory(equality)]),588,theory(equality)])).
% cnf(615,negated_conjecture,(app(esk53_0,esk48_0)=esk49_0),inference(cn,[status(thm)],[614,theory(equality)])).
% cnf(689,negated_conjecture,(cons(X1,nil)!=esk48_0|app(X2,cons(X1,nil))!=esk49_0|~ssItem(X1)|~ssList(X2)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[589,577,theory(equality)]),588,theory(equality)])).
% cnf(690,negated_conjecture,(cons(X1,nil)!=esk48_0|app(X2,cons(X1,nil))!=esk49_0|~ssItem(X1)|~ssList(X2)),inference(cn,[status(thm)],[689,theory(equality)])).
% cnf(691,negated_conjecture,(app(X1,esk48_0)!=esk49_0|~ssList(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[690,599,theory(equality)])).
% cnf(692,negated_conjecture,(app(X1,esk48_0)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[691,594,theory(equality)])).
% cnf(693,negated_conjecture,(app(X1,esk48_0)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[692,theory(equality)])).
% cnf(1737,negated_conjecture,(~ssList(esk53_0)),inference(spm,[status(thm)],[693,615,theory(equality)])).
% cnf(1742,negated_conjecture,($false),inference(rw,[status(thm)],[1737,596,theory(equality)])).
% cnf(1743,negated_conjecture,($false),inference(cn,[status(thm)],[1742,theory(equality)])).
% cnf(1744,negated_conjecture,($false),1743,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 233
% # ...of these trivial : 8
% # ...subsumed : 4
% # ...remaining for further processing: 221
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 653
% # ...of the previous two non-trivial : 534
% # Contextual simplify-reflections : 2
% # Paramodulations : 562
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 211
% # Positive orientable unit clauses: 36
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 171
% # Current number of unprocessed clauses: 487
% # ...number of literals in the above : 3365
% # Clause-clause subsumption calls (NU) : 833
% # Rec. Clause-clause subsumption calls : 148
% # Unit Clause-clause subsumption calls : 43
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 251 leaves, 1.32+/-1.098 terms/leaf
% # Paramod-from index: 119 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 215 leaves, 1.21+/-0.940 terms/leaf
% # -------------------------------------------------
% # User time : 0.066 s
% # System time : 0.008 s
% # Total time : 0.074 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.27 WC
% FINAL PrfWatch: 0.20 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP21969/SWC096+1.tptp
%
%------------------------------------------------------------------------------