%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU105+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 01:09:10 EST 2010

% Result   : Theorem 124.27s
% Output   : Solution 125.41s
% 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/SystemOnTPTP11892/SEU105+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~t16_finsub_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
%  CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... existence_m1_subset_1:
%  CSA axiom existence_m1_subset_1 found
% Looking for CSA axiom ... rc1_xboole_0:
%  CSA axiom rc1_xboole_0 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rc2_xboole_0:
% t1_subset:
%  CSA axiom t1_subset found
% Looking for CSA axiom ... t2_subset:
%  CSA axiom t2_subset found
% Looking for CSA axiom ... t7_boole:
%  CSA axiom t7_boole found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rc2_xboole_0:
% t5_subset:
%  CSA axiom t5_subset found
% Looking for CSA axiom ... t4_subset:
%  CSA axiom t4_subset found
% Looking for CSA axiom ... rc1_subset_1:
%  CSA axiom rc1_subset_1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rc2_xboole_0:
% rc2_subset_1:
%  CSA axiom rc2_subset_1 found
% Looking for CSA axiom ... commutativity_k3_xboole_0:
%  CSA axiom commutativity_k3_xboole_0 found
% Looking for CSA axiom ... commutativity_k5_xboole_0:
%  CSA axiom commutativity_k5_xboole_0 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rc2_xboole_0:
% idempotence_k3_xboole_0:
%  CSA axiom idempotence_k3_xboole_0 found
% Looking for CSA axiom ... t94_xboole_1:
%  CSA axiom t94_xboole_1 found
% Looking for CSA axiom ... fc10_finset_1:
%  CSA axiom fc10_finset_1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rc2_xboole_0:
% fc11_finset_1:
% fc17_finset_1:
%  CSA axiom fc17_finset_1 found
% Looking for CSA axiom ... t100_xboole_1:
%  CSA axiom t100_xboole_1 found
% Looking for CSA axiom ... t10_finsub_1:
%  CSA axiom t10_finsub_1 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :t10_finsub_1:t100_xboole_1:fc17_finset_1:fc10_finset_1:t94_xboole_1:idempotence_k3_xboole_0:commutativity_k5_xboole_0:commutativity_k3_xboole_0:rc2_subset_1:rc1_subset_1:t4_subset:t5_subset:t7_boole:t2_subset:t1_subset:rc1_xboole_0:existence_m1_subset_1:antisymmetry_r2_hidden (18)
% Unselected axioms are ... :rc2_xboole_0:fc11_finset_1:commutativity_k2_xboole_0:fc1_subset_1:idempotence_k2_xboole_0:t8_boole:cc1_finset_1:rc1_finset_1:fc2_xboole_0:fc3_xboole_0:fc1_xboole_0:d6_xboole_0:rc3_finset_1:rc4_finset_1:rc1_finsub_1:cc1_finsub_1:cc2_finset_1:cc2_finsub_1:reflexivity_r1_tarski:t1_boole:t2_boole:t3_boole:t4_boole:t5_boole:t3_subset:t6_boole:fc12_finset_1:fc9_finset_1:rc2_finset_1 (29)
% SZS status THM for /tmp/SystemOnTPTP11892/SEU105+1.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP11892/SEU105+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 17309
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(preboolean(X1)<=>![X2]:![X3]:((in(X2,X1)&in(X3,X1))=>(in(set_union2(X2,X3),X1)&in(set_difference(X2,X3),X1)))),file('/tmp/SRASS.s.p', t10_finsub_1)).
% fof(2, axiom,![X1]:![X2]:set_difference(X1,X2)=symmetric_difference(X1,set_intersection2(X1,X2)),file('/tmp/SRASS.s.p', t100_xboole_1)).
% fof(5, axiom,![X1]:![X2]:set_union2(X1,X2)=symmetric_difference(symmetric_difference(X1,X2),set_intersection2(X1,X2)),file('/tmp/SRASS.s.p', t94_xboole_1)).
% fof(7, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=symmetric_difference(X2,X1),file('/tmp/SRASS.s.p', commutativity_k5_xboole_0)).
% fof(8, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(15, axiom,![X1]:![X2]:(in(X1,X2)=>element(X1,X2)),file('/tmp/SRASS.s.p', t1_subset)).
% fof(19, conjecture,![X1]:(~(empty(X1))=>(![X2]:(element(X2,X1)=>![X3]:(element(X3,X1)=>(in(symmetric_difference(X2,X3),X1)&in(set_intersection2(X2,X3),X1))))=>preboolean(X1))),file('/tmp/SRASS.s.p', t16_finsub_1)).
% fof(20, negated_conjecture,~(![X1]:(~(empty(X1))=>(![X2]:(element(X2,X1)=>![X3]:(element(X3,X1)=>(in(symmetric_difference(X2,X3),X1)&in(set_intersection2(X2,X3),X1))))=>preboolean(X1)))),inference(assume_negation,[status(cth)],[19])).
% fof(23, negated_conjecture,~(![X1]:(~(empty(X1))=>(![X2]:(element(X2,X1)=>![X3]:(element(X3,X1)=>(in(symmetric_difference(X2,X3),X1)&in(set_intersection2(X2,X3),X1))))=>preboolean(X1)))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(24, plain,![X1]:((~(preboolean(X1))|![X2]:![X3]:((~(in(X2,X1))|~(in(X3,X1)))|(in(set_union2(X2,X3),X1)&in(set_difference(X2,X3),X1))))&(?[X2]:?[X3]:((in(X2,X1)&in(X3,X1))&(~(in(set_union2(X2,X3),X1))|~(in(set_difference(X2,X3),X1))))|preboolean(X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(25, plain,![X4]:((~(preboolean(X4))|![X5]:![X6]:((~(in(X5,X4))|~(in(X6,X4)))|(in(set_union2(X5,X6),X4)&in(set_difference(X5,X6),X4))))&(?[X7]:?[X8]:((in(X7,X4)&in(X8,X4))&(~(in(set_union2(X7,X8),X4))|~(in(set_difference(X7,X8),X4))))|preboolean(X4))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X4]:((~(preboolean(X4))|![X5]:![X6]:((~(in(X5,X4))|~(in(X6,X4)))|(in(set_union2(X5,X6),X4)&in(set_difference(X5,X6),X4))))&(((in(esk1_1(X4),X4)&in(esk2_1(X4),X4))&(~(in(set_union2(esk1_1(X4),esk2_1(X4)),X4))|~(in(set_difference(esk1_1(X4),esk2_1(X4)),X4))))|preboolean(X4))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:((((~(in(X5,X4))|~(in(X6,X4)))|(in(set_union2(X5,X6),X4)&in(set_difference(X5,X6),X4)))|~(preboolean(X4)))&(((in(esk1_1(X4),X4)&in(esk2_1(X4),X4))&(~(in(set_union2(esk1_1(X4),esk2_1(X4)),X4))|~(in(set_difference(esk1_1(X4),esk2_1(X4)),X4))))|preboolean(X4))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:((((in(set_union2(X5,X6),X4)|(~(in(X5,X4))|~(in(X6,X4))))|~(preboolean(X4)))&((in(set_difference(X5,X6),X4)|(~(in(X5,X4))|~(in(X6,X4))))|~(preboolean(X4))))&(((in(esk1_1(X4),X4)|preboolean(X4))&(in(esk2_1(X4),X4)|preboolean(X4)))&((~(in(set_union2(esk1_1(X4),esk2_1(X4)),X4))|~(in(set_difference(esk1_1(X4),esk2_1(X4)),X4)))|preboolean(X4)))),inference(distribute,[status(thm)],[27])).
% cnf(29,plain,(preboolean(X1)|~in(set_difference(esk1_1(X1),esk2_1(X1)),X1)|~in(set_union2(esk1_1(X1),esk2_1(X1)),X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(preboolean(X1)|in(esk2_1(X1),X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,plain,(preboolean(X1)|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(34, plain,![X3]:![X4]:set_difference(X3,X4)=symmetric_difference(X3,set_intersection2(X3,X4)),inference(variable_rename,[status(thm)],[2])).
% cnf(35,plain,(set_difference(X1,X2)=symmetric_difference(X1,set_intersection2(X1,X2))),inference(split_conjunct,[status(thm)],[34])).
% fof(42, plain,![X3]:![X4]:set_union2(X3,X4)=symmetric_difference(symmetric_difference(X3,X4),set_intersection2(X3,X4)),inference(variable_rename,[status(thm)],[5])).
% cnf(43,plain,(set_union2(X1,X2)=symmetric_difference(symmetric_difference(X1,X2),set_intersection2(X1,X2))),inference(split_conjunct,[status(thm)],[42])).
% fof(46, plain,![X3]:![X4]:symmetric_difference(X3,X4)=symmetric_difference(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(47,plain,(symmetric_difference(X1,X2)=symmetric_difference(X2,X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(49,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(72, plain,![X1]:![X2]:(~(in(X1,X2))|element(X1,X2)),inference(fof_nnf,[status(thm)],[15])).
% fof(73, plain,![X3]:![X4]:(~(in(X3,X4))|element(X3,X4)),inference(variable_rename,[status(thm)],[72])).
% cnf(74,plain,(element(X1,X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(84, negated_conjecture,?[X1]:(~(empty(X1))&(![X2]:(~(element(X2,X1))|![X3]:(~(element(X3,X1))|(in(symmetric_difference(X2,X3),X1)&in(set_intersection2(X2,X3),X1))))&~(preboolean(X1)))),inference(fof_nnf,[status(thm)],[23])).
% fof(85, negated_conjecture,?[X4]:(~(empty(X4))&(![X5]:(~(element(X5,X4))|![X6]:(~(element(X6,X4))|(in(symmetric_difference(X5,X6),X4)&in(set_intersection2(X5,X6),X4))))&~(preboolean(X4)))),inference(variable_rename,[status(thm)],[84])).
% fof(86, negated_conjecture,(~(empty(esk7_0))&(![X5]:(~(element(X5,esk7_0))|![X6]:(~(element(X6,esk7_0))|(in(symmetric_difference(X5,X6),esk7_0)&in(set_intersection2(X5,X6),esk7_0))))&~(preboolean(esk7_0)))),inference(skolemize,[status(esa)],[85])).
% fof(87, negated_conjecture,![X5]:![X6]:((((~(element(X6,esk7_0))|(in(symmetric_difference(X5,X6),esk7_0)&in(set_intersection2(X5,X6),esk7_0)))|~(element(X5,esk7_0)))&~(preboolean(esk7_0)))&~(empty(esk7_0))),inference(shift_quantors,[status(thm)],[86])).
% fof(88, negated_conjecture,![X5]:![X6]:(((((in(symmetric_difference(X5,X6),esk7_0)|~(element(X6,esk7_0)))|~(element(X5,esk7_0)))&((in(set_intersection2(X5,X6),esk7_0)|~(element(X6,esk7_0)))|~(element(X5,esk7_0))))&~(preboolean(esk7_0)))&~(empty(esk7_0))),inference(distribute,[status(thm)],[87])).
% cnf(90,negated_conjecture,(~preboolean(esk7_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(91,negated_conjecture,(in(set_intersection2(X1,X2),esk7_0)|~element(X1,esk7_0)|~element(X2,esk7_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(92,negated_conjecture,(in(symmetric_difference(X1,X2),esk7_0)|~element(X1,esk7_0)|~element(X2,esk7_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(93,plain,(preboolean(X1)|~in(set_union2(esk1_1(X1),esk2_1(X1)),X1)|~in(symmetric_difference(esk1_1(X1),set_intersection2(esk1_1(X1),esk2_1(X1))),X1)),inference(rw,[status(thm)],[29,35,theory(equality)]),['unfolding']).
% cnf(95,plain,(preboolean(X1)|~in(symmetric_difference(symmetric_difference(esk1_1(X1),esk2_1(X1)),set_intersection2(esk1_1(X1),esk2_1(X1))),X1)|~in(symmetric_difference(esk1_1(X1),set_intersection2(esk1_1(X1),esk2_1(X1))),X1)),inference(rw,[status(thm)],[93,43,theory(equality)]),['unfolding']).
% cnf(98,plain,(element(esk1_1(X1),X1)|preboolean(X1)),inference(spm,[status(thm)],[74,31,theory(equality)])).
% cnf(101,plain,(element(esk2_1(X1),X1)|preboolean(X1)),inference(spm,[status(thm)],[74,30,theory(equality)])).
% cnf(128,negated_conjecture,(in(set_intersection2(X1,esk1_1(esk7_0)),esk7_0)|preboolean(esk7_0)|~element(X1,esk7_0)),inference(spm,[status(thm)],[91,98,theory(equality)])).
% cnf(129,negated_conjecture,(in(symmetric_difference(X1,esk1_1(esk7_0)),esk7_0)|preboolean(esk7_0)|~element(X1,esk7_0)),inference(spm,[status(thm)],[92,98,theory(equality)])).
% cnf(133,negated_conjecture,(in(set_intersection2(X1,esk1_1(esk7_0)),esk7_0)|~element(X1,esk7_0)),inference(sr,[status(thm)],[128,90,theory(equality)])).
% cnf(134,negated_conjecture,(in(symmetric_difference(X1,esk1_1(esk7_0)),esk7_0)|~element(X1,esk7_0)),inference(sr,[status(thm)],[129,90,theory(equality)])).
% cnf(252,negated_conjecture,(in(set_intersection2(esk2_1(esk7_0),esk1_1(esk7_0)),esk7_0)|preboolean(esk7_0)),inference(spm,[status(thm)],[133,101,theory(equality)])).
% cnf(258,negated_conjecture,(in(set_intersection2(esk2_1(esk7_0),esk1_1(esk7_0)),esk7_0)),inference(sr,[status(thm)],[252,90,theory(equality)])).
% cnf(288,negated_conjecture,(in(set_intersection2(esk1_1(esk7_0),esk2_1(esk7_0)),esk7_0)),inference(rw,[status(thm)],[258,49,theory(equality)])).
% cnf(290,negated_conjecture,(element(set_intersection2(esk1_1(esk7_0),esk2_1(esk7_0)),esk7_0)),inference(spm,[status(thm)],[74,288,theory(equality)])).
% cnf(296,negated_conjecture,(in(symmetric_difference(X1,set_intersection2(esk1_1(esk7_0),esk2_1(esk7_0))),esk7_0)|~element(X1,esk7_0)),inference(spm,[status(thm)],[92,290,theory(equality)])).
% cnf(302,negated_conjecture,(in(symmetric_difference(esk2_1(esk7_0),esk1_1(esk7_0)),esk7_0)|preboolean(esk7_0)),inference(spm,[status(thm)],[134,101,theory(equality)])).
% cnf(310,negated_conjecture,(in(symmetric_difference(set_intersection2(esk1_1(esk7_0),esk2_1(esk7_0)),esk1_1(esk7_0)),esk7_0)),inference(spm,[status(thm)],[134,290,theory(equality)])).
% cnf(311,negated_conjecture,(in(symmetric_difference(esk2_1(esk7_0),esk1_1(esk7_0)),esk7_0)),inference(sr,[status(thm)],[302,90,theory(equality)])).
% cnf(314,negated_conjecture,(in(symmetric_difference(esk1_1(esk7_0),esk2_1(esk7_0)),esk7_0)),inference(rw,[status(thm)],[311,47,theory(equality)])).
% cnf(316,negated_conjecture,(element(symmetric_difference(esk1_1(esk7_0),esk2_1(esk7_0)),esk7_0)),inference(spm,[status(thm)],[74,314,theory(equality)])).
% cnf(683,negated_conjecture,(in(symmetric_difference(esk1_1(esk7_0),set_intersection2(esk1_1(esk7_0),esk2_1(esk7_0))),esk7_0)),inference(rw,[status(thm)],[310,47,theory(equality)])).
% cnf(691,negated_conjecture,(preboolean(esk7_0)|~in(symmetric_difference(symmetric_difference(esk1_1(esk7_0),esk2_1(esk7_0)),set_intersection2(esk1_1(esk7_0),esk2_1(esk7_0))),esk7_0)),inference(spm,[status(thm)],[95,683,theory(equality)])).
% cnf(692,negated_conjecture,(~in(symmetric_difference(symmetric_difference(esk1_1(esk7_0),esk2_1(esk7_0)),set_intersection2(esk1_1(esk7_0),esk2_1(esk7_0))),esk7_0)),inference(sr,[status(thm)],[691,90,theory(equality)])).
% cnf(3772,negated_conjecture,(in(symmetric_difference(symmetric_difference(esk1_1(esk7_0),esk2_1(esk7_0)),set_intersection2(esk1_1(esk7_0),esk2_1(esk7_0))),esk7_0)),inference(spm,[status(thm)],[296,316,theory(equality)])).
% cnf(13147,negated_conjecture,($false),inference(rw,[status(thm)],[692,3772,theory(equality)])).
% cnf(13148,negated_conjecture,($false),inference(cn,[status(thm)],[13147,theory(equality)])).
% cnf(13149,negated_conjecture,($false),13148,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1881
% # ...of these trivial                : 99
% # ...subsumed                        : 809
% # ...remaining for further processing: 973
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 11414
% # ...of the previous two non-trivial : 10568
% # Contextual simplify-reflections    : 16
% # Paramodulations                    : 11414
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 972
% #    Positive orientable unit clauses: 727
% #    Positive unorientable unit clauses: 2
% #    Negative unit clauses           : 56
% #    Non-unit-clauses                : 187
% # Current number of unprocessed clauses: 8713
% # ...number of literals in the above : 14522
% # Clause-clause subsumption calls (NU) : 1213
% # Rec. Clause-clause subsumption calls : 1117
% # Unit Clause-clause subsumption calls : 61
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 9551
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:   585 leaves,   2.86+/-5.522 terms/leaf
% # Paramod-from index:          129 leaves,   6.58+/-10.623 terms/leaf
% # Paramod-into index:          508 leaves,   3.09+/-5.880 terms/leaf
% # -------------------------------------------------
% # User time              : 0.309 s
% # System time            : 0.015 s
% # Total time             : 0.324 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.59 CPU 0.66 WC
% FINAL PrfWatch: 0.59 CPU 0.66 WC
% SZS output end Solution for /tmp/SystemOnTPTP11892/SEU105+1.tptp
% 
%------------------------------------------------------------------------------