TSTP Solution File: SWC233+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC233+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 : art05.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:21 EST 2010
% Result : Theorem 1.41s
% Output : Solution 1.41s
% 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/SystemOnTPTP3839/SWC233+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3839/SWC233+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3839/SWC233+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 3935
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(7, axiom,![X1]:(ssList(X1)=>(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax20)).
% 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(22, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% 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)))|~(leq(X5,X8)))|lt(X5,X8)))))))|?[X9]:(ssItem(X9)&?[X10]:(ssList(X10)&?[X11]:((ssList(X11)&app(app(X10,cons(X9,nil)),X11)=X3)&?[X12]:(ssItem(X12)&((~(lt(X9,X12))&memberP(X11,X12))|(~(lt(X12,X9))&memberP(X10,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))|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)))|~(leq(X5,X8)))|lt(X5,X8)))))))|?[X9]:(ssItem(X9)&?[X10]:(ssList(X10)&?[X11]:((ssList(X11)&app(app(X10,cons(X9,nil)),X11)=X3)&?[X12]:(ssItem(X12)&((~(lt(X9,X12))&memberP(X11,X12))|(~(lt(X12,X9))&memberP(X10,X12))))))))))))),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)))|~(leq(X5,X8)))|lt(X5,X8)))))))|?[X9]:(ssItem(X9)&?[X10]:(ssList(X10)&?[X11]:((ssList(X11)&app(app(X10,cons(X9,nil)),X11)=X3)&?[X12]:(ssItem(X12)&((~(lt(X9,X12))&memberP(X11,X12))|(~(lt(X12,X9))&memberP(X10,X12))))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(118, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(119, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[119])).
% cnf(121,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(133, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(134, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[133])).
% fof(135, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk5_1(X4))&(ssItem(esk6_1(X4))&cons(esk6_1(X4),esk5_1(X4))=X4)))),inference(skolemize,[status(esa)],[134])).
% fof(136, plain,![X4]:(((ssList(esk5_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk6_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk6_1(X4),esk5_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[135])).
% cnf(137,plain,(nil=X1|cons(esk6_1(X1),esk5_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[136])).
% cnf(138,plain,(nil=X1|ssItem(esk6_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[136])).
% cnf(139,plain,(nil=X1|ssList(esk5_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[136])).
% 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(199, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(200, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[199])).
% fof(201, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[200])).
% cnf(202,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[201])).
% 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))&leq(X5,X8))&~(lt(X5,X8))))))))&![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:((~(ssList(X11))|~(app(app(X10,cons(X9,nil)),X11)=X3))|![X12]:(~(ssItem(X12))|((lt(X9,X12)|~(memberP(X11,X12)))&(lt(X12,X9)|~(memberP(X10,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)&~(nil=X13))&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=X13))|?[X20]:(ssItem(X20)&(((memberP(X18,X20)&memberP(X19,X20))&leq(X17,X20))&~(lt(X17,X20))))))))&![X21]:(~(ssItem(X21))|![X22]:(~(ssList(X22))|![X23]:((~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=X15))|![X24]:(~(ssItem(X24))|((lt(X21,X24)|~(memberP(X23,X24)))&(lt(X24,X21)|~(memberP(X22,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)&~(nil=esk48_0))&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0))|(ssItem(esk52_3(X17,X18,X19))&(((memberP(X18,esk52_3(X17,X18,X19))&memberP(X19,esk52_3(X17,X18,X19)))&leq(X17,esk52_3(X17,X18,X19)))&~(lt(X17,esk52_3(X17,X18,X19)))))))))&![X21]:(~(ssItem(X21))|![X22]:(~(ssList(X22))|![X23]:((~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk50_0))|![X24]:(~(ssItem(X24))|((lt(X21,X24)|~(memberP(X23,X24)))&(lt(X24,X21)|~(memberP(X22,X24))))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:![X19]:![X21]:![X22]:![X23]:![X24]:(((((((((~(ssItem(X24))|((lt(X21,X24)|~(memberP(X23,X24)))&(lt(X24,X21)|~(memberP(X22,X24)))))|(~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk50_0)))|~(ssList(X22)))|~(ssItem(X21)))&(((((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0))|(ssItem(esk52_3(X17,X18,X19))&(((memberP(X18,esk52_3(X17,X18,X19))&memberP(X19,esk52_3(X17,X18,X19)))&leq(X17,esk52_3(X17,X18,X19)))&~(lt(X17,esk52_3(X17,X18,X19))))))|~(ssList(X18)))|~(ssItem(X17)))&((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,![X17]:![X18]:![X19]:![X21]:![X22]:![X23]:![X24]:(((((((((((lt(X21,X24)|~(memberP(X23,X24)))|~(ssItem(X24)))|(~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk50_0)))|~(ssList(X22)))|~(ssItem(X21)))&(((((lt(X24,X21)|~(memberP(X22,X24)))|~(ssItem(X24)))|(~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk50_0)))|~(ssList(X22)))|~(ssItem(X21))))&(((((ssItem(esk52_3(X17,X18,X19))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17)))&((((((memberP(X18,esk52_3(X17,X18,X19))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17)))&(((memberP(X19,esk52_3(X17,X18,X19))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17))))&(((leq(X17,esk52_3(X17,X18,X19))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17))))&(((~(lt(X17,esk52_3(X17,X18,X19)))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17)))))&((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(583,negated_conjecture,(memberP(X2,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(1074,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssList(nil)|~ssItem(X1)),inference(spm,[status(thm)],[190,583,theory(equality)])).
% cnf(1077,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|$false|~ssItem(X1)),inference(rw,[status(thm)],[1074,122,theory(equality)])).
% cnf(1078,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1077,theory(equality)])).
% cnf(1942,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1078,584,theory(equality)])).
% cnf(1943,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[1942,122,theory(equality)])).
% cnf(1944,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1943,theory(equality)])).
% cnf(1947,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[1944,154,theory(equality)])).
% cnf(2026,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[1947,202,theory(equality)])).
% cnf(2039,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2026,121,theory(equality)])).
% cnf(2040,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2039,122,theory(equality)])).
% cnf(2041,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2040,theory(equality)])).
% cnf(2043,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk5_1(X1))|~ssItem(esk6_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[2041,137,theory(equality)])).
% cnf(3299,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk5_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[2043,138])).
% cnf(3300,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(X1)),inference(csr,[status(thm)],[3299,139])).
% cnf(3302,negated_conjecture,(nil=esk48_0),inference(spm,[status(thm)],[3300,573,theory(equality)])).
% cnf(3334,negated_conjecture,($false),inference(sr,[status(thm)],[3302,577,theory(equality)])).
% cnf(3335,negated_conjecture,($false),3334,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 646
% # ...of these trivial : 9
% # ...subsumed : 147
% # ...remaining for further processing: 490
% # Other redundant clauses eliminated : 100
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 2
% # Generated clauses : 1788
% # ...of the previous two non-trivial : 1520
% # Contextual simplify-reflections : 185
% # Paramodulations : 1661
% # Factorizations : 0
% # Equation resolutions : 127
% # Current number of processed clauses: 277
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 259
% # Current number of unprocessed clauses: 1202
% # ...number of literals in the above : 9375
% # Clause-clause subsumption calls (NU) : 4315
% # Rec. Clause-clause subsumption calls : 1115
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 268 leaves, 1.46+/-1.276 terms/leaf
% # Paramod-from index: 140 leaves, 1.04+/-0.186 terms/leaf
% # Paramod-into index: 248 leaves, 1.29+/-0.979 terms/leaf
% # -------------------------------------------------
% # User time : 0.156 s
% # System time : 0.006 s
% # Total time : 0.162 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.30 CPU 0.38 WC
% FINAL PrfWatch: 0.30 CPU 0.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP3839/SWC233+1.tptp
%
%------------------------------------------------------------------------------