TSTP Solution File: SWC185+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC185+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:18:08 EST 2010
% Result : Theorem 1.46s
% Output : Solution 1.46s
% 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/SystemOnTPTP11757/SWC185+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11757/SWC185+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11757/SWC185+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 11853
% 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(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)&(memberP(X6,X5)|memberP(X7,X5))))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X1)|(~(memberP(X9,X8))&~(memberP(X10,X8)))))))))))),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)&(memberP(X6,X5)|memberP(X7,X5))))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X1)|(~(memberP(X9,X8))&~(memberP(X10,X8))))))))))))),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)&(memberP(X6,X5)|memberP(X7,X5))))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(X9,cons(X8,nil)),X10)=X1)|(~(memberP(X9,X8))&~(memberP(X10,X8))))))))))))),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))|(~(memberP(X6,X5))&~(memberP(X7,X5)))))))&?[X8]:(ssItem(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&(app(app(X9,cons(X8,nil)),X10)=X1&(memberP(X9,X8)|memberP(X10,X8))))))))))),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)&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=X13))|(~(memberP(X16,X15))&~(memberP(X17,X15)))))))&?[X18]:(ssItem(X18)&?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&(app(app(X19,cons(X18,nil)),X20)=X11&(memberP(X19,X18)|memberP(X20,X18))))))))))),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)&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk50_0))|(~(memberP(X16,X15))&~(memberP(X17,X15)))))))&(ssItem(esk52_0)&(ssList(esk53_0)&(ssList(esk54_0)&(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0&(memberP(esk53_0,esk52_0)|memberP(esk54_0,esk52_0))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:((((((((((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk50_0))|(~(memberP(X16,X15))&~(memberP(X17,X15))))|~(ssList(X16)))|~(ssItem(X15)))&(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&(memberP(esk53_0,esk52_0)|memberP(esk54_0,esk52_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]:((((((((((~(memberP(X16,X15))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk50_0)))|~(ssList(X16)))|~(ssItem(X15)))&(((~(memberP(X17,X15))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk50_0)))|~(ssList(X16)))|~(ssItem(X15))))&(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&(memberP(esk53_0,esk52_0)|memberP(esk54_0,esk52_0)))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(memberP(esk54_0,esk52_0)|memberP(esk53_0,esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk50_0|~ssList(X3)|~memberP(X3,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk50_0|~ssList(X3)|~memberP(X2,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(590,negated_conjecture,(app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk50_0),inference(rw,[status(thm)],[578,582,theory(equality)])).
% cnf(672,negated_conjecture,(~memberP(esk54_0,esk52_0)|~ssList(esk54_0)|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[584,590,theory(equality)])).
% cnf(677,negated_conjecture,(~memberP(esk54_0,esk52_0)|$false|~ssList(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[672,579,theory(equality)])).
% cnf(678,negated_conjecture,(~memberP(esk54_0,esk52_0)|$false|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[677,580,theory(equality)])).
% cnf(679,negated_conjecture,(~memberP(esk54_0,esk52_0)|$false|$false|$false),inference(rw,[status(thm)],[678,581,theory(equality)])).
% cnf(680,negated_conjecture,(~memberP(esk54_0,esk52_0)),inference(cn,[status(thm)],[679,theory(equality)])).
% cnf(685,negated_conjecture,(~memberP(esk53_0,esk52_0)|~ssList(esk54_0)|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[585,590,theory(equality)])).
% cnf(690,negated_conjecture,(~memberP(esk53_0,esk52_0)|$false|~ssList(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[685,579,theory(equality)])).
% cnf(691,negated_conjecture,(~memberP(esk53_0,esk52_0)|$false|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[690,580,theory(equality)])).
% cnf(692,negated_conjecture,(~memberP(esk53_0,esk52_0)|$false|$false|$false),inference(rw,[status(thm)],[691,581,theory(equality)])).
% cnf(693,negated_conjecture,(~memberP(esk53_0,esk52_0)),inference(cn,[status(thm)],[692,theory(equality)])).
% cnf(1405,negated_conjecture,(memberP(esk53_0,esk52_0)),inference(sr,[status(thm)],[577,680,theory(equality)])).
% cnf(1406,negated_conjecture,($false),inference(sr,[status(thm)],[1405,693,theory(equality)])).
% cnf(1407,negated_conjecture,($false),1406,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 204
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 201
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 578
% # ...of the previous two non-trivial : 476
% # Contextual simplify-reflections : 2
% # Paramodulations : 486
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 193
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 171
% # Current number of unprocessed clauses: 467
% # ...number of literals in the above : 3302
% # Clause-clause subsumption calls (NU) : 854
% # Rec. Clause-clause subsumption calls : 148
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 236 leaves, 1.34+/-1.129 terms/leaf
% # Paramod-from index: 101 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 201 leaves, 1.23+/-0.971 terms/leaf
% # -------------------------------------------------
% # User time : 0.064 s
% # System time : 0.007 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.26 WC
% FINAL PrfWatch: 0.20 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP11757/SWC185+1.tptp
%
%------------------------------------------------------------------------------