%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM432+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 : art05.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 : Wed Dec 29 18:58:39 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP31789/NUM432+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31789/NUM432+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31789/NUM432+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 31885
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mIntPlus)).
% fof(20, axiom,(aInteger0(xn)&sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__876)).
% fof(21, axiom,(aInteger0(xm)&sdtasdt0(xq,xm)=sdtpldt0(xb,smndt0(xc))),file('/tmp/SRASS.s.p', m__899)).
% fof(22, axiom,sdtasdt0(xq,sdtpldt0(xn,xm))=sdtpldt0(xa,smndt0(xc)),file('/tmp/SRASS.s.p', m__924)).
% fof(27, conjecture,((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xc)))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))))|sdteqdtlpzmzozddtrp0(xa,xc,xq)),file('/tmp/SRASS.s.p', m__)).
% fof(28, negated_conjecture,~(((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xc)))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))))|sdteqdtlpzmzozddtrp0(xa,xc,xq))),inference(assume_negation,[status(cth)],[27])).
% fof(34, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(35, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[35])).
% cnf(112,plain,(aInteger0(xn)),inference(split_conjunct,[status(thm)],[20])).
% cnf(114,plain,(aInteger0(xm)),inference(split_conjunct,[status(thm)],[21])).
% cnf(115,plain,(sdtasdt0(xq,sdtpldt0(xn,xm))=sdtpldt0(xa,smndt0(xc))),inference(split_conjunct,[status(thm)],[22])).
% fof(129, negated_conjecture,((![X1]:(~(aInteger0(X1))|~(sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xc))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))))&~(sdteqdtlpzmzozddtrp0(xa,xc,xq))),inference(fof_nnf,[status(thm)],[28])).
% fof(130, negated_conjecture,((![X2]:(~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xa,smndt0(xc))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))))&~(sdteqdtlpzmzozddtrp0(xa,xc,xq))),inference(variable_rename,[status(thm)],[129])).
% fof(131, negated_conjecture,![X2]:(((~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xa,smndt0(xc))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))))&~(sdteqdtlpzmzozddtrp0(xa,xc,xq))),inference(shift_quantors,[status(thm)],[130])).
% cnf(134,negated_conjecture,(sdtasdt0(xq,X1)!=sdtpldt0(xa,smndt0(xc))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[131])).
% cnf(140,negated_conjecture,(sdtasdt0(xq,sdtpldt0(xn,xm))!=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(rw,[status(thm)],[134,115,theory(equality)])).
% cnf(269,negated_conjecture,(~aInteger0(sdtpldt0(xn,xm))),inference(er,[status(thm)],[140,theory(equality)])).
% cnf(589,negated_conjecture,(~aInteger0(xm)|~aInteger0(xn)),inference(spm,[status(thm)],[269,36,theory(equality)])).
% cnf(590,negated_conjecture,($false|~aInteger0(xn)),inference(rw,[status(thm)],[589,114,theory(equality)])).
% cnf(591,negated_conjecture,($false|$false),inference(rw,[status(thm)],[590,112,theory(equality)])).
% cnf(592,negated_conjecture,($false),inference(cn,[status(thm)],[591,theory(equality)])).
% cnf(593,negated_conjecture,($false),592,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 116
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 116
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 192
% # ...of the previous two non-trivial : 171
% # Contextual simplify-reflections : 0
% # Paramodulations : 187
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 60
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 30
% # Current number of unprocessed clauses: 159
% # ...number of literals in the above : 581
% # Clause-clause subsumption calls (NU) : 220
% # Rec. Clause-clause subsumption calls : 118
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 81 leaves, 1.20+/-0.656 terms/leaf
% # Paramod-from index: 45 leaves, 1.07+/-0.249 terms/leaf
% # Paramod-into index: 72 leaves, 1.14+/-0.480 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.002 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP31789/NUM432+3.tptp
%
%------------------------------------------------------------------------------