TSTP Solution File: SWC398+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC398+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 08:03:00 EST 2010
% Result : Theorem 1.49s
% Output : Solution 1.49s
% 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/SystemOnTPTP10510/SWC398+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10510/SWC398+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10510/SWC398+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 10609
% 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(13, axiom,![X1]:(ssItem(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(memberP(app(X2,X3),X1)<=>(memberP(X2,X1)|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax36)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|![X9]:(ssItem(X9)=>(~(memberP(X1,X9))|memberP(X2,X9))))|(~(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))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|![X9]:(ssItem(X9)=>(~(memberP(X1,X9))|memberP(X2,X9))))|(~(nil=X4)&nil=X3))))))),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]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|![X9]:(ssItem(X9)=>(~(memberP(X1,X9))|memberP(X2,X9))))|(~(nil=X4)&nil=X3))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(167, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|((~(memberP(app(X2,X3),X1))|(memberP(X2,X1)|memberP(X3,X1)))&((~(memberP(X2,X1))&~(memberP(X3,X1)))|memberP(app(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[13])).
% fof(168, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[167])).
% fof(169, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4))))|~(ssList(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[168])).
% fof(170, plain,![X4]:![X5]:![X6]:(((((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&(((((~(memberP(X5,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[169])).
% cnf(172,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X2,X1)),inference(split_conjunct,[status(thm)],[170])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&((app(X3,X5)=X4&equalelemsP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssList(X8))|~(app(X8,cons(X6,nil))=X3)))))))&?[X9]:(ssItem(X9)&(memberP(X1,X9)&~(memberP(X2,X9)))))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((X11=X13&X10=X12)&?[X14]:(ssList(X14)&((app(X12,X14)=X13&equalelemsP(X12))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=X14))|![X17]:(~(ssList(X17))|~(app(X17,cons(X15,nil))=X12)))))))&?[X18]:(ssItem(X18)&(memberP(X10,X18)&~(memberP(X11,X18)))))&(nil=X13|~(nil=X12))))))),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)&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0))|![X17]:(~(ssList(X17))|~(app(X17,cons(X15,nil))=esk50_0)))))))&(ssItem(esk53_0)&(memberP(esk48_0,esk53_0)&~(memberP(esk49_0,esk53_0)))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:((((((((((((~(ssList(X17))|~(app(X17,cons(X15,nil))=esk50_0))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk53_0)&(memberP(esk48_0,esk53_0)&~(memberP(esk49_0,esk53_0)))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(~memberP(esk49_0,esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(memberP(esk48_0,esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(~memberP(esk51_0,esk53_0)),inference(rw,[status(thm)],[577,581,theory(equality)])).
% cnf(587,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,580,theory(equality)])).
% cnf(591,negated_conjecture,(memberP(esk50_0,esk53_0)),inference(rw,[status(thm)],[578,580,theory(equality)])).
% cnf(726,negated_conjecture,(memberP(app(esk50_0,X1),esk53_0)|~ssList(X1)|~ssList(esk50_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[172,591,theory(equality)])).
% cnf(727,negated_conjecture,(memberP(app(esk50_0,X1),esk53_0)|~ssList(X1)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[726,587,theory(equality)])).
% cnf(728,negated_conjecture,(memberP(app(esk50_0,X1),esk53_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[727,579,theory(equality)])).
% cnf(729,negated_conjecture,(memberP(app(esk50_0,X1),esk53_0)|~ssList(X1)),inference(cn,[status(thm)],[728,theory(equality)])).
% cnf(1903,negated_conjecture,(memberP(esk51_0,esk53_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[729,584,theory(equality)])).
% cnf(1924,negated_conjecture,(memberP(esk51_0,esk53_0)|$false),inference(rw,[status(thm)],[1903,582,theory(equality)])).
% cnf(1925,negated_conjecture,(memberP(esk51_0,esk53_0)),inference(cn,[status(thm)],[1924,theory(equality)])).
% cnf(1926,negated_conjecture,($false),inference(sr,[status(thm)],[1925,586,theory(equality)])).
% cnf(1927,negated_conjecture,($false),1926,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 234
% # ...of these trivial : 2
% # ...subsumed : 4
% # ...remaining for further processing: 228
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 716
% # ...of the previous two non-trivial : 595
% # Contextual simplify-reflections : 3
% # Paramodulations : 625
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 212
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 179
% # Current number of unprocessed clauses: 502
% # ...number of literals in the above : 3423
% # Clause-clause subsumption calls (NU) : 857
% # Rec. Clause-clause subsumption calls : 174
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 256 leaves, 1.32+/-1.089 terms/leaf
% # Paramod-from index: 118 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 220 leaves, 1.21+/-0.930 terms/leaf
% # -------------------------------------------------
% # User time : 0.075 s
% # System time : 0.003 s
% # Total time : 0.078 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.27 WC
% FINAL PrfWatch: 0.23 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP10510/SWC398+1.tptp
%
%------------------------------------------------------------------------------