TSTP Solution File: SEU253+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU253+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:29:04 EST 2010
% Result : Theorem 99.13s
% Output : Solution 102.28s
% 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/SystemOnTPTP7501/SEU253+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t23_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 ... antisymmetry_r2_hidden:
% CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... commutativity_k3_xboole_0:
% CSA axiom commutativity_k3_xboole_0 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not 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
% Looking for CSA axiom ... t19_wellord1:
% CSA axiom t19_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 ... l4_wellord1:
% CSA axiom l4_wellord1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not 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
% Looking for CSA axiom ... rc2_funct_1: CSA axiom rc2_funct_1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_xboole_0:
% CSA axiom rc2_xboole_0 found
% Looking for CSA axiom ... t106_zfmisc_1:
% CSA axiom t106_zfmisc_1 found
% Looking for CSA axiom ... rc3_funct_1:
% CSA axiom rc3_funct_1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :rc3_funct_1:t106_zfmisc_1:rc2_xboole_0:rc2_funct_1:rc1_xboole_0:existence_m1_subset_1:l4_wellord1:d6_wellord1:rc1_funct_1:t19_wellord1:t16_wellord1:idempotence_k3_xboole_0:commutativity_k3_xboole_0:antisymmetry_r2_hidden:dt_k2_wellord1 (15)
% Unselected axioms are ... :t2_boole:cc1_funct_1:t7_boole:cc2_funct_1:t8_boole:d5_tarski:d6_relat_1:t1_subset:commutativity_k2_xboole_0:idempotence_k2_xboole_0:commutativity_k2_tarski:t1_boole:t2_subset:fc1_zfmisc_1:fc1_xboole_0:fc2_xboole_0:fc3_xboole_0:t6_boole:dt_k1_relat_1:dt_k1_tarski:dt_k1_xboole_0:dt_k2_relat_1:dt_k2_tarski:dt_k2_xboole_0:dt_k2_zfmisc_1:dt_k3_relat_1:dt_k3_xboole_0:dt_k4_tarski:dt_m1_subset_1 (29)
% SZS status THM for /tmp/SystemOnTPTP7501/SEU253+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP7501/SEU253+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 10081
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 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]:![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(7, axiom,![X1]:(relation(X1)=>(connected(X1)<=>![X2]:![X3]:~(((((in(X2,relation_field(X1))&in(X3,relation_field(X1)))&~(X2=X3))&~(in(ordered_pair(X2,X3),X1)))&~(in(ordered_pair(X3,X2),X1)))))),file('/tmp/SRASS.s.p', l4_wellord1)).
% fof(10, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_field(relation_restriction(X3,X2)))=>(in(X1,relation_field(X3))&in(X1,X2)))),file('/tmp/SRASS.s.p', t19_wellord1)).
% fof(11, 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(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)=>(connected(X2)=>connected(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t23_wellord1)).
% fof(17, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>(connected(X2)=>connected(relation_restriction(X2,X1))))),inference(assume_negation,[status(cth)],[16])).
% fof(19, plain,![X1]:(relation(X1)=>(connected(X1)<=>![X2]:![X3]:~(((((in(X2,relation_field(X1))&in(X3,relation_field(X1)))&~(X2=X3))&~(in(ordered_pair(X2,X3),X1)))&~(in(ordered_pair(X3,X2),X1)))))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(26, 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(27, 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)],[26])).
% fof(28, 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)],[27])).
% cnf(29,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(46, plain,![X1]:(~(relation(X1))|((~(connected(X1))|![X2]:![X3]:((((~(in(X2,relation_field(X1)))|~(in(X3,relation_field(X1))))|X2=X3)|in(ordered_pair(X2,X3),X1))|in(ordered_pair(X3,X2),X1)))&(?[X2]:?[X3]:((((in(X2,relation_field(X1))&in(X3,relation_field(X1)))&~(X2=X3))&~(in(ordered_pair(X2,X3),X1)))&~(in(ordered_pair(X3,X2),X1)))|connected(X1)))),inference(fof_nnf,[status(thm)],[19])).
% fof(47, plain,![X4]:(~(relation(X4))|((~(connected(X4))|![X5]:![X6]:((((~(in(X5,relation_field(X4)))|~(in(X6,relation_field(X4))))|X5=X6)|in(ordered_pair(X5,X6),X4))|in(ordered_pair(X6,X5),X4)))&(?[X7]:?[X8]:((((in(X7,relation_field(X4))&in(X8,relation_field(X4)))&~(X7=X8))&~(in(ordered_pair(X7,X8),X4)))&~(in(ordered_pair(X8,X7),X4)))|connected(X4)))),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,![X4]:(~(relation(X4))|((~(connected(X4))|![X5]:![X6]:((((~(in(X5,relation_field(X4)))|~(in(X6,relation_field(X4))))|X5=X6)|in(ordered_pair(X5,X6),X4))|in(ordered_pair(X6,X5),X4)))&(((((in(esk6_1(X4),relation_field(X4))&in(esk7_1(X4),relation_field(X4)))&~(esk6_1(X4)=esk7_1(X4)))&~(in(ordered_pair(esk6_1(X4),esk7_1(X4)),X4)))&~(in(ordered_pair(esk7_1(X4),esk6_1(X4)),X4)))|connected(X4)))),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X4]:![X5]:![X6]:(((((((~(in(X5,relation_field(X4)))|~(in(X6,relation_field(X4))))|X5=X6)|in(ordered_pair(X5,X6),X4))|in(ordered_pair(X6,X5),X4))|~(connected(X4)))&(((((in(esk6_1(X4),relation_field(X4))&in(esk7_1(X4),relation_field(X4)))&~(esk6_1(X4)=esk7_1(X4)))&~(in(ordered_pair(esk6_1(X4),esk7_1(X4)),X4)))&~(in(ordered_pair(esk7_1(X4),esk6_1(X4)),X4)))|connected(X4)))|~(relation(X4))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,![X4]:![X5]:![X6]:(((((((~(in(X5,relation_field(X4)))|~(in(X6,relation_field(X4))))|X5=X6)|in(ordered_pair(X5,X6),X4))|in(ordered_pair(X6,X5),X4))|~(connected(X4)))|~(relation(X4)))&((((((in(esk6_1(X4),relation_field(X4))|connected(X4))|~(relation(X4)))&((in(esk7_1(X4),relation_field(X4))|connected(X4))|~(relation(X4))))&((~(esk6_1(X4)=esk7_1(X4))|connected(X4))|~(relation(X4))))&((~(in(ordered_pair(esk6_1(X4),esk7_1(X4)),X4))|connected(X4))|~(relation(X4))))&((~(in(ordered_pair(esk7_1(X4),esk6_1(X4)),X4))|connected(X4))|~(relation(X4))))),inference(distribute,[status(thm)],[49])).
% cnf(51,plain,(connected(X1)|~relation(X1)|~in(ordered_pair(esk7_1(X1),esk6_1(X1)),X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(connected(X1)|~relation(X1)|~in(ordered_pair(esk6_1(X1),esk7_1(X1)),X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(53,plain,(connected(X1)|~relation(X1)|esk6_1(X1)!=esk7_1(X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(54,plain,(connected(X1)|in(esk7_1(X1),relation_field(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(55,plain,(connected(X1)|in(esk6_1(X1),relation_field(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(56,plain,(in(ordered_pair(X2,X3),X1)|in(ordered_pair(X3,X2),X1)|X3=X2|~relation(X1)|~connected(X1)|~in(X2,relation_field(X1))|~in(X3,relation_field(X1))),inference(split_conjunct,[status(thm)],[50])).
% fof(65, plain,![X1]:![X2]:![X3]:(~(relation(X3))|(~(in(X1,relation_field(relation_restriction(X3,X2))))|(in(X1,relation_field(X3))&in(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(66, plain,![X4]:![X5]:![X6]:(~(relation(X6))|(~(in(X4,relation_field(relation_restriction(X6,X5))))|(in(X4,relation_field(X6))&in(X4,X5)))),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X4]:![X5]:![X6]:(((in(X4,relation_field(X6))|~(in(X4,relation_field(relation_restriction(X6,X5)))))|~(relation(X6)))&((in(X4,X5)|~(in(X4,relation_field(relation_restriction(X6,X5)))))|~(relation(X6)))),inference(distribute,[status(thm)],[66])).
% cnf(68,plain,(in(X2,X3)|~relation(X1)|~in(X2,relation_field(relation_restriction(X1,X3)))),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,plain,(in(X2,relation_field(X1))|~relation(X1)|~in(X2,relation_field(relation_restriction(X1,X3)))),inference(split_conjunct,[status(thm)],[67])).
% fof(70, 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)],[11])).
% fof(71, 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)],[70])).
% fof(72, 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)],[71])).
% cnf(73,plain,(in(X2,relation_restriction(X1,X3))|~relation(X1)|~in(X2,cartesian_product2(X3,X3))|~in(X2,X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(83, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(84, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_restriction(X3,X4))),inference(variable_rename,[status(thm)],[83])).
% cnf(85,plain,(relation(relation_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[84])).
% fof(86, negated_conjecture,?[X1]:?[X2]:(relation(X2)&(connected(X2)&~(connected(relation_restriction(X2,X1))))),inference(fof_nnf,[status(thm)],[17])).
% fof(87, negated_conjecture,?[X3]:?[X4]:(relation(X4)&(connected(X4)&~(connected(relation_restriction(X4,X3))))),inference(variable_rename,[status(thm)],[86])).
% fof(88, negated_conjecture,(relation(esk10_0)&(connected(esk10_0)&~(connected(relation_restriction(esk10_0,esk9_0))))),inference(skolemize,[status(esa)],[87])).
% cnf(89,negated_conjecture,(~connected(relation_restriction(esk10_0,esk9_0))),inference(split_conjunct,[status(thm)],[88])).
% cnf(90,negated_conjecture,(connected(esk10_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(91,negated_conjecture,(relation(esk10_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(101,plain,(in(esk7_1(relation_restriction(X1,X2)),X2)|connected(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[68,54,theory(equality)])).
% cnf(102,plain,(in(esk6_1(relation_restriction(X1,X2)),X2)|connected(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[68,55,theory(equality)])).
% cnf(103,plain,(in(esk7_1(relation_restriction(X1,X2)),relation_field(X1))|connected(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[69,54,theory(equality)])).
% cnf(104,plain,(in(esk6_1(relation_restriction(X1,X2)),relation_field(X1))|connected(relation_restriction(X1,X2))|~relation(X1)|~relation(relation_restriction(X1,X2))),inference(spm,[status(thm)],[69,55,theory(equality)])).
% cnf(110,plain,(in(ordered_pair(X1,X2),relation_restriction(X3,X4))|~in(ordered_pair(X1,X2),X3)|~relation(X3)|~in(X2,X4)|~in(X1,X4)),inference(spm,[status(thm)],[73,29,theory(equality)])).
% cnf(122,plain,(connected(relation_restriction(X1,X2))|in(esk7_1(relation_restriction(X1,X2)),X2)|~relation(X1)),inference(csr,[status(thm)],[101,85])).
% cnf(132,plain,(connected(relation_restriction(X1,X2))|in(esk6_1(relation_restriction(X1,X2)),X2)|~relation(X1)),inference(csr,[status(thm)],[102,85])).
% cnf(146,plain,(connected(relation_restriction(X1,X2))|in(esk7_1(relation_restriction(X1,X2)),relation_field(X1))|~relation(X1)),inference(csr,[status(thm)],[103,85])).
% cnf(151,plain,(X1=esk7_1(relation_restriction(X2,X3))|in(ordered_pair(esk7_1(relation_restriction(X2,X3)),X1),X2)|in(ordered_pair(X1,esk7_1(relation_restriction(X2,X3))),X2)|connected(relation_restriction(X2,X3))|~connected(X2)|~in(X1,relation_field(X2))|~relation(X2)),inference(spm,[status(thm)],[56,146,theory(equality)])).
% cnf(184,plain,(connected(relation_restriction(X1,X2))|in(esk6_1(relation_restriction(X1,X2)),relation_field(X1))|~relation(X1)),inference(csr,[status(thm)],[104,85])).
% cnf(258,plain,(connected(relation_restriction(X1,X2))|~relation(relation_restriction(X1,X2))|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk6_1(relation_restriction(X1,X2))),X1)|~in(esk6_1(relation_restriction(X1,X2)),X2)|~in(esk7_1(relation_restriction(X1,X2)),X2)|~relation(X1)),inference(spm,[status(thm)],[51,110,theory(equality)])).
% cnf(259,plain,(connected(relation_restriction(X1,X2))|~relation(relation_restriction(X1,X2))|~in(ordered_pair(esk6_1(relation_restriction(X1,X2)),esk7_1(relation_restriction(X1,X2))),X1)|~in(esk7_1(relation_restriction(X1,X2)),X2)|~in(esk6_1(relation_restriction(X1,X2)),X2)|~relation(X1)),inference(spm,[status(thm)],[52,110,theory(equality)])).
% cnf(915,plain,(esk6_1(relation_restriction(X1,X2))=esk7_1(relation_restriction(X1,X3))|connected(relation_restriction(X1,X3))|in(ordered_pair(esk6_1(relation_restriction(X1,X2)),esk7_1(relation_restriction(X1,X3))),X1)|in(ordered_pair(esk7_1(relation_restriction(X1,X3)),esk6_1(relation_restriction(X1,X2))),X1)|connected(relation_restriction(X1,X2))|~connected(X1)|~relation(X1)),inference(spm,[status(thm)],[151,184,theory(equality)])).
% cnf(3538,plain,(connected(relation_restriction(X1,X2))|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk6_1(relation_restriction(X1,X2))),X1)|~in(esk6_1(relation_restriction(X1,X2)),X2)|~relation(relation_restriction(X1,X2))|~relation(X1)),inference(csr,[status(thm)],[258,122])).
% cnf(3539,plain,(connected(relation_restriction(X1,X2))|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk6_1(relation_restriction(X1,X2))),X1)|~relation(relation_restriction(X1,X2))|~relation(X1)),inference(csr,[status(thm)],[3538,132])).
% cnf(3540,plain,(connected(relation_restriction(X1,X2))|~in(ordered_pair(esk7_1(relation_restriction(X1,X2)),esk6_1(relation_restriction(X1,X2))),X1)|~relation(X1)),inference(csr,[status(thm)],[3539,85])).
% cnf(3585,plain,(connected(relation_restriction(X1,X2))|~in(ordered_pair(esk6_1(relation_restriction(X1,X2)),esk7_1(relation_restriction(X1,X2))),X1)|~in(esk7_1(relation_restriction(X1,X2)),X2)|~relation(relation_restriction(X1,X2))|~relation(X1)),inference(csr,[status(thm)],[259,132])).
% cnf(3586,plain,(connected(relation_restriction(X1,X2))|~in(ordered_pair(esk6_1(relation_restriction(X1,X2)),esk7_1(relation_restriction(X1,X2))),X1)|~relation(relation_restriction(X1,X2))|~relation(X1)),inference(csr,[status(thm)],[3585,122])).
% cnf(3587,plain,(connected(relation_restriction(X1,X2))|~in(ordered_pair(esk6_1(relation_restriction(X1,X2)),esk7_1(relation_restriction(X1,X2))),X1)|~relation(X1)),inference(csr,[status(thm)],[3586,85])).
% cnf(20186,negated_conjecture,(esk6_1(relation_restriction(esk10_0,X1))=esk7_1(relation_restriction(esk10_0,X2))|connected(relation_restriction(esk10_0,X1))|connected(relation_restriction(esk10_0,X2))|in(ordered_pair(esk7_1(relation_restriction(esk10_0,X2)),esk6_1(relation_restriction(esk10_0,X1))),esk10_0)|in(ordered_pair(esk6_1(relation_restriction(esk10_0,X1)),esk7_1(relation_restriction(esk10_0,X2))),esk10_0)|~connected(esk10_0)),inference(spm,[status(thm)],[915,91,theory(equality)])).
% cnf(20191,negated_conjecture,(esk6_1(relation_restriction(esk10_0,X1))=esk7_1(relation_restriction(esk10_0,X2))|connected(relation_restriction(esk10_0,X1))|connected(relation_restriction(esk10_0,X2))|in(ordered_pair(esk7_1(relation_restriction(esk10_0,X2)),esk6_1(relation_restriction(esk10_0,X1))),esk10_0)|in(ordered_pair(esk6_1(relation_restriction(esk10_0,X1)),esk7_1(relation_restriction(esk10_0,X2))),esk10_0)|$false),inference(rw,[status(thm)],[20186,90,theory(equality)])).
% cnf(20192,negated_conjecture,(esk6_1(relation_restriction(esk10_0,X1))=esk7_1(relation_restriction(esk10_0,X2))|connected(relation_restriction(esk10_0,X1))|connected(relation_restriction(esk10_0,X2))|in(ordered_pair(esk7_1(relation_restriction(esk10_0,X2)),esk6_1(relation_restriction(esk10_0,X1))),esk10_0)|in(ordered_pair(esk6_1(relation_restriction(esk10_0,X1)),esk7_1(relation_restriction(esk10_0,X2))),esk10_0)),inference(cn,[status(thm)],[20191,theory(equality)])).
% cnf(20200,negated_conjecture,(connected(relation_restriction(esk10_0,X1))|esk6_1(relation_restriction(esk10_0,X1))=esk7_1(relation_restriction(esk10_0,X1))|in(ordered_pair(esk6_1(relation_restriction(esk10_0,X1)),esk7_1(relation_restriction(esk10_0,X1))),esk10_0)|~relation(esk10_0)),inference(spm,[status(thm)],[3540,20192,theory(equality)])).
% cnf(20202,negated_conjecture,(connected(relation_restriction(esk10_0,X1))|esk6_1(relation_restriction(esk10_0,X1))=esk7_1(relation_restriction(esk10_0,X1))|in(ordered_pair(esk6_1(relation_restriction(esk10_0,X1)),esk7_1(relation_restriction(esk10_0,X1))),esk10_0)|$false),inference(rw,[status(thm)],[20200,91,theory(equality)])).
% cnf(20203,negated_conjecture,(connected(relation_restriction(esk10_0,X1))|esk6_1(relation_restriction(esk10_0,X1))=esk7_1(relation_restriction(esk10_0,X1))|in(ordered_pair(esk6_1(relation_restriction(esk10_0,X1)),esk7_1(relation_restriction(esk10_0,X1))),esk10_0)),inference(cn,[status(thm)],[20202,theory(equality)])).
% cnf(20205,negated_conjecture,(connected(relation_restriction(esk10_0,X1))|esk7_1(relation_restriction(esk10_0,X1))=esk6_1(relation_restriction(esk10_0,X1))|~relation(esk10_0)),inference(spm,[status(thm)],[3587,20203,theory(equality)])).
% cnf(20206,negated_conjecture,(connected(relation_restriction(esk10_0,X1))|esk7_1(relation_restriction(esk10_0,X1))=esk6_1(relation_restriction(esk10_0,X1))|$false),inference(rw,[status(thm)],[20205,91,theory(equality)])).
% cnf(20207,negated_conjecture,(connected(relation_restriction(esk10_0,X1))|esk7_1(relation_restriction(esk10_0,X1))=esk6_1(relation_restriction(esk10_0,X1))),inference(cn,[status(thm)],[20206,theory(equality)])).
% cnf(20208,negated_conjecture,(connected(relation_restriction(esk10_0,X1))|~relation(relation_restriction(esk10_0,X1))),inference(spm,[status(thm)],[53,20207,theory(equality)])).
% cnf(20709,negated_conjecture,(~relation(relation_restriction(esk10_0,esk9_0))),inference(spm,[status(thm)],[89,20208,theory(equality)])).
% cnf(20717,negated_conjecture,(~relation(esk10_0)),inference(spm,[status(thm)],[20709,85,theory(equality)])).
% cnf(20718,negated_conjecture,($false),inference(rw,[status(thm)],[20717,91,theory(equality)])).
% cnf(20719,negated_conjecture,($false),inference(cn,[status(thm)],[20718,theory(equality)])).
% cnf(20720,negated_conjecture,($false),20719,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3421
% # ...of these trivial : 0
% # ...subsumed : 2011
% # ...remaining for further processing: 1410
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 57
% # Backward-rewritten : 0
% # Generated clauses : 18462
% # ...of the previous two non-trivial : 18326
% # Contextual simplify-reflections : 1728
% # Paramodulations : 18460
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 1320
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 3
% # Non-unit-clauses : 1303
% # Current number of unprocessed clauses: 14707
% # ...number of literals in the above : 112842
% # Clause-clause subsumption calls (NU) : 530004
% # Rec. Clause-clause subsumption calls : 74490
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 282 leaves, 13.01+/-27.714 terms/leaf
% # Paramod-from index: 43 leaves, 15.30+/-37.872 terms/leaf
% # Paramod-into index: 243 leaves, 11.00+/-26.225 terms/leaf
% # -------------------------------------------------
% # User time : 2.596 s
% # System time : 0.042 s
% # Total time : 2.638 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.18 CPU 3.29 WC
% FINAL PrfWatch: 3.18 CPU 3.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP7501/SEU253+1.tptp
%
%------------------------------------------------------------------------------