%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU211+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 01:52:04 EST 2010
% Result : Theorem 90.93s
% Output : Solution 91.40s
% 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/SystemOnTPTP10453/SEU211+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t178_relat_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... reflexivity_r1_tarski:
% CSA axiom reflexivity_r1_tarski found
% Looking for CSA axiom ... cc1_relat_1:
% CSA axiom cc1_relat_1 found
% Looking for CSA axiom ... rc1_relat_1:
% CSA axiom rc1_relat_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_relat_1:
% CSA axiom rc2_relat_1 found
% Looking for CSA axiom ... d3_tarski:
% CSA axiom d3_tarski found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
% CSA axiom antisymmetry_r2_hidden found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_xboole_0:
% rc2_xboole_0:
% d14_relat_1:
% CSA axiom d14_relat_1 found
% Looking for CSA axiom ... rc1_subset_1:
% CSA axiom rc1_subset_1 found
% Looking for CSA axiom ... rc2_subset_1:
% CSA axiom rc2_subset_1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :rc2_subset_1:rc1_subset_1:d14_relat_1:antisymmetry_r2_hidden:d3_tarski:rc2_relat_1:rc1_relat_1:cc1_relat_1:reflexivity_r1_tarski (9)
% Unselected axioms are ... :rc1_xboole_0:rc2_xboole_0:t3_subset:existence_m1_subset_1:fc1_xboole_0:fc1_zfmisc_1:t8_boole:t7_boole:fc4_relat_1:t1_subset:commutativity_k2_tarski:d5_tarski:t4_subset:t2_subset:t6_boole:fc1_subset_1:t5_subset:fc2_subset_1:fc3_subset_1:dt_k10_relat_1:dt_k1_tarski:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_tarski:dt_k4_tarski:dt_m1_subset_1 (26)
% SZS status THM for /tmp/SystemOnTPTP10453/SEU211+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP10453/SEU211+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 12584
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(relation(X1)=>![X2]:![X3]:(X3=relation_inverse_image(X1,X2)<=>![X4]:(in(X4,X3)<=>?[X5]:(in(ordered_pair(X4,X5),X1)&in(X5,X2))))),file('/tmp/SRASS.s.p', d14_relat_1)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(10, conjecture,![X1]:![X2]:![X3]:(relation(X3)=>(subset(X1,X2)=>subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2)))),file('/tmp/SRASS.s.p', t178_relat_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:(relation(X3)=>(subset(X1,X2)=>subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2))))),inference(assume_negation,[status(cth)],[10])).
% fof(25, plain,![X1]:(~(relation(X1))|![X2]:![X3]:((~(X3=relation_inverse_image(X1,X2))|![X4]:((~(in(X4,X3))|?[X5]:(in(ordered_pair(X4,X5),X1)&in(X5,X2)))&(![X5]:(~(in(ordered_pair(X4,X5),X1))|~(in(X5,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|![X5]:(~(in(ordered_pair(X4,X5),X1))|~(in(X5,X2))))&(in(X4,X3)|?[X5]:(in(ordered_pair(X4,X5),X1)&in(X5,X2))))|X3=relation_inverse_image(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(26, plain,![X6]:(~(relation(X6))|![X7]:![X8]:((~(X8=relation_inverse_image(X6,X7))|![X9]:((~(in(X9,X8))|?[X10]:(in(ordered_pair(X9,X10),X6)&in(X10,X7)))&(![X11]:(~(in(ordered_pair(X9,X11),X6))|~(in(X11,X7)))|in(X9,X8))))&(?[X12]:((~(in(X12,X8))|![X13]:(~(in(ordered_pair(X12,X13),X6))|~(in(X13,X7))))&(in(X12,X8)|?[X14]:(in(ordered_pair(X12,X14),X6)&in(X14,X7))))|X8=relation_inverse_image(X6,X7)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X6]:(~(relation(X6))|![X7]:![X8]:((~(X8=relation_inverse_image(X6,X7))|![X9]:((~(in(X9,X8))|(in(ordered_pair(X9,esk3_4(X6,X7,X8,X9)),X6)&in(esk3_4(X6,X7,X8,X9),X7)))&(![X11]:(~(in(ordered_pair(X9,X11),X6))|~(in(X11,X7)))|in(X9,X8))))&(((~(in(esk4_3(X6,X7,X8),X8))|![X13]:(~(in(ordered_pair(esk4_3(X6,X7,X8),X13),X6))|~(in(X13,X7))))&(in(esk4_3(X6,X7,X8),X8)|(in(ordered_pair(esk4_3(X6,X7,X8),esk5_3(X6,X7,X8)),X6)&in(esk5_3(X6,X7,X8),X7))))|X8=relation_inverse_image(X6,X7)))),inference(skolemize,[status(esa)],[26])).
% fof(28, plain,![X6]:![X7]:![X8]:![X9]:![X11]:![X13]:((((((~(in(ordered_pair(esk4_3(X6,X7,X8),X13),X6))|~(in(X13,X7)))|~(in(esk4_3(X6,X7,X8),X8)))&(in(esk4_3(X6,X7,X8),X8)|(in(ordered_pair(esk4_3(X6,X7,X8),esk5_3(X6,X7,X8)),X6)&in(esk5_3(X6,X7,X8),X7))))|X8=relation_inverse_image(X6,X7))&((((~(in(ordered_pair(X9,X11),X6))|~(in(X11,X7)))|in(X9,X8))&(~(in(X9,X8))|(in(ordered_pair(X9,esk3_4(X6,X7,X8,X9)),X6)&in(esk3_4(X6,X7,X8,X9),X7))))|~(X8=relation_inverse_image(X6,X7))))|~(relation(X6))),inference(shift_quantors,[status(thm)],[27])).
% fof(29, plain,![X6]:![X7]:![X8]:![X9]:![X11]:![X13]:((((((~(in(ordered_pair(esk4_3(X6,X7,X8),X13),X6))|~(in(X13,X7)))|~(in(esk4_3(X6,X7,X8),X8)))|X8=relation_inverse_image(X6,X7))|~(relation(X6)))&((((in(ordered_pair(esk4_3(X6,X7,X8),esk5_3(X6,X7,X8)),X6)|in(esk4_3(X6,X7,X8),X8))|X8=relation_inverse_image(X6,X7))|~(relation(X6)))&(((in(esk5_3(X6,X7,X8),X7)|in(esk4_3(X6,X7,X8),X8))|X8=relation_inverse_image(X6,X7))|~(relation(X6)))))&(((((~(in(ordered_pair(X9,X11),X6))|~(in(X11,X7)))|in(X9,X8))|~(X8=relation_inverse_image(X6,X7)))|~(relation(X6)))&((((in(ordered_pair(X9,esk3_4(X6,X7,X8,X9)),X6)|~(in(X9,X8)))|~(X8=relation_inverse_image(X6,X7)))|~(relation(X6)))&(((in(esk3_4(X6,X7,X8,X9),X7)|~(in(X9,X8)))|~(X8=relation_inverse_image(X6,X7)))|~(relation(X6)))))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(in(esk3_4(X1,X3,X2,X4),X3)|~relation(X1)|X2!=relation_inverse_image(X1,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,plain,(in(ordered_pair(X4,esk3_4(X1,X3,X2,X4)),X1)|~relation(X1)|X2!=relation_inverse_image(X1,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[29])).
% cnf(32,plain,(in(X4,X2)|~relation(X1)|X2!=relation_inverse_image(X1,X3)|~in(X5,X3)|~in(ordered_pair(X4,X5),X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(39, 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)],[5])).
% fof(40, 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)],[39])).
% fof(41, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[40])).
% fof(42, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk6_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(subset(X1,X2)|~in(esk6_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(subset(X1,X2)|in(esk6_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(60, negated_conjecture,?[X1]:?[X2]:?[X3]:(relation(X3)&(subset(X1,X2)&~(subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2))))),inference(fof_nnf,[status(thm)],[11])).
% fof(61, negated_conjecture,?[X4]:?[X5]:?[X6]:(relation(X6)&(subset(X4,X5)&~(subset(relation_inverse_image(X6,X4),relation_inverse_image(X6,X5))))),inference(variable_rename,[status(thm)],[60])).
% fof(62, negated_conjecture,(relation(esk11_0)&(subset(esk9_0,esk10_0)&~(subset(relation_inverse_image(esk11_0,esk9_0),relation_inverse_image(esk11_0,esk10_0))))),inference(skolemize,[status(esa)],[61])).
% cnf(63,negated_conjecture,(~subset(relation_inverse_image(esk11_0,esk9_0),relation_inverse_image(esk11_0,esk10_0))),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,negated_conjecture,(subset(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,negated_conjecture,(relation(esk11_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(72,negated_conjecture,(in(X1,esk10_0)|~in(X1,esk9_0)),inference(spm,[status(thm)],[46,64,theory(equality)])).
% cnf(79,plain,(in(X1,X2)|relation_inverse_image(X3,X4)!=X2|~in(esk3_4(X3,X5,X6,X1),X4)|~relation(X3)|relation_inverse_image(X3,X5)!=X6|~in(X1,X6)),inference(spm,[status(thm)],[32,31,theory(equality)])).
% cnf(100,negated_conjecture,(in(X1,X2)|relation_inverse_image(X3,esk10_0)!=X2|relation_inverse_image(X3,X4)!=X5|~in(X1,X5)|~relation(X3)|~in(esk3_4(X3,X4,X5,X1),esk9_0)),inference(spm,[status(thm)],[79,72,theory(equality)])).
% cnf(160,negated_conjecture,(in(X1,X2)|relation_inverse_image(X3,esk10_0)!=X2|relation_inverse_image(X3,esk9_0)!=X4|~in(X1,X4)|~relation(X3)),inference(spm,[status(thm)],[100,30,theory(equality)])).
% cnf(161,negated_conjecture,(in(X1,relation_inverse_image(X2,esk10_0))|relation_inverse_image(X2,esk9_0)!=X3|~in(X1,X3)|~relation(X2)),inference(er,[status(thm)],[160,theory(equality)])).
% cnf(162,negated_conjecture,(in(X1,relation_inverse_image(X2,esk10_0))|~in(X1,relation_inverse_image(X2,esk9_0))|~relation(X2)),inference(er,[status(thm)],[161,theory(equality)])).
% cnf(164,negated_conjecture,(subset(X1,relation_inverse_image(X2,esk10_0))|~in(esk6_2(X1,relation_inverse_image(X2,esk10_0)),relation_inverse_image(X2,esk9_0))|~relation(X2)),inference(spm,[status(thm)],[44,162,theory(equality)])).
% cnf(186,negated_conjecture,(subset(relation_inverse_image(X1,esk9_0),relation_inverse_image(X1,esk10_0))|~relation(X1)),inference(spm,[status(thm)],[164,45,theory(equality)])).
% cnf(188,negated_conjecture,(~relation(esk11_0)),inference(spm,[status(thm)],[63,186,theory(equality)])).
% cnf(189,negated_conjecture,($false),inference(rw,[status(thm)],[188,65,theory(equality)])).
% cnf(190,negated_conjecture,($false),inference(cn,[status(thm)],[189,theory(equality)])).
% cnf(191,negated_conjecture,($false),190,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 114
% # ...of these trivial : 1
% # ...subsumed : 9
% # ...remaining for further processing: 104
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 112
% # ...of the previous two non-trivial : 104
% # Contextual simplify-reflections : 0
% # Paramodulations : 103
% # Factorizations : 2
% # Equation resolutions : 7
% # Current number of processed clauses: 81
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 69
% # Current number of unprocessed clauses: 36
% # ...number of literals in the above : 227
% # Clause-clause subsumption calls (NU) : 594
% # Rec. Clause-clause subsumption calls : 285
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 137 leaves, 1.34+/-1.076 terms/leaf
% # Paramod-from index: 30 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 114 leaves, 1.15+/-0.534 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.003 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP10453/SEU211+1.tptp
%
%------------------------------------------------------------------------------