%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS114+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:10 EDT 2022
% Result : Unsatisfiable 2.00s 2.21s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% 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 : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 17 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(25,axiom,
( ~ cUnsatisfiable(A)
| rr(A,dollar_f1(A)) ),
file('KRS114+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ cUnsatisfiable(A)
| ca_Ax4(dollar_f1(A)) ),
file('KRS114+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ cUnsatisfiable(A)
| rs(A,dollar_f2(A)) ),
file('KRS114+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ cUnsatisfiable(A)
| ca_Ax3(dollar_f2(A)) ),
file('KRS114+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ cp(A)
| ~ ra_Px1(A,B) ),
file('KRS114+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ cpxcomp(A)
| ra_Px1(A,dollar_f4(A)) ),
file('KRS114+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ ca_Ax3(A)
| cpxcomp(A) ),
file('KRS114+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ ca_Ax4(A)
| ~ rinvR(A,B)
| ~ rinvR(A,C)
| B = C ),
file('KRS114+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ ca_Ax4(A)
| rinvR(A,dollar_f7(A)) ),
file('KRS114+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ ca_Ax4(A)
| ca_Vx5(dollar_f7(A)) ),
file('KRS114+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ ca_Vx5(A)
| ~ rs(A,B)
| cp(B) ),
file('KRS114+1.p',unknown),
[] ).
cnf(48,axiom,
( rinvR(A,B)
| ~ rr(B,A) ),
file('KRS114+1.p',unknown),
[] ).
cnf(56,axiom,
cUnsatisfiable(i2003_11_14_17_21_262),
file('KRS114+1.p',unknown),
[] ).
cnf(57,plain,
ca_Ax3(dollar_f2(i2003_11_14_17_21_262)),
inference(hyper,[status(thm)],[56,28]),
[iquote('hyper,56,28')] ).
cnf(58,plain,
rs(i2003_11_14_17_21_262,dollar_f2(i2003_11_14_17_21_262)),
inference(hyper,[status(thm)],[56,27]),
[iquote('hyper,56,27')] ).
cnf(59,plain,
ca_Ax4(dollar_f1(i2003_11_14_17_21_262)),
inference(hyper,[status(thm)],[56,26]),
[iquote('hyper,56,26')] ).
cnf(60,plain,
rr(i2003_11_14_17_21_262,dollar_f1(i2003_11_14_17_21_262)),
inference(hyper,[status(thm)],[56,25]),
[iquote('hyper,56,25')] ).
cnf(62,plain,
cpxcomp(dollar_f2(i2003_11_14_17_21_262)),
inference(hyper,[status(thm)],[57,37]),
[iquote('hyper,57,37')] ).
cnf(66,plain,
ca_Vx5(dollar_f7(dollar_f1(i2003_11_14_17_21_262))),
inference(hyper,[status(thm)],[59,41]),
[iquote('hyper,59,41')] ).
cnf(67,plain,
rinvR(dollar_f1(i2003_11_14_17_21_262),dollar_f7(dollar_f1(i2003_11_14_17_21_262))),
inference(hyper,[status(thm)],[59,40]),
[iquote('hyper,59,40')] ).
cnf(70,plain,
ra_Px1(dollar_f2(i2003_11_14_17_21_262),dollar_f4(dollar_f2(i2003_11_14_17_21_262))),
inference(hyper,[status(thm)],[62,31]),
[iquote('hyper,62,31')] ).
cnf(78,plain,
rinvR(dollar_f1(i2003_11_14_17_21_262),i2003_11_14_17_21_262),
inference(hyper,[status(thm)],[60,48]),
[iquote('hyper,60,48')] ).
cnf(97,plain,
dollar_f7(dollar_f1(i2003_11_14_17_21_262)) = i2003_11_14_17_21_262,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[67,39,59,78])]),
[iquote('hyper,67,39,59,78,flip.1')] ).
cnf(99,plain,
ca_Vx5(i2003_11_14_17_21_262),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[66]),97]),
[iquote('back_demod,66,demod,97')] ).
cnf(100,plain,
cp(dollar_f2(i2003_11_14_17_21_262)),
inference(hyper,[status(thm)],[99,45,58]),
[iquote('hyper,99,45,58')] ).
cnf(110,plain,
$false,
inference(hyper,[status(thm)],[70,30,100]),
[iquote('hyper,70,30,100')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS114+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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:46:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.20 ----- Otter 3.3f, August 2004 -----
% 2.00/2.20 The process was started by sandbox on n023.cluster.edu,
% 2.00/2.20 Wed Jul 27 03:46:33 2022
% 2.00/2.20 The command was "./otter". The process ID is 7324.
% 2.00/2.20
% 2.00/2.20 set(prolog_style_variables).
% 2.00/2.20 set(auto).
% 2.00/2.20 dependent: set(auto1).
% 2.00/2.20 dependent: set(process_input).
% 2.00/2.20 dependent: clear(print_kept).
% 2.00/2.20 dependent: clear(print_new_demod).
% 2.00/2.20 dependent: clear(print_back_demod).
% 2.00/2.20 dependent: clear(print_back_sub).
% 2.00/2.20 dependent: set(control_memory).
% 2.00/2.20 dependent: assign(max_mem, 12000).
% 2.00/2.20 dependent: assign(pick_given_ratio, 4).
% 2.00/2.20 dependent: assign(stats_level, 1).
% 2.00/2.20 dependent: assign(max_seconds, 10800).
% 2.00/2.20 clear(print_given).
% 2.00/2.20
% 2.00/2.20 formula_list(usable).
% 2.00/2.20 all A (A=A).
% 2.00/2.20 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 2.00/2.20 all A B (A=B&ca_Ax3(A)->ca_Ax3(B)).
% 2.00/2.20 all A B (A=B&ca_Ax4(A)->ca_Ax4(B)).
% 2.00/2.20 all A B (A=B&ca_Vx5(A)->ca_Vx5(B)).
% 2.00/2.20 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 2.00/2.20 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 2.00/2.20 all A B (A=B&cp(A)->cp(B)).
% 2.00/2.20 all A B (A=B&cpxcomp(A)->cpxcomp(B)).
% 2.00/2.20 all A B (A=B&cq(A)->cq(B)).
% 2.00/2.20 all A B (A=B&cqxcomp(A)->cqxcomp(B)).
% 2.00/2.20 all A B C (A=B&ra_Px1(A,C)->ra_Px1(B,C)).
% 2.00/2.20 all A B C (A=B&ra_Px1(C,A)->ra_Px1(C,B)).
% 2.00/2.20 all A B C (A=B&ra_Px2(A,C)->ra_Px2(B,C)).
% 2.00/2.20 all A B C (A=B&ra_Px2(C,A)->ra_Px2(C,B)).
% 2.00/2.20 all A B C (A=B&rinvR(A,C)->rinvR(B,C)).
% 2.00/2.20 all A B C (A=B&rinvR(C,A)->rinvR(C,B)).
% 2.00/2.20 all A B C (A=B&rr(A,C)->rr(B,C)).
% 2.00/2.20 all A B C (A=B&rr(C,A)->rr(C,B)).
% 2.00/2.20 all A B C (A=B&rs(A,C)->rs(B,C)).
% 2.00/2.20 all A B C (A=B&rs(C,A)->rs(C,B)).
% 2.00/2.20 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 2.00/2.20 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 2.00/2.20 all X (cowlThing(X)& -cowlNothing(X)).
% 2.00/2.20 all X (xsd_string(X)<-> -xsd_integer(X)).
% 2.00/2.20 all X (cUnsatisfiable(X)<-> (exists Y (rr(X,Y)&ca_Ax4(Y)))& (exists Y (rs(X,Y)&ca_Ax3(Y)))).
% 2.00/2.20 all X (cp(X)<-> -(exists Y ra_Px1(X,Y))).
% 2.00/2.20 all X (cpxcomp(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 2.00/2.20 all X (cq(X)<-> (exists Y0 ra_Px2(X,Y0))).
% 2.00/2.20 all X (cqxcomp(X)<-> -(exists Y ra_Px2(X,Y))).
% 2.00/2.20 all X (ca_Ax3(X)<->cqxcomp(X)&cpxcomp(X)).
% 2.00/2.20 all X (ca_Ax4(X)<-> (all Y0 Y1 (rinvR(X,Y0)&rinvR(X,Y1)->Y0=Y1))& (exists Y (rinvR(X,Y)&ca_Vx5(Y)))).
% 2.00/2.20 all X (ca_Vx5(X)<-> (all Y (rs(X,Y)->cp(Y)))).
% 2.00/2.20 all X Y (rinvR(X,Y)<->rr(Y,X)).
% 2.00/2.20 cUnsatisfiable(i2003_11_14_17_21_262).
% 2.00/2.20 end_of_list.
% 2.00/2.20
% 2.00/2.20 -------> usable clausifies to:
% 2.00/2.20
% 2.00/2.20 list(usable).
% 2.00/2.20 0 [] A=A.
% 2.00/2.20 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 2.00/2.20 0 [] A!=B| -ca_Ax3(A)|ca_Ax3(B).
% 2.00/2.20 0 [] A!=B| -ca_Ax4(A)|ca_Ax4(B).
% 2.00/2.20 0 [] A!=B| -ca_Vx5(A)|ca_Vx5(B).
% 2.00/2.20 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 2.00/2.20 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 2.00/2.20 0 [] A!=B| -cp(A)|cp(B).
% 2.00/2.20 0 [] A!=B| -cpxcomp(A)|cpxcomp(B).
% 2.00/2.20 0 [] A!=B| -cq(A)|cq(B).
% 2.00/2.20 0 [] A!=B| -cqxcomp(A)|cqxcomp(B).
% 2.00/2.20 0 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 2.00/2.20 0 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 2.00/2.20 0 [] A!=B| -ra_Px2(A,C)|ra_Px2(B,C).
% 2.00/2.20 0 [] A!=B| -ra_Px2(C,A)|ra_Px2(C,B).
% 2.00/2.20 0 [] A!=B| -rinvR(A,C)|rinvR(B,C).
% 2.00/2.20 0 [] A!=B| -rinvR(C,A)|rinvR(C,B).
% 2.00/2.20 0 [] A!=B| -rr(A,C)|rr(B,C).
% 2.00/2.20 0 [] A!=B| -rr(C,A)|rr(C,B).
% 2.00/2.20 0 [] A!=B| -rs(A,C)|rs(B,C).
% 2.00/2.20 0 [] A!=B| -rs(C,A)|rs(C,B).
% 2.00/2.20 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 2.00/2.20 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 2.00/2.20 0 [] cowlThing(X).
% 2.00/2.20 0 [] -cowlNothing(X).
% 2.00/2.20 0 [] -xsd_string(X)| -xsd_integer(X).
% 2.00/2.20 0 [] xsd_string(X)|xsd_integer(X).
% 2.00/2.20 0 [] -cUnsatisfiable(X)|rr(X,$f1(X)).
% 2.00/2.20 0 [] -cUnsatisfiable(X)|ca_Ax4($f1(X)).
% 2.00/2.20 0 [] -cUnsatisfiable(X)|rs(X,$f2(X)).
% 2.00/2.20 0 [] -cUnsatisfiable(X)|ca_Ax3($f2(X)).
% 2.00/2.20 0 [] cUnsatisfiable(X)| -rr(X,Y)| -ca_Ax4(Y)| -rs(X,X1)| -ca_Ax3(X1).
% 2.00/2.20 0 [] -cp(X)| -ra_Px1(X,Y).
% 2.00/2.20 0 [] cp(X)|ra_Px1(X,$f3(X)).
% 2.00/2.20 0 [] -cpxcomp(X)|ra_Px1(X,$f4(X)).
% 2.00/2.20 0 [] cpxcomp(X)| -ra_Px1(X,Y0).
% 2.00/2.20 0 [] -cq(X)|ra_Px2(X,$f5(X)).
% 2.00/2.20 0 [] cq(X)| -ra_Px2(X,Y0).
% 2.00/2.20 0 [] -cqxcomp(X)| -ra_Px2(X,Y).
% 2.00/2.20 0 [] cqxcomp(X)|ra_Px2(X,$f6(X)).
% 2.00/2.20 0 [] -ca_Ax3(X)|cqxcomp(X).
% 2.00/2.20 0 [] -ca_Ax3(X)|cpxcomp(X).
% 2.00/2.20 0 [] ca_Ax3(X)| -cqxcomp(X)| -cpxcomp(X).
% 2.00/2.20 0 [] -ca_Ax4(X)| -rinvR(X,Y0)| -rinvR(X,Y1)|Y0=Y1.
% 2.00/2.20 0 [] -ca_Ax4(X)|rinvR(X,$f7(X)).
% 2.00/2.20 0 [] -ca_Ax4(X)|ca_Vx5($f7(X)).
% 2.00/2.20 0 [] ca_Ax4(X)|rinvR(X,$f9(X))| -rinvR(X,Y)| -ca_Vx5(Y).
% 2.00/2.20 0 [] ca_Ax4(X)|rinvR(X,$f8(X))| -rinvR(X,Y)| -ca_Vx5(Y).
% 2.00/2.20 0 [] ca_Ax4(X)|$f9(X)!=$f8(X)| -rinvR(X,Y)| -ca_Vx5(Y).
% 2.00/2.20 0 [] -ca_Vx5(X)| -rs(X,Y)|cp(Y).
% 2.00/2.20 0 [] ca_Vx5(X)|rs(X,$f10(X)).
% 2.00/2.20 0 [] ca_Vx5(X)| -cp($f10(X)).
% 2.00/2.20 0 [] -rinvR(X,Y)|rr(Y,X).
% 2.00/2.20 0 [] rinvR(X,Y)| -rr(Y,X).
% 2.00/2.20 0 [] cUnsatisfiable(i2003_11_14_17_21_262).
% 2.00/2.20 end_of_list.
% 2.00/2.20
% 2.00/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.00/2.20
% 2.00/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.00/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.00/2.20 deletion, with positive clauses in sos and nonpositive
% 2.00/2.20 clauses in usable.
% 2.00/2.20
% 2.00/2.20 dependent: set(knuth_bendix).
% 2.00/2.20 dependent: set(anl_eq).
% 2.00/2.20 dependent: set(para_from).
% 2.00/2.20 dependent: set(para_into).
% 2.00/2.20 dependent: clear(para_from_right).
% 2.00/2.20 dependent: clear(para_into_right).
% 2.00/2.20 dependent: set(para_from_vars).
% 2.00/2.20 dependent: set(eq_units_both_ways).
% 2.00/2.20 dependent: set(dynamic_demod_all).
% 2.00/2.20 dependent: set(dynamic_demod).
% 2.00/2.20 dependent: set(order_eq).
% 2.00/2.20 dependent: set(back_demod).
% 2.00/2.20 dependent: set(lrpo).
% 2.00/2.20 dependent: set(hyper_res).
% 2.00/2.20 dependent: set(unit_deletion).
% 2.00/2.20 dependent: set(factor).
% 2.00/2.20
% 2.00/2.20 ------------> process usable:
% 2.00/2.20 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 2.00/2.20 ** KEPT (pick-wt=7): 2 [] A!=B| -ca_Ax3(A)|ca_Ax3(B).
% 2.00/2.20 ** KEPT (pick-wt=7): 3 [] A!=B| -ca_Ax4(A)|ca_Ax4(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 4 [] A!=B| -ca_Vx5(A)|ca_Vx5(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 5 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 6 [] A!=B| -cowlThing(A)|cowlThing(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 7 [] A!=B| -cp(A)|cp(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 8 [] A!=B| -cpxcomp(A)|cpxcomp(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 9 [] A!=B| -cq(A)|cq(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 10 [] A!=B| -cqxcomp(A)|cqxcomp(B).
% 2.00/2.21 ** KEPT (pick-wt=9): 11 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 2.00/2.21 ** KEPT (pick-wt=9): 12 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 2.00/2.21 ** KEPT (pick-wt=9): 13 [] A!=B| -ra_Px2(A,C)|ra_Px2(B,C).
% 2.00/2.21 ** KEPT (pick-wt=9): 14 [] A!=B| -ra_Px2(C,A)|ra_Px2(C,B).
% 2.00/2.21 ** KEPT (pick-wt=9): 15 [] A!=B| -rinvR(A,C)|rinvR(B,C).
% 2.00/2.21 ** KEPT (pick-wt=9): 16 [] A!=B| -rinvR(C,A)|rinvR(C,B).
% 2.00/2.21 ** KEPT (pick-wt=9): 17 [] A!=B| -rr(A,C)|rr(B,C).
% 2.00/2.21 ** KEPT (pick-wt=9): 18 [] A!=B| -rr(C,A)|rr(C,B).
% 2.00/2.21 ** KEPT (pick-wt=9): 19 [] A!=B| -rs(A,C)|rs(B,C).
% 2.00/2.21 ** KEPT (pick-wt=9): 20 [] A!=B| -rs(C,A)|rs(C,B).
% 2.00/2.21 ** KEPT (pick-wt=7): 21 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 22 [] A!=B| -xsd_string(A)|xsd_string(B).
% 2.00/2.21 ** KEPT (pick-wt=2): 23 [] -cowlNothing(A).
% 2.00/2.21 ** KEPT (pick-wt=4): 24 [] -xsd_string(A)| -xsd_integer(A).
% 2.00/2.21 ** KEPT (pick-wt=6): 25 [] -cUnsatisfiable(A)|rr(A,$f1(A)).
% 2.00/2.21 ** KEPT (pick-wt=5): 26 [] -cUnsatisfiable(A)|ca_Ax4($f1(A)).
% 2.00/2.21 ** KEPT (pick-wt=6): 27 [] -cUnsatisfiable(A)|rs(A,$f2(A)).
% 2.00/2.21 ** KEPT (pick-wt=5): 28 [] -cUnsatisfiable(A)|ca_Ax3($f2(A)).
% 2.00/2.21 ** KEPT (pick-wt=12): 29 [] cUnsatisfiable(A)| -rr(A,B)| -ca_Ax4(B)| -rs(A,C)| -ca_Ax3(C).
% 2.00/2.21 ** KEPT (pick-wt=5): 30 [] -cp(A)| -ra_Px1(A,B).
% 2.00/2.21 ** KEPT (pick-wt=6): 31 [] -cpxcomp(A)|ra_Px1(A,$f4(A)).
% 2.00/2.21 ** KEPT (pick-wt=5): 32 [] cpxcomp(A)| -ra_Px1(A,B).
% 2.00/2.21 ** KEPT (pick-wt=6): 33 [] -cq(A)|ra_Px2(A,$f5(A)).
% 2.00/2.21 ** KEPT (pick-wt=5): 34 [] cq(A)| -ra_Px2(A,B).
% 2.00/2.21 ** KEPT (pick-wt=5): 35 [] -cqxcomp(A)| -ra_Px2(A,B).
% 2.00/2.21 ** KEPT (pick-wt=4): 36 [] -ca_Ax3(A)|cqxcomp(A).
% 2.00/2.21 ** KEPT (pick-wt=4): 37 [] -ca_Ax3(A)|cpxcomp(A).
% 2.00/2.21 ** KEPT (pick-wt=6): 38 [] ca_Ax3(A)| -cqxcomp(A)| -cpxcomp(A).
% 2.00/2.21 ** KEPT (pick-wt=11): 39 [] -ca_Ax4(A)| -rinvR(A,B)| -rinvR(A,C)|B=C.
% 2.00/2.21 ** KEPT (pick-wt=6): 40 [] -ca_Ax4(A)|rinvR(A,$f7(A)).
% 2.00/2.21 ** KEPT (pick-wt=5): 41 [] -ca_Ax4(A)|ca_Vx5($f7(A)).
% 2.00/2.21 ** KEPT (pick-wt=11): 42 [] ca_Ax4(A)|rinvR(A,$f9(A))| -rinvR(A,B)| -ca_Vx5(B).
% 2.00/2.21 ** KEPT (pick-wt=11): 43 [] ca_Ax4(A)|rinvR(A,$f8(A))| -rinvR(A,B)| -ca_Vx5(B).
% 2.00/2.21 ** KEPT (pick-wt=12): 44 [] ca_Ax4(A)|$f9(A)!=$f8(A)| -rinvR(A,B)| -ca_Vx5(B).
% 2.00/2.21 ** KEPT (pick-wt=7): 45 [] -ca_Vx5(A)| -rs(A,B)|cp(B).
% 2.00/2.21 ** KEPT (pick-wt=5): 46 [] ca_Vx5(A)| -cp($f10(A)).
% 2.00/2.21 ** KEPT (pick-wt=6): 47 [] -rinvR(A,B)|rr(B,A).
% 2.00/2.21 ** KEPT (pick-wt=6): 48 [] rinvR(A,B)| -rr(B,A).
% 2.00/2.21 23 back subsumes 5.
% 2.00/2.21
% 2.00/2.21 ------------> process sos:
% 2.00/2.21 ** KEPT (pick-wt=3): 50 [] A=A.
% 2.00/2.21 ** KEPT (pick-wt=2): 51 [] cowlThing(A).
% 2.00/2.21 ** KEPT (pick-wt=4): 52 [] xsd_string(A)|xsd_integer(A).
% 2.00/2.21 ** KEPT (pick-wt=6): 53 [] cp(A)|ra_Px1(A,$f3(A)).
% 2.00/2.21 ** KEPT (pick-wt=6): 54 [] cqxcomp(A)|ra_Px2(A,$f6(A)).
% 2.00/2.21 ** KEPT (pick-wt=6): 55 [] ca_Vx5(A)|rs(A,$f10(A)).
% 2.00/2.21 ** KEPT (pick-wt=2): 56 [] cUnsatisfiable(i2003_11_14_17_21_262).
% 2.00/2.21 Following clause subsumed by 50 during input processing: 0 [copy,50,flip.1] A=A.
% 2.00/2.21 50 back subsumes 49.
% 2.00/2.21 51 back subsumes 6.
% 2.00/2.21
% 2.00/2.21 ======= end of input processing =======
% 2.00/2.21
% 2.00/2.21 =========== start of search ===========
% 2.00/2.21
% 2.00/2.21 -------- PROOF --------
% 2.00/2.21
% 2.00/2.21 -----> EMPTY CLAUSE at 0.01 sec ----> 110 [hyper,70,30,100] $F.
% 2.00/2.21
% 2.00/2.21 Length of proof is 12. Level of proof is 5.
% 2.00/2.21
% 2.00/2.21 ---------------- PROOF ----------------
% 2.00/2.21 % SZS status Theorem
% 2.00/2.21 % SZS output start Refutation
% See solution above
% 2.00/2.21 ------------ end of proof -------------
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21 ============ end of search ============
% 2.00/2.21
% 2.00/2.21 -------------- statistics -------------
% 2.00/2.21 clauses given 22
% 2.00/2.21 clauses generated 153
% 2.00/2.21 clauses kept 108
% 2.00/2.21 clauses forward subsumed 105
% 2.00/2.21 clauses back subsumed 4
% 2.00/2.21 Kbytes malloced 976
% 2.00/2.21
% 2.00/2.21 ----------- times (seconds) -----------
% 2.00/2.21 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.00/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.21 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.21
% 2.00/2.21 That finishes the proof of the theorem.
% 2.00/2.21
% 2.00/2.21 Process 7324 finished Wed Jul 27 03:46:35 2022
% 2.00/2.21 Otter interrupted
% 2.00/2.21 PROOF FOUND
%------------------------------------------------------------------------------