TSTP Solution File: SEU248+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU248+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:27:08 EST 2010
% Result : Theorem 87.94s
% Output : Solution 88.35s
% 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/SystemOnTPTP5600/SEU248+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~l29_wellord1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... dt_k8_relat_1:
% CSA axiom dt_k8_relat_1 found
% Looking for CSA axiom ... reflexivity_r1_tarski:
% CSA axiom reflexivity_r1_tarski found
% Looking for CSA axiom ... fc5_funct_1:
% CSA axiom fc5_funct_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not 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
% Looking for CSA axiom ... rc1_funct_1:
% CSA axiom rc1_funct_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... d4_relat_1:
% CSA axiom d4_relat_1 found
% Looking for CSA axiom ... d12_relat_1:
% CSA axiom d12_relat_1 found
% Looking for CSA axiom ... rc2_funct_1:
% CSA axiom rc2_funct_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_funct_1:d12_relat_1:d4_relat_1:rc1_funct_1:antisymmetry_r2_hidden:d3_tarski:fc5_funct_1:reflexivity_r1_tarski:dt_k8_relat_1 (9)
% Unselected axioms are ... :t3_subset:existence_m1_subset_1:rc1_xboole_0:rc2_xboole_0:rc3_funct_1:fc1_zfmisc_1:cc1_funct_1:t8_boole:t7_boole:d5_tarski:t1_subset:cc2_funct_1:commutativity_k2_tarski:t2_subset:t4_subset:t5_subset:t6_boole:fc1_xboole_0:dt_k1_relat_1:dt_k1_tarski:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_tarski:dt_k4_tarski:dt_m1_subset_1 (25)
% SZS status THM for /tmp/SystemOnTPTP5600/SEU248+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP5600/SEU248+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 7338
% 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(2, axiom,![X1]:![X2]:(relation(X2)=>![X3]:(relation(X3)=>(X3=relation_rng_restriction(X1,X2)<=>![X4]:![X5]:(in(ordered_pair(X4,X5),X3)<=>(in(X5,X1)&in(ordered_pair(X4,X5),X2)))))),file('/tmp/SRASS.s.p', d12_relat_1)).
% fof(3, 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(6, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(9, axiom,![X1]:![X2]:(relation(X2)=>relation(relation_rng_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k8_relat_1)).
% fof(10, conjecture,![X1]:![X2]:(relation(X2)=>subset(relation_dom(relation_rng_restriction(X1,X2)),relation_dom(X2))),file('/tmp/SRASS.s.p', l29_wellord1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>subset(relation_dom(relation_rng_restriction(X1,X2)),relation_dom(X2)))),inference(assume_negation,[status(cth)],[10])).
% fof(18, plain,![X1]:![X2]:(~(relation(X2))|![X3]:(~(relation(X3))|((~(X3=relation_rng_restriction(X1,X2))|![X4]:![X5]:((~(in(ordered_pair(X4,X5),X3))|(in(X5,X1)&in(ordered_pair(X4,X5),X2)))&((~(in(X5,X1))|~(in(ordered_pair(X4,X5),X2)))|in(ordered_pair(X4,X5),X3))))&(?[X4]:?[X5]:((~(in(ordered_pair(X4,X5),X3))|(~(in(X5,X1))|~(in(ordered_pair(X4,X5),X2))))&(in(ordered_pair(X4,X5),X3)|(in(X5,X1)&in(ordered_pair(X4,X5),X2))))|X3=relation_rng_restriction(X1,X2))))),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X6]:![X7]:(~(relation(X7))|![X8]:(~(relation(X8))|((~(X8=relation_rng_restriction(X6,X7))|![X9]:![X10]:((~(in(ordered_pair(X9,X10),X8))|(in(X10,X6)&in(ordered_pair(X9,X10),X7)))&((~(in(X10,X6))|~(in(ordered_pair(X9,X10),X7)))|in(ordered_pair(X9,X10),X8))))&(?[X11]:?[X12]:((~(in(ordered_pair(X11,X12),X8))|(~(in(X12,X6))|~(in(ordered_pair(X11,X12),X7))))&(in(ordered_pair(X11,X12),X8)|(in(X12,X6)&in(ordered_pair(X11,X12),X7))))|X8=relation_rng_restriction(X6,X7))))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X6]:![X7]:(~(relation(X7))|![X8]:(~(relation(X8))|((~(X8=relation_rng_restriction(X6,X7))|![X9]:![X10]:((~(in(ordered_pair(X9,X10),X8))|(in(X10,X6)&in(ordered_pair(X9,X10),X7)))&((~(in(X10,X6))|~(in(ordered_pair(X9,X10),X7)))|in(ordered_pair(X9,X10),X8))))&(((~(in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X8))|(~(in(esk3_3(X6,X7,X8),X6))|~(in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X7))))&(in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X8)|(in(esk3_3(X6,X7,X8),X6)&in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X7))))|X8=relation_rng_restriction(X6,X7))))),inference(skolemize,[status(esa)],[19])).
% fof(21, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((((~(in(ordered_pair(X9,X10),X8))|(in(X10,X6)&in(ordered_pair(X9,X10),X7)))&((~(in(X10,X6))|~(in(ordered_pair(X9,X10),X7)))|in(ordered_pair(X9,X10),X8)))|~(X8=relation_rng_restriction(X6,X7)))&(((~(in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X8))|(~(in(esk3_3(X6,X7,X8),X6))|~(in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X7))))&(in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X8)|(in(esk3_3(X6,X7,X8),X6)&in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X7))))|X8=relation_rng_restriction(X6,X7)))|~(relation(X8)))|~(relation(X7))),inference(shift_quantors,[status(thm)],[20])).
% fof(22, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((in(X10,X6)|~(in(ordered_pair(X9,X10),X8)))|~(X8=relation_rng_restriction(X6,X7)))|~(relation(X8)))|~(relation(X7)))&((((in(ordered_pair(X9,X10),X7)|~(in(ordered_pair(X9,X10),X8)))|~(X8=relation_rng_restriction(X6,X7)))|~(relation(X8)))|~(relation(X7))))&(((((~(in(X10,X6))|~(in(ordered_pair(X9,X10),X7)))|in(ordered_pair(X9,X10),X8))|~(X8=relation_rng_restriction(X6,X7)))|~(relation(X8)))|~(relation(X7))))&(((((~(in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X8))|(~(in(esk3_3(X6,X7,X8),X6))|~(in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X7))))|X8=relation_rng_restriction(X6,X7))|~(relation(X8)))|~(relation(X7)))&(((((in(esk3_3(X6,X7,X8),X6)|in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X8))|X8=relation_rng_restriction(X6,X7))|~(relation(X8)))|~(relation(X7)))&((((in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X7)|in(ordered_pair(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8)),X8))|X8=relation_rng_restriction(X6,X7))|~(relation(X8)))|~(relation(X7)))))),inference(distribute,[status(thm)],[21])).
% cnf(27,plain,(in(ordered_pair(X4,X5),X1)|~relation(X1)|~relation(X2)|X2!=relation_rng_restriction(X3,X1)|~in(ordered_pair(X4,X5),X2)),inference(split_conjunct,[status(thm)],[22])).
% fof(29, 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)],[3])).
% fof(30, 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)],[29])).
% fof(31, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(((~(in(esk5_2(X5,X6),X6))|![X11]:~(in(ordered_pair(esk5_2(X5,X6),X11),X5)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)))|X6=relation_dom(X5)))),inference(skolemize,[status(esa)],[30])).
% fof(32, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk5_2(X5,X6),X11),X5))|~(in(esk5_2(X5,X6),X6)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)))|X6=relation_dom(X5))&(((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5)))|~(X6=relation_dom(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk5_2(X5,X6),X11),X5))|~(in(esk5_2(X5,X6),X6)))|X6=relation_dom(X5))|~(relation(X5)))&(((in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_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,esk4_3(X5,X6,X7)),X5))|~(X6=relation_dom(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(in(ordered_pair(X3,esk4_3(X1,X2,X3)),X1)|~relation(X1)|X2!=relation_dom(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(in(X3,X2)|~relation(X1)|X2!=relation_dom(X1)|~in(ordered_pair(X3,X4),X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(45, 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)],[6])).
% fof(46, 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)],[45])).
% fof(47, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk8_2(X4,X5),X4)&~(in(esk8_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk8_2(X4,X5),X4)&~(in(esk8_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[47])).
% fof(49, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk8_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk8_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(subset(X1,X2)|~in(esk8_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(subset(X1,X2)|in(esk8_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(60, plain,![X1]:![X2]:(~(relation(X2))|relation(relation_rng_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(61, plain,![X3]:![X4]:(~(relation(X4))|relation(relation_rng_restriction(X3,X4))),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(relation(relation_rng_restriction(X1,X2))|~relation(X2)),inference(split_conjunct,[status(thm)],[61])).
% fof(63, negated_conjecture,?[X1]:?[X2]:(relation(X2)&~(subset(relation_dom(relation_rng_restriction(X1,X2)),relation_dom(X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(64, negated_conjecture,?[X3]:?[X4]:(relation(X4)&~(subset(relation_dom(relation_rng_restriction(X3,X4)),relation_dom(X4)))),inference(variable_rename,[status(thm)],[63])).
% fof(65, negated_conjecture,(relation(esk10_0)&~(subset(relation_dom(relation_rng_restriction(esk9_0,esk10_0)),relation_dom(esk10_0)))),inference(skolemize,[status(esa)],[64])).
% cnf(66,negated_conjecture,(~subset(relation_dom(relation_rng_restriction(esk9_0,esk10_0)),relation_dom(esk10_0))),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(relation(esk10_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(77,plain,(in(ordered_pair(X1,esk4_3(X2,X3,X1)),X4)|relation_rng_restriction(X5,X4)!=X2|~relation(X2)|~relation(X4)|relation_dom(X2)!=X3|~in(X1,X3)),inference(spm,[status(thm)],[27,34,theory(equality)])).
% cnf(98,plain,(in(ordered_pair(X1,esk4_3(relation_rng_restriction(X2,X3),X4,X1)),X3)|relation_dom(relation_rng_restriction(X2,X3))!=X4|~in(X1,X4)|~relation(relation_rng_restriction(X2,X3))|~relation(X3)),inference(er,[status(thm)],[77,theory(equality)])).
% cnf(127,plain,(in(ordered_pair(X1,esk4_3(relation_rng_restriction(X2,X3),X4,X1)),X3)|relation_dom(relation_rng_restriction(X2,X3))!=X4|~in(X1,X4)|~relation(X3)),inference(csr,[status(thm)],[98,62])).
% cnf(130,plain,(in(X1,X2)|relation_dom(X3)!=X2|~relation(X3)|relation_dom(relation_rng_restriction(X4,X3))!=X5|~in(X1,X5)),inference(spm,[status(thm)],[35,127,theory(equality)])).
% cnf(134,plain,(in(X1,X2)|relation_dom(X3)!=X2|~in(X1,relation_dom(relation_rng_restriction(X4,X3)))|~relation(X3)),inference(er,[status(thm)],[130,theory(equality)])).
% cnf(135,plain,(in(esk8_2(relation_dom(relation_rng_restriction(X1,X2)),X3),X4)|subset(relation_dom(relation_rng_restriction(X1,X2)),X3)|relation_dom(X2)!=X4|~relation(X2)),inference(spm,[status(thm)],[134,51,theory(equality)])).
% cnf(162,plain,(subset(relation_dom(relation_rng_restriction(X1,X2)),X3)|relation_dom(X2)!=X3|~relation(X2)),inference(spm,[status(thm)],[50,135,theory(equality)])).
% cnf(164,negated_conjecture,(~relation(esk10_0)),inference(spm,[status(thm)],[66,162,theory(equality)])).
% cnf(165,negated_conjecture,($false),inference(rw,[status(thm)],[164,67,theory(equality)])).
% cnf(166,negated_conjecture,($false),inference(cn,[status(thm)],[165,theory(equality)])).
% cnf(167,negated_conjecture,($false),166,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 52
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 49
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 81
% # ...of the previous two non-trivial : 70
% # Contextual simplify-reflections : 3
% # Paramodulations : 69
% # Factorizations : 6
% # Equation resolutions : 6
% # Current number of processed clauses: 49
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 41
% # Current number of unprocessed clauses: 43
% # ...number of literals in the above : 222
% # Clause-clause subsumption calls (NU) : 132
% # Rec. Clause-clause subsumption calls : 75
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 70 leaves, 1.64+/-1.435 terms/leaf
% # Paramod-from index: 22 leaves, 1.05+/-0.208 terms/leaf
% # Paramod-into index: 65 leaves, 1.31+/-0.783 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP5600/SEU248+1.tptp
%
%------------------------------------------------------------------------------