%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU263+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 : 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 02:41:46 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/SystemOnTPTP1726/SEU263+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1726/SEU263+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1726/SEU263+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 1824
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 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]:(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(6, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)<=>relation_of2(X3,X1,X2)),file('/tmp/SRASS.s.p', redefinition_m2_relset_1)).
% fof(7, axiom,![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),file('/tmp/SRASS.s.p', t119_zfmisc_1)).
% fof(8, axiom,![X1]:![X2]:![X3]:(relation_of2(X3,X1,X2)<=>subset(X3,cartesian_product2(X1,X2))),file('/tmp/SRASS.s.p', d1_relset_1)).
% fof(9, axiom,![X1]:(relation(X1)=>subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))),file('/tmp/SRASS.s.p', t21_relat_1)).
% fof(11, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)=>element(X3,powerset(cartesian_product2(X1,X2)))),file('/tmp/SRASS.s.p', dt_m2_relset_1)).
% fof(13, axiom,![X1]:![X2]:![X3]:(element(X3,powerset(cartesian_product2(X1,X2)))=>relation(X3)),file('/tmp/SRASS.s.p', cc1_relset_1)).
% fof(20, conjecture,![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(21, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(relation_of2_as_subset(X4,X3,X1)=>(subset(relation_rng(X4),X2)=>relation_of2_as_subset(X4,X3,X2)))),inference(assume_negation,[status(cth)],[20])).
% fof(25, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(26,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, 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)],[4])).
% fof(31, 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)],[30])).
% fof(32, 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)],[31])).
% cnf(34,plain,(subset(relation_dom(X1),X2)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[32])).
% fof(38, plain,![X1]:![X2]:![X3]:((~(relation_of2_as_subset(X3,X1,X2))|relation_of2(X3,X1,X2))&(~(relation_of2(X3,X1,X2))|relation_of2_as_subset(X3,X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(39, plain,![X4]:![X5]:![X6]:((~(relation_of2_as_subset(X6,X4,X5))|relation_of2(X6,X4,X5))&(~(relation_of2(X6,X4,X5))|relation_of2_as_subset(X6,X4,X5))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3)),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,plain,(relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[39])).
% fof(42, plain,![X1]:![X2]:![X3]:![X4]:((~(subset(X1,X2))|~(subset(X3,X4)))|subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(fof_nnf,[status(thm)],[7])).
% fof(43, plain,![X5]:![X6]:![X7]:![X8]:((~(subset(X5,X6))|~(subset(X7,X8)))|subset(cartesian_product2(X5,X7),cartesian_product2(X6,X8))),inference(variable_rename,[status(thm)],[42])).
% cnf(44,plain,(subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~subset(X2,X4)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X1]:![X2]:![X3]:((~(relation_of2(X3,X1,X2))|subset(X3,cartesian_product2(X1,X2)))&(~(subset(X3,cartesian_product2(X1,X2)))|relation_of2(X3,X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(46, plain,![X4]:![X5]:![X6]:((~(relation_of2(X6,X4,X5))|subset(X6,cartesian_product2(X4,X5)))&(~(subset(X6,cartesian_product2(X4,X5)))|relation_of2(X6,X4,X5))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(relation_of2(X1,X2,X3)|~subset(X1,cartesian_product2(X2,X3))),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,plain,(subset(X1,cartesian_product2(X2,X3))|~relation_of2(X1,X2,X3)),inference(split_conjunct,[status(thm)],[46])).
% fof(49, plain,![X1]:(~(relation(X1))|subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(50, plain,![X2]:(~(relation(X2))|subset(X2,cartesian_product2(relation_dom(X2),relation_rng(X2)))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))|~relation(X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(56, plain,![X1]:![X2]:![X3]:(~(relation_of2_as_subset(X3,X1,X2))|element(X3,powerset(cartesian_product2(X1,X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(57, plain,![X4]:![X5]:![X6]:(~(relation_of2_as_subset(X6,X4,X5))|element(X6,powerset(cartesian_product2(X4,X5)))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[57])).
% fof(62, plain,![X1]:![X2]:![X3]:(~(element(X3,powerset(cartesian_product2(X1,X2))))|relation(X3)),inference(fof_nnf,[status(thm)],[13])).
% fof(63, plain,![X4]:![X5]:![X6]:(~(element(X6,powerset(cartesian_product2(X4,X5))))|relation(X6)),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3)))),inference(split_conjunct,[status(thm)],[63])).
% fof(71, negated_conjecture,?[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)],[21])).
% fof(72, negated_conjecture,?[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)],[71])).
% fof(73, negated_conjecture,(relation_of2_as_subset(esk7_0,esk6_0,esk4_0)&(subset(relation_rng(esk7_0),esk5_0)&~(relation_of2_as_subset(esk7_0,esk6_0,esk5_0)))),inference(skolemize,[status(esa)],[72])).
% cnf(74,negated_conjecture,(~relation_of2_as_subset(esk7_0,esk6_0,esk5_0)),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,negated_conjecture,(subset(relation_rng(esk7_0),esk5_0)),inference(split_conjunct,[status(thm)],[73])).
% cnf(76,negated_conjecture,(relation_of2_as_subset(esk7_0,esk6_0,esk4_0)),inference(split_conjunct,[status(thm)],[73])).
% cnf(90,plain,(subset(X1,cartesian_product2(X2,X3))|~subset(X1,X4)|~relation_of2(X4,X2,X3)),inference(spm,[status(thm)],[29,48,theory(equality)])).
% cnf(95,plain,(relation(X1)|~relation_of2_as_subset(X1,X2,X3)),inference(spm,[status(thm)],[64,58,theory(equality)])).
% cnf(96,plain,(subset(X1,cartesian_product2(X2,X3))|~subset(X1,cartesian_product2(X4,X5))|~subset(X5,X3)|~subset(X4,X2)),inference(spm,[status(thm)],[29,44,theory(equality)])).
% cnf(140,negated_conjecture,(relation(esk7_0)),inference(spm,[status(thm)],[95,76,theory(equality)])).
% cnf(165,plain,(subset(X1,cartesian_product2(X2,X3))|~subset(X1,X4)|~relation_of2_as_subset(X4,X2,X3)),inference(spm,[status(thm)],[90,41,theory(equality)])).
% cnf(294,plain,(subset(X1,cartesian_product2(X2,X3))|~subset(relation_rng(X1),X3)|~subset(relation_dom(X1),X2)|~relation(X1)),inference(spm,[status(thm)],[96,51,theory(equality)])).
% cnf(1640,negated_conjecture,(subset(X1,cartesian_product2(esk6_0,esk4_0))|~subset(X1,esk7_0)),inference(spm,[status(thm)],[165,76,theory(equality)])).
% cnf(1653,negated_conjecture,(relation_of2(X1,esk6_0,esk4_0)|~subset(X1,esk7_0)),inference(spm,[status(thm)],[47,1640,theory(equality)])).
% cnf(1658,negated_conjecture,(relation_of2_as_subset(X1,esk6_0,esk4_0)|~subset(X1,esk7_0)),inference(spm,[status(thm)],[40,1653,theory(equality)])).
% cnf(1661,negated_conjecture,(subset(relation_dom(X1),esk6_0)|~subset(X1,esk7_0)),inference(spm,[status(thm)],[34,1658,theory(equality)])).
% cnf(6095,negated_conjecture,(subset(esk7_0,cartesian_product2(X1,esk5_0))|~relation(esk7_0)|~subset(relation_dom(esk7_0),X1)),inference(spm,[status(thm)],[294,75,theory(equality)])).
% cnf(6322,negated_conjecture,(subset(esk7_0,cartesian_product2(X1,esk5_0))|$false|~subset(relation_dom(esk7_0),X1)),inference(rw,[status(thm)],[6095,140,theory(equality)])).
% cnf(6323,negated_conjecture,(subset(esk7_0,cartesian_product2(X1,esk5_0))|~subset(relation_dom(esk7_0),X1)),inference(cn,[status(thm)],[6322,theory(equality)])).
% cnf(6644,negated_conjecture,(subset(esk7_0,cartesian_product2(esk6_0,esk5_0))|~subset(esk7_0,esk7_0)),inference(spm,[status(thm)],[6323,1661,theory(equality)])).
% cnf(6646,negated_conjecture,(subset(esk7_0,cartesian_product2(esk6_0,esk5_0))|$false),inference(rw,[status(thm)],[6644,26,theory(equality)])).
% cnf(6647,negated_conjecture,(subset(esk7_0,cartesian_product2(esk6_0,esk5_0))),inference(cn,[status(thm)],[6646,theory(equality)])).
% cnf(6652,negated_conjecture,(relation_of2(esk7_0,esk6_0,esk5_0)),inference(spm,[status(thm)],[47,6647,theory(equality)])).
% cnf(6659,negated_conjecture,(relation_of2_as_subset(esk7_0,esk6_0,esk5_0)),inference(spm,[status(thm)],[40,6652,theory(equality)])).
% cnf(6662,negated_conjecture,($false),inference(sr,[status(thm)],[6659,74,theory(equality)])).
% cnf(6663,negated_conjecture,($false),6662,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 651
% # ...of these trivial : 67
% # ...subsumed : 19
% # ...remaining for further processing: 565
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5908
% # ...of the previous two non-trivial : 5712
% # Contextual simplify-reflections : 0
% # Paramodulations : 5908
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 545
% # Positive orientable unit clauses: 403
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 141
% # Current number of unprocessed clauses: 5101
% # ...number of literals in the above : 8368
% # Clause-clause subsumption calls (NU) : 353
% # Rec. Clause-clause subsumption calls : 352
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2313
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 341 leaves, 3.57+/-3.875 terms/leaf
% # Paramod-from index: 122 leaves, 3.88+/-3.808 terms/leaf
% # Paramod-into index: 331 leaves, 3.61+/-3.872 terms/leaf
% # -------------------------------------------------
% # User time : 0.178 s
% # System time : 0.014 s
% # Total time : 0.192 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.46 WC
% FINAL PrfWatch: 0.37 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP1726/SEU263+1.tptp
%
%------------------------------------------------------------------------------