%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV169+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:40:08 EST 2010
% Result : Theorem 1.20s
% Output : Solution 1.20s
% 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/SystemOnTPTP16173/SWV169+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16173/SWV169+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16173/SWV169+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 16269
% 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(92, conjecture,((((((((((leq(n0,pv10)&leq(n0,pv11))&leq(n0,pv65))&leq(pv10,n135299))&leq(pv11,n4))&leq(pv65,n4))&![X4]:![X10]:((((leq(n0,X4)&leq(n0,X10))&leq(X4,n135299))&leq(X10,n4))=>((X4=pv10>(pv11,X10))=>a_select3(q_init,X4,X10)=init)))&![X17]:![X23]:((((leq(n0,X17)&leq(n0,X23))&leq(X17,n135299))&leq(X23,n4))=>(gt(pv10,X17)=>a_select3(q_init,X17,X23)=init)))&![X24]:((leq(n0,X24)&leq(X24,pred(pv10)))=>![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select3(q_init,X24,X25)=init)))&![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select3(center_init,X28,n0)=init))=>a_select3(center_init,pv65,n0)=init),file('/tmp/SRASS.s.p', cl5_nebula_init_0021)).
% fof(93, negated_conjecture,~(((((((((((leq(n0,pv10)&leq(n0,pv11))&leq(n0,pv65))&leq(pv10,n135299))&leq(pv11,n4))&leq(pv65,n4))&![X4]:![X10]:((((leq(n0,X4)&leq(n0,X10))&leq(X4,n135299))&leq(X10,n4))=>((X4=pv10>(pv11,X10))=>a_select3(q_init,X4,X10)=init)))&![X17]:![X23]:((((leq(n0,X17)&leq(n0,X23))&leq(X17,n135299))&leq(X23,n4))=>(gt(pv10,X17)=>a_select3(q_init,X17,X23)=init)))&![X24]:((leq(n0,X24)&leq(X24,pred(pv10)))=>![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select3(q_init,X24,X25)=init)))&![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select3(center_init,X28,n0)=init))=>a_select3(center_init,pv65,n0)=init)),inference(assume_negation,[status(cth)],[92])).
% fof(96, plain,(epred2_0=>(((((((((leq(n0,pv10)&leq(n0,pv11))&leq(n0,pv65))&leq(pv10,n135299))&leq(pv11,n4))&leq(pv65,n4))&![X4]:![X10]:((((leq(n0,X4)&leq(n0,X10))&leq(X4,n135299))&leq(X10,n4))=>((X4=pv10>(pv11,X10))=>a_select3(q_init,X4,X10)=init)))&![X17]:![X23]:((((leq(n0,X17)&leq(n0,X23))&leq(X17,n135299))&leq(X23,n4))=>(gt(pv10,X17)=>a_select3(q_init,X17,X23)=init)))&![X24]:((leq(n0,X24)&leq(X24,pred(pv10)))=>![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select3(q_init,X24,X25)=init)))&![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select3(center_init,X28,n0)=init))),introduced(definition)).
% fof(98, negated_conjecture,~((epred2_0=>a_select3(center_init,pv65,n0)=init)),inference(apply_def,[status(esa)],[93,96,theory(equality)])).
% fof(390, negated_conjecture,(epred2_0&~(a_select3(center_init,pv65,n0)=init)),inference(fof_nnf,[status(thm)],[98])).
% cnf(391,negated_conjecture,(a_select3(center_init,pv65,n0)!=init),inference(split_conjunct,[status(thm)],[390])).
% cnf(392,negated_conjecture,(epred2_0),inference(split_conjunct,[status(thm)],[390])).
% fof(422, plain,(~(epred2_0)|(((((((((leq(n0,pv10)&leq(n0,pv11))&leq(n0,pv65))&leq(pv10,n135299))&leq(pv11,n4))&leq(pv65,n4))&![X4]:![X10]:((((~(leq(n0,X4))|~(leq(n0,X10)))|~(leq(X4,n135299)))|~(leq(X10,n4)))|((~(X4=pv10)|~(gt(pv11,X10)))|a_select3(q_init,X4,X10)=init)))&![X17]:![X23]:((((~(leq(n0,X17))|~(leq(n0,X23)))|~(leq(X17,n135299)))|~(leq(X23,n4)))|(~(gt(pv10,X17))|a_select3(q_init,X17,X23)=init)))&![X24]:((~(leq(n0,X24))|~(leq(X24,pred(pv10))))|![X25]:((~(leq(n0,X25))|~(leq(X25,n4)))|a_select3(q_init,X24,X25)=init)))&![X28]:((~(leq(n0,X28))|~(leq(X28,n4)))|a_select3(center_init,X28,n0)=init))),inference(fof_nnf,[status(thm)],[96])).
% fof(423, plain,(~(epred2_0)|(((((((((leq(n0,pv10)&leq(n0,pv11))&leq(n0,pv65))&leq(pv10,n135299))&leq(pv11,n4))&leq(pv65,n4))&![X29]:![X30]:((((~(leq(n0,X29))|~(leq(n0,X30)))|~(leq(X29,n135299)))|~(leq(X30,n4)))|((~(X29=pv10)|~(gt(pv11,X30)))|a_select3(q_init,X29,X30)=init)))&![X31]:![X32]:((((~(leq(n0,X31))|~(leq(n0,X32)))|~(leq(X31,n135299)))|~(leq(X32,n4)))|(~(gt(pv10,X31))|a_select3(q_init,X31,X32)=init)))&![X33]:((~(leq(n0,X33))|~(leq(X33,pred(pv10))))|![X34]:((~(leq(n0,X34))|~(leq(X34,n4)))|a_select3(q_init,X33,X34)=init)))&![X35]:((~(leq(n0,X35))|~(leq(X35,n4)))|a_select3(center_init,X35,n0)=init))),inference(variable_rename,[status(thm)],[422])).
% fof(424, plain,![X29]:![X30]:![X31]:![X32]:![X33]:![X34]:![X35]:((((~(leq(n0,X35))|~(leq(X35,n4)))|a_select3(center_init,X35,n0)=init)&((((~(leq(n0,X34))|~(leq(X34,n4)))|a_select3(q_init,X33,X34)=init)|(~(leq(n0,X33))|~(leq(X33,pred(pv10)))))&(((((~(leq(n0,X31))|~(leq(n0,X32)))|~(leq(X31,n135299)))|~(leq(X32,n4)))|(~(gt(pv10,X31))|a_select3(q_init,X31,X32)=init))&(((((~(leq(n0,X29))|~(leq(n0,X30)))|~(leq(X29,n135299)))|~(leq(X30,n4)))|((~(X29=pv10)|~(gt(pv11,X30)))|a_select3(q_init,X29,X30)=init))&(((((leq(n0,pv10)&leq(n0,pv11))&leq(n0,pv65))&leq(pv10,n135299))&leq(pv11,n4))&leq(pv65,n4))))))|~(epred2_0)),inference(shift_quantors,[status(thm)],[423])).
% fof(425, plain,![X29]:![X30]:![X31]:![X32]:![X33]:![X34]:![X35]:((((~(leq(n0,X35))|~(leq(X35,n4)))|a_select3(center_init,X35,n0)=init)|~(epred2_0))&(((((~(leq(n0,X34))|~(leq(X34,n4)))|a_select3(q_init,X33,X34)=init)|(~(leq(n0,X33))|~(leq(X33,pred(pv10)))))|~(epred2_0))&((((((~(leq(n0,X31))|~(leq(n0,X32)))|~(leq(X31,n135299)))|~(leq(X32,n4)))|(~(gt(pv10,X31))|a_select3(q_init,X31,X32)=init))|~(epred2_0))&((((((~(leq(n0,X29))|~(leq(n0,X30)))|~(leq(X29,n135299)))|~(leq(X30,n4)))|((~(X29=pv10)|~(gt(pv11,X30)))|a_select3(q_init,X29,X30)=init))|~(epred2_0))&((((((leq(n0,pv10)|~(epred2_0))&(leq(n0,pv11)|~(epred2_0)))&(leq(n0,pv65)|~(epred2_0)))&(leq(pv10,n135299)|~(epred2_0)))&(leq(pv11,n4)|~(epred2_0)))&(leq(pv65,n4)|~(epred2_0))))))),inference(distribute,[status(thm)],[424])).
% cnf(426,plain,(leq(pv65,n4)|~epred2_0),inference(split_conjunct,[status(thm)],[425])).
% cnf(429,plain,(leq(n0,pv65)|~epred2_0),inference(split_conjunct,[status(thm)],[425])).
% cnf(435,plain,(a_select3(center_init,X1,n0)=init|~epred2_0|~leq(X1,n4)|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[425])).
% cnf(465,plain,(leq(n0,pv65)|$false),inference(rw,[status(thm)],[429,392,theory(equality)])).
% cnf(466,plain,(leq(n0,pv65)),inference(cn,[status(thm)],[465,theory(equality)])).
% cnf(471,plain,(leq(pv65,n4)|$false),inference(rw,[status(thm)],[426,392,theory(equality)])).
% cnf(472,plain,(leq(pv65,n4)),inference(cn,[status(thm)],[471,theory(equality)])).
% cnf(482,plain,(a_select3(center_init,X1,n0)=init|$false|~leq(X1,n4)|~leq(n0,X1)),inference(rw,[status(thm)],[435,392,theory(equality)])).
% cnf(483,plain,(a_select3(center_init,X1,n0)=init|~leq(X1,n4)|~leq(n0,X1)),inference(cn,[status(thm)],[482,theory(equality)])).
% cnf(554,negated_conjecture,(~leq(pv65,n4)|~leq(n0,pv65)),inference(spm,[status(thm)],[391,483,theory(equality)])).
% cnf(555,negated_conjecture,($false|~leq(n0,pv65)),inference(rw,[status(thm)],[554,472,theory(equality)])).
% cnf(556,negated_conjecture,($false|$false),inference(rw,[status(thm)],[555,466,theory(equality)])).
% cnf(557,negated_conjecture,($false),inference(cn,[status(thm)],[556,theory(equality)])).
% cnf(558,negated_conjecture,($false),557,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 275
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 275
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 49
% # ...of the previous two non-trivial : 39
% # Contextual simplify-reflections : 0
% # Paramodulations : 46
% # Factorizations : 2
% # Equation resolutions : 1
% # Current number of processed clauses: 64
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 3
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 182
% # ...number of literals in the above : 799
% # Clause-clause subsumption calls (NU) : 1765
% # Rec. Clause-clause subsumption calls : 663
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 81 leaves, 1.09+/-0.358 terms/leaf
% # Paramod-from index: 57 leaves, 1.02+/-0.131 terms/leaf
% # Paramod-into index: 76 leaves, 1.05+/-0.276 terms/leaf
% # -------------------------------------------------
% # User time : 0.059 s
% # System time : 0.005 s
% # Total time : 0.064 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.24 WC
% FINAL PrfWatch: 0.18 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP16173/SWV169+1.tptp
%
%------------------------------------------------------------------------------