%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU179+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 : art04.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:29:42 EST 2010
% Result : Theorem 92.09s
% Output : Solution 92.76s
% 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/SystemOnTPTP25015/SEU179+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t25_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 ... rc1_relat_1:
% CSA axiom rc1_relat_1 found
% Looking for CSA axiom ... d3_tarski:
% CSA axiom d3_tarski found
% ---- Iteration 2 (3 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 ... rc1_xboole_0:
% rc2_xboole_0:
% CSA axiom rc2_xboole_0 found
% Looking for CSA axiom ... d4_relat_1:
% CSA axiom d4_relat_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... rc1_xboole_0:
% d5_relat_1:
% CSA axiom d5_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:d5_relat_1:d4_relat_1:rc2_xboole_0:antisymmetry_r2_hidden:d3_tarski:rc1_relat_1:reflexivity_r1_tarski (9)
% Unselected axioms are ... :rc1_xboole_0:t3_subset:existence_m1_subset_1:fc1_zfmisc_1:t8_boole:t7_boole:t1_subset:commutativity_k2_tarski:d5_tarski:t4_subset:t2_subset:fc1_subset_1:fc1_xboole_0:fc2_subset_1:fc3_subset_1:t6_boole:t5_subset:dt_k1_relat_1:dt_k1_tarski:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_relat_1:dt_k2_tarski:dt_k4_tarski:dt_m1_subset_1 (25)
% SZS status THM for /tmp/SystemOnTPTP25015/SEU179+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP25015/SEU179+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 27134
% 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(3, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_rng(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X4,X3),X1)))),file('/tmp/SRASS.s.p', d5_relat_1)).
% fof(4, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_dom(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X3,X4),X1)))),file('/tmp/SRASS.s.p', d4_relat_1)).
% fof(7, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(10, conjecture,![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(X1,X2)=>(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2)))))),file('/tmp/SRASS.s.p', t25_relat_1)).
% fof(11, negated_conjecture,~(![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(X1,X2)=>(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2))))))),inference(assume_negation,[status(cth)],[10])).
% fof(25, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_rng(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X4,X3),X1))&(![X4]:~(in(ordered_pair(X4,X3),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X4,X3),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X4,X3),X1)))|X2=relation_rng(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(26, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X8,X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X11,X10),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X12,X10),X5)))|X6=relation_rng(X5)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(esk3_3(X5,X6,X7),X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(((~(in(esk4_2(X5,X6),X6))|![X11]:~(in(ordered_pair(X11,esk4_2(X5,X6)),X5)))&(in(esk4_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk4_2(X5,X6)),X5)))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[26])).
% fof(28, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk4_2(X5,X6)),X5))|~(in(esk4_2(X5,X6),X6)))&(in(esk4_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk4_2(X5,X6)),X5)))|X6=relation_rng(X5))&(((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(esk3_3(X5,X6,X7),X7),X5)))|~(X6=relation_rng(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[27])).
% fof(29, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk4_2(X5,X6)),X5))|~(in(esk4_2(X5,X6),X6)))|X6=relation_rng(X5))|~(relation(X5)))&(((in(esk4_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk4_2(X5,X6)),X5))|X6=relation_rng(X5))|~(relation(X5))))&((((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))|~(X6=relation_rng(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(esk3_3(X5,X6,X7),X7),X5))|~(X6=relation_rng(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(in(ordered_pair(esk3_3(X1,X2,X3),X3),X1)|~relation(X1)|X2!=relation_rng(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,plain,(in(X3,X2)|~relation(X1)|X2!=relation_rng(X1)|~in(ordered_pair(X4,X3),X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(34, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_dom(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X3,X4),X1))&(![X4]:~(in(ordered_pair(X3,X4),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X3,X4),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X3,X4),X1)))|X2=relation_dom(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(35, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X7,X8),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X10,X11),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X10,X12),X5)))|X6=relation_dom(X5)))),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(X7,esk6_3(X5,X6,X7)),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(((~(in(esk7_2(X5,X6),X6))|![X11]:~(in(ordered_pair(esk7_2(X5,X6),X11),X5)))&(in(esk7_2(X5,X6),X6)|in(ordered_pair(esk7_2(X5,X6),esk8_2(X5,X6)),X5)))|X6=relation_dom(X5)))),inference(skolemize,[status(esa)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk7_2(X5,X6),X11),X5))|~(in(esk7_2(X5,X6),X6)))&(in(esk7_2(X5,X6),X6)|in(ordered_pair(esk7_2(X5,X6),esk8_2(X5,X6)),X5)))|X6=relation_dom(X5))&(((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(X7,esk6_3(X5,X6,X7)),X5)))|~(X6=relation_dom(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[36])).
% fof(38, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk7_2(X5,X6),X11),X5))|~(in(esk7_2(X5,X6),X6)))|X6=relation_dom(X5))|~(relation(X5)))&(((in(esk7_2(X5,X6),X6)|in(ordered_pair(esk7_2(X5,X6),esk8_2(X5,X6)),X5))|X6=relation_dom(X5))|~(relation(X5))))&((((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))|~(X6=relation_dom(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(X7,esk6_3(X5,X6,X7)),X5))|~(X6=relation_dom(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[37])).
% cnf(39,plain,(in(ordered_pair(X3,esk6_3(X1,X2,X3)),X1)|~relation(X1)|X2!=relation_dom(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(in(X3,X2)|~relation(X1)|X2!=relation_dom(X1)|~in(ordered_pair(X3,X4),X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(49, 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)],[7])).
% fof(50, 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)],[49])).
% fof(51, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk10_2(X4,X5),X4)&~(in(esk10_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk10_2(X4,X5),X4)&~(in(esk10_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk10_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk10_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(subset(X1,X2)|~in(esk10_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(subset(X1,X2)|in(esk10_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(63, negated_conjecture,?[X1]:(relation(X1)&?[X2]:(relation(X2)&(subset(X1,X2)&(~(subset(relation_dom(X1),relation_dom(X2)))|~(subset(relation_rng(X1),relation_rng(X2))))))),inference(fof_nnf,[status(thm)],[11])).
% fof(64, negated_conjecture,?[X3]:(relation(X3)&?[X4]:(relation(X4)&(subset(X3,X4)&(~(subset(relation_dom(X3),relation_dom(X4)))|~(subset(relation_rng(X3),relation_rng(X4))))))),inference(variable_rename,[status(thm)],[63])).
% fof(65, negated_conjecture,(relation(esk12_0)&(relation(esk13_0)&(subset(esk12_0,esk13_0)&(~(subset(relation_dom(esk12_0),relation_dom(esk13_0)))|~(subset(relation_rng(esk12_0),relation_rng(esk13_0))))))),inference(skolemize,[status(esa)],[64])).
% cnf(66,negated_conjecture,(~subset(relation_rng(esk12_0),relation_rng(esk13_0))|~subset(relation_dom(esk12_0),relation_dom(esk13_0))),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(subset(esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,negated_conjecture,(relation(esk13_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(69,negated_conjecture,(relation(esk12_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(73,negated_conjecture,(in(X1,esk13_0)|~in(X1,esk12_0)),inference(spm,[status(thm)],[56,67,theory(equality)])).
% cnf(94,negated_conjecture,(in(X1,X2)|relation_rng(esk13_0)!=X2|~relation(esk13_0)|~in(ordered_pair(X3,X1),esk12_0)),inference(spm,[status(thm)],[31,73,theory(equality)])).
% cnf(95,negated_conjecture,(in(X1,X2)|relation_dom(esk13_0)!=X2|~relation(esk13_0)|~in(ordered_pair(X1,X3),esk12_0)),inference(spm,[status(thm)],[40,73,theory(equality)])).
% cnf(101,negated_conjecture,(in(X1,X2)|relation_rng(esk13_0)!=X2|$false|~in(ordered_pair(X3,X1),esk12_0)),inference(rw,[status(thm)],[94,68,theory(equality)])).
% cnf(102,negated_conjecture,(in(X1,X2)|relation_rng(esk13_0)!=X2|~in(ordered_pair(X3,X1),esk12_0)),inference(cn,[status(thm)],[101,theory(equality)])).
% cnf(103,negated_conjecture,(in(X1,X2)|relation_dom(esk13_0)!=X2|$false|~in(ordered_pair(X1,X3),esk12_0)),inference(rw,[status(thm)],[95,68,theory(equality)])).
% cnf(104,negated_conjecture,(in(X1,X2)|relation_dom(esk13_0)!=X2|~in(ordered_pair(X1,X3),esk12_0)),inference(cn,[status(thm)],[103,theory(equality)])).
% cnf(109,negated_conjecture,(in(X1,X2)|relation_rng(esk13_0)!=X2|relation_rng(esk12_0)!=X3|~in(X1,X3)|~relation(esk12_0)),inference(spm,[status(thm)],[102,30,theory(equality)])).
% cnf(115,negated_conjecture,(in(X1,X2)|relation_rng(esk13_0)!=X2|relation_rng(esk12_0)!=X3|~in(X1,X3)|$false),inference(rw,[status(thm)],[109,69,theory(equality)])).
% cnf(116,negated_conjecture,(in(X1,X2)|relation_rng(esk13_0)!=X2|relation_rng(esk12_0)!=X3|~in(X1,X3)),inference(cn,[status(thm)],[115,theory(equality)])).
% cnf(120,negated_conjecture,(in(X1,relation_rng(esk13_0))|relation_rng(esk12_0)!=X2|~in(X1,X2)),inference(er,[status(thm)],[116,theory(equality)])).
% cnf(121,negated_conjecture,(in(X1,relation_rng(esk13_0))|~in(X1,relation_rng(esk12_0))),inference(er,[status(thm)],[120,theory(equality)])).
% cnf(123,negated_conjecture,(subset(X1,relation_rng(esk13_0))|~in(esk10_2(X1,relation_rng(esk13_0)),relation_rng(esk12_0))),inference(spm,[status(thm)],[54,121,theory(equality)])).
% cnf(143,negated_conjecture,(subset(relation_rng(esk12_0),relation_rng(esk13_0))),inference(spm,[status(thm)],[123,55,theory(equality)])).
% cnf(145,negated_conjecture,($false|~subset(relation_dom(esk12_0),relation_dom(esk13_0))),inference(rw,[status(thm)],[66,143,theory(equality)])).
% cnf(146,negated_conjecture,(~subset(relation_dom(esk12_0),relation_dom(esk13_0))),inference(cn,[status(thm)],[145,theory(equality)])).
% cnf(150,negated_conjecture,(in(X1,X2)|relation_dom(esk13_0)!=X2|relation_dom(esk12_0)!=X3|~in(X1,X3)|~relation(esk12_0)),inference(spm,[status(thm)],[104,39,theory(equality)])).
% cnf(157,negated_conjecture,(in(X1,X2)|relation_dom(esk13_0)!=X2|relation_dom(esk12_0)!=X3|~in(X1,X3)|$false),inference(rw,[status(thm)],[150,69,theory(equality)])).
% cnf(158,negated_conjecture,(in(X1,X2)|relation_dom(esk13_0)!=X2|relation_dom(esk12_0)!=X3|~in(X1,X3)),inference(cn,[status(thm)],[157,theory(equality)])).
% cnf(159,negated_conjecture,(in(X1,relation_dom(esk13_0))|relation_dom(esk12_0)!=X2|~in(X1,X2)),inference(er,[status(thm)],[158,theory(equality)])).
% cnf(160,negated_conjecture,(in(X1,relation_dom(esk13_0))|~in(X1,relation_dom(esk12_0))),inference(er,[status(thm)],[159,theory(equality)])).
% cnf(162,negated_conjecture,(subset(X1,relation_dom(esk13_0))|~in(esk10_2(X1,relation_dom(esk13_0)),relation_dom(esk12_0))),inference(spm,[status(thm)],[54,160,theory(equality)])).
% cnf(172,negated_conjecture,(subset(relation_dom(esk12_0),relation_dom(esk13_0))),inference(spm,[status(thm)],[162,55,theory(equality)])).
% cnf(173,negated_conjecture,($false),inference(sr,[status(thm)],[172,146,theory(equality)])).
% cnf(174,negated_conjecture,($false),173,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 86
% # ...of these trivial : 2
% # ...subsumed : 3
% # ...remaining for further processing: 81
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 75
% # ...of the previous two non-trivial : 70
% # Contextual simplify-reflections : 0
% # Paramodulations : 71
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 56
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 150
% # Clause-clause subsumption calls (NU) : 190
% # Rec. Clause-clause subsumption calls : 137
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 95 leaves, 1.26+/-0.885 terms/leaf
% # Paramod-from index: 19 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 77 leaves, 1.14+/-0.528 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.006 s
% # Total time : 0.022 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/SystemOnTPTP25015/SEU179+1.tptp
%
%------------------------------------------------------------------------------