TSTP Solution File: SWC003+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC003+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:25 EST 2010
% Result : Theorem 1.31s
% Output : Solution 1.31s
% 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/SystemOnTPTP10572/SWC003+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10572/SWC003+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10572/SWC003+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 10668
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, 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))|?[X11]:(((ssItem(X11)&~(X8=X11))&memberP(X4,X11))&geq(X11,X8)))))))&(~(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))|?[X11]:(((ssItem(X11)&~(X8=X11))&memberP(X4,X11))&geq(X11,X8)))))))&(~(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))|?[X11]:(((ssItem(X11)&~(X8=X11))&memberP(X4,X11))&geq(X11,X8)))))))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(124, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(125, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[125])).
% fof(127, 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)],[126])).
% cnf(128,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[127])).
% fof(130, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(131, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[131])).
% cnf(133,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(134,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(152, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(153, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[152])).
% fof(154, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[153])).
% cnf(155,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[154])).
% 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)&![X11]:(((~(ssItem(X11))|X8=X11)|~(memberP(X4,X11)))|~(geq(X11,X8))))))))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&((X13=X15&X12=X14)&(((neq(X13,nil)&![X16]:(~(ssList(X16))|![X17]:(~(ssList(X17))|![X18]:(((~(ssList(X18))|~(app(app(X16,X17),X18)=X13))|~(app(X16,X18)=X12))|~(neq(X17,nil))))))&?[X19]:(ssItem(X19)&?[X20]:(ssList(X20)&?[X21]:(ssList(X21)&((app(app(X20,cons(X19,nil)),X21)=X15&app(X20,X21)=X14)&![X22]:(((~(ssItem(X22))|X19=X22)|~(memberP(X15,X22)))|~(geq(X22,X19))))))))|(neq(X13,nil)&~(neq(X15,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)&![X16]:(~(ssList(X16))|![X17]:(~(ssList(X17))|![X18]:(((~(ssList(X18))|~(app(app(X16,X17),X18)=esk49_0))|~(app(X16,X18)=esk48_0))|~(neq(X17,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)&![X22]:(((~(ssItem(X22))|esk52_0=X22)|~(memberP(esk51_0,X22)))|~(geq(X22,esk52_0))))))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X16]:![X17]:![X18]:![X22]:((((((((((((((~(ssItem(X22))|esk52_0=X22)|~(memberP(esk51_0,X22)))|~(geq(X22,esk52_0)))&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0&app(esk53_0,esk54_0)=esk50_0))&ssList(esk54_0))&ssList(esk53_0))&ssItem(esk52_0))&((((((~(ssList(X18))|~(app(app(X16,X17),X18)=esk49_0))|~(app(X16,X18)=esk48_0))|~(neq(X17,nil)))|~(ssList(X17)))|~(ssList(X16)))&neq(esk49_0,nil)))|(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,![X16]:![X17]:![X18]:![X22]:((((((((((((neq(esk49_0,nil)|(((~(ssItem(X22))|esk52_0=X22)|~(memberP(esk51_0,X22)))|~(geq(X22,esk52_0))))&(~(neq(esk51_0,nil))|(((~(ssItem(X22))|esk52_0=X22)|~(memberP(esk51_0,X22)))|~(geq(X22,esk52_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))))&((neq(esk49_0,nil)|ssList(esk54_0))&(~(neq(esk51_0,nil))|ssList(esk54_0))))&((neq(esk49_0,nil)|ssList(esk53_0))&(~(neq(esk51_0,nil))|ssList(esk53_0))))&((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0))))&(((neq(esk49_0,nil)|(((((~(ssList(X18))|~(app(app(X16,X17),X18)=esk49_0))|~(app(X16,X18)=esk48_0))|~(neq(X17,nil)))|~(ssList(X17)))|~(ssList(X16))))&(~(neq(esk51_0,nil))|(((((~(ssList(X18))|~(app(app(X16,X17),X18)=esk49_0))|~(app(X16,X18)=esk48_0))|~(neq(X17,nil)))|~(ssList(X17)))|~(ssList(X16)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))))&(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(580,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,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(583,negated_conjecture,(ssItem(esk52_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,(ssList(esk54_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(app(esk53_0,esk54_0)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,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(598,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[580,578,theory(equality)])).
% cnf(599,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[583,598,theory(equality)])).
% cnf(600,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[599,theory(equality)])).
% cnf(601,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[585,598,theory(equality)])).
% cnf(602,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(603,negated_conjecture,(ssList(esk54_0)|$false),inference(rw,[status(thm)],[587,598,theory(equality)])).
% cnf(604,negated_conjecture,(ssList(esk54_0)),inference(cn,[status(thm)],[603,theory(equality)])).
% cnf(605,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[589,577,theory(equality)])).
% cnf(606,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0|$false),inference(rw,[status(thm)],[605,598,theory(equality)])).
% cnf(607,negated_conjecture,(app(esk53_0,esk54_0)=esk48_0),inference(cn,[status(thm)],[606,theory(equality)])).
% cnf(623,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0|$false),inference(rw,[status(thm)],[591,598,theory(equality)])).
% cnf(624,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0),inference(cn,[status(thm)],[623,theory(equality)])).
% cnf(811,negated_conjecture,(app(X1,X3)!=esk48_0|app(app(X1,X2),X3)!=esk51_0|~ssList(X3)|~ssList(X2)|~ssList(X1)|~neq(X2,nil)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(812,negated_conjecture,(app(X1,X3)!=esk48_0|app(app(X1,X2),X3)!=esk51_0|~ssList(X3)|~ssList(X2)|~ssList(X1)|~neq(X2,nil)|$false),inference(rw,[status(thm)],[811,598,theory(equality)])).
% cnf(813,negated_conjecture,(app(X1,X3)!=esk48_0|app(app(X1,X2),X3)!=esk51_0|~ssList(X3)|~ssList(X2)|~ssList(X1)|~neq(X2,nil)),inference(cn,[status(thm)],[812,theory(equality)])).
% cnf(814,negated_conjecture,(app(app(esk53_0,X1),esk54_0)!=esk51_0|~ssList(esk54_0)|~ssList(X1)|~ssList(esk53_0)|~neq(X1,nil)),inference(spm,[status(thm)],[813,607,theory(equality)])).
% cnf(819,negated_conjecture,(app(app(esk53_0,X1),esk54_0)!=esk51_0|$false|~ssList(X1)|~ssList(esk53_0)|~neq(X1,nil)),inference(rw,[status(thm)],[814,604,theory(equality)])).
% cnf(820,negated_conjecture,(app(app(esk53_0,X1),esk54_0)!=esk51_0|$false|~ssList(X1)|$false|~neq(X1,nil)),inference(rw,[status(thm)],[819,602,theory(equality)])).
% cnf(821,negated_conjecture,(app(app(esk53_0,X1),esk54_0)!=esk51_0|~ssList(X1)|~neq(X1,nil)),inference(cn,[status(thm)],[820,theory(equality)])).
% cnf(2048,negated_conjecture,(X1=nil|app(app(esk53_0,X1),esk54_0)!=esk51_0|~ssList(X1)|~ssList(nil)),inference(spm,[status(thm)],[821,128,theory(equality)])).
% cnf(2051,negated_conjecture,(X1=nil|app(app(esk53_0,X1),esk54_0)!=esk51_0|~ssList(X1)|$false),inference(rw,[status(thm)],[2048,134,theory(equality)])).
% cnf(2052,negated_conjecture,(X1=nil|app(app(esk53_0,X1),esk54_0)!=esk51_0|~ssList(X1)),inference(cn,[status(thm)],[2051,theory(equality)])).
% cnf(2162,negated_conjecture,(cons(esk52_0,nil)=nil|~ssList(cons(esk52_0,nil))),inference(spm,[status(thm)],[2052,624,theory(equality)])).
% cnf(2172,negated_conjecture,(cons(esk52_0,nil)=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2162,133,theory(equality)])).
% cnf(2173,negated_conjecture,(cons(esk52_0,nil)=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2172,134,theory(equality)])).
% cnf(2174,negated_conjecture,(cons(esk52_0,nil)=nil|$false|$false),inference(rw,[status(thm)],[2173,600,theory(equality)])).
% cnf(2175,negated_conjecture,(cons(esk52_0,nil)=nil),inference(cn,[status(thm)],[2174,theory(equality)])).
% cnf(2176,negated_conjecture,(~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[155,2175,theory(equality)])).
% cnf(2227,negated_conjecture,($false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2176,134,theory(equality)])).
% cnf(2228,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2227,600,theory(equality)])).
% cnf(2229,negated_conjecture,($false),inference(cn,[status(thm)],[2228,theory(equality)])).
% cnf(2230,negated_conjecture,($false),2229,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 277
% # ...of these trivial : 10
% # ...subsumed : 10
% # ...remaining for further processing: 257
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 20
% # Generated clauses : 841
% # ...of the previous two non-trivial : 692
% # Contextual simplify-reflections : 3
% # Paramodulations : 750
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 229
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 196
% # Current number of unprocessed clauses: 526
% # ...number of literals in the above : 3626
% # Clause-clause subsumption calls (NU) : 1062
% # Rec. Clause-clause subsumption calls : 353
% # 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: 267 leaves, 1.31+/-1.068 terms/leaf
% # Paramod-from index: 118 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 227 leaves, 1.21+/-0.918 terms/leaf
% # -------------------------------------------------
% # User time : 0.082 s
% # System time : 0.004 s
% # Total time : 0.086 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/SystemOnTPTP10572/SWC003+1.tptp
%
%------------------------------------------------------------------------------