%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM432+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:19 EDT 2022
% Result : Theorem 14.64s 14.80s
% Output : Refutation 14.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 14 ( 5 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| aInteger0(sdtpldt0(A,B)) ),
file('NUM432+3.p',unknown),
[] ).
cnf(39,axiom,
( ~ aInteger0(A)
| sdtasdt0(xq,A) != sdtpldt0(xa,smndt0(xc)) ),
file('NUM432+3.p',unknown),
[] ).
cnf(76,axiom,
A = A,
file('NUM432+3.p',unknown),
[] ).
cnf(97,axiom,
aInteger0(xn),
file('NUM432+3.p',unknown),
[] ).
cnf(101,axiom,
aInteger0(xm),
file('NUM432+3.p',unknown),
[] ).
cnf(105,axiom,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('NUM432+3.p',unknown),
[] ).
cnf(107,plain,
sdtpldt0(xa,smndt0(xc)) = sdtasdt0(xq,sdtpldt0(xn,xm)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[105])]),
[iquote('copy,105,flip.1')] ).
cnf(109,plain,
( ~ aInteger0(A)
| sdtasdt0(xq,A) != sdtasdt0(xq,sdtpldt0(xn,xm)) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[39]),107]),
[iquote('back_demod,39,demod,107')] ).
cnf(8067,plain,
aInteger0(sdtpldt0(xn,xm)),
inference(hyper,[status(thm)],[101,2,97]),
[iquote('hyper,101,2,97')] ).
cnf(8309,plain,
$false,
inference(hyper,[status(thm)],[8067,109,76]),
[iquote('hyper,8067,109,76')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM432+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 09:38:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.94/2.14 ----- Otter 3.3f, August 2004 -----
% 1.94/2.14 The process was started by sandbox2 on n004.cluster.edu,
% 1.94/2.14 Wed Jul 27 09:38:21 2022
% 1.94/2.14 The command was "./otter". The process ID is 4040.
% 1.94/2.14
% 1.94/2.14 set(prolog_style_variables).
% 1.94/2.14 set(auto).
% 1.94/2.14 dependent: set(auto1).
% 1.94/2.14 dependent: set(process_input).
% 1.94/2.14 dependent: clear(print_kept).
% 1.94/2.14 dependent: clear(print_new_demod).
% 1.94/2.14 dependent: clear(print_back_demod).
% 1.94/2.14 dependent: clear(print_back_sub).
% 1.94/2.14 dependent: set(control_memory).
% 1.94/2.14 dependent: assign(max_mem, 12000).
% 1.94/2.14 dependent: assign(pick_given_ratio, 4).
% 1.94/2.14 dependent: assign(stats_level, 1).
% 1.94/2.14 dependent: assign(max_seconds, 10800).
% 1.94/2.14 clear(print_given).
% 1.94/2.14
% 1.94/2.14 formula_list(usable).
% 1.94/2.14 all A (A=A).
% 1.94/2.14 all W0 (aInteger0(W0)->$T).
% 1.94/2.14 aInteger0(sz00).
% 1.94/2.14 aInteger0(sz10).
% 1.94/2.14 all W0 (aInteger0(W0)->aInteger0(smndt0(W0))).
% 1.94/2.14 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtpldt0(W0,W1))).
% 1.94/2.14 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtasdt0(W0,W1))).
% 1.94/2.14 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2)).
% 1.94/2.14 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtpldt0(W0,W1)=sdtpldt0(W1,W0)).
% 1.94/2.14 all W0 (aInteger0(W0)->sdtpldt0(W0,sz00)=W0&W0=sdtpldt0(sz00,W0)).
% 1.94/2.14 all W0 (aInteger0(W0)->sdtpldt0(W0,smndt0(W0))=sz00&sz00=sdtpldt0(smndt0(W0),W0)).
% 1.94/2.14 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2)).
% 1.94/2.14 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtasdt0(W0,W1)=sdtasdt0(W1,W0)).
% 1.94/2.14 all W0 (aInteger0(W0)->sdtasdt0(W0,sz10)=W0&W0=sdtasdt0(sz10,W0)).
% 1.94/2.14 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.94/2.14 all W0 (aInteger0(W0)->sdtasdt0(W0,sz00)=sz00&sz00=sdtasdt0(sz00,W0)).
% 1.94/2.14 all W0 (aInteger0(W0)->sdtasdt0(smndt0(sz10),W0)=smndt0(W0)&smndt0(W0)=sdtasdt0(W0,smndt0(sz10))).
% 1.94/2.14 all W0 W1 (aInteger0(W0)&aInteger0(W1)-> (sdtasdt0(W0,W1)=sz00->W0=sz00|W1=sz00)).
% 1.94/2.14 all W0 (aInteger0(W0)-> (all W1 (aDivisorOf0(W1,W0)<->aInteger0(W1)&W1!=sz00& (exists W2 (aInteger0(W2)&sdtasdt0(W1,W2)=W0))))).
% 1.94/2.14 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)&W2!=sz00-> (sdte_qdtlpzmzozddtrp0(W0,W1,W2)<->aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))))).
% 1.94/2.14 all W0 W1 (aInteger0(W0)&aInteger0(W1)&W1!=sz00->sdte_qdtlpzmzozddtrp0(W0,W0,W1)).
% 1.94/2.14 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)&W2!=sz00-> (sdte_qdtlpzmzozddtrp0(W0,W1,W2)->sdte_qdtlpzmzozddtrp0(W1,W0,W2))).
% 1.94/2.14 aInteger0(xa).
% 1.94/2.14 aInteger0(xb).
% 1.94/2.14 aInteger0(xq).
% 1.94/2.14 xq!=sz00.
% 1.94/2.14 aInteger0(xc).
% 1.94/2.14 exists W0 (aInteger0(W0)&sdtasdt0(xq,W0)=sdtpldt0(xa,smndt0(xb))).
% 1.94/2.14 aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))).
% 1.94/2.14 sdte_qdtlpzmzozddtrp0(xa,xb,xq).
% 1.94/2.14 exists W0 (aInteger0(W0)&sdtasdt0(xq,W0)=sdtpldt0(xb,smndt0(xc))).
% 1.94/2.14 aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))).
% 1.94/2.14 sdte_qdtlpzmzozddtrp0(xb,xc,xq).
% 1.94/2.14 aInteger0(xn).
% 1.94/2.14 sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb)).
% 1.94/2.14 aInteger0(xm).
% 1.94/2.14 sdtasdt0(xq,xm)=sdtpldt0(xb,smndt0(xc)).
% 1.94/2.14 sdtasdt0(xq,sdtpldt0(xn,xm))=sdtpldt0(xa,smndt0(xc)).
% 1.94/2.14 -((exists W0 (aInteger0(W0)&sdtasdt0(xq,W0)=sdtpldt0(xa,smndt0(xc))))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))|sdte_qdtlpzmzozddtrp0(xa,xc,xq)).
% 1.94/2.14 end_of_list.
% 1.94/2.14
% 1.94/2.14 -------> usable clausifies to:
% 1.94/2.14
% 1.94/2.14 list(usable).
% 1.94/2.14 0 [] A=A.
% 1.94/2.14 0 [] -aInteger0(W0)|$T.
% 1.94/2.14 0 [] aInteger0(sz00).
% 1.94/2.14 0 [] aInteger0(sz10).
% 1.94/2.14 0 [] -aInteger0(W0)|aInteger0(smndt0(W0)).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtpldt0(W0,W1)).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtasdt0(W0,W1)).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtpldt0(W0,W1)=sdtpldt0(W1,W0).
% 1.94/2.14 0 [] -aInteger0(W0)|sdtpldt0(W0,sz00)=W0.
% 1.94/2.14 0 [] -aInteger0(W0)|W0=sdtpldt0(sz00,W0).
% 1.94/2.14 0 [] -aInteger0(W0)|sdtpldt0(W0,smndt0(W0))=sz00.
% 1.94/2.14 0 [] -aInteger0(W0)|sz00=sdtpldt0(smndt0(W0),W0).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)=sdtasdt0(W1,W0).
% 1.94/2.14 0 [] -aInteger0(W0)|sdtasdt0(W0,sz10)=W0.
% 1.94/2.14 0 [] -aInteger0(W0)|W0=sdtasdt0(sz10,W0).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(sdtpldt0(W0,W1),W2)=sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)).
% 1.94/2.14 0 [] -aInteger0(W0)|sdtasdt0(W0,sz00)=sz00.
% 1.94/2.14 0 [] -aInteger0(W0)|sz00=sdtasdt0(sz00,W0).
% 1.94/2.14 0 [] -aInteger0(W0)|sdtasdt0(smndt0(sz10),W0)=smndt0(W0).
% 1.94/2.14 0 [] -aInteger0(W0)|smndt0(W0)=sdtasdt0(W0,smndt0(sz10)).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)!=sz00|W0=sz00|W1=sz00.
% 1.94/2.14 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|aInteger0(W1).
% 1.94/2.14 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|W1!=sz00.
% 1.94/2.14 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|aInteger0($f1(W0,W1)).
% 1.94/2.14 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|sdtasdt0(W1,$f1(W0,W1))=W0.
% 1.94/2.14 0 [] -aInteger0(W0)|aDivisorOf0(W1,W0)| -aInteger0(W1)|W1=sz00| -aInteger0(W2)|sdtasdt0(W1,W2)!=W0.
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00| -sdte_qdtlpzmzozddtrp0(W0,W1,W2)|aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00|sdte_qdtlpzmzozddtrp0(W0,W1,W2)| -aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)|W1=sz00|sdte_qdtlpzmzozddtrp0(W0,W0,W1).
% 1.94/2.14 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00| -sdte_qdtlpzmzozddtrp0(W0,W1,W2)|sdte_qdtlpzmzozddtrp0(W1,W0,W2).
% 1.94/2.14 0 [] aInteger0(xa).
% 1.94/2.14 0 [] aInteger0(xb).
% 1.94/2.14 0 [] aInteger0(xq).
% 1.94/2.14 0 [] xq!=sz00.
% 1.94/2.14 0 [] aInteger0(xc).
% 1.94/2.14 0 [] aInteger0($c1).
% 1.94/2.14 0 [] sdtasdt0(xq,$c1)=sdtpldt0(xa,smndt0(xb)).
% 1.94/2.14 0 [] aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))).
% 1.94/2.14 0 [] sdte_qdtlpzmzozddtrp0(xa,xb,xq).
% 1.94/2.14 0 [] aInteger0($c2).
% 1.94/2.14 0 [] sdtasdt0(xq,$c2)=sdtpldt0(xb,smndt0(xc)).
% 1.94/2.14 0 [] aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))).
% 1.94/2.14 0 [] sdte_qdtlpzmzozddtrp0(xb,xc,xq).
% 1.94/2.14 0 [] aInteger0(xn).
% 1.94/2.14 0 [] sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb)).
% 1.94/2.14 0 [] aInteger0(xm).
% 1.94/2.14 0 [] sdtasdt0(xq,xm)=sdtpldt0(xb,smndt0(xc)).
% 1.94/2.14 0 [] sdtasdt0(xq,sdtpldt0(xn,xm))=sdtpldt0(xa,smndt0(xc)).
% 1.94/2.14 0 [] -aInteger0(W0)|sdtasdt0(xq,W0)!=sdtpldt0(xa,smndt0(xc)).
% 1.94/2.14 0 [] -aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))).
% 1.94/2.14 0 [] -sdte_qdtlpzmzozddtrp0(xa,xc,xq).
% 1.94/2.14 end_of_list.
% 1.94/2.14
% 1.94/2.14 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.94/2.14
% 1.94/2.14 This ia a non-Horn set with equality. The strategy will be
% 1.94/2.14 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.94/2.14 deletion, with positive clauses in sos and nonpositive
% 1.94/2.14 clauses in usable.
% 1.94/2.14
% 1.94/2.14 dependent: set(knuth_bendix).
% 1.94/2.14 dependent: set(anl_eq).
% 1.94/2.14 dependent: set(para_from).
% 1.94/2.14 dependent: set(para_into).
% 1.94/2.14 dependent: clear(para_from_right).
% 1.94/2.14 dependent: clear(para_into_right).
% 1.94/2.14 dependent: set(para_from_vars).
% 1.94/2.14 dependent: set(eq_units_both_ways).
% 1.94/2.14 dependent: set(dynamic_demod_all).
% 1.94/2.14 dependent: set(dynamic_demod).
% 1.94/2.14 dependent: set(order_eq).
% 1.94/2.14 dependent: set(back_demod).
% 1.94/2.14 dependent: set(lrpo).
% 1.94/2.14 dependent: set(hyper_res).
% 1.94/2.14 dependent: set(unit_deletion).
% 1.94/2.14 dependent: set(factor).
% 1.94/2.14
% 1.94/2.14 ------------> process usable:
% 1.94/2.14 ** KEPT (pick-wt=5): 1 [] -aInteger0(A)|aInteger0(smndt0(A)).
% 1.94/2.14 ** KEPT (pick-wt=8): 2 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtpldt0(A,B)).
% 1.94/2.14 ** KEPT (pick-wt=8): 3 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtasdt0(A,B)).
% 1.94/2.14 ** 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.94/2.14 ** KEPT (pick-wt=11): 6 [] -aInteger0(A)| -aInteger0(B)|sdtpldt0(A,B)=sdtpldt0(B,A).
% 1.94/2.14 ** KEPT (pick-wt=7): 7 [] -aInteger0(A)|sdtpldt0(A,sz00)=A.
% 1.94/2.14 ** KEPT (pick-wt=7): 9 [copy,8,flip.2] -aInteger0(A)|sdtpldt0(sz00,A)=A.
% 1.94/2.14 ** KEPT (pick-wt=8): 10 [] -aInteger0(A)|sdtpldt0(A,smndt0(A))=sz00.
% 1.94/2.14 ** KEPT (pick-wt=8): 12 [copy,11,flip.2] -aInteger0(A)|sdtpldt0(smndt0(A),A)=sz00.
% 1.94/2.14 ** 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.94/2.14 ** KEPT (pick-wt=11): 15 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)=sdtasdt0(B,A).
% 1.94/2.14 ** KEPT (pick-wt=7): 16 [] -aInteger0(A)|sdtasdt0(A,sz10)=A.
% 1.94/2.14 ** KEPT (pick-wt=7): 18 [copy,17,flip.2] -aInteger0(A)|sdtasdt0(sz10,A)=A.
% 1.94/2.14 ** 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)).
% 14.64/14.80 ** 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).
% 14.64/14.80 ** KEPT (pick-wt=7): 23 [] -aInteger0(A)|sdtasdt0(A,sz00)=sz00.
% 14.64/14.80 ** KEPT (pick-wt=7): 25 [copy,24,flip.2] -aInteger0(A)|sdtasdt0(sz00,A)=sz00.
% 14.64/14.80 ** KEPT (pick-wt=9): 26 [] -aInteger0(A)|sdtasdt0(smndt0(sz10),A)=smndt0(A).
% 14.64/14.80 ** KEPT (pick-wt=9): 27 [] -aInteger0(A)|smndt0(A)=sdtasdt0(A,smndt0(sz10)).
% 14.64/14.80 ** KEPT (pick-wt=15): 28 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)!=sz00|A=sz00|B=sz00.
% 14.64/14.80 ** KEPT (pick-wt=7): 29 [] -aInteger0(A)| -aDivisorOf0(B,A)|aInteger0(B).
% 14.64/14.80 ** KEPT (pick-wt=8): 30 [] -aInteger0(A)| -aDivisorOf0(B,A)|B!=sz00.
% 14.64/14.80 ** KEPT (pick-wt=9): 31 [] -aInteger0(A)| -aDivisorOf0(B,A)|aInteger0($f1(A,B)).
% 14.64/14.80 ** KEPT (pick-wt=12): 32 [] -aInteger0(A)| -aDivisorOf0(B,A)|sdtasdt0(B,$f1(A,B))=A.
% 14.64/14.80 ** KEPT (pick-wt=17): 33 [] -aInteger0(A)|aDivisorOf0(B,A)| -aInteger0(B)|B=sz00| -aInteger0(C)|sdtasdt0(B,C)!=A.
% 14.64/14.80 ** KEPT (pick-wt=19): 34 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00| -sdte_qdtlpzmzozddtrp0(A,B,C)|aDivisorOf0(C,sdtpldt0(A,smndt0(B))).
% 14.64/14.80 ** KEPT (pick-wt=19): 35 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00|sdte_qdtlpzmzozddtrp0(A,B,C)| -aDivisorOf0(C,sdtpldt0(A,smndt0(B))).
% 14.64/14.80 ** KEPT (pick-wt=11): 36 [] -aInteger0(A)| -aInteger0(B)|B=sz00|sdte_qdtlpzmzozddtrp0(A,A,B).
% 14.64/14.80 ** KEPT (pick-wt=17): 37 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00| -sdte_qdtlpzmzozddtrp0(A,B,C)|sdte_qdtlpzmzozddtrp0(B,A,C).
% 14.64/14.80 ** KEPT (pick-wt=3): 38 [] xq!=sz00.
% 14.64/14.80 ** KEPT (pick-wt=10): 39 [] -aInteger0(A)|sdtasdt0(xq,A)!=sdtpldt0(xa,smndt0(xc)).
% 14.64/14.80 ** KEPT (pick-wt=6): 40 [] -aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))).
% 14.64/14.80 ** KEPT (pick-wt=4): 41 [] -sdte_qdtlpzmzozddtrp0(xa,xc,xq).
% 14.64/14.80
% 14.64/14.80 ------------> process sos:
% 14.64/14.80 ** KEPT (pick-wt=3): 76 [] A=A.
% 14.64/14.80 ** KEPT (pick-wt=2): 77 [] aInteger0(sz00).
% 14.64/14.80 ** KEPT (pick-wt=2): 78 [] aInteger0(sz10).
% 14.64/14.80 ** KEPT (pick-wt=2): 79 [] aInteger0(xa).
% 14.64/14.80 ** KEPT (pick-wt=2): 80 [] aInteger0(xb).
% 14.64/14.80 ** KEPT (pick-wt=2): 81 [] aInteger0(xq).
% 14.64/14.80 ** KEPT (pick-wt=2): 82 [] aInteger0(xc).
% 14.64/14.80 ** KEPT (pick-wt=2): 83 [] aInteger0($c1).
% 14.64/14.80 ** KEPT (pick-wt=8): 85 [copy,84,flip.1] sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,$c1).
% 14.64/14.80 ---> New Demodulator: 86 [new_demod,85] sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,$c1).
% 14.64/14.80 ** KEPT (pick-wt=5): 88 [copy,87,demod,86] aDivisorOf0(xq,sdtasdt0(xq,$c1)).
% 14.64/14.80 ** KEPT (pick-wt=4): 89 [] sdte_qdtlpzmzozddtrp0(xa,xb,xq).
% 14.64/14.80 ** KEPT (pick-wt=2): 90 [] aInteger0($c2).
% 14.64/14.80 ** KEPT (pick-wt=8): 92 [copy,91,flip.1] sdtpldt0(xb,smndt0(xc))=sdtasdt0(xq,$c2).
% 14.64/14.80 ---> New Demodulator: 93 [new_demod,92] sdtpldt0(xb,smndt0(xc))=sdtasdt0(xq,$c2).
% 14.64/14.80 ** KEPT (pick-wt=5): 95 [copy,94,demod,93] aDivisorOf0(xq,sdtasdt0(xq,$c2)).
% 14.64/14.80 ** KEPT (pick-wt=4): 96 [] sdte_qdtlpzmzozddtrp0(xb,xc,xq).
% 14.64/14.80 ** KEPT (pick-wt=2): 97 [] aInteger0(xn).
% 14.64/14.80 ** KEPT (pick-wt=7): 99 [copy,98,demod,86] sdtasdt0(xq,xn)=sdtasdt0(xq,$c1).
% 14.64/14.80 ---> New Demodulator: 100 [new_demod,99] sdtasdt0(xq,xn)=sdtasdt0(xq,$c1).
% 14.64/14.80 ** KEPT (pick-wt=2): 101 [] aInteger0(xm).
% 14.64/14.80 ** KEPT (pick-wt=7): 103 [copy,102,demod,93] sdtasdt0(xq,xm)=sdtasdt0(xq,$c2).
% 14.64/14.80 ---> New Demodulator: 104 [new_demod,103] sdtasdt0(xq,xm)=sdtasdt0(xq,$c2).
% 14.64/14.80 ** KEPT (pick-wt=10): 106 [copy,105,flip.1] sdtpldt0(xa,smndt0(xc))=sdtasdt0(xq,sdtpldt0(xn,xm)).
% 14.64/14.80 ---> New Demodulator: 107 [new_demod,106] sdtpldt0(xa,smndt0(xc))=sdtasdt0(xq,sdtpldt0(xn,xm)).
% 14.64/14.80 Following clause subsumed by 76 during input processing: 0 [copy,76,flip.1] A=A.
% 14.64/14.80 76 back subsumes 51.
% 14.64/14.80 76 back subsumes 47.
% 14.64/14.80 >>>> Starting back demodulation with 86.
% 14.64/14.80 >>>> Starting back demodulation with 93.
% 14.64/14.80 >>>> Starting back demodulation with 100.
% 14.64/14.80 >>>> Starting back demodulation with 104.
% 14.64/14.80 >>>> Starting back demodulation with 107.
% 14.64/14.80 >> back demodulating 40 with 107.
% 14.64/14.80 >> back demodulating 39 with 107.
% 14.64/14.80
% 14.64/14.80 ======= end of input processing =======
% 14.64/14.80
% 14.64/14.80 =========== start of search ===========
% 14.64/14.80
% 14.64/14.80
% 14.64/14.80 Resetting weight limit to 5.
% 14.64/14.80
% 14.64/14.80
% 14.64/14.80 Resetting weight limit to 5.
% 14.64/14.80
% 14.64/14.80 sos_size=2116
% 14.64/14.80
% 14.64/14.80 -- HEY sandbox2, WE HAVE A PROOF!! --
% 14.64/14.80
% 14.64/14.80 -----> EMPTY CLAUSE at 12.66 sec ----> 8309 [hyper,8067,109,76] $F.
% 14.64/14.80
% 14.64/14.80 Length of proof is 3. Level of proof is 2.
% 14.64/14.80
% 14.64/14.80 ---------------- PROOF ----------------
% 14.64/14.80 % SZS status Theorem
% 14.64/14.80 % SZS output start Refutation
% See solution above
% 14.64/14.80 ------------ end of proof -------------
% 14.64/14.80
% 14.64/14.80
% 14.64/14.80 Search stopped by max_proofs option.
% 14.64/14.80
% 14.64/14.80
% 14.64/14.80 Search stopped by max_proofs option.
% 14.64/14.80
% 14.64/14.80 ============ end of search ============
% 14.64/14.80
% 14.64/14.80 -------------- statistics -------------
% 14.64/14.80 clauses given 125
% 14.64/14.80 clauses generated 2821496
% 14.64/14.80 clauses kept 4394
% 14.64/14.80 clauses forward subsumed 10332
% 14.64/14.80 clauses back subsumed 3
% 14.64/14.80 Kbytes malloced 4882
% 14.64/14.80
% 14.64/14.80 ----------- times (seconds) -----------
% 14.64/14.80 user CPU time 12.66 (0 hr, 0 min, 12 sec)
% 14.64/14.80 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 14.64/14.80 wall-clock time 14 (0 hr, 0 min, 14 sec)
% 14.64/14.80
% 14.64/14.80 That finishes the proof of the theorem.
% 14.64/14.80
% 14.64/14.80 Process 4040 finished Wed Jul 27 09:38:35 2022
% 14.64/14.80 Otter interrupted
% 14.64/14.80 PROOF FOUND
%------------------------------------------------------------------------------