TSTP Solution File: NUM523+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM523+1 : 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:57:46 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP4715/NUM523+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4715/NUM523+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4715/NUM523+1.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 4847
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(8, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(10, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>((isPrime0(X3)&doDivides0(X3,sdtasdt0(X1,X2)))=>(doDivides0(X3,X1)|doDivides0(X3,X2)))),file('/tmp/SRASS.s.p', mPDP)).
% fof(11, axiom,(((((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp))&~(xn=sz00))&~(xm=sz00))&~(xp=sz00)),file('/tmp/SRASS.s.p', m__2987)).
% fof(13, axiom,sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xn,xn),file('/tmp/SRASS.s.p', m__3014)).
% fof(14, axiom,isPrime0(xp),file('/tmp/SRASS.s.p', m__3025)).
% fof(44, conjecture,(doDivides0(xp,sdtasdt0(xn,xn))&doDivides0(xp,xn)),file('/tmp/SRASS.s.p', m__)).
% fof(45, negated_conjecture,~((doDivides0(xp,sdtasdt0(xn,xn))&doDivides0(xp,xn))),inference(assume_negation,[status(cth)],[44])).
% fof(50, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(51, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(73, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(doDivides0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&(![X3]:(~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|doDivides0(X1,X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(74, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(variable_rename,[status(thm)],[73])).
% fof(75, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&X5=sdtasdt0(X4,esk1_2(X4,X5))))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[74])).
% fof(76, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&X5=sdtasdt0(X4,esk1_2(X4,X5)))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[75])).
% fof(77, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk1_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((X5=sdtasdt0(X4,esk1_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[76])).
% cnf(80,plain,(doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|X1!=sdtasdt0(X2,X3)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[77])).
% fof(84, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(isPrime0(X3))|~(doDivides0(X3,sdtasdt0(X1,X2))))|(doDivides0(X3,X1)|doDivides0(X3,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(85, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(isPrime0(X6))|~(doDivides0(X6,sdtasdt0(X4,X5))))|(doDivides0(X6,X4)|doDivides0(X6,X5)))),inference(variable_rename,[status(thm)],[84])).
% cnf(86,plain,(doDivides0(X1,X2)|doDivides0(X1,X3)|~doDivides0(X1,sdtasdt0(X3,X2))|~isPrime0(X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[85])).
% cnf(90,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[11])).
% cnf(91,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[11])).
% cnf(92,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[11])).
% cnf(96,plain,(sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xn,xn)),inference(split_conjunct,[status(thm)],[13])).
% cnf(97,plain,(isPrime0(xp)),inference(split_conjunct,[status(thm)],[14])).
% fof(232, negated_conjecture,(~(doDivides0(xp,sdtasdt0(xn,xn)))|~(doDivides0(xp,xn))),inference(fof_nnf,[status(thm)],[45])).
% cnf(233,negated_conjecture,(~doDivides0(xp,xn)|~doDivides0(xp,sdtasdt0(xn,xn))),inference(split_conjunct,[status(thm)],[232])).
% cnf(249,plain,(aNaturalNumber0(sdtasdt0(xn,xn))|~aNaturalNumber0(sdtasdt0(xm,xm))|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[52,96,theory(equality)])).
% cnf(255,plain,(aNaturalNumber0(sdtasdt0(xn,xn))|~aNaturalNumber0(sdtasdt0(xm,xm))|$false),inference(rw,[status(thm)],[249,90,theory(equality)])).
% cnf(256,plain,(aNaturalNumber0(sdtasdt0(xn,xn))|~aNaturalNumber0(sdtasdt0(xm,xm))),inference(cn,[status(thm)],[255,theory(equality)])).
% cnf(372,plain,(doDivides0(xp,X1)|sdtasdt0(xn,xn)!=X1|~aNaturalNumber0(sdtasdt0(xm,xm))|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[80,96,theory(equality)])).
% cnf(381,plain,(doDivides0(xp,X1)|sdtasdt0(xn,xn)!=X1|~aNaturalNumber0(sdtasdt0(xm,xm))|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[372,90,theory(equality)])).
% cnf(382,plain,(doDivides0(xp,X1)|sdtasdt0(xn,xn)!=X1|~aNaturalNumber0(sdtasdt0(xm,xm))|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[381,theory(equality)])).
% cnf(826,plain,(aNaturalNumber0(sdtasdt0(xn,xn))|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[256,52,theory(equality)])).
% cnf(831,plain,(aNaturalNumber0(sdtasdt0(xn,xn))|$false),inference(rw,[status(thm)],[826,91,theory(equality)])).
% cnf(832,plain,(aNaturalNumber0(sdtasdt0(xn,xn))),inference(cn,[status(thm)],[831,theory(equality)])).
% cnf(2673,plain,(doDivides0(xp,X1)|sdtasdt0(xn,xn)!=X1|~aNaturalNumber0(X1)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[382,52,theory(equality)])).
% cnf(2678,plain,(doDivides0(xp,X1)|sdtasdt0(xn,xn)!=X1|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[2673,91,theory(equality)])).
% cnf(2679,plain,(doDivides0(xp,X1)|sdtasdt0(xn,xn)!=X1|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[2678,theory(equality)])).
% cnf(2772,plain,(doDivides0(xp,sdtasdt0(xn,xn))|~aNaturalNumber0(sdtasdt0(xn,xn))),inference(er,[status(thm)],[2679,theory(equality)])).
% cnf(2775,plain,(doDivides0(xp,sdtasdt0(xn,xn))|$false),inference(rw,[status(thm)],[2772,832,theory(equality)])).
% cnf(2776,plain,(doDivides0(xp,sdtasdt0(xn,xn))),inference(cn,[status(thm)],[2775,theory(equality)])).
% cnf(2788,plain,(doDivides0(xp,xn)|~isPrime0(xp)|~aNaturalNumber0(xn)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[86,2776,theory(equality)])).
% cnf(2791,negated_conjecture,($false|~doDivides0(xp,xn)),inference(rw,[status(thm)],[233,2776,theory(equality)])).
% cnf(2792,negated_conjecture,(~doDivides0(xp,xn)),inference(cn,[status(thm)],[2791,theory(equality)])).
% cnf(2815,plain,(doDivides0(xp,xn)|$false|~aNaturalNumber0(xn)|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[2788,97,theory(equality)])).
% cnf(2816,plain,(doDivides0(xp,xn)|$false|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[2815,92,theory(equality)])).
% cnf(2817,plain,(doDivides0(xp,xn)|$false|$false|$false),inference(rw,[status(thm)],[2816,90,theory(equality)])).
% cnf(2818,plain,(doDivides0(xp,xn)),inference(cn,[status(thm)],[2817,theory(equality)])).
% cnf(3010,plain,($false),inference(sr,[status(thm)],[2818,2792,theory(equality)])).
% cnf(3011,plain,($false),3010,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 374
% # ...of these trivial : 7
% # ...subsumed : 111
% # ...remaining for further processing: 256
% # Other redundant clauses eliminated : 26
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 7
% # Generated clauses : 1100
% # ...of the previous two non-trivial : 875
% # Contextual simplify-reflections : 35
% # Paramodulations : 1044
% # Factorizations : 2
% # Equation resolutions : 54
% # Current number of processed clauses: 166
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 130
% # Current number of unprocessed clauses: 592
% # ...number of literals in the above : 2875
% # Clause-clause subsumption calls (NU) : 1183
% # Rec. Clause-clause subsumption calls : 687
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 141 leaves, 1.30+/-0.967 terms/leaf
% # Paramod-from index: 92 leaves, 1.07+/-0.288 terms/leaf
% # Paramod-into index: 124 leaves, 1.18+/-0.794 terms/leaf
% # -------------------------------------------------
% # User time : 0.071 s
% # System time : 0.003 s
% # Total time : 0.074 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.28 WC
% FINAL PrfWatch: 0.21 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP4715/NUM523+1.tptp
%
%------------------------------------------------------------------------------