TSTP Solution File: SWC046+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC046+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 : art09.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:54:40 EST 2010
% Result : Theorem 3.12s
% Output : Solution 3.12s
% 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/SystemOnTPTP14835/SWC046+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14835/SWC046+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14835/SWC046+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 14931
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.91 CPU 2.02 WC
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:(ssList(X1)=>(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax20)).
% fof(14, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>![X3]:(ssList(X3)=>(memberP(cons(X2,X3),X1)<=>(X1=X2|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax37)).
% fof(15, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&(((~(memberP(X3,X5))&![X6]:(ssList(X6)=>~(segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))))))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(ssList(X6)&segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))))))))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&(((~(memberP(X3,X5))&![X6]:(ssList(X6)=>~(segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))))))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(ssList(X6)&segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil)))))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&(((~(memberP(X3,X5))&![X6]:(ssList(X6)=>~(segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))))))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(ssList(X6)&segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil)))))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(142, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(143, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[142])).
% fof(144, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk7_1(X4))&(ssItem(esk8_1(X4))&cons(esk8_1(X4),esk7_1(X4))=X4)))),inference(skolemize,[status(esa)],[143])).
% fof(145, plain,![X4]:(((ssList(esk7_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk8_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk8_1(X4),esk7_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[144])).
% cnf(146,plain,(nil=X1|cons(esk8_1(X1),esk7_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[145])).
% cnf(147,plain,(nil=X1|ssItem(esk8_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[145])).
% cnf(148,plain,(nil=X1|ssList(esk7_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[145])).
% fof(171, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssList(X3))|((~(memberP(cons(X2,X3),X1))|(X1=X2|memberP(X3,X1)))&((~(X1=X2)&~(memberP(X3,X1)))|memberP(cons(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[14])).
% fof(172, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[171])).
% fof(173, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4))))|~(ssItem(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[172])).
% fof(174, plain,![X4]:![X5]:![X6]:(((((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&(((((~(X4=X5)|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[173])).
% cnf(176,plain,(memberP(cons(X2,X3),X1)|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|X1!=X2),inference(split_conjunct,[status(thm)],[174])).
% fof(178, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(179, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[178])).
% cnf(180,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[179])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((nil=X2&X2=X4)&X1=X3)&~(nil=X1))&![X5]:(~(ssItem(X5))|(((memberP(X3,X5)|?[X6]:(ssList(X6)&segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil)))))|~(memberP(X4,X5)))&(~(memberP(X3,X5))|(memberP(X4,X5)&![X6]:(~(ssList(X6))|~(segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil)))))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&((((nil=X8&X8=X10)&X7=X9)&~(nil=X7))&![X11]:(~(ssItem(X11))|(((memberP(X9,X11)|?[X12]:(ssList(X12)&segmentP(X10,app(app(cons(X11,nil),X12),cons(X11,nil)))))|~(memberP(X10,X11)))&(~(memberP(X9,X11))|(memberP(X10,X11)&![X13]:(~(ssList(X13))|~(segmentP(X10,app(app(cons(X11,nil),X13),cons(X11,nil)))))))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((nil=esk49_0&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0))&![X11]:(~(ssItem(X11))|(((memberP(esk50_0,X11)|(ssList(esk52_1(X11))&segmentP(esk51_0,app(app(cons(X11,nil),esk52_1(X11)),cons(X11,nil)))))|~(memberP(esk51_0,X11)))&(~(memberP(esk50_0,X11))|(memberP(esk51_0,X11)&![X13]:(~(ssList(X13))|~(segmentP(esk51_0,app(app(cons(X11,nil),X13),cons(X11,nil)))))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:![X13]:((((((((((~(ssList(X13))|~(segmentP(esk51_0,app(app(cons(X11,nil),X13),cons(X11,nil)))))&memberP(esk51_0,X11))|~(memberP(esk50_0,X11)))&((memberP(esk50_0,X11)|(ssList(esk52_1(X11))&segmentP(esk51_0,app(app(cons(X11,nil),esk52_1(X11)),cons(X11,nil)))))|~(memberP(esk51_0,X11))))|~(ssItem(X11)))&(((nil=esk49_0&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,![X11]:![X13]:((((((((((~(ssList(X13))|~(segmentP(esk51_0,app(app(cons(X11,nil),X13),cons(X11,nil)))))|~(memberP(esk50_0,X11)))|~(ssItem(X11)))&((memberP(esk51_0,X11)|~(memberP(esk50_0,X11)))|~(ssItem(X11))))&((((ssList(esk52_1(X11))|memberP(esk50_0,X11))|~(memberP(esk51_0,X11)))|~(ssItem(X11)))&(((segmentP(esk51_0,app(app(cons(X11,nil),esk52_1(X11)),cons(X11,nil)))|memberP(esk50_0,X11))|~(memberP(esk51_0,X11)))|~(ssItem(X11)))))&(((nil=esk49_0&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(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(memberP(esk51_0,X1)|~ssItem(X1)|~memberP(esk50_0,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(esk50_0!=nil),inference(rw,[status(thm)],[577,578,theory(equality)])).
% cnf(586,negated_conjecture,(esk51_0=nil),inference(rw,[status(thm)],[579,580,theory(equality)])).
% cnf(587,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,578,theory(equality)])).
% cnf(594,negated_conjecture,(memberP(nil,X1)|~ssItem(X1)|~memberP(esk50_0,X1)),inference(rw,[status(thm)],[583,586,theory(equality)])).
% cnf(595,negated_conjecture,(~memberP(esk50_0,X1)|~ssItem(X1)),inference(csr,[status(thm)],[594,180])).
% cnf(705,plain,(memberP(cons(X1,X2),X1)|~ssList(X2)|~ssItem(X1)),inference(er,[status(thm)],[176,theory(equality)])).
% cnf(2330,plain,(memberP(X1,esk8_1(X1))|nil=X1|~ssList(esk7_1(X1))|~ssItem(esk8_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[705,146,theory(equality)])).
% cnf(36722,plain,(nil=X1|memberP(X1,esk8_1(X1))|~ssList(esk7_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[2330,147])).
% cnf(36723,plain,(nil=X1|memberP(X1,esk8_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[36722,148])).
% cnf(36724,negated_conjecture,(nil=esk50_0|~ssItem(esk8_1(esk50_0))|~ssList(esk50_0)),inference(spm,[status(thm)],[595,36723,theory(equality)])).
% cnf(36741,negated_conjecture,(nil=esk50_0|~ssItem(esk8_1(esk50_0))|$false),inference(rw,[status(thm)],[36724,587,theory(equality)])).
% cnf(36742,negated_conjecture,(nil=esk50_0|~ssItem(esk8_1(esk50_0))),inference(cn,[status(thm)],[36741,theory(equality)])).
% cnf(36743,negated_conjecture,(~ssItem(esk8_1(esk50_0))),inference(sr,[status(thm)],[36742,585,theory(equality)])).
% cnf(36745,negated_conjecture,(nil=esk50_0|~ssList(esk50_0)),inference(spm,[status(thm)],[36743,147,theory(equality)])).
% cnf(36749,negated_conjecture,(nil=esk50_0|$false),inference(rw,[status(thm)],[36745,587,theory(equality)])).
% cnf(36750,negated_conjecture,(nil=esk50_0),inference(cn,[status(thm)],[36749,theory(equality)])).
% cnf(36751,negated_conjecture,($false),inference(sr,[status(thm)],[36750,585,theory(equality)])).
% cnf(36752,negated_conjecture,($false),36751,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5699
% # ...of these trivial : 3
% # ...subsumed : 4723
% # ...remaining for further processing: 973
% # Other redundant clauses eliminated : 789
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 13
% # Generated clauses : 18337
% # ...of the previous two non-trivial : 16906
% # Contextual simplify-reflections : 4723
% # Paramodulations : 17369
% # Factorizations : 0
% # Equation resolutions : 965
% # Current number of processed clauses: 944
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 916
% # Current number of unprocessed clauses: 11204
% # ...number of literals in the above : 85071
% # Clause-clause subsumption calls (NU) : 486151
% # Rec. Clause-clause subsumption calls : 454686
% # Unit Clause-clause subsumption calls : 112
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 626 leaves, 1.89+/-4.721 terms/leaf
% # Paramod-from index: 254 leaves, 1.16+/-0.893 terms/leaf
% # Paramod-into index: 430 leaves, 1.91+/-5.615 terms/leaf
% # -------------------------------------------------
% # User time : 1.364 s
% # System time : 0.037 s
% # Total time : 1.401 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.01 CPU 2.11 WC
% FINAL PrfWatch: 2.01 CPU 2.11 WC
% SZS output end Solution for /tmp/SystemOnTPTP14835/SWC046+1.tptp
%
%------------------------------------------------------------------------------