TSTP Solution File: NUM568+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM568+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 : art04.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:32 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP27402/NUM568+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27402/NUM568+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27402/NUM568+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 27498
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(22, axiom,aElementOf0(xK,szNzAzT0),file('/tmp/SRASS.s.p', m__3418)).
% fof(26, 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(188,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[22])).
% cnf(203,plain,(xK!=sz00),inference(split_conjunct,[status(thm)],[26])).
% fof(454, negated_conjecture,![X1]:(~(aElementOf0(X1,szNzAzT0))|~(szszuzczcdt0(X1)=xK)),inference(fof_nnf,[status(thm)],[81])).
% fof(455, negated_conjecture,![X2]:(~(aElementOf0(X2,szNzAzT0))|~(szszuzczcdt0(X2)=xK)),inference(variable_rename,[status(thm)],[454])).
% cnf(456,negated_conjecture,(szszuzczcdt0(X1)!=xK|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[455])).
% cnf(504,negated_conjecture,(sz00=X1|X1!=xK|~aElementOf0(esk2_1(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[456,134,theory(equality)])).
% cnf(1104,negated_conjecture,(sz00=X1|X1!=xK|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[504,135])).
% cnf(1116,negated_conjecture,(sz00=xK),inference(spm,[status(thm)],[1104,188,theory(equality)])).
% cnf(1125,negated_conjecture,($false),inference(sr,[status(thm)],[1116,203,theory(equality)])).
% cnf(1126,negated_conjecture,($false),1125,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 334
% # ...of these trivial : 1
% # ...subsumed : 11
% # ...remaining for further processing: 322
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 499
% # ...of the previous two non-trivial : 453
% # Contextual simplify-reflections : 22
% # Paramodulations : 457
% # Factorizations : 0
% # Equation resolutions : 42
% # Current number of processed clauses: 168
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 142
% # Current number of unprocessed clauses: 422
% # ...number of literals in the above : 2426
% # Clause-clause subsumption calls (NU) : 849
% # Rec. Clause-clause subsumption calls : 299
% # Unit Clause-clause subsumption calls : 63
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 174 leaves, 1.48+/-1.133 terms/leaf
% # Paramod-from index: 75 leaves, 1.01+/-0.115 terms/leaf
% # Paramod-into index: 147 leaves, 1.26+/-0.681 terms/leaf
% # -------------------------------------------------
% # User time : 0.076 s
% # System time : 0.005 s
% # Total time : 0.081 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP27402/NUM568+1.tptp
%
%------------------------------------------------------------------------------