%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS175+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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 : Wed Jul 27 13:01:31 EDT 2022
% Result : Theorem 1.89s 2.11s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 19
% Syntax : Number of clauses : 48 ( 13 unt; 22 nHn; 45 RR)
% Number of literals : 161 ( 33 equ; 79 neg)
% Maximal clause size : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( A != B
| ~ cB(A)
| cB(B) ),
file('KRS175+1.p',unknown),
[] ).
cnf(8,axiom,
~ cowlNothing(A),
file('KRS175+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ xsd_string(A)
| ~ xsd_integer(A) ),
file('KRS175+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cA(A)
| A = ia ),
file('KRS175+1.p',unknown),
[] ).
cnf(11,axiom,
( cA(A)
| A != ia ),
file('KRS175+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cA_and_B(A)
| cA(A)
| cB(A) ),
file('KRS175+1.p',unknown),
[] ).
cnf(13,axiom,
( cA_and_B(A)
| ~ cA(A) ),
file('KRS175+1.p',unknown),
[] ).
cnf(14,axiom,
( cA_and_B(A)
| ~ cB(A) ),
file('KRS175+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cB(A)
| A = ib ),
file('KRS175+1.p',unknown),
[] ).
cnf(16,axiom,
( cB(A)
| A != ib ),
file('KRS175+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| cA_and_B(dollar_c3)
| dollar_c3 = ib
| dollar_c3 = ia
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
file('KRS175+1.p',unknown),
[] ).
cnf(18,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| cA_and_B(dollar_c3)
| ib = dollar_c3
| ia = dollar_c3
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[17]),8])])]),
[iquote('copy,17,unit_del,8,flip.5,flip.6')] ).
cnf(19,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cA_and_B(dollar_c3)
| dollar_c3 != ib
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
file('KRS175+1.p',unknown),
[] ).
cnf(20,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cA_and_B(dollar_c3)
| ib != dollar_c3
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[19]),8])]),
[iquote('copy,19,unit_del,8,flip.5')] ).
cnf(21,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cA_and_B(dollar_c3)
| dollar_c3 != ia
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
file('KRS175+1.p',unknown),
[] ).
cnf(22,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cA_and_B(dollar_c3)
| ia != dollar_c3
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[21]),8])]),
[iquote('copy,21,unit_del,8,flip.5')] ).
cnf(23,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| cA_and_B(dollar_c3)
| dollar_c3 = ib
| dollar_c3 = ia
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
file('KRS175+1.p',unknown),
[] ).
cnf(24,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| cA_and_B(dollar_c3)
| ib = dollar_c3
| ia = dollar_c3
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[23]),8])])]),
[iquote('copy,23,unit_del,8,flip.5,flip.6')] ).
cnf(25,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cA_and_B(dollar_c3)
| dollar_c3 != ib
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
file('KRS175+1.p',unknown),
[] ).
cnf(26,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cA_and_B(dollar_c3)
| ib != dollar_c3
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[25]),8])]),
[iquote('copy,25,unit_del,8,flip.5')] ).
cnf(27,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cA_and_B(dollar_c3)
| dollar_c3 != ia
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
file('KRS175+1.p',unknown),
[] ).
cnf(28,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cA_and_B(dollar_c3)
| ia != dollar_c3
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[27]),8])]),
[iquote('copy,27,unit_del,8,flip.5')] ).
cnf(29,axiom,
A = A,
file('KRS175+1.p',unknown),
[] ).
cnf(30,axiom,
cowlThing(A),
file('KRS175+1.p',unknown),
[] ).
cnf(31,axiom,
( xsd_string(A)
| xsd_integer(A) ),
file('KRS175+1.p',unknown),
[] ).
cnf(32,plain,
cB(ib),
inference(hyper,[status(thm)],[29,16]),
[iquote('hyper,29,16')] ).
cnf(33,plain,
cA(ia),
inference(hyper,[status(thm)],[29,11]),
[iquote('hyper,29,11')] ).
cnf(34,plain,
cA_and_B(ib),
inference(hyper,[status(thm)],[32,14]),
[iquote('hyper,32,14')] ).
cnf(38,plain,
cA_and_B(ia),
inference(hyper,[status(thm)],[33,13]),
[iquote('hyper,33,13')] ).
cnf(42,plain,
( cA_and_B(dollar_c3)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ia = dollar_c3 ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[34,24]),30,30,30])]),
[iquote('para_into,34.1.1,24.5.1,unit_del,30,30,30,factor_simp')] ).
cnf(43,plain,
( cA_and_B(dollar_c3)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ia = dollar_c3 ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[34,18]),30,30,30])]),
[iquote('para_into,34.1.1,18.5.1,unit_del,30,30,30,factor_simp')] ).
cnf(44,plain,
( cA_and_B(dollar_c3)
| xsd_integer(dollar_c2)
| ia = dollar_c3 ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[42,31])]),
[iquote('hyper,42,31,factor_simp')] ).
cnf(49,plain,
( cA_and_B(dollar_c3)
| xsd_integer(dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[44,38])]),
[iquote('para_from,44.3.1,38.1.1,factor_simp')] ).
cnf(55,plain,
( cA_and_B(dollar_c3)
| xsd_string(dollar_c2)
| ia = dollar_c3 ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[43,49])]),
[iquote('hyper,43,49,factor_simp')] ).
cnf(56,plain,
( cA_and_B(dollar_c3)
| ia = dollar_c3 ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[55,9,49])]),
[iquote('hyper,55,9,49,factor_simp')] ).
cnf(62,plain,
cA_and_B(dollar_c3),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[56,38])]),
[iquote('para_from,56.2.1,38.1.1,factor_simp')] ).
cnf(63,plain,
( cA(dollar_c3)
| cB(dollar_c3) ),
inference(hyper,[status(thm)],[62,12]),
[iquote('hyper,62,12')] ).
cnf(64,plain,
( cA(dollar_c3)
| ib = dollar_c3 ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[63,15])]),
[iquote('hyper,63,15,flip.2')] ).
cnf(65,plain,
( ib = dollar_c3
| ia = dollar_c3 ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[64,10])]),
[iquote('hyper,64,10,flip.2')] ).
cnf(75,plain,
( ia = dollar_c3
| xsd_integer(dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[65,26,30,31,62,30,30])]),
[iquote('hyper,65,26,30,31,62,30,30,factor_simp')] ).
cnf(77,plain,
( ia = dollar_c3
| cB(dollar_c3) ),
inference(hyper,[status(thm)],[65,3,32]),
[iquote('hyper,65,3,32')] ).
cnf(96,plain,
( ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[75,28]),30,62,29,30,30])]),
[iquote('para_from,75.1.1,28.5.1,unit_del,30,62,29,30,30,factor_simp')] ).
cnf(99,plain,
xsd_integer(dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[96,31])]),
[iquote('hyper,96,31,factor_simp')] ).
cnf(116,plain,
( xsd_string(dollar_c2)
| cB(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[77,22]),30,99,62,29,30,30]),
[iquote('para_from,77.1.1,22.5.1,unit_del,30,99,62,29,30,30')] ).
cnf(118,plain,
cB(dollar_c3),
inference(hyper,[status(thm)],[116,9,99]),
[iquote('hyper,116,9,99')] ).
cnf(121,plain,
ib = dollar_c3,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[118,15])]),
[iquote('hyper,118,15,flip.1')] ).
cnf(128,plain,
xsd_string(dollar_c2),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[20]),121,121]),30,99,62,29,30,30]),
[iquote('back_demod,20,demod,121,121,unit_del,30,99,62,29,30,30')] ).
cnf(131,plain,
$false,
inference(hyper,[status(thm)],[128,9,99]),
[iquote('hyper,128,9,99')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : KRS175+1 : TPTP v8.1.0. Released v3.1.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 03:25:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.89/2.10 ----- Otter 3.3f, August 2004 -----
% 1.89/2.10 The process was started by sandbox2 on n006.cluster.edu,
% 1.89/2.10 Wed Jul 27 03:25:32 2022
% 1.89/2.10 The command was "./otter". The process ID is 31554.
% 1.89/2.10
% 1.89/2.10 set(prolog_style_variables).
% 1.89/2.10 set(auto).
% 1.89/2.10 dependent: set(auto1).
% 1.89/2.10 dependent: set(process_input).
% 1.89/2.10 dependent: clear(print_kept).
% 1.89/2.10 dependent: clear(print_new_demod).
% 1.89/2.10 dependent: clear(print_back_demod).
% 1.89/2.10 dependent: clear(print_back_sub).
% 1.89/2.10 dependent: set(control_memory).
% 1.89/2.10 dependent: assign(max_mem, 12000).
% 1.89/2.10 dependent: assign(pick_given_ratio, 4).
% 1.89/2.10 dependent: assign(stats_level, 1).
% 1.89/2.10 dependent: assign(max_seconds, 10800).
% 1.89/2.10 clear(print_given).
% 1.89/2.10
% 1.89/2.10 formula_list(usable).
% 1.89/2.10 all A (A=A).
% 1.89/2.10 all A B (A=B&cA(A)->cA(B)).
% 1.89/2.10 all A B (A=B&cA_and_B(A)->cA_and_B(B)).
% 1.89/2.10 all A B (A=B&cB(A)->cB(B)).
% 1.89/2.10 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.89/2.10 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.89/2.10 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.89/2.10 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.89/2.10 all X (cowlThing(X)& -cowlNothing(X)).
% 1.89/2.10 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.89/2.10 all X (cA(X)<->X=ia).
% 1.89/2.10 all X (cA_and_B(X)<->cA(X)|cB(X)).
% 1.89/2.10 all X (cB(X)<->X=ib).
% 1.89/2.10 cowlThing(ia).
% 1.89/2.10 cowlThing(ib).
% 1.89/2.10 -((all X (cowlThing(X)& -cowlNothing(X)))& (all X (xsd_string(X)<-> -xsd_integer(X)))& (all X (cA_and_B(X)<->X=ib|X=ia))&cowlThing(ia)&cowlThing(ib)).
% 1.89/2.10 end_of_list.
% 1.89/2.10
% 1.89/2.10 -------> usable clausifies to:
% 1.89/2.10
% 1.89/2.10 list(usable).
% 1.89/2.10 0 [] A=A.
% 1.89/2.10 0 [] A!=B| -cA(A)|cA(B).
% 1.89/2.10 0 [] A!=B| -cA_and_B(A)|cA_and_B(B).
% 1.89/2.10 0 [] A!=B| -cB(A)|cB(B).
% 1.89/2.10 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.89/2.10 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.89/2.10 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.89/2.10 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.89/2.10 0 [] cowlThing(X).
% 1.89/2.10 0 [] -cowlNothing(X).
% 1.89/2.10 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.89/2.10 0 [] xsd_string(X)|xsd_integer(X).
% 1.89/2.10 0 [] -cA(X)|X=ia.
% 1.89/2.10 0 [] cA(X)|X!=ia.
% 1.89/2.10 0 [] -cA_and_B(X)|cA(X)|cB(X).
% 1.89/2.10 0 [] cA_and_B(X)| -cA(X).
% 1.89/2.10 0 [] cA_and_B(X)| -cB(X).
% 1.89/2.10 0 [] -cB(X)|X=ib.
% 1.89/2.10 0 [] cB(X)|X!=ib.
% 1.89/2.10 0 [] cowlThing(ia).
% 1.89/2.10 0 [] cowlThing(ib).
% 1.89/2.10 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cA_and_B($c3)|$c3=ib|$c3=ia| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.10 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)|$c3!=ib| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.10 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)|$c3!=ia| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.10 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cA_and_B($c3)|$c3=ib|$c3=ia| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.10 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)|$c3!=ib| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.10 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)|$c3!=ia| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.10 end_of_list.
% 1.89/2.10
% 1.89/2.10 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.89/2.10
% 1.89/2.10 This ia a non-Horn set with equality. The strategy will be
% 1.89/2.10 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.89/2.10 deletion, with positive clauses in sos and nonpositive
% 1.89/2.10 clauses in usable.
% 1.89/2.10
% 1.89/2.10 dependent: set(knuth_bendix).
% 1.89/2.10 dependent: set(anl_eq).
% 1.89/2.10 dependent: set(para_from).
% 1.89/2.10 dependent: set(para_into).
% 1.89/2.10 dependent: clear(para_from_right).
% 1.89/2.10 dependent: clear(para_into_right).
% 1.89/2.10 dependent: set(para_from_vars).
% 1.89/2.10 dependent: set(eq_units_both_ways).
% 1.89/2.10 dependent: set(dynamic_demod_all).
% 1.89/2.10 dependent: set(dynamic_demod).
% 1.89/2.10 dependent: set(order_eq).
% 1.89/2.10 dependent: set(back_demod).
% 1.89/2.10 dependent: set(lrpo).
% 1.89/2.10 dependent: set(hyper_res).
% 1.89/2.10 dependent: set(unit_deletion).
% 1.89/2.10 dependent: set(factor).
% 1.89/2.10
% 1.89/2.10 ------------> process usable:
% 1.89/2.10 ** KEPT (pick-wt=7): 1 [] A!=B| -cA(A)|cA(B).
% 1.89/2.10 ** KEPT (pick-wt=7): 2 [] A!=B| -cA_and_B(A)|cA_and_B(B).
% 1.89/2.10 ** KEPT (pick-wt=7): 3 [] A!=B| -cB(A)|cB(B).
% 1.89/2.10 ** KEPT (pick-wt=7): 4 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.89/2.10 ** KEPT (pick-wt=7): 5 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.89/2.10 ** KEPT (pick-wt=7): 6 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.89/2.10 ** KEPT (pick-wt=7): 7 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.89/2.10 ** KEPT (pick-wt=2): 8 [] -cowlNothing(A).
% 1.89/2.10 ** KEPT (pick-wt=4): 9 [] -xsd_string(A)| -xsd_integer(A).
% 1.89/2.10 ** KEPT (pick-wt=5): 10 [] -cA(A)|A=ia.
% 1.89/2.10 ** KEPT (pick-wt=5): 11 [] cA(A)|A!=ia.
% 1.89/2.11 ** KEPT (pick-wt=6): 12 [] -cA_and_B(A)|cA(A)|cB(A).
% 1.89/2.11 ** KEPT (pick-wt=4): 13 [] cA_and_B(A)| -cA(A).
% 1.89/2.11 ** KEPT (pick-wt=4): 14 [] cA_and_B(A)| -cB(A).
% 1.89/2.11 ** KEPT (pick-wt=5): 15 [] -cB(A)|A=ib.
% 1.89/2.11 ** KEPT (pick-wt=5): 16 [] cB(A)|A!=ib.
% 1.89/2.11 ** KEPT (pick-wt=18): 18 [copy,17,unit_del,8,flip.5,flip.6] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cA_and_B($c3)|ib=$c3|ia=$c3| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.11 ** KEPT (pick-wt=15): 20 [copy,19,unit_del,8,flip.5] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)|ib!=$c3| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.11 ** KEPT (pick-wt=15): 22 [copy,21,unit_del,8,flip.5] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA_and_B($c3)|ia!=$c3| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.11 ** KEPT (pick-wt=18): 24 [copy,23,unit_del,8,flip.5,flip.6] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cA_and_B($c3)|ib=$c3|ia=$c3| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.11 ** KEPT (pick-wt=15): 26 [copy,25,unit_del,8,flip.5] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)|ib!=$c3| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.11 ** KEPT (pick-wt=15): 28 [copy,27,unit_del,8,flip.5] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA_and_B($c3)|ia!=$c3| -cowlThing(ia)| -cowlThing(ib).
% 1.89/2.11 8 back subsumes 4.
% 1.89/2.11
% 1.89/2.11 ------------> process sos:
% 1.89/2.11 ** KEPT (pick-wt=3): 29 [] A=A.
% 1.89/2.11 ** KEPT (pick-wt=2): 30 [] cowlThing(A).
% 1.89/2.11 ** KEPT (pick-wt=4): 31 [] xsd_string(A)|xsd_integer(A).
% 1.89/2.11 Following clause subsumed by 30 during input processing: 0 [] cowlThing(ia).
% 1.89/2.11 Following clause subsumed by 30 during input processing: 0 [] cowlThing(ib).
% 1.89/2.11 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] A=A.
% 1.89/2.11 30 back subsumes 5.
% 1.89/2.11
% 1.89/2.11 ======= end of input processing =======
% 1.89/2.11
% 1.89/2.11 =========== start of search ===========
% 1.89/2.11
% 1.89/2.11 -------- PROOF --------
% 1.89/2.11
% 1.89/2.11 -----> EMPTY CLAUSE at 0.00 sec ----> 131 [hyper,128,9,99] $F.
% 1.89/2.11
% 1.89/2.11 Length of proof is 28. Level of proof is 18.
% 1.89/2.11
% 1.89/2.11 ---------------- PROOF ----------------
% 1.89/2.11 % SZS status Theorem
% 1.89/2.11 % SZS output start Refutation
% See solution above
% 1.89/2.11 ------------ end of proof -------------
% 1.89/2.11
% 1.89/2.11
% 1.89/2.11 Search stopped by max_proofs option.
% 1.89/2.11
% 1.89/2.11
% 1.89/2.11 Search stopped by max_proofs option.
% 1.89/2.11
% 1.89/2.11 ============ end of search ============
% 1.89/2.11
% 1.89/2.11 -------------- statistics -------------
% 1.89/2.11 clauses given 40
% 1.89/2.11 clauses generated 302
% 1.89/2.11 clauses kept 123
% 1.89/2.11 clauses forward subsumed 206
% 1.89/2.11 clauses back subsumed 69
% 1.89/2.11 Kbytes malloced 976
% 1.89/2.11
% 1.89/2.11 ----------- times (seconds) -----------
% 1.89/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.11 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.89/2.11
% 1.89/2.11 That finishes the proof of the theorem.
% 1.89/2.11
% 1.89/2.11 Process 31554 finished Wed Jul 27 03:25:33 2022
% 1.89/2.11 Otter interrupted
% 1.89/2.11 PROOF FOUND
%------------------------------------------------------------------------------