TSTP Solution File: NUM421+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM421+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:17 EDT 2022
% Result : Theorem 1.81s 1.98s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of clauses : 49 ( 27 unt; 0 nHn; 49 RR)
% Number of literals : 90 ( 42 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ aInteger0(A)
| aInteger0(smndt0(A)) ),
file('NUM421+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| aInteger0(sdtasdt0(A,B)) ),
file('NUM421+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtpldt0(A,sdtpldt0(B,C)) = sdtpldt0(sdtpldt0(A,B),C) ),
file('NUM421+1.p',unknown),
[] ).
cnf(5,plain,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtpldt0(sdtpldt0(A,B),C) = sdtpldt0(A,sdtpldt0(B,C)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,flip.4')] ).
cnf(6,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| sdtpldt0(A,B) = sdtpldt0(B,A) ),
file('NUM421+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ aInteger0(A)
| sdtpldt0(A,sz00) = A ),
file('NUM421+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ aInteger0(A)
| A = sdtpldt0(sz00,A) ),
file('NUM421+1.p',unknown),
[] ).
cnf(9,plain,
( ~ aInteger0(A)
| sdtpldt0(sz00,A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.2')] ).
cnf(11,axiom,
( ~ aInteger0(A)
| sz00 = sdtpldt0(smndt0(A),A) ),
file('NUM421+1.p',unknown),
[] ).
cnf(12,plain,
( ~ aInteger0(A)
| sdtpldt0(smndt0(A),A) = sz00 ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
[iquote('copy,11,flip.2')] ).
cnf(13,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtasdt0(A,sdtasdt0(B,C)) = sdtasdt0(sdtasdt0(A,B),C) ),
file('NUM421+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('NUM421+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ aInteger0(A)
| sdtasdt0(A,sz10) = A ),
file('NUM421+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ aInteger0(A)
| A = sdtasdt0(sz10,A) ),
file('NUM421+1.p',unknown),
[] ).
cnf(18,plain,
( ~ aInteger0(A)
| sdtasdt0(sz10,A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[17])]),
[iquote('copy,17,flip.2')] ).
cnf(19,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtasdt0(A,sdtpldt0(B,C)) = sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C)) ),
file('NUM421+1.p',unknown),
[] ).
cnf(20,plain,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C)) = sdtasdt0(A,sdtpldt0(B,C)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[19])]),
[iquote('copy,19,flip.4')] ).
cnf(21,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtasdt0(sdtpldt0(A,B),C) = sdtpldt0(sdtasdt0(A,C),sdtasdt0(B,C)) ),
file('NUM421+1.p',unknown),
[] ).
cnf(22,plain,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtpldt0(sdtasdt0(A,C),sdtasdt0(B,C)) = sdtasdt0(sdtpldt0(A,B),C) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[21])]),
[iquote('copy,21,flip.4')] ).
cnf(23,axiom,
( sdtasdt0(xa,sz00) != sz00
| sz00 != sdtasdt0(sz00,xa) ),
file('NUM421+1.p',unknown),
[] ).
cnf(24,plain,
( sdtasdt0(xa,sz00) != sz00
| sdtasdt0(sz00,xa) != sz00 ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[23])]),
[iquote('copy,23,flip.2')] ).
cnf(26,axiom,
aInteger0(sz00),
file('NUM421+1.p',unknown),
[] ).
cnf(27,axiom,
aInteger0(sz10),
file('NUM421+1.p',unknown),
[] ).
cnf(28,axiom,
aInteger0(xa),
file('NUM421+1.p',unknown),
[] ).
cnf(36,plain,
sdtasdt0(sz00,sz10) = sz00,
inference(hyper,[status(thm)],[26,16]),
[iquote('hyper,26,16')] ).
cnf(38,plain,
sdtasdt0(sdtasdt0(sz00,sz00),sz00) = sdtasdt0(sz00,sdtasdt0(sz00,sz00)),
inference(hyper,[status(thm)],[26,14,26,26]),
[iquote('hyper,26,14,26,26')] ).
cnf(45,plain,
aInteger0(sdtasdt0(sz00,sz00)),
inference(hyper,[status(thm)],[26,3,26]),
[iquote('hyper,26,3,26')] ).
cnf(71,plain,
sdtasdt0(sz00,sdtpldt0(sz10,sz00)) = sdtpldt0(sz00,sdtasdt0(sz00,sz00)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[27,20,26,26]),36])]),
[iquote('hyper,27,20,26,26,demod,36,flip.1')] ).
cnf(86,plain,
sdtpldt0(sz10,sz00) = sz10,
inference(hyper,[status(thm)],[27,7]),
[iquote('hyper,27,7')] ).
cnf(100,plain,
sdtpldt0(sz00,sdtasdt0(sz00,sz00)) = sz00,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[71]),86,36])]),
[iquote('back_demod,71,demod,86,36,flip.1')] ).
cnf(113,plain,
sdtpldt0(sdtasdt0(sz10,xa),sdtasdt0(sz00,xa)) = sdtasdt0(sz10,xa),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,22,27,26]),86]),
[iquote('hyper,28,22,27,26,demod,86')] ).
cnf(156,plain,
sdtasdt0(sz00,sdtpldt0(sz10,xa)) = sdtpldt0(sz00,sdtasdt0(sz00,xa)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,20,26,27]),36])]),
[iquote('hyper,28,20,26,27,demod,36,flip.1')] ).
cnf(167,plain,
sdtpldt0(sdtasdt0(sz00,xa),sz00) = sdtasdt0(sz00,sdtpldt0(xa,sz10)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,20,26,27]),36]),
[iquote('hyper,28,20,26,27,demod,36')] ).
cnf(180,plain,
sdtasdt0(sz10,xa) = xa,
inference(hyper,[status(thm)],[28,18]),
[iquote('hyper,28,18')] ).
cnf(184,plain,
sdtasdt0(xa,sz00) = sdtasdt0(sz00,xa),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,15,26])]),
[iquote('hyper,28,15,26,flip.1')] ).
cnf(208,plain,
sdtpldt0(smndt0(xa),xa) = sz00,
inference(hyper,[status(thm)],[28,12]),
[iquote('hyper,28,12')] ).
cnf(214,plain,
sdtpldt0(xa,sz00) = xa,
inference(hyper,[status(thm)],[28,7]),
[iquote('hyper,28,7')] ).
cnf(216,plain,
sdtpldt0(xa,sz10) = sdtpldt0(sz10,xa),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,6,27])]),
[iquote('hyper,28,6,27,flip.1')] ).
cnf(240,plain,
aInteger0(sdtasdt0(sz00,xa)),
inference(hyper,[status(thm)],[28,3,26]),
[iquote('hyper,28,3,26')] ).
cnf(243,plain,
aInteger0(smndt0(xa)),
inference(hyper,[status(thm)],[28,1]),
[iquote('hyper,28,1')] ).
cnf(255,plain,
sdtpldt0(xa,sdtasdt0(sz00,xa)) = xa,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[113]),180,180]),
[iquote('back_demod,113,demod,180,180')] ).
cnf(268,plain,
sdtasdt0(sz00,xa) != sz00,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[24]),184]),
[iquote('back_demod,24,demod,184')] ).
cnf(280,plain,
sdtpldt0(sdtasdt0(sz00,xa),sz00) = sdtpldt0(sz00,sdtasdt0(sz00,xa)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[167]),216,156]),
[iquote('back_demod,167,demod,216,156')] ).
cnf(1579,plain,
sdtpldt0(sdtasdt0(sz00,xa),sdtasdt0(sz00,sdtasdt0(sz00,sz00))) = sdtasdt0(sdtpldt0(xa,sdtasdt0(sz00,sz00)),sz00),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[45,22,28,26]),184,38]),
[iquote('hyper,45,22,28,26,demod,184,38')] ).
cnf(1896,plain,
sdtasdt0(sz00,sz00) = sz00,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[45,9]),100])]),
[iquote('hyper,45,9,demod,100,flip.1')] ).
cnf(1928,plain,
sdtpldt0(sz00,sdtasdt0(sz00,xa)) = sdtasdt0(sz00,xa),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1579]),1896,1896,280,1896,214,184]),
[iquote('back_demod,1579,demod,1896,1896,280,1896,214,184')] ).
cnf(4075,plain,
sdtasdt0(sz00,xa) = sz00,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[240,5,243,28]),208,1928,255,208]),
[iquote('hyper,240,5,243,28,demod,208,1928,255,208')] ).
cnf(4077,plain,
$false,
inference(binary,[status(thm)],[4075,268]),
[iquote('binary,4075.1,268.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM421+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:57:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.65/1.86 ----- Otter 3.3f, August 2004 -----
% 1.65/1.86 The process was started by sandbox on n012.cluster.edu,
% 1.65/1.86 Wed Jul 27 09:57:50 2022
% 1.65/1.86 The command was "./otter". The process ID is 15718.
% 1.65/1.86
% 1.65/1.86 set(prolog_style_variables).
% 1.65/1.86 set(auto).
% 1.65/1.86 dependent: set(auto1).
% 1.65/1.86 dependent: set(process_input).
% 1.65/1.86 dependent: clear(print_kept).
% 1.65/1.86 dependent: clear(print_new_demod).
% 1.65/1.86 dependent: clear(print_back_demod).
% 1.65/1.86 dependent: clear(print_back_sub).
% 1.65/1.86 dependent: set(control_memory).
% 1.65/1.86 dependent: assign(max_mem, 12000).
% 1.65/1.86 dependent: assign(pick_given_ratio, 4).
% 1.65/1.86 dependent: assign(stats_level, 1).
% 1.65/1.86 dependent: assign(max_seconds, 10800).
% 1.65/1.86 clear(print_given).
% 1.65/1.86
% 1.65/1.86 formula_list(usable).
% 1.65/1.86 all A (A=A).
% 1.65/1.86 all W0 (aInteger0(W0)->$T).
% 1.65/1.86 aInteger0(sz00).
% 1.65/1.86 aInteger0(sz10).
% 1.65/1.86 all W0 (aInteger0(W0)->aInteger0(smndt0(W0))).
% 1.65/1.86 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtpldt0(W0,W1))).
% 1.65/1.86 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtasdt0(W0,W1))).
% 1.65/1.86 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2)).
% 1.65/1.86 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtpldt0(W0,W1)=sdtpldt0(W1,W0)).
% 1.65/1.86 all W0 (aInteger0(W0)->sdtpldt0(W0,sz00)=W0&W0=sdtpldt0(sz00,W0)).
% 1.65/1.86 all W0 (aInteger0(W0)->sdtpldt0(W0,smndt0(W0))=sz00&sz00=sdtpldt0(smndt0(W0),W0)).
% 1.65/1.86 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2)).
% 1.65/1.86 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtasdt0(W0,W1)=sdtasdt0(W1,W0)).
% 1.65/1.86 all W0 (aInteger0(W0)->sdtasdt0(W0,sz10)=W0&W0=sdtasdt0(sz10,W0)).
% 1.65/1.86 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.65/1.86 aInteger0(xa).
% 1.65/1.86 -(sdtasdt0(xa,sz00)=sz00&sz00=sdtasdt0(sz00,xa)).
% 1.65/1.86 end_of_list.
% 1.65/1.86
% 1.65/1.86 -------> usable clausifies to:
% 1.65/1.86
% 1.65/1.86 list(usable).
% 1.65/1.86 0 [] A=A.
% 1.65/1.86 0 [] -aInteger0(W0)|$T.
% 1.65/1.86 0 [] aInteger0(sz00).
% 1.65/1.86 0 [] aInteger0(sz10).
% 1.65/1.86 0 [] -aInteger0(W0)|aInteger0(smndt0(W0)).
% 1.65/1.86 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtpldt0(W0,W1)).
% 1.65/1.86 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtasdt0(W0,W1)).
% 1.65/1.86 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2).
% 1.65/1.86 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtpldt0(W0,W1)=sdtpldt0(W1,W0).
% 1.65/1.86 0 [] -aInteger0(W0)|sdtpldt0(W0,sz00)=W0.
% 1.65/1.86 0 [] -aInteger0(W0)|W0=sdtpldt0(sz00,W0).
% 1.65/1.86 0 [] -aInteger0(W0)|sdtpldt0(W0,smndt0(W0))=sz00.
% 1.65/1.86 0 [] -aInteger0(W0)|sz00=sdtpldt0(smndt0(W0),W0).
% 1.65/1.86 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2).
% 1.65/1.86 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)=sdtasdt0(W1,W0).
% 1.65/1.86 0 [] -aInteger0(W0)|sdtasdt0(W0,sz10)=W0.
% 1.65/1.86 0 [] -aInteger0(W0)|W0=sdtasdt0(sz10,W0).
% 1.65/1.86 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)).
% 1.65/1.86 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(sdtpldt0(W0,W1),W2)=sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)).
% 1.65/1.86 0 [] aInteger0(xa).
% 1.65/1.86 0 [] sdtasdt0(xa,sz00)!=sz00|sz00!=sdtasdt0(sz00,xa).
% 1.65/1.86 end_of_list.
% 1.65/1.86
% 1.65/1.86 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.65/1.86
% 1.65/1.86 This is a Horn set with equality. The strategy will be
% 1.65/1.86 Knuth-Bendix and hyper_res, with positive clauses in
% 1.65/1.86 sos and nonpositive clauses in usable.
% 1.65/1.86
% 1.65/1.86 dependent: set(knuth_bendix).
% 1.65/1.86 dependent: set(anl_eq).
% 1.65/1.86 dependent: set(para_from).
% 1.65/1.86 dependent: set(para_into).
% 1.65/1.86 dependent: clear(para_from_right).
% 1.65/1.86 dependent: clear(para_into_right).
% 1.65/1.86 dependent: set(para_from_vars).
% 1.65/1.86 dependent: set(eq_units_both_ways).
% 1.65/1.86 dependent: set(dynamic_demod_all).
% 1.65/1.86 dependent: set(dynamic_demod).
% 1.65/1.86 dependent: set(order_eq).
% 1.65/1.86 dependent: set(back_demod).
% 1.65/1.86 dependent: set(lrpo).
% 1.65/1.86 dependent: set(hyper_res).
% 1.65/1.86 dependent: clear(order_hyper).
% 1.65/1.86
% 1.65/1.86 ------------> process usable:
% 1.65/1.86 ** KEPT (pick-wt=5): 1 [] -aInteger0(A)|aInteger0(smndt0(A)).
% 1.65/1.86 ** KEPT (pick-wt=8): 2 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtpldt0(A,B)).
% 1.65/1.86 ** KEPT (pick-wt=8): 3 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtasdt0(A,B)).
% 1.65/1.86 ** 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.81/1.98 ** KEPT (pick-wt=11): 6 [] -aInteger0(A)| -aInteger0(B)|sdtpldt0(A,B)=sdtpldt0(B,A).
% 1.81/1.98 ** KEPT (pick-wt=7): 7 [] -aInteger0(A)|sdtpldt0(A,sz00)=A.
% 1.81/1.98 ** KEPT (pick-wt=7): 9 [copy,8,flip.2] -aInteger0(A)|sdtpldt0(sz00,A)=A.
% 1.81/1.98 ** KEPT (pick-wt=8): 10 [] -aInteger0(A)|sdtpldt0(A,smndt0(A))=sz00.
% 1.81/1.98 ** KEPT (pick-wt=8): 12 [copy,11,flip.2] -aInteger0(A)|sdtpldt0(smndt0(A),A)=sz00.
% 1.81/1.98 ** 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.81/1.98 ** KEPT (pick-wt=11): 15 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)=sdtasdt0(B,A).
% 1.81/1.98 ** KEPT (pick-wt=7): 16 [] -aInteger0(A)|sdtasdt0(A,sz10)=A.
% 1.81/1.98 ** KEPT (pick-wt=7): 18 [copy,17,flip.2] -aInteger0(A)|sdtasdt0(sz10,A)=A.
% 1.81/1.98 ** 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.81/1.98 ** 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.81/1.98 ** KEPT (pick-wt=10): 24 [copy,23,flip.2] sdtasdt0(xa,sz00)!=sz00|sdtasdt0(sz00,xa)!=sz00.
% 1.81/1.98
% 1.81/1.98 ------------> process sos:
% 1.81/1.98 ** KEPT (pick-wt=3): 25 [] A=A.
% 1.81/1.98 ** KEPT (pick-wt=2): 26 [] aInteger0(sz00).
% 1.81/1.98 ** KEPT (pick-wt=2): 27 [] aInteger0(sz10).
% 1.81/1.98 ** KEPT (pick-wt=2): 28 [] aInteger0(xa).
% 1.81/1.98 Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] A=A.
% 1.81/1.98
% 1.81/1.98 ======= end of input processing =======
% 1.81/1.98
% 1.81/1.98 =========== start of search ===========
% 1.81/1.98
% 1.81/1.98 -------- PROOF --------
% 1.81/1.98
% 1.81/1.98 ----> UNIT CONFLICT at 0.12 sec ----> 4077 [binary,4075.1,268.1] $F.
% 1.81/1.98
% 1.81/1.98 Length of proof is 31. Level of proof is 6.
% 1.81/1.98
% 1.81/1.98 ---------------- PROOF ----------------
% 1.81/1.98 % SZS status Theorem
% 1.81/1.98 % SZS output start Refutation
% See solution above
% 1.81/1.98 ------------ end of proof -------------
% 1.81/1.98
% 1.81/1.98
% 1.81/1.98 Search stopped by max_proofs option.
% 1.81/1.98
% 1.81/1.98
% 1.81/1.98 Search stopped by max_proofs option.
% 1.81/1.98
% 1.81/1.98 ============ end of search ============
% 1.81/1.98
% 1.81/1.98 -------------- statistics -------------
% 1.81/1.98 clauses given 13
% 1.81/1.98 clauses generated 3317
% 1.81/1.98 clauses kept 2071
% 1.81/1.98 clauses forward subsumed 2201
% 1.81/1.98 clauses back subsumed 0
% 1.81/1.98 Kbytes malloced 3906
% 1.81/1.98
% 1.81/1.98 ----------- times (seconds) -----------
% 1.81/1.98 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 1.81/1.98 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.81/1.98 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.81/1.98
% 1.81/1.98 That finishes the proof of the theorem.
% 1.81/1.98
% 1.81/1.98 Process 15718 finished Wed Jul 27 09:57:52 2022
% 1.81/1.98 Otter interrupted
% 1.81/1.98 PROOF FOUND
%------------------------------------------------------------------------------