TSTP Solution File: SWC288+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC288+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:40:55 EST 2010
% Result : Theorem 1.47s
% Output : Solution 1.47s
% 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/SystemOnTPTP27608/SWC288+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27608/SWC288+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27608/SWC288+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 27704
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(18, axiom,![X1]:(ssItem(X1)=>strictorderedP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax68)).
% fof(19, axiom,strictorderedP(nil),file('/tmp/SRASS.s.p', ax69)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|strictorderedP(X1))|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(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))|strictorderedP(X1))|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(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))|strictorderedP(X1))|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(nil=X4)|~(nil=X3)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(193, plain,![X1]:(~(ssItem(X1))|strictorderedP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[18])).
% fof(194, plain,![X2]:(~(ssItem(X2))|strictorderedP(cons(X2,nil))),inference(variable_rename,[status(thm)],[193])).
% cnf(195,plain,(strictorderedP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[194])).
% cnf(196,plain,(strictorderedP(nil)),inference(split_conjunct,[status(thm)],[19])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&~(strictorderedP(X1)))&(?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((((ssList(X7)&cons(X5,nil)=X3)&app(app(X6,X3),X7)=X4)&![X8]:((~(ssItem(X8))|~(memberP(X6,X8)))|~(lt(X5,X8))))&![X9]:((~(ssItem(X9))|~(memberP(X7,X9)))|~(lt(X9,X5))))))|(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)&~(strictorderedP(X10)))&(?[X14]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:((((ssList(X16)&cons(X14,nil)=X12)&app(app(X15,X12),X16)=X13)&![X17]:((~(ssItem(X17))|~(memberP(X15,X17)))|~(lt(X14,X17))))&![X18]:((~(ssItem(X18))|~(memberP(X16,X18)))|~(lt(X18,X14))))))|(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)&~(strictorderedP(esk48_0)))&((ssItem(esk52_0)&(ssList(esk53_0)&((((ssList(esk54_0)&cons(esk52_0,nil)=esk50_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&![X17]:((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17))))&![X18]:((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0))))))|(nil=esk51_0&nil=esk50_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:((((((((((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))&(((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17)))&((ssList(esk54_0)&cons(esk52_0,nil)=esk50_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)))&ssList(esk53_0))&ssItem(esk52_0))|(nil=esk51_0&nil=esk50_0))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&~(strictorderedP(esk48_0))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X17]:![X18]:(((((((((nil=esk51_0|((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0))))&(nil=esk50_0|((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))))&(((nil=esk51_0|((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17))))&(nil=esk50_0|((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17)))))&((((nil=esk51_0|ssList(esk54_0))&(nil=esk50_0|ssList(esk54_0)))&((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0)))&((nil=esk51_0|app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&(nil=esk50_0|app(app(esk53_0,esk50_0),esk54_0)=esk51_0)))))&((nil=esk51_0|ssList(esk53_0))&(nil=esk50_0|ssList(esk53_0))))&((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0))))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&~(strictorderedP(esk48_0))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(576,negated_conjecture,(~strictorderedP(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(ssItem(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(594,negated_conjecture,(~strictorderedP(esk50_0)),inference(rw,[status(thm)],[576,577,theory(equality)])).
% cnf(599,negated_conjecture,(strictorderedP(esk50_0)|esk50_0=nil|~ssItem(esk52_0)),inference(spm,[status(thm)],[195,586,theory(equality)])).
% cnf(601,negated_conjecture,(esk50_0=nil|~ssItem(esk52_0)),inference(sr,[status(thm)],[599,594,theory(equality)])).
% cnf(1532,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[601,580])).
% cnf(1541,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[594,1532,theory(equality)]),196,theory(equality)])).
% cnf(1542,negated_conjecture,($false),inference(cn,[status(thm)],[1541,theory(equality)])).
% cnf(1543,negated_conjecture,($false),1542,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 210
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 207
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 12
% # Generated clauses : 643
% # ...of the previous two non-trivial : 536
% # Contextual simplify-reflections : 3
% # Paramodulations : 552
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 189
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 174
% # Current number of unprocessed clauses: 440
% # ...number of literals in the above : 3159
% # Clause-clause subsumption calls (NU) : 852
% # Rec. Clause-clause subsumption calls : 174
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 231 leaves, 1.35+/-1.140 terms/leaf
% # Paramod-from index: 99 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 194 leaves, 1.24+/-0.987 terms/leaf
% # -------------------------------------------------
% # User time : 0.068 s
% # System time : 0.005 s
% # Total time : 0.073 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.27 WC
% FINAL PrfWatch: 0.22 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP27608/SWC288+1.tptp
%
%------------------------------------------------------------------------------