TSTP Solution File: NUM557+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM557+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 : art06.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 20:05:53 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP15709/NUM557+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15709/NUM557+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15709/NUM557+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 15805
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.027 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(33, axiom,((![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xS))&aSubsetOf0(xP,xS))&sbrdtbr0(xP)=xk),file('/tmp/SRASS.s.p', m__2431)).
% fof(73, conjecture,(((![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xS))|aSubsetOf0(xP,xS))&sbrdtbr0(xP)=xk)|aElementOf0(xP,slbdtsldtrb0(xS,xk))),file('/tmp/SRASS.s.p', m__)).
% fof(74, negated_conjecture,~((((![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xS))|aSubsetOf0(xP,xS))&sbrdtbr0(xP)=xk)|aElementOf0(xP,slbdtsldtrb0(xS,xk)))),inference(assume_negation,[status(cth)],[73])).
% fof(278, plain,((![X1]:(~(aElementOf0(X1,xP))|aElementOf0(X1,xS))&aSubsetOf0(xP,xS))&sbrdtbr0(xP)=xk),inference(fof_nnf,[status(thm)],[33])).
% fof(279, plain,((![X2]:(~(aElementOf0(X2,xP))|aElementOf0(X2,xS))&aSubsetOf0(xP,xS))&sbrdtbr0(xP)=xk),inference(variable_rename,[status(thm)],[278])).
% fof(280, plain,![X2]:(((~(aElementOf0(X2,xP))|aElementOf0(X2,xS))&aSubsetOf0(xP,xS))&sbrdtbr0(xP)=xk),inference(shift_quantors,[status(thm)],[279])).
% cnf(281,plain,(sbrdtbr0(xP)=xk),inference(split_conjunct,[status(thm)],[280])).
% cnf(282,plain,(aSubsetOf0(xP,xS)),inference(split_conjunct,[status(thm)],[280])).
% fof(437, negated_conjecture,(((?[X1]:(aElementOf0(X1,xP)&~(aElementOf0(X1,xS)))&~(aSubsetOf0(xP,xS)))|~(sbrdtbr0(xP)=xk))&~(aElementOf0(xP,slbdtsldtrb0(xS,xk)))),inference(fof_nnf,[status(thm)],[74])).
% fof(438, negated_conjecture,(((?[X2]:(aElementOf0(X2,xP)&~(aElementOf0(X2,xS)))&~(aSubsetOf0(xP,xS)))|~(sbrdtbr0(xP)=xk))&~(aElementOf0(xP,slbdtsldtrb0(xS,xk)))),inference(variable_rename,[status(thm)],[437])).
% fof(439, negated_conjecture,((((aElementOf0(esk16_0,xP)&~(aElementOf0(esk16_0,xS)))&~(aSubsetOf0(xP,xS)))|~(sbrdtbr0(xP)=xk))&~(aElementOf0(xP,slbdtsldtrb0(xS,xk)))),inference(skolemize,[status(esa)],[438])).
% fof(440, negated_conjecture,((((aElementOf0(esk16_0,xP)|~(sbrdtbr0(xP)=xk))&(~(aElementOf0(esk16_0,xS))|~(sbrdtbr0(xP)=xk)))&(~(aSubsetOf0(xP,xS))|~(sbrdtbr0(xP)=xk)))&~(aElementOf0(xP,slbdtsldtrb0(xS,xk)))),inference(distribute,[status(thm)],[439])).
% cnf(442,negated_conjecture,(sbrdtbr0(xP)!=xk|~aSubsetOf0(xP,xS)),inference(split_conjunct,[status(thm)],[440])).
% cnf(448,negated_conjecture,($false|~aSubsetOf0(xP,xS)),inference(rw,[status(thm)],[442,281,theory(equality)])).
% cnf(449,negated_conjecture,($false|$false),inference(rw,[status(thm)],[448,282,theory(equality)])).
% cnf(450,negated_conjecture,($false),inference(cn,[status(thm)],[449,theory(equality)])).
% cnf(451,negated_conjecture,($false),450,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 12
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 160
% # ...number of literals in the above : 550
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # 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: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 16 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.005 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP15709/NUM557+3.tptp
%
%------------------------------------------------------------------------------