%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC004+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 06:48: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/SystemOnTPTP10831/SWC004+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10831/SWC004+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10831/SWC004+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 10927
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% 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))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1)&neq(X6,nil)))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X4)|~(app(X9,X10)=X3))))))&(~(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]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1)&neq(X6,nil)))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X4)|~(app(X9,X10)=X3))))))&(~(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]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1)&neq(X6,nil)))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X4)|~(app(X9,X10)=X3))))))&(~(neq(X2,nil))|neq(X4,nil))))))))),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])).
% fof(121, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(122, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[122])).
% cnf(124,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[123])).
% 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)&![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|![X7]:(((~(ssList(X7))|~(app(app(X5,X6),X7)=X2))|~(app(X5,X7)=X1))|~(neq(X6,nil))))))&?[X8]:(ssItem(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&(app(app(X9,cons(X8,nil)),X10)=X4&app(X9,X10)=X3)))))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&((X12=X14&X11=X13)&(((neq(X12,nil)&![X15]:(~(ssList(X15))|![X16]:(~(ssList(X16))|![X17]:(((~(ssList(X17))|~(app(app(X15,X16),X17)=X12))|~(app(X15,X17)=X11))|~(neq(X16,nil))))))&?[X18]:(ssItem(X18)&?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&(app(app(X19,cons(X18,nil)),X20)=X14&app(X19,X20)=X13)))))|(neq(X12,nil)&~(neq(X14,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)&![X15]:(~(ssList(X15))|![X16]:(~(ssList(X16))|![X17]:(((~(ssList(X17))|~(app(app(X15,X16),X17)=esk49_0))|~(app(X15,X17)=esk48_0))|~(neq(X16,nil))))))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0&app(esk53_0,esk54_0)=esk50_0)))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:(((((((((((((~(ssList(X17))|~(app(app(X15,X16),X17)=esk49_0))|~(app(X15,X17)=esk48_0))|~(neq(X16,nil)))|~(ssList(X16)))|~(ssList(X15)))&neq(esk49_0,nil))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0&app(esk53_0,esk54_0)=esk50_0)))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_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]:(((((((((neq(esk49_0,nil)|(((((~(ssList(X17))|~(app(app(X15,X16),X17)=esk49_0))|~(app(X15,X17)=esk48_0))|~(neq(X16,nil)))|~(ssList(X16)))|~(ssList(X15))))&(~(neq(esk51_0,nil))|(((((~(ssList(X17))|~(app(app(X15,X16),X17)=esk49_0))|~(app(X15,X17)=esk48_0))|~(neq(X16,nil)))|~(ssList(X16)))|~(ssList(X15)))))&((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)|ssList(esk54_0))&(~(neq(esk51_0,nil))|ssList(esk54_0)))&(((neq(esk49_0,nil)|app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0)&(~(neq(esk51_0,nil))|app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0))&((neq(esk49_0,nil)|app(esk53_0,esk54_0)=esk50_0)&(~(neq(esk51_0,nil))|app(esk53_0,esk54_0)=esk50_0)))))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(app(esk53_0,esk54_0)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk54_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(590,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(~ssList(X1)|~ssList(X2)|~neq(X2,nil)|app(X1,X3)!=esk48_0|app(app(X1,X2),X3)!=esk49_0|~ssList(X3)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(595,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[587,578,theory(equality)]),590,theory(equality)])).
% cnf(596,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(597,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,578,theory(equality)]),590,theory(equality)])).
% cnf(598,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[597,theory(equality)])).
% cnf(599,negated_conjecture,(ssList(esk54_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),590,theory(equality)])).
% cnf(600,negated_conjecture,(ssList(esk54_0)),inference(cn,[status(thm)],[599,theory(equality)])).
% cnf(601,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,577,theory(equality)])).
% cnf(602,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[601,578,theory(equality)]),590,theory(equality)])).
% cnf(603,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0),inference(cn,[status(thm)],[602,theory(equality)])).
% cnf(619,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(620,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[619,578,theory(equality)]),590,theory(equality)])).
% cnf(621,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk49_0),inference(cn,[status(thm)],[620,theory(equality)])).
% cnf(806,negated_conjecture,(app(X1,X3)!=esk48_0|app(app(X1,X2),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssList(X1)|~neq(X2,nil)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[591,578,theory(equality)]),590,theory(equality)])).
% cnf(807,negated_conjecture,(app(X1,X3)!=esk48_0|app(app(X1,X2),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssList(X1)|~neq(X2,nil)),inference(cn,[status(thm)],[806,theory(equality)])).
% cnf(808,negated_conjecture,(app(app(esk53_0,X1),esk54_0)!=esk49_0|~ssList(esk54_0)|~ssList(X1)|~ssList(esk53_0)|~neq(X1,nil)),inference(spm,[status(thm)],[807,603,theory(equality)])).
% cnf(813,negated_conjecture,(app(app(esk53_0,X1),esk54_0)!=esk49_0|$false|~ssList(X1)|~ssList(esk53_0)|~neq(X1,nil)),inference(rw,[status(thm)],[808,600,theory(equality)])).
% cnf(814,negated_conjecture,(app(app(esk53_0,X1),esk54_0)!=esk49_0|$false|~ssList(X1)|$false|~neq(X1,nil)),inference(rw,[status(thm)],[813,598,theory(equality)])).
% cnf(815,negated_conjecture,(app(app(esk53_0,X1),esk54_0)!=esk49_0|~ssList(X1)|~neq(X1,nil)),inference(cn,[status(thm)],[814,theory(equality)])).
% cnf(2041,negated_conjecture,(X1=nil|app(app(esk53_0,X1),esk54_0)!=esk49_0|~ssList(X1)|~ssList(nil)),inference(spm,[status(thm)],[815,119,theory(equality)])).
% cnf(2044,negated_conjecture,(X1=nil|app(app(esk53_0,X1),esk54_0)!=esk49_0|~ssList(X1)|$false),inference(rw,[status(thm)],[2041,125,theory(equality)])).
% cnf(2045,negated_conjecture,(X1=nil|app(app(esk53_0,X1),esk54_0)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[2044,theory(equality)])).
% cnf(2155,negated_conjecture,(cons(esk52_0,nil)=nil|~ssList(cons(esk52_0,nil))),inference(spm,[status(thm)],[2045,621,theory(equality)])).
% cnf(2161,negated_conjecture,(cons(esk52_0,nil)=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2155,124,theory(equality)])).
% cnf(2162,negated_conjecture,(cons(esk52_0,nil)=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2161,125,theory(equality)])).
% cnf(2163,negated_conjecture,(cons(esk52_0,nil)=nil|$false|$false),inference(rw,[status(thm)],[2162,596,theory(equality)])).
% cnf(2164,negated_conjecture,(cons(esk52_0,nil)=nil),inference(cn,[status(thm)],[2163,theory(equality)])).
% cnf(2165,negated_conjecture,(~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[146,2164,theory(equality)])).
% cnf(2215,negated_conjecture,($false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2165,125,theory(equality)])).
% cnf(2216,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2215,596,theory(equality)])).
% cnf(2217,negated_conjecture,($false),inference(cn,[status(thm)],[2216,theory(equality)])).
% cnf(2218,negated_conjecture,($false),2217,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 274
% # ...of these trivial : 9
% # ...subsumed : 10
% # ...remaining for further processing: 255
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 20
% # Generated clauses : 838
% # ...of the previous two non-trivial : 691
% # Contextual simplify-reflections : 3
% # Paramodulations : 747
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 227
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 194
% # Current number of unprocessed clauses: 526
% # ...number of literals in the above : 3627
% # Clause-clause subsumption calls (NU) : 1057
% # Rec. Clause-clause subsumption calls : 350
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 263 leaves, 1.31+/-1.076 terms/leaf
% # Paramod-from index: 118 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 225 leaves, 1.21+/-0.922 terms/leaf
% # -------------------------------------------------
% # User time : 0.081 s
% # System time : 0.004 s
% # Total time : 0.085 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP10831/SWC004+1.tptp
%
%------------------------------------------------------------------------------