TSTP Solution File: NUM568+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM568+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 : art01.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:08:38 EST 2010
% Result : Theorem 9.78s
% Output : Solution 9.78s
% 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/SystemOnTPTP26674/NUM568+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26674/NUM568+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26674/NUM568+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 26770
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.94 CPU 4.03 WC
% PrfWatch: 5.53 CPU 6.04 WC
% # Preprocessing time : 0.551 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.17 CPU 8.04 WC
% # SZS output start CNFRefutation.
% fof(11, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>(X1=sz00|?[X2]:(aElementOf0(X2,szNzAzT0)&X1=szszuzczcdt0(X2)))),file('/tmp/SRASS.s.p', mNatExtra)).
% fof(24, axiom,aElementOf0(xK,szNzAzT0),file('/tmp/SRASS.s.p', m__3418)).
% fof(28, axiom,~(xK=sz00),file('/tmp/SRASS.s.p', m__3462)).
% fof(80, conjecture,?[X1]:(aElementOf0(X1,szNzAzT0)&szszuzczcdt0(X1)=xK),file('/tmp/SRASS.s.p', m__)).
% fof(81, negated_conjecture,~(?[X1]:(aElementOf0(X1,szNzAzT0)&szszuzczcdt0(X1)=xK)),inference(assume_negation,[status(cth)],[80])).
% fof(130, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|(X1=sz00|?[X2]:(aElementOf0(X2,szNzAzT0)&X1=szszuzczcdt0(X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(131, plain,![X3]:(~(aElementOf0(X3,szNzAzT0))|(X3=sz00|?[X4]:(aElementOf0(X4,szNzAzT0)&X3=szszuzczcdt0(X4)))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X3]:(~(aElementOf0(X3,szNzAzT0))|(X3=sz00|(aElementOf0(esk2_1(X3),szNzAzT0)&X3=szszuzczcdt0(esk2_1(X3))))),inference(skolemize,[status(esa)],[131])).
% fof(133, plain,![X3]:(((aElementOf0(esk2_1(X3),szNzAzT0)|X3=sz00)|~(aElementOf0(X3,szNzAzT0)))&((X3=szszuzczcdt0(esk2_1(X3))|X3=sz00)|~(aElementOf0(X3,szNzAzT0)))),inference(distribute,[status(thm)],[132])).
% cnf(134,plain,(X1=sz00|X1=szszuzczcdt0(esk2_1(X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[133])).
% cnf(135,plain,(X1=sz00|aElementOf0(esk2_1(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[133])).
% cnf(205,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[24])).
% cnf(4207,plain,(xK!=sz00),inference(split_conjunct,[status(thm)],[28])).
% fof(4441, negated_conjecture,![X1]:(~(aElementOf0(X1,szNzAzT0))|~(szszuzczcdt0(X1)=xK)),inference(fof_nnf,[status(thm)],[81])).
% fof(4442, negated_conjecture,![X2]:(~(aElementOf0(X2,szNzAzT0))|~(szszuzczcdt0(X2)=xK)),inference(variable_rename,[status(thm)],[4441])).
% cnf(4443,negated_conjecture,(szszuzczcdt0(X1)!=xK|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[4442])).
% cnf(6939,negated_conjecture,(sz00=X1|X1!=xK|~aElementOf0(esk2_1(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[4443,134,theory(equality)])).
% cnf(48709,negated_conjecture,(sz00=X1|X1!=xK|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[6939,135])).
% cnf(48722,negated_conjecture,(sz00=xK),inference(spm,[status(thm)],[48709,205,theory(equality)])).
% cnf(48739,negated_conjecture,($false),inference(sr,[status(thm)],[48722,4207,theory(equality)])).
% cnf(48740,negated_conjecture,($false),48739,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5404
% # ...of these trivial : 0
% # ...subsumed : 268
% # ...remaining for further processing: 5136
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 39819
% # ...of the previous two non-trivial : 29482
% # Contextual simplify-reflections : 2463
% # Paramodulations : 39781
% # Factorizations : 0
% # Equation resolutions : 38
% # Current number of processed clauses: 2578
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 2550
% # Current number of unprocessed clauses: 29441
% # ...number of literals in the above : 481749
% # Clause-clause subsumption calls (NU) : 470372
% # Rec. Clause-clause subsumption calls : 38770
% # Unit Clause-clause subsumption calls : 11152
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 220 leaves, 2.32+/-2.766 terms/leaf
% # Paramod-from index: 88 leaves, 1.01+/-0.106 terms/leaf
% # Paramod-into index: 186 leaves, 1.65+/-1.621 terms/leaf
% # -------------------------------------------------
% # User time : 6.467 s
% # System time : 0.146 s
% # Total time : 6.613 s
% # Maximum resident set size: 0 pages
% PrfWatch: 8.60 CPU 9.47 WC
% FINAL PrfWatch: 8.60 CPU 9.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP26674/NUM568+3.tptp
%
%------------------------------------------------------------------------------