TSTP Solution File: KRS109+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS109+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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.04s 2.23s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 28 ( 15 unt; 1 nHn; 27 RR)
% Number of literals : 44 ( 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 : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(26,axiom,
( ~ cUnsatisfiable(A)
| cpxcomp(A) ),
file('KRS109+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ cUnsatisfiable(A)
| rf(A,dollar_f1(A)) ),
file('KRS109+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ cUnsatisfiable(A)
| ca_Ax2(dollar_f1(A)) ),
file('KRS109+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ cp(A)
| ~ ra_Px1(A,B) ),
file('KRS109+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ cpxcomp(A)
| ra_Px1(A,dollar_f3(A)) ),
file('KRS109+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ ca_Ax2(A)
| ~ rinvS(A,B)
| cp(B) ),
file('KRS109+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ ca_Ax2(A)
| ~ rinvF(A,B)
| ca_Vx3(B) ),
file('KRS109+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ ca_Vx3(A)
| rs(A,dollar_f6(A)) ),
file('KRS109+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ rf(A,B)
| ~ rf(A,C)
| B = C ),
file('KRS109+1.p',unknown),
[] ).
cnf(44,axiom,
( rinvF(A,B)
| ~ rf(B,A) ),
file('KRS109+1.p',unknown),
[] ).
cnf(48,axiom,
( rinvS(A,B)
| ~ rs(B,A) ),
file('KRS109+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ rs(A,B)
| rf(A,B) ),
file('KRS109+1.p',unknown),
[] ).
cnf(58,axiom,
( cp(A)
| ra_Px1(A,dollar_f2(A)) ),
file('KRS109+1.p',unknown),
[] ).
cnf(60,axiom,
cUnsatisfiable(i2003_11_14_17_21_08508),
file('KRS109+1.p',unknown),
[] ).
cnf(61,plain,
ca_Ax2(dollar_f1(i2003_11_14_17_21_08508)),
inference(hyper,[status(thm)],[60,28]),
[iquote('hyper,60,28')] ).
cnf(62,plain,
rf(i2003_11_14_17_21_08508,dollar_f1(i2003_11_14_17_21_08508)),
inference(hyper,[status(thm)],[60,27]),
[iquote('hyper,60,27')] ).
cnf(63,plain,
cpxcomp(i2003_11_14_17_21_08508),
inference(hyper,[status(thm)],[60,26]),
[iquote('hyper,60,26')] ).
cnf(67,plain,
ra_Px1(i2003_11_14_17_21_08508,dollar_f3(i2003_11_14_17_21_08508)),
inference(hyper,[status(thm)],[63,31]),
[iquote('hyper,63,31')] ).
cnf(77,plain,
rinvF(dollar_f1(i2003_11_14_17_21_08508),i2003_11_14_17_21_08508),
inference(hyper,[status(thm)],[62,44]),
[iquote('hyper,62,44')] ).
cnf(96,plain,
ca_Vx3(i2003_11_14_17_21_08508),
inference(hyper,[status(thm)],[77,34,61]),
[iquote('hyper,77,34,61')] ).
cnf(107,plain,
rs(i2003_11_14_17_21_08508,dollar_f6(i2003_11_14_17_21_08508)),
inference(hyper,[status(thm)],[96,38]),
[iquote('hyper,96,38')] ).
cnf(112,plain,
ra_Px1(i2003_11_14_17_21_08508,dollar_f2(i2003_11_14_17_21_08508)),
inference(hyper,[status(thm)],[58,30,67]),
[iquote('hyper,58,30,67')] ).
cnf(123,plain,
rf(i2003_11_14_17_21_08508,dollar_f6(i2003_11_14_17_21_08508)),
inference(hyper,[status(thm)],[107,50]),
[iquote('hyper,107,50')] ).
cnf(124,plain,
rinvS(dollar_f6(i2003_11_14_17_21_08508),i2003_11_14_17_21_08508),
inference(hyper,[status(thm)],[107,48]),
[iquote('hyper,107,48')] ).
cnf(161,plain,
dollar_f6(i2003_11_14_17_21_08508) = dollar_f1(i2003_11_14_17_21_08508),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[123,41,62])]),
[iquote('hyper,123,41,62,flip.1')] ).
cnf(175,plain,
rinvS(dollar_f1(i2003_11_14_17_21_08508),i2003_11_14_17_21_08508),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[124]),161]),
[iquote('back_demod,124,demod,161')] ).
cnf(194,plain,
cp(i2003_11_14_17_21_08508),
inference(hyper,[status(thm)],[175,33,61]),
[iquote('hyper,175,33,61')] ).
cnf(207,plain,
$false,
inference(hyper,[status(thm)],[194,30,112]),
[iquote('hyper,194,30,112')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS109+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.04/2.22 ----- Otter 3.3f, August 2004 -----
% 2.04/2.22 The process was started by sandbox on n013.cluster.edu,
% 2.04/2.22 Wed Jul 27 03:25:45 2022
% 2.04/2.22 The command was "./otter". The process ID is 12465.
% 2.04/2.22
% 2.04/2.22 set(prolog_style_variables).
% 2.04/2.22 set(auto).
% 2.04/2.22 dependent: set(auto1).
% 2.04/2.22 dependent: set(process_input).
% 2.04/2.22 dependent: clear(print_kept).
% 2.04/2.22 dependent: clear(print_new_demod).
% 2.04/2.22 dependent: clear(print_back_demod).
% 2.04/2.22 dependent: clear(print_back_sub).
% 2.04/2.22 dependent: set(control_memory).
% 2.04/2.22 dependent: assign(max_mem, 12000).
% 2.04/2.22 dependent: assign(pick_given_ratio, 4).
% 2.04/2.22 dependent: assign(stats_level, 1).
% 2.04/2.22 dependent: assign(max_seconds, 10800).
% 2.04/2.22 clear(print_given).
% 2.04/2.22
% 2.04/2.22 formula_list(usable).
% 2.04/2.22 all A (A=A).
% 2.04/2.22 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 2.04/2.22 all A B (A=B&ca_Ax2(A)->ca_Ax2(B)).
% 2.04/2.22 all A B (A=B&ca_Vx3(A)->ca_Vx3(B)).
% 2.04/2.22 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 2.04/2.22 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 2.04/2.22 all A B (A=B&cp(A)->cp(B)).
% 2.04/2.22 all A B (A=B&cpxcomp(A)->cpxcomp(B)).
% 2.04/2.22 all A B C (A=B&ra_Px1(A,C)->ra_Px1(B,C)).
% 2.04/2.22 all A B C (A=B&ra_Px1(C,A)->ra_Px1(C,B)).
% 2.04/2.22 all A B C (A=B&rf(A,C)->rf(B,C)).
% 2.04/2.22 all A B C (A=B&rf(C,A)->rf(C,B)).
% 2.04/2.22 all A B C (A=B&rf1(A,C)->rf1(B,C)).
% 2.04/2.22 all A B C (A=B&rf1(C,A)->rf1(C,B)).
% 2.04/2.22 all A B C (A=B&rinvF(A,C)->rinvF(B,C)).
% 2.04/2.22 all A B C (A=B&rinvF(C,A)->rinvF(C,B)).
% 2.04/2.22 all A B C (A=B&rinvF1(A,C)->rinvF1(B,C)).
% 2.04/2.22 all A B C (A=B&rinvF1(C,A)->rinvF1(C,B)).
% 2.04/2.22 all A B C (A=B&rinvS(A,C)->rinvS(B,C)).
% 2.04/2.22 all A B C (A=B&rinvS(C,A)->rinvS(C,B)).
% 2.04/2.22 all A B C (A=B&rs(A,C)->rs(B,C)).
% 2.04/2.22 all A B C (A=B&rs(C,A)->rs(C,B)).
% 2.04/2.22 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 2.04/2.22 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 2.04/2.22 all X (cowlThing(X)& -cowlNothing(X)).
% 2.04/2.22 all X (xsd_string(X)<-> -xsd_integer(X)).
% 2.04/2.22 all X (cUnsatisfiable(X)<->cpxcomp(X)& (exists Y (rf(X,Y)&ca_Ax2(Y)))).
% 2.04/2.22 all X (cp(X)<-> -(exists Y ra_Px1(X,Y))).
% 2.04/2.22 all X (cpxcomp(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 2.04/2.22 all X (ca_Ax2(X)<-> (all Y (rinvS(X,Y)->cp(Y)))& (all Y (rinvF(X,Y)->ca_Vx3(Y)))).
% 2.04/2.22 all X (ca_Vx3(X)<-> (exists Y (rs(X,Y)&cp(Y)))).
% 2.04/2.22 all X Y Z (rf(X,Y)&rf(X,Z)->Y=Z).
% 2.04/2.22 all X Y Z (rf1(X,Y)&rf1(X,Z)->Y=Z).
% 2.04/2.22 all X Y (rinvF(X,Y)<->rf(Y,X)).
% 2.04/2.22 all X Y (rinvF1(X,Y)<->rf1(Y,X)).
% 2.04/2.22 all X Y (rinvS(X,Y)<->rs(Y,X)).
% 2.04/2.22 all X Y Z (rs(X,Y)&rs(X,Z)->Y=Z).
% 2.04/2.22 cUnsatisfiable(i2003_11_14_17_21_08508).
% 2.04/2.22 all X Y (rs(X,Y)->rf(X,Y)).
% 2.04/2.22 all X Y (rs(X,Y)->rf1(X,Y)).
% 2.04/2.22 end_of_list.
% 2.04/2.22
% 2.04/2.22 -------> usable clausifies to:
% 2.04/2.22
% 2.04/2.22 list(usable).
% 2.04/2.22 0 [] A=A.
% 2.04/2.22 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 2.04/2.22 0 [] A!=B| -ca_Ax2(A)|ca_Ax2(B).
% 2.04/2.22 0 [] A!=B| -ca_Vx3(A)|ca_Vx3(B).
% 2.04/2.22 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 2.04/2.22 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 2.04/2.22 0 [] A!=B| -cp(A)|cp(B).
% 2.04/2.22 0 [] A!=B| -cpxcomp(A)|cpxcomp(B).
% 2.04/2.22 0 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 2.04/2.22 0 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 2.04/2.22 0 [] A!=B| -rf(A,C)|rf(B,C).
% 2.04/2.22 0 [] A!=B| -rf(C,A)|rf(C,B).
% 2.04/2.22 0 [] A!=B| -rf1(A,C)|rf1(B,C).
% 2.04/2.22 0 [] A!=B| -rf1(C,A)|rf1(C,B).
% 2.04/2.22 0 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 2.04/2.22 0 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 2.04/2.22 0 [] A!=B| -rinvF1(A,C)|rinvF1(B,C).
% 2.04/2.22 0 [] A!=B| -rinvF1(C,A)|rinvF1(C,B).
% 2.04/2.22 0 [] A!=B| -rinvS(A,C)|rinvS(B,C).
% 2.04/2.22 0 [] A!=B| -rinvS(C,A)|rinvS(C,B).
% 2.04/2.22 0 [] A!=B| -rs(A,C)|rs(B,C).
% 2.04/2.22 0 [] A!=B| -rs(C,A)|rs(C,B).
% 2.04/2.22 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 2.04/2.22 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 2.04/2.22 0 [] cowlThing(X).
% 2.04/2.22 0 [] -cowlNothing(X).
% 2.04/2.22 0 [] -xsd_string(X)| -xsd_integer(X).
% 2.04/2.22 0 [] xsd_string(X)|xsd_integer(X).
% 2.04/2.22 0 [] -cUnsatisfiable(X)|cpxcomp(X).
% 2.04/2.22 0 [] -cUnsatisfiable(X)|rf(X,$f1(X)).
% 2.04/2.22 0 [] -cUnsatisfiable(X)|ca_Ax2($f1(X)).
% 2.04/2.22 0 [] cUnsatisfiable(X)| -cpxcomp(X)| -rf(X,Y)| -ca_Ax2(Y).
% 2.04/2.22 0 [] -cp(X)| -ra_Px1(X,Y).
% 2.04/2.22 0 [] cp(X)|ra_Px1(X,$f2(X)).
% 2.04/2.22 0 [] -cpxcomp(X)|ra_Px1(X,$f3(X)).
% 2.04/2.22 0 [] cpxcomp(X)| -ra_Px1(X,Y0).
% 2.04/2.22 0 [] -ca_Ax2(X)| -rinvS(X,Y)|cp(Y).
% 2.04/2.22 0 [] -ca_Ax2(X)| -rinvF(X,X1)|ca_Vx3(X1).
% 2.04/2.22 0 [] ca_Ax2(X)|rinvS(X,$f4(X))|rinvF(X,$f5(X)).
% 2.04/2.22 0 [] ca_Ax2(X)|rinvS(X,$f4(X))| -ca_Vx3($f5(X)).
% 2.04/2.22 0 [] ca_Ax2(X)| -cp($f4(X))|rinvF(X,$f5(X)).
% 2.04/2.22 0 [] ca_Ax2(X)| -cp($f4(X))| -ca_Vx3($f5(X)).
% 2.04/2.22 0 [] -ca_Vx3(X)|rs(X,$f6(X)).
% 2.04/2.22 0 [] -ca_Vx3(X)|cp($f6(X)).
% 2.04/2.22 0 [] ca_Vx3(X)| -rs(X,Y)| -cp(Y).
% 2.04/2.22 0 [] -rf(X,Y)| -rf(X,Z)|Y=Z.
% 2.04/2.22 0 [] -rf1(X,Y)| -rf1(X,Z)|Y=Z.
% 2.04/2.22 0 [] -rinvF(X,Y)|rf(Y,X).
% 2.04/2.22 0 [] rinvF(X,Y)| -rf(Y,X).
% 2.04/2.22 0 [] -rinvF1(X,Y)|rf1(Y,X).
% 2.04/2.22 0 [] rinvF1(X,Y)| -rf1(Y,X).
% 2.04/2.22 0 [] -rinvS(X,Y)|rs(Y,X).
% 2.04/2.22 0 [] rinvS(X,Y)| -rs(Y,X).
% 2.04/2.22 0 [] -rs(X,Y)| -rs(X,Z)|Y=Z.
% 2.04/2.22 0 [] cUnsatisfiable(i2003_11_14_17_21_08508).
% 2.04/2.22 0 [] -rs(X,Y)|rf(X,Y).
% 2.04/2.22 0 [] -rs(X,Y)|rf1(X,Y).
% 2.04/2.22 end_of_list.
% 2.04/2.22
% 2.04/2.22 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.04/2.22
% 2.04/2.22 This ia a non-Horn set with equality. The strategy will be
% 2.04/2.22 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.04/2.22 deletion, with positive clauses in sos and nonpositive
% 2.04/2.22 clauses in usable.
% 2.04/2.22
% 2.04/2.22 dependent: set(knuth_bendix).
% 2.04/2.22 dependent: set(anl_eq).
% 2.04/2.22 dependent: set(para_from).
% 2.04/2.22 dependent: set(para_into).
% 2.04/2.22 dependent: clear(para_from_right).
% 2.04/2.22 dependent: clear(para_into_right).
% 2.04/2.22 dependent: set(para_from_vars).
% 2.04/2.22 dependent: set(eq_units_both_ways).
% 2.04/2.22 dependent: set(dynamic_demod_all).
% 2.04/2.22 dependent: set(dynamic_demod).
% 2.04/2.22 dependent: set(order_eq).
% 2.04/2.22 dependent: set(back_demod).
% 2.04/2.22 dependent: set(lrpo).
% 2.04/2.22 dependent: set(hyper_res).
% 2.04/2.22 dependent: set(unit_deletion).
% 2.04/2.22 dependent: set(factor).
% 2.04/2.22
% 2.04/2.22 ------------> process usable:
% 2.04/2.22 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 2.04/2.22 ** KEPT (pick-wt=7): 2 [] A!=B| -ca_Ax2(A)|ca_Ax2(B).
% 2.04/2.22 ** KEPT (pick-wt=7): 3 [] A!=B| -ca_Vx3(A)|ca_Vx3(B).
% 2.04/2.22 ** KEPT (pick-wt=7): 4 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 2.04/2.22 ** KEPT (pick-wt=7): 5 [] A!=B| -cowlThing(A)|cowlThing(B).
% 2.04/2.22 ** KEPT (pick-wt=7): 6 [] A!=B| -cp(A)|cp(B).
% 2.04/2.22 ** KEPT (pick-wt=7): 7 [] A!=B| -cpxcomp(A)|cpxcomp(B).
% 2.04/2.22 ** KEPT (pick-wt=9): 8 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 2.04/2.22 ** KEPT (pick-wt=9): 9 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 2.04/2.22 ** KEPT (pick-wt=9): 10 [] A!=B| -rf(A,C)|rf(B,C).
% 2.04/2.22 ** KEPT (pick-wt=9): 11 [] A!=B| -rf(C,A)|rf(C,B).
% 2.04/2.22 ** KEPT (pick-wt=9): 12 [] A!=B| -rf1(A,C)|rf1(B,C).
% 2.04/2.22 ** KEPT (pick-wt=9): 13 [] A!=B| -rf1(C,A)|rf1(C,B).
% 2.04/2.22 ** KEPT (pick-wt=9): 14 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 2.04/2.22 ** KEPT (pick-wt=9): 15 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 2.04/2.22 ** KEPT (pick-wt=9): 16 [] A!=B| -rinvF1(A,C)|rinvF1(B,C).
% 2.04/2.22 ** KEPT (pick-wt=9): 17 [] A!=B| -rinvF1(C,A)|rinvF1(C,B).
% 2.04/2.22 ** KEPT (pick-wt=9): 18 [] A!=B| -rinvS(A,C)|rinvS(B,C).
% 2.04/2.22 ** KEPT (pick-wt=9): 19 [] A!=B| -rinvS(C,A)|rinvS(C,B).
% 2.04/2.22 ** KEPT (pick-wt=9): 20 [] A!=B| -rs(A,C)|rs(B,C).
% 2.04/2.22 ** KEPT (pick-wt=9): 21 [] A!=B| -rs(C,A)|rs(C,B).
% 2.04/2.22 ** KEPT (pick-wt=7): 22 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 2.04/2.22 ** KEPT (pick-wt=7): 23 [] A!=B| -xsd_string(A)|xsd_string(B).
% 2.04/2.22 ** KEPT (pick-wt=2): 24 [] -cowlNothing(A).
% 2.04/2.22 ** KEPT (pick-wt=4): 25 [] -xsd_string(A)| -xsd_integer(A).
% 2.04/2.22 ** KEPT (pick-wt=4): 26 [] -cUnsatisfiable(A)|cpxcomp(A).
% 2.04/2.22 ** KEPT (pick-wt=6): 27 [] -cUnsatisfiable(A)|rf(A,$f1(A)).
% 2.04/2.22 ** KEPT (pick-wt=5): 28 [] -cUnsatisfiable(A)|ca_Ax2($f1(A)).
% 2.04/2.22 ** KEPT (pick-wt=9): 29 [] cUnsatisfiable(A)| -cpxcomp(A)| -rf(A,B)| -ca_Ax2(B).
% 2.04/2.22 ** KEPT (pick-wt=5): 30 [] -cp(A)| -ra_Px1(A,B).
% 2.04/2.22 ** KEPT (pick-wt=6): 31 [] -cpxcomp(A)|ra_Px1(A,$f3(A)).
% 2.04/2.22 ** KEPT (pick-wt=5): 32 [] cpxcomp(A)| -ra_Px1(A,B).
% 2.04/2.22 ** KEPT (pick-wt=7): 33 [] -ca_Ax2(A)| -rinvS(A,B)|cp(B).
% 2.04/2.22 ** KEPT (pick-wt=7): 34 [] -ca_Ax2(A)| -rinvF(A,B)|ca_Vx3(B).
% 2.04/2.22 ** KEPT (pick-wt=9): 35 [] ca_Ax2(A)|rinvS(A,$f4(A))| -ca_Vx3($f5(A)).
% 2.04/2.22 ** KEPT (pick-wt=9): 36 [] ca_Ax2(A)| -cp($f4(A))|rinvF(A,$f5(A)).
% 2.04/2.22 ** KEPT (pick-wt=8): 37 [] ca_Ax2(A)| -cp($f4(A))| -ca_Vx3($f5(A)).
% 2.04/2.22 ** KEPT (pick-wt=6): 38 [] -ca_Vx3(A)|rs(A,$f6(A)).
% 2.04/2.22 ** KEPT (pick-wt=5): 39 [] -ca_Vx3(A)|cp($f6(A)).
% 2.04/2.22 ** KEPT (pick-wt=7): 40 [] ca_Vx3(A)| -rs(A,B)| -cp(B).
% 2.04/2.22 ** KEPT (pick-wt=9): 41 [] -rf(A,B)| -rf(A,C)|B=C.
% 2.04/2.22 ** KEPT (pick-wt=9): 42 [] -rf1(A,B)| -rf1(A,C)|B=C.
% 2.04/2.22 ** KEPT (pick-wt=6): 43 [] -rinvF(A,B)|rf(B,A).
% 2.04/2.22 ** KEPT (pick-wt=6): 44 [] rinvF(A,B)| -rf(B,A).
% 2.04/2.22 ** KEPT (pick-wt=6): 45 [] -rinvF1(A,B)|rf1(B,A).
% 2.04/2.22 ** KEPT (pick-wt=6): 46 [] rinvF1(A,B)| -rf1(B,A).
% 2.04/2.22 ** KEPT (pick-wt=6): 47 [] -rinvS(A,B)|rs(B,A).
% 2.04/2.22 ** KEPT (pick-wt=6): 48 [] rinvS(A,B)| -rs(B,A).
% 2.04/2.22 ** KEPT (pick-wt=9): 49 [] -rs(A,B)| -rs(A,C)|B=C.
% 2.04/2.22 ** KEPT (pick-wt=6): 50 [] -rs(A,B)|rf(A,B).
% 2.04/2.22 ** KEPT (pick-wt=6): 51 [] -rs(A,B)|rf1(A,B).
% 2.04/2.22 24 back subsumes 4.
% 2.04/2.22
% 2.04/2.22 ------------> process sos:
% 2.04/2.22 ** KEPT (pick-wt=3): 55 [] A=A.
% 2.04/2.22 ** KEPT (pick-wt=2): 56 [] cowlThing(A).
% 2.04/2.22 ** KEPT (pick-wt=4): 57 [] xsd_string(A)|xsd_integer(A).
% 2.04/2.22 ** KEPT (pick-wt=6): 58 [] cp(A)|ra_Px1(A,$f2(A)).
% 2.04/2.22 ** KEPT (pick-wt=10): 59 [] ca_Ax2(A)|rinvS(A,$f4(A))|rinvF(A,$f5(A)).
% 2.04/2.23 ** KEPT (pick-wt=2): 60 [] cUnsatisfiable(i2003_11_14_17_21_08508).
% 2.04/2.23 Following clause subsumed by 55 during input processing: 0 [copy,55,flip.1] A=A.
% 2.04/2.23 55 back subsumes 54.
% 2.04/2.23 55 back subsumes 53.
% 2.04/2.23 55 back subsumes 52.
% 2.04/2.23 56 back subsumes 5.
% 2.04/2.23
% 2.04/2.23 ======= end of input processing =======
% 2.04/2.23
% 2.04/2.23 =========== start of search ===========
% 2.04/2.23
% 2.04/2.23 -------- PROOF --------
% 2.04/2.23
% 2.04/2.23 -----> EMPTY CLAUSE at 0.01 sec ----> 207 [hyper,194,30,112] $F.
% 2.04/2.23
% 2.04/2.23 Length of proof is 13. Level of proof is 8.
% 2.04/2.23
% 2.04/2.23 ---------------- PROOF ----------------
% 2.04/2.23 % SZS status Theorem
% 2.04/2.23 % SZS output start Refutation
% See solution above
% 2.04/2.23 ------------ end of proof -------------
% 2.04/2.23
% 2.04/2.23
% 2.04/2.23 Search stopped by max_proofs option.
% 2.04/2.23
% 2.04/2.23
% 2.04/2.23 Search stopped by max_proofs option.
% 2.04/2.23
% 2.04/2.23 ============ end of search ============
% 2.04/2.23
% 2.04/2.23 -------------- statistics -------------
% 2.04/2.23 clauses given 22
% 2.04/2.23 clauses generated 311
% 2.04/2.23 clauses kept 205
% 2.04/2.23 clauses forward subsumed 185
% 2.04/2.23 clauses back subsumed 5
% 2.04/2.23 Kbytes malloced 976
% 2.04/2.23
% 2.04/2.23 ----------- times (seconds) -----------
% 2.04/2.23 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.04/2.23 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.04/2.23 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.04/2.23
% 2.04/2.23 That finishes the proof of the theorem.
% 2.04/2.23
% 2.04/2.23 Process 12465 finished Wed Jul 27 03:25:47 2022
% 2.04/2.23 Otter interrupted
% 2.04/2.23 PROOF FOUND
%------------------------------------------------------------------------------