%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU264+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 02:42:01 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP18128/SEU264+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18128/SEU264+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18128/SEU264+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 18224
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(3, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:![X4]:(relation_of2_as_subset(X4,X3,X1)=>(subset(relation_rng(X4),X2)=>relation_of2_as_subset(X4,X3,X2))),file('/tmp/SRASS.s.p', t14_relset_1)).
% fof(8, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)=>(subset(relation_dom(X3),X1)&subset(relation_rng(X3),X2))),file('/tmp/SRASS.s.p', t12_relset_1)).
% fof(18, conjecture,![X1]:![X2]:![X3]:![X4]:(relation_of2_as_subset(X4,X3,X1)=>(subset(X1,X2)=>relation_of2_as_subset(X4,X3,X2))),file('/tmp/SRASS.s.p', t16_relset_1)).
% fof(19, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(relation_of2_as_subset(X4,X3,X1)=>(subset(X1,X2)=>relation_of2_as_subset(X4,X3,X2)))),inference(assume_negation,[status(cth)],[18])).
% fof(23, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(26, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:![X2]:![X3]:![X4]:(~(relation_of2_as_subset(X4,X3,X1))|(~(subset(relation_rng(X4),X2))|relation_of2_as_subset(X4,X3,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(29, plain,![X5]:![X6]:![X7]:![X8]:(~(relation_of2_as_subset(X8,X7,X5))|(~(subset(relation_rng(X8),X6))|relation_of2_as_subset(X8,X7,X6))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(relation_of2_as_subset(X1,X2,X3)|~subset(relation_rng(X1),X3)|~relation_of2_as_subset(X1,X2,X4)),inference(split_conjunct,[status(thm)],[29])).
% fof(41, plain,![X1]:![X2]:![X3]:(~(relation_of2_as_subset(X3,X1,X2))|(subset(relation_dom(X3),X1)&subset(relation_rng(X3),X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(42, plain,![X4]:![X5]:![X6]:(~(relation_of2_as_subset(X6,X4,X5))|(subset(relation_dom(X6),X4)&subset(relation_rng(X6),X5))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:((subset(relation_dom(X6),X4)|~(relation_of2_as_subset(X6,X4,X5)))&(subset(relation_rng(X6),X5)|~(relation_of2_as_subset(X6,X4,X5)))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(subset(relation_rng(X1),X3)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(62, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(relation_of2_as_subset(X4,X3,X1)&(subset(X1,X2)&~(relation_of2_as_subset(X4,X3,X2)))),inference(fof_nnf,[status(thm)],[19])).
% fof(63, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(relation_of2_as_subset(X8,X7,X5)&(subset(X5,X6)&~(relation_of2_as_subset(X8,X7,X6)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(relation_of2_as_subset(esk7_0,esk6_0,esk4_0)&(subset(esk4_0,esk5_0)&~(relation_of2_as_subset(esk7_0,esk6_0,esk5_0)))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~relation_of2_as_subset(esk7_0,esk6_0,esk5_0)),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[64])).
% cnf(67,negated_conjecture,(relation_of2_as_subset(esk7_0,esk6_0,esk4_0)),inference(split_conjunct,[status(thm)],[64])).
% cnf(68,negated_conjecture,(subset(X1,esk5_0)|~subset(X1,esk4_0)),inference(spm,[status(thm)],[27,66,theory(equality)])).
% cnf(74,negated_conjecture,(subset(relation_rng(esk7_0),esk4_0)),inference(spm,[status(thm)],[44,67,theory(equality)])).
% cnf(86,negated_conjecture,(subset(X1,esk5_0)|~subset(X1,X2)|~subset(X2,esk4_0)),inference(spm,[status(thm)],[27,68,theory(equality)])).
% cnf(161,negated_conjecture,(subset(X1,esk5_0)|~subset(X1,relation_rng(esk7_0))),inference(spm,[status(thm)],[86,74,theory(equality)])).
% cnf(170,negated_conjecture,(subset(relation_rng(esk7_0),esk5_0)),inference(spm,[status(thm)],[161,24,theory(equality)])).
% cnf(172,negated_conjecture,(relation_of2_as_subset(esk7_0,X1,esk5_0)|~relation_of2_as_subset(esk7_0,X1,X2)),inference(spm,[status(thm)],[30,170,theory(equality)])).
% cnf(182,negated_conjecture,(relation_of2_as_subset(esk7_0,esk6_0,esk5_0)),inference(spm,[status(thm)],[172,67,theory(equality)])).
% cnf(184,negated_conjecture,($false),inference(sr,[status(thm)],[182,65,theory(equality)])).
% cnf(185,negated_conjecture,($false),184,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 1
% # ...subsumed : 2
% # ...remaining for further processing: 74
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 107
% # ...of the previous two non-trivial : 94
% # Contextual simplify-reflections : 0
% # Paramodulations : 107
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 57
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 22
% # Current number of unprocessed clauses: 51
% # ...number of literals in the above : 96
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 13
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 89 leaves, 1.18+/-0.628 terms/leaf
% # Paramod-from index: 38 leaves, 1.03+/-0.160 terms/leaf
% # Paramod-into index: 84 leaves, 1.08+/-0.317 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.005 s
% # Total time : 0.018 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/SystemOnTPTP18128/SEU264+1.tptp
%
%------------------------------------------------------------------------------