%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU245+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 : art02.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:26:26 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP5341/SEU245+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5341/SEU245+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5341/SEU245+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 5437
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(relation(X1)=>![X2]:relation_restriction(X1,X2)=set_intersection2(X1,cartesian_product2(X2,X2))),file('/tmp/SRASS.s.p', d6_wellord1)).
% fof(8, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(13, axiom,![X1]:![X2]:![X3]:(X3=set_intersection2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&in(X4,X2)))),file('/tmp/SRASS.s.p', d3_xboole_0)).
% fof(26, conjecture,![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_restriction(X3,X2))<=>(in(X1,X3)&in(X1,cartesian_product2(X2,X2))))),file('/tmp/SRASS.s.p', t16_wellord1)).
% fof(27, negated_conjecture,~(![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_restriction(X3,X2))<=>(in(X1,X3)&in(X1,cartesian_product2(X2,X2)))))),inference(assume_negation,[status(cth)],[26])).
% fof(36, plain,![X1]:(~(relation(X1))|![X2]:relation_restriction(X1,X2)=set_intersection2(X1,cartesian_product2(X2,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(37, plain,![X3]:(~(relation(X3))|![X4]:relation_restriction(X3,X4)=set_intersection2(X3,cartesian_product2(X4,X4))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X3]:![X4]:(relation_restriction(X3,X4)=set_intersection2(X3,cartesian_product2(X4,X4))|~(relation(X3))),inference(shift_quantors,[status(thm)],[37])).
% cnf(39,plain,(relation_restriction(X1,X2)=set_intersection2(X1,cartesian_product2(X2,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(52, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(53,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(68, plain,![X1]:![X2]:![X3]:((~(X3=set_intersection2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&in(X4,X2)))&((~(in(X4,X1))|~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)&in(X4,X2))))|X3=set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(69, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)&in(X9,X6))))|X7=set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|~(in(esk6_3(X5,X6,X7),X6))))&(in(esk6_3(X5,X6,X7),X7)|(in(esk6_3(X5,X6,X7),X5)&in(esk6_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[69])).
% fof(71, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&(((~(in(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|~(in(esk6_3(X5,X6,X7),X6))))&(in(esk6_3(X5,X6,X7),X7)|(in(esk6_3(X5,X6,X7),X5)&in(esk6_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[70])).
% fof(72, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&((in(X8,X6)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6))))&(((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))|~(X7=set_intersection2(X5,X6))))&(((~(in(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|~(in(esk6_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk6_3(X5,X6,X7),X5)|in(esk6_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk6_3(X5,X6,X7),X6)|in(esk6_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[71])).
% cnf(76,plain,(in(X4,X1)|X1!=set_intersection2(X2,X3)|~in(X4,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[72])).
% cnf(77,plain,(in(X4,X3)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(109, negated_conjecture,?[X1]:?[X2]:?[X3]:(relation(X3)&((~(in(X1,relation_restriction(X3,X2)))|(~(in(X1,X3))|~(in(X1,cartesian_product2(X2,X2)))))&(in(X1,relation_restriction(X3,X2))|(in(X1,X3)&in(X1,cartesian_product2(X2,X2)))))),inference(fof_nnf,[status(thm)],[27])).
% fof(110, negated_conjecture,?[X4]:?[X5]:?[X6]:(relation(X6)&((~(in(X4,relation_restriction(X6,X5)))|(~(in(X4,X6))|~(in(X4,cartesian_product2(X5,X5)))))&(in(X4,relation_restriction(X6,X5))|(in(X4,X6)&in(X4,cartesian_product2(X5,X5)))))),inference(variable_rename,[status(thm)],[109])).
% fof(111, negated_conjecture,(relation(esk10_0)&((~(in(esk8_0,relation_restriction(esk10_0,esk9_0)))|(~(in(esk8_0,esk10_0))|~(in(esk8_0,cartesian_product2(esk9_0,esk9_0)))))&(in(esk8_0,relation_restriction(esk10_0,esk9_0))|(in(esk8_0,esk10_0)&in(esk8_0,cartesian_product2(esk9_0,esk9_0)))))),inference(skolemize,[status(esa)],[110])).
% fof(112, negated_conjecture,(relation(esk10_0)&((~(in(esk8_0,relation_restriction(esk10_0,esk9_0)))|(~(in(esk8_0,esk10_0))|~(in(esk8_0,cartesian_product2(esk9_0,esk9_0)))))&((in(esk8_0,esk10_0)|in(esk8_0,relation_restriction(esk10_0,esk9_0)))&(in(esk8_0,cartesian_product2(esk9_0,esk9_0))|in(esk8_0,relation_restriction(esk10_0,esk9_0)))))),inference(distribute,[status(thm)],[111])).
% cnf(113,negated_conjecture,(in(esk8_0,relation_restriction(esk10_0,esk9_0))|in(esk8_0,cartesian_product2(esk9_0,esk9_0))),inference(split_conjunct,[status(thm)],[112])).
% cnf(114,negated_conjecture,(in(esk8_0,relation_restriction(esk10_0,esk9_0))|in(esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[112])).
% cnf(115,negated_conjecture,(~in(esk8_0,cartesian_product2(esk9_0,esk9_0))|~in(esk8_0,esk10_0)|~in(esk8_0,relation_restriction(esk10_0,esk9_0))),inference(split_conjunct,[status(thm)],[112])).
% cnf(116,negated_conjecture,(relation(esk10_0)),inference(split_conjunct,[status(thm)],[112])).
% cnf(128,plain,(set_intersection2(cartesian_product2(X2,X2),X1)=relation_restriction(X1,X2)|~relation(X1)),inference(spm,[status(thm)],[39,53,theory(equality)])).
% cnf(139,plain,(in(X1,X2)|~in(X1,set_intersection2(X3,X2))),inference(er,[status(thm)],[77,theory(equality)])).
% cnf(155,plain,(in(X1,X2)|relation_restriction(X3,X4)!=X2|~in(X1,cartesian_product2(X4,X4))|~in(X1,X3)|~relation(X3)),inference(spm,[status(thm)],[76,39,theory(equality)])).
% cnf(226,plain,(in(X1,cartesian_product2(X2,X2))|~in(X1,relation_restriction(X3,X2))|~relation(X3)),inference(spm,[status(thm)],[139,39,theory(equality)])).
% cnf(247,plain,(in(X1,X2)|~in(X1,relation_restriction(X2,X3))|~relation(X2)),inference(spm,[status(thm)],[139,128,theory(equality)])).
% cnf(311,negated_conjecture,(in(esk8_0,esk10_0)|~relation(esk10_0)),inference(spm,[status(thm)],[247,114,theory(equality)])).
% cnf(320,negated_conjecture,(in(esk8_0,esk10_0)|$false),inference(rw,[status(thm)],[311,116,theory(equality)])).
% cnf(321,negated_conjecture,(in(esk8_0,esk10_0)),inference(cn,[status(thm)],[320,theory(equality)])).
% cnf(328,negated_conjecture,(~in(esk8_0,relation_restriction(esk10_0,esk9_0))|~in(esk8_0,cartesian_product2(esk9_0,esk9_0))|$false),inference(rw,[status(thm)],[115,321,theory(equality)])).
% cnf(329,negated_conjecture,(~in(esk8_0,relation_restriction(esk10_0,esk9_0))|~in(esk8_0,cartesian_product2(esk9_0,esk9_0))),inference(cn,[status(thm)],[328,theory(equality)])).
% cnf(418,negated_conjecture,(in(esk8_0,X1)|in(esk8_0,relation_restriction(esk10_0,esk9_0))|relation_restriction(X2,esk9_0)!=X1|~relation(X2)|~in(esk8_0,X2)),inference(spm,[status(thm)],[155,113,theory(equality)])).
% cnf(705,negated_conjecture,(in(esk8_0,relation_restriction(esk10_0,esk9_0))|in(esk8_0,relation_restriction(X1,esk9_0))|~relation(X1)|~in(esk8_0,X1)),inference(er,[status(thm)],[418,theory(equality)])).
% cnf(716,negated_conjecture,(in(esk8_0,relation_restriction(esk10_0,esk9_0))|~relation(esk10_0)),inference(spm,[status(thm)],[705,321,theory(equality)])).
% cnf(719,negated_conjecture,(in(esk8_0,relation_restriction(esk10_0,esk9_0))|$false),inference(rw,[status(thm)],[716,116,theory(equality)])).
% cnf(720,negated_conjecture,(in(esk8_0,relation_restriction(esk10_0,esk9_0))),inference(cn,[status(thm)],[719,theory(equality)])).
% cnf(724,negated_conjecture,(in(esk8_0,cartesian_product2(esk9_0,esk9_0))|~relation(esk10_0)),inference(spm,[status(thm)],[226,720,theory(equality)])).
% cnf(733,negated_conjecture,($false|~in(esk8_0,cartesian_product2(esk9_0,esk9_0))),inference(rw,[status(thm)],[329,720,theory(equality)])).
% cnf(734,negated_conjecture,(~in(esk8_0,cartesian_product2(esk9_0,esk9_0))),inference(cn,[status(thm)],[733,theory(equality)])).
% cnf(736,negated_conjecture,(in(esk8_0,cartesian_product2(esk9_0,esk9_0))|$false),inference(rw,[status(thm)],[724,116,theory(equality)])).
% cnf(737,negated_conjecture,(in(esk8_0,cartesian_product2(esk9_0,esk9_0))),inference(cn,[status(thm)],[736,theory(equality)])).
% cnf(764,negated_conjecture,($false),inference(sr,[status(thm)],[737,734,theory(equality)])).
% cnf(765,negated_conjecture,($false),764,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 284
% # ...of these trivial : 5
% # ...subsumed : 129
% # ...remaining for further processing: 150
% # Other redundant clauses eliminated : 12
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 16
% # Generated clauses : 479
% # ...of the previous two non-trivial : 389
% # Contextual simplify-reflections : 45
% # Paramodulations : 454
% # Factorizations : 4
% # Equation resolutions : 21
% # Current number of processed clauses: 95
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 8
% # Non-unit-clauses : 68
% # Current number of unprocessed clauses: 161
% # ...number of literals in the above : 556
% # Clause-clause subsumption calls (NU) : 1066
% # Rec. Clause-clause subsumption calls : 965
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 65 leaves, 1.54+/-1.241 terms/leaf
% # Paramod-from index: 34 leaves, 1.21+/-0.758 terms/leaf
% # Paramod-into index: 62 leaves, 1.44+/-1.057 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.006 s
% # Total time : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP5341/SEU245+1.tptp
%
%------------------------------------------------------------------------------