TSTP Solution File: SWC239+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC239+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 : art01.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:27:58 EST 2010
% Result : Theorem 1.52s
% Output : Solution 1.52s
% 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/SystemOnTPTP18318/SWC239+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18318/SWC239+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18318/SWC239+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 18414
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(19, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(25, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8)))))))|(![X9]:(ssItem(X9)=>((~(cons(X9,nil)=X3)|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X9,X10))))&(~(nil=X4)|~(nil=X3)))))))),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))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8)))))))|(![X9]:(ssItem(X9)=>((~(cons(X9,nil)=X3)|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X9,X10))))&(~(nil=X4)|~(nil=X3))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(99, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8)))))))|(![X9]:(ssItem(X9)=>((~(cons(X9,nil)=X3)|~(memberP(X4,X9)))|?[X10]:(((ssItem(X10)&~(X9=X10))&memberP(X4,X10))&leq(X9,X10))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(122,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(152, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[11])).
% fof(153, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[152])).
% cnf(154,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[153])).
% fof(188, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(189, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[188])).
% cnf(190,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[189])).
% fof(214, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[25])).
% fof(215, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[214])).
% cnf(216,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[215])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&~(nil=X1))&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X1))|?[X8]:(ssItem(X8)&(((memberP(X6,X8)&memberP(X7,X8))<(X5,X8))&~(leq(X5,X8))))))))&(?[X9]:(ssItem(X9)&((cons(X9,nil)=X3&memberP(X4,X9))&![X10]:(((~(ssItem(X10))|X9=X10)|~(memberP(X4,X10)))|~(leq(X9,X10)))))|(nil=X4&nil=X3))))))),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)&~(nil=X11))&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=X11))|?[X18]:(ssItem(X18)&(((memberP(X16,X18)&memberP(X17,X18))<(X15,X18))&~(leq(X15,X18))))))))&(?[X19]:(ssItem(X19)&((cons(X19,nil)=X13&memberP(X14,X19))&![X20]:(((~(ssItem(X20))|X19=X20)|~(memberP(X14,X20)))|~(leq(X19,X20)))))|(nil=X14&nil=X13))))))),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)&~(nil=esk48_0))&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0))|(ssItem(esk52_3(X15,X16,X17))&(((memberP(X16,esk52_3(X15,X16,X17))&memberP(X17,esk52_3(X15,X16,X17)))<(X15,esk52_3(X15,X16,X17)))&~(leq(X15,esk52_3(X15,X16,X17)))))))))&((ssItem(esk53_0)&((cons(esk53_0,nil)=esk50_0&memberP(esk51_0,esk53_0))&![X20]:(((~(ssItem(X20))|esk53_0=X20)|~(memberP(esk51_0,X20)))|~(leq(esk53_0,X20)))))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:![X20]:(((((((((((~(ssItem(X20))|esk53_0=X20)|~(memberP(esk51_0,X20)))|~(leq(esk53_0,X20)))&(cons(esk53_0,nil)=esk50_0&memberP(esk51_0,esk53_0)))&ssItem(esk53_0))|(nil=esk51_0&nil=esk50_0))&(((((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0))|(ssItem(esk52_3(X15,X16,X17))&(((memberP(X16,esk52_3(X15,X16,X17))&memberP(X17,esk52_3(X15,X16,X17)))<(X15,esk52_3(X15,X16,X17)))&~(leq(X15,esk52_3(X15,X16,X17))))))|~(ssList(X16)))|~(ssItem(X15)))&((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_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]:![X20]:(((((((((nil=esk51_0|(((~(ssItem(X20))|esk53_0=X20)|~(memberP(esk51_0,X20)))|~(leq(esk53_0,X20))))&(nil=esk50_0|(((~(ssItem(X20))|esk53_0=X20)|~(memberP(esk51_0,X20)))|~(leq(esk53_0,X20)))))&(((nil=esk51_0|cons(esk53_0,nil)=esk50_0)&(nil=esk50_0|cons(esk53_0,nil)=esk50_0))&((nil=esk51_0|memberP(esk51_0,esk53_0))&(nil=esk50_0|memberP(esk51_0,esk53_0)))))&((nil=esk51_0|ssItem(esk53_0))&(nil=esk50_0|ssItem(esk53_0))))&(((((ssItem(esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))&((((((memberP(X16,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))&(((memberP(X17,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15))))&(((lt(X15,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15))))&(((~(leq(X15,esk52_3(X15,X16,X17)))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))))&((esk49_0=esk51_0&esk48_0=esk50_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),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(memberP(X3,esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssItem(esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(cons(esk53_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(600,negated_conjecture,(esk48_0=nil|ssItem(esk53_0)),inference(rw,[status(thm)],[585,578,theory(equality)])).
% cnf(601,negated_conjecture,(ssItem(esk53_0)),inference(sr,[status(thm)],[600,577,theory(equality)])).
% cnf(603,negated_conjecture,(esk48_0=nil|cons(esk53_0,nil)=esk50_0),inference(rw,[status(thm)],[589,578,theory(equality)])).
% cnf(604,negated_conjecture,(esk48_0=nil|cons(esk53_0,nil)=esk48_0),inference(rw,[status(thm)],[603,578,theory(equality)])).
% cnf(605,negated_conjecture,(cons(esk53_0,nil)=esk48_0),inference(sr,[status(thm)],[604,577,theory(equality)])).
% cnf(1187,negated_conjecture,(~ssItem(esk52_3(X1,X2,nil))|app(app(X2,cons(X1,nil)),nil)!=esk48_0|~ssList(nil)|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[190,582,theory(equality)])).
% cnf(1192,negated_conjecture,(~ssItem(esk52_3(X1,X2,nil))|app(app(X2,cons(X1,nil)),nil)!=esk48_0|$false|~ssList(X2)|~ssItem(X1)),inference(rw,[status(thm)],[1187,122,theory(equality)])).
% cnf(1193,negated_conjecture,(~ssItem(esk52_3(X1,X2,nil))|app(app(X2,cons(X1,nil)),nil)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1192,theory(equality)])).
% cnf(1869,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk48_0|~ssList(X1)|~ssItem(X2)|~ssList(nil)),inference(spm,[status(thm)],[1193,584,theory(equality)])).
% cnf(1870,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk48_0|~ssList(X1)|~ssItem(X2)|$false),inference(rw,[status(thm)],[1869,122,theory(equality)])).
% cnf(1871,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk48_0|~ssList(X1)|~ssItem(X2)),inference(cn,[status(thm)],[1870,theory(equality)])).
% cnf(1872,negated_conjecture,(app(app(X1,esk48_0),nil)!=esk48_0|~ssList(X1)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1871,605,theory(equality)])).
% cnf(1883,negated_conjecture,(app(app(X1,esk48_0),nil)!=esk48_0|~ssList(X1)|$false),inference(rw,[status(thm)],[1872,601,theory(equality)])).
% cnf(1884,negated_conjecture,(app(app(X1,esk48_0),nil)!=esk48_0|~ssList(X1)),inference(cn,[status(thm)],[1883,theory(equality)])).
% cnf(1913,negated_conjecture,(app(esk48_0,nil)!=esk48_0|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[1884,154,theory(equality)])).
% cnf(1923,negated_conjecture,(app(esk48_0,nil)!=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[1913,122,theory(equality)])).
% cnf(1924,negated_conjecture,(app(esk48_0,nil)!=esk48_0|$false|$false),inference(rw,[status(thm)],[1923,573,theory(equality)])).
% cnf(1925,negated_conjecture,(app(esk48_0,nil)!=esk48_0),inference(cn,[status(thm)],[1924,theory(equality)])).
% cnf(1940,negated_conjecture,(~ssList(esk48_0)),inference(spm,[status(thm)],[1925,216,theory(equality)])).
% cnf(1944,negated_conjecture,($false),inference(rw,[status(thm)],[1940,573,theory(equality)])).
% cnf(1945,negated_conjecture,($false),inference(cn,[status(thm)],[1944,theory(equality)])).
% cnf(1946,negated_conjecture,($false),1945,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 434
% # ...of these trivial : 5
% # ...subsumed : 7
% # ...remaining for further processing: 422
% # Other redundant clauses eliminated : 82
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 945
% # ...of the previous two non-trivial : 793
% # Contextual simplify-reflections : 5
% # Paramodulations : 845
% # Factorizations : 0
% # Equation resolutions : 100
% # Current number of processed clauses: 215
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 186
% # Current number of unprocessed clauses: 767
% # ...number of literals in the above : 5650
% # Clause-clause subsumption calls (NU) : 1745
% # Rec. Clause-clause subsumption calls : 322
% # Unit Clause-clause subsumption calls : 43
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 253 leaves, 1.38+/-1.179 terms/leaf
% # Paramod-from index: 137 leaves, 1.02+/-0.146 terms/leaf
% # Paramod-into index: 236 leaves, 1.23+/-0.892 terms/leaf
% # -------------------------------------------------
% # User time : 0.103 s
% # System time : 0.005 s
% # Total time : 0.108 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.33 WC
% FINAL PrfWatch: 0.26 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP18318/SWC239+1.tptp
%
%------------------------------------------------------------------------------