TSTP Solution File: KRS107+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS107+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:09 EDT 2022
% Result : Unsatisfiable 2.06s 2.27s
% Output : Refutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 26 ( 14 unt; 0 nHn; 26 RR)
% Number of literals : 41 ( 2 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 18 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(35,axiom,
( ~ cUnsatisfiable(A)
| rrx3(A,dollar_f1(A)) ),
file('KRS107+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ cUnsatisfiable(A)
| cc1(dollar_f1(A)) ),
file('KRS107+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ cUnsatisfiable(A)
| rrx4(A,dollar_f2(A)) ),
file('KRS107+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ cUnsatisfiable(A)
| cc2(dollar_f2(A)) ),
file('KRS107+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ cUnsatisfiable(A)
| ca_Cx1(A) ),
file('KRS107+1.p',unknown),
[] ).
cnf(43,axiom,
( ca_Ax2(A)
| ~ cc2(A)
| ~ cc1(A) ),
file('KRS107+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ ca_Cx1(A)
| ra_Px1(A,dollar_f3(A)) ),
file('KRS107+1.p',unknown),
[] ).
cnf(48,axiom,
( ca_Cx1xcomp(A)
| ~ rrx3(A,B)
| ~ ca_Ax2(B) ),
file('KRS107+1.p',unknown),
[] ).
cnf(49,axiom,
( ~ ca_Cx1xcomp(A)
| ~ ra_Px1(A,B) ),
file('KRS107+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ rrx(A,B)
| ~ rrx(A,C)
| B = C ),
file('KRS107+1.p',unknown),
[] ).
cnf(59,axiom,
( ~ rrx4(A,B)
| rrx(A,B) ),
file('KRS107+1.p',unknown),
[] ).
cnf(62,axiom,
( ~ rrx3(A,B)
| rrx(A,B) ),
file('KRS107+1.p',unknown),
[] ).
cnf(72,axiom,
cUnsatisfiable(i2003_11_14_17_21_01226),
file('KRS107+1.p',unknown),
[] ).
cnf(73,plain,
ca_Cx1(i2003_11_14_17_21_01226),
inference(hyper,[status(thm)],[72,39]),
[iquote('hyper,72,39')] ).
cnf(74,plain,
cc2(dollar_f2(i2003_11_14_17_21_01226)),
inference(hyper,[status(thm)],[72,38]),
[iquote('hyper,72,38')] ).
cnf(75,plain,
rrx4(i2003_11_14_17_21_01226,dollar_f2(i2003_11_14_17_21_01226)),
inference(hyper,[status(thm)],[72,37]),
[iquote('hyper,72,37')] ).
cnf(76,plain,
cc1(dollar_f1(i2003_11_14_17_21_01226)),
inference(hyper,[status(thm)],[72,36]),
[iquote('hyper,72,36')] ).
cnf(77,plain,
rrx3(i2003_11_14_17_21_01226,dollar_f1(i2003_11_14_17_21_01226)),
inference(hyper,[status(thm)],[72,35]),
[iquote('hyper,72,35')] ).
cnf(83,plain,
ra_Px1(i2003_11_14_17_21_01226,dollar_f3(i2003_11_14_17_21_01226)),
inference(hyper,[status(thm)],[73,44]),
[iquote('hyper,73,44')] ).
cnf(109,plain,
rrx(i2003_11_14_17_21_01226,dollar_f2(i2003_11_14_17_21_01226)),
inference(hyper,[status(thm)],[75,59]),
[iquote('hyper,75,59')] ).
cnf(126,plain,
rrx(i2003_11_14_17_21_01226,dollar_f1(i2003_11_14_17_21_01226)),
inference(hyper,[status(thm)],[77,62]),
[iquote('hyper,77,62')] ).
cnf(197,plain,
dollar_f2(i2003_11_14_17_21_01226) = dollar_f1(i2003_11_14_17_21_01226),
inference(hyper,[status(thm)],[126,50,109]),
[iquote('hyper,126,50,109')] ).
cnf(235,plain,
cc2(dollar_f1(i2003_11_14_17_21_01226)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[74]),197]),
[iquote('back_demod,74,demod,197')] ).
cnf(241,plain,
ca_Ax2(dollar_f1(i2003_11_14_17_21_01226)),
inference(hyper,[status(thm)],[235,43,76]),
[iquote('hyper,235,43,76')] ).
cnf(252,plain,
ca_Cx1xcomp(i2003_11_14_17_21_01226),
inference(hyper,[status(thm)],[241,48,77]),
[iquote('hyper,241,48,77')] ).
cnf(263,plain,
$false,
inference(hyper,[status(thm)],[252,49,83]),
[iquote('hyper,252,49,83')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS107+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/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:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.06/2.26 ----- Otter 3.3f, August 2004 -----
% 2.06/2.26 The process was started by sandbox2 on n006.cluster.edu,
% 2.06/2.26 Wed Jul 27 03:25:17 2022
% 2.06/2.26 The command was "./otter". The process ID is 30660.
% 2.06/2.26
% 2.06/2.26 set(prolog_style_variables).
% 2.06/2.26 set(auto).
% 2.06/2.26 dependent: set(auto1).
% 2.06/2.26 dependent: set(process_input).
% 2.06/2.26 dependent: clear(print_kept).
% 2.06/2.26 dependent: clear(print_new_demod).
% 2.06/2.26 dependent: clear(print_back_demod).
% 2.06/2.26 dependent: clear(print_back_sub).
% 2.06/2.26 dependent: set(control_memory).
% 2.06/2.26 dependent: assign(max_mem, 12000).
% 2.06/2.26 dependent: assign(pick_given_ratio, 4).
% 2.06/2.26 dependent: assign(stats_level, 1).
% 2.06/2.26 dependent: assign(max_seconds, 10800).
% 2.06/2.26 clear(print_given).
% 2.06/2.26
% 2.06/2.26 formula_list(usable).
% 2.06/2.26 all A (A=A).
% 2.06/2.26 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 2.06/2.26 all A B (A=B&ca_Ax2(A)->ca_Ax2(B)).
% 2.06/2.26 all A B (A=B&ca_Cx1(A)->ca_Cx1(B)).
% 2.06/2.26 all A B (A=B&ca_Cx1xcomp(A)->ca_Cx1xcomp(B)).
% 2.06/2.26 all A B (A=B&cc1(A)->cc1(B)).
% 2.06/2.26 all A B (A=B&cc2(A)->cc2(B)).
% 2.06/2.26 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 2.06/2.26 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 2.06/2.26 all A B C (A=B&ra_Px1(A,C)->ra_Px1(B,C)).
% 2.06/2.26 all A B C (A=B&ra_Px1(C,A)->ra_Px1(C,B)).
% 2.06/2.26 all A B C (A=B&rrx(A,C)->rrx(B,C)).
% 2.06/2.26 all A B C (A=B&rrx(C,A)->rrx(C,B)).
% 2.06/2.26 all A B C (A=B&rrx1(A,C)->rrx1(B,C)).
% 2.06/2.26 all A B C (A=B&rrx1(C,A)->rrx1(C,B)).
% 2.06/2.26 all A B C (A=B&rrx1a(A,C)->rrx1a(B,C)).
% 2.06/2.26 all A B C (A=B&rrx1a(C,A)->rrx1a(C,B)).
% 2.06/2.26 all A B C (A=B&rrx2(A,C)->rrx2(B,C)).
% 2.06/2.26 all A B C (A=B&rrx2(C,A)->rrx2(C,B)).
% 2.06/2.26 all A B C (A=B&rrx2a(A,C)->rrx2a(B,C)).
% 2.06/2.26 all A B C (A=B&rrx2a(C,A)->rrx2a(C,B)).
% 2.06/2.26 all A B C (A=B&rrx3(A,C)->rrx3(B,C)).
% 2.06/2.26 all A B C (A=B&rrx3(C,A)->rrx3(C,B)).
% 2.06/2.26 all A B C (A=B&rrx3a(A,C)->rrx3a(B,C)).
% 2.06/2.26 all A B C (A=B&rrx3a(C,A)->rrx3a(C,B)).
% 2.06/2.26 all A B C (A=B&rrx4(A,C)->rrx4(B,C)).
% 2.06/2.26 all A B C (A=B&rrx4(C,A)->rrx4(C,B)).
% 2.06/2.26 all A B C (A=B&rrx4a(A,C)->rrx4a(B,C)).
% 2.06/2.26 all A B C (A=B&rrx4a(C,A)->rrx4a(C,B)).
% 2.06/2.26 all A B C (A=B&rrxa(A,C)->rrxa(B,C)).
% 2.06/2.26 all A B C (A=B&rrxa(C,A)->rrxa(C,B)).
% 2.06/2.26 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 2.06/2.26 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 2.06/2.26 all X (cowlThing(X)& -cowlNothing(X)).
% 2.06/2.26 all X (xsd_string(X)<-> -xsd_integer(X)).
% 2.06/2.26 all X (cUnsatisfiable(X)<-> (exists Y (rrx3(X,Y)&cc1(Y)))& (exists Y (rrx4(X,Y)&cc2(Y)))&ca_Cx1(X)).
% 2.06/2.26 all X (ca_Ax2(X)<->cc2(X)&cc1(X)).
% 2.06/2.26 all X (ca_Cx1(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 2.06/2.26 all X (ca_Cx1xcomp(X)<-> (exists Y (rrx3(X,Y)&ca_Ax2(Y)))).
% 2.06/2.26 all X (ca_Cx1xcomp(X)<-> -(exists Y ra_Px1(X,Y))).
% 2.06/2.26 all X Y Z (rrx(X,Y)&rrx(X,Z)->Y=Z).
% 2.06/2.26 all X Y Z (rrx3(X,Y)&rrx3(X,Z)->Y=Z).
% 2.06/2.26 all X Y Z (rrx3a(X,Y)&rrx3a(X,Z)->Y=Z).
% 2.06/2.26 all X Y Z (rrx4(X,Y)&rrx4(X,Z)->Y=Z).
% 2.06/2.26 all X Y Z (rrx4a(X,Y)&rrx4a(X,Z)->Y=Z).
% 2.06/2.26 cUnsatisfiable(i2003_11_14_17_21_01226).
% 2.06/2.26 all X Y (rrx3(X,Y)->rrx1(X,Y)).
% 2.06/2.26 all X Y (rrx3a(X,Y)->rrxa(X,Y)).
% 2.06/2.26 all X Y (rrx4a(X,Y)->rrxa(X,Y)).
% 2.06/2.26 all X Y (rrx4(X,Y)->rrx2(X,Y)).
% 2.06/2.26 all X Y (rrx4(X,Y)->rrx(X,Y)).
% 2.06/2.26 all X Y (rrx3a(X,Y)->rrx1a(X,Y)).
% 2.06/2.26 all X Y (rrx4a(X,Y)->rrx2a(X,Y)).
% 2.06/2.26 all X Y (rrx3(X,Y)->rrx(X,Y)).
% 2.06/2.26 end_of_list.
% 2.06/2.26
% 2.06/2.26 -------> usable clausifies to:
% 2.06/2.26
% 2.06/2.26 list(usable).
% 2.06/2.26 0 [] A=A.
% 2.06/2.26 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 2.06/2.26 0 [] A!=B| -ca_Ax2(A)|ca_Ax2(B).
% 2.06/2.26 0 [] A!=B| -ca_Cx1(A)|ca_Cx1(B).
% 2.06/2.26 0 [] A!=B| -ca_Cx1xcomp(A)|ca_Cx1xcomp(B).
% 2.06/2.26 0 [] A!=B| -cc1(A)|cc1(B).
% 2.06/2.26 0 [] A!=B| -cc2(A)|cc2(B).
% 2.06/2.26 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 2.06/2.26 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 2.06/2.26 0 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 2.06/2.26 0 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 2.06/2.26 0 [] A!=B| -rrx(A,C)|rrx(B,C).
% 2.06/2.26 0 [] A!=B| -rrx(C,A)|rrx(C,B).
% 2.06/2.26 0 [] A!=B| -rrx1(A,C)|rrx1(B,C).
% 2.06/2.26 0 [] A!=B| -rrx1(C,A)|rrx1(C,B).
% 2.06/2.26 0 [] A!=B| -rrx1a(A,C)|rrx1a(B,C).
% 2.06/2.26 0 [] A!=B| -rrx1a(C,A)|rrx1a(C,B).
% 2.06/2.26 0 [] A!=B| -rrx2(A,C)|rrx2(B,C).
% 2.06/2.26 0 [] A!=B| -rrx2(C,A)|rrx2(C,B).
% 2.06/2.26 0 [] A!=B| -rrx2a(A,C)|rrx2a(B,C).
% 2.06/2.26 0 [] A!=B| -rrx2a(C,A)|rrx2a(C,B).
% 2.06/2.26 0 [] A!=B| -rrx3(A,C)|rrx3(B,C).
% 2.06/2.26 0 [] A!=B| -rrx3(C,A)|rrx3(C,B).
% 2.06/2.26 0 [] A!=B| -rrx3a(A,C)|rrx3a(B,C).
% 2.06/2.26 0 [] A!=B| -rrx3a(C,A)|rrx3a(C,B).
% 2.06/2.26 0 [] A!=B| -rrx4(A,C)|rrx4(B,C).
% 2.06/2.26 0 [] A!=B| -rrx4(C,A)|rrx4(C,B).
% 2.06/2.26 0 [] A!=B| -rrx4a(A,C)|rrx4a(B,C).
% 2.06/2.26 0 [] A!=B| -rrx4a(C,A)|rrx4a(C,B).
% 2.06/2.26 0 [] A!=B| -rrxa(A,C)|rrxa(B,C).
% 2.06/2.26 0 [] A!=B| -rrxa(C,A)|rrxa(C,B).
% 2.06/2.26 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 2.06/2.26 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 2.06/2.26 0 [] cowlThing(X).
% 2.06/2.26 0 [] -cowlNothing(X).
% 2.06/2.26 0 [] -xsd_string(X)| -xsd_integer(X).
% 2.06/2.26 0 [] xsd_string(X)|xsd_integer(X).
% 2.06/2.26 0 [] -cUnsatisfiable(X)|rrx3(X,$f1(X)).
% 2.06/2.26 0 [] -cUnsatisfiable(X)|cc1($f1(X)).
% 2.06/2.26 0 [] -cUnsatisfiable(X)|rrx4(X,$f2(X)).
% 2.06/2.26 0 [] -cUnsatisfiable(X)|cc2($f2(X)).
% 2.06/2.26 0 [] -cUnsatisfiable(X)|ca_Cx1(X).
% 2.06/2.26 0 [] cUnsatisfiable(X)| -rrx3(X,Y)| -cc1(Y)| -rrx4(X,X1)| -cc2(X1)| -ca_Cx1(X).
% 2.06/2.26 0 [] -ca_Ax2(X)|cc2(X).
% 2.06/2.26 0 [] -ca_Ax2(X)|cc1(X).
% 2.06/2.26 0 [] ca_Ax2(X)| -cc2(X)| -cc1(X).
% 2.06/2.26 0 [] -ca_Cx1(X)|ra_Px1(X,$f3(X)).
% 2.06/2.26 0 [] ca_Cx1(X)| -ra_Px1(X,Y0).
% 2.06/2.26 0 [] -ca_Cx1xcomp(X)|rrx3(X,$f4(X)).
% 2.06/2.26 0 [] -ca_Cx1xcomp(X)|ca_Ax2($f4(X)).
% 2.06/2.26 0 [] ca_Cx1xcomp(X)| -rrx3(X,Y)| -ca_Ax2(Y).
% 2.06/2.26 0 [] -ca_Cx1xcomp(X)| -ra_Px1(X,Y).
% 2.06/2.26 0 [] ca_Cx1xcomp(X)|ra_Px1(X,$f5(X)).
% 2.06/2.26 0 [] -rrx(X,Y)| -rrx(X,Z)|Y=Z.
% 2.06/2.26 0 [] -rrx3(X,Y)| -rrx3(X,Z)|Y=Z.
% 2.06/2.26 0 [] -rrx3a(X,Y)| -rrx3a(X,Z)|Y=Z.
% 2.06/2.26 0 [] -rrx4(X,Y)| -rrx4(X,Z)|Y=Z.
% 2.06/2.26 0 [] -rrx4a(X,Y)| -rrx4a(X,Z)|Y=Z.
% 2.06/2.26 0 [] cUnsatisfiable(i2003_11_14_17_21_01226).
% 2.06/2.26 0 [] -rrx3(X,Y)|rrx1(X,Y).
% 2.06/2.26 0 [] -rrx3a(X,Y)|rrxa(X,Y).
% 2.06/2.26 0 [] -rrx4a(X,Y)|rrxa(X,Y).
% 2.06/2.26 0 [] -rrx4(X,Y)|rrx2(X,Y).
% 2.06/2.26 0 [] -rrx4(X,Y)|rrx(X,Y).
% 2.06/2.26 0 [] -rrx3a(X,Y)|rrx1a(X,Y).
% 2.06/2.26 0 [] -rrx4a(X,Y)|rrx2a(X,Y).
% 2.06/2.26 0 [] -rrx3(X,Y)|rrx(X,Y).
% 2.06/2.26 end_of_list.
% 2.06/2.26
% 2.06/2.26 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.06/2.26
% 2.06/2.26 This ia a non-Horn set with equality. The strategy will be
% 2.06/2.26 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.06/2.26 deletion, with positive clauses in sos and nonpositive
% 2.06/2.26 clauses in usable.
% 2.06/2.26
% 2.06/2.26 dependent: set(knuth_bendix).
% 2.06/2.26 dependent: set(anl_eq).
% 2.06/2.26 dependent: set(para_from).
% 2.06/2.26 dependent: set(para_into).
% 2.06/2.26 dependent: clear(para_from_right).
% 2.06/2.26 dependent: clear(para_into_right).
% 2.06/2.26 dependent: set(para_from_vars).
% 2.06/2.26 dependent: set(eq_units_both_ways).
% 2.06/2.26 dependent: set(dynamic_demod_all).
% 2.06/2.26 dependent: set(dynamic_demod).
% 2.06/2.26 dependent: set(order_eq).
% 2.06/2.26 dependent: set(back_demod).
% 2.06/2.26 dependent: set(lrpo).
% 2.06/2.26 dependent: set(hyper_res).
% 2.06/2.26 dependent: set(unit_deletion).
% 2.06/2.26 dependent: set(factor).
% 2.06/2.26
% 2.06/2.26 ------------> process usable:
% 2.06/2.26 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 2 [] A!=B| -ca_Ax2(A)|ca_Ax2(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 3 [] A!=B| -ca_Cx1(A)|ca_Cx1(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 4 [] A!=B| -ca_Cx1xcomp(A)|ca_Cx1xcomp(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 5 [] A!=B| -cc1(A)|cc1(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 6 [] A!=B| -cc2(A)|cc2(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 7 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 8 [] A!=B| -cowlThing(A)|cowlThing(B).
% 2.06/2.26 ** KEPT (pick-wt=9): 9 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 10 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 11 [] A!=B| -rrx(A,C)|rrx(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 12 [] A!=B| -rrx(C,A)|rrx(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 13 [] A!=B| -rrx1(A,C)|rrx1(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 14 [] A!=B| -rrx1(C,A)|rrx1(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 15 [] A!=B| -rrx1a(A,C)|rrx1a(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 16 [] A!=B| -rrx1a(C,A)|rrx1a(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 17 [] A!=B| -rrx2(A,C)|rrx2(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 18 [] A!=B| -rrx2(C,A)|rrx2(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 19 [] A!=B| -rrx2a(A,C)|rrx2a(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 20 [] A!=B| -rrx2a(C,A)|rrx2a(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 21 [] A!=B| -rrx3(A,C)|rrx3(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 22 [] A!=B| -rrx3(C,A)|rrx3(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 23 [] A!=B| -rrx3a(A,C)|rrx3a(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 24 [] A!=B| -rrx3a(C,A)|rrx3a(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 25 [] A!=B| -rrx4(A,C)|rrx4(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 26 [] A!=B| -rrx4(C,A)|rrx4(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 27 [] A!=B| -rrx4a(A,C)|rrx4a(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 28 [] A!=B| -rrx4a(C,A)|rrx4a(C,B).
% 2.06/2.26 ** KEPT (pick-wt=9): 29 [] A!=B| -rrxa(A,C)|rrxa(B,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 30 [] A!=B| -rrxa(C,A)|rrxa(C,B).
% 2.06/2.26 ** KEPT (pick-wt=7): 31 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 32 [] A!=B| -xsd_string(A)|xsd_string(B).
% 2.06/2.26 ** KEPT (pick-wt=2): 33 [] -cowlNothing(A).
% 2.06/2.26 ** KEPT (pick-wt=4): 34 [] -xsd_string(A)| -xsd_integer(A).
% 2.06/2.26 ** KEPT (pick-wt=6): 35 [] -cUnsatisfiable(A)|rrx3(A,$f1(A)).
% 2.06/2.26 ** KEPT (pick-wt=5): 36 [] -cUnsatisfiable(A)|cc1($f1(A)).
% 2.06/2.26 ** KEPT (pick-wt=6): 37 [] -cUnsatisfiable(A)|rrx4(A,$f2(A)).
% 2.06/2.26 ** KEPT (pick-wt=5): 38 [] -cUnsatisfiable(A)|cc2($f2(A)).
% 2.06/2.26 ** KEPT (pick-wt=4): 39 [] -cUnsatisfiable(A)|ca_Cx1(A).
% 2.06/2.26 ** KEPT (pick-wt=14): 40 [] cUnsatisfiable(A)| -rrx3(A,B)| -cc1(B)| -rrx4(A,C)| -cc2(C)| -ca_Cx1(A).
% 2.06/2.27 ** KEPT (pick-wt=4): 41 [] -ca_Ax2(A)|cc2(A).
% 2.06/2.27 ** KEPT (pick-wt=4): 42 [] -ca_Ax2(A)|cc1(A).
% 2.06/2.27 ** KEPT (pick-wt=6): 43 [] ca_Ax2(A)| -cc2(A)| -cc1(A).
% 2.06/2.27 ** KEPT (pick-wt=6): 44 [] -ca_Cx1(A)|ra_Px1(A,$f3(A)).
% 2.06/2.27 ** KEPT (pick-wt=5): 45 [] ca_Cx1(A)| -ra_Px1(A,B).
% 2.06/2.27 ** KEPT (pick-wt=6): 46 [] -ca_Cx1xcomp(A)|rrx3(A,$f4(A)).
% 2.06/2.27 ** KEPT (pick-wt=5): 47 [] -ca_Cx1xcomp(A)|ca_Ax2($f4(A)).
% 2.06/2.27 ** KEPT (pick-wt=7): 48 [] ca_Cx1xcomp(A)| -rrx3(A,B)| -ca_Ax2(B).
% 2.06/2.27 ** KEPT (pick-wt=5): 49 [] -ca_Cx1xcomp(A)| -ra_Px1(A,B).
% 2.06/2.27 ** KEPT (pick-wt=9): 50 [] -rrx(A,B)| -rrx(A,C)|B=C.
% 2.06/2.27 ** KEPT (pick-wt=9): 51 [] -rrx3(A,B)| -rrx3(A,C)|B=C.
% 2.06/2.27 ** KEPT (pick-wt=9): 52 [] -rrx3a(A,B)| -rrx3a(A,C)|B=C.
% 2.06/2.27 ** KEPT (pick-wt=9): 53 [] -rrx4(A,B)| -rrx4(A,C)|B=C.
% 2.06/2.27 ** KEPT (pick-wt=9): 54 [] -rrx4a(A,B)| -rrx4a(A,C)|B=C.
% 2.06/2.27 ** KEPT (pick-wt=6): 55 [] -rrx3(A,B)|rrx1(A,B).
% 2.06/2.27 ** KEPT (pick-wt=6): 56 [] -rrx3a(A,B)|rrxa(A,B).
% 2.06/2.27 ** KEPT (pick-wt=6): 57 [] -rrx4a(A,B)|rrxa(A,B).
% 2.06/2.27 ** KEPT (pick-wt=6): 58 [] -rrx4(A,B)|rrx2(A,B).
% 2.06/2.27 ** KEPT (pick-wt=6): 59 [] -rrx4(A,B)|rrx(A,B).
% 2.06/2.27 ** KEPT (pick-wt=6): 60 [] -rrx3a(A,B)|rrx1a(A,B).
% 2.06/2.27 ** KEPT (pick-wt=6): 61 [] -rrx4a(A,B)|rrx2a(A,B).
% 2.06/2.27 ** KEPT (pick-wt=6): 62 [] -rrx3(A,B)|rrx(A,B).
% 2.06/2.27 33 back subsumes 7.
% 2.06/2.27
% 2.06/2.27 ------------> process sos:
% 2.06/2.27 ** KEPT (pick-wt=3): 68 [] A=A.
% 2.06/2.27 ** KEPT (pick-wt=2): 69 [] cowlThing(A).
% 2.06/2.27 ** KEPT (pick-wt=4): 70 [] xsd_string(A)|xsd_integer(A).
% 2.06/2.27 ** KEPT (pick-wt=6): 71 [] ca_Cx1xcomp(A)|ra_Px1(A,$f5(A)).
% 2.06/2.27 ** KEPT (pick-wt=2): 72 [] cUnsatisfiable(i2003_11_14_17_21_01226).
% 2.06/2.27 Following clause subsumed by 68 during input processing: 0 [copy,68,flip.1] A=A.
% 2.06/2.27 68 back subsumes 67.
% 2.06/2.27 68 back subsumes 66.
% 2.06/2.27 68 back subsumes 65.
% 2.06/2.27 68 back subsumes 64.
% 2.06/2.27 68 back subsumes 63.
% 2.06/2.27 69 back subsumes 8.
% 2.06/2.27
% 2.06/2.27 ======= end of input processing =======
% 2.06/2.27
% 2.06/2.27 =========== start of search ===========
% 2.06/2.27
% 2.06/2.27 -------- PROOF --------
% 2.06/2.27
% 2.06/2.27 -----> EMPTY CLAUSE at 0.01 sec ----> 263 [hyper,252,49,83] $F.
% 2.06/2.27
% 2.06/2.27 Length of proof is 12. Level of proof is 6.
% 2.06/2.27
% 2.06/2.27 ---------------- PROOF ----------------
% 2.06/2.27 % SZS status Theorem
% 2.06/2.27 % SZS output start Refutation
% See solution above
% 2.06/2.27 ------------ end of proof -------------
% 2.06/2.27
% 2.06/2.27
% 2.06/2.27 Search stopped by max_proofs option.
% 2.06/2.27
% 2.06/2.27
% 2.06/2.27 Search stopped by max_proofs option.
% 2.06/2.27
% 2.06/2.27 ============ end of search ============
% 2.06/2.27
% 2.06/2.27 -------------- statistics -------------
% 2.06/2.27 clauses given 18
% 2.06/2.27 clauses generated 384
% 2.06/2.27 clauses kept 261
% 2.06/2.27 clauses forward subsumed 229
% 2.06/2.27 clauses back subsumed 7
% 2.06/2.27 Kbytes malloced 976
% 2.06/2.27
% 2.06/2.27 ----------- times (seconds) -----------
% 2.06/2.27 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.06/2.27 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.06/2.27 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.06/2.27
% 2.06/2.27 That finishes the proof of the theorem.
% 2.06/2.27
% 2.06/2.27 Process 30660 finished Wed Jul 27 03:25:18 2022
% 2.06/2.27 Otter interrupted
% 2.06/2.27 PROOF FOUND
%------------------------------------------------------------------------------