TSTP Solution File: NUM427+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM427+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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:08:18 EDT 2022
% Result : Theorem 6.00s 6.21s
% Output : Refutation 6.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 39 ( 32 unt; 1 nHn; 38 RR)
% Number of literals : 56 ( 25 equ; 21 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ aInteger0(A)
| aInteger0(smndt0(A)) ),
file('NUM427+3.p',unknown),
[] ).
cnf(3,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| aInteger0(sdtasdt0(A,B)) ),
file('NUM427+3.p',unknown),
[] ).
cnf(13,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtasdt0(A,sdtasdt0(B,C)) = sdtasdt0(sdtasdt0(A,B),C) ),
file('NUM427+3.p',unknown),
[] ).
cnf(14,plain,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtasdt0(sdtasdt0(A,B),C) = sdtasdt0(A,sdtasdt0(B,C)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13])]),
[iquote('copy,13,flip.4')] ).
cnf(15,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| sdtasdt0(A,B) = sdtasdt0(B,A) ),
file('NUM427+3.p',unknown),
[] ).
cnf(27,axiom,
( ~ aInteger0(A)
| smndt0(A) = sdtasdt0(A,smndt0(sz10)) ),
file('NUM427+3.p',unknown),
[] ).
cnf(33,axiom,
( ~ aInteger0(A)
| aDivisorOf0(B,A)
| ~ aInteger0(B)
| B = sz00
| ~ aInteger0(C)
| sdtasdt0(B,C) != A ),
file('NUM427+3.p',unknown),
[] ).
cnf(37,axiom,
xq != sz00,
file('NUM427+3.p',unknown),
[] ).
cnf(39,axiom,
~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))),
file('NUM427+3.p',unknown),
[] ).
cnf(73,axiom,
A = A,
file('NUM427+3.p',unknown),
[] ).
cnf(75,axiom,
aInteger0(sz10),
file('NUM427+3.p',unknown),
[] ).
cnf(76,axiom,
aInteger0(xa),
file('NUM427+3.p',unknown),
[] ).
cnf(78,axiom,
aInteger0(xq),
file('NUM427+3.p',unknown),
[] ).
cnf(79,axiom,
aInteger0(dollar_c1),
file('NUM427+3.p',unknown),
[] ).
cnf(80,axiom,
sdtasdt0(xq,dollar_c1) = sdtpldt0(xa,smndt0(xb)),
file('NUM427+3.p',unknown),
[] ).
cnf(82,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,dollar_c1),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[80])]),
[iquote('copy,80,flip.1')] ).
cnf(86,axiom,
aInteger0(xn),
file('NUM427+3.p',unknown),
[] ).
cnf(87,axiom,
sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)),
file('NUM427+3.p',unknown),
[] ).
cnf(88,plain,
sdtasdt0(xq,xn) = sdtasdt0(xq,dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[87]),82]),
[iquote('copy,87,demod,82')] ).
cnf(90,axiom,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
file('NUM427+3.p',unknown),
[] ).
cnf(185,plain,
aInteger0(smndt0(sz10)),
inference(hyper,[status(thm)],[75,1]),
[iquote('hyper,75,1')] ).
cnf(303,plain,
smndt0(xa) = sdtasdt0(xa,smndt0(sz10)),
inference(hyper,[status(thm)],[76,27]),
[iquote('hyper,76,27')] ).
cnf(386,plain,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,sdtasdt0(xa,smndt0(sz10))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[90]),303]),
[iquote('back_demod,90,demod,303')] ).
cnf(388,plain,
~ aDivisorOf0(xq,sdtpldt0(xb,sdtasdt0(xa,smndt0(sz10)))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[39]),303]),
[iquote('back_demod,39,demod,303')] ).
cnf(1808,plain,
sdtasdt0(dollar_c1,smndt0(sz10)) = smndt0(dollar_c1),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[79,27])]),
[iquote('hyper,79,27,flip.1')] ).
cnf(2076,plain,
sdtasdt0(xq,dollar_c1) = sdtasdt0(dollar_c1,xq),
inference(hyper,[status(thm)],[79,15,78]),
[iquote('hyper,79,15,78')] ).
cnf(2268,plain,
aInteger0(smndt0(dollar_c1)),
inference(hyper,[status(thm)],[79,1]),
[iquote('hyper,79,1')] ).
cnf(2366,plain,
sdtasdt0(xq,xn) = sdtasdt0(dollar_c1,xq),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[88]),2076]),
[iquote('back_demod,88,demod,2076')] ).
cnf(2873,plain,
smndt0(xn) = sdtasdt0(xn,smndt0(sz10)),
inference(hyper,[status(thm)],[86,27]),
[iquote('hyper,86,27')] ).
cnf(3259,plain,
sdtasdt0(xn,xq) = sdtasdt0(dollar_c1,xq),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[86,15,78]),2366])]),
[iquote('hyper,86,15,78,demod,2366,flip.1')] ).
cnf(3544,plain,
sdtpldt0(xb,sdtasdt0(xa,smndt0(sz10))) = sdtasdt0(xq,sdtasdt0(xn,smndt0(sz10))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[386]),2873])]),
[iquote('back_demod,386,demod,2873,flip.1')] ).
cnf(3817,plain,
~ aDivisorOf0(xq,sdtasdt0(xq,sdtasdt0(xn,smndt0(sz10)))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[388]),3544]),
[iquote('back_demod,388,demod,3544')] ).
cnf(5437,plain,
sdtasdt0(sdtasdt0(dollar_c1,xq),smndt0(sz10)) = sdtasdt0(xn,sdtasdt0(xq,smndt0(sz10))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[185,14,86,78]),3259]),
[iquote('hyper,185,14,86,78,demod,3259')] ).
cnf(5445,plain,
sdtasdt0(xn,sdtasdt0(xq,smndt0(sz10))) = sdtasdt0(dollar_c1,sdtasdt0(xq,smndt0(sz10))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[185,14,79,78]),5437]),
[iquote('hyper,185,14,79,78,demod,5437')] ).
cnf(5451,plain,
sdtasdt0(xq,sdtasdt0(xn,smndt0(sz10))) = sdtasdt0(dollar_c1,sdtasdt0(xq,smndt0(sz10))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[185,14,78,86]),2366,5437,5445])]),
[iquote('hyper,185,14,78,86,demod,2366,5437,5445,flip.1')] ).
cnf(5453,plain,
sdtasdt0(dollar_c1,sdtasdt0(xq,smndt0(sz10))) = sdtasdt0(xq,smndt0(dollar_c1)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[185,14,78,79]),2076,5437,5445,1808]),
[iquote('hyper,185,14,78,79,demod,2076,5437,5445,1808')] ).
cnf(5909,plain,
~ aDivisorOf0(xq,sdtasdt0(xq,smndt0(dollar_c1))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3817]),5451,5453]),
[iquote('back_demod,3817,demod,5451,5453')] ).
cnf(7315,plain,
aInteger0(sdtasdt0(xq,smndt0(dollar_c1))),
inference(hyper,[status(thm)],[2268,3,78]),
[iquote('hyper,2268,3,78')] ).
cnf(8167,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[7315,33,78,2268,73]),5909,37]),
[iquote('hyper,7315,33,78,2268,73,unit_del,5909,37')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM427+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n014.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 09:55:39 EDT 2022
% 0.18/0.33 % CPUTime :
% 1.84/2.06 ----- Otter 3.3f, August 2004 -----
% 1.84/2.06 The process was started by sandbox2 on n014.cluster.edu,
% 1.84/2.06 Wed Jul 27 09:55:39 2022
% 1.84/2.06 The command was "./otter". The process ID is 31516.
% 1.84/2.06
% 1.84/2.06 set(prolog_style_variables).
% 1.84/2.06 set(auto).
% 1.84/2.06 dependent: set(auto1).
% 1.84/2.06 dependent: set(process_input).
% 1.84/2.06 dependent: clear(print_kept).
% 1.84/2.06 dependent: clear(print_new_demod).
% 1.84/2.06 dependent: clear(print_back_demod).
% 1.84/2.06 dependent: clear(print_back_sub).
% 1.84/2.06 dependent: set(control_memory).
% 1.84/2.06 dependent: assign(max_mem, 12000).
% 1.84/2.06 dependent: assign(pick_given_ratio, 4).
% 1.84/2.06 dependent: assign(stats_level, 1).
% 1.84/2.06 dependent: assign(max_seconds, 10800).
% 1.84/2.06 clear(print_given).
% 1.84/2.06
% 1.84/2.06 formula_list(usable).
% 1.84/2.06 all A (A=A).
% 1.84/2.06 all W0 (aInteger0(W0)->$T).
% 1.84/2.06 aInteger0(sz00).
% 1.84/2.06 aInteger0(sz10).
% 1.84/2.06 all W0 (aInteger0(W0)->aInteger0(smndt0(W0))).
% 1.84/2.06 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtpldt0(W0,W1))).
% 1.84/2.06 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtasdt0(W0,W1))).
% 1.84/2.06 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2)).
% 1.84/2.06 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtpldt0(W0,W1)=sdtpldt0(W1,W0)).
% 1.84/2.06 all W0 (aInteger0(W0)->sdtpldt0(W0,sz00)=W0&W0=sdtpldt0(sz00,W0)).
% 1.84/2.06 all W0 (aInteger0(W0)->sdtpldt0(W0,smndt0(W0))=sz00&sz00=sdtpldt0(smndt0(W0),W0)).
% 1.84/2.06 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2)).
% 1.84/2.06 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtasdt0(W0,W1)=sdtasdt0(W1,W0)).
% 1.84/2.06 all W0 (aInteger0(W0)->sdtasdt0(W0,sz10)=W0&W0=sdtasdt0(sz10,W0)).
% 1.84/2.06 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtasdt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2))&sdtasdt0(sdtpldt0(W0,W1),W2)=sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2))).
% 1.84/2.06 all W0 (aInteger0(W0)->sdtasdt0(W0,sz00)=sz00&sz00=sdtasdt0(sz00,W0)).
% 1.84/2.06 all W0 (aInteger0(W0)->sdtasdt0(smndt0(sz10),W0)=smndt0(W0)&smndt0(W0)=sdtasdt0(W0,smndt0(sz10))).
% 1.84/2.06 all W0 W1 (aInteger0(W0)&aInteger0(W1)-> (sdtasdt0(W0,W1)=sz00->W0=sz00|W1=sz00)).
% 1.84/2.06 all W0 (aInteger0(W0)-> (all W1 (aDivisorOf0(W1,W0)<->aInteger0(W1)&W1!=sz00& (exists W2 (aInteger0(W2)&sdtasdt0(W1,W2)=W0))))).
% 1.84/2.06 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)&W2!=sz00-> (sdte_qdtlpzmzozddtrp0(W0,W1,W2)<->aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))))).
% 1.84/2.06 all W0 W1 (aInteger0(W0)&aInteger0(W1)&W1!=sz00->sdte_qdtlpzmzozddtrp0(W0,W0,W1)).
% 1.84/2.06 aInteger0(xa).
% 1.84/2.06 aInteger0(xb).
% 1.84/2.06 aInteger0(xq).
% 1.84/2.06 xq!=sz00.
% 1.84/2.06 exists W0 (aInteger0(W0)&sdtasdt0(xq,W0)=sdtpldt0(xa,smndt0(xb))).
% 1.84/2.06 aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))).
% 1.84/2.06 sdte_qdtlpzmzozddtrp0(xa,xb,xq).
% 1.84/2.06 aInteger0(xn).
% 1.84/2.06 sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb)).
% 1.84/2.06 sdtasdt0(xq,smndt0(xn))=sdtpldt0(xb,smndt0(xa)).
% 1.84/2.06 -((exists W0 (aInteger0(W0)&sdtasdt0(xq,W0)=sdtpldt0(xb,smndt0(xa))))|aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))|sdte_qdtlpzmzozddtrp0(xb,xa,xq)).
% 1.84/2.06 end_of_list.
% 1.84/2.06
% 1.84/2.06 -------> usable clausifies to:
% 1.84/2.06
% 1.84/2.06 list(usable).
% 1.84/2.06 0 [] A=A.
% 1.84/2.06 0 [] -aInteger0(W0)|$T.
% 1.84/2.06 0 [] aInteger0(sz00).
% 1.84/2.06 0 [] aInteger0(sz10).
% 1.84/2.06 0 [] -aInteger0(W0)|aInteger0(smndt0(W0)).
% 1.84/2.06 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtpldt0(W0,W1)).
% 1.84/2.06 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtasdt0(W0,W1)).
% 1.84/2.06 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2).
% 1.84/2.06 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtpldt0(W0,W1)=sdtpldt0(W1,W0).
% 1.84/2.06 0 [] -aInteger0(W0)|sdtpldt0(W0,sz00)=W0.
% 1.84/2.06 0 [] -aInteger0(W0)|W0=sdtpldt0(sz00,W0).
% 1.84/2.06 0 [] -aInteger0(W0)|sdtpldt0(W0,smndt0(W0))=sz00.
% 1.84/2.06 0 [] -aInteger0(W0)|sz00=sdtpldt0(smndt0(W0),W0).
% 1.84/2.06 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2).
% 1.84/2.06 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)=sdtasdt0(W1,W0).
% 1.84/2.06 0 [] -aInteger0(W0)|sdtasdt0(W0,sz10)=W0.
% 1.84/2.06 0 [] -aInteger0(W0)|W0=sdtasdt0(sz10,W0).
% 1.84/2.06 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)).
% 1.84/2.06 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(sdtpldt0(W0,W1),W2)=sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)).
% 1.84/2.06 0 [] -aInteger0(W0)|sdtasdt0(W0,sz00)=sz00.
% 1.84/2.06 0 [] -aInteger0(W0)|sz00=sdtasdt0(sz00,W0).
% 1.84/2.06 0 [] -aInteger0(W0)|sdtasdt0(smndt0(sz10),W0)=smndt0(W0).
% 1.84/2.07 0 [] -aInteger0(W0)|smndt0(W0)=sdtasdt0(W0,smndt0(sz10)).
% 1.84/2.07 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)!=sz00|W0=sz00|W1=sz00.
% 1.84/2.07 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|aInteger0(W1).
% 1.84/2.07 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|W1!=sz00.
% 1.84/2.07 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|aInteger0($f1(W0,W1)).
% 1.84/2.07 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|sdtasdt0(W1,$f1(W0,W1))=W0.
% 1.84/2.07 0 [] -aInteger0(W0)|aDivisorOf0(W1,W0)| -aInteger0(W1)|W1=sz00| -aInteger0(W2)|sdtasdt0(W1,W2)!=W0.
% 1.84/2.07 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00| -sdte_qdtlpzmzozddtrp0(W0,W1,W2)|aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))).
% 1.84/2.07 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00|sdte_qdtlpzmzozddtrp0(W0,W1,W2)| -aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))).
% 1.84/2.07 0 [] -aInteger0(W0)| -aInteger0(W1)|W1=sz00|sdte_qdtlpzmzozddtrp0(W0,W0,W1).
% 1.84/2.07 0 [] aInteger0(xa).
% 1.84/2.07 0 [] aInteger0(xb).
% 1.84/2.07 0 [] aInteger0(xq).
% 1.84/2.07 0 [] xq!=sz00.
% 1.84/2.07 0 [] aInteger0($c1).
% 1.84/2.07 0 [] sdtasdt0(xq,$c1)=sdtpldt0(xa,smndt0(xb)).
% 1.84/2.07 0 [] aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))).
% 1.84/2.07 0 [] sdte_qdtlpzmzozddtrp0(xa,xb,xq).
% 1.84/2.07 0 [] aInteger0(xn).
% 1.84/2.07 0 [] sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb)).
% 1.84/2.07 0 [] sdtasdt0(xq,smndt0(xn))=sdtpldt0(xb,smndt0(xa)).
% 1.84/2.07 0 [] -aInteger0(W0)|sdtasdt0(xq,W0)!=sdtpldt0(xb,smndt0(xa)).
% 1.84/2.07 0 [] -aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))).
% 1.84/2.07 0 [] -sdte_qdtlpzmzozddtrp0(xb,xa,xq).
% 1.84/2.07 end_of_list.
% 1.84/2.07
% 1.84/2.07 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.84/2.07
% 1.84/2.07 This ia a non-Horn set with equality. The strategy will be
% 1.84/2.07 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.84/2.07 deletion, with positive clauses in sos and nonpositive
% 1.84/2.07 clauses in usable.
% 1.84/2.07
% 1.84/2.07 dependent: set(knuth_bendix).
% 1.84/2.07 dependent: set(anl_eq).
% 1.84/2.07 dependent: set(para_from).
% 1.84/2.07 dependent: set(para_into).
% 1.84/2.07 dependent: clear(para_from_right).
% 1.84/2.07 dependent: clear(para_into_right).
% 1.84/2.07 dependent: set(para_from_vars).
% 1.84/2.07 dependent: set(eq_units_both_ways).
% 1.84/2.07 dependent: set(dynamic_demod_all).
% 1.84/2.07 dependent: set(dynamic_demod).
% 1.84/2.07 dependent: set(order_eq).
% 1.84/2.07 dependent: set(back_demod).
% 1.84/2.07 dependent: set(lrpo).
% 1.84/2.07 dependent: set(hyper_res).
% 1.84/2.07 dependent: set(unit_deletion).
% 1.84/2.07 dependent: set(factor).
% 1.84/2.07
% 1.84/2.07 ------------> process usable:
% 1.84/2.07 ** KEPT (pick-wt=5): 1 [] -aInteger0(A)|aInteger0(smndt0(A)).
% 1.84/2.07 ** KEPT (pick-wt=8): 2 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtpldt0(A,B)).
% 1.84/2.07 ** KEPT (pick-wt=8): 3 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtasdt0(A,B)).
% 1.84/2.07 ** KEPT (pick-wt=17): 5 [copy,4,flip.4] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|sdtpldt0(sdtpldt0(A,B),C)=sdtpldt0(A,sdtpldt0(B,C)).
% 1.84/2.07 ** KEPT (pick-wt=11): 6 [] -aInteger0(A)| -aInteger0(B)|sdtpldt0(A,B)=sdtpldt0(B,A).
% 1.84/2.07 ** KEPT (pick-wt=7): 7 [] -aInteger0(A)|sdtpldt0(A,sz00)=A.
% 1.84/2.07 ** KEPT (pick-wt=7): 9 [copy,8,flip.2] -aInteger0(A)|sdtpldt0(sz00,A)=A.
% 1.84/2.07 ** KEPT (pick-wt=8): 10 [] -aInteger0(A)|sdtpldt0(A,smndt0(A))=sz00.
% 1.84/2.07 ** KEPT (pick-wt=8): 12 [copy,11,flip.2] -aInteger0(A)|sdtpldt0(smndt0(A),A)=sz00.
% 1.84/2.07 ** KEPT (pick-wt=17): 14 [copy,13,flip.4] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|sdtasdt0(sdtasdt0(A,B),C)=sdtasdt0(A,sdtasdt0(B,C)).
% 1.84/2.07 ** KEPT (pick-wt=11): 15 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)=sdtasdt0(B,A).
% 1.84/2.07 ** KEPT (pick-wt=7): 16 [] -aInteger0(A)|sdtasdt0(A,sz10)=A.
% 1.84/2.07 ** KEPT (pick-wt=7): 18 [copy,17,flip.2] -aInteger0(A)|sdtasdt0(sz10,A)=A.
% 1.84/2.07 ** KEPT (pick-wt=19): 20 [copy,19,flip.4] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C))=sdtasdt0(A,sdtpldt0(B,C)).
% 1.84/2.07 ** KEPT (pick-wt=19): 22 [copy,21,flip.4] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|sdtpldt0(sdtasdt0(A,C),sdtasdt0(B,C))=sdtasdt0(sdtpldt0(A,B),C).
% 1.84/2.07 ** KEPT (pick-wt=7): 23 [] -aInteger0(A)|sdtasdt0(A,sz00)=sz00.
% 1.84/2.07 ** KEPT (pick-wt=7): 25 [copy,24,flip.2] -aInteger0(A)|sdtasdt0(sz00,A)=sz00.
% 1.84/2.07 ** KEPT (pick-wt=9): 26 [] -aInteger0(A)|sdtasdt0(smndt0(sz10),A)=smndt0(A).
% 1.84/2.07 ** KEPT (pick-wt=9): 27 [] -aInteger0(A)|smndt0(A)=sdtasdt0(A,smndt0(sz10)).
% 1.84/2.07 ** KEPT (pick-wt=15): 28 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)!=sz00|A=sz00|B=sz00.
% 1.84/2.07 ** KEPT (pick-wt=7): 29 [] -aInteger0(A)| -aDivisorOf0(B,A)|aInteger0(B).
% 1.84/2.07 ** KEPT (pick-wt=8): 30 [] -aInteger0(A)| -aDivisorOf0(B,A)|B!=sz00.
% 1.84/2.07 ** KEPT (pick-wt=9): 31 [] -aInteger0(A)| -aDivisorOf0(B,A)|aInteger0($f1(A,B)).
% 6.00/6.21 ** KEPT (pick-wt=12): 32 [] -aInteger0(A)| -aDivisorOf0(B,A)|sdtasdt0(B,$f1(A,B))=A.
% 6.00/6.21 ** KEPT (pick-wt=17): 33 [] -aInteger0(A)|aDivisorOf0(B,A)| -aInteger0(B)|B=sz00| -aInteger0(C)|sdtasdt0(B,C)!=A.
% 6.00/6.21 ** KEPT (pick-wt=19): 34 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00| -sdte_qdtlpzmzozddtrp0(A,B,C)|aDivisorOf0(C,sdtpldt0(A,smndt0(B))).
% 6.00/6.21 ** KEPT (pick-wt=19): 35 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00|sdte_qdtlpzmzozddtrp0(A,B,C)| -aDivisorOf0(C,sdtpldt0(A,smndt0(B))).
% 6.00/6.21 ** KEPT (pick-wt=11): 36 [] -aInteger0(A)| -aInteger0(B)|B=sz00|sdte_qdtlpzmzozddtrp0(A,A,B).
% 6.00/6.21 ** KEPT (pick-wt=3): 37 [] xq!=sz00.
% 6.00/6.21 ** KEPT (pick-wt=10): 38 [] -aInteger0(A)|sdtasdt0(xq,A)!=sdtpldt0(xb,smndt0(xa)).
% 6.00/6.21 ** KEPT (pick-wt=6): 39 [] -aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))).
% 6.00/6.21 ** KEPT (pick-wt=4): 40 [] -sdte_qdtlpzmzozddtrp0(xb,xa,xq).
% 6.00/6.21
% 6.00/6.21 ------------> process sos:
% 6.00/6.21 ** KEPT (pick-wt=3): 73 [] A=A.
% 6.00/6.21 ** KEPT (pick-wt=2): 74 [] aInteger0(sz00).
% 6.00/6.21 ** KEPT (pick-wt=2): 75 [] aInteger0(sz10).
% 6.00/6.21 ** KEPT (pick-wt=2): 76 [] aInteger0(xa).
% 6.00/6.21 ** KEPT (pick-wt=2): 77 [] aInteger0(xb).
% 6.00/6.21 ** KEPT (pick-wt=2): 78 [] aInteger0(xq).
% 6.00/6.21 ** KEPT (pick-wt=2): 79 [] aInteger0($c1).
% 6.00/6.21 ** KEPT (pick-wt=8): 81 [copy,80,flip.1] sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,$c1).
% 6.00/6.21 ---> New Demodulator: 82 [new_demod,81] sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,$c1).
% 6.00/6.21 ** KEPT (pick-wt=5): 84 [copy,83,demod,82] aDivisorOf0(xq,sdtasdt0(xq,$c1)).
% 6.00/6.21 ** KEPT (pick-wt=4): 85 [] sdte_qdtlpzmzozddtrp0(xa,xb,xq).
% 6.00/6.21 ** KEPT (pick-wt=2): 86 [] aInteger0(xn).
% 6.00/6.21 ** KEPT (pick-wt=7): 88 [copy,87,demod,82] sdtasdt0(xq,xn)=sdtasdt0(xq,$c1).
% 6.00/6.21 ---> New Demodulator: 89 [new_demod,88] sdtasdt0(xq,xn)=sdtasdt0(xq,$c1).
% 6.00/6.21 ** KEPT (pick-wt=9): 90 [] sdtasdt0(xq,smndt0(xn))=sdtpldt0(xb,smndt0(xa)).
% 6.00/6.21 ---> New Demodulator: 91 [new_demod,90] sdtasdt0(xq,smndt0(xn))=sdtpldt0(xb,smndt0(xa)).
% 6.00/6.21 Following clause subsumed by 73 during input processing: 0 [copy,73,flip.1] A=A.
% 6.00/6.21 73 back subsumes 50.
% 6.00/6.21 73 back subsumes 46.
% 6.00/6.21 >>>> Starting back demodulation with 82.
% 6.00/6.21 >>>> Starting back demodulation with 89.
% 6.00/6.21 >>>> Starting back demodulation with 91.
% 6.00/6.21
% 6.00/6.21 ======= end of input processing =======
% 6.00/6.21
% 6.00/6.21 =========== start of search ===========
% 6.00/6.21
% 6.00/6.21
% 6.00/6.21 Resetting weight limit to 6.
% 6.00/6.21
% 6.00/6.21
% 6.00/6.21 Resetting weight limit to 6.
% 6.00/6.21
% 6.00/6.21 sos_size=2064
% 6.00/6.21
% 6.00/6.21 -------- PROOF --------
% 6.00/6.21
% 6.00/6.21 -----> EMPTY CLAUSE at 4.14 sec ----> 8167 [hyper,7315,33,78,2268,73,unit_del,5909,37] $F.
% 6.00/6.21
% 6.00/6.21 Length of proof is 21. Level of proof is 8.
% 6.00/6.21
% 6.00/6.21 ---------------- PROOF ----------------
% 6.00/6.21 % SZS status Theorem
% 6.00/6.21 % SZS output start Refutation
% See solution above
% 6.00/6.21 ------------ end of proof -------------
% 6.00/6.21
% 6.00/6.21
% 6.00/6.21 Search stopped by max_proofs option.
% 6.00/6.21
% 6.00/6.21
% 6.00/6.21 Search stopped by max_proofs option.
% 6.00/6.21
% 6.00/6.21 ============ end of search ============
% 6.00/6.21
% 6.00/6.21 -------------- statistics -------------
% 6.00/6.21 clauses given 140
% 6.00/6.21 clauses generated 871801
% 6.00/6.21 clauses kept 4498
% 6.00/6.21 clauses forward subsumed 10508
% 6.00/6.21 clauses back subsumed 17
% 6.00/6.21 Kbytes malloced 5859
% 6.00/6.21
% 6.00/6.21 ----------- times (seconds) -----------
% 6.00/6.21 user CPU time 4.14 (0 hr, 0 min, 4 sec)
% 6.00/6.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 6.00/6.21 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.00/6.21
% 6.00/6.21 That finishes the proof of the theorem.
% 6.00/6.21
% 6.00/6.21 Process 31516 finished Wed Jul 27 09:55:45 2022
% 6.00/6.21 Otter interrupted
% 6.00/6.21 PROOF FOUND
%------------------------------------------------------------------------------