TSTP Solution File: KRS174+1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : KRS174+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat Sep 17 17:45:04 EDT 2022

% Result   : Theorem 0.20s 0.39s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KRS174+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34  % Computer : n003.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Sep  1 09:42:09 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.34  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.20/0.34  Usage: tptp [options] [-file:]file
% 0.20/0.34    -h, -?       prints this message.
% 0.20/0.34    -smt2        print SMT-LIB2 benchmark.
% 0.20/0.34    -m, -model   generate model.
% 0.20/0.34    -p, -proof   generate proof.
% 0.20/0.34    -c, -core    generate unsat core of named formulas.
% 0.20/0.34    -st, -statistics display statistics.
% 0.20/0.34    -t:timeout   set timeout (in second).
% 0.20/0.34    -smt2status  display status in smt2 format instead of SZS.
% 0.20/0.34    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.20/0.34    -<param>:<value> configuration parameter and value.
% 0.20/0.34    -o:<output-file> file to place output in.
% 0.20/0.39  % SZS status Theorem
% 0.20/0.39  % SZS output start Proof
% 0.20/0.39  tff(ia_type, type, (
% 0.20/0.39     ia: $i)).
% 0.20/0.39  tff(tptp_fun_X_0_type, type, (
% 0.20/0.39     tptp_fun_X_0: $i)).
% 0.20/0.39  tff(cA_type, type, (
% 0.20/0.39     cA: $i > $o)).
% 0.20/0.39  tff(ib_type, type, (
% 0.20/0.39     ib: $i)).
% 0.20/0.39  tff(cA_and_B_type, type, (
% 0.20/0.39     cA_and_B: $i > $o)).
% 0.20/0.39  tff(cB_type, type, (
% 0.20/0.39     cB: $i > $o)).
% 0.20/0.39  tff(xsd_integer_type, type, (
% 0.20/0.39     xsd_integer: $i > $o)).
% 0.20/0.39  tff(xsd_string_type, type, (
% 0.20/0.39     xsd_string: $i > $o)).
% 0.20/0.39  tff(cowlNothing_type, type, (
% 0.20/0.39     cowlNothing: $i > $o)).
% 0.20/0.39  tff(cowlThing_type, type, (
% 0.20/0.39     cowlThing: $i > $o)).
% 0.20/0.39  tff(1,assumption,(~(cA(X!0) | cB(X!0))), introduced(assumption)).
% 0.20/0.39  tff(2,plain,
% 0.20/0.39      ((~(cA_and_B(X!0) <=> (cA(X!0) | cB(X!0)))) <=> ((~cA_and_B(X!0)) <=> (cA(X!0) | cB(X!0)))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(3,plain,
% 0.20/0.39      ((~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))) <=> (~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X))))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(4,plain,
% 0.20/0.39      ((~(![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X))) & ![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X))))) <=> (~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X))))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(5,plain,
% 0.20/0.39      ((![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X))) & ![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))) <=> (![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X))) & ![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X))))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(6,plain,
% 0.20/0.39      ((~(![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X))) & ![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X))))) <=> (~(![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X))) & ![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))))),
% 0.20/0.39      inference(monotonicity,[status(thm)],[5])).
% 0.20/0.39  tff(7,plain,
% 0.20/0.39      ((~((![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X)))) & ![X: $i] : (cA_and_B(X) <=> (cB(X) | cA(X))))) <=> (~(![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X))) & ![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(8,axiom,(~((![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X)))) & ![X: $i] : (cA_and_B(X) <=> (cB(X) | cA(X))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','the_axiom')).
% 0.20/0.39  tff(9,plain,
% 0.20/0.39      (~(![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X))) & ![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X))))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[8, 7])).
% 0.20/0.39  tff(10,plain,
% 0.20/0.39      (~(![X: $i] : (cowlThing(X) & (~cowlNothing(X))) & ![X: $i] : (xsd_string(X) <=> (~xsd_integer(X))) & ![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X))))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[9, 6])).
% 0.20/0.39  tff(11,plain,
% 0.20/0.39      (~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[10, 4])).
% 0.20/0.39  tff(12,plain,
% 0.20/0.39      (~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[11, 3])).
% 0.20/0.39  tff(13,plain,
% 0.20/0.39      (~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[12, 3])).
% 0.20/0.39  tff(14,plain,
% 0.20/0.39      (~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[13, 3])).
% 0.20/0.39  tff(15,plain,
% 0.20/0.39      (~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[14, 3])).
% 0.20/0.39  tff(16,plain,
% 0.20/0.39      (~![X: $i] : (cA_and_B(X) <=> (cA(X) | cB(X)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[15, 3])).
% 0.20/0.39  tff(17,plain,(
% 0.20/0.39      ~(cA_and_B(X!0) <=> (cA(X!0) | cB(X!0)))),
% 0.20/0.39      inference(skolemize,[status(sab)],[16])).
% 0.20/0.39  tff(18,plain,
% 0.20/0.39      ((~cA_and_B(X!0)) <=> (cA(X!0) | cB(X!0))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[17, 2])).
% 0.20/0.39  tff(19,plain,
% 0.20/0.39      (cA_and_B(X!0) | (cA(X!0) | cB(X!0)) | (~((~cA_and_B(X!0)) <=> (cA(X!0) | cB(X!0))))),
% 0.20/0.39      inference(tautology,[status(thm)],[])).
% 0.20/0.39  tff(20,plain,
% 0.20/0.39      (cA_and_B(X!0) | (cA(X!0) | cB(X!0))),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[19, 18])).
% 0.20/0.39  tff(21,plain,
% 0.20/0.39      (cA_and_B(X!0)),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[20, 1])).
% 0.20/0.39  tff(22,plain,
% 0.20/0.39      (^[X: $i] : refl((cA_and_B(X) <=> ((X = ia) | (X = ib))) <=> (cA_and_B(X) <=> ((X = ia) | (X = ib))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(23,plain,
% 0.20/0.39      (![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib))) <=> ![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib)))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[22])).
% 0.20/0.39  tff(24,plain,
% 0.20/0.39      (![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib))) <=> ![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib)))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(25,plain,
% 0.20/0.39      (^[X: $i] : rewrite((cA_and_B(X) <=> ((X = ib) | (X = ia))) <=> (cA_and_B(X) <=> ((X = ia) | (X = ib))))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(26,plain,
% 0.20/0.39      (![X: $i] : (cA_and_B(X) <=> ((X = ib) | (X = ia))) <=> ![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib)))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[25])).
% 0.20/0.39  tff(27,axiom,(![X: $i] : (cA_and_B(X) <=> ((X = ib) | (X = ia)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom_3')).
% 0.20/0.39  tff(28,plain,
% 0.20/0.39      (![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[27, 26])).
% 0.20/0.39  tff(29,plain,
% 0.20/0.39      (![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[28, 24])).
% 0.20/0.39  tff(30,plain,(
% 0.20/0.39      ![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib)))),
% 0.20/0.39      inference(skolemize,[status(sab)],[29])).
% 0.20/0.39  tff(31,plain,
% 0.20/0.39      (![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib)))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[30, 23])).
% 0.20/0.39  tff(32,plain,
% 0.20/0.39      ((~![X: $i] : (cA_and_B(X) <=> ((X = ia) | (X = ib)))) | (cA_and_B(X!0) <=> ((X!0 = ia) | (X!0 = ib)))),
% 0.20/0.39      inference(quant_inst,[status(thm)],[])).
% 0.20/0.39  tff(33,plain,
% 0.20/0.39      (cA_and_B(X!0) <=> ((X!0 = ia) | (X!0 = ib))),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[32, 31])).
% 0.20/0.39  tff(34,plain,
% 0.20/0.39      ((~(cA_and_B(X!0) <=> ((X!0 = ia) | (X!0 = ib)))) | (~cA_and_B(X!0)) | ((X!0 = ia) | (X!0 = ib))),
% 0.20/0.39      inference(tautology,[status(thm)],[])).
% 0.20/0.39  tff(35,plain,
% 0.20/0.39      ((~cA_and_B(X!0)) | ((X!0 = ia) | (X!0 = ib))),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[34, 33])).
% 0.20/0.39  tff(36,plain,
% 0.20/0.39      ((X!0 = ia) | (X!0 = ib)),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[35, 21])).
% 0.20/0.39  tff(37,plain,
% 0.20/0.39      (^[X: $i] : refl((cB(X) <=> (X = ib)) <=> (cB(X) <=> (X = ib)))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(38,plain,
% 0.20/0.39      (![X: $i] : (cB(X) <=> (X = ib)) <=> ![X: $i] : (cB(X) <=> (X = ib))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[37])).
% 0.20/0.39  tff(39,plain,
% 0.20/0.39      (![X: $i] : (cB(X) <=> (X = ib)) <=> ![X: $i] : (cB(X) <=> (X = ib))),
% 0.20/0.39      inference(rewrite,[status(thm)],[])).
% 0.20/0.39  tff(40,axiom,(![X: $i] : (cB(X) <=> (X = ib))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom_4')).
% 0.20/0.39  tff(41,plain,
% 0.20/0.39      (![X: $i] : (cB(X) <=> (X = ib))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[40, 39])).
% 0.20/0.39  tff(42,plain,(
% 0.20/0.39      ![X: $i] : (cB(X) <=> (X = ib))),
% 0.20/0.39      inference(skolemize,[status(sab)],[41])).
% 0.20/0.39  tff(43,plain,
% 0.20/0.39      (![X: $i] : (cB(X) <=> (X = ib))),
% 0.20/0.39      inference(modus_ponens,[status(thm)],[42, 38])).
% 0.20/0.39  tff(44,plain,
% 0.20/0.39      ((~![X: $i] : (cB(X) <=> (X = ib))) | (cB(X!0) <=> (X!0 = ib))),
% 0.20/0.39      inference(quant_inst,[status(thm)],[])).
% 0.20/0.39  tff(45,plain,
% 0.20/0.39      (cB(X!0) <=> (X!0 = ib)),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[44, 43])).
% 0.20/0.39  tff(46,plain,
% 0.20/0.39      ((cA(X!0) | cB(X!0)) | (~cB(X!0))),
% 0.20/0.39      inference(tautology,[status(thm)],[])).
% 0.20/0.39  tff(47,plain,
% 0.20/0.39      (~cB(X!0)),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[46, 1])).
% 0.20/0.39  tff(48,plain,
% 0.20/0.39      ((~(cB(X!0) <=> (X!0 = ib))) | cB(X!0) | (~(X!0 = ib))),
% 0.20/0.39      inference(tautology,[status(thm)],[])).
% 0.20/0.39  tff(49,plain,
% 0.20/0.39      ((~(cB(X!0) <=> (X!0 = ib))) | (~(X!0 = ib))),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[48, 47])).
% 0.20/0.39  tff(50,plain,
% 0.20/0.39      (~(X!0 = ib)),
% 0.20/0.39      inference(unit_resolution,[status(thm)],[49, 45])).
% 0.20/0.39  tff(51,plain,
% 0.20/0.39      (^[X: $i] : refl((cA(X) <=> (X = ia)) <=> (cA(X) <=> (X = ia)))),
% 0.20/0.39      inference(bind,[status(th)],[])).
% 0.20/0.39  tff(52,plain,
% 0.20/0.39      (![X: $i] : (cA(X) <=> (X = ia)) <=> ![X: $i] : (cA(X) <=> (X = ia))),
% 0.20/0.39      inference(quant_intro,[status(thm)],[51])).
% 0.20/0.39  tff(53,plain,
% 0.20/0.40      (![X: $i] : (cA(X) <=> (X = ia)) <=> ![X: $i] : (cA(X) <=> (X = ia))),
% 0.20/0.40      inference(rewrite,[status(thm)],[])).
% 0.20/0.40  tff(54,axiom,(![X: $i] : (cA(X) <=> (X = ia))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom_2')).
% 0.20/0.40  tff(55,plain,
% 0.20/0.40      (![X: $i] : (cA(X) <=> (X = ia))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[54, 53])).
% 0.20/0.40  tff(56,plain,(
% 0.20/0.40      ![X: $i] : (cA(X) <=> (X = ia))),
% 0.20/0.40      inference(skolemize,[status(sab)],[55])).
% 0.20/0.40  tff(57,plain,
% 0.20/0.40      (![X: $i] : (cA(X) <=> (X = ia))),
% 0.20/0.40      inference(modus_ponens,[status(thm)],[56, 52])).
% 0.20/0.40  tff(58,plain,
% 0.20/0.40      ((~![X: $i] : (cA(X) <=> (X = ia))) | (cA(X!0) <=> (X!0 = ia))),
% 0.20/0.40      inference(quant_inst,[status(thm)],[])).
% 0.20/0.40  tff(59,plain,
% 0.20/0.40      (cA(X!0) <=> (X!0 = ia)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[58, 57])).
% 0.20/0.40  tff(60,plain,
% 0.20/0.40      ((cA(X!0) | cB(X!0)) | (~cA(X!0))),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(61,plain,
% 0.20/0.40      (~cA(X!0)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[60, 1])).
% 0.20/0.40  tff(62,plain,
% 0.20/0.40      ((~(cA(X!0) <=> (X!0 = ia))) | cA(X!0) | (~(X!0 = ia))),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(63,plain,
% 0.20/0.40      ((~(cA(X!0) <=> (X!0 = ia))) | (~(X!0 = ia))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[62, 61])).
% 0.20/0.40  tff(64,plain,
% 0.20/0.40      (~(X!0 = ia)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[63, 59])).
% 0.20/0.40  tff(65,plain,
% 0.20/0.40      ((~((X!0 = ia) | (X!0 = ib))) | (X!0 = ia) | (X!0 = ib)),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(66,plain,
% 0.20/0.40      ($false),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[65, 64, 50, 36])).
% 0.20/0.40  tff(67,plain,(cA(X!0) | cB(X!0)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.40  tff(68,plain,
% 0.20/0.40      ((~cA_and_B(X!0)) | (~(cA(X!0) | cB(X!0))) | (~((~cA_and_B(X!0)) <=> (cA(X!0) | cB(X!0))))),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(69,plain,
% 0.20/0.40      ((~cA_and_B(X!0)) | (~(cA(X!0) | cB(X!0)))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[68, 18])).
% 0.20/0.40  tff(70,plain,
% 0.20/0.40      (~cA_and_B(X!0)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[69, 67])).
% 0.20/0.40  tff(71,plain,
% 0.20/0.40      ((~(cA_and_B(X!0) <=> ((X!0 = ia) | (X!0 = ib)))) | cA_and_B(X!0) | (~((X!0 = ia) | (X!0 = ib)))),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(72,plain,
% 0.20/0.40      (cA_and_B(X!0) | (~((X!0 = ia) | (X!0 = ib)))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[71, 33])).
% 0.20/0.40  tff(73,plain,
% 0.20/0.40      (~((X!0 = ia) | (X!0 = ib))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[72, 70])).
% 0.20/0.40  tff(74,plain,
% 0.20/0.40      (((X!0 = ia) | (X!0 = ib)) | (~(X!0 = ia))),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(75,plain,
% 0.20/0.40      (~(X!0 = ia)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[74, 73])).
% 0.20/0.40  tff(76,assumption,(~(cB(X!0) <=> (X!0 = ib))), introduced(assumption)).
% 0.20/0.40  tff(77,plain,
% 0.20/0.40      ($false),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[44, 43, 76])).
% 0.20/0.40  tff(78,plain,(cB(X!0) <=> (X!0 = ib)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.40  tff(79,plain,
% 0.20/0.40      (((X!0 = ia) | (X!0 = ib)) | (~(X!0 = ib))),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(80,plain,
% 0.20/0.40      (~(X!0 = ib)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[79, 73])).
% 0.20/0.40  tff(81,plain,
% 0.20/0.40      ((~(cB(X!0) <=> (X!0 = ib))) | (~cB(X!0)) | (X!0 = ib)),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(82,plain,
% 0.20/0.40      ((~(cB(X!0) <=> (X!0 = ib))) | (~cB(X!0))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[81, 80])).
% 0.20/0.40  tff(83,plain,
% 0.20/0.40      (~cB(X!0)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[82, 78])).
% 0.20/0.40  tff(84,plain,
% 0.20/0.40      ((~(cA(X!0) | cB(X!0))) | cA(X!0) | cB(X!0)),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(85,plain,
% 0.20/0.40      (cA(X!0)),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[84, 83, 67])).
% 0.20/0.40  tff(86,plain,
% 0.20/0.40      ((~(cA(X!0) <=> (X!0 = ia))) | (~cA(X!0)) | (X!0 = ia)),
% 0.20/0.40      inference(tautology,[status(thm)],[])).
% 0.20/0.40  tff(87,plain,
% 0.20/0.40      (~(cA(X!0) <=> (X!0 = ia))),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[86, 85, 75])).
% 0.20/0.40  tff(88,plain,
% 0.20/0.40      ($false),
% 0.20/0.40      inference(unit_resolution,[status(thm)],[58, 57, 87])).
% 0.20/0.40  % SZS output end Proof
%------------------------------------------------------------------------------