TSTP Solution File: NUM429+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM429+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:57:32 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP31270/NUM429+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31270/NUM429+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31270/NUM429+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 31366
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 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(24, conjecture,?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__)).
% fof(25, negated_conjecture,~(?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))),inference(assume_negation,[status(cth)],[24])).
% fof(98, 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(99, 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)],[98])).
% cnf(106,plain,(sdtasdt0(xq,esk2_0)=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[99])).
% cnf(107,plain,(aInteger0(esk2_0)),inference(split_conjunct,[status(thm)],[99])).
% fof(121, negated_conjecture,![X1]:(~(aInteger0(X1))|~(sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))),inference(fof_nnf,[status(thm)],[25])).
% fof(122, negated_conjecture,![X2]:(~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xa,smndt0(xb)))),inference(variable_rename,[status(thm)],[121])).
% cnf(123,negated_conjecture,(sdtasdt0(xq,X1)!=sdtpldt0(xa,smndt0(xb))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[122])).
% cnf(126,negated_conjecture,(sdtasdt0(xq,esk2_0)!=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(rw,[status(thm)],[123,106,theory(equality)])).
% cnf(175,negated_conjecture,(~aInteger0(esk2_0)),inference(er,[status(thm)],[126,theory(equality)])).
% cnf(177,negated_conjecture,($false),inference(rw,[status(thm)],[175,107,theory(equality)])).
% cnf(178,negated_conjecture,($false),inference(cn,[status(thm)],[177,theory(equality)])).
% cnf(179,negated_conjecture,($false),178,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 75
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 75
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 20
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 0
% # Paramodulations : 19
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 23
% # ...number of literals in the above : 82
% # 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: 47 leaves, 1.02+/-0.144 terms/leaf
% # Paramod-from index: 27 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 45 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP31270/NUM429+3.tptp
%
%------------------------------------------------------------------------------