TSTP Solution File: SEU271+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU271+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:46:27 EST 2010
% Result : Theorem 161.15s
% Output : Solution 161.81s
% 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/SystemOnTPTP24832/SEU271+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t5_wellord2:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... dt_k1_wellord2:
% CSA axiom dt_k1_wellord2 found
% Looking for CSA axiom ... reflexivity_r1_tarski:
% CSA axiom reflexivity_r1_tarski found
% Looking for CSA axiom ... d12_relat_2:
% CSA axiom d12_relat_2 found
% ---- Iteration 2 (3 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_xboole_0: CSA axiom rc2_xboole_0 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 ... rc2_funct_1:
% CSA axiom rc2_funct_1 found
% Looking for CSA axiom ... rc3_funct_1:
% CSA axiom rc3_funct_1 found
% Looking for CSA axiom ... rc4_funct_1:
% CSA axiom rc4_funct_1 found
% ---- Iteration 4 (9 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 ... cc1_ordinal1:
% CSA axiom cc1_ordinal1 found
% Looking for CSA axiom ... cc2_ordinal1: CSA axiom cc2_ordinal1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... cc3_ordinal1:
% CSA axiom cc3_ordinal1 found
% Looking for CSA axiom ... d4_relat_2:
% CSA axiom d4_relat_2 found
% Looking for CSA axiom ... rc1_ordinal1:
% CSA axiom rc1_ordinal1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc3_ordinal1:
% CSA axiom rc3_ordinal1 found
% Looking for CSA axiom ... cc1_funct_1:
% CSA axiom cc1_funct_1 found
% Looking for CSA axiom ... cc2_funct_1:
% CSA axiom cc2_funct_1 found
% ---- Iteration 7 (18 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 ... d5_tarski:
% CSA axiom d5_tarski found
% Looking for CSA axiom ... d6_relat_1:
% CSA axiom d6_relat_1 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... d1_wellord2:
% CSA axiom d1_wellord2 found
% Looking for CSA axiom ... rc2_ordinal1:
% t2_subset: CSA axiom t2_subset found
% Looking for CSA axiom ... t6_boole:
% CSA axiom t6_boole found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_ordinal1:
% fc2_xboole_0:
% CSA axiom fc2_xboole_0 found
% Looking for CSA axiom ... fc3_xboole_0:
% CSA axiom fc3_xboole_0 found
% Looking for CSA axiom ... t3_subset:
% CSA axiom t3_subset found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_ordinal1:
% t4_subset:
% CSA axiom t4_subset found
% Looking for CSA axiom ... t7_boole:
% CSA axiom t7_boole found
% Looking for CSA axiom ... t8_boole:
% fc1_xboole_0:
% fc1_zfmisc_1:
% CSA axiom fc1_zfmisc_1 found
% ---- Iteration 11 (30 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_ordinal1:
% t8_boole:
% fc1_xboole_0:
% fc2_ordinal1:
% CSA axiom fc2_ordinal1 found
% Looking for CSA axiom ... t1_boole:
% CSA axiom t1_boole found
% Looking for CSA axiom ... t1_subset:
% commutativity_k2_tarski:
% CSA axiom commutativity_k2_tarski found
% ---- Iteration 12 (33 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_ordinal1:
% t8_boole:
% fc1_xboole_0:
% t1_subset:
% commutativity_k2_xboole_0:
% CSA axiom commutativity_k2_xboole_0 found
% Looking for CSA axiom ... d10_xboole_0:
% CSA axiom d10_xboole_0 found
% Looking for CSA axiom ... idempotence_k2_xboole_0:
% CSA axiom idempotence_k2_xboole_0 found
% ---- Iteration 13 (36 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :idempotence_k2_xboole_0:d10_xboole_0:commutativity_k2_xboole_0:commutativity_k2_tarski:t1_boole:fc2_ordinal1:fc1_zfmisc_1:t7_boole:t4_subset:t3_subset:fc3_xboole_0:fc2_xboole_0:t6_boole:t2_subset:d1_wellord2:d6_relat_1:d5_tarski:existence_m1_subset_1:cc2_funct_1:cc1_funct_1:rc3_ordinal1:rc1_ordinal1:d4_relat_2:cc3_ordinal1:cc2_ordinal1:cc1_ordinal1:antisymmetry_r2_hidden:rc4_funct_1:rc3_funct_1:rc2_funct_1:rc1_funct_1:rc2_xboole_0:rc1_xboole_0:d12_relat_2:reflexivity_r1_tarski:dt_k1_wellord2 (36)
% Unselected axioms are ... :rc2_ordinal1:t8_boole:fc1_xboole_0:t1_subset: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_k2_xboole_0:dt_k3_relat_1:dt_k4_tarski:dt_m1_subset_1 (15)
% SZS status THM for /tmp/SystemOnTPTP24832/SEU271+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP24832/SEU271+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 32445
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(4, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(15, axiom,![X1]:![X2]:(relation(X2)=>(X2=inclusion_relation(X1)<=>(relation_field(X2)=X1&![X3]:![X4]:((in(X3,X1)&in(X4,X1))=>(in(ordered_pair(X3,X4),X2)<=>subset(X3,X4)))))),file('/tmp/SRASS.s.p', d1_wellord2)).
% fof(17, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(23, axiom,![X1]:(relation(X1)=>![X2]:(is_antisymmetric_in(X1,X2)<=>![X3]:![X4]:((((in(X3,X2)&in(X4,X2))&in(ordered_pair(X3,X4),X1))&in(ordered_pair(X4,X3),X1))=>X3=X4))),file('/tmp/SRASS.s.p', d4_relat_2)).
% fof(34, axiom,![X1]:(relation(X1)=>(antisymmetric(X1)<=>is_antisymmetric_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d12_relat_2)).
% fof(36, axiom,![X1]:relation(inclusion_relation(X1)),file('/tmp/SRASS.s.p', dt_k1_wellord2)).
% fof(37, conjecture,![X1]:antisymmetric(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t5_wellord2)).
% fof(38, negated_conjecture,~(![X1]:antisymmetric(inclusion_relation(X1))),inference(assume_negation,[status(cth)],[37])).
% fof(47, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(48, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[49])).
% fof(55, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(56,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(91, plain,![X1]:![X2]:(~(relation(X2))|((~(X2=inclusion_relation(X1))|(relation_field(X2)=X1&![X3]:![X4]:((~(in(X3,X1))|~(in(X4,X1)))|((~(in(ordered_pair(X3,X4),X2))|subset(X3,X4))&(~(subset(X3,X4))|in(ordered_pair(X3,X4),X2))))))&((~(relation_field(X2)=X1)|?[X3]:?[X4]:((in(X3,X1)&in(X4,X1))&((~(in(ordered_pair(X3,X4),X2))|~(subset(X3,X4)))&(in(ordered_pair(X3,X4),X2)|subset(X3,X4)))))|X2=inclusion_relation(X1)))),inference(fof_nnf,[status(thm)],[15])).
% fof(92, plain,![X5]:![X6]:(~(relation(X6))|((~(X6=inclusion_relation(X5))|(relation_field(X6)=X5&![X7]:![X8]:((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))))&((~(relation_field(X6)=X5)|?[X9]:?[X10]:((in(X9,X5)&in(X10,X5))&((~(in(ordered_pair(X9,X10),X6))|~(subset(X9,X10)))&(in(ordered_pair(X9,X10),X6)|subset(X9,X10)))))|X6=inclusion_relation(X5)))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X5]:![X6]:(~(relation(X6))|((~(X6=inclusion_relation(X5))|(relation_field(X6)=X5&![X7]:![X8]:((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))))&((~(relation_field(X6)=X5)|((in(esk1_2(X5,X6),X5)&in(esk2_2(X5,X6),X5))&((~(in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X6))|~(subset(esk1_2(X5,X6),esk2_2(X5,X6))))&(in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X6)|subset(esk1_2(X5,X6),esk2_2(X5,X6))))))|X6=inclusion_relation(X5)))),inference(skolemize,[status(esa)],[92])).
% fof(94, plain,![X5]:![X6]:![X7]:![X8]:((((((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))&relation_field(X6)=X5)|~(X6=inclusion_relation(X5)))&((~(relation_field(X6)=X5)|((in(esk1_2(X5,X6),X5)&in(esk2_2(X5,X6),X5))&((~(in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X6))|~(subset(esk1_2(X5,X6),esk2_2(X5,X6))))&(in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X6)|subset(esk1_2(X5,X6),esk2_2(X5,X6))))))|X6=inclusion_relation(X5)))|~(relation(X6))),inference(shift_quantors,[status(thm)],[93])).
% fof(95, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))|(~(in(X7,X5))|~(in(X8,X5))))|~(X6=inclusion_relation(X5)))|~(relation(X6)))&((((~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))|(~(in(X7,X5))|~(in(X8,X5))))|~(X6=inclusion_relation(X5)))|~(relation(X6))))&((relation_field(X6)=X5|~(X6=inclusion_relation(X5)))|~(relation(X6))))&(((((in(esk1_2(X5,X6),X5)|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))&(((in(esk2_2(X5,X6),X5)|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6))))&(((((~(in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X6))|~(subset(esk1_2(X5,X6),esk2_2(X5,X6))))|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))&((((in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X6)|subset(esk1_2(X5,X6),esk2_2(X5,X6)))|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))))),inference(distribute,[status(thm)],[94])).
% cnf(100,plain,(relation_field(X1)=X2|~relation(X1)|X1!=inclusion_relation(X2)),inference(split_conjunct,[status(thm)],[95])).
% cnf(102,plain,(subset(X4,X3)|~relation(X1)|X1!=inclusion_relation(X2)|~in(X3,X2)|~in(X4,X2)|~in(ordered_pair(X4,X3),X1)),inference(split_conjunct,[status(thm)],[95])).
% fof(106, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[17])).
% cnf(107,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[106])).
% fof(131, plain,![X1]:(~(relation(X1))|![X2]:((~(is_antisymmetric_in(X1,X2))|![X3]:![X4]:((((~(in(X3,X2))|~(in(X4,X2)))|~(in(ordered_pair(X3,X4),X1)))|~(in(ordered_pair(X4,X3),X1)))|X3=X4))&(?[X3]:?[X4]:((((in(X3,X2)&in(X4,X2))&in(ordered_pair(X3,X4),X1))&in(ordered_pair(X4,X3),X1))&~(X3=X4))|is_antisymmetric_in(X1,X2)))),inference(fof_nnf,[status(thm)],[23])).
% fof(132, plain,![X5]:(~(relation(X5))|![X6]:((~(is_antisymmetric_in(X5,X6))|![X7]:![X8]:((((~(in(X7,X6))|~(in(X8,X6)))|~(in(ordered_pair(X7,X8),X5)))|~(in(ordered_pair(X8,X7),X5)))|X7=X8))&(?[X9]:?[X10]:((((in(X9,X6)&in(X10,X6))&in(ordered_pair(X9,X10),X5))&in(ordered_pair(X10,X9),X5))&~(X9=X10))|is_antisymmetric_in(X5,X6)))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X5]:(~(relation(X5))|![X6]:((~(is_antisymmetric_in(X5,X6))|![X7]:![X8]:((((~(in(X7,X6))|~(in(X8,X6)))|~(in(ordered_pair(X7,X8),X5)))|~(in(ordered_pair(X8,X7),X5)))|X7=X8))&(((((in(esk6_2(X5,X6),X6)&in(esk7_2(X5,X6),X6))&in(ordered_pair(esk6_2(X5,X6),esk7_2(X5,X6)),X5))&in(ordered_pair(esk7_2(X5,X6),esk6_2(X5,X6)),X5))&~(esk6_2(X5,X6)=esk7_2(X5,X6)))|is_antisymmetric_in(X5,X6)))),inference(skolemize,[status(esa)],[132])).
% fof(134, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(X7,X6))|~(in(X8,X6)))|~(in(ordered_pair(X7,X8),X5)))|~(in(ordered_pair(X8,X7),X5)))|X7=X8)|~(is_antisymmetric_in(X5,X6)))&(((((in(esk6_2(X5,X6),X6)&in(esk7_2(X5,X6),X6))&in(ordered_pair(esk6_2(X5,X6),esk7_2(X5,X6)),X5))&in(ordered_pair(esk7_2(X5,X6),esk6_2(X5,X6)),X5))&~(esk6_2(X5,X6)=esk7_2(X5,X6)))|is_antisymmetric_in(X5,X6)))|~(relation(X5))),inference(shift_quantors,[status(thm)],[133])).
% fof(135, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(X7,X6))|~(in(X8,X6)))|~(in(ordered_pair(X7,X8),X5)))|~(in(ordered_pair(X8,X7),X5)))|X7=X8)|~(is_antisymmetric_in(X5,X6)))|~(relation(X5)))&((((((in(esk6_2(X5,X6),X6)|is_antisymmetric_in(X5,X6))|~(relation(X5)))&((in(esk7_2(X5,X6),X6)|is_antisymmetric_in(X5,X6))|~(relation(X5))))&((in(ordered_pair(esk6_2(X5,X6),esk7_2(X5,X6)),X5)|is_antisymmetric_in(X5,X6))|~(relation(X5))))&((in(ordered_pair(esk7_2(X5,X6),esk6_2(X5,X6)),X5)|is_antisymmetric_in(X5,X6))|~(relation(X5))))&((~(esk6_2(X5,X6)=esk7_2(X5,X6))|is_antisymmetric_in(X5,X6))|~(relation(X5))))),inference(distribute,[status(thm)],[134])).
% cnf(136,plain,(is_antisymmetric_in(X1,X2)|~relation(X1)|esk6_2(X1,X2)!=esk7_2(X1,X2)),inference(split_conjunct,[status(thm)],[135])).
% cnf(137,plain,(is_antisymmetric_in(X1,X2)|in(ordered_pair(esk7_2(X1,X2),esk6_2(X1,X2)),X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[135])).
% cnf(138,plain,(is_antisymmetric_in(X1,X2)|in(ordered_pair(esk6_2(X1,X2),esk7_2(X1,X2)),X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[135])).
% cnf(139,plain,(is_antisymmetric_in(X1,X2)|in(esk7_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[135])).
% cnf(140,plain,(is_antisymmetric_in(X1,X2)|in(esk6_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[135])).
% fof(184, plain,![X1]:(~(relation(X1))|((~(antisymmetric(X1))|is_antisymmetric_in(X1,relation_field(X1)))&(~(is_antisymmetric_in(X1,relation_field(X1)))|antisymmetric(X1)))),inference(fof_nnf,[status(thm)],[34])).
% fof(185, plain,![X2]:(~(relation(X2))|((~(antisymmetric(X2))|is_antisymmetric_in(X2,relation_field(X2)))&(~(is_antisymmetric_in(X2,relation_field(X2)))|antisymmetric(X2)))),inference(variable_rename,[status(thm)],[184])).
% fof(186, plain,![X2]:(((~(antisymmetric(X2))|is_antisymmetric_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_antisymmetric_in(X2,relation_field(X2)))|antisymmetric(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[185])).
% cnf(187,plain,(antisymmetric(X1)|~relation(X1)|~is_antisymmetric_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[186])).
% fof(191, plain,![X2]:relation(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[36])).
% cnf(192,plain,(relation(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[191])).
% fof(193, negated_conjecture,?[X1]:~(antisymmetric(inclusion_relation(X1))),inference(fof_nnf,[status(thm)],[38])).
% fof(194, negated_conjecture,?[X2]:~(antisymmetric(inclusion_relation(X2))),inference(variable_rename,[status(thm)],[193])).
% fof(195, negated_conjecture,~(antisymmetric(inclusion_relation(esk14_0))),inference(skolemize,[status(esa)],[194])).
% cnf(196,negated_conjecture,(~antisymmetric(inclusion_relation(esk14_0))),inference(split_conjunct,[status(thm)],[195])).
% cnf(197,plain,(is_antisymmetric_in(X1,X2)|in(unordered_pair(unordered_pair(esk6_2(X1,X2),esk7_2(X1,X2)),singleton(esk6_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[138,107,theory(equality)]),['unfolding']).
% cnf(198,plain,(is_antisymmetric_in(X1,X2)|in(unordered_pair(unordered_pair(esk7_2(X1,X2),esk6_2(X1,X2)),singleton(esk7_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[137,107,theory(equality)]),['unfolding']).
% cnf(201,plain,(subset(X4,X3)|inclusion_relation(X2)!=X1|~relation(X1)|~in(X4,X2)|~in(X3,X2)|~in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1)),inference(rw,[status(thm)],[102,107,theory(equality)]),['unfolding']).
% cnf(209,plain,(relation_field(inclusion_relation(X1))=X1|~relation(inclusion_relation(X1))),inference(er,[status(thm)],[100,theory(equality)])).
% cnf(210,plain,(relation_field(inclusion_relation(X1))=X1|$false),inference(rw,[status(thm)],[209,192,theory(equality)])).
% cnf(211,plain,(relation_field(inclusion_relation(X1))=X1),inference(cn,[status(thm)],[210,theory(equality)])).
% cnf(265,plain,(subset(X1,X2)|inclusion_relation(X3)!=X4|~in(unordered_pair(unordered_pair(X2,X1),singleton(X1)),X4)|~in(X1,X3)|~in(X2,X3)|~relation(X4)),inference(spm,[status(thm)],[201,56,theory(equality)])).
% cnf(267,plain,(subset(X1,X2)|inclusion_relation(X3)!=X4|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X4)|~in(X1,X3)|~in(X2,X3)|~relation(X4)),inference(spm,[status(thm)],[201,56,theory(equality)])).
% cnf(278,plain,(is_antisymmetric_in(X1,X2)|in(unordered_pair(singleton(esk6_2(X1,X2)),unordered_pair(esk6_2(X1,X2),esk7_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[197,56,theory(equality)])).
% cnf(282,plain,(is_antisymmetric_in(X1,X2)|in(unordered_pair(singleton(esk7_2(X1,X2)),unordered_pair(esk6_2(X1,X2),esk7_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[198,56,theory(equality)]),56,theory(equality)])).
% cnf(292,plain,(antisymmetric(inclusion_relation(X1))|~is_antisymmetric_in(inclusion_relation(X1),X1)|~relation(inclusion_relation(X1))),inference(spm,[status(thm)],[187,211,theory(equality)])).
% cnf(295,plain,(antisymmetric(inclusion_relation(X1))|~is_antisymmetric_in(inclusion_relation(X1),X1)|$false),inference(rw,[status(thm)],[292,192,theory(equality)])).
% cnf(296,plain,(antisymmetric(inclusion_relation(X1))|~is_antisymmetric_in(inclusion_relation(X1),X1)),inference(cn,[status(thm)],[295,theory(equality)])).
% cnf(423,plain,(subset(X1,X2)|inclusion_relation(X3)!=X4|~in(unordered_pair(singleton(X1),unordered_pair(X2,X1)),X4)|~in(X1,X3)|~in(X2,X3)|~relation(X4)),inference(spm,[status(thm)],[265,56,theory(equality)])).
% cnf(461,plain,(subset(esk6_2(X1,X2),esk7_2(X1,X2))|is_antisymmetric_in(X1,X2)|inclusion_relation(X3)!=X1|~in(esk6_2(X1,X2),X3)|~in(esk7_2(X1,X2),X3)|~relation(X1)),inference(spm,[status(thm)],[267,278,theory(equality)])).
% cnf(768,plain,(subset(esk7_2(X1,X2),esk6_2(X1,X2))|is_antisymmetric_in(X1,X2)|inclusion_relation(X3)!=X1|~in(esk7_2(X1,X2),X3)|~in(esk6_2(X1,X2),X3)|~relation(X1)),inference(spm,[status(thm)],[423,282,theory(equality)])).
% cnf(1962,plain,(is_antisymmetric_in(X1,X2)|subset(esk6_2(X1,X2),esk7_2(X1,X2))|inclusion_relation(X2)!=X1|~in(esk6_2(X1,X2),X2)|~relation(X1)),inference(spm,[status(thm)],[461,139,theory(equality)])).
% cnf(1964,plain,(is_antisymmetric_in(X1,X2)|subset(esk6_2(X1,X2),esk7_2(X1,X2))|inclusion_relation(X2)!=X1|~relation(X1)),inference(csr,[status(thm)],[1962,140])).
% cnf(1965,plain,(esk7_2(X1,X2)=esk6_2(X1,X2)|is_antisymmetric_in(X1,X2)|~subset(esk7_2(X1,X2),esk6_2(X1,X2))|inclusion_relation(X2)!=X1|~relation(X1)),inference(spm,[status(thm)],[50,1964,theory(equality)])).
% cnf(1972,plain,(is_antisymmetric_in(X1,X2)|inclusion_relation(X2)!=X1|~relation(X1)|~subset(esk7_2(X1,X2),esk6_2(X1,X2))),inference(csr,[status(thm)],[1965,136])).
% cnf(2644,plain,(is_antisymmetric_in(X1,X2)|subset(esk7_2(X1,X2),esk6_2(X1,X2))|inclusion_relation(X2)!=X1|~in(esk6_2(X1,X2),X2)|~relation(X1)),inference(spm,[status(thm)],[768,139,theory(equality)])).
% cnf(2646,plain,(is_antisymmetric_in(X1,X2)|subset(esk7_2(X1,X2),esk6_2(X1,X2))|inclusion_relation(X2)!=X1|~relation(X1)),inference(csr,[status(thm)],[2644,140])).
% cnf(2647,plain,(is_antisymmetric_in(X1,X2)|inclusion_relation(X2)!=X1|~relation(X1)),inference(csr,[status(thm)],[2646,1972])).
% cnf(2648,plain,(antisymmetric(inclusion_relation(X1))|~relation(inclusion_relation(X1))),inference(spm,[status(thm)],[296,2647,theory(equality)])).
% cnf(2650,plain,(antisymmetric(inclusion_relation(X1))|$false),inference(rw,[status(thm)],[2648,192,theory(equality)])).
% cnf(2651,plain,(antisymmetric(inclusion_relation(X1))),inference(cn,[status(thm)],[2650,theory(equality)])).
% cnf(2656,negated_conjecture,($false),inference(rw,[status(thm)],[196,2651,theory(equality)])).
% cnf(2657,negated_conjecture,($false),inference(cn,[status(thm)],[2656,theory(equality)])).
% cnf(2658,negated_conjecture,($false),2657,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 592
% # ...of these trivial : 1
% # ...subsumed : 268
% # ...remaining for further processing: 323
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 7
% # Generated clauses : 1851
% # ...of the previous two non-trivial : 1735
% # Contextual simplify-reflections : 81
% # Paramodulations : 1838
% # Factorizations : 0
% # Equation resolutions : 13
% # Current number of processed clauses: 308
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 8
% # Non-unit-clauses : 263
% # Current number of unprocessed clauses: 1207
% # ...number of literals in the above : 10234
% # Clause-clause subsumption calls (NU) : 9236
% # Rec. Clause-clause subsumption calls : 2680
% # Unit Clause-clause subsumption calls : 95
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 316 leaves, 1.70+/-1.684 terms/leaf
% # Paramod-from index: 100 leaves, 1.37+/-1.137 terms/leaf
% # Paramod-into index: 270 leaves, 1.60+/-1.492 terms/leaf
% # -------------------------------------------------
% # User time : 0.172 s
% # System time : 0.007 s
% # Total time : 0.179 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.31 CPU 0.40 WC
% FINAL PrfWatch: 0.31 CPU 0.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP24832/SEU271+1.tptp
%
%------------------------------------------------------------------------------