%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV067+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 : art03.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:20:08 EST 2010
% Result : Theorem 1.72s
% Output : Solution 1.72s
% 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/SystemOnTPTP7613/SWV067+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7613/SWV067+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7613/SWV067+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 7709
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:![X3]:((leq(X1,X2)&leq(X2,X3))=>leq(X1,X3)),file('/tmp/SRASS.s.p', transitivity_leq)).
% fof(5, axiom,![X1]:![X2]:(gt(X2,X1)=>leq(X1,X2)),file('/tmp/SRASS.s.p', leq_gt1)).
% fof(10, axiom,gt(n1,n0),file('/tmp/SRASS.s.p', gt_1_0)).
% fof(92, conjecture,((((leq(n0,pv10)&leq(n1,pv63))&leq(pv10,minus(n135300,n1)))&leq(pv63,minus(n5,n1)))=>(((((leq(n0,pv10)&leq(n0,pv63))&leq(pv10,minus(n135300,n1)))&leq(pv63,minus(n5,n1)))&(~(gt(a_select3(q,pv10,pv63),pv78))=>(leq(n0,pv10)&leq(pv10,minus(n135300,n1)))))&(gt(a_select3(q,pv10,pv63),pv78)=>(leq(n0,pv10)&leq(pv10,minus(n135300,n1)))))),file('/tmp/SRASS.s.p', cl5_nebula_array_0008)).
% fof(93, negated_conjecture,~(((((leq(n0,pv10)&leq(n1,pv63))&leq(pv10,minus(n135300,n1)))&leq(pv63,minus(n5,n1)))=>(((((leq(n0,pv10)&leq(n0,pv63))&leq(pv10,minus(n135300,n1)))&leq(pv63,minus(n5,n1)))&(~(gt(a_select3(q,pv10,pv63),pv78))=>(leq(n0,pv10)&leq(pv10,minus(n135300,n1)))))&(gt(a_select3(q,pv10,pv63),pv78)=>(leq(n0,pv10)&leq(pv10,minus(n135300,n1))))))),inference(assume_negation,[status(cth)],[92])).
% fof(95, negated_conjecture,~(((((leq(n0,pv10)&leq(n1,pv63))&leq(pv10,minus(n135300,n1)))&leq(pv63,minus(n5,n1)))=>(((((leq(n0,pv10)&leq(n0,pv63))&leq(pv10,minus(n135300,n1)))&leq(pv63,minus(n5,n1)))&(~(gt(a_select3(q,pv10,pv63),pv78))=>(leq(n0,pv10)&leq(pv10,minus(n135300,n1)))))&(gt(a_select3(q,pv10,pv63),pv78)=>(leq(n0,pv10)&leq(pv10,minus(n135300,n1))))))),inference(fof_simplification,[status(thm)],[93,theory(equality)])).
% fof(105, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(106, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[105])).
% cnf(107,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[106])).
% fof(108, plain,![X1]:![X2]:(~(gt(X2,X1))|leq(X1,X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(109, plain,![X3]:![X4]:(~(gt(X4,X3))|leq(X3,X4)),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(leq(X1,X2)|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[109])).
% cnf(117,plain,(gt(n1,n0)),inference(split_conjunct,[status(thm)],[10])).
% fof(389, negated_conjecture,((((leq(n0,pv10)&leq(n1,pv63))&leq(pv10,minus(n135300,n1)))&leq(pv63,minus(n5,n1)))&(((((~(leq(n0,pv10))|~(leq(n0,pv63)))|~(leq(pv10,minus(n135300,n1))))|~(leq(pv63,minus(n5,n1))))|(~(gt(a_select3(q,pv10,pv63),pv78))&(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))))|(gt(a_select3(q,pv10,pv63),pv78)&(~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))))),inference(fof_nnf,[status(thm)],[95])).
% fof(390, negated_conjecture,((((leq(n0,pv10)&leq(n1,pv63))&leq(pv10,minus(n135300,n1)))&leq(pv63,minus(n5,n1)))&(((gt(a_select3(q,pv10,pv63),pv78)|(~(gt(a_select3(q,pv10,pv63),pv78))|(((~(leq(n0,pv10))|~(leq(n0,pv63)))|~(leq(pv10,minus(n135300,n1))))|~(leq(pv63,minus(n5,n1))))))&((~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))|(~(gt(a_select3(q,pv10,pv63),pv78))|(((~(leq(n0,pv10))|~(leq(n0,pv63)))|~(leq(pv10,minus(n135300,n1))))|~(leq(pv63,minus(n5,n1)))))))&((gt(a_select3(q,pv10,pv63),pv78)|((~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))|(((~(leq(n0,pv10))|~(leq(n0,pv63)))|~(leq(pv10,minus(n135300,n1))))|~(leq(pv63,minus(n5,n1))))))&((~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))|((~(leq(n0,pv10))|~(leq(pv10,minus(n135300,n1))))|(((~(leq(n0,pv10))|~(leq(n0,pv63)))|~(leq(pv10,minus(n135300,n1))))|~(leq(pv63,minus(n5,n1))))))))),inference(distribute,[status(thm)],[389])).
% cnf(391,negated_conjecture,(~leq(pv63,minus(n5,n1))|~leq(pv10,minus(n135300,n1))|~leq(n0,pv63)|~leq(n0,pv10)|~leq(pv10,minus(n135300,n1))|~leq(n0,pv10)|~leq(pv10,minus(n135300,n1))|~leq(n0,pv10)),inference(split_conjunct,[status(thm)],[390])).
% cnf(395,negated_conjecture,(leq(pv63,minus(n5,n1))),inference(split_conjunct,[status(thm)],[390])).
% cnf(396,negated_conjecture,(leq(pv10,minus(n135300,n1))),inference(split_conjunct,[status(thm)],[390])).
% cnf(397,negated_conjecture,(leq(n1,pv63)),inference(split_conjunct,[status(thm)],[390])).
% cnf(398,negated_conjecture,(leq(n0,pv10)),inference(split_conjunct,[status(thm)],[390])).
% cnf(471,negated_conjecture,($false|~leq(n0,pv63)|~leq(pv10,minus(n135300,n1))|~leq(pv63,minus(n5,n1))),inference(rw,[status(thm)],[391,398,theory(equality)])).
% cnf(472,negated_conjecture,($false|~leq(n0,pv63)|$false|~leq(pv63,minus(n5,n1))),inference(rw,[status(thm)],[471,396,theory(equality)])).
% cnf(473,negated_conjecture,($false|~leq(n0,pv63)|$false|$false),inference(rw,[status(thm)],[472,395,theory(equality)])).
% cnf(474,negated_conjecture,(~leq(n0,pv63)),inference(cn,[status(thm)],[473,theory(equality)])).
% cnf(498,plain,(leq(n0,n1)),inference(spm,[status(thm)],[110,117,theory(equality)])).
% cnf(640,negated_conjecture,(leq(X1,pv63)|~leq(X1,n1)),inference(spm,[status(thm)],[107,397,theory(equality)])).
% cnf(12546,negated_conjecture,(~leq(n0,n1)),inference(spm,[status(thm)],[474,640,theory(equality)])).
% cnf(12631,negated_conjecture,($false),inference(rw,[status(thm)],[12546,498,theory(equality)])).
% cnf(12632,negated_conjecture,($false),inference(cn,[status(thm)],[12631,theory(equality)])).
% cnf(12633,negated_conjecture,($false),12632,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 556
% # ...of these trivial : 4
% # ...subsumed : 51
% # ...remaining for further processing: 501
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 6653
% # ...of the previous two non-trivial : 6469
% # Contextual simplify-reflections : 1
% # Paramodulations : 6640
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 293
% # Positive orientable unit clauses: 105
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 28
% # Non-unit-clauses : 155
% # Current number of unprocessed clauses: 6238
% # ...number of literals in the above : 37707
% # Clause-clause subsumption calls (NU) : 3483
% # Rec. Clause-clause subsumption calls : 1289
% # Unit Clause-clause subsumption calls : 117
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 35
% # Indexed BW rewrite successes : 26
% # Backwards rewriting index: 320 leaves, 1.20+/-1.312 terms/leaf
% # Paramod-from index: 139 leaves, 1.03+/-0.167 terms/leaf
% # Paramod-into index: 215 leaves, 1.09+/-0.473 terms/leaf
% # -------------------------------------------------
% # User time : 0.357 s
% # System time : 0.019 s
% # Total time : 0.376 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.67 CPU 0.75 WC
% FINAL PrfWatch: 0.67 CPU 0.75 WC
% SZS output end Solution for /tmp/SystemOnTPTP7613/SWV067+1.tptp
%
%------------------------------------------------------------------------------