TSTP Solution File: SEU137+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU137+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 : art07.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:13:58 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP17348/SEU137+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17348/SEU137+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17348/SEU137+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 17444
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2),file('/tmp/SRASS.s.p', t12_xboole_1)).
% fof(9, axiom,![X1]:![X2]:set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2),file('/tmp/SRASS.s.p', t39_xboole_1)).
% fof(50, conjecture,![X1]:![X2]:(subset(X1,X2)=>X2=set_union2(X1,set_difference(X2,X1))),file('/tmp/SRASS.s.p', t45_xboole_1)).
% fof(51, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>X2=set_union2(X1,set_difference(X2,X1)))),inference(assume_negation,[status(cth)],[50])).
% fof(72, plain,![X1]:![X2]:(~(subset(X1,X2))|set_union2(X1,X2)=X2),inference(fof_nnf,[status(thm)],[5])).
% fof(73, plain,![X3]:![X4]:(~(subset(X3,X4))|set_union2(X3,X4)=X4),inference(variable_rename,[status(thm)],[72])).
% cnf(74,plain,(set_union2(X1,X2)=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(83, plain,![X3]:![X4]:set_union2(X3,set_difference(X4,X3))=set_union2(X3,X4),inference(variable_rename,[status(thm)],[9])).
% cnf(84,plain,(set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2)),inference(split_conjunct,[status(thm)],[83])).
% fof(231, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&~(X2=set_union2(X1,set_difference(X2,X1)))),inference(fof_nnf,[status(thm)],[51])).
% fof(232, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&~(X4=set_union2(X3,set_difference(X4,X3)))),inference(variable_rename,[status(thm)],[231])).
% fof(233, negated_conjecture,(subset(esk11_0,esk12_0)&~(esk12_0=set_union2(esk11_0,set_difference(esk12_0,esk11_0)))),inference(skolemize,[status(esa)],[232])).
% cnf(234,negated_conjecture,(esk12_0!=set_union2(esk11_0,set_difference(esk12_0,esk11_0))),inference(split_conjunct,[status(thm)],[233])).
% cnf(235,negated_conjecture,(subset(esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[233])).
% cnf(240,negated_conjecture,(set_union2(esk11_0,esk12_0)!=esk12_0),inference(rw,[status(thm)],[234,84,theory(equality)])).
% cnf(260,negated_conjecture,(~subset(esk11_0,esk12_0)),inference(spm,[status(thm)],[240,74,theory(equality)])).
% cnf(265,negated_conjecture,($false),inference(rw,[status(thm)],[260,235,theory(equality)])).
% cnf(266,negated_conjecture,($false),inference(cn,[status(thm)],[265,theory(equality)])).
% cnf(267,negated_conjecture,($false),266,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 93
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 91
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 19
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 0
% # Paramodulations : 17
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 18
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 57
% # ...number of literals in the above : 137
% # Clause-clause subsumption calls (NU) : 87
% # Rec. Clause-clause subsumption calls : 80
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 25
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 23 leaves, 1.13+/-0.448 terms/leaf
% # Paramod-from index: 12 leaves, 1.17+/-0.553 terms/leaf
% # Paramod-into index: 22 leaves, 1.09+/-0.417 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.004 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP17348/SEU137+2.tptp
%
%------------------------------------------------------------------------------