TSTP Solution File: NUM606+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM606+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 : art02.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:36:06 EST 2010
% Result : Theorem 13.73s
% Output : Solution 13.73s
% 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/SystemOnTPTP10866/NUM606+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10866/NUM606+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10866/NUM606+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 10962
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.92 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.91 CPU 6.03 WC
% PrfWatch: 7.90 CPU 8.04 WC
% PrfWatch: 9.90 CPU 10.04 WC
% # Preprocessing time : 0.617 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.89 CPU 12.04 WC
% # SZS output start CNFRefutation.
% fof(59, axiom,(((aSet0(xS)&![X1]:(aElementOf0(X1,xS)=>aElementOf0(X1,szNzAzT0)))&aSubsetOf0(xS,szNzAzT0))&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(82, axiom,(![X1]:(aElementOf0(X1,xO)=>aElementOf0(X1,xS))&aSubsetOf0(xO,xS)),file('/tmp/SRASS.s.p', m__4998)).
% fof(83, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),file('/tmp/SRASS.s.p', m__5078)).
% fof(101, conjecture,(![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,szNzAzT0))|aSubsetOf0(xQ,szNzAzT0)),file('/tmp/SRASS.s.p', m__)).
% fof(102, negated_conjecture,~((![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,szNzAzT0))|aSubsetOf0(xQ,szNzAzT0))),inference(assume_negation,[status(cth)],[101])).
% fof(398, plain,(((aSet0(xS)&![X1]:(~(aElementOf0(X1,xS))|aElementOf0(X1,szNzAzT0)))&aSubsetOf0(xS,szNzAzT0))&isCountable0(xS)),inference(fof_nnf,[status(thm)],[59])).
% fof(399, plain,(((aSet0(xS)&![X2]:(~(aElementOf0(X2,xS))|aElementOf0(X2,szNzAzT0)))&aSubsetOf0(xS,szNzAzT0))&isCountable0(xS)),inference(variable_rename,[status(thm)],[398])).
% fof(400, plain,![X2]:((((~(aElementOf0(X2,xS))|aElementOf0(X2,szNzAzT0))&aSet0(xS))&aSubsetOf0(xS,szNzAzT0))&isCountable0(xS)),inference(shift_quantors,[status(thm)],[399])).
% cnf(404,plain,(aElementOf0(X1,szNzAzT0)|~aElementOf0(X1,xS)),inference(split_conjunct,[status(thm)],[400])).
% fof(4573, plain,(![X1]:(~(aElementOf0(X1,xO))|aElementOf0(X1,xS))&aSubsetOf0(xO,xS)),inference(fof_nnf,[status(thm)],[82])).
% fof(4574, plain,(![X2]:(~(aElementOf0(X2,xO))|aElementOf0(X2,xS))&aSubsetOf0(xO,xS)),inference(variable_rename,[status(thm)],[4573])).
% fof(4575, plain,![X2]:((~(aElementOf0(X2,xO))|aElementOf0(X2,xS))&aSubsetOf0(xO,xS)),inference(shift_quantors,[status(thm)],[4574])).
% cnf(4577,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,xO)),inference(split_conjunct,[status(thm)],[4575])).
% fof(4578, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(fof_nnf,[status(thm)],[83])).
% fof(4579, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(variable_rename,[status(thm)],[4578])).
% fof(4580, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xO))&aSet0(xQ))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(shift_quantors,[status(thm)],[4579])).
% cnf(4585,plain,(aElementOf0(X1,xO)|~aElementOf0(X1,xQ)),inference(split_conjunct,[status(thm)],[4580])).
% fof(4662, negated_conjecture,(?[X1]:(aElementOf0(X1,xQ)&~(aElementOf0(X1,szNzAzT0)))&~(aSubsetOf0(xQ,szNzAzT0))),inference(fof_nnf,[status(thm)],[102])).
% fof(4663, negated_conjecture,(?[X2]:(aElementOf0(X2,xQ)&~(aElementOf0(X2,szNzAzT0)))&~(aSubsetOf0(xQ,szNzAzT0))),inference(variable_rename,[status(thm)],[4662])).
% fof(4664, negated_conjecture,((aElementOf0(esk40_0,xQ)&~(aElementOf0(esk40_0,szNzAzT0)))&~(aSubsetOf0(xQ,szNzAzT0))),inference(skolemize,[status(esa)],[4663])).
% cnf(4666,negated_conjecture,(~aElementOf0(esk40_0,szNzAzT0)),inference(split_conjunct,[status(thm)],[4664])).
% cnf(4667,negated_conjecture,(aElementOf0(esk40_0,xQ)),inference(split_conjunct,[status(thm)],[4664])).
% cnf(8423,negated_conjecture,(~aElementOf0(esk40_0,xS)),inference(spm,[status(thm)],[4666,404,theory(equality)])).
% cnf(79811,negated_conjecture,(~aElementOf0(esk40_0,xO)),inference(spm,[status(thm)],[8423,4577,theory(equality)])).
% cnf(80182,negated_conjecture,(~aElementOf0(esk40_0,xQ)),inference(spm,[status(thm)],[79811,4585,theory(equality)])).
% cnf(80183,negated_conjecture,($false),inference(rw,[status(thm)],[80182,4667,theory(equality)])).
% cnf(80184,negated_conjecture,($false),inference(cn,[status(thm)],[80183,theory(equality)])).
% cnf(80185,negated_conjecture,($false),80184,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6625
% # ...of these trivial : 3
% # ...subsumed : 542
% # ...remaining for further processing: 6080
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 56472
% # ...of the previous two non-trivial : 47797
% # Contextual simplify-reflections : 3069
% # Paramodulations : 56422
% # Factorizations : 0
% # Equation resolutions : 45
% # Current number of processed clauses: 3045
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 2985
% # Current number of unprocessed clauses: 47755
% # ...number of literals in the above : 714328
% # Clause-clause subsumption calls (NU) : 1648272
% # Rec. Clause-clause subsumption calls : 44835
% # Unit Clause-clause subsumption calls : 15328
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 364 leaves, 2.28+/-2.934 terms/leaf
% # Paramod-from index: 161 leaves, 1.01+/-0.111 terms/leaf
% # Paramod-into index: 320 leaves, 1.63+/-1.582 terms/leaf
% # -------------------------------------------------
% # User time : 9.718 s
% # System time : 0.184 s
% # Total time : 9.901 s
% # Maximum resident set size: 0 pages
% PrfWatch: 12.65 CPU 12.80 WC
% FINAL PrfWatch: 12.65 CPU 12.80 WC
% SZS output end Solution for /tmp/SystemOnTPTP10866/NUM606+3.tptp
%
%------------------------------------------------------------------------------