TSTP Solution File: RNG125+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG125+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 22:49:18 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP17232/RNG125+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17232/RNG125+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17232/RNG125+4.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 17328
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.026 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(30, axiom,~((((?[X1]:(aElement0(X1)&sdtasdt0(xu,X1)=xa)|doDivides0(xu,xa))|aDivisorOf0(xu,xa))&((?[X1]:(aElement0(X1)&sdtasdt0(xu,X1)=xb)|doDivides0(xu,xb))|aDivisorOf0(xu,xb)))),file('/tmp/SRASS.s.p', m__2383)).
% fof(32, axiom,~(~((?[X1]:(aElement0(X1)&sdtasdt0(xu,X1)=xa)&doDivides0(xu,xa)))),file('/tmp/SRASS.s.p', m__2479)).
% fof(33, axiom,~(~((?[X1]:(aElement0(X1)&sdtasdt0(xu,X1)=xb)&doDivides0(xu,xb)))),file('/tmp/SRASS.s.p', m__2612)).
% fof(294, plain,(((![X1]:(~(aElement0(X1))|~(sdtasdt0(xu,X1)=xa))&~(doDivides0(xu,xa)))&~(aDivisorOf0(xu,xa)))|((![X1]:(~(aElement0(X1))|~(sdtasdt0(xu,X1)=xb))&~(doDivides0(xu,xb)))&~(aDivisorOf0(xu,xb)))),inference(fof_nnf,[status(thm)],[30])).
% fof(295, plain,(((![X2]:(~(aElement0(X2))|~(sdtasdt0(xu,X2)=xa))&~(doDivides0(xu,xa)))&~(aDivisorOf0(xu,xa)))|((![X3]:(~(aElement0(X3))|~(sdtasdt0(xu,X3)=xb))&~(doDivides0(xu,xb)))&~(aDivisorOf0(xu,xb)))),inference(variable_rename,[status(thm)],[294])).
% fof(296, plain,![X2]:![X3]:((((~(aElement0(X3))|~(sdtasdt0(xu,X3)=xb))&~(doDivides0(xu,xb)))&~(aDivisorOf0(xu,xb)))|(((~(aElement0(X2))|~(sdtasdt0(xu,X2)=xa))&~(doDivides0(xu,xa)))&~(aDivisorOf0(xu,xa)))),inference(shift_quantors,[status(thm)],[295])).
% fof(297, plain,![X2]:![X3]:((((((~(aElement0(X2))|~(sdtasdt0(xu,X2)=xa))|(~(aElement0(X3))|~(sdtasdt0(xu,X3)=xb)))&(~(doDivides0(xu,xa))|(~(aElement0(X3))|~(sdtasdt0(xu,X3)=xb))))&(~(aDivisorOf0(xu,xa))|(~(aElement0(X3))|~(sdtasdt0(xu,X3)=xb))))&((((~(aElement0(X2))|~(sdtasdt0(xu,X2)=xa))|~(doDivides0(xu,xb)))&(~(doDivides0(xu,xa))|~(doDivides0(xu,xb))))&(~(aDivisorOf0(xu,xa))|~(doDivides0(xu,xb)))))&((((~(aElement0(X2))|~(sdtasdt0(xu,X2)=xa))|~(aDivisorOf0(xu,xb)))&(~(doDivides0(xu,xa))|~(aDivisorOf0(xu,xb))))&(~(aDivisorOf0(xu,xa))|~(aDivisorOf0(xu,xb))))),inference(distribute,[status(thm)],[296])).
% cnf(302,plain,(~doDivides0(xu,xb)|~doDivides0(xu,xa)),inference(split_conjunct,[status(thm)],[297])).
% fof(312, plain,(?[X1]:(aElement0(X1)&sdtasdt0(xu,X1)=xa)&doDivides0(xu,xa)),inference(fof_nnf,[status(thm)],[32])).
% fof(313, plain,(?[X2]:(aElement0(X2)&sdtasdt0(xu,X2)=xa)&doDivides0(xu,xa)),inference(variable_rename,[status(thm)],[312])).
% fof(314, plain,((aElement0(esk38_0)&sdtasdt0(xu,esk38_0)=xa)&doDivides0(xu,xa)),inference(skolemize,[status(esa)],[313])).
% cnf(315,plain,(doDivides0(xu,xa)),inference(split_conjunct,[status(thm)],[314])).
% fof(318, plain,(?[X1]:(aElement0(X1)&sdtasdt0(xu,X1)=xb)&doDivides0(xu,xb)),inference(fof_nnf,[status(thm)],[33])).
% fof(319, plain,(?[X2]:(aElement0(X2)&sdtasdt0(xu,X2)=xb)&doDivides0(xu,xb)),inference(variable_rename,[status(thm)],[318])).
% fof(320, plain,((aElement0(esk39_0)&sdtasdt0(xu,esk39_0)=xb)&doDivides0(xu,xb)),inference(skolemize,[status(esa)],[319])).
% cnf(321,plain,(doDivides0(xu,xb)),inference(split_conjunct,[status(thm)],[320])).
% cnf(402,plain,($false|~doDivides0(xu,xb)),inference(rw,[status(thm)],[302,315,theory(equality)])).
% cnf(403,plain,(~doDivides0(xu,xb)),inference(cn,[status(thm)],[402,theory(equality)])).
% cnf(409,plain,($false),inference(rw,[status(thm)],[403,321,theory(equality)])).
% cnf(410,plain,($false),inference(cn,[status(thm)],[409,theory(equality)])).
% cnf(411,plain,($false),410,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 199
% # ...of these trivial : 1
% # ...subsumed : 2
% # ...remaining for further processing: 196
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 5
% # Generated clauses : 3
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 187
% # Positive orientable unit clauses: 46
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 137
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 3
% # Clause-clause subsumption calls (NU) : 339
% # Rec. Clause-clause subsumption calls : 147
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 213 leaves, 1.26+/-0.961 terms/leaf
% # Paramod-from index: 121 leaves, 1.06+/-0.267 terms/leaf
% # Paramod-into index: 199 leaves, 1.21+/-0.718 terms/leaf
% # -------------------------------------------------
% # User time : 0.037 s
% # System time : 0.005 s
% # Total time : 0.042 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP17232/RNG125+4.tptp
%
%------------------------------------------------------------------------------