TSTP Solution File: NUM427+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM427+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:01:48 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/SystemOnTPTP28946/NUM427+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28946/NUM427+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28946/NUM427+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 29078
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(aInteger0(X1)=>aInteger0(smndt0(X1))),file('/tmp/SRASS.s.p', mIntNeg)).
% fof(19, axiom,(aInteger0(xn)&sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__747)).
% fof(20, axiom,sdtasdt0(xq,smndt0(xn))=sdtpldt0(xb,smndt0(xa)),file('/tmp/SRASS.s.p', m__767)).
% fof(25, conjecture,((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xb,smndt0(xa)))|aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))))|sdteqdtlpzmzozddtrp0(xb,xa,xq)),file('/tmp/SRASS.s.p', m__)).
% fof(26, negated_conjecture,~(((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xb,smndt0(xa)))|aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))))|sdteqdtlpzmzozddtrp0(xb,xa,xq))),inference(assume_negation,[status(cth)],[25])).
% fof(29, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(30, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[30])).
% cnf(102,plain,(aInteger0(xn)),inference(split_conjunct,[status(thm)],[19])).
% cnf(103,plain,(sdtasdt0(xq,smndt0(xn))=sdtpldt0(xb,smndt0(xa))),inference(split_conjunct,[status(thm)],[20])).
% fof(117, negated_conjecture,((![X1]:(~(aInteger0(X1))|~(sdtasdt0(xq,X1)=sdtpldt0(xb,smndt0(xa))))&~(aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))))&~(sdteqdtlpzmzozddtrp0(xb,xa,xq))),inference(fof_nnf,[status(thm)],[26])).
% fof(118, negated_conjecture,((![X2]:(~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xb,smndt0(xa))))&~(aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))))&~(sdteqdtlpzmzozddtrp0(xb,xa,xq))),inference(variable_rename,[status(thm)],[117])).
% fof(119, negated_conjecture,![X2]:(((~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xb,smndt0(xa))))&~(aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))))&~(sdteqdtlpzmzozddtrp0(xb,xa,xq))),inference(shift_quantors,[status(thm)],[118])).
% cnf(122,negated_conjecture,(sdtasdt0(xq,X1)!=sdtpldt0(xb,smndt0(xa))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[119])).
% cnf(126,negated_conjecture,(sdtasdt0(xq,smndt0(xn))!=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(rw,[status(thm)],[122,103,theory(equality)])).
% cnf(195,negated_conjecture,(~aInteger0(smndt0(xn))),inference(er,[status(thm)],[126,theory(equality)])).
% cnf(442,negated_conjecture,(~aInteger0(xn)),inference(spm,[status(thm)],[195,31,theory(equality)])).
% cnf(443,negated_conjecture,($false),inference(rw,[status(thm)],[442,102,theory(equality)])).
% cnf(444,negated_conjecture,($false),inference(cn,[status(thm)],[443,theory(equality)])).
% cnf(445,negated_conjecture,($false),444,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 91
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 91
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 156
% # ...of the previous two non-trivial : 143
% # Contextual simplify-reflections : 0
% # Paramodulations : 151
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 45
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 29
% # Current number of unprocessed clauses: 140
% # ...number of literals in the above : 535
% # Clause-clause subsumption calls (NU) : 210
% # Rec. Clause-clause subsumption calls : 118
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 60 leaves, 1.25+/-0.722 terms/leaf
% # Paramod-from index: 31 leaves, 1.10+/-0.296 terms/leaf
% # Paramod-into index: 51 leaves, 1.18+/-0.513 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.005 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP28946/NUM427+3.tptp
%
%------------------------------------------------------------------------------