TSTP Solution File: SWC279+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC279+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:38:09 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/SystemOnTPTP13327/SWC279+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13327/SWC279+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13327/SWC279+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 13423
% 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))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X3)&?[X8]:(ssItem(X8)&((~(leq(X5,X8))&memberP(X7,X8))|(~(leq(X8,X5))&memberP(X6,X8))))))))|![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:(ssList(X11)=>(~(app(app(X10,cons(X9,nil)),X11)=X1)|![X12]:(ssItem(X12)=>((~(memberP(X10,X12))|leq(X12,X9))&(~(memberP(X11,X12))|leq(X9,X12))))))))))))),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]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X3)&?[X8]:(ssItem(X8)&((~(leq(X5,X8))&memberP(X7,X8))|(~(leq(X8,X5))&memberP(X6,X8))))))))|![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:(ssList(X11)=>(~(app(app(X10,cons(X9,nil)),X11)=X1)|![X12]:(ssItem(X12)=>((~(memberP(X10,X12))|leq(X12,X9))&(~(memberP(X11,X12))|leq(X9,X12)))))))))))))),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]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X3)&?[X8]:(ssItem(X8)&((~(leq(X5,X8))&memberP(X7,X8))|(~(leq(X8,X5))&memberP(X6,X8))))))))|![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:(ssList(X11)=>(~(app(app(X10,cons(X9,nil)),X11)=X1)|![X12]:(ssItem(X12)=>((~(memberP(X10,X12))|leq(X12,X9))&(~(memberP(X11,X12))|leq(X9,X12)))))))))))))),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)&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X3))|![X8]:(~(ssItem(X8))|((leq(X5,X8)|~(memberP(X7,X8)))&(leq(X8,X5)|~(memberP(X6,X8)))))))))&?[X9]:(ssItem(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&(app(app(X10,cons(X9,nil)),X11)=X1&?[X12]:(ssItem(X12)&((memberP(X10,X12)&~(leq(X12,X9)))|(memberP(X11,X12)&~(leq(X9,X12)))))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&(((X14=X16&X13=X15)&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=X15))|![X20]:(~(ssItem(X20))|((leq(X17,X20)|~(memberP(X19,X20)))&(leq(X20,X17)|~(memberP(X18,X20)))))))))&?[X21]:(ssItem(X21)&?[X22]:(ssList(X22)&?[X23]:(ssList(X23)&(app(app(X22,cons(X21,nil)),X23)=X13&?[X24]:(ssItem(X24)&((memberP(X22,X24)&~(leq(X24,X21)))|(memberP(X23,X24)&~(leq(X21,X24)))))))))))))),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)&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk50_0))|![X20]:(~(ssItem(X20))|((leq(X17,X20)|~(memberP(X19,X20)))&(leq(X20,X17)|~(memberP(X18,X20)))))))))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0&(ssItem(esk55_0)&((memberP(esk53_0,esk55_0)&~(leq(esk55_0,esk52_0)))|(memberP(esk54_0,esk55_0)&~(leq(esk52_0,esk55_0)))))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:![X19]:![X20]:((((((((((~(ssItem(X20))|((leq(X17,X20)|~(memberP(X19,X20)))&(leq(X20,X17)|~(memberP(X18,X20)))))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk50_0)))|~(ssList(X18)))|~(ssItem(X17)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0&(ssItem(esk55_0)&((memberP(esk53_0,esk55_0)&~(leq(esk55_0,esk52_0)))|(memberP(esk54_0,esk55_0)&~(leq(esk52_0,esk55_0))))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X17]:![X18]:![X19]:![X20]:((((((((((((leq(X17,X20)|~(memberP(X19,X20)))|~(ssItem(X20)))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk50_0)))|~(ssList(X18)))|~(ssItem(X17)))&(((((leq(X20,X17)|~(memberP(X18,X20)))|~(ssItem(X20)))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk50_0)))|~(ssList(X18)))|~(ssItem(X17))))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0&(ssItem(esk55_0)&(((memberP(esk54_0,esk55_0)|memberP(esk53_0,esk55_0))&(~(leq(esk52_0,esk55_0))|memberP(esk53_0,esk55_0)))&((memberP(esk54_0,esk55_0)|~(leq(esk55_0,esk52_0)))&(~(leq(esk52_0,esk55_0))|~(leq(esk55_0,esk52_0)))))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(~leq(esk55_0,esk52_0)|~leq(esk52_0,esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(memberP(esk54_0,esk55_0)|~leq(esk55_0,esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(memberP(esk53_0,esk55_0)|~leq(esk52_0,esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(memberP(esk53_0,esk55_0)|memberP(esk54_0,esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(leq(X4,X1)|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk50_0|~ssList(X3)|~ssItem(X4)|~memberP(X2,X4)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(leq(X1,X4)|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk50_0|~ssList(X3)|~ssItem(X4)|~memberP(X3,X4)),inference(split_conjunct,[status(thm)],[572])).
% cnf(594,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk50_0),inference(rw,[status(thm)],[582,586,theory(equality)])).
% cnf(998,negated_conjecture,(leq(X1,esk52_0)|~memberP(esk53_0,X1)|~ssList(esk54_0)|~ssList(esk53_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[588,594,theory(equality)])).
% cnf(1004,negated_conjecture,(leq(X1,esk52_0)|~memberP(esk53_0,X1)|$false|~ssList(esk53_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[998,583,theory(equality)])).
% cnf(1005,negated_conjecture,(leq(X1,esk52_0)|~memberP(esk53_0,X1)|$false|$false|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1004,584,theory(equality)])).
% cnf(1006,negated_conjecture,(leq(X1,esk52_0)|~memberP(esk53_0,X1)|$false|$false|~ssItem(X1)|$false),inference(rw,[status(thm)],[1005,585,theory(equality)])).
% cnf(1007,negated_conjecture,(leq(X1,esk52_0)|~memberP(esk53_0,X1)|~ssItem(X1)),inference(cn,[status(thm)],[1006,theory(equality)])).
% cnf(1014,negated_conjecture,(leq(esk52_0,X1)|~memberP(esk54_0,X1)|~ssList(esk54_0)|~ssList(esk53_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[589,594,theory(equality)])).
% cnf(1020,negated_conjecture,(leq(esk52_0,X1)|~memberP(esk54_0,X1)|$false|~ssList(esk53_0)|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1014,583,theory(equality)])).
% cnf(1021,negated_conjecture,(leq(esk52_0,X1)|~memberP(esk54_0,X1)|$false|$false|~ssItem(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1020,584,theory(equality)])).
% cnf(1022,negated_conjecture,(leq(esk52_0,X1)|~memberP(esk54_0,X1)|$false|$false|~ssItem(X1)|$false),inference(rw,[status(thm)],[1021,585,theory(equality)])).
% cnf(1023,negated_conjecture,(leq(esk52_0,X1)|~memberP(esk54_0,X1)|~ssItem(X1)),inference(cn,[status(thm)],[1022,theory(equality)])).
% cnf(2032,negated_conjecture,(leq(esk52_0,esk55_0)|memberP(esk53_0,esk55_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[1023,580,theory(equality)])).
% cnf(2033,negated_conjecture,(leq(esk52_0,esk55_0)|memberP(esk53_0,esk55_0)|$false),inference(rw,[status(thm)],[2032,581,theory(equality)])).
% cnf(2034,negated_conjecture,(leq(esk52_0,esk55_0)|memberP(esk53_0,esk55_0)),inference(cn,[status(thm)],[2033,theory(equality)])).
% cnf(2035,negated_conjecture,(memberP(esk53_0,esk55_0)),inference(csr,[status(thm)],[2034,579])).
% cnf(2042,negated_conjecture,(leq(esk55_0,esk52_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[1007,2035,theory(equality)])).
% cnf(2066,negated_conjecture,(leq(esk55_0,esk52_0)|$false),inference(rw,[status(thm)],[2042,581,theory(equality)])).
% cnf(2067,negated_conjecture,(leq(esk55_0,esk52_0)),inference(cn,[status(thm)],[2066,theory(equality)])).
% cnf(2073,negated_conjecture,(~leq(esk52_0,esk55_0)|$false),inference(rw,[status(thm)],[577,2067,theory(equality)])).
% cnf(2074,negated_conjecture,(~leq(esk52_0,esk55_0)),inference(cn,[status(thm)],[2073,theory(equality)])).
% cnf(2075,negated_conjecture,(memberP(esk54_0,esk55_0)|$false),inference(rw,[status(thm)],[578,2067,theory(equality)])).
% cnf(2076,negated_conjecture,(memberP(esk54_0,esk55_0)),inference(cn,[status(thm)],[2075,theory(equality)])).
% cnf(2098,negated_conjecture,(leq(esk52_0,esk55_0)|~ssItem(esk55_0)),inference(spm,[status(thm)],[1023,2076,theory(equality)])).
% cnf(2117,negated_conjecture,(leq(esk52_0,esk55_0)|$false),inference(rw,[status(thm)],[2098,581,theory(equality)])).
% cnf(2118,negated_conjecture,(leq(esk52_0,esk55_0)),inference(cn,[status(thm)],[2117,theory(equality)])).
% cnf(2119,negated_conjecture,($false),inference(sr,[status(thm)],[2118,2074,theory(equality)])).
% cnf(2120,negated_conjecture,($false),2119,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 255
% # ...of these trivial : 2
% # ...subsumed : 6
% # ...remaining for further processing: 247
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 18
% # Generated clauses : 786
% # ...of the previous two non-trivial : 665
% # Contextual simplify-reflections : 3
% # Paramodulations : 695
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 222
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 186
% # Current number of unprocessed clauses: 532
% # ...number of literals in the above : 3595
% # Clause-clause subsumption calls (NU) : 995
% # Rec. Clause-clause subsumption calls : 241
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 266 leaves, 1.32+/-1.086 terms/leaf
% # Paramod-from index: 118 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 225 leaves, 1.22+/-0.925 terms/leaf
% # -------------------------------------------------
% # User time : 0.079 s
% # System time : 0.003 s
% # Total time : 0.082 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.28 WC
% FINAL PrfWatch: 0.21 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP13327/SWC279+1.tptp
%
%------------------------------------------------------------------------------