TSTP Solution File: SEU163+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU163+2 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:22:40 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP21170/SEU163+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21170/SEU163+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21170/SEU163+2.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 21266
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.024 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(in(X1,X2)=>subset(X1,union(X2))),file('/tmp/SRASS.s.p', l50_zfmisc_1)).
% fof(93, conjecture,![X1]:![X2]:(in(X1,X2)=>subset(X1,union(X2))),file('/tmp/SRASS.s.p', t92_zfmisc_1)).
% fof(94, negated_conjecture,~(![X1]:![X2]:(in(X1,X2)=>subset(X1,union(X2)))),inference(assume_negation,[status(cth)],[93])).
% fof(119, plain,![X1]:![X2]:(~(in(X1,X2))|subset(X1,union(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(120, plain,![X3]:![X4]:(~(in(X3,X4))|subset(X3,union(X4))),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(subset(X1,union(X2))|~in(X1,X2)),inference(split_conjunct,[status(thm)],[120])).
% fof(446, negated_conjecture,?[X1]:?[X2]:(in(X1,X2)&~(subset(X1,union(X2)))),inference(fof_nnf,[status(thm)],[94])).
% fof(447, negated_conjecture,?[X3]:?[X4]:(in(X3,X4)&~(subset(X3,union(X4)))),inference(variable_rename,[status(thm)],[446])).
% fof(448, negated_conjecture,(in(esk22_0,esk23_0)&~(subset(esk22_0,union(esk23_0)))),inference(skolemize,[status(esa)],[447])).
% cnf(449,negated_conjecture,(~subset(esk22_0,union(esk23_0))),inference(split_conjunct,[status(thm)],[448])).
% cnf(450,negated_conjecture,(in(esk22_0,esk23_0)),inference(split_conjunct,[status(thm)],[448])).
% cnf(518,negated_conjecture,(~in(esk22_0,esk23_0)),inference(spm,[status(thm)],[449,121,theory(equality)])).
% cnf(519,negated_conjecture,($false),inference(rw,[status(thm)],[518,450,theory(equality)])).
% cnf(520,negated_conjecture,($false),inference(cn,[status(thm)],[519,theory(equality)])).
% cnf(521,negated_conjecture,($false),520,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 160
% # ...of these trivial : 1
% # ...subsumed : 13
% # ...remaining for further processing: 146
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 7
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 6
% # Current number of processed clauses: 10
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 120
% # ...number of literals in the above : 296
% # Clause-clause subsumption calls (NU) : 292
% # Rec. Clause-clause subsumption calls : 236
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 2
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 16
% # Backwards rewriting index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 16 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.006 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP21170/SEU163+2.tptp
%
%------------------------------------------------------------------------------