%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM434+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 19:04:13 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP29993/NUM434+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29993/NUM434+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29993/NUM434+3.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 30125
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(20, axiom,(((~(sdtasdt0(xp,xq)=sz00)&?[X1]:(aInteger0(X1)&sdtasdt0(sdtasdt0(xp,xq),X1)=sdtpldt0(xa,smndt0(xb))))&aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))),file('/tmp/SRASS.s.p', m__1003)).
% fof(25, conjecture,?[X1]:(aInteger0(X1)&sdtasdt0(sdtasdt0(xp,xq),X1)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__)).
% fof(26, negated_conjecture,~(?[X1]:(aInteger0(X1)&sdtasdt0(sdtasdt0(xp,xq),X1)=sdtpldt0(xa,smndt0(xb)))),inference(assume_negation,[status(cth)],[25])).
% fof(103, plain,(((~(sdtasdt0(xp,xq)=sz00)&?[X2]:(aInteger0(X2)&sdtasdt0(sdtasdt0(xp,xq),X2)=sdtpldt0(xa,smndt0(xb))))&aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))),inference(variable_rename,[status(thm)],[20])).
% fof(104, plain,(((~(sdtasdt0(xp,xq)=sz00)&(aInteger0(esk2_0)&sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtpldt0(xa,smndt0(xb))))&aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))),inference(skolemize,[status(esa)],[103])).
% cnf(107,plain,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[104])).
% cnf(108,plain,(aInteger0(esk2_0)),inference(split_conjunct,[status(thm)],[104])).
% fof(123, negated_conjecture,![X1]:(~(aInteger0(X1))|~(sdtasdt0(sdtasdt0(xp,xq),X1)=sdtpldt0(xa,smndt0(xb)))),inference(fof_nnf,[status(thm)],[26])).
% fof(124, negated_conjecture,![X2]:(~(aInteger0(X2))|~(sdtasdt0(sdtasdt0(xp,xq),X2)=sdtpldt0(xa,smndt0(xb)))),inference(variable_rename,[status(thm)],[123])).
% cnf(125,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),X1)!=sdtpldt0(xa,smndt0(xb))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[124])).
% cnf(127,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),X1)!=sdtasdt0(sdtasdt0(xp,xq),esk2_0)|~aInteger0(X1)),inference(rw,[status(thm)],[125,107,theory(equality)])).
% cnf(224,negated_conjecture,(~aInteger0(esk2_0)),inference(er,[status(thm)],[127,theory(equality)])).
% cnf(230,negated_conjecture,($false),inference(rw,[status(thm)],[224,108,theory(equality)])).
% cnf(231,negated_conjecture,($false),inference(cn,[status(thm)],[230,theory(equality)])).
% cnf(232,negated_conjecture,($false),231,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 76
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 76
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 48
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 0
% # Paramodulations : 46
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 32
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 46
% # ...number of literals in the above : 140
% # Clause-clause subsumption calls (NU) : 143
% # Rec. Clause-clause subsumption calls : 85
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 43 leaves, 1.09+/-0.290 terms/leaf
% # Paramod-from index: 25 leaves, 1.08+/-0.271 terms/leaf
% # Paramod-into index: 39 leaves, 1.08+/-0.266 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.003 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP29993/NUM434+3.tptp
%
%------------------------------------------------------------------------------