TSTP Solution File: SWC257+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC257+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 : art04.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:29:52 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP8402/SWC257+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8402/SWC257+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8402/SWC257+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 8498
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(13, axiom,![X1]:(ssItem(X1)=>totalorderedP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax65)).
% fof(14, axiom,totalorderedP(nil),file('/tmp/SRASS.s.p', ax66)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|totalorderedP(X1))|(![X5]:(((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,X6)))&(~(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))|totalorderedP(X1))|(![X5]:(((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,X6)))&(~(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))|totalorderedP(X1))|(![X5]:(((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,X6)))&(~(nil=X4)|~(nil=X3)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(156, plain,![X1]:(~(ssItem(X1))|totalorderedP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[13])).
% fof(157, plain,![X2]:(~(ssItem(X2))|totalorderedP(cons(X2,nil))),inference(variable_rename,[status(thm)],[156])).
% cnf(158,plain,(totalorderedP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[157])).
% cnf(159,plain,(totalorderedP(nil)),inference(split_conjunct,[status(thm)],[14])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&~(totalorderedP(X1)))&(?[X5]:(((ssItem(X5)&cons(X5,nil)=X3)&memberP(X4,X5))&![X6]:(((~(ssItem(X6))|X5=X6)|~(memberP(X4,X6)))|~(leq(X5,X6))))|(nil=X4&nil=X3)))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:((((ssList(X10)&X8=X10)&X7=X9)&~(totalorderedP(X7)))&(?[X11]:(((ssItem(X11)&cons(X11,nil)=X9)&memberP(X10,X11))&![X12]:(((~(ssItem(X12))|X11=X12)|~(memberP(X10,X12)))|~(leq(X11,X12))))|(nil=X10&nil=X9)))))),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)&~(totalorderedP(esk48_0)))&((((ssItem(esk52_0)&cons(esk52_0,nil)=esk50_0)&memberP(esk51_0,esk52_0))&![X12]:(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12))))|(nil=esk51_0&nil=esk50_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:(((((((((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12)))&((ssItem(esk52_0)&cons(esk52_0,nil)=esk50_0)&memberP(esk51_0,esk52_0)))|(nil=esk51_0&nil=esk50_0))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&~(totalorderedP(esk48_0))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X12]:(((((((nil=esk51_0|(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12))))&(nil=esk50_0|(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12)))))&((((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0)))&((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0)))&((nil=esk51_0|memberP(esk51_0,esk52_0))&(nil=esk50_0|memberP(esk51_0,esk52_0)))))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&~(totalorderedP(esk48_0))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(576,negated_conjecture,(~totalorderedP(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssItem(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(~totalorderedP(esk50_0)),inference(rw,[status(thm)],[576,577,theory(equality)])).
% cnf(593,negated_conjecture,(totalorderedP(esk50_0)|esk50_0=nil|~ssItem(esk52_0)),inference(spm,[status(thm)],[158,582,theory(equality)])).
% cnf(595,negated_conjecture,(esk50_0=nil|~ssItem(esk52_0)),inference(sr,[status(thm)],[593,588,theory(equality)])).
% cnf(1520,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[595,584])).
% cnf(1526,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[588,1520,theory(equality)]),159,theory(equality)])).
% cnf(1527,negated_conjecture,($false),inference(cn,[status(thm)],[1526,theory(equality)])).
% cnf(1528,negated_conjecture,($false),1527,['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 : 8
% # Generated clauses : 623
% # ...of the previous two non-trivial : 519
% # Contextual simplify-reflections : 3
% # Paramodulations : 532
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 187
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 172
% # Current number of unprocessed clauses: 445
% # ...number of literals in the above : 3178
% # Clause-clause subsumption calls (NU) : 816
% # Rec. Clause-clause subsumption calls : 150
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 226 leaves, 1.35+/-1.152 terms/leaf
% # Paramod-from index: 98 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 190 leaves, 1.24+/-0.997 terms/leaf
% # -------------------------------------------------
% # User time : 0.064 s
% # System time : 0.009 s
% # Total time : 0.073 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.27 WC
% FINAL PrfWatch: 0.20 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP8402/SWC257+1.tptp
%
%------------------------------------------------------------------------------