TSTP Solution File: SEU121+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU121+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:09:59 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP16053/SEU121+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP16053/SEU121+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16053/SEU121+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 16149
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(20, conjecture,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(21, negated_conjecture,~(![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3))),inference(assume_negation,[status(cth)],[20])).
% fof(29, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(30, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(36,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(100, negated_conjecture,?[X1]:?[X2]:?[X3]:((subset(X1,X2)&subset(X2,X3))&~(subset(X1,X3))),inference(fof_nnf,[status(thm)],[21])).
% fof(101, negated_conjecture,?[X4]:?[X5]:?[X6]:((subset(X4,X5)&subset(X5,X6))&~(subset(X4,X6))),inference(variable_rename,[status(thm)],[100])).
% fof(102, negated_conjecture,((subset(esk8_0,esk9_0)&subset(esk9_0,esk10_0))&~(subset(esk8_0,esk10_0))),inference(skolemize,[status(esa)],[101])).
% cnf(103,negated_conjecture,(~subset(esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[102])).
% cnf(104,negated_conjecture,(subset(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[102])).
% cnf(105,negated_conjecture,(subset(esk8_0,esk9_0)),inference(split_conjunct,[status(thm)],[102])).
% cnf(126,negated_conjecture,(in(X1,esk10_0)|~in(X1,esk9_0)),inference(spm,[status(thm)],[36,104,theory(equality)])).
% cnf(127,negated_conjecture,(in(X1,esk9_0)|~in(X1,esk8_0)),inference(spm,[status(thm)],[36,105,theory(equality)])).
% cnf(198,negated_conjecture,(subset(X1,esk10_0)|~in(esk1_2(X1,esk10_0),esk9_0)),inference(spm,[status(thm)],[34,126,theory(equality)])).
% cnf(342,negated_conjecture,(subset(X1,esk10_0)|~in(esk1_2(X1,esk10_0),esk8_0)),inference(spm,[status(thm)],[198,127,theory(equality)])).
% cnf(349,negated_conjecture,(subset(esk8_0,esk10_0)),inference(spm,[status(thm)],[342,35,theory(equality)])).
% cnf(350,negated_conjecture,($false),inference(sr,[status(thm)],[349,103,theory(equality)])).
% cnf(351,negated_conjecture,($false),350,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 149
% # ...of these trivial : 2
% # ...subsumed : 38
% # ...remaining for further processing: 109
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 210
% # ...of the previous two non-trivial : 181
% # Contextual simplify-reflections : 2
% # Paramodulations : 200
% # Factorizations : 4
% # Equation resolutions : 6
% # Current number of processed clauses: 76
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 10
% # Non-unit-clauses : 54
% # Current number of unprocessed clauses: 95
% # ...number of literals in the above : 269
% # Clause-clause subsumption calls (NU) : 139
% # Rec. Clause-clause subsumption calls : 133
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 58 leaves, 1.36+/-1.012 terms/leaf
% # Paramod-from index: 22 leaves, 1.27+/-0.617 terms/leaf
% # Paramod-into index: 55 leaves, 1.31+/-0.828 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP16053/SEU121+2.tptp
%
%------------------------------------------------------------------------------