TSTP Solution File: SWC275+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC275+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 : art02.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:37:33 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP5816/SWC275+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5816/SWC275+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5816/SWC275+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 5912
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(12, axiom,![X1]:(ssItem(X1)=>totalorderedP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax65)).
% fof(13, 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))|(~(nil=X3)&nil=X4))|(![X5]:((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))&neq(X4,nil)))))),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))|(~(nil=X3)&nil=X4))|(![X5]:((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))&neq(X4,nil))))))),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))|(~(nil=X3)&nil=X4))|(![X5]:((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))&neq(X4,nil))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[117])).
% cnf(119,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[118])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(157, plain,![X1]:(~(ssItem(X1))|totalorderedP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[12])).
% fof(158, plain,![X2]:(~(ssItem(X2))|totalorderedP(cons(X2,nil))),inference(variable_rename,[status(thm)],[157])).
% cnf(159,plain,(totalorderedP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[158])).
% cnf(160,plain,(totalorderedP(nil)),inference(split_conjunct,[status(thm)],[13])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(((((ssList(X4)&X2=X4)&X1=X3)&~(totalorderedP(X1)))&(nil=X3|~(nil=X4)))&(?[X5]:((ssItem(X5)&cons(X5,nil)=X3)&memberP(X4,X5))|~(neq(X4,nil))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(((((ssList(X9)&X7=X9)&X6=X8)&~(totalorderedP(X6)))&(nil=X8|~(nil=X9)))&(?[X10]:((ssItem(X10)&cons(X10,nil)=X8)&memberP(X9,X10))|~(neq(X9,nil))))))),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)))&(nil=esk50_0|~(nil=esk51_0)))&(((ssItem(esk52_0)&cons(esk52_0,nil)=esk50_0)&memberP(esk51_0,esk52_0))|~(neq(esk51_0,nil))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, 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)))&(nil=esk50_0|~(nil=esk51_0)))&(((ssItem(esk52_0)|~(neq(esk51_0,nil)))&(cons(esk52_0,nil)=esk50_0|~(neq(esk51_0,nil))))&(memberP(esk51_0,esk52_0)|~(neq(esk51_0,nil)))))))),inference(distribute,[status(thm)],[570])).
% cnf(573,negated_conjecture,(cons(esk52_0,nil)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(~totalorderedP(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(~totalorderedP(esk50_0)),inference(rw,[status(thm)],[576,577,theory(equality)])).
% cnf(585,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(651,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[574,119,theory(equality)])).
% cnf(652,negated_conjecture,(cons(esk52_0,nil)=esk50_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[573,119,theory(equality)])).
% cnf(654,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[651,125,theory(equality)])).
% cnf(655,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[654,585,theory(equality)])).
% cnf(656,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil),inference(cn,[status(thm)],[655,theory(equality)])).
% cnf(657,negated_conjecture,(cons(esk52_0,nil)=esk50_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[652,125,theory(equality)])).
% cnf(658,negated_conjecture,(cons(esk52_0,nil)=esk50_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[657,585,theory(equality)])).
% cnf(659,negated_conjecture,(cons(esk52_0,nil)=esk50_0|esk51_0=nil),inference(cn,[status(thm)],[658,theory(equality)])).
% cnf(1337,negated_conjecture,(totalorderedP(esk50_0)|esk51_0=nil|~ssItem(esk52_0)),inference(spm,[status(thm)],[159,659,theory(equality)])).
% cnf(1401,negated_conjecture,(esk51_0=nil|~ssItem(esk52_0)),inference(sr,[status(thm)],[1337,583,theory(equality)])).
% cnf(1402,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[1401,656])).
% cnf(1410,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[575,1402,theory(equality)])).
% cnf(1411,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1410,theory(equality)])).
% cnf(1413,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,1411,theory(equality)]),160,theory(equality)])).
% cnf(1414,negated_conjecture,($false),inference(cn,[status(thm)],[1413,theory(equality)])).
% cnf(1415,negated_conjecture,($false),1414,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 203
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 200
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 11
% # Generated clauses : 581
% # ...of the previous two non-trivial : 484
% # Contextual simplify-reflections : 3
% # Paramodulations : 490
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 183
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 442
% # ...number of literals in the above : 3162
% # Clause-clause subsumption calls (NU) : 828
% # Rec. Clause-clause subsumption calls : 152
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 219 leaves, 1.37+/-1.168 terms/leaf
% # Paramod-from index: 95 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 184 leaves, 1.25+/-1.012 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.004 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP5816/SWC275+1.tptp
%
%------------------------------------------------------------------------------