TSTP Solution File: COM013+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM013+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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 12:48:22 EDT 2022
% Result : Theorem 141.41s 141.62s
% Output : Refutation 141.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 30 ( 17 unt; 2 nHn; 29 RR)
% Number of literals : 79 ( 3 equ; 49 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 39 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aReductOfIn0(C,A,B)
| aElement0(C) ),
file('COM013+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aElement0(C)
| sdtmndtplgtdt0(A,B,C)
| ~ aReductOfIn0(C,A,B) ),
file('COM013+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aElement0(C)
| sdtmndtasgtdt0(A,B,C)
| A != C ),
file('COM013+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aElement0(C)
| sdtmndtasgtdt0(A,B,C)
| ~ sdtmndtplgtdt0(A,B,C) ),
file('COM013+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aElement0(C)
| ~ aElement0(D)
| ~ sdtmndtasgtdt0(A,B,C)
| ~ sdtmndtasgtdt0(C,B,D)
| sdtmndtasgtdt0(A,B,D) ),
file('COM013+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ aRewritingSystem0(A)
| ~ isTerminating0(A)
| ~ aElement0(B)
| ~ aElement0(C)
| ~ sdtmndtplgtdt0(B,A,C)
| iLess0(C,B) ),
file('COM013+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aNormalFormOfIn0(C,A,B)
| aElement0(C) ),
file('COM013+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aNormalFormOfIn0(C,A,B)
| sdtmndtasgtdt0(A,B,C) ),
file('COM013+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aNormalFormOfIn0(C,A,B)
| ~ aReductOfIn0(D,C,B) ),
file('COM013+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| aNormalFormOfIn0(C,A,B)
| ~ aElement0(C)
| ~ sdtmndtasgtdt0(A,B,C)
| aReductOfIn0(dollar_f12(A,B,C),C,B) ),
file('COM013+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ aElement0(A)
| ~ iLess0(A,dollar_c1)
| aNormalFormOfIn0(dollar_f13(A),A,xR) ),
file('COM013+1.p',unknown),
[] ).
cnf(40,axiom,
~ aNormalFormOfIn0(A,dollar_c1,xR),
file('COM013+1.p',unknown),
[] ).
cnf(48,plain,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| sdtmndtasgtdt0(A,B,A)
| A != A ),
inference(factor,[status(thm)],[9]),
[iquote('factor,9.1.3')] ).
cnf(68,plain,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| aNormalFormOfIn0(A,A,B)
| ~ sdtmndtasgtdt0(A,B,A)
| aReductOfIn0(dollar_f12(A,B,A),A,B) ),
inference(factor,[status(thm)],[38]),
[iquote('factor,38.1.4')] ).
cnf(73,axiom,
A = A,
file('COM013+1.p',unknown),
[] ).
cnf(74,axiom,
aRewritingSystem0(xR),
file('COM013+1.p',unknown),
[] ).
cnf(75,axiom,
isTerminating0(xR),
file('COM013+1.p',unknown),
[] ).
cnf(76,axiom,
aElement0(dollar_c1),
file('COM013+1.p',unknown),
[] ).
cnf(89,plain,
sdtmndtasgtdt0(dollar_c1,xR,dollar_c1),
inference(hyper,[status(thm)],[76,48,74,73]),
[iquote('hyper,76,48,74,73')] ).
cnf(90,plain,
aReductOfIn0(dollar_f12(dollar_c1,xR,dollar_c1),dollar_c1,xR),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[89,68,76,74]),40]),
[iquote('hyper,89,68,76,74,unit_del,40')] ).
cnf(124,plain,
aElement0(dollar_f12(dollar_c1,xR,dollar_c1)),
inference(hyper,[status(thm)],[90,1,76,74]),
[iquote('hyper,90,1,76,74')] ).
cnf(142,plain,
sdtmndtplgtdt0(dollar_c1,xR,dollar_f12(dollar_c1,xR,dollar_c1)),
inference(hyper,[status(thm)],[124,5,76,74,90]),
[iquote('hyper,124,5,76,74,90')] ).
cnf(154,plain,
iLess0(dollar_f12(dollar_c1,xR,dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[142,30,74,75,76,124]),
[iquote('hyper,142,30,74,75,76,124')] ).
cnf(155,plain,
sdtmndtasgtdt0(dollar_c1,xR,dollar_f12(dollar_c1,xR,dollar_c1)),
inference(hyper,[status(thm)],[142,10,76,74,124]),
[iquote('hyper,142,10,76,74,124')] ).
cnf(162,plain,
aNormalFormOfIn0(dollar_f13(dollar_f12(dollar_c1,xR,dollar_c1)),dollar_f12(dollar_c1,xR,dollar_c1),xR),
inference(hyper,[status(thm)],[154,39,124]),
[iquote('hyper,154,39,124')] ).
cnf(299,plain,
sdtmndtasgtdt0(dollar_f12(dollar_c1,xR,dollar_c1),xR,dollar_f13(dollar_f12(dollar_c1,xR,dollar_c1))),
inference(hyper,[status(thm)],[162,36,124,74]),
[iquote('hyper,162,36,124,74')] ).
cnf(300,plain,
aElement0(dollar_f13(dollar_f12(dollar_c1,xR,dollar_c1))),
inference(hyper,[status(thm)],[162,35,124,74]),
[iquote('hyper,162,35,124,74')] ).
cnf(369,plain,
sdtmndtasgtdt0(dollar_c1,xR,dollar_f13(dollar_f12(dollar_c1,xR,dollar_c1))),
inference(hyper,[status(thm)],[299,11,76,74,124,300,155]),
[iquote('hyper,299,11,76,74,124,300,155')] ).
cnf(422,plain,
aReductOfIn0(dollar_f12(dollar_c1,xR,dollar_f13(dollar_f12(dollar_c1,xR,dollar_c1))),dollar_f13(dollar_f12(dollar_c1,xR,dollar_c1)),xR),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[369,38,76,74,300]),40]),
[iquote('hyper,369,38,76,74,300,unit_del,40')] ).
cnf(2857,plain,
$false,
inference(hyper,[status(thm)],[422,37,124,74,162]),
[iquote('hyper,422,37,124,74,162')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : COM013+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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 06:41:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.98/2.19 ----- Otter 3.3f, August 2004 -----
% 1.98/2.19 The process was started by sandbox on n025.cluster.edu,
% 1.98/2.19 Wed Jul 27 06:41:45 2022
% 1.98/2.19 The command was "./otter". The process ID is 1551.
% 1.98/2.19
% 1.98/2.19 set(prolog_style_variables).
% 1.98/2.19 set(auto).
% 1.98/2.19 dependent: set(auto1).
% 1.98/2.19 dependent: set(process_input).
% 1.98/2.19 dependent: clear(print_kept).
% 1.98/2.19 dependent: clear(print_new_demod).
% 1.98/2.19 dependent: clear(print_back_demod).
% 1.98/2.19 dependent: clear(print_back_sub).
% 1.98/2.19 dependent: set(control_memory).
% 1.98/2.19 dependent: assign(max_mem, 12000).
% 1.98/2.19 dependent: assign(pick_given_ratio, 4).
% 1.98/2.19 dependent: assign(stats_level, 1).
% 1.98/2.19 dependent: assign(max_seconds, 10800).
% 1.98/2.19 clear(print_given).
% 1.98/2.19
% 1.98/2.19 formula_list(usable).
% 1.98/2.19 all A (A=A).
% 1.98/2.19 all W0 (aElement0(W0)->$T).
% 1.98/2.19 all W0 (aRewritingSystem0(W0)->$T).
% 1.98/2.19 all W0 W1 (aElement0(W0)&aRewritingSystem0(W1)-> (all W2 (aReductOfIn0(W2,W0,W1)->aElement0(W2)))).
% 1.98/2.19 all W0 W1 (aElement0(W0)&aElement0(W1)-> (iLess0(W0,W1)->$T)).
% 1.98/2.19 all W0 W1 W2 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)-> (sdtmndtplgtdt0(W0,W1,W2)->$T)).
% 1.98/2.19 all W0 W1 W2 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)-> (sdtmndtplgtdt0(W0,W1,W2)<->aReductOfIn0(W2,W0,W1)| (exists W3 (aElement0(W3)&aReductOfIn0(W3,W0,W1)&sdtmndtplgtdt0(W3,W1,W2))))).
% 1.98/2.19 all W0 W1 W2 W3 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)&aElement0(W3)-> (sdtmndtplgtdt0(W0,W1,W2)&sdtmndtplgtdt0(W2,W1,W3)->sdtmndtplgtdt0(W0,W1,W3))).
% 1.98/2.19 all W0 W1 W2 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)-> (sdtmndtasgtdt0(W0,W1,W2)<->W0=W2|sdtmndtplgtdt0(W0,W1,W2))).
% 1.98/2.19 all W0 W1 W2 W3 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)&aElement0(W3)-> (sdtmndtasgtdt0(W0,W1,W2)&sdtmndtasgtdt0(W2,W1,W3)->sdtmndtasgtdt0(W0,W1,W3))).
% 1.98/2.19 all W0 (aRewritingSystem0(W0)-> (isConfluent0(W0)<-> (all W1 W2 W3 (aElement0(W1)&aElement0(W2)&aElement0(W3)&sdtmndtasgtdt0(W1,W0,W2)&sdtmndtasgtdt0(W1,W0,W3)-> (exists W4 (aElement0(W4)&sdtmndtasgtdt0(W2,W0,W4)&sdtmndtasgtdt0(W3,W0,W4))))))).
% 1.98/2.19 all W0 (aRewritingSystem0(W0)-> (isLocallyConfluent0(W0)<-> (all W1 W2 W3 (aElement0(W1)&aElement0(W2)&aElement0(W3)&aReductOfIn0(W2,W1,W0)&aReductOfIn0(W3,W1,W0)-> (exists W4 (aElement0(W4)&sdtmndtasgtdt0(W2,W0,W4)&sdtmndtasgtdt0(W3,W0,W4))))))).
% 1.98/2.19 all W0 (aRewritingSystem0(W0)-> (isTerminating0(W0)<-> (all W1 W2 (aElement0(W1)&aElement0(W2)-> (sdtmndtplgtdt0(W1,W0,W2)->iLess0(W2,W1)))))).
% 1.98/2.19 all W0 W1 (aElement0(W0)&aRewritingSystem0(W1)-> (all W2 (aNormalFormOfIn0(W2,W0,W1)<->aElement0(W2)&sdtmndtasgtdt0(W0,W1,W2)& -(exists W3 aReductOfIn0(W3,W2,W1))))).
% 1.98/2.19 aRewritingSystem0(xR).
% 1.98/2.19 isTerminating0(xR).
% 1.98/2.19 -(all W0 (aElement0(W0)-> ((all W1 (aElement0(W1)-> (iLess0(W1,W0)-> (exists W2 aNormalFormOfIn0(W2,W1,xR)))))-> (exists W1 aNormalFormOfIn0(W1,W0,xR))))).
% 1.98/2.19 end_of_list.
% 1.98/2.19
% 1.98/2.19 -------> usable clausifies to:
% 1.98/2.19
% 1.98/2.19 list(usable).
% 1.98/2.19 0 [] A=A.
% 1.98/2.19 0 [] -aElement0(W0)|$T.
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|$T.
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aReductOfIn0(W2,W0,W1)|aElement0(W2).
% 1.98/2.19 0 [] -aElement0(W0)| -aElement0(W1)| -iLess0(W0,W1)|$T.
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W0,W1,W2)|$T.
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W0,W1,W2)|aReductOfIn0(W2,W0,W1)|aElement0($f1(W0,W1,W2)).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W0,W1,W2)|aReductOfIn0(W2,W0,W1)|aReductOfIn0($f1(W0,W1,W2),W0,W1).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W0,W1,W2)|aReductOfIn0(W2,W0,W1)|sdtmndtplgtdt0($f1(W0,W1,W2),W1,W2).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)|sdtmndtplgtdt0(W0,W1,W2)| -aReductOfIn0(W2,W0,W1).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)|sdtmndtplgtdt0(W0,W1,W2)| -aElement0(W3)| -aReductOfIn0(W3,W0,W1)| -sdtmndtplgtdt0(W3,W1,W2).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -aElement0(W3)| -sdtmndtplgtdt0(W0,W1,W2)| -sdtmndtplgtdt0(W2,W1,W3)|sdtmndtplgtdt0(W0,W1,W3).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtasgtdt0(W0,W1,W2)|W0=W2|sdtmndtplgtdt0(W0,W1,W2).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)|sdtmndtasgtdt0(W0,W1,W2)|W0!=W2.
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)|sdtmndtasgtdt0(W0,W1,W2)| -sdtmndtplgtdt0(W0,W1,W2).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -aElement0(W3)| -sdtmndtasgtdt0(W0,W1,W2)| -sdtmndtasgtdt0(W2,W1,W3)|sdtmndtasgtdt0(W0,W1,W3).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)| -isConfluent0(W0)| -aElement0(W1)| -aElement0(W2)| -aElement0(W3)| -sdtmndtasgtdt0(W1,W0,W2)| -sdtmndtasgtdt0(W1,W0,W3)|aElement0($f2(W0,W1,W2,W3)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)| -isConfluent0(W0)| -aElement0(W1)| -aElement0(W2)| -aElement0(W3)| -sdtmndtasgtdt0(W1,W0,W2)| -sdtmndtasgtdt0(W1,W0,W3)|sdtmndtasgtdt0(W2,W0,$f2(W0,W1,W2,W3)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)| -isConfluent0(W0)| -aElement0(W1)| -aElement0(W2)| -aElement0(W3)| -sdtmndtasgtdt0(W1,W0,W2)| -sdtmndtasgtdt0(W1,W0,W3)|sdtmndtasgtdt0(W3,W0,$f2(W0,W1,W2,W3)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isConfluent0(W0)|aElement0($f5(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isConfluent0(W0)|aElement0($f4(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isConfluent0(W0)|aElement0($f3(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isConfluent0(W0)|sdtmndtasgtdt0($f5(W0),W0,$f4(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isConfluent0(W0)|sdtmndtasgtdt0($f5(W0),W0,$f3(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isConfluent0(W0)| -aElement0(W4)| -sdtmndtasgtdt0($f4(W0),W0,W4)| -sdtmndtasgtdt0($f3(W0),W0,W4).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)| -isLocallyConfluent0(W0)| -aElement0(W1)| -aElement0(W2)| -aElement0(W3)| -aReductOfIn0(W2,W1,W0)| -aReductOfIn0(W3,W1,W0)|aElement0($f6(W0,W1,W2,W3)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)| -isLocallyConfluent0(W0)| -aElement0(W1)| -aElement0(W2)| -aElement0(W3)| -aReductOfIn0(W2,W1,W0)| -aReductOfIn0(W3,W1,W0)|sdtmndtasgtdt0(W2,W0,$f6(W0,W1,W2,W3)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)| -isLocallyConfluent0(W0)| -aElement0(W1)| -aElement0(W2)| -aElement0(W3)| -aReductOfIn0(W2,W1,W0)| -aReductOfIn0(W3,W1,W0)|sdtmndtasgtdt0(W3,W0,$f6(W0,W1,W2,W3)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isLocallyConfluent0(W0)|aElement0($f9(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isLocallyConfluent0(W0)|aElement0($f8(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isLocallyConfluent0(W0)|aElement0($f7(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isLocallyConfluent0(W0)|aReductOfIn0($f8(W0),$f9(W0),W0).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isLocallyConfluent0(W0)|aReductOfIn0($f7(W0),$f9(W0),W0).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isLocallyConfluent0(W0)| -aElement0(W4)| -sdtmndtasgtdt0($f8(W0),W0,W4)| -sdtmndtasgtdt0($f7(W0),W0,W4).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)| -isTerminating0(W0)| -aElement0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W1,W0,W2)|iLess0(W2,W1).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isTerminating0(W0)|aElement0($f11(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isTerminating0(W0)|aElement0($f10(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isTerminating0(W0)|sdtmndtplgtdt0($f11(W0),W0,$f10(W0)).
% 1.98/2.19 0 [] -aRewritingSystem0(W0)|isTerminating0(W0)| -iLess0($f10(W0),$f11(W0)).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aNormalFormOfIn0(W2,W0,W1)|aElement0(W2).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aNormalFormOfIn0(W2,W0,W1)|sdtmndtasgtdt0(W0,W1,W2).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aNormalFormOfIn0(W2,W0,W1)| -aReductOfIn0(W3,W2,W1).
% 1.98/2.19 0 [] -aElement0(W0)| -aRewritingSystem0(W1)|aNormalFormOfIn0(W2,W0,W1)| -aElement0(W2)| -sdtmndtasgtdt0(W0,W1,W2)|aReductOfIn0($f12(W0,W1,W2),W2,W1).
% 1.98/2.19 0 [] aRewritingSystem0(xR).
% 1.98/2.19 0 [] isTerminating0(xR).
% 1.98/2.19 0 [] aElement0($c1).
% 1.98/2.19 0 [] -aElement0(W1)| -iLess0(W1,$c1)|aNormalFormOfIn0($f13(W1),W1,xR).
% 1.98/2.19 0 [] -aNormalFormOfIn0(X1,$c1,xR).
% 1.98/2.19 end_of_list.
% 1.98/2.19
% 1.98/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.98/2.19
% 1.98/2.19 This ia a non-Horn set with equality. The strategy will be
% 1.98/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.98/2.19 deletion, with positive clauses in sos and nonpositive
% 1.98/2.19 clauses in usable.
% 1.98/2.19
% 1.98/2.19 dependent: set(knuth_bendix).
% 1.98/2.19 dependent: set(anl_eq).
% 1.98/2.19 dependent: set(para_from).
% 1.98/2.19 dependent: set(para_into).
% 1.98/2.19 dependent: clear(para_from_right).
% 1.98/2.19 dependent: clear(para_into_right).
% 1.98/2.19 dependent: set(para_from_vars).
% 1.98/2.19 dependent: set(eq_units_both_ways).
% 1.98/2.19 dependent: set(dynamic_demod_all).
% 1.98/2.19 dependent: set(dynamic_demod).
% 1.98/2.19 dependent: set(order_eq).
% 1.98/2.19 dependent: set(back_demod).
% 1.98/2.19 dependent: set(lrpo).
% 1.98/2.19 dependent: set(hyper_res).
% 1.98/2.19 dependent: set(unit_deletion).
% 1.98/2.19 dependent: set(factor).
% 1.98/2.19
% 1.98/2.19 ------------> process usable:
% 1.98/2.19 ** KEPT (pick-wt=10): 1 [] -aElement0(A)| -aRewritingSystem0(B)| -aReductOfIn0(C,A,B)|aElement0(C).
% 1.98/2.19 ** KEPT (pick-wt=19): 2 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|aElement0($f1(A,B,C)).
% 1.98/2.19 ** KEPT (pick-wt=21): 3 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|aReductOfIn0($f1(A,B,C),A,B).
% 1.98/2.19 ** KEPT (pick-wt=21): 4 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|sdtmndtplgtdt0($f1(A,B,C),B,C).
% 1.98/2.19 ** KEPT (pick-wt=14): 5 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtplgtdt0(A,B,C)| -aReductOfIn0(C,A,B).
% 1.98/2.19 ** KEPT (pick-wt=20): 6 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtplgtdt0(A,B,C)| -aElement0(D)| -aReductOfIn0(D,A,B)| -sdtmndtplgtdt0(D,B,C).
% 1.98/2.19 ** KEPT (pick-wt=20): 7 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtplgtdt0(A,B,C)| -sdtmndtplgtdt0(C,B,D)|sdtmndtplgtdt0(A,B,D).
% 1.98/2.19 ** KEPT (pick-wt=17): 8 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtasgtdt0(A,B,C)|A=C|sdtmndtplgtdt0(A,B,C).
% 1.98/2.19 ** KEPT (pick-wt=13): 9 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)|A!=C.
% 1.98/2.19 ** KEPT (pick-wt=14): 10 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)| -sdtmndtplgtdt0(A,B,C).
% 1.98/2.19 ** KEPT (pick-wt=20): 11 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtasgtdt0(A,B,C)| -sdtmndtasgtdt0(C,B,D)|sdtmndtasgtdt0(A,B,D).
% 1.98/2.19 ** KEPT (pick-wt=24): 12 [] -aRewritingSystem0(A)| -isConfluent0(A)| -aElement0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtasgtdt0(B,A,C)| -sdtmndtasgtdt0(B,A,D)|aElement0($f2(A,B,C,D)).
% 1.98/2.19 ** KEPT (pick-wt=26): 13 [] -aRewritingSystem0(A)| -isConfluent0(A)| -aElement0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtasgtdt0(B,A,C)| -sdtmndtasgtdt0(B,A,D)|sdtmndtasgtdt0(C,A,$f2(A,B,C,D)).
% 1.98/2.19 ** KEPT (pick-wt=26): 14 [] -aRewritingSystem0(A)| -isConfluent0(A)| -aElement0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtasgtdt0(B,A,C)| -sdtmndtasgtdt0(B,A,D)|sdtmndtasgtdt0(D,A,$f2(A,B,C,D)).
% 1.98/2.19 ** KEPT (pick-wt=7): 15 [] -aRewritingSystem0(A)|isConfluent0(A)|aElement0($f5(A)).
% 1.98/2.19 ** KEPT (pick-wt=7): 16 [] -aRewritingSystem0(A)|isConfluent0(A)|aElement0($f4(A)).
% 1.98/2.19 ** KEPT (pick-wt=7): 17 [] -aRewritingSystem0(A)|isConfluent0(A)|aElement0($f3(A)).
% 1.98/2.19 ** KEPT (pick-wt=10): 18 [] -aRewritingSystem0(A)|isConfluent0(A)|sdtmndtasgtdt0($f5(A),A,$f4(A)).
% 1.98/2.19 ** KEPT (pick-wt=10): 19 [] -aRewritingSystem0(A)|isConfluent0(A)|sdtmndtasgtdt0($f5(A),A,$f3(A)).
% 1.98/2.19 ** KEPT (pick-wt=16): 20 [] -aRewritingSystem0(A)|isConfluent0(A)| -aElement0(B)| -sdtmndtasgtdt0($f4(A),A,B)| -sdtmndtasgtdt0($f3(A),A,B).
% 1.98/2.19 ** KEPT (pick-wt=24): 21 [] -aRewritingSystem0(A)| -isLocallyConfluent0(A)| -aElement0(B)| -aElement0(C)| -aElement0(D)| -aReductOfIn0(C,B,A)| -aReductOfIn0(D,B,A)|aElement0($f6(A,B,C,D)).
% 1.98/2.19 ** KEPT (pick-wt=26): 22 [] -aRewritingSystem0(A)| -isLocallyConfluent0(A)| -aElement0(B)| -aElement0(C)| -aElement0(D)| -aReductOfIn0(C,B,A)| -aReductOfIn0(D,B,A)|sdtmndtasgtdt0(C,A,$f6(A,B,C,D)).
% 1.98/2.19 ** KEPT (pick-wt=26): 23 [] -aRewritingSystem0(A)| -isLocallyConfluent0(A)| -aElement0(B)| -aElement0(C)| -aElement0(D)| -aReductOfIn0(C,B,A)| -aReductOfIn0(D,B,A)|sdtmndtasgtdt0(D,A,$f6(A,B,C,D)).
% 1.98/2.19 ** KEPT (pick-wt=7): 24 [] -aRewritingSystem0(A)|isLocallyConfluent0(A)|aElement0($f9(A)).
% 1.98/2.19 ** KEPT (pick-wt=7): 25 [] -aRewritingSystem0(A)|isLocallyConfluent0(A)|aElement0($f8(A)).
% 1.98/2.19 ** KEPT (pick-wt=7): 26 [] -aRewritingSystem0(A)|isLocallyConfluent0(A)|aElement0($f7(A)).
% 1.98/2.19 ** KEPT (pick-wt=10): 27 [] -aRewritingSystem0(A)|isLocallyConfluent0(A)|aReductOfIn0($f8(A),$f9(A),A).
% 1.98/2.19 ** KEPT (pick-wt=10): 28 [] -aRewritingSystem0(A)|isLocallyConfluent0(A)|aReductOfIn0($f7(A),$f9(A),A).
% 1.98/2.19 ** KEPT (pick-wt=16): 29 [] -aRewritingSystem0(A)|isLocallyConfluent0(A)| -aElement0(B)| -sdtmndtasgtdt0($f8(A),A,B)| -sdtmndtasgtdt0($f7(A),A,B).
% 1.98/2.19 ** KEPT (pick-wt=15): 30 [] -aRewritingSystem0(A)| -isTerminating0(A)| -aElement0(B)| -aElement0(C)| -sdtmndtplgtdt0(B,A,C)|iLess0(C,B).
% 141.41/141.62 ** KEPT (pick-wt=7): 31 [] -aRewritingSystem0(A)|isTerminating0(A)|aElement0($f11(A)).
% 141.41/141.62 ** KEPT (pick-wt=7): 32 [] -aRewritingSystem0(A)|isTerminating0(A)|aElement0($f10(A)).
% 141.41/141.62 ** KEPT (pick-wt=10): 33 [] -aRewritingSystem0(A)|isTerminating0(A)|sdtmndtplgtdt0($f11(A),A,$f10(A)).
% 141.41/141.62 ** KEPT (pick-wt=9): 34 [] -aRewritingSystem0(A)|isTerminating0(A)| -iLess0($f10(A),$f11(A)).
% 141.41/141.62 ** KEPT (pick-wt=10): 35 [] -aElement0(A)| -aRewritingSystem0(B)| -aNormalFormOfIn0(C,A,B)|aElement0(C).
% 141.41/141.62 ** KEPT (pick-wt=12): 36 [] -aElement0(A)| -aRewritingSystem0(B)| -aNormalFormOfIn0(C,A,B)|sdtmndtasgtdt0(A,B,C).
% 141.41/141.62 ** KEPT (pick-wt=12): 37 [] -aElement0(A)| -aRewritingSystem0(B)| -aNormalFormOfIn0(C,A,B)| -aReductOfIn0(D,C,B).
% 141.41/141.62 ** KEPT (pick-wt=21): 38 [] -aElement0(A)| -aRewritingSystem0(B)|aNormalFormOfIn0(C,A,B)| -aElement0(C)| -sdtmndtasgtdt0(A,B,C)|aReductOfIn0($f12(A,B,C),C,B).
% 141.41/141.62 ** KEPT (pick-wt=10): 39 [] -aElement0(A)| -iLess0(A,$c1)|aNormalFormOfIn0($f13(A),A,xR).
% 141.41/141.62 ** KEPT (pick-wt=4): 40 [] -aNormalFormOfIn0(A,$c1,xR).
% 141.41/141.62
% 141.41/141.62 ------------> process sos:
% 141.41/141.62 ** KEPT (pick-wt=3): 73 [] A=A.
% 141.41/141.62 ** KEPT (pick-wt=2): 74 [] aRewritingSystem0(xR).
% 141.41/141.62 ** KEPT (pick-wt=2): 75 [] isTerminating0(xR).
% 141.41/141.62 ** KEPT (pick-wt=2): 76 [] aElement0($c1).
% 141.41/141.62 Following clause subsumed by 73 during input processing: 0 [copy,73,flip.1] A=A.
% 141.41/141.62 73 back subsumes 47.
% 141.41/141.62
% 141.41/141.62 ======= end of input processing =======
% 141.41/141.62
% 141.41/141.62 =========== start of search ===========
% 141.41/141.62
% 141.41/141.62
% 141.41/141.62 Resetting weight limit to 17.
% 141.41/141.62
% 141.41/141.62
% 141.41/141.62 Resetting weight limit to 17.
% 141.41/141.62
% 141.41/141.62 sos_size=1430
% 141.41/141.62
% 141.41/141.62 -- HEY sandbox, WE HAVE A PROOF!! --
% 141.41/141.62
% 141.41/141.62 -----> EMPTY CLAUSE at 139.41 sec ----> 2857 [hyper,422,37,124,74,162] $F.
% 141.41/141.62
% 141.41/141.62 Length of proof is 13. Level of proof is 10.
% 141.41/141.62
% 141.41/141.62 ---------------- PROOF ----------------
% 141.41/141.62 % SZS status Theorem
% 141.41/141.62 % SZS output start Refutation
% See solution above
% 141.41/141.62 ------------ end of proof -------------
% 141.41/141.62
% 141.41/141.62
% 141.41/141.62 Search stopped by max_proofs option.
% 141.41/141.62
% 141.41/141.62
% 141.41/141.62 Search stopped by max_proofs option.
% 141.41/141.62
% 141.41/141.62 ============ end of search ============
% 141.41/141.62
% 141.41/141.62 -------------- statistics -------------
% 141.41/141.62 clauses given 105
% 141.41/141.62 clauses generated 419241
% 141.41/141.62 clauses kept 2856
% 141.41/141.62 clauses forward subsumed 179342
% 141.41/141.62 clauses back subsumed 1272
% 141.41/141.62 Kbytes malloced 4882
% 141.41/141.62
% 141.41/141.62 ----------- times (seconds) -----------
% 141.41/141.62 user CPU time 139.41 (0 hr, 2 min, 19 sec)
% 141.41/141.62 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 141.41/141.62 wall-clock time 141 (0 hr, 2 min, 21 sec)
% 141.41/141.62
% 141.41/141.62 That finishes the proof of the theorem.
% 141.41/141.62
% 141.41/141.62 Process 1551 finished Wed Jul 27 06:44:06 2022
% 141.41/141.62 Otter interrupted
% 141.41/141.62 PROOF FOUND
%------------------------------------------------------------------------------