TSTP Solution File: KRS117+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS117+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:11 EDT 2022
% Result : Unsatisfiable 2.07s 2.23s
% Output : Refutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 32 ( 18 unt; 0 nHn; 31 RR)
% Number of literals : 49 ( 2 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(23,axiom,
( ~ cUnsatisfiable(A)
| ~ rinvR(A,B)
| ca_Vx3(B) ),
file('KRS117+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ cUnsatisfiable(A)
| rinvF(A,dollar_f1(A)) ),
file('KRS117+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ cUnsatisfiable(A)
| cd(dollar_f1(A)) ),
file('KRS117+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ cc(A)
| ~ ra_Px1(A,B) ),
file('KRS117+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ ccxcomp(A)
| ra_Px1(A,dollar_f4(A)) ),
file('KRS117+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ cd(A)
| rf(A,dollar_f5(A)) ),
file('KRS117+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ cd(A)
| ccxcomp(dollar_f5(A)) ),
file('KRS117+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ cd(A)
| cc(A) ),
file('KRS117+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ ca_Vx3(A)
| rinvF(A,dollar_f6(A)) ),
file('KRS117+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ ca_Vx3(A)
| cd(dollar_f6(A)) ),
file('KRS117+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ cowlThing(A)
| ~ rf(A,B)
| ~ rf(A,C)
| B = C ),
file('KRS117+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ rinvF(A,B)
| rf(B,A) ),
file('KRS117+1.p',unknown),
[] ).
cnf(42,axiom,
( rinvR(A,B)
| ~ rr(B,A) ),
file('KRS117+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ rf(A,B)
| rr(A,B) ),
file('KRS117+1.p',unknown),
[] ).
cnf(47,axiom,
cowlThing(A),
file('KRS117+1.p',unknown),
[] ).
cnf(50,axiom,
cUnsatisfiable(i2003_11_14_17_21_37349),
file('KRS117+1.p',unknown),
[] ).
cnf(51,plain,
cd(dollar_f1(i2003_11_14_17_21_37349)),
inference(hyper,[status(thm)],[50,25]),
[iquote('hyper,50,25')] ).
cnf(52,plain,
rinvF(i2003_11_14_17_21_37349,dollar_f1(i2003_11_14_17_21_37349)),
inference(hyper,[status(thm)],[50,24]),
[iquote('hyper,50,24')] ).
cnf(57,plain,
cc(dollar_f1(i2003_11_14_17_21_37349)),
inference(hyper,[status(thm)],[51,33]),
[iquote('hyper,51,33')] ).
cnf(64,plain,
rf(dollar_f1(i2003_11_14_17_21_37349),i2003_11_14_17_21_37349),
inference(hyper,[status(thm)],[52,39]),
[iquote('hyper,52,39')] ).
cnf(88,plain,
rr(dollar_f1(i2003_11_14_17_21_37349),i2003_11_14_17_21_37349),
inference(hyper,[status(thm)],[64,44]),
[iquote('hyper,64,44')] ).
cnf(104,plain,
rinvR(i2003_11_14_17_21_37349,dollar_f1(i2003_11_14_17_21_37349)),
inference(hyper,[status(thm)],[88,42]),
[iquote('hyper,88,42')] ).
cnf(113,plain,
ca_Vx3(dollar_f1(i2003_11_14_17_21_37349)),
inference(hyper,[status(thm)],[104,23,50]),
[iquote('hyper,104,23,50')] ).
cnf(117,plain,
cd(dollar_f6(dollar_f1(i2003_11_14_17_21_37349))),
inference(hyper,[status(thm)],[113,36]),
[iquote('hyper,113,36')] ).
cnf(118,plain,
rinvF(dollar_f1(i2003_11_14_17_21_37349),dollar_f6(dollar_f1(i2003_11_14_17_21_37349))),
inference(hyper,[status(thm)],[113,35]),
[iquote('hyper,113,35')] ).
cnf(131,plain,
ccxcomp(dollar_f5(dollar_f6(dollar_f1(i2003_11_14_17_21_37349)))),
inference(hyper,[status(thm)],[117,32]),
[iquote('hyper,117,32')] ).
cnf(132,plain,
rf(dollar_f6(dollar_f1(i2003_11_14_17_21_37349)),dollar_f5(dollar_f6(dollar_f1(i2003_11_14_17_21_37349)))),
inference(hyper,[status(thm)],[117,31]),
[iquote('hyper,117,31')] ).
cnf(163,plain,
ra_Px1(dollar_f5(dollar_f6(dollar_f1(i2003_11_14_17_21_37349))),dollar_f4(dollar_f5(dollar_f6(dollar_f1(i2003_11_14_17_21_37349))))),
inference(hyper,[status(thm)],[131,29]),
[iquote('hyper,131,29')] ).
cnf(182,plain,
rf(dollar_f6(dollar_f1(i2003_11_14_17_21_37349)),dollar_f1(i2003_11_14_17_21_37349)),
inference(hyper,[status(thm)],[118,39]),
[iquote('hyper,118,39')] ).
cnf(324,plain,
dollar_f5(dollar_f6(dollar_f1(i2003_11_14_17_21_37349))) = dollar_f1(i2003_11_14_17_21_37349),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[132,38,47,182])]),
[iquote('hyper,132,38,47,182,flip.1')] ).
cnf(326,plain,
ra_Px1(dollar_f1(i2003_11_14_17_21_37349),dollar_f4(dollar_f1(i2003_11_14_17_21_37349))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[163]),324,324]),
[iquote('back_demod,163,demod,324,324')] ).
cnf(330,plain,
$false,
inference(hyper,[status(thm)],[326,28,57]),
[iquote('hyper,326,28,57')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS117+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/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:23:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.62/2.21 ----- Otter 3.3f, August 2004 -----
% 1.62/2.21 The process was started by sandbox2 on n006.cluster.edu,
% 1.62/2.21 Wed Jul 27 03:23:47 2022
% 1.62/2.21 The command was "./otter". The process ID is 25301.
% 1.62/2.21
% 1.62/2.21 set(prolog_style_variables).
% 1.62/2.21 set(auto).
% 1.62/2.21 dependent: set(auto1).
% 1.62/2.21 dependent: set(process_input).
% 1.62/2.21 dependent: clear(print_kept).
% 1.62/2.21 dependent: clear(print_new_demod).
% 1.62/2.21 dependent: clear(print_back_demod).
% 1.62/2.21 dependent: clear(print_back_sub).
% 1.62/2.21 dependent: set(control_memory).
% 1.62/2.21 dependent: assign(max_mem, 12000).
% 1.62/2.21 dependent: assign(pick_given_ratio, 4).
% 1.62/2.21 dependent: assign(stats_level, 1).
% 1.62/2.21 dependent: assign(max_seconds, 10800).
% 1.62/2.21 clear(print_given).
% 1.62/2.21
% 1.62/2.21 formula_list(usable).
% 1.62/2.21 all A (A=A).
% 1.62/2.21 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 1.62/2.21 all A B (A=B&ca_Vx3(A)->ca_Vx3(B)).
% 1.62/2.21 all A B (A=B&cc(A)->cc(B)).
% 1.62/2.21 all A B (A=B&ccxcomp(A)->ccxcomp(B)).
% 1.62/2.21 all A B (A=B&cd(A)->cd(B)).
% 1.62/2.21 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.62/2.21 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.62/2.21 all A B C (A=B&ra_Px1(A,C)->ra_Px1(B,C)).
% 1.62/2.21 all A B C (A=B&ra_Px1(C,A)->ra_Px1(C,B)).
% 1.62/2.21 all A B C (A=B&rf(A,C)->rf(B,C)).
% 1.62/2.21 all A B C (A=B&rf(C,A)->rf(C,B)).
% 1.62/2.21 all A B C (A=B&rinvF(A,C)->rinvF(B,C)).
% 1.62/2.21 all A B C (A=B&rinvF(C,A)->rinvF(C,B)).
% 1.62/2.21 all A B C (A=B&rinvR(A,C)->rinvR(B,C)).
% 1.62/2.21 all A B C (A=B&rinvR(C,A)->rinvR(C,B)).
% 1.62/2.21 all A B C (A=B&rr(A,C)->rr(B,C)).
% 1.62/2.21 all A B C (A=B&rr(C,A)->rr(C,B)).
% 1.62/2.21 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.62/2.21 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.62/2.21 all X (cowlThing(X)& -cowlNothing(X)).
% 1.62/2.21 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.62/2.21 all X (cUnsatisfiable(X)<->ccxcomp(X)& (all Y (rinvR(X,Y)->ca_Vx3(Y)))& (exists Y (rinvF(X,Y)&cd(Y)))).
% 1.62/2.21 all X (cc(X)<-> -(exists Y ra_Px1(X,Y))).
% 1.62/2.21 all X (ccxcomp(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 1.62/2.21 all X (cd(X)<-> (exists Y (rf(X,Y)&ccxcomp(Y)))&cc(X)).
% 1.62/2.21 all X (ca_Vx3(X)<-> (exists Y (rinvF(X,Y)&cd(Y)))).
% 1.62/2.21 all X (cowlThing(X)-> (all Y0 Y1 (rf(X,Y0)&rf(X,Y1)->Y0=Y1))).
% 1.62/2.21 all X Y (rinvF(X,Y)<->rf(Y,X)).
% 1.62/2.21 all X Y (rinvR(X,Y)<->rr(Y,X)).
% 1.62/2.21 all X Y Z (rr(X,Y)&rr(Y,Z)->rr(X,Z)).
% 1.62/2.21 cUnsatisfiable(i2003_11_14_17_21_37349).
% 1.62/2.21 all X Y (rf(X,Y)->rr(X,Y)).
% 1.62/2.21 end_of_list.
% 1.62/2.21
% 1.62/2.21 -------> usable clausifies to:
% 1.62/2.21
% 1.62/2.21 list(usable).
% 1.62/2.21 0 [] A=A.
% 1.62/2.21 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.62/2.21 0 [] A!=B| -ca_Vx3(A)|ca_Vx3(B).
% 1.62/2.21 0 [] A!=B| -cc(A)|cc(B).
% 1.62/2.21 0 [] A!=B| -ccxcomp(A)|ccxcomp(B).
% 1.62/2.21 0 [] A!=B| -cd(A)|cd(B).
% 1.62/2.21 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.62/2.21 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.62/2.21 0 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 1.62/2.21 0 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 1.62/2.21 0 [] A!=B| -rf(A,C)|rf(B,C).
% 1.62/2.21 0 [] A!=B| -rf(C,A)|rf(C,B).
% 1.62/2.21 0 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 1.62/2.21 0 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 1.62/2.21 0 [] A!=B| -rinvR(A,C)|rinvR(B,C).
% 1.62/2.21 0 [] A!=B| -rinvR(C,A)|rinvR(C,B).
% 1.62/2.21 0 [] A!=B| -rr(A,C)|rr(B,C).
% 1.62/2.21 0 [] A!=B| -rr(C,A)|rr(C,B).
% 1.62/2.21 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.62/2.21 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.62/2.21 0 [] cowlThing(X).
% 1.62/2.21 0 [] -cowlNothing(X).
% 1.62/2.21 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.62/2.21 0 [] xsd_string(X)|xsd_integer(X).
% 1.62/2.21 0 [] -cUnsatisfiable(X)|ccxcomp(X).
% 1.62/2.21 0 [] -cUnsatisfiable(X)| -rinvR(X,Y)|ca_Vx3(Y).
% 1.62/2.21 0 [] -cUnsatisfiable(X)|rinvF(X,$f1(X)).
% 1.62/2.21 0 [] -cUnsatisfiable(X)|cd($f1(X)).
% 1.62/2.21 0 [] cUnsatisfiable(X)| -ccxcomp(X)|rinvR(X,$f2(X))| -rinvF(X,X1)| -cd(X1).
% 1.62/2.21 0 [] cUnsatisfiable(X)| -ccxcomp(X)| -ca_Vx3($f2(X))| -rinvF(X,X1)| -cd(X1).
% 1.62/2.21 0 [] -cc(X)| -ra_Px1(X,Y).
% 1.62/2.21 0 [] cc(X)|ra_Px1(X,$f3(X)).
% 1.62/2.21 0 [] -ccxcomp(X)|ra_Px1(X,$f4(X)).
% 1.62/2.21 0 [] ccxcomp(X)| -ra_Px1(X,Y0).
% 1.62/2.21 0 [] -cd(X)|rf(X,$f5(X)).
% 1.62/2.21 0 [] -cd(X)|ccxcomp($f5(X)).
% 1.62/2.21 0 [] -cd(X)|cc(X).
% 1.62/2.21 0 [] cd(X)| -rf(X,Y)| -ccxcomp(Y)| -cc(X).
% 1.62/2.21 0 [] -ca_Vx3(X)|rinvF(X,$f6(X)).
% 1.62/2.21 0 [] -ca_Vx3(X)|cd($f6(X)).
% 1.62/2.21 0 [] ca_Vx3(X)| -rinvF(X,Y)| -cd(Y).
% 1.62/2.21 0 [] -cowlThing(X)| -rf(X,Y0)| -rf(X,Y1)|Y0=Y1.
% 1.62/2.21 0 [] -rinvF(X,Y)|rf(Y,X).
% 1.62/2.21 0 [] rinvF(X,Y)| -rf(Y,X).
% 1.62/2.21 0 [] -rinvR(X,Y)|rr(Y,X).
% 1.62/2.21 0 [] rinvR(X,Y)| -rr(Y,X).
% 1.62/2.21 0 [] -rr(X,Y)| -rr(Y,Z)|rr(X,Z).
% 1.62/2.21 0 [] cUnsatisfiable(i2003_11_14_17_21_37349).
% 1.62/2.21 0 [] -rf(X,Y)|rr(X,Y).
% 1.62/2.21 end_of_list.
% 1.62/2.21
% 1.62/2.21 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.62/2.21
% 1.62/2.21 This ia a non-Horn set with equality. The strategy will be
% 1.62/2.21 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.62/2.21 deletion, with positive clauses in sos and nonpositive
% 1.62/2.21 clauses in usable.
% 1.62/2.21
% 1.62/2.21 dependent: set(knuth_bendix).
% 1.62/2.21 dependent: set(anl_eq).
% 2.07/2.23 dependent: set(para_from).
% 2.07/2.23 dependent: set(para_into).
% 2.07/2.23 dependent: clear(para_from_right).
% 2.07/2.23 dependent: clear(para_into_right).
% 2.07/2.23 dependent: set(para_from_vars).
% 2.07/2.23 dependent: set(eq_units_both_ways).
% 2.07/2.23 dependent: set(dynamic_demod_all).
% 2.07/2.23 dependent: set(dynamic_demod).
% 2.07/2.23 dependent: set(order_eq).
% 2.07/2.23 dependent: set(back_demod).
% 2.07/2.23 dependent: set(lrpo).
% 2.07/2.23 dependent: set(hyper_res).
% 2.07/2.23 dependent: set(unit_deletion).
% 2.07/2.23 dependent: set(factor).
% 2.07/2.23
% 2.07/2.23 ------------> process usable:
% 2.07/2.23 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 2.07/2.23 ** KEPT (pick-wt=7): 2 [] A!=B| -ca_Vx3(A)|ca_Vx3(B).
% 2.07/2.23 ** KEPT (pick-wt=7): 3 [] A!=B| -cc(A)|cc(B).
% 2.07/2.23 ** KEPT (pick-wt=7): 4 [] A!=B| -ccxcomp(A)|ccxcomp(B).
% 2.07/2.23 ** KEPT (pick-wt=7): 5 [] A!=B| -cd(A)|cd(B).
% 2.07/2.23 ** KEPT (pick-wt=7): 6 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 2.07/2.23 ** KEPT (pick-wt=7): 7 [] A!=B| -cowlThing(A)|cowlThing(B).
% 2.07/2.23 ** KEPT (pick-wt=9): 8 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 2.07/2.23 ** KEPT (pick-wt=9): 9 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 2.07/2.23 ** KEPT (pick-wt=9): 10 [] A!=B| -rf(A,C)|rf(B,C).
% 2.07/2.23 ** KEPT (pick-wt=9): 11 [] A!=B| -rf(C,A)|rf(C,B).
% 2.07/2.23 ** KEPT (pick-wt=9): 12 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 2.07/2.23 ** KEPT (pick-wt=9): 13 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 2.07/2.23 ** KEPT (pick-wt=9): 14 [] A!=B| -rinvR(A,C)|rinvR(B,C).
% 2.07/2.23 ** KEPT (pick-wt=9): 15 [] A!=B| -rinvR(C,A)|rinvR(C,B).
% 2.07/2.23 ** KEPT (pick-wt=9): 16 [] A!=B| -rr(A,C)|rr(B,C).
% 2.07/2.23 ** KEPT (pick-wt=9): 17 [] A!=B| -rr(C,A)|rr(C,B).
% 2.07/2.23 ** KEPT (pick-wt=7): 18 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 2.07/2.23 ** KEPT (pick-wt=7): 19 [] A!=B| -xsd_string(A)|xsd_string(B).
% 2.07/2.23 ** KEPT (pick-wt=2): 20 [] -cowlNothing(A).
% 2.07/2.23 ** KEPT (pick-wt=4): 21 [] -xsd_string(A)| -xsd_integer(A).
% 2.07/2.23 ** KEPT (pick-wt=4): 22 [] -cUnsatisfiable(A)|ccxcomp(A).
% 2.07/2.23 ** KEPT (pick-wt=7): 23 [] -cUnsatisfiable(A)| -rinvR(A,B)|ca_Vx3(B).
% 2.07/2.23 ** KEPT (pick-wt=6): 24 [] -cUnsatisfiable(A)|rinvF(A,$f1(A)).
% 2.07/2.23 ** KEPT (pick-wt=5): 25 [] -cUnsatisfiable(A)|cd($f1(A)).
% 2.07/2.23 ** KEPT (pick-wt=13): 26 [] cUnsatisfiable(A)| -ccxcomp(A)|rinvR(A,$f2(A))| -rinvF(A,B)| -cd(B).
% 2.07/2.23 ** KEPT (pick-wt=12): 27 [] cUnsatisfiable(A)| -ccxcomp(A)| -ca_Vx3($f2(A))| -rinvF(A,B)| -cd(B).
% 2.07/2.23 ** KEPT (pick-wt=5): 28 [] -cc(A)| -ra_Px1(A,B).
% 2.07/2.23 ** KEPT (pick-wt=6): 29 [] -ccxcomp(A)|ra_Px1(A,$f4(A)).
% 2.07/2.23 ** KEPT (pick-wt=5): 30 [] ccxcomp(A)| -ra_Px1(A,B).
% 2.07/2.23 ** KEPT (pick-wt=6): 31 [] -cd(A)|rf(A,$f5(A)).
% 2.07/2.23 ** KEPT (pick-wt=5): 32 [] -cd(A)|ccxcomp($f5(A)).
% 2.07/2.23 ** KEPT (pick-wt=4): 33 [] -cd(A)|cc(A).
% 2.07/2.23 ** KEPT (pick-wt=9): 34 [] cd(A)| -rf(A,B)| -ccxcomp(B)| -cc(A).
% 2.07/2.23 ** KEPT (pick-wt=6): 35 [] -ca_Vx3(A)|rinvF(A,$f6(A)).
% 2.07/2.23 ** KEPT (pick-wt=5): 36 [] -ca_Vx3(A)|cd($f6(A)).
% 2.07/2.23 ** KEPT (pick-wt=7): 37 [] ca_Vx3(A)| -rinvF(A,B)| -cd(B).
% 2.07/2.23 ** KEPT (pick-wt=11): 38 [] -cowlThing(A)| -rf(A,B)| -rf(A,C)|B=C.
% 2.07/2.23 ** KEPT (pick-wt=6): 39 [] -rinvF(A,B)|rf(B,A).
% 2.07/2.23 ** KEPT (pick-wt=6): 40 [] rinvF(A,B)| -rf(B,A).
% 2.07/2.23 ** KEPT (pick-wt=6): 41 [] -rinvR(A,B)|rr(B,A).
% 2.07/2.23 ** KEPT (pick-wt=6): 42 [] rinvR(A,B)| -rr(B,A).
% 2.07/2.23 ** KEPT (pick-wt=9): 43 [] -rr(A,B)| -rr(B,C)|rr(A,C).
% 2.07/2.23 ** KEPT (pick-wt=6): 44 [] -rf(A,B)|rr(A,B).
% 2.07/2.23 20 back subsumes 6.
% 2.07/2.23
% 2.07/2.23 ------------> process sos:
% 2.07/2.23 ** KEPT (pick-wt=3): 46 [] A=A.
% 2.07/2.23 ** KEPT (pick-wt=2): 47 [] cowlThing(A).
% 2.07/2.23 ** KEPT (pick-wt=4): 48 [] xsd_string(A)|xsd_integer(A).
% 2.07/2.23 ** KEPT (pick-wt=6): 49 [] cc(A)|ra_Px1(A,$f3(A)).
% 2.07/2.23 ** KEPT (pick-wt=2): 50 [] cUnsatisfiable(i2003_11_14_17_21_37349).
% 2.07/2.23 Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] A=A.
% 2.07/2.23 46 back subsumes 45.
% 2.07/2.23 47 back subsumes 7.
% 2.07/2.23
% 2.07/2.23 ======= end of input processing =======
% 2.07/2.23
% 2.07/2.23 =========== start of search ===========
% 2.07/2.23
% 2.07/2.23 -------- PROOF --------
% 2.07/2.23
% 2.07/2.23 -----> EMPTY CLAUSE at 0.02 sec ----> 330 [hyper,326,28,57] $F.
% 2.07/2.23
% 2.07/2.23 Length of proof is 15. Level of proof is 9.
% 2.07/2.23
% 2.07/2.23 ---------------- PROOF ----------------
% 2.07/2.23 % SZS status Theorem
% 2.07/2.23 % SZS output start Refutation
% See solution above
% 2.07/2.23 ------------ end of proof -------------
% 2.07/2.23
% 2.07/2.23
% 2.07/2.23 Search stopped by max_proofs option.
% 2.07/2.23
% 2.07/2.23
% 2.07/2.23 Search stopped by max_proofs option.
% 2.07/2.23
% 2.07/2.23 ============ end of search ============
% 2.07/2.23
% 2.07/2.23 -------------- statistics -------------
% 2.07/2.23 clauses given 69
% 2.07/2.23 clauses generated 710
% 2.07/2.23 clauses kept 326
% 2.07/2.23 clauses forward subsumed 456
% 2.07/2.23 clauses back subsumed 3
% 2.07/2.23 Kbytes malloced 1953
% 2.07/2.23
% 2.07/2.23 ----------- times (seconds) -----------
% 2.07/2.23 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 2.07/2.23 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.07/2.23 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.07/2.23
% 2.07/2.23 That finishes the proof of the theorem.
% 2.07/2.23
% 2.07/2.23 Process 25301 finished Wed Jul 27 03:23:48 2022
% 2.07/2.23 Otter interrupted
% 2.07/2.23 PROOF FOUND
%------------------------------------------------------------------------------