%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM430+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:02:35 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP29295/NUM430+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29295/NUM430+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29295/NUM430+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 29427
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(19, axiom,(((((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))&aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,xq))&?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xb,smndt0(xc))))&aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))))&sdteqdtlpzmzozddtrp0(xb,xc,xq)),file('/tmp/SRASS.s.p', m__853)).
% fof(25, conjecture,?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xb,smndt0(xc))),file('/tmp/SRASS.s.p', m__)).
% fof(26, negated_conjecture,~(?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xb,smndt0(xc)))),inference(assume_negation,[status(cth)],[25])).
% fof(99, plain,(((((?[X2]:(aInteger0(X2)&sdtasdt0(xq,X2)=sdtpldt0(xa,smndt0(xb)))&aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,xq))&?[X3]:(aInteger0(X3)&sdtasdt0(xq,X3)=sdtpldt0(xb,smndt0(xc))))&aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))))&sdteqdtlpzmzozddtrp0(xb,xc,xq)),inference(variable_rename,[status(thm)],[19])).
% fof(100, plain,((((((aInteger0(esk2_0)&sdtasdt0(xq,esk2_0)=sdtpldt0(xa,smndt0(xb)))&aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,xq))&(aInteger0(esk3_0)&sdtasdt0(xq,esk3_0)=sdtpldt0(xb,smndt0(xc))))&aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))))&sdteqdtlpzmzozddtrp0(xb,xc,xq)),inference(skolemize,[status(esa)],[99])).
% cnf(103,plain,(sdtasdt0(xq,esk3_0)=sdtpldt0(xb,smndt0(xc))),inference(split_conjunct,[status(thm)],[100])).
% cnf(104,plain,(aInteger0(esk3_0)),inference(split_conjunct,[status(thm)],[100])).
% fof(124, negated_conjecture,![X1]:(~(aInteger0(X1))|~(sdtasdt0(xq,X1)=sdtpldt0(xb,smndt0(xc)))),inference(fof_nnf,[status(thm)],[26])).
% fof(125, negated_conjecture,![X2]:(~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xb,smndt0(xc)))),inference(variable_rename,[status(thm)],[124])).
% cnf(126,negated_conjecture,(sdtasdt0(xq,X1)!=sdtpldt0(xb,smndt0(xc))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[125])).
% cnf(130,negated_conjecture,(sdtasdt0(xq,esk3_0)!=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(rw,[status(thm)],[126,103,theory(equality)])).
% cnf(200,negated_conjecture,(~aInteger0(esk3_0)),inference(er,[status(thm)],[130,theory(equality)])).
% cnf(202,negated_conjecture,($false),inference(rw,[status(thm)],[200,104,theory(equality)])).
% cnf(203,negated_conjecture,($false),inference(cn,[status(thm)],[202,theory(equality)])).
% cnf(204,negated_conjecture,($false),203,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 81
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 81
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 30
% # ...of the previous two non-trivial : 18
% # Contextual simplify-reflections : 0
% # Paramodulations : 28
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 31
% # ...number of literals in the above : 99
% # Clause-clause subsumption calls (NU) : 128
% # Rec. Clause-clause subsumption calls : 77
% # 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: 50 leaves, 1.04+/-0.196 terms/leaf
% # Paramod-from index: 30 leaves, 1.03+/-0.180 terms/leaf
% # Paramod-into index: 48 leaves, 1.02+/-0.143 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.005 s
% # Total time : 0.019 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/SystemOnTPTP29295/NUM430+3.tptp
%
%------------------------------------------------------------------------------