TSTP Solution File: SEU254+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU254+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 : art07.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:31:14 EST 2010
% Result : Theorem 96.36s
% Output : Solution 96.96s
% 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/SystemOnTPTP17860/SEU254+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t24_wellord1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... dt_k2_wellord1:
% CSA axiom dt_k2_wellord1 found
% Looking for CSA axiom ... l2_wellord1:
% CSA axiom l2_wellord1 found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
% CSA axiom antisymmetry_r2_hidden found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... commutativity_k3_xboole_0:
% CSA axiom commutativity_k3_xboole_0 found
% Looking for CSA axiom ... idempotence_k3_xboole_0:
% CSA axiom idempotence_k3_xboole_0 found
% Looking for CSA axiom ... t16_wellord1:
% CSA axiom t16_wellord1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_funct_1:
% CSA axiom rc1_funct_1 found
% Looking for CSA axiom ... d6_wellord1:
% CSA axiom d6_wellord1 found
% Looking for CSA axiom ... existence_m1_subset_1:
% CSA axiom existence_m1_subset_1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_xboole_0: CSA axiom rc1_xboole_0 found
% Looking for CSA axiom ... rc2_funct_1:
% CSA axiom rc2_funct_1 found
% Looking for CSA axiom ... rc2_xboole_0:
% CSA axiom rc2_xboole_0 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc3_funct_1:
% CSA axiom rc3_funct_1 found
% Looking for CSA axiom ... t106_zfmisc_1:
% CSA axiom t106_zfmisc_1 found
% Looking for CSA axiom ... t2_boole:
% CSA axiom t2_boole found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :t2_boole:t106_zfmisc_1:rc3_funct_1:rc2_xboole_0:rc2_funct_1:rc1_xboole_0:existence_m1_subset_1:d6_wellord1:rc1_funct_1:t16_wellord1:idempotence_k3_xboole_0:commutativity_k3_xboole_0:antisymmetry_r2_hidden:l2_wellord1:dt_k2_wellord1 (15)
% Unselected axioms are ... :cc1_funct_1:fc1_zfmisc_1:t7_boole:t8_boole:cc2_funct_1:t1_subset:commutativity_k2_tarski:fc1_xboole_0:t2_subset:d5_tarski:t6_boole:dt_k1_tarski:dt_k1_xboole_0:dt_k2_tarski:dt_k2_zfmisc_1:dt_k3_xboole_0:dt_k4_tarski:dt_m1_subset_1 (18)
% SZS status THM for /tmp/SystemOnTPTP17860/SEU254+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP17860/SEU254+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 20441
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', t106_zfmisc_1)).
% fof(10, axiom,![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(14, axiom,![X1]:(relation(X1)=>(transitive(X1)<=>![X2]:![X3]:![X4]:((in(ordered_pair(X2,X3),X1)&in(ordered_pair(X3,X4),X1))=>in(ordered_pair(X2,X4),X1)))),file('/tmp/SRASS.s.p', l2_wellord1)).
% fof(15, axiom,![X1]:![X2]:(relation(X1)=>relation(relation_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k2_wellord1)).
% fof(16, conjecture,![X1]:![X2]:(relation(X2)=>(transitive(X2)=>transitive(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t24_wellord1)).
% fof(17, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>(transitive(X2)=>transitive(relation_restriction(X2,X1))))),inference(assume_negation,[status(cth)],[16])).
% fof(22, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(in(X1,X3)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[24])).
% fof(55, plain,![X1]:![X2]:![X3]:(~(relation(X3))|((~(in(X1,relation_restriction(X3,X2)))|(in(X1,X3)&in(X1,cartesian_product2(X2,X2))))&((~(in(X1,X3))|~(in(X1,cartesian_product2(X2,X2))))|in(X1,relation_restriction(X3,X2))))),inference(fof_nnf,[status(thm)],[10])).
% fof(56, plain,![X4]:![X5]:![X6]:(~(relation(X6))|((~(in(X4,relation_restriction(X6,X5)))|(in(X4,X6)&in(X4,cartesian_product2(X5,X5))))&((~(in(X4,X6))|~(in(X4,cartesian_product2(X5,X5))))|in(X4,relation_restriction(X6,X5))))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X4]:![X5]:![X6]:((((in(X4,X6)|~(in(X4,relation_restriction(X6,X5))))|~(relation(X6)))&((in(X4,cartesian_product2(X5,X5))|~(in(X4,relation_restriction(X6,X5))))|~(relation(X6))))&(((~(in(X4,X6))|~(in(X4,cartesian_product2(X5,X5))))|in(X4,relation_restriction(X6,X5)))|~(relation(X6)))),inference(distribute,[status(thm)],[56])).
% cnf(58,plain,(in(X2,relation_restriction(X1,X3))|~relation(X1)|~in(X2,cartesian_product2(X3,X3))|~in(X2,X1)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,plain,(in(X2,cartesian_product2(X3,X3))|~relation(X1)|~in(X2,relation_restriction(X1,X3))),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,plain,(in(X2,X1)|~relation(X1)|~in(X2,relation_restriction(X1,X3))),inference(split_conjunct,[status(thm)],[57])).
% fof(68, plain,![X1]:(~(relation(X1))|((~(transitive(X1))|![X2]:![X3]:![X4]:((~(in(ordered_pair(X2,X3),X1))|~(in(ordered_pair(X3,X4),X1)))|in(ordered_pair(X2,X4),X1)))&(?[X2]:?[X3]:?[X4]:((in(ordered_pair(X2,X3),X1)&in(ordered_pair(X3,X4),X1))&~(in(ordered_pair(X2,X4),X1)))|transitive(X1)))),inference(fof_nnf,[status(thm)],[14])).
% fof(69, plain,![X5]:(~(relation(X5))|((~(transitive(X5))|![X6]:![X7]:![X8]:((~(in(ordered_pair(X6,X7),X5))|~(in(ordered_pair(X7,X8),X5)))|in(ordered_pair(X6,X8),X5)))&(?[X9]:?[X10]:?[X11]:((in(ordered_pair(X9,X10),X5)&in(ordered_pair(X10,X11),X5))&~(in(ordered_pair(X9,X11),X5)))|transitive(X5)))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X5]:(~(relation(X5))|((~(transitive(X5))|![X6]:![X7]:![X8]:((~(in(ordered_pair(X6,X7),X5))|~(in(ordered_pair(X7,X8),X5)))|in(ordered_pair(X6,X8),X5)))&(((in(ordered_pair(esk7_1(X5),esk8_1(X5)),X5)&in(ordered_pair(esk8_1(X5),esk9_1(X5)),X5))&~(in(ordered_pair(esk7_1(X5),esk9_1(X5)),X5)))|transitive(X5)))),inference(skolemize,[status(esa)],[69])).
% fof(71, plain,![X5]:![X6]:![X7]:![X8]:(((((~(in(ordered_pair(X6,X7),X5))|~(in(ordered_pair(X7,X8),X5)))|in(ordered_pair(X6,X8),X5))|~(transitive(X5)))&(((in(ordered_pair(esk7_1(X5),esk8_1(X5)),X5)&in(ordered_pair(esk8_1(X5),esk9_1(X5)),X5))&~(in(ordered_pair(esk7_1(X5),esk9_1(X5)),X5)))|transitive(X5)))|~(relation(X5))),inference(shift_quantors,[status(thm)],[70])).
% fof(72, plain,![X5]:![X6]:![X7]:![X8]:(((((~(in(ordered_pair(X6,X7),X5))|~(in(ordered_pair(X7,X8),X5)))|in(ordered_pair(X6,X8),X5))|~(transitive(X5)))|~(relation(X5)))&((((in(ordered_pair(esk7_1(X5),esk8_1(X5)),X5)|transitive(X5))|~(relation(X5)))&((in(ordered_pair(esk8_1(X5),esk9_1(X5)),X5)|transitive(X5))|~(relation(X5))))&((~(in(ordered_pair(esk7_1(X5),esk9_1(X5)),X5))|transitive(X5))|~(relation(X5))))),inference(distribute,[status(thm)],[71])).
% cnf(73,plain,(transitive(X1)|~relation(X1)|~in(ordered_pair(esk7_1(X1),esk9_1(X1)),X1)),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,plain,(transitive(X1)|in(ordered_pair(esk8_1(X1),esk9_1(X1)),X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[72])).
% cnf(75,plain,(transitive(X1)|in(ordered_pair(esk7_1(X1),esk8_1(X1)),X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[72])).
% cnf(76,plain,(in(ordered_pair(X2,X3),X1)|~relation(X1)|~transitive(X1)|~in(ordered_pair(X4,X3),X1)|~in(ordered_pair(X2,X4),X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(77, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(78, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_restriction(X3,X4))),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(relation(relation_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(80, negated_conjecture,?[X1]:?[X2]:(relation(X2)&(transitive(X2)&~(transitive(relation_restriction(X2,X1))))),inference(fof_nnf,[status(thm)],[17])).
% fof(81, negated_conjecture,?[X3]:?[X4]:(relation(X4)&(transitive(X4)&~(transitive(relation_restriction(X4,X3))))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(relation(esk11_0)&(transitive(esk11_0)&~(transitive(relation_restriction(esk11_0,esk10_0))))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~transitive(relation_restriction(esk11_0,esk10_0))),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(transitive(esk11_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,negated_conjecture,(relation(esk11_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(95,plain,(in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk8_1(relation_restriction(X1,X2))),X1)|transitive(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[60,75,theory(equality)])).
% cnf(98,plain,(in(ordered_pair(esk8_1(relation_restriction(X1,X2)),esk9_1(relation_restriction(X1,X2))),X1)|transitive(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[60,74,theory(equality)])).
% cnf(103,plain,(in(ordered_pair(esk8_1(relation_restriction(X1,X2)),esk9_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))|transitive(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[59,74,theory(equality)])).
% cnf(104,plain,(in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk8_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))|transitive(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[59,75,theory(equality)])).
% cnf(111,plain,(in(ordered_pair(X1,X2),relation_restriction(X3,X4))|~relation(X3)|~in(ordered_pair(X1,X2),X3)|~in(X2,X4)|~in(X1,X4)),inference(spm,[status(thm)],[58,25,theory(equality)])).
% cnf(138,plain,(transitive(relation_restriction(X1,X2))|in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk8_1(relation_restriction(X1,X2))),X1)|~relation(X1)),inference(csr,[status(thm)],[95,79])).
% cnf(183,plain,(transitive(relation_restriction(X1,X2))|in(ordered_pair(esk8_1(relation_restriction(X1,X2)),esk9_1(relation_restriction(X1,X2))),X1)|~relation(X1)),inference(csr,[status(thm)],[98,79])).
% cnf(191,plain,(in(ordered_pair(X1,esk9_1(relation_restriction(X2,X3))),X2)|transitive(relation_restriction(X2,X3))|~transitive(X2)|~relation(X2)|~in(ordered_pair(X1,esk8_1(relation_restriction(X2,X3))),X2)),inference(spm,[status(thm)],[76,183,theory(equality)])).
% cnf(298,plain,(transitive(relation_restriction(X1,X2))|in(ordered_pair(esk8_1(relation_restriction(X1,X2)),esk9_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))|~relation(X1)),inference(csr,[status(thm)],[103,79])).
% cnf(302,plain,(in(esk9_1(relation_restriction(X1,X2)),X2)|transitive(relation_restriction(X1,X2))|~relation(X1)),inference(spm,[status(thm)],[26,298,theory(equality)])).
% cnf(332,plain,(transitive(relation_restriction(X1,X2))|in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk8_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))|~relation(X1)),inference(csr,[status(thm)],[104,79])).
% cnf(337,plain,(in(esk7_1(relation_restriction(X1,X2)),X2)|transitive(relation_restriction(X1,X2))|~relation(X1)),inference(spm,[status(thm)],[27,332,theory(equality)])).
% cnf(405,plain,(transitive(relation_restriction(X1,X2))|~relation(relation_restriction(X1,X2))|~relation(X1)|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk9_1(relation_restriction(X1,X2))),X1)|~in(esk9_1(relation_restriction(X1,X2)),X2)|~in(esk7_1(relation_restriction(X1,X2)),X2)),inference(spm,[status(thm)],[73,111,theory(equality)])).
% cnf(1503,plain,(transitive(relation_restriction(X1,X2))|~relation(relation_restriction(X1,X2))|~relation(X1)|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk9_1(relation_restriction(X1,X2))),X1)|~in(esk9_1(relation_restriction(X1,X2)),X2)),inference(csr,[status(thm)],[405,337])).
% cnf(1504,plain,(transitive(relation_restriction(X1,X2))|~relation(relation_restriction(X1,X2))|~relation(X1)|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk9_1(relation_restriction(X1,X2))),X1)),inference(csr,[status(thm)],[1503,302])).
% cnf(1505,plain,(transitive(relation_restriction(X1,X2))|~relation(X1)|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk9_1(relation_restriction(X1,X2))),X1)),inference(csr,[status(thm)],[1504,79])).
% cnf(1519,plain,(transitive(relation_restriction(X1,X2))|~relation(X1)|~transitive(X1)|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk8_1(relation_restriction(X1,X2))),X1)),inference(spm,[status(thm)],[1505,191,theory(equality)])).
% cnf(2000,plain,(transitive(relation_restriction(X1,X2))|~transitive(X1)|~relation(X1)),inference(csr,[status(thm)],[1519,138])).
% cnf(2001,negated_conjecture,(~transitive(esk11_0)|~relation(esk11_0)),inference(spm,[status(thm)],[83,2000,theory(equality)])).
% cnf(2006,negated_conjecture,($false|~relation(esk11_0)),inference(rw,[status(thm)],[2001,84,theory(equality)])).
% cnf(2007,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2006,85,theory(equality)])).
% cnf(2008,negated_conjecture,($false),inference(cn,[status(thm)],[2007,theory(equality)])).
% cnf(2009,negated_conjecture,($false),2008,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 745
% # ...of these trivial : 1
% # ...subsumed : 496
% # ...remaining for further processing: 248
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 37
% # Backward-rewritten : 0
% # Generated clauses : 1536
% # ...of the previous two non-trivial : 1471
% # Contextual simplify-reflections : 377
% # Paramodulations : 1533
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 180
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 162
% # Current number of unprocessed clauses: 504
% # ...number of literals in the above : 2516
% # Clause-clause subsumption calls (NU) : 14010
% # Rec. Clause-clause subsumption calls : 6815
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 167 leaves, 2.18+/-2.252 terms/leaf
% # Paramod-from index: 58 leaves, 1.93+/-2.108 terms/leaf
% # Paramod-into index: 153 leaves, 1.95+/-1.789 terms/leaf
% # -------------------------------------------------
% # User time : 0.132 s
% # System time : 0.005 s
% # Total time : 0.137 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.32 WC
% FINAL PrfWatch: 0.25 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP17860/SEU254+1.tptp
%
%------------------------------------------------------------------------------