TSTP Solution File: NUM435+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM435+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:20 EDT 2022
% Result : Theorem 2.21s 2.39s
% Output : Refutation 2.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 17 unt; 0 nHn; 19 RR)
% Number of literals : 28 ( 16 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 2 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 : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(13,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtasdt0(A,sdtasdt0(B,C)) = sdtasdt0(sdtasdt0(A,B),C) ),
file('NUM435+1.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('NUM435+1.p',unknown),
[] ).
cnf(41,axiom,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
file('NUM435+1.p',unknown),
[] ).
cnf(79,axiom,
A = A,
file('NUM435+1.p',unknown),
[] ).
cnf(84,axiom,
aInteger0(xp),
file('NUM435+1.p',unknown),
[] ).
cnf(85,axiom,
aInteger0(xq),
file('NUM435+1.p',unknown),
[] ).
cnf(87,axiom,
aInteger0(xm),
file('NUM435+1.p',unknown),
[] ).
cnf(88,axiom,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
file('NUM435+1.p',unknown),
[] ).
cnf(90,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),xm),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[88])]),
[iquote('copy,88,flip.1')] ).
cnf(91,plain,
sdtasdt0(sdtasdt0(xp,xq),xm) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[41]),90]),
[iquote('back_demod,41,demod,90')] ).
cnf(2072,plain,
sdtasdt0(xq,xp) = sdtasdt0(xp,xq),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[85,15,84])]),
[iquote('hyper,85,15,84,flip.1')] ).
cnf(3229,plain,
sdtasdt0(xq,xm) = sdtasdt0(xm,xq),
inference(hyper,[status(thm)],[87,15,85]),
[iquote('hyper,87,15,85')] ).
cnf(3231,plain,
sdtasdt0(xp,xm) = sdtasdt0(xm,xp),
inference(hyper,[status(thm)],[87,15,84]),
[iquote('hyper,87,15,84')] ).
cnf(3243,plain,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xq,sdtasdt0(xm,xp)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[87,14,85,84]),2072,3231]),
[iquote('hyper,87,14,85,84,demod,2072,3231')] ).
cnf(3251,plain,
sdtasdt0(xq,sdtasdt0(xm,xp)) = sdtasdt0(xp,sdtasdt0(xm,xq)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[87,14,84,85]),3243,3229]),
[iquote('hyper,87,14,84,85,demod,3243,3229')] ).
cnf(3291,plain,
sdtasdt0(sdtasdt0(xm,xq),xp) = sdtasdt0(xp,sdtasdt0(xm,xq)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[87,14,85,84]),3229,3251]),
[iquote('hyper,87,14,85,84,demod,3229,3251')] ).
cnf(3333,plain,
sdtasdt0(xp,sdtasdt0(xm,xq)) = sdtasdt0(xm,sdtasdt0(xp,xq)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[87,14,85,84]),3291,2072]),
[iquote('hyper,87,14,85,84,demod,3291,2072')] ).
cnf(3656,plain,
sdtasdt0(xm,sdtasdt0(xp,xq)) != sdtasdt0(xm,sdtasdt0(xp,xq)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[91]),3243,3251,3333,3231,3251,3333]),
[iquote('back_demod,91,demod,3243,3251,3333,3231,3251,3333')] ).
cnf(3657,plain,
$false,
inference(binary,[status(thm)],[3656,79]),
[iquote('binary,3656.1,79.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM435+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n023.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 10:11:03 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.10/2.29 ----- Otter 3.3f, August 2004 -----
% 2.10/2.29 The process was started by sandbox2 on n023.cluster.edu,
% 2.10/2.29 Wed Jul 27 10:11:03 2022
% 2.10/2.29 The command was "./otter". The process ID is 18811.
% 2.10/2.29
% 2.10/2.29 set(prolog_style_variables).
% 2.10/2.29 set(auto).
% 2.10/2.29 dependent: set(auto1).
% 2.10/2.29 dependent: set(process_input).
% 2.10/2.29 dependent: clear(print_kept).
% 2.10/2.29 dependent: clear(print_new_demod).
% 2.10/2.29 dependent: clear(print_back_demod).
% 2.10/2.29 dependent: clear(print_back_sub).
% 2.10/2.29 dependent: set(control_memory).
% 2.10/2.29 dependent: assign(max_mem, 12000).
% 2.10/2.29 dependent: assign(pick_given_ratio, 4).
% 2.10/2.29 dependent: assign(stats_level, 1).
% 2.10/2.29 dependent: assign(max_seconds, 10800).
% 2.10/2.29 clear(print_given).
% 2.10/2.29
% 2.10/2.29 formula_list(usable).
% 2.10/2.29 all A (A=A).
% 2.10/2.29 all W0 (aInteger0(W0)->$T).
% 2.10/2.29 aInteger0(sz00).
% 2.10/2.29 aInteger0(sz10).
% 2.10/2.29 all W0 (aInteger0(W0)->aInteger0(smndt0(W0))).
% 2.10/2.29 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtpldt0(W0,W1))).
% 2.10/2.29 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtasdt0(W0,W1))).
% 2.10/2.29 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2)).
% 2.10/2.29 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtpldt0(W0,W1)=sdtpldt0(W1,W0)).
% 2.10/2.29 all W0 (aInteger0(W0)->sdtpldt0(W0,sz00)=W0&W0=sdtpldt0(sz00,W0)).
% 2.10/2.29 all W0 (aInteger0(W0)->sdtpldt0(W0,smndt0(W0))=sz00&sz00=sdtpldt0(smndt0(W0),W0)).
% 2.10/2.29 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2)).
% 2.10/2.29 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtasdt0(W0,W1)=sdtasdt0(W1,W0)).
% 2.10/2.29 all W0 (aInteger0(W0)->sdtasdt0(W0,sz10)=W0&W0=sdtasdt0(sz10,W0)).
% 2.10/2.29 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))).
% 2.10/2.29 all W0 (aInteger0(W0)->sdtasdt0(W0,sz00)=sz00&sz00=sdtasdt0(sz00,W0)).
% 2.10/2.29 all W0 (aInteger0(W0)->sdtasdt0(smndt0(sz10),W0)=smndt0(W0)&smndt0(W0)=sdtasdt0(W0,smndt0(sz10))).
% 2.10/2.29 all W0 W1 (aInteger0(W0)&aInteger0(W1)-> (sdtasdt0(W0,W1)=sz00->W0=sz00|W1=sz00)).
% 2.10/2.29 all W0 (aInteger0(W0)-> (all W1 (aDivisorOf0(W1,W0)<->aInteger0(W1)&W1!=sz00& (exists W2 (aInteger0(W2)&sdtasdt0(W1,W2)=W0))))).
% 2.10/2.29 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)&W2!=sz00-> (sdte_qdtlpzmzozddtrp0(W0,W1,W2)<->aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))))).
% 2.10/2.29 all W0 W1 (aInteger0(W0)&aInteger0(W1)&W1!=sz00->sdte_qdtlpzmzozddtrp0(W0,W0,W1)).
% 2.10/2.29 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)&W2!=sz00-> (sdte_qdtlpzmzozddtrp0(W0,W1,W2)->sdte_qdtlpzmzozddtrp0(W1,W0,W2))).
% 2.10/2.29 all W0 W1 W2 W3 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)&W2!=sz00&aInteger0(W3)-> (sdte_qdtlpzmzozddtrp0(W0,W1,W2)&sdte_qdtlpzmzozddtrp0(W1,W3,W2)->sdte_qdtlpzmzozddtrp0(W0,W3,W2))).
% 2.10/2.29 aInteger0(xa).
% 2.10/2.29 aInteger0(xb).
% 2.10/2.29 aInteger0(xp).
% 2.10/2.29 xp!=sz00.
% 2.10/2.29 aInteger0(xq).
% 2.10/2.29 xq!=sz00.
% 2.10/2.29 sdte_qdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)).
% 2.10/2.29 aInteger0(xm).
% 2.10/2.29 sdtasdt0(sdtasdt0(xp,xq),xm)=sdtpldt0(xa,smndt0(xb)).
% 2.10/2.29 sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,sdtasdt0(xp,xm)).
% 2.10/2.29 end_of_list.
% 2.10/2.29
% 2.10/2.29 -------> usable clausifies to:
% 2.10/2.29
% 2.10/2.29 list(usable).
% 2.10/2.29 0 [] A=A.
% 2.10/2.29 0 [] -aInteger0(W0)|$T.
% 2.10/2.29 0 [] aInteger0(sz00).
% 2.10/2.29 0 [] aInteger0(sz10).
% 2.10/2.29 0 [] -aInteger0(W0)|aInteger0(smndt0(W0)).
% 2.10/2.29 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtpldt0(W0,W1)).
% 2.10/2.29 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtasdt0(W0,W1)).
% 2.10/2.29 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2).
% 2.10/2.29 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtpldt0(W0,W1)=sdtpldt0(W1,W0).
% 2.10/2.29 0 [] -aInteger0(W0)|sdtpldt0(W0,sz00)=W0.
% 2.10/2.29 0 [] -aInteger0(W0)|W0=sdtpldt0(sz00,W0).
% 2.10/2.29 0 [] -aInteger0(W0)|sdtpldt0(W0,smndt0(W0))=sz00.
% 2.10/2.29 0 [] -aInteger0(W0)|sz00=sdtpldt0(smndt0(W0),W0).
% 2.10/2.29 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2).
% 2.10/2.29 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)=sdtasdt0(W1,W0).
% 2.10/2.29 0 [] -aInteger0(W0)|sdtasdt0(W0,sz10)=W0.
% 2.10/2.29 0 [] -aInteger0(W0)|W0=sdtasdt0(sz10,W0).
% 2.10/2.29 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)).
% 2.10/2.29 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(sdtpldt0(W0,W1),W2)=sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)).
% 2.10/2.29 0 [] -aInteger0(W0)|sdtasdt0(W0,sz00)=sz00.
% 2.10/2.30 0 [] -aInteger0(W0)|sz00=sdtasdt0(sz00,W0).
% 2.10/2.30 0 [] -aInteger0(W0)|sdtasdt0(smndt0(sz10),W0)=smndt0(W0).
% 2.10/2.30 0 [] -aInteger0(W0)|smndt0(W0)=sdtasdt0(W0,smndt0(sz10)).
% 2.10/2.30 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)!=sz00|W0=sz00|W1=sz00.
% 2.10/2.30 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|aInteger0(W1).
% 2.10/2.30 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|W1!=sz00.
% 2.10/2.30 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|aInteger0($f1(W0,W1)).
% 2.10/2.30 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|sdtasdt0(W1,$f1(W0,W1))=W0.
% 2.10/2.30 0 [] -aInteger0(W0)|aDivisorOf0(W1,W0)| -aInteger0(W1)|W1=sz00| -aInteger0(W2)|sdtasdt0(W1,W2)!=W0.
% 2.10/2.30 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00| -sdte_qdtlpzmzozddtrp0(W0,W1,W2)|aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))).
% 2.10/2.30 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00|sdte_qdtlpzmzozddtrp0(W0,W1,W2)| -aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))).
% 2.10/2.30 0 [] -aInteger0(W0)| -aInteger0(W1)|W1=sz00|sdte_qdtlpzmzozddtrp0(W0,W0,W1).
% 2.10/2.30 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00| -sdte_qdtlpzmzozddtrp0(W0,W1,W2)|sdte_qdtlpzmzozddtrp0(W1,W0,W2).
% 2.10/2.30 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00| -aInteger0(W3)| -sdte_qdtlpzmzozddtrp0(W0,W1,W2)| -sdte_qdtlpzmzozddtrp0(W1,W3,W2)|sdte_qdtlpzmzozddtrp0(W0,W3,W2).
% 2.10/2.30 0 [] aInteger0(xa).
% 2.10/2.30 0 [] aInteger0(xb).
% 2.10/2.30 0 [] aInteger0(xp).
% 2.10/2.30 0 [] xp!=sz00.
% 2.10/2.30 0 [] aInteger0(xq).
% 2.10/2.30 0 [] xq!=sz00.
% 2.10/2.30 0 [] sdte_qdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)).
% 2.10/2.30 0 [] aInteger0(xm).
% 2.10/2.30 0 [] sdtasdt0(sdtasdt0(xp,xq),xm)=sdtpldt0(xa,smndt0(xb)).
% 2.10/2.30 0 [] sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,sdtasdt0(xp,xm)).
% 2.10/2.30 end_of_list.
% 2.10/2.30
% 2.10/2.30 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 2.10/2.30
% 2.10/2.30 This ia a non-Horn set with equality. The strategy will be
% 2.10/2.30 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.10/2.30 deletion, with positive clauses in sos and nonpositive
% 2.10/2.30 clauses in usable.
% 2.10/2.30
% 2.10/2.30 dependent: set(knuth_bendix).
% 2.10/2.30 dependent: set(anl_eq).
% 2.10/2.30 dependent: set(para_from).
% 2.10/2.30 dependent: set(para_into).
% 2.10/2.30 dependent: clear(para_from_right).
% 2.10/2.30 dependent: clear(para_into_right).
% 2.10/2.30 dependent: set(para_from_vars).
% 2.10/2.30 dependent: set(eq_units_both_ways).
% 2.10/2.30 dependent: set(dynamic_demod_all).
% 2.10/2.30 dependent: set(dynamic_demod).
% 2.10/2.30 dependent: set(order_eq).
% 2.10/2.30 dependent: set(back_demod).
% 2.10/2.30 dependent: set(lrpo).
% 2.10/2.30 dependent: set(hyper_res).
% 2.10/2.30 dependent: set(unit_deletion).
% 2.10/2.30 dependent: set(factor).
% 2.10/2.30
% 2.10/2.30 ------------> process usable:
% 2.10/2.30 ** KEPT (pick-wt=5): 1 [] -aInteger0(A)|aInteger0(smndt0(A)).
% 2.10/2.30 ** KEPT (pick-wt=8): 2 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtpldt0(A,B)).
% 2.10/2.30 ** KEPT (pick-wt=8): 3 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtasdt0(A,B)).
% 2.10/2.30 ** 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)).
% 2.10/2.30 ** KEPT (pick-wt=11): 6 [] -aInteger0(A)| -aInteger0(B)|sdtpldt0(A,B)=sdtpldt0(B,A).
% 2.10/2.30 ** KEPT (pick-wt=7): 7 [] -aInteger0(A)|sdtpldt0(A,sz00)=A.
% 2.10/2.30 ** KEPT (pick-wt=7): 9 [copy,8,flip.2] -aInteger0(A)|sdtpldt0(sz00,A)=A.
% 2.10/2.30 ** KEPT (pick-wt=8): 10 [] -aInteger0(A)|sdtpldt0(A,smndt0(A))=sz00.
% 2.10/2.30 ** KEPT (pick-wt=8): 12 [copy,11,flip.2] -aInteger0(A)|sdtpldt0(smndt0(A),A)=sz00.
% 2.10/2.30 ** 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)).
% 2.10/2.30 ** KEPT (pick-wt=11): 15 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)=sdtasdt0(B,A).
% 2.10/2.30 ** KEPT (pick-wt=7): 16 [] -aInteger0(A)|sdtasdt0(A,sz10)=A.
% 2.10/2.30 ** KEPT (pick-wt=7): 18 [copy,17,flip.2] -aInteger0(A)|sdtasdt0(sz10,A)=A.
% 2.10/2.30 ** 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)).
% 2.10/2.30 ** 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).
% 2.10/2.30 ** KEPT (pick-wt=7): 23 [] -aInteger0(A)|sdtasdt0(A,sz00)=sz00.
% 2.10/2.30 ** KEPT (pick-wt=7): 25 [copy,24,flip.2] -aInteger0(A)|sdtasdt0(sz00,A)=sz00.
% 2.10/2.30 ** KEPT (pick-wt=9): 26 [] -aInteger0(A)|sdtasdt0(smndt0(sz10),A)=smndt0(A).
% 2.10/2.30 ** KEPT (pick-wt=9): 27 [] -aInteger0(A)|smndt0(A)=sdtasdt0(A,smndt0(sz10)).
% 2.10/2.30 ** KEPT (pick-wt=15): 28 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)!=sz00|A=sz00|B=sz00.
% 2.21/2.39 ** KEPT (pick-wt=7): 29 [] -aInteger0(A)| -aDivisorOf0(B,A)|aInteger0(B).
% 2.21/2.39 ** KEPT (pick-wt=8): 30 [] -aInteger0(A)| -aDivisorOf0(B,A)|B!=sz00.
% 2.21/2.39 ** KEPT (pick-wt=9): 31 [] -aInteger0(A)| -aDivisorOf0(B,A)|aInteger0($f1(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=12): 32 [] -aInteger0(A)| -aDivisorOf0(B,A)|sdtasdt0(B,$f1(A,B))=A.
% 2.21/2.39 ** KEPT (pick-wt=17): 33 [] -aInteger0(A)|aDivisorOf0(B,A)| -aInteger0(B)|B=sz00| -aInteger0(C)|sdtasdt0(B,C)!=A.
% 2.21/2.39 ** KEPT (pick-wt=19): 34 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00| -sdte_qdtlpzmzozddtrp0(A,B,C)|aDivisorOf0(C,sdtpldt0(A,smndt0(B))).
% 2.21/2.39 ** KEPT (pick-wt=19): 35 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00|sdte_qdtlpzmzozddtrp0(A,B,C)| -aDivisorOf0(C,sdtpldt0(A,smndt0(B))).
% 2.21/2.39 ** KEPT (pick-wt=11): 36 [] -aInteger0(A)| -aInteger0(B)|B=sz00|sdte_qdtlpzmzozddtrp0(A,A,B).
% 2.21/2.39 ** KEPT (pick-wt=17): 37 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00| -sdte_qdtlpzmzozddtrp0(A,B,C)|sdte_qdtlpzmzozddtrp0(B,A,C).
% 2.21/2.39 ** KEPT (pick-wt=23): 38 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00| -aInteger0(D)| -sdte_qdtlpzmzozddtrp0(A,B,C)| -sdte_qdtlpzmzozddtrp0(B,D,C)|sdte_qdtlpzmzozddtrp0(A,D,C).
% 2.21/2.39 ** KEPT (pick-wt=3): 39 [] xp!=sz00.
% 2.21/2.39 ** KEPT (pick-wt=3): 40 [] xq!=sz00.
% 2.21/2.39 ** KEPT (pick-wt=10): 41 [] sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,sdtasdt0(xp,xm)).
% 2.21/2.39
% 2.21/2.39 ------------> process sos:
% 2.21/2.39 ** KEPT (pick-wt=3): 79 [] A=A.
% 2.21/2.39 ** KEPT (pick-wt=2): 80 [] aInteger0(sz00).
% 2.21/2.39 ** KEPT (pick-wt=2): 81 [] aInteger0(sz10).
% 2.21/2.39 ** KEPT (pick-wt=2): 82 [] aInteger0(xa).
% 2.21/2.39 ** KEPT (pick-wt=2): 83 [] aInteger0(xb).
% 2.21/2.39 ** KEPT (pick-wt=2): 84 [] aInteger0(xp).
% 2.21/2.39 ** KEPT (pick-wt=2): 85 [] aInteger0(xq).
% 2.21/2.39 ** KEPT (pick-wt=6): 86 [] sdte_qdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)).
% 2.21/2.39 ** KEPT (pick-wt=2): 87 [] aInteger0(xm).
% 2.21/2.39 ** KEPT (pick-wt=10): 89 [copy,88,flip.1] sdtpldt0(xa,smndt0(xb))=sdtasdt0(sdtasdt0(xp,xq),xm).
% 2.21/2.39 ---> New Demodulator: 90 [new_demod,89] sdtpldt0(xa,smndt0(xb))=sdtasdt0(sdtasdt0(xp,xq),xm).
% 2.21/2.39 Following clause subsumed by 79 during input processing: 0 [copy,79,flip.1] A=A.
% 2.21/2.39 79 back subsumes 51.
% 2.21/2.39 79 back subsumes 47.
% 2.21/2.39 >>>> Starting back demodulation with 90.
% 2.21/2.39 >> back demodulating 41 with 90.
% 2.21/2.39
% 2.21/2.39 ======= end of input processing =======
% 2.21/2.39
% 2.21/2.39 =========== start of search ===========
% 2.21/2.39
% 2.21/2.39 -------- PROOF --------
% 2.21/2.39
% 2.21/2.39 ----> UNIT CONFLICT at 0.10 sec ----> 3657 [binary,3656.1,79.1] $F.
% 2.21/2.39
% 2.21/2.39 Length of proof is 11. Level of proof is 6.
% 2.21/2.39
% 2.21/2.39 ---------------- PROOF ----------------
% 2.21/2.39 % SZS status Theorem
% 2.21/2.39 % SZS output start Refutation
% See solution above
% 2.21/2.39 ------------ end of proof -------------
% 2.21/2.39
% 2.21/2.39
% 2.21/2.39 Search stopped by max_proofs option.
% 2.21/2.39
% 2.21/2.39
% 2.21/2.39 Search stopped by max_proofs option.
% 2.21/2.39
% 2.21/2.39 ============ end of search ============
% 2.21/2.39
% 2.21/2.39 -------------- statistics -------------
% 2.21/2.39 clauses given 8
% 2.21/2.39 clauses generated 2980
% 2.21/2.39 clauses kept 1910
% 2.21/2.39 clauses forward subsumed 1878
% 2.21/2.39 clauses back subsumed 2
% 2.21/2.39 Kbytes malloced 2929
% 2.21/2.39
% 2.21/2.39 ----------- times (seconds) -----------
% 2.21/2.39 user CPU time 0.10 (0 hr, 0 min, 0 sec)
% 2.21/2.39 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.21/2.39 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.21/2.39
% 2.21/2.39 That finishes the proof of the theorem.
% 2.21/2.39
% 2.21/2.39 Process 18811 finished Wed Jul 27 10:11:05 2022
% 2.21/2.39 Otter interrupted
% 2.21/2.39 PROOF FOUND
%------------------------------------------------------------------------------