TSTP Solution File: NUM423+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM423+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 : art09.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:55:47 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP1269/NUM423+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1269/NUM423+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1269/NUM423+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 1366
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aInteger0(sz00),file('/tmp/SRASS.s.p', mIntZero)).
% fof(8, axiom,![X1]:(aInteger0(X1)=>(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),file('/tmp/SRASS.s.p', mAddNeg)).
% fof(12, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', mMulZero)).
% fof(16, axiom,((aInteger0(xa)&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__671)).
% fof(21, conjecture,((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xa)))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa))))|sdteqdtlpzmzozddtrp0(xa,xa,xq)),file('/tmp/SRASS.s.p', m__)).
% fof(22, negated_conjecture,~(((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xa)))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa))))|sdteqdtlpzmzozddtrp0(xa,xa,xq))),inference(assume_negation,[status(cth)],[21])).
% cnf(24,plain,(aInteger0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(45, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(46, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,smndt0(X2))=sz00&sz00=sdtpldt0(smndt0(X2),X2))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X2]:((sdtpldt0(X2,smndt0(X2))=sz00|~(aInteger0(X2)))&(sz00=sdtpldt0(smndt0(X2),X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[46])).
% cnf(49,plain,(sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(61, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(62, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aInteger0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[62])).
% cnf(65,plain,(sdtasdt0(X1,sz00)=sz00|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[63])).
% cnf(85,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[16])).
% cnf(86,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[16])).
% fof(100, negated_conjecture,((![X1]:(~(aInteger0(X1))|~(sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xa))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))))&~(sdteqdtlpzmzozddtrp0(xa,xa,xq))),inference(fof_nnf,[status(thm)],[22])).
% fof(101, negated_conjecture,((![X2]:(~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xa,smndt0(xa))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))))&~(sdteqdtlpzmzozddtrp0(xa,xa,xq))),inference(variable_rename,[status(thm)],[100])).
% fof(102, negated_conjecture,![X2]:(((~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xa,smndt0(xa))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))))&~(sdteqdtlpzmzozddtrp0(xa,xa,xq))),inference(shift_quantors,[status(thm)],[101])).
% cnf(105,negated_conjecture,(sdtasdt0(xq,X1)!=sdtpldt0(xa,smndt0(xa))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[102])).
% cnf(147,negated_conjecture,(sz00!=sdtasdt0(xq,X1)|~aInteger0(X1)|~aInteger0(xa)),inference(spm,[status(thm)],[105,49,theory(equality)])).
% cnf(148,negated_conjecture,(sz00!=sdtasdt0(xq,X1)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[147,86,theory(equality)])).
% cnf(149,negated_conjecture,(sz00!=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[148,theory(equality)])).
% cnf(419,negated_conjecture,(~aInteger0(sz00)|~aInteger0(xq)),inference(spm,[status(thm)],[149,65,theory(equality)])).
% cnf(427,negated_conjecture,($false|~aInteger0(xq)),inference(rw,[status(thm)],[419,24,theory(equality)])).
% cnf(428,negated_conjecture,($false|$false),inference(rw,[status(thm)],[427,85,theory(equality)])).
% cnf(429,negated_conjecture,($false),inference(cn,[status(thm)],[428,theory(equality)])).
% cnf(430,negated_conjecture,($false),429,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 74
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 172
% # ...of the previous two non-trivial : 150
% # Contextual simplify-reflections : 0
% # Paramodulations : 168
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 38
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 29
% # Current number of unprocessed clauses: 143
% # ...number of literals in the above : 604
% # Clause-clause subsumption calls (NU) : 198
% # Rec. Clause-clause subsumption calls : 118
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 47 leaves, 1.30+/-0.797 terms/leaf
% # Paramod-from index: 26 leaves, 1.12+/-0.319 terms/leaf
% # Paramod-into index: 40 leaves, 1.20+/-0.557 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.004 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP1269/NUM423+3.tptp
%
%------------------------------------------------------------------------------