TSTP Solution File: KRS108+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS108+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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 1.95s 2.13s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 26 ( 14 unt; 1 nHn; 25 RR)
% Number of literals : 40 ( 2 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 16 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(42,axiom,
( ~ cUnsatisfiable(A)
| rinvR(A,dollar_f1(A)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ cUnsatisfiable(A)
| ca_Ax14(dollar_f1(A)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ cUnsatisfiable(A)
| cp2(A) ),
file('KRS108+1.p',unknown),
[] ).
cnf(46,axiom,
( ~ cp1(A)
| ca_Cx1(A) ),
file('KRS108+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ cp2(A)
| ra_Px5(A,dollar_f2(A)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ cp2xcomp(A)
| ~ ra_Px5(A,B) ),
file('KRS108+1.p',unknown),
[] ).
cnf(62,axiom,
( ~ ca_Ax14(A)
| rr(A,dollar_f10(A)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ ca_Ax14(A)
| cp1(dollar_f10(A)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(64,axiom,
( ~ ca_Ax14(A)
| ~ rr(A,B)
| ~ rr(A,C)
| B = C ),
file('KRS108+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ ca_Cx1(A)
| cp2xcomp(A) ),
file('KRS108+1.p',unknown),
[] ).
cnf(89,axiom,
( ~ rinvR(A,B)
| rr(B,A) ),
file('KRS108+1.p',unknown),
[] ).
cnf(95,axiom,
( cp2xcomp(A)
| ra_Px5(A,dollar_f3(A)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(102,axiom,
cUnsatisfiable(i2003_11_14_17_21_04740),
file('KRS108+1.p',unknown),
[] ).
cnf(103,plain,
cp2(i2003_11_14_17_21_04740),
inference(hyper,[status(thm)],[102,44]),
[iquote('hyper,102,44')] ).
cnf(104,plain,
ca_Ax14(dollar_f1(i2003_11_14_17_21_04740)),
inference(hyper,[status(thm)],[102,43]),
[iquote('hyper,102,43')] ).
cnf(105,plain,
rinvR(i2003_11_14_17_21_04740,dollar_f1(i2003_11_14_17_21_04740)),
inference(hyper,[status(thm)],[102,42]),
[iquote('hyper,102,42')] ).
cnf(108,plain,
ra_Px5(i2003_11_14_17_21_04740,dollar_f2(i2003_11_14_17_21_04740)),
inference(hyper,[status(thm)],[103,47]),
[iquote('hyper,103,47')] ).
cnf(123,plain,
cp1(dollar_f10(dollar_f1(i2003_11_14_17_21_04740))),
inference(hyper,[status(thm)],[104,63]),
[iquote('hyper,104,63')] ).
cnf(124,plain,
rr(dollar_f1(i2003_11_14_17_21_04740),dollar_f10(dollar_f1(i2003_11_14_17_21_04740))),
inference(hyper,[status(thm)],[104,62]),
[iquote('hyper,104,62')] ).
cnf(127,plain,
rr(dollar_f1(i2003_11_14_17_21_04740),i2003_11_14_17_21_04740),
inference(hyper,[status(thm)],[105,89]),
[iquote('hyper,105,89')] ).
cnf(131,plain,
ra_Px5(i2003_11_14_17_21_04740,dollar_f3(i2003_11_14_17_21_04740)),
inference(hyper,[status(thm)],[108,50,95]),
[iquote('hyper,108,50,95')] ).
cnf(142,plain,
ca_Cx1(dollar_f10(dollar_f1(i2003_11_14_17_21_04740))),
inference(hyper,[status(thm)],[123,46]),
[iquote('hyper,123,46')] ).
cnf(159,plain,
cp2xcomp(dollar_f10(dollar_f1(i2003_11_14_17_21_04740))),
inference(hyper,[status(thm)],[142,68]),
[iquote('hyper,142,68')] ).
cnf(203,plain,
dollar_f10(dollar_f1(i2003_11_14_17_21_04740)) = i2003_11_14_17_21_04740,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[124,64,104,127])]),
[iquote('hyper,124,64,104,127,flip.1')] ).
cnf(206,plain,
cp2xcomp(i2003_11_14_17_21_04740),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[159]),203]),
[iquote('back_demod,159,demod,203')] ).
cnf(212,plain,
$false,
inference(hyper,[status(thm)],[206,50,131]),
[iquote('hyper,206,50,131')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS108+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 03:29:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.95/2.12 ----- Otter 3.3f, August 2004 -----
% 1.95/2.12 The process was started by sandbox2 on n022.cluster.edu,
% 1.95/2.12 Wed Jul 27 03:29:05 2022
% 1.95/2.12 The command was "./otter". The process ID is 25191.
% 1.95/2.12
% 1.95/2.12 set(prolog_style_variables).
% 1.95/2.12 set(auto).
% 1.95/2.12 dependent: set(auto1).
% 1.95/2.12 dependent: set(process_input).
% 1.95/2.12 dependent: clear(print_kept).
% 1.95/2.12 dependent: clear(print_new_demod).
% 1.95/2.12 dependent: clear(print_back_demod).
% 1.95/2.12 dependent: clear(print_back_sub).
% 1.95/2.12 dependent: set(control_memory).
% 1.95/2.12 dependent: assign(max_mem, 12000).
% 1.95/2.12 dependent: assign(pick_given_ratio, 4).
% 1.95/2.12 dependent: assign(stats_level, 1).
% 1.95/2.12 dependent: assign(max_seconds, 10800).
% 1.95/2.12 clear(print_given).
% 1.95/2.12
% 1.95/2.12 formula_list(usable).
% 1.95/2.12 all A (A=A).
% 1.95/2.12 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 1.95/2.12 all A B (A=B&ca_Ax14(A)->ca_Ax14(B)).
% 1.95/2.12 all A B (A=B&ca_Cx1(A)->ca_Cx1(B)).
% 1.95/2.12 all A B (A=B&ca_Cx1xcomp(A)->ca_Cx1xcomp(B)).
% 1.95/2.12 all A B (A=B&ca_Cx2(A)->ca_Cx2(B)).
% 1.95/2.12 all A B (A=B&ca_Cx2xcomp(A)->ca_Cx2xcomp(B)).
% 1.95/2.12 all A B (A=B&ca_Cx3(A)->ca_Cx3(B)).
% 1.95/2.12 all A B (A=B&ca_Cx3xcomp(A)->ca_Cx3xcomp(B)).
% 1.95/2.12 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.95/2.12 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.95/2.12 all A B (A=B&cp1(A)->cp1(B)).
% 1.95/2.12 all A B (A=B&cp2(A)->cp2(B)).
% 1.95/2.12 all A B (A=B&cp2xcomp(A)->cp2xcomp(B)).
% 1.95/2.12 all A B (A=B&cp3(A)->cp3(B)).
% 1.95/2.12 all A B (A=B&cp3xcomp(A)->cp3xcomp(B)).
% 1.95/2.12 all A B (A=B&cp4(A)->cp4(B)).
% 1.95/2.12 all A B (A=B&cp4xcomp(A)->cp4xcomp(B)).
% 1.95/2.12 all A B (A=B&cp5(A)->cp5(B)).
% 1.95/2.12 all A B (A=B&cp5xcomp(A)->cp5xcomp(B)).
% 1.95/2.12 all A B C (A=B&ra_Px1(A,C)->ra_Px1(B,C)).
% 1.95/2.12 all A B C (A=B&ra_Px1(C,A)->ra_Px1(C,B)).
% 1.95/2.12 all A B C (A=B&ra_Px2(A,C)->ra_Px2(B,C)).
% 1.95/2.12 all A B C (A=B&ra_Px2(C,A)->ra_Px2(C,B)).
% 1.95/2.12 all A B C (A=B&ra_Px3(A,C)->ra_Px3(B,C)).
% 1.95/2.12 all A B C (A=B&ra_Px3(C,A)->ra_Px3(C,B)).
% 1.95/2.12 all A B C (A=B&ra_Px4(A,C)->ra_Px4(B,C)).
% 1.95/2.12 all A B C (A=B&ra_Px4(C,A)->ra_Px4(C,B)).
% 1.95/2.12 all A B C (A=B&ra_Px5(A,C)->ra_Px5(B,C)).
% 1.95/2.12 all A B C (A=B&ra_Px5(C,A)->ra_Px5(C,B)).
% 1.95/2.12 all A B C (A=B&ra_Px6(A,C)->ra_Px6(B,C)).
% 1.95/2.12 all A B C (A=B&ra_Px6(C,A)->ra_Px6(C,B)).
% 1.95/2.12 all A B C (A=B&ra_Px7(A,C)->ra_Px7(B,C)).
% 1.95/2.12 all A B C (A=B&ra_Px7(C,A)->ra_Px7(C,B)).
% 1.95/2.12 all A B C (A=B&rinvR(A,C)->rinvR(B,C)).
% 1.95/2.12 all A B C (A=B&rinvR(C,A)->rinvR(C,B)).
% 1.95/2.12 all A B C (A=B&rr(A,C)->rr(B,C)).
% 1.95/2.12 all A B C (A=B&rr(C,A)->rr(C,B)).
% 1.95/2.12 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.95/2.12 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.95/2.12 all X (cowlThing(X)& -cowlNothing(X)).
% 1.95/2.12 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.95/2.12 all X (cUnsatisfiable(X)<-> (exists Y (rinvR(X,Y)&ca_Ax14(Y)))&cp2(X)).
% 1.95/2.12 all X (cp1(X)->ca_Cx1(X)).
% 1.95/2.12 all X (cp2(X)<-> (exists Y0 ra_Px5(X,Y0))).
% 1.95/2.12 all X (cp2(X)->ca_Cx2(X)).
% 1.95/2.12 all X (cp2xcomp(X)<-> -(exists Y ra_Px5(X,Y))).
% 1.95/2.12 all X (cp3(X)<-> (exists Y0 ra_Px6(X,Y0))).
% 1.95/2.12 all X (cp3(X)->ca_Cx3(X)).
% 1.95/2.12 all X (cp3xcomp(X)<-> -(exists Y ra_Px6(X,Y))).
% 1.95/2.12 all X (cp4(X)<-> -(exists Y ra_Px7(X,Y))).
% 1.95/2.12 all X (cp4(X)->cp5xcomp(X)).
% 1.95/2.12 all X (cp4xcomp(X)<-> (exists Y0 ra_Px7(X,Y0))).
% 1.95/2.12 all X (cp5(X)<-> -(exists Y ra_Px4(X,Y))).
% 1.95/2.12 all X (cp5xcomp(X)<-> (exists Y0 ra_Px4(X,Y0))).
% 1.95/2.12 all X (ca_Ax14(X)<-> (exists Y (rr(X,Y)&cp1(Y)))& (all Y0 Y1 (rr(X,Y0)&rr(X,Y1)->Y0=Y1))).
% 1.95/2.12 all X (ca_Cx1(X)<->cp2xcomp(X)&cp5xcomp(X)&cp3xcomp(X)&cp4xcomp(X)).
% 1.95/2.12 all X (ca_Cx1(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 1.95/2.12 all X (ca_Cx1xcomp(X)<-> -(exists Y ra_Px1(X,Y))).
% 1.95/2.12 all X (ca_Cx2(X)<->cp5xcomp(X)&cp3xcomp(X)&cp4xcomp(X)).
% 1.95/2.12 all X (ca_Cx2(X)<-> -(exists Y ra_Px2(X,Y))).
% 1.95/2.12 all X (ca_Cx2xcomp(X)<-> (exists Y0 ra_Px2(X,Y0))).
% 1.95/2.12 all X (ca_Cx3(X)<-> -(exists Y ra_Px3(X,Y))).
% 1.95/2.12 all X (ca_Cx3(X)<->cp5xcomp(X)&cp4xcomp(X)).
% 1.95/2.12 all X (ca_Cx3xcomp(X)<-> (exists Y0 ra_Px3(X,Y0))).
% 1.95/2.12 all X Y (rinvR(X,Y)<->rr(Y,X)).
% 1.95/2.12 cUnsatisfiable(i2003_11_14_17_21_04740).
% 1.95/2.12 end_of_list.
% 1.95/2.12
% 1.95/2.12 -------> usable clausifies to:
% 1.95/2.12
% 1.95/2.12 list(usable).
% 1.95/2.12 0 [] A=A.
% 1.95/2.12 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.95/2.12 0 [] A!=B| -ca_Ax14(A)|ca_Ax14(B).
% 1.95/2.12 0 [] A!=B| -ca_Cx1(A)|ca_Cx1(B).
% 1.95/2.12 0 [] A!=B| -ca_Cx1xcomp(A)|ca_Cx1xcomp(B).
% 1.95/2.12 0 [] A!=B| -ca_Cx2(A)|ca_Cx2(B).
% 1.95/2.12 0 [] A!=B| -ca_Cx2xcomp(A)|ca_Cx2xcomp(B).
% 1.95/2.12 0 [] A!=B| -ca_Cx3(A)|ca_Cx3(B).
% 1.95/2.12 0 [] A!=B| -ca_Cx3xcomp(A)|ca_Cx3xcomp(B).
% 1.95/2.12 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.95/2.12 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.95/2.12 0 [] A!=B| -cp1(A)|cp1(B).
% 1.95/2.12 0 [] A!=B| -cp2(A)|cp2(B).
% 1.95/2.12 0 [] A!=B| -cp2xcomp(A)|cp2xcomp(B).
% 1.95/2.12 0 [] A!=B| -cp3(A)|cp3(B).
% 1.95/2.12 0 [] A!=B| -cp3xcomp(A)|cp3xcomp(B).
% 1.95/2.12 0 [] A!=B| -cp4(A)|cp4(B).
% 1.95/2.12 0 [] A!=B| -cp4xcomp(A)|cp4xcomp(B).
% 1.95/2.12 0 [] A!=B| -cp5(A)|cp5(B).
% 1.95/2.12 0 [] A!=B| -cp5xcomp(A)|cp5xcomp(B).
% 1.95/2.12 0 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 1.95/2.12 0 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 1.95/2.12 0 [] A!=B| -ra_Px2(A,C)|ra_Px2(B,C).
% 1.95/2.12 0 [] A!=B| -ra_Px2(C,A)|ra_Px2(C,B).
% 1.95/2.12 0 [] A!=B| -ra_Px3(A,C)|ra_Px3(B,C).
% 1.95/2.12 0 [] A!=B| -ra_Px3(C,A)|ra_Px3(C,B).
% 1.95/2.12 0 [] A!=B| -ra_Px4(A,C)|ra_Px4(B,C).
% 1.95/2.12 0 [] A!=B| -ra_Px4(C,A)|ra_Px4(C,B).
% 1.95/2.12 0 [] A!=B| -ra_Px5(A,C)|ra_Px5(B,C).
% 1.95/2.12 0 [] A!=B| -ra_Px5(C,A)|ra_Px5(C,B).
% 1.95/2.12 0 [] A!=B| -ra_Px6(A,C)|ra_Px6(B,C).
% 1.95/2.12 0 [] A!=B| -ra_Px6(C,A)|ra_Px6(C,B).
% 1.95/2.12 0 [] A!=B| -ra_Px7(A,C)|ra_Px7(B,C).
% 1.95/2.12 0 [] A!=B| -ra_Px7(C,A)|ra_Px7(C,B).
% 1.95/2.12 0 [] A!=B| -rinvR(A,C)|rinvR(B,C).
% 1.95/2.12 0 [] A!=B| -rinvR(C,A)|rinvR(C,B).
% 1.95/2.12 0 [] A!=B| -rr(A,C)|rr(B,C).
% 1.95/2.12 0 [] A!=B| -rr(C,A)|rr(C,B).
% 1.95/2.12 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.95/2.12 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.95/2.12 0 [] cowlThing(X).
% 1.95/2.12 0 [] -cowlNothing(X).
% 1.95/2.12 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.95/2.12 0 [] xsd_string(X)|xsd_integer(X).
% 1.95/2.12 0 [] -cUnsatisfiable(X)|rinvR(X,$f1(X)).
% 1.95/2.13 0 [] -cUnsatisfiable(X)|ca_Ax14($f1(X)).
% 1.95/2.13 0 [] -cUnsatisfiable(X)|cp2(X).
% 1.95/2.13 0 [] cUnsatisfiable(X)| -rinvR(X,Y)| -ca_Ax14(Y)| -cp2(X).
% 1.95/2.13 0 [] -cp1(X)|ca_Cx1(X).
% 1.95/2.13 0 [] -cp2(X)|ra_Px5(X,$f2(X)).
% 1.95/2.13 0 [] cp2(X)| -ra_Px5(X,Y0).
% 1.95/2.13 0 [] -cp2(X)|ca_Cx2(X).
% 1.95/2.13 0 [] -cp2xcomp(X)| -ra_Px5(X,Y).
% 1.95/2.13 0 [] cp2xcomp(X)|ra_Px5(X,$f3(X)).
% 1.95/2.13 0 [] -cp3(X)|ra_Px6(X,$f4(X)).
% 1.95/2.13 0 [] cp3(X)| -ra_Px6(X,Y0).
% 1.95/2.13 0 [] -cp3(X)|ca_Cx3(X).
% 1.95/2.13 0 [] -cp3xcomp(X)| -ra_Px6(X,Y).
% 1.95/2.13 0 [] cp3xcomp(X)|ra_Px6(X,$f5(X)).
% 1.95/2.13 0 [] -cp4(X)| -ra_Px7(X,Y).
% 1.95/2.13 0 [] cp4(X)|ra_Px7(X,$f6(X)).
% 1.95/2.13 0 [] -cp4(X)|cp5xcomp(X).
% 1.95/2.13 0 [] -cp4xcomp(X)|ra_Px7(X,$f7(X)).
% 1.95/2.13 0 [] cp4xcomp(X)| -ra_Px7(X,Y0).
% 1.95/2.13 0 [] -cp5(X)| -ra_Px4(X,Y).
% 1.95/2.13 0 [] cp5(X)|ra_Px4(X,$f8(X)).
% 1.95/2.13 0 [] -cp5xcomp(X)|ra_Px4(X,$f9(X)).
% 1.95/2.13 0 [] cp5xcomp(X)| -ra_Px4(X,Y0).
% 1.95/2.13 0 [] -ca_Ax14(X)|rr(X,$f10(X)).
% 1.95/2.13 0 [] -ca_Ax14(X)|cp1($f10(X)).
% 1.95/2.13 0 [] -ca_Ax14(X)| -rr(X,Y0)| -rr(X,Y1)|Y0=Y1.
% 1.95/2.13 0 [] ca_Ax14(X)| -rr(X,Y)| -cp1(Y)|rr(X,$f12(X)).
% 1.95/2.13 0 [] ca_Ax14(X)| -rr(X,Y)| -cp1(Y)|rr(X,$f11(X)).
% 1.95/2.13 0 [] ca_Ax14(X)| -rr(X,Y)| -cp1(Y)|$f12(X)!=$f11(X).
% 1.95/2.13 0 [] -ca_Cx1(X)|cp2xcomp(X).
% 1.95/2.13 0 [] -ca_Cx1(X)|cp5xcomp(X).
% 1.95/2.13 0 [] -ca_Cx1(X)|cp3xcomp(X).
% 1.95/2.13 0 [] -ca_Cx1(X)|cp4xcomp(X).
% 1.95/2.13 0 [] ca_Cx1(X)| -cp2xcomp(X)| -cp5xcomp(X)| -cp3xcomp(X)| -cp4xcomp(X).
% 1.95/2.13 0 [] -ca_Cx1(X)|ra_Px1(X,$f13(X)).
% 1.95/2.13 0 [] ca_Cx1(X)| -ra_Px1(X,Y0).
% 1.95/2.13 0 [] -ca_Cx1xcomp(X)| -ra_Px1(X,Y).
% 1.95/2.13 0 [] ca_Cx1xcomp(X)|ra_Px1(X,$f14(X)).
% 1.95/2.13 0 [] -ca_Cx2(X)|cp5xcomp(X).
% 1.95/2.13 0 [] -ca_Cx2(X)|cp3xcomp(X).
% 1.95/2.13 0 [] -ca_Cx2(X)|cp4xcomp(X).
% 1.95/2.13 0 [] ca_Cx2(X)| -cp5xcomp(X)| -cp3xcomp(X)| -cp4xcomp(X).
% 1.95/2.13 0 [] -ca_Cx2(X)| -ra_Px2(X,Y).
% 1.95/2.13 0 [] ca_Cx2(X)|ra_Px2(X,$f15(X)).
% 1.95/2.13 0 [] -ca_Cx2xcomp(X)|ra_Px2(X,$f16(X)).
% 1.95/2.13 0 [] ca_Cx2xcomp(X)| -ra_Px2(X,Y0).
% 1.95/2.13 0 [] -ca_Cx3(X)| -ra_Px3(X,Y).
% 1.95/2.13 0 [] ca_Cx3(X)|ra_Px3(X,$f17(X)).
% 1.95/2.13 0 [] -ca_Cx3(X)|cp5xcomp(X).
% 1.95/2.13 0 [] -ca_Cx3(X)|cp4xcomp(X).
% 1.95/2.13 0 [] ca_Cx3(X)| -cp5xcomp(X)| -cp4xcomp(X).
% 1.95/2.13 0 [] -ca_Cx3xcomp(X)|ra_Px3(X,$f18(X)).
% 1.95/2.13 0 [] ca_Cx3xcomp(X)| -ra_Px3(X,Y0).
% 1.95/2.13 0 [] -rinvR(X,Y)|rr(Y,X).
% 1.95/2.13 0 [] rinvR(X,Y)| -rr(Y,X).
% 1.95/2.13 0 [] cUnsatisfiable(i2003_11_14_17_21_04740).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.95/2.13
% 1.95/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.13 deletion, with positive clauses in sos and nonpositive
% 1.95/2.13 clauses in usable.
% 1.95/2.13
% 1.95/2.13 dependent: set(knuth_bendix).
% 1.95/2.13 dependent: set(anl_eq).
% 1.95/2.13 dependent: set(para_from).
% 1.95/2.13 dependent: set(para_into).
% 1.95/2.13 dependent: clear(para_from_right).
% 1.95/2.13 dependent: clear(para_into_right).
% 1.95/2.13 dependent: set(para_from_vars).
% 1.95/2.13 dependent: set(eq_units_both_ways).
% 1.95/2.13 dependent: set(dynamic_demod_all).
% 1.95/2.13 dependent: set(dynamic_demod).
% 1.95/2.13 dependent: set(order_eq).
% 1.95/2.13 dependent: set(back_demod).
% 1.95/2.13 dependent: set(lrpo).
% 1.95/2.13 dependent: set(hyper_res).
% 1.95/2.13 dependent: set(unit_deletion).
% 1.95/2.13 dependent: set(factor).
% 1.95/2.13
% 1.95/2.13 ------------> process usable:
% 1.95/2.13 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 2 [] A!=B| -ca_Ax14(A)|ca_Ax14(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 3 [] A!=B| -ca_Cx1(A)|ca_Cx1(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 4 [] A!=B| -ca_Cx1xcomp(A)|ca_Cx1xcomp(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 5 [] A!=B| -ca_Cx2(A)|ca_Cx2(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 6 [] A!=B| -ca_Cx2xcomp(A)|ca_Cx2xcomp(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 7 [] A!=B| -ca_Cx3(A)|ca_Cx3(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 8 [] A!=B| -ca_Cx3xcomp(A)|ca_Cx3xcomp(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 9 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 10 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 11 [] A!=B| -cp1(A)|cp1(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 12 [] A!=B| -cp2(A)|cp2(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 13 [] A!=B| -cp2xcomp(A)|cp2xcomp(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 14 [] A!=B| -cp3(A)|cp3(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 15 [] A!=B| -cp3xcomp(A)|cp3xcomp(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 16 [] A!=B| -cp4(A)|cp4(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 17 [] A!=B| -cp4xcomp(A)|cp4xcomp(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 18 [] A!=B| -cp5(A)|cp5(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 19 [] A!=B| -cp5xcomp(A)|cp5xcomp(B).
% 1.95/2.13 ** KEPT (pick-wt=9): 20 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 21 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 1.95/2.13 ** KEPT (pick-wt=9): 22 [] A!=B| -ra_Px2(A,C)|ra_Px2(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 23 [] A!=B| -ra_Px2(C,A)|ra_Px2(C,B).
% 1.95/2.13 ** KEPT (pick-wt=9): 24 [] A!=B| -ra_Px3(A,C)|ra_Px3(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 25 [] A!=B| -ra_Px3(C,A)|ra_Px3(C,B).
% 1.95/2.13 ** KEPT (pick-wt=9): 26 [] A!=B| -ra_Px4(A,C)|ra_Px4(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 27 [] A!=B| -ra_Px4(C,A)|ra_Px4(C,B).
% 1.95/2.13 ** KEPT (pick-wt=9): 28 [] A!=B| -ra_Px5(A,C)|ra_Px5(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 29 [] A!=B| -ra_Px5(C,A)|ra_Px5(C,B).
% 1.95/2.13 ** KEPT (pick-wt=9): 30 [] A!=B| -ra_Px6(A,C)|ra_Px6(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 31 [] A!=B| -ra_Px6(C,A)|ra_Px6(C,B).
% 1.95/2.13 ** KEPT (pick-wt=9): 32 [] A!=B| -ra_Px7(A,C)|ra_Px7(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 33 [] A!=B| -ra_Px7(C,A)|ra_Px7(C,B).
% 1.95/2.13 ** KEPT (pick-wt=9): 34 [] A!=B| -rinvR(A,C)|rinvR(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 35 [] A!=B| -rinvR(C,A)|rinvR(C,B).
% 1.95/2.13 ** KEPT (pick-wt=9): 36 [] A!=B| -rr(A,C)|rr(B,C).
% 1.95/2.13 ** KEPT (pick-wt=9): 37 [] A!=B| -rr(C,A)|rr(C,B).
% 1.95/2.13 ** KEPT (pick-wt=7): 38 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 39 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.95/2.13 ** KEPT (pick-wt=2): 40 [] -cowlNothing(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 41 [] -xsd_string(A)| -xsd_integer(A).
% 1.95/2.13 ** KEPT (pick-wt=6): 42 [] -cUnsatisfiable(A)|rinvR(A,$f1(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 43 [] -cUnsatisfiable(A)|ca_Ax14($f1(A)).
% 1.95/2.13 ** KEPT (pick-wt=4): 44 [] -cUnsatisfiable(A)|cp2(A).
% 1.95/2.13 ** KEPT (pick-wt=9): 45 [] cUnsatisfiable(A)| -rinvR(A,B)| -ca_Ax14(B)| -cp2(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 46 [] -cp1(A)|ca_Cx1(A).
% 1.95/2.13 ** KEPT (pick-wt=6): 47 [] -cp2(A)|ra_Px5(A,$f2(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 48 [] cp2(A)| -ra_Px5(A,B).
% 1.95/2.13 ** KEPT (pick-wt=4): 49 [] -cp2(A)|ca_Cx2(A).
% 1.95/2.13 ** KEPT (pick-wt=5): 50 [] -cp2xcomp(A)| -ra_Px5(A,B).
% 1.95/2.13 ** KEPT (pick-wt=6): 51 [] -cp3(A)|ra_Px6(A,$f4(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 52 [] cp3(A)| -ra_Px6(A,B).
% 1.95/2.13 ** KEPT (pick-wt=4): 53 [] -cp3(A)|ca_Cx3(A).
% 1.95/2.13 ** KEPT (pick-wt=5): 54 [] -cp3xcomp(A)| -ra_Px6(A,B).
% 1.95/2.13 ** KEPT (pick-wt=5): 55 [] -cp4(A)| -ra_Px7(A,B).
% 1.95/2.13 ** KEPT (pick-wt=4): 56 [] -cp4(A)|cp5xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=6): 57 [] -cp4xcomp(A)|ra_Px7(A,$f7(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 58 [] cp4xcomp(A)| -ra_Px7(A,B).
% 1.95/2.13 ** KEPT (pick-wt=5): 59 [] -cp5(A)| -ra_Px4(A,B).
% 1.95/2.13 ** KEPT (pick-wt=6): 60 [] -cp5xcomp(A)|ra_Px4(A,$f9(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 61 [] cp5xcomp(A)| -ra_Px4(A,B).
% 1.95/2.13 ** KEPT (pick-wt=6): 62 [] -ca_Ax14(A)|rr(A,$f10(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 63 [] -ca_Ax14(A)|cp1($f10(A)).
% 1.95/2.13 ** KEPT (pick-wt=11): 64 [] -ca_Ax14(A)| -rr(A,B)| -rr(A,C)|B=C.
% 1.95/2.13 ** KEPT (pick-wt=11): 65 [] ca_Ax14(A)| -rr(A,B)| -cp1(B)|rr(A,$f12(A)).
% 1.95/2.13 ** KEPT (pick-wt=11): 66 [] ca_Ax14(A)| -rr(A,B)| -cp1(B)|rr(A,$f11(A)).
% 1.95/2.13 ** KEPT (pick-wt=12): 67 [] ca_Ax14(A)| -rr(A,B)| -cp1(B)|$f12(A)!=$f11(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 68 [] -ca_Cx1(A)|cp2xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 69 [] -ca_Cx1(A)|cp5xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 70 [] -ca_Cx1(A)|cp3xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 71 [] -ca_Cx1(A)|cp4xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=10): 72 [] ca_Cx1(A)| -cp2xcomp(A)| -cp5xcomp(A)| -cp3xcomp(A)| -cp4xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=6): 73 [] -ca_Cx1(A)|ra_Px1(A,$f13(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 74 [] ca_Cx1(A)| -ra_Px1(A,B).
% 1.95/2.13 ** KEPT (pick-wt=5): 75 [] -ca_Cx1xcomp(A)| -ra_Px1(A,B).
% 1.95/2.13 ** KEPT (pick-wt=4): 76 [] -ca_Cx2(A)|cp5xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 77 [] -ca_Cx2(A)|cp3xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 78 [] -ca_Cx2(A)|cp4xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=8): 79 [] ca_Cx2(A)| -cp5xcomp(A)| -cp3xcomp(A)| -cp4xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=5): 80 [] -ca_Cx2(A)| -ra_Px2(A,B).
% 1.95/2.13 ** KEPT (pick-wt=6): 81 [] -ca_Cx2xcomp(A)|ra_Px2(A,$f16(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 82 [] ca_Cx2xcomp(A)| -ra_Px2(A,B).
% 1.95/2.13 ** KEPT (pick-wt=5): 83 [] -ca_Cx3(A)| -ra_Px3(A,B).
% 1.95/2.13 ** KEPT (pick-wt=4): 84 [] -ca_Cx3(A)|cp5xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 85 [] -ca_Cx3(A)|cp4xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=6): 86 [] ca_Cx3(A)| -cp5xcomp(A)| -cp4xcomp(A).
% 1.95/2.13 ** KEPT (pick-wt=6): 87 [] -ca_Cx3xcomp(A)|ra_Px3(A,$f18(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 88 [] ca_Cx3xcomp(A)| -ra_Px3(A,B).
% 1.95/2.13 ** KEPT (pick-wt=6): 89 [] -rinvR(A,B)|rr(B,A).
% 1.95/2.13 ** KEPT (pick-wt=6): 90 [] rinvR(A,B)| -rr(B,A).
% 1.95/2.13 40 back subsumes 9.
% 1.95/2.13
% 1.95/2.13 ------------> process sos:
% 1.95/2.13 ** KEPT (pick-wt=3): 92 [] A=A.
% 1.95/2.13 ** KEPT (pick-wt=2): 93 [] cowlThing(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 94 [] xsd_string(A)|xsd_integer(A).
% 1.95/2.13 ** KEPT (pick-wt=6): 95 [] cp2xcomp(A)|ra_Px5(A,$f3(A)).
% 1.95/2.13 ** KEPT (pick-wt=6): 96 [] cp3xcomp(A)|ra_Px6(A,$f5(A)).
% 1.95/2.13 ** KEPT (pick-wt=6): 97 [] cp4(A)|ra_Px7(A,$f6(A)).
% 1.95/2.13 ** KEPT (pick-wt=6): 98 [] cp5(A)|ra_Px4(A,$f8(A)).
% 1.95/2.13 ** KEPT (pick-wt=6): 99 [] ca_Cx1xcomp(A)|ra_Px1(A,$f14(A)).
% 1.95/2.13 ** KEPT (pick-wt=6): 100 [] ca_Cx2(A)|ra_Px2(A,$f15(A)).
% 1.95/2.13 ** KEPT (pick-wt=6): 101 [] ca_Cx3(A)|ra_Px3(A,$f17(A)).
% 1.95/2.13 ** KEPT (pick-wt=2): 102 [] cUnsatisfiable(i2003_11_14_17_21_04740).
% 1.95/2.13 Following clause subsumed by 92 during input processing: 0 [copy,92,flip.1] A=A.
% 1.95/2.13 92 back subsumes 91.
% 1.95/2.13 93 back subsumes 10.
% 1.95/2.13
% 1.95/2.13 ======= end of input processing =======
% 1.95/2.13
% 1.95/2.13 =========== start of search ===========
% 1.95/2.13
% 1.95/2.13 -------- PROOF --------
% 1.95/2.13
% 1.95/2.13 -----> EMPTY CLAUSE at 0.01 sec ----> 212 [hyper,206,50,131] $F.
% 1.95/2.13
% 1.95/2.13 Length of proof is 12. Level of proof is 5.
% 1.95/2.13
% 1.95/2.13 ---------------- PROOF ----------------
% 1.95/2.13 % SZS status Theorem
% 1.95/2.13 % SZS output start Refutation
% See solution above
% 1.95/2.13 ------------ end of proof -------------
% 1.95/2.13
% 1.95/2.13
% 1.95/2.13 Search stopped by max_proofs option.
% 1.95/2.13
% 1.95/2.13
% 1.95/2.13 Search stopped by max_proofs option.
% 1.95/2.13
% 1.95/2.13 ============ end of search ============
% 1.95/2.13
% 1.95/2.13 -------------- statistics -------------
% 1.95/2.13 clauses given 37
% 1.95/2.13 clauses generated 255
% 1.95/2.13 clauses kept 210
% 1.95/2.13 clauses forward subsumed 167
% 1.95/2.13 clauses back subsumed 4
% 1.95/2.13 Kbytes malloced 1953
% 1.95/2.13
% 1.95/2.13 ----------- times (seconds) -----------
% 1.95/2.13 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.95/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.13 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.13
% 1.95/2.13 That finishes the proof of the theorem.
% 1.95/2.13
% 1.95/2.13 Process 25191 finished Wed Jul 27 03:29:07 2022
% 1.95/2.13 Otter interrupted
% 1.95/2.13 PROOF FOUND
%------------------------------------------------------------------------------