%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : DAT377^1 : TPTP v9.2.1. Released v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n006.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 Feb 25 08:45:36 AM UTC 2026
% Result : Theorem 1.50s 1.53s
% Output : Refutation 1.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT377^1 : TPTP v9.2.1. Released v9.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/0.32 % Computer : n006.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue Feb 24 06:16:00 EST 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.32 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.42 ---- Original DTF file ---
% 0.17/0.42 thf(spec,logic,$$dhol).
% 0.17/0.42 %------------------------------------------------------------------------------
% 0.17/0.42 % File : DAT377^1 : TPTP v9.2.1. Released v9.2.0.
% 0.17/0.42 % Domain : Data Structures
% 0.17/0.42 % Problem : Associativity of list append polymorphic, base case
% 0.17/0.42 % Version : Especial.
% 0.17/0.42 % English : Associativity of append for polymorphic fixed-length lists. The
% 0.17/0.42 % problem file for the base and step case (with multiple subcases)
% 0.17/0.42 % as well as the correct instantiation of the induction axiom for
% 0.17/0.42 % lists. The main file uses the conjectures of the other files as
% 0.17/0.42 % lemmas in order to prove the final result. To simplify proof
% 0.17/0.42 % search, the axioms in each problem file have been preselected.
% 0.17/0.42
% 0.17/0.42 % Refs : [RRB23] Rothgang et al. (2023), Theorem Proving in Dependently
% 0.17/0.42 % : [Rot25] Rothgang (2025), Email to Geoff Sutcliffe
% 0.17/0.42 % : [RK+25] Ranalter et al. (2025), The Dependently Typed Higher-O
% 0.17/0.42 % Source : [Rot25]
% 0.17/0.42 % Names : ListAppAssoc/list-app-assoc-base.p [Rot25]
% 0.17/0.42
% 0.17/0.42 % Status : Theorem
% 0.17/0.42 % Rating : ? v9.2.0
% 0.17/0.42 % Syntax : Number of formulae : 12 ( 4 unt; 8 typ; 0 def)
% 0.17/0.42 % Number of atoms : 4 ( 4 equ; 0 cnn)
% 0.17/0.42 % Maximal formula atoms : 1 ( 1 avg)
% 0.17/0.42 % Number of connectives : 63 ( 0 ~; 0 |; 0 &; 63 @)
% 0.17/0.42 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.17/0.42 % Maximal formula depth : 6 ( 4 avg)
% 0.17/0.42 % Number of types : 1 ( 1 usr)
% 0.17/0.42 % Number of type decls : 8 ( 3 !>P; 2 !>D)
% 0.17/0.42 % Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% 0.17/0.42 % Number of symbols : 8 ( 7 usr; 1 con; 0-5 aty)
% 0.17/0.42 % Number of variables : 18 ( 0 ^; 12 !; 0 ?; 18 :)
% 0.17/0.42 % ( 6 !>; 0 ?*; 0 @-; 0 @+)
% 0.17/0.42 % SPC : DH1_THM_EQU_NAR
% 0.17/0.42
% 0.17/0.42 % Comments :
% 0.17/0.42 %------------------------------------------------------------------------------
% 0.17/0.42 thf(nat_type,type,
% 0.17/0.42 nat: $tType ).
% 0.17/0.42
% 0.17/0.42 thf(zero_type,type,
% 0.17/0.42 zero: nat ).
% 0.17/0.42
% 0.17/0.42 thf(suc_type,type,
% 0.17/0.42 suc: nat > nat ).
% 0.17/0.42
% 0.17/0.42 thf(plus_type,type,
% 0.17/0.42 plus: nat > nat > nat ).
% 0.17/0.42
% 0.17/0.42 thf(list_type,type,
% 0.17/0.42 list: $tType > nat > $tType ).
% 0.17/0.42
% 0.17/0.42 thf(nil_type,type,
% 0.17/0.42 nil:
% 0.17/0.42 !>[A: $tType] : ( list @ A @ zero ) ).
% 0.17/0.42
% 0.17/0.42 thf(cons_type,type,
% 0.17/0.42 cons:
% 0.17/0.42 !>[A: $tType,N: nat] : ( A > ( list @ A @ N ) > ( list @ A @ ( suc @ N ) ) ) ).
% 0.17/0.42
% 0.17/0.42 thf(app_type,type,
% 0.17/0.42 app:
% 0.17/0.42 !>[A: $tType,N: nat,M: nat] : ( ( list @ A @ N ) > ( list @ A @ M ) > ( list @ A @ ( plus @ N @ M ) ) ) ).
% 0.17/0.42
% 0.17/0.42 thf(ax1,axiom,
% 0.17/0.42 ! [N: nat] :
% 0.17/0.42 ( ( plus @ zero @ N )
% 0.17/0.42 = N ) ).
% 0.17/0.42
% 0.17/0.42 thf(ax3,axiom,
% 0.17/0.42 ! [A: $tType,N: nat,X: list @ A @ N] :
% 0.17/0.42 ( ( app @ A @ zero @ N @ ( nil @ A ) @ X )
% 0.17/0.42 = X ) ).
% 0.17/0.42
% 0.17/0.42 thf(plus_assoc,axiom,
% 0.17/0.42 ! [M1: nat,M2: nat,M3: nat] :
% 0.17/0.42 ( ( plus @ M1 @ ( plus @ M2 @ M3 ) )
% 0.17/0.42 = ( plus @ ( plus @ M1 @ M2 ) @ M3 ) ) ).
% 0.17/0.42
% 0.17/0.42 thf(list_app_assoc_base,conjecture,
% 0.17/0.42 ! [A: $tType,M2: nat,L2: list @ A @ M2,M3: nat,L3: list @ A @ M3] :
% 0.17/0.42 ( ( app @ A @ zero @ ( plus @ M2 @ M3 ) @ ( nil @ A ) @ ( app @ A @ M2 @ M3 @ L2 @ L3 ) )
% 0.17/0.42 = ( app @ A @ ( plus @ zero @ M2 ) @ M3 @ ( app @ A @ zero @ M2 @ ( nil @ A ) @ L2 ) @ L3 ) ) ).
% 0.17/0.42
% 0.17/0.42 %------------------------------------------------------------------------------
% 0.17/0.42 ------------------------
% 1.39/1.18 ---- Embedded in THF ---
% 1.39/1.18 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.39/1.18 %%% Generated on Tue Feb 24 06:16:01 EST 2026
% 1.39/1.18 %%% using '$$dhol' embedding, version 1.3.0.
% 1.39/1.18 %%% Logic specification used:
% 1.39/1.18 %%% thf(spec, logic, $$dhol).
% 1.39/1.18
% 1.39/1.18 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.kjTqZzoipf/DTF2DTF11348.p
% 1.39/1.18 thf(is_per_type, type, isPer: (!> [A:$tType]: (((A > (A > $o)) > $o)))).
% 1.39/1.18 thf(is_per, definition, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) <=> ((! [X:A,Y:A]: ((((AStar @ X) @ Y) => ((AStar @ Y) @ X)))) & (! [X:A,Y:A,Z:A]: ((((AStar @ X) @ Y) => (((AStar @ Y) @ Z) => ((AStar @ X) @ Z)))))))))).
% 1.39/1.18 thf(nat_type, type, nat: $tType).
% 1.39/1.18 thf(natStar, type, 'natStar': (nat > (nat > $o))).
% 1.39/1.18 thf(natStar_is_eq, axiom, (! [X:nat,Y:nat]: (((('natStar' @ X) @ Y) <=> (X = Y))))).
% 1.39/1.18 thf(zero_type, type, zero: nat).
% 1.39/1.18 thf(suc_type, type, suc: (nat > nat)).
% 1.39/1.18 thf(plus_type, type, plus: (nat > (nat > nat))).
% 1.39/1.18 thf(list_type, type, list: ($tType > $tType)).
% 1.39/1.18 thf(listStar, type, 'listStar': (!> [A:$tType]: (((A > (A > $o)) > (nat > ((list @ A) > ((list @ A) > $o))))))).
% 1.39/1.18 thf('\'listStar\'_is_per', axiom, (! [B:$tType,BStar:(B > (B > $o))]: ((((isPer @ B) @ BStar) => (! [C:nat]: (((isPer @ (list @ B)) @ (((listStar @ B) @ BStar) @ C)))))))).
% 1.39/1.18 thf(nil_type, type, nil: (!> [A:$tType]: ((list @ A)))).
% 1.39/1.18 thf(nil_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (((((listStar @ A) @ AStar) @ zero) @ (nil @ A)) @ (nil @ A)))))).
% 1.39/1.18 thf(cons_type, type, cons: (!> [A:$tType]: ((nat > (A > ((list @ A) > (list @ A))))))).
% 1.39/1.18 thf(cons_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [D:A,D_prime:A]: (((D = D_prime) => (! [D0:(list @ A),D0_prime:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ D0) @ D0_prime) => (((((listStar @ A) @ AStar) @ (suc @ N)) @ ((((cons @ A) @ N) @ D) @ D0)) @ ((((cons @ A) @ N) @ D_prime) @ D0_prime)))))))))))))).
% 1.39/1.18 thf(app_type, type, app: (!> [A:$tType]: ((nat > (nat > ((list @ A) > ((list @ A) > (list @ A)))))))).
% 1.39/1.18 thf(app_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [M:nat]: ((! [D:(list @ A),D_prime:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ D) @ D_prime) => (! [D0:(list @ A),D0_prime:(list @ A)]: (((((((listStar @ A) @ AStar) @ M) @ D0) @ D0_prime) => (((((listStar @ A) @ AStar) @ ((plus @ N) @ M)) @ (((((app @ A) @ N) @ M) @ D) @ D0)) @ (((((app @ A) @ N) @ M) @ D_prime) @ D0_prime)))))))))))))))).
% 1.39/1.18 thf(ax1, axiom, (! [N:nat]: ((((plus @ zero) @ N) = N)))).
% 1.39/1.18 thf(ax3, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [X:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ X) @ X) => (((((listStar @ A) @ AStar) @ ((plus @ zero) @ N)) @ (((((app @ A) @ zero) @ N) @ (nil @ A)) @ X)) @ X)))))))))).
% 1.39/1.18 thf(plus_assoc, axiom, (! [M1:nat]: ((! [M2:nat]: ((! [M3:nat]: ((((plus @ M1) @ ((plus @ M2) @ M3)) = ((plus @ ((plus @ M1) @ M2)) @ M3))))))))).
% 1.39/1.18 thf(list_app_assoc_base, conjecture, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [M2:nat]: ((! [L2:(list @ A),M3:nat,L3:(list @ A)]: (((((((listStar @ A) @ AStar) @ M2) @ L2) @ L2) => ((((((listStar @ A) @ AStar) @ M3) @ L3) @ L3) => (((((listStar @ A) @ AStar) @ ((plus @ zero) @ ((plus @ M2) @ M3))) @ (((((app @ A) @ zero) @ ((plus @ M2) @ M3)) @ (nil @ A)) @ (((((app @ A) @ M2) @ M3) @ L2) @ L3))) @ (((((app @ A) @ ((plus @ zero) @ M2)) @ M3) @ (((((app @ A) @ zero) @ M2) @ (nil @ A)) @ L2)) @ L3)))))))))))).
% 1.39/1.18 % SZS output end ListOfTHF for /export/starexec/sandbox2/tmp/tmp.kjTqZzoipf/DTF2DTF11348.p
% 1.39/1.18 ------------------------
% 1.39/1.19 ---- Cleaned THF ---
% 1.39/1.19 thf(is_per_type,type,
% 1.39/1.19 isPer:
% 1.39/1.19 !>[A: $tType] : ( ( A > A > $o ) > $o ) ).
% 1.39/1.19
% 1.39/1.19 thf(is_per,definition,
% 1.39/1.19 ! [A: $tType,AStar: A > A > $o] :
% 1.39/1.19 ( ( isPer @ A @ AStar )
% 1.39/1.19 <=> ( ! [X: A,Y: A] :
% 1.39/1.19 ( ( AStar @ X @ Y )
% 1.39/1.19 => ( AStar @ Y @ X ) )
% 1.39/1.19 & ! [X: A,Y: A,Z: A] :
% 1.39/1.19 ( ( AStar @ X @ Y )
% 1.39/1.19 => ( ( AStar @ Y @ Z )
% 1.39/1.19 => ( AStar @ X @ Z ) ) ) ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(nat_type,type,
% 1.39/1.19 nat: $tType ).
% 1.39/1.19
% 1.39/1.19 thf(natStar,type,
% 1.39/1.19 natStar: nat > nat > $o ).
% 1.39/1.19
% 1.39/1.19 thf(natStar_is_eq,axiom,
% 1.39/1.19 ! [X: nat,Y: nat] :
% 1.39/1.19 ( ( natStar @ X @ Y )
% 1.39/1.19 <=> ( X = Y ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(zero_type,type,
% 1.39/1.19 zero: nat ).
% 1.39/1.19
% 1.39/1.19 thf(suc_type,type,
% 1.39/1.19 suc: nat > nat ).
% 1.39/1.19
% 1.39/1.19 thf(plus_type,type,
% 1.39/1.19 plus: nat > nat > nat ).
% 1.39/1.19
% 1.39/1.19 thf(list_type,type,
% 1.39/1.19 list: $tType > $tType ).
% 1.39/1.19
% 1.39/1.19 thf(listStar,type,
% 1.39/1.19 listStar:
% 1.39/1.19 !>[A: $tType] : ( ( A > A > $o ) > nat > ( list @ A ) > ( list @ A ) > $o ) ).
% 1.39/1.19
% 1.39/1.19 thf('\'listStar\'_is_per',axiom,
% 1.39/1.19 ! [B: $tType,BStar: B > B > $o] :
% 1.39/1.19 ( ( isPer @ B @ BStar )
% 1.39/1.19 => ! [C: nat] : ( isPer @ ( list @ B ) @ ( listStar @ B @ BStar @ C ) ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(nil_type,type,
% 1.39/1.19 nil:
% 1.39/1.19 !>[A: $tType] : ( list @ A ) ).
% 1.39/1.19
% 1.39/1.19 thf(nil_tp_ax,axiom,
% 1.39/1.19 ! [A: $tType,AStar: A > A > $o] :
% 1.39/1.19 ( ( isPer @ A @ AStar )
% 1.39/1.19 => ( listStar @ A @ AStar @ zero @ ( nil @ A ) @ ( nil @ A ) ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(cons_type,type,
% 1.39/1.19 cons:
% 1.39/1.19 !>[A: $tType] : ( nat > A > ( list @ A ) > ( list @ A ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(cons_tp_ax,axiom,
% 1.39/1.19 ! [A: $tType,AStar: A > A > $o] :
% 1.39/1.19 ( ( isPer @ A @ AStar )
% 1.39/1.19 => ! [N: nat,D: A,D_prime: A] :
% 1.39/1.19 ( ( D = D_prime )
% 1.39/1.19 => ! [D0: list @ A,D0_prime: list @ A] :
% 1.39/1.19 ( ( listStar @ A @ AStar @ N @ D0 @ D0_prime )
% 1.39/1.19 => ( listStar @ A @ AStar @ ( suc @ N ) @ ( cons @ A @ N @ D @ D0 ) @ ( cons @ A @ N @ D_prime @ D0_prime ) ) ) ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(app_type,type,
% 1.39/1.19 app:
% 1.39/1.19 !>[A: $tType] : ( nat > nat > ( list @ A ) > ( list @ A ) > ( list @ A ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(app_tp_ax,axiom,
% 1.39/1.19 ! [A: $tType,AStar: A > A > $o] :
% 1.39/1.19 ( ( isPer @ A @ AStar )
% 1.39/1.19 => ! [N: nat,M: nat,D: list @ A,D_prime: list @ A] :
% 1.39/1.19 ( ( listStar @ A @ AStar @ N @ D @ D_prime )
% 1.39/1.19 => ! [D0: list @ A,D0_prime: list @ A] :
% 1.39/1.19 ( ( listStar @ A @ AStar @ M @ D0 @ D0_prime )
% 1.39/1.19 => ( listStar @ A @ AStar @ ( plus @ N @ M ) @ ( app @ A @ N @ M @ D @ D0 ) @ ( app @ A @ N @ M @ D_prime @ D0_prime ) ) ) ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(ax1,axiom,
% 1.39/1.19 ! [N: nat] :
% 1.39/1.19 ( ( plus @ zero @ N )
% 1.39/1.19 = N ) ).
% 1.39/1.19
% 1.39/1.19 thf(ax3,axiom,
% 1.39/1.19 ! [A: $tType,AStar: A > A > $o] :
% 1.39/1.19 ( ( isPer @ A @ AStar )
% 1.39/1.19 => ! [N: nat,X: list @ A] :
% 1.39/1.19 ( ( listStar @ A @ AStar @ N @ X @ X )
% 1.39/1.19 => ( listStar @ A @ AStar @ ( plus @ zero @ N ) @ ( app @ A @ zero @ N @ ( nil @ A ) @ X ) @ X ) ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(plus_assoc,axiom,
% 1.39/1.19 ! [M1: nat,M2: nat,M3: nat] :
% 1.39/1.19 ( ( plus @ M1 @ ( plus @ M2 @ M3 ) )
% 1.39/1.19 = ( plus @ ( plus @ M1 @ M2 ) @ M3 ) ) ).
% 1.39/1.19
% 1.39/1.19 thf(list_app_assoc_base,conjecture,
% 1.39/1.19 ! [A: $tType,AStar: A > A > $o] :
% 1.39/1.19 ( ( isPer @ A @ AStar )
% 1.39/1.19 => ! [M2: nat,L2: list @ A,M3: nat,L3: list @ A] :
% 1.39/1.19 ( ( listStar @ A @ AStar @ M2 @ L2 @ L2 )
% 1.39/1.19 => ( ( listStar @ A @ AStar @ M3 @ L3 @ L3 )
% 1.39/1.19 => ( listStar @ A @ AStar @ ( plus @ zero @ ( plus @ M2 @ M3 ) ) @ ( app @ A @ zero @ ( plus @ M2 @ M3 ) @ ( nil @ A ) @ ( app @ A @ M2 @ M3 @ L2 @ L3 ) ) @ ( app @ A @ ( plus @ zero @ M2 ) @ M3 @ ( app @ A @ zero @ M2 @ ( nil @ A ) @ L2 ) @ L3 ) ) ) ) ) ).
% 1.39/1.19 ------------------------
% 1.50/1.20 % (11449)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/183Mi)
% 1.50/1.21 % (11451)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/27Mi)
% 1.50/1.21 % (11452)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/2Mi)
% 1.50/1.21 % (11455)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/18Mi)
% 1.50/1.21 % (11454)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/275Mi)
% 1.50/1.21 % (11453)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/2Mi)
% 1.50/1.21 % (11450)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/4Mi)
% 1.50/1.21 % (11452)Instruction limit reached!
% 1.50/1.21 % (11452)------------------------------
% 1.50/1.21 % (11452)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.21 % (11452)Termination reason: Unknown
% 1.50/1.21 % (11452)Termination phase: shuffling
% 1.50/1.21
% 1.50/1.21 % (11452)Memory used [KB]: 1023
% 1.50/1.21 % (11452)Time elapsed: 0.002 s
% 1.50/1.21 % (11452)Instructions burned: 2 (million)
% 1.50/1.21 % (11452)------------------------------
% 1.50/1.21 % (11452)------------------------------
% 1.50/1.21 % Exception at run slice level
% 1.50/1.21 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.21 % (11450)Instruction limit reached!
% 1.50/1.21 % (11450)------------------------------
% 1.50/1.21 % (11450)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.21 % (11450)Termination reason: Unknown
% 1.50/1.21 % (11450)Termination phase: Property scanning
% 1.50/1.21
% 1.50/1.21 % (11450)Memory used [KB]: 1023
% 1.50/1.21 % (11450)Time elapsed: 0.003 s
% 1.50/1.21 % (11450)Instructions burned: 4 (million)
% 1.50/1.21 % (11450)------------------------------
% 1.50/1.21 % (11450)------------------------------
% 1.50/1.22 % (11455)Instruction limit reached!
% 1.50/1.22 % (11455)------------------------------
% 1.50/1.22 % (11455)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.22 % (11455)Termination reason: Unknown
% 1.50/1.22 % (11455)Termination phase: Saturation
% 1.50/1.22
% 1.50/1.22 % (11455)Memory used [KB]: 5628
% 1.50/1.22 % (11455)Time elapsed: 0.010 s
% 1.50/1.22 % (11455)Instructions burned: 18 (million)
% 1.50/1.22 % (11455)------------------------------
% 1.50/1.22 % (11455)------------------------------
% 1.50/1.22 % (11451)Instruction limit reached!
% 1.50/1.22 % (11451)------------------------------
% 1.50/1.22 % (11451)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.22 % (11451)Termination reason: Unknown
% 1.50/1.22 % (11451)Termination phase: Saturation
% 1.50/1.22
% 1.50/1.22 % (11451)Memory used [KB]: 5756
% 1.50/1.22 % (11451)Time elapsed: 0.015 s
% 1.50/1.22 % (11451)Instructions burned: 27 (million)
% 1.50/1.22 % (11451)------------------------------
% 1.50/1.22 % (11451)------------------------------
% 1.50/1.22 % (11456)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/3Mi)
% 1.50/1.23 % (11457)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/37Mi)
% 1.50/1.23 % (11458)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/15Mi)
% 1.50/1.23 % Exception at run slice level
% 1.50/1.23 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.23 % (11456)Instruction limit reached!
% 1.50/1.23 % (11456)------------------------------
% 1.50/1.23 % (11456)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.23 % (11456)Termination reason: Unknown
% 1.50/1.23 % (11456)Termination phase: Preprocessing 3
% 1.50/1.23
% 1.50/1.23 % (11456)Memory used [KB]: 1023
% 1.50/1.23 % (11456)Time elapsed: 0.003 s
% 1.50/1.23 % (11456)Instructions burned: 4 (million)
% 1.50/1.23 % (11456)------------------------------
% 1.50/1.23 % (11456)------------------------------
% 1.50/1.23 % (11459)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/3Mi)
% 1.50/1.23 % (11458)Instruction limit reached!
% 1.50/1.23 % (11458)------------------------------
% 1.50/1.23 % (11458)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.23 % (11458)Termination reason: Unknown
% 1.50/1.23 % (11458)Termination phase: Saturation
% 1.50/1.23
% 1.50/1.23 % (11458)Memory used [KB]: 5756
% 1.50/1.23 % (11458)Time elapsed: 0.009 s
% 1.50/1.23 % (11458)Instructions burned: 15 (million)
% 1.50/1.23 % (11458)------------------------------
% 1.50/1.23 % (11458)------------------------------
% 1.50/1.23 % (11459)Instruction limit reached!
% 1.50/1.23 % (11459)------------------------------
% 1.50/1.23 % (11459)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.23 % (11459)Termination reason: Unknown
% 1.50/1.23 % (11459)Termination phase: Preprocessing 3
% 1.50/1.23
% 1.50/1.23 % (11459)Memory used [KB]: 1023
% 1.50/1.23 % (11459)Time elapsed: 0.003 s
% 1.50/1.23 % (11459)Instructions burned: 4 (million)
% 1.50/1.23 % (11459)------------------------------
% 1.50/1.23 % (11459)------------------------------
% 1.50/1.24 % (11460)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/1041Mi)
% 1.50/1.24 % Exception at run slice level
% 1.50/1.24 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.24 % (11461)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/7Mi)
% 1.50/1.24 % (11462)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/16Mi)
% 1.50/1.25 % (11461)Instruction limit reached!
% 1.50/1.25 % (11461)------------------------------
% 1.50/1.25 % (11461)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.25 % (11461)Termination reason: Unknown
% 1.50/1.25 % (11461)Termination phase: Saturation
% 1.50/1.25
% 1.50/1.25 % (11461)Memory used [KB]: 1023
% 1.50/1.25 % (11461)Time elapsed: 0.005 s
% 1.50/1.25 % (11461)Instructions burned: 8 (million)
% 1.50/1.25 % (11461)------------------------------
% 1.50/1.25 % (11461)------------------------------
% 1.50/1.25 % (11463)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/3Mi)
% 1.50/1.25 % (11462)Instruction limit reached!
% 1.50/1.25 % (11462)------------------------------
% 1.50/1.25 % (11462)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.25 % (11462)Termination reason: Unknown
% 1.50/1.25 % (11462)Termination phase: Saturation
% 1.50/1.25
% 1.50/1.25 % (11462)Memory used [KB]: 5628
% 1.50/1.25 % (11462)Time elapsed: 0.009 s
% 1.50/1.25 % (11462)Instructions burned: 16 (million)
% 1.50/1.25 % (11462)------------------------------
% 1.50/1.25 % (11462)------------------------------
% 1.50/1.25 % (11464)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/3Mi)
% 1.50/1.25 % (11463)Instruction limit reached!
% 1.50/1.25 % (11463)------------------------------
% 1.50/1.25 % (11463)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.25 % (11463)Termination reason: Unknown
% 1.50/1.25 % (11463)Termination phase: Preprocessing 1
% 1.50/1.25
% 1.50/1.25 % (11463)Memory used [KB]: 1023
% 1.50/1.25 % (11463)Time elapsed: 0.003 s
% 1.50/1.25 % (11463)Instructions burned: 4 (million)
% 1.50/1.25 % (11463)------------------------------
% 1.50/1.25 % (11463)------------------------------
% 1.50/1.25 % (11464)Instruction limit reached!
% 1.50/1.25 % (11464)------------------------------
% 1.50/1.25 % (11464)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.25 % (11464)Termination reason: Unknown
% 1.50/1.25 % (11464)Termination phase: Preprocessing 3
% 1.50/1.25
% 1.50/1.25 % (11464)Memory used [KB]: 1023
% 1.50/1.25 % (11464)Time elapsed: 0.003 s
% 1.50/1.25 % (11464)Instructions burned: 4 (million)
% 1.50/1.25 % (11464)------------------------------
% 1.50/1.25 % (11464)------------------------------
% 1.50/1.25 % (11449)Instruction limit reached!
% 1.50/1.25 % (11449)------------------------------
% 1.50/1.25 % (11449)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.25 % (11449)Termination reason: Unknown
% 1.50/1.25 % (11449)Termination phase: Saturation
% 1.50/1.25
% 1.50/1.25 % (11449)Memory used [KB]: 7164
% 1.50/1.25 % (11449)Time elapsed: 0.052 s
% 1.50/1.25 % (11449)Instructions burned: 185 (million)
% 1.50/1.25 % (11449)------------------------------
% 1.50/1.25 % (11449)------------------------------
% 1.50/1.25 % (11465)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/7Mi)
% 1.50/1.26 % (11465)Instruction limit reached!
% 1.50/1.26 % (11465)------------------------------
% 1.50/1.26 % (11465)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.26 % (11465)Termination reason: Unknown
% 1.50/1.26 % (11465)Termination phase: Saturation
% 1.50/1.26
% 1.50/1.26 % (11465)Memory used [KB]: 5500
% 1.50/1.26 % (11465)Time elapsed: 0.005 s
% 1.50/1.26 % (11465)Instructions burned: 8 (million)
% 1.50/1.26 % (11465)------------------------------
% 1.50/1.26 % (11465)------------------------------
% 1.50/1.26 % (11466)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/3Mi)
% 1.50/1.26 % (11470)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/6Mi)
% 1.50/1.26 % Exception at run slice level
% 1.50/1.26 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.26 % (11470)Instruction limit reached!
% 1.50/1.26 % (11470)------------------------------
% 1.50/1.26 % (11470)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.26 % (11470)Termination reason: Unknown
% 1.50/1.26 % (11470)Termination phase: Property scanning
% 1.50/1.26
% 1.50/1.26 % (11470)Memory used [KB]: 1023
% 1.50/1.26 % (11470)Time elapsed: 0.003 s
% 1.50/1.26 % (11470)Instructions burned: 7 (million)
% 1.50/1.26 % (11470)------------------------------
% 1.50/1.26 % (11470)------------------------------
% 1.50/1.27 % (11467)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/4Mi)
% 1.50/1.27 % (11468)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/18Mi)
% 1.50/1.27 % (11467)Instruction limit reached!
% 1.50/1.27 % (11467)------------------------------
% 1.50/1.27 % (11467)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.27 % (11467)Termination reason: Unknown
% 1.50/1.27 % (11467)Termination phase: Preprocessing 3
% 1.50/1.27
% 1.50/1.27 % (11467)Memory used [KB]: 1023
% 1.50/1.27 % (11467)Time elapsed: 0.003 s
% 1.50/1.27 % (11467)Instructions burned: 4 (million)
% 1.50/1.27 % (11467)------------------------------
% 1.50/1.27 % (11467)------------------------------
% 1.50/1.27 % (11469)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/710Mi)
% 1.50/1.27 % (11473)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/5Mi)
% 1.50/1.27 % Exception at run slice level
% 1.50/1.27 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.27 % (11471)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/902Mi)
% 1.50/1.28 % (11468)Instruction limit reached!
% 1.50/1.28 % (11468)------------------------------
% 1.50/1.28 % (11468)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.28 % (11468)Termination reason: Unknown
% 1.50/1.28 % (11468)Termination phase: Saturation
% 1.50/1.28
% 1.50/1.28 % (11468)Memory used [KB]: 5628
% 1.50/1.28 % (11468)Time elapsed: 0.010 s
% 1.50/1.28 % (11468)Instructions burned: 18 (million)
% 1.50/1.28 % (11468)------------------------------
% 1.50/1.28 % (11468)------------------------------
% 1.50/1.28 % (11472)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/21Mi)
% 1.50/1.28 % (11475)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/377Mi)
% 1.50/1.28 % (11474)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/6Mi)
% 1.50/1.28 % Exception at run slice level
% 1.50/1.28 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.29 % (11472)Instruction limit reached!
% 1.50/1.29 % (11472)------------------------------
% 1.50/1.29 % (11472)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.29 % (11472)Termination reason: Unknown
% 1.50/1.29 % (11472)Termination phase: Saturation
% 1.50/1.29
% 1.50/1.29 % (11472)Memory used [KB]: 5628
% 1.50/1.29 % (11472)Time elapsed: 0.013 s
% 1.50/1.29 % (11472)Instructions burned: 22 (million)
% 1.50/1.29 % (11472)------------------------------
% 1.50/1.29 % (11472)------------------------------
% 1.50/1.29 % (11476)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/779Mi)
% 1.50/1.29 % Exception at run slice level
% 1.50/1.29 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.30 % (11477)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/19Mi)
% 1.50/1.30 % Exception at run slice level
% 1.50/1.30 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.31 % (11478)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/879Mi)
% 1.50/1.31 % (11479)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/17Mi)
% 1.50/1.32 % (11454)Instruction limit reached!
% 1.50/1.32 % (11454)------------------------------
% 1.50/1.32 % (11454)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.32 % (11454)Termination reason: Unknown
% 1.50/1.32 % (11454)Termination phase: Saturation
% 1.50/1.32
% 1.50/1.32 % (11454)Memory used [KB]: 5756
% 1.50/1.32 % (11454)Time elapsed: 0.109 s
% 1.50/1.32 % (11454)Instructions burned: 276 (million)
% 1.50/1.32 % (11454)------------------------------
% 1.50/1.32 % (11454)------------------------------
% 1.50/1.32 % (11480)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_11348 for (2999ds/3Mi)
% 1.50/1.32 % (11479)Instruction limit reached!
% 1.50/1.32 % (11479)------------------------------
% 1.50/1.32 % (11479)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.32 % (11479)Termination reason: Unknown
% 1.50/1.32 % (11479)Termination phase: Saturation
% 1.50/1.32
% 1.50/1.32 % (11479)Memory used [KB]: 5756
% 1.50/1.32 % (11479)Time elapsed: 0.010 s
% 1.50/1.32 % (11479)Instructions burned: 17 (million)
% 1.50/1.32 % (11479)------------------------------
% 1.50/1.32 % (11479)------------------------------
% 1.50/1.32 % (11480)Instruction limit reached!
% 1.50/1.32 % (11480)------------------------------
% 1.50/1.32 % (11480)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.32 % (11480)Termination reason: Unknown
% 1.50/1.32 % (11480)Termination phase: Preprocessing 3
% 1.50/1.32
% 1.50/1.32 % (11480)Memory used [KB]: 1023
% 1.50/1.32 % (11480)Time elapsed: 0.003 s
% 1.50/1.32 % (11480)Instructions burned: 4 (million)
% 1.50/1.32 % (11480)------------------------------
% 1.50/1.32 % (11480)------------------------------
% 1.50/1.33 % (11481)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_11348 for (2998ds/30Mi)
% 1.50/1.33 % (11482)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_11348 for (2998ds/127Mi)
% 1.50/1.33 % (11483)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on DTF2THF_11348 for (2998ds/100Mi)
% 1.50/1.35 % (11481)Instruction limit reached!
% 1.50/1.35 % (11481)------------------------------
% 1.50/1.35 % (11481)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.35 % (11481)Termination reason: Unknown
% 1.50/1.35 % (11481)Termination phase: Saturation
% 1.50/1.35
% 1.50/1.35 % (11481)Memory used [KB]: 5756
% 1.50/1.35 % (11481)Time elapsed: 0.037 s
% 1.50/1.35 % (11481)Instructions burned: 30 (million)
% 1.50/1.35 % (11481)------------------------------
% 1.50/1.35 % (11481)------------------------------
% 1.50/1.36 % (11485)dis+10_1:1_anc=none:cnfonf=lazy_gen:fd=preordered:fe=off:hud=10:ins=3:ixr=off:nwc=5.0:plsq=on:plsqc=1:plsqr=32,1:sp=const_frequency:uhcvi=on:i=3:si=on:rtra=on_0 on DTF2THF_11348 for (2998ds/3Mi)
% 1.50/1.36 % Exception at run slice level
% 1.50/1.36 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.38 % (11486)lrs+10_8:1_au=on:avsq=on:e2e=on:ins=3:s2a=on:s2at=3.0:ss=axioms:i=20:si=on:rtra=on_0 on DTF2THF_11348 for (2998ds/20Mi)
% 1.50/1.38 % (11483)Instruction limit reached!
% 1.50/1.38 % (11483)------------------------------
% 1.50/1.38 % (11483)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.38 % (11483)Termination reason: Unknown
% 1.50/1.38 % (11483)Termination phase: Saturation
% 1.50/1.38
% 1.50/1.38 % (11483)Memory used [KB]: 6012
% 1.50/1.38 % (11483)Time elapsed: 0.072 s
% 1.50/1.38 % (11483)Instructions burned: 100 (million)
% 1.50/1.38 % (11483)------------------------------
% 1.50/1.38 % (11483)------------------------------
% 1.50/1.39 % (11486)Instruction limit reached!
% 1.50/1.39 % (11486)------------------------------
% 1.50/1.39 % (11486)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.39 % (11486)Termination reason: Unknown
% 1.50/1.39 % (11486)Termination phase: Saturation
% 1.50/1.39
% 1.50/1.39 % (11486)Memory used [KB]: 5628
% 1.50/1.39 % (11486)Time elapsed: 0.012 s
% 1.50/1.39 % (11486)Instructions burned: 21 (million)
% 1.50/1.39 % (11486)------------------------------
% 1.50/1.39 % (11486)------------------------------
% 1.50/1.39 % (11482)Instruction limit reached!
% 1.50/1.39 % (11482)------------------------------
% 1.50/1.39 % (11482)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.39 % (11482)Termination reason: Unknown
% 1.50/1.39 % (11482)Termination phase: Saturation
% 1.50/1.39
% 1.50/1.39 % (11482)Memory used [KB]: 6268
% 1.50/1.39 % (11482)Time elapsed: 0.082 s
% 1.50/1.39 % (11482)Instructions burned: 127 (million)
% 1.50/1.39 % (11482)------------------------------
% 1.50/1.39 % (11482)------------------------------
% 1.50/1.40 % (11487)dis+1002_1:1_cbe=off:hud=5:nm=4:plsq=on:plsqr=7,1:prag=on:sp=const_max:tnu=1:i=86:si=on:rtra=on_0 on DTF2THF_11348 for (2998ds/86Mi)
% 1.50/1.41 % (11488)lrs+1010_1:1_au=on:cbe=off:nm=2:ntd=on:sd=2:ss=axioms:st=5.0:i=107:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/107Mi)
% 1.50/1.41 % (11489)lrs+2_1:1024_cnfonf=lazy_gen:fe=off:hud=15:plsq=on:plsqc=1:plsqr=32,1:i=39:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/39Mi)
% 1.50/1.41 % Exception at run slice level
% 1.50/1.41 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.42 % (11475)Instruction limit reached!
% 1.50/1.42 % (11475)------------------------------
% 1.50/1.42 % (11475)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.42 % (11475)Termination reason: Unknown
% 1.50/1.42 % (11475)Termination phase: Saturation
% 1.50/1.42
% 1.50/1.42 % (11475)Memory used [KB]: 6268
% 1.50/1.42 % (11475)Time elapsed: 0.135 s
% 1.50/1.42 % (11475)Instructions burned: 378 (million)
% 1.50/1.42 % (11475)------------------------------
% 1.50/1.42 % (11475)------------------------------
% 1.50/1.42 % (11490)dis+10_1:1_cnfonf=lazy_not_gen:fsr=off:kws=precedence:nwc=5.0:s2a=on:ss=axioms:st=1.5:i=448:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/448Mi)
% 1.50/1.42 % Exception at run slice level
% 1.50/1.42 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.43 % (11491)lrs+10_1:512_au=on:fde=unused:lma=on:nm=32:plsq=on:plsqc=1:plsqr=16121663,131072:sfv=off:sp=const_max:ss=axioms:st=3.0:tgt=full:i=46:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/46Mi)
% 1.50/1.44 % (11487)Instruction limit reached!
% 1.50/1.44 % (11487)------------------------------
% 1.50/1.44 % (11487)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.44 % (11487)Termination reason: Unknown
% 1.50/1.44 % (11487)Termination phase: Saturation
% 1.50/1.44
% 1.50/1.44 % (11487)Memory used [KB]: 6268
% 1.50/1.44 % (11487)Time elapsed: 0.043 s
% 1.50/1.44 % (11487)Instructions burned: 86 (million)
% 1.50/1.44 % (11487)------------------------------
% 1.50/1.44 % (11487)------------------------------
% 1.50/1.44 % (11492)lrs+10_1:10_au=on:av=off:cbe=off:cnfonf=lazy_pi_sigma_gen:ntd=on:plsq=on:plsqc=1:plsqr=32,1:i=98:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/98Mi)
% 1.50/1.44 % Exception at run slice level
% 1.50/1.44 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.44 % (11491)Instruction limit reached!
% 1.50/1.44 % (11491)------------------------------
% 1.50/1.44 % (11491)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.44 % (11491)Termination reason: Unknown
% 1.50/1.44 % (11491)Termination phase: Saturation
% 1.50/1.44
% 1.50/1.44 % (11491)Memory used [KB]: 5756
% 1.50/1.44 % (11491)Time elapsed: 0.016 s
% 1.50/1.44 % (11491)Instructions burned: 48 (million)
% 1.50/1.44 % (11491)------------------------------
% 1.50/1.44 % (11491)------------------------------
% 1.50/1.45 % (11495)lrs+21_1:16_au=on:bd=off:piset=and:i=39:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/39Mi)
% 1.50/1.46 % (11493)ott+1002_1:1_apa=on:au=on:bd=off:cnfonf=off:fd=off:sos=on:sp=weighted_frequency:i=507:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/507Mi)
% 1.50/1.46 % (11494)dis+1010_2:3_amm=off:fd=preordered:ixr=off:nm=0:pe=on:piset=equals:prag=on:sac=on:tgt=ground:i=149:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/149Mi)
% 1.50/1.46 % (11488)Instruction limit reached!
% 1.50/1.46 % (11488)------------------------------
% 1.50/1.46 % (11488)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.46 % (11488)Termination reason: Unknown
% 1.50/1.46 % (11488)Termination phase: Saturation
% 1.50/1.46
% 1.50/1.46 % (11488)Memory used [KB]: 6140
% 1.50/1.46 % (11488)Time elapsed: 0.053 s
% 1.50/1.46 % (11488)Instructions burned: 107 (million)
% 1.50/1.46 % (11488)------------------------------
% 1.50/1.46 % (11488)------------------------------
% 1.50/1.46 % (11495)Instruction limit reached!
% 1.50/1.46 % (11495)------------------------------
% 1.50/1.46 % (11495)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.46 % (11495)Termination reason: Unknown
% 1.50/1.46 % (11495)Termination phase: Saturation
% 1.50/1.46
% 1.50/1.46 % (11495)Memory used [KB]: 5756
% 1.50/1.46 % (11495)Time elapsed: 0.013 s
% 1.50/1.46 % (11495)Instructions burned: 39 (million)
% 1.50/1.46 % (11495)------------------------------
% 1.50/1.46 % (11495)------------------------------
% 1.50/1.47 % (11496)lrs+1004_1:1_cnfonf=lazy_pi_sigma_gen:fe=off:gs=on:hud=10:prag=on:tnu=1:i=6:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/6Mi)
% 1.50/1.48 % Exception at run slice level
% 1.50/1.48 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.48 % (11497)dis+1002_1:1_aac=none:au=on:e2e=on:nm=2:nwc=10.0:sd=1:ss=axioms:st=3.0:i=1087:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/1087Mi)
% 1.50/1.49 % (11498)dis+10_1:1_aac=none:cs=on:i=47:si=on:rtra=on_0 on DTF2THF_11348 for (2997ds/47Mi)
% 1.50/1.52 % (11498)Instruction limit reached!
% 1.50/1.52 % (11498)------------------------------
% 1.50/1.52 % (11498)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.52 % (11498)Termination reason: Unknown
% 1.50/1.52 % (11498)Termination phase: Saturation
% 1.50/1.52
% 1.50/1.52 % (11498)Memory used [KB]: 5884
% 1.50/1.52 % (11498)Time elapsed: 0.026 s
% 1.50/1.52 % (11498)Instructions burned: 48 (million)
% 1.50/1.52 % (11498)------------------------------
% 1.50/1.52 % (11498)------------------------------
% 1.50/1.52 % (11497)First to succeed.
% 1.50/1.53 % (11499)lrs+1010_1:128_av=off:cbe=off:cnfonf=lazy_simp:fsr=off:ntd=on:ss=axioms:st=1.5:i=44:si=on:rtra=on_0 on DTF2THF_11348 for (2996ds/44Mi)
% 1.50/1.53 % Exception at run slice level
% 1.50/1.53 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.50/1.53 % (11497)Refutation found. Thanks to Tanya!
% 1.50/1.53 % SZS status Theorem for DTF2THF_11348
% 1.50/1.53 % SZS output start Proof for DTF2THF_11348
% 1.50/1.53 thf(type_def_6, type, nat: $tType).
% 1.50/1.53 thf(type_def_7, type, list: ($tType) > $tType).
% 1.50/1.53 thf(type_def_8, type, sK2: $tType).
% 1.50/1.53 thf(func_def_0, type, isPer: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.50/1.53 thf(func_def_2, type, nat: $tType).
% 1.50/1.53 thf(func_def_3, type, natStar: nat > nat > $o).
% 1.50/1.53 thf(func_def_4, type, zero: nat).
% 1.50/1.53 thf(func_def_5, type, suc: nat > nat).
% 1.50/1.53 thf(func_def_6, type, plus: nat > nat > nat).
% 1.50/1.53 thf(func_def_7, type, list: ($tType) > $tType).
% 1.50/1.53 thf(func_def_8, type, listStar: !>[X0: $tType]:((X0 > X0 > $o) > nat > list @ X0 > list @ X0 > $o)).
% 1.50/1.53 thf(func_def_9, type, nil: !>[X0: $tType]:(list @ X0)).
% 1.50/1.53 thf(func_def_10, type, cons: !>[X0: $tType]:(nat > X0 > list @ X0 > list @ X0)).
% 1.50/1.53 thf(func_def_11, type, app: !>[X0: $tType]:(nat > nat > list @ X0 > list @ X0 > list @ X0)).
% 1.50/1.53 thf(func_def_14, type, sP0: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.50/1.53 thf(func_def_15, type, sP1: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.50/1.53 thf(func_def_16, type, sK3: sK2 > sK2 > $o).
% 1.50/1.53 thf(func_def_17, type, sK4: nat).
% 1.50/1.53 thf(func_def_18, type, sK5: list @ sK2).
% 1.50/1.53 thf(func_def_19, type, sK6: nat).
% 1.50/1.53 thf(func_def_20, type, sK7: list @ sK2).
% 1.50/1.53 thf(func_def_21, type, sK8: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.50/1.53 thf(func_def_22, type, sK9: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.50/1.53 thf(func_def_23, type, sK10: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.50/1.53 thf(func_def_24, type, sK11: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.50/1.53 thf(func_def_25, type, sK12: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.50/1.53 thf(func_def_27, type, ph14: !>[X0: $tType]:(X0)).
% 1.50/1.53 thf(f383,plain,(
% 1.50/1.53 $false),
% 1.50/1.53 inference(avatar_sat_refutation,[status(thm)],[f191,f198,f250,f273,f310,f325,f336,f378])).
% 1.50/1.53 thf(f378,plain,(
% 1.50/1.53 spl13_11),
% 1.50/1.53 inference(avatar_contradiction_clause,[status(thm)],[f377])).
% 1.50/1.53 thf(f377,plain,(
% 1.50/1.53 $false | spl13_11),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f376,f56])).
% 1.50/1.53 thf(f56,plain,(
% 1.50/1.53 ($true = (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7))),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f44])).
% 1.50/1.53 thf(f44,plain,(
% 1.50/1.53 ($true = (isPer @ sK2 @ sK3)) & (($true != (listStar @ sK2 @ sK3 @ (plus @ zero @ (plus @ sK4 @ sK6)) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ (app @ sK2 @ (plus @ zero @ sK4) @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) & ($true = (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) & ($true = (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5)))),
% 1.50/1.53 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7])],[f32,f43,f42])).
% 1.50/1.53 thf(f42,plain,(
% 1.50/1.53 ? [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) & ? [X2 : nat,X3 : list @ X0,X4 : nat,X5 : list @ X0] : (($true != (listStar @ X0 @ X1 @ (plus @ zero @ (plus @ X2 @ X4)) @ (app @ X0 @ zero @ (plus @ X2 @ X4) @ nil @ X0 @ (app @ X0 @ X2 @ X4 @ X3 @ X5)) @ (app @ X0 @ (plus @ zero @ X2) @ X4 @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X5))) & ($true = (listStar @ X0 @ X1 @ X4 @ X5 @ X5)) & ($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X3)))) => (($true = (isPer @ sK2 @ sK3)) & ? [X5 : list @ sK2,X4 : nat,X3 : list @ sK2,X2 : nat] : (((listStar @ sK2 @ sK3 @ (plus @ zero @ (plus @ X2 @ X4)) @ (app @ sK2 @ zero @ (plus @ X2 @ X4) @ nil @ sK2 @ (app @ sK2 @ X2 @ X4 @ X3 @ X5)) @ (app @ sK2 @ (plus @ zero @ X2) @ X4 @ (app @ sK2 @ zero @ X2 @ nil @ sK2 @ X3) @ X5)) != $true) & ($true = (listStar @ sK2 @ sK3 @ X4 @ X5 @ X5)) & ($true = (listStar @ sK2 @ sK3 @ X2 @ X3 @ X3))))),
% 1.50/1.53 introduced(definition,[],[choice_axiom])).
% 1.50/1.53 thf(f43,plain,(
% 1.50/1.53 ? [X5 : list @ sK2,X4 : nat,X3 : list @ sK2,X2 : nat] : (((listStar @ sK2 @ sK3 @ (plus @ zero @ (plus @ X2 @ X4)) @ (app @ sK2 @ zero @ (plus @ X2 @ X4) @ nil @ sK2 @ (app @ sK2 @ X2 @ X4 @ X3 @ X5)) @ (app @ sK2 @ (plus @ zero @ X2) @ X4 @ (app @ sK2 @ zero @ X2 @ nil @ sK2 @ X3) @ X5)) != $true) & ($true = (listStar @ sK2 @ sK3 @ X4 @ X5 @ X5)) & ($true = (listStar @ sK2 @ sK3 @ X2 @ X3 @ X3))) => (($true != (listStar @ sK2 @ sK3 @ (plus @ zero @ (plus @ sK4 @ sK6)) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ (app @ sK2 @ (plus @ zero @ sK4) @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) & ($true = (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) & ($true = (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5)))),
% 1.50/1.53 introduced(definition,[],[choice_axiom])).
% 1.50/1.53 thf(f32,plain,(
% 1.50/1.53 ? [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) & ? [X2 : nat,X3 : list @ X0,X4 : nat,X5 : list @ X0] : (($true != (listStar @ X0 @ X1 @ (plus @ zero @ (plus @ X2 @ X4)) @ (app @ X0 @ zero @ (plus @ X2 @ X4) @ nil @ X0 @ (app @ X0 @ X2 @ X4 @ X3 @ X5)) @ (app @ X0 @ (plus @ zero @ X2) @ X4 @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X5))) & ($true = (listStar @ X0 @ X1 @ X4 @ X5 @ X5)) & ($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X3))))),
% 1.50/1.53 inference(flattening,[status(thm)],[f31])).
% 1.50/1.53 thf(f31,plain,(
% 1.50/1.53 ? [X0 : $tType,X1 : X0 > X0 > $o] : (? [X2 : nat,X3 : list @ X0,X4 : nat,X5 : list @ X0] : ((($true != (listStar @ X0 @ X1 @ (plus @ zero @ (plus @ X2 @ X4)) @ (app @ X0 @ zero @ (plus @ X2 @ X4) @ nil @ X0 @ (app @ X0 @ X2 @ X4 @ X3 @ X5)) @ (app @ X0 @ (plus @ zero @ X2) @ X4 @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X5))) & ($true = (listStar @ X0 @ X1 @ X4 @ X5 @ X5))) & ($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) & ((isPer @ X0 @ X1) = $true))),
% 1.50/1.53 inference(ennf_transformation,[status(thm)],[f16])).
% 1.50/1.53 thf(f16,plain,(
% 1.50/1.53 ~! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat,X3 : list @ X0,X4 : nat,X5 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) => (($true = (listStar @ X0 @ X1 @ X4 @ X5 @ X5)) => ($true = (listStar @ X0 @ X1 @ (plus @ zero @ (plus @ X2 @ X4)) @ (app @ X0 @ zero @ (plus @ X2 @ X4) @ nil @ X0 @ (app @ X0 @ X2 @ X4 @ X3 @ X5)) @ (app @ X0 @ (plus @ zero @ X2) @ X4 @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X5))))))),
% 1.50/1.53 inference(fool_elimination,[status(thm)],[f15])).
% 1.50/1.53 thf(f15,plain,(
% 1.50/1.53 ~! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : list @ X0,X4 : nat,X5 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X3 @ X3) => ((listStar @ X0 @ X1 @ X4 @ X5 @ X5) => (listStar @ X0 @ X1 @ (plus @ zero @ (plus @ X2 @ X4)) @ (app @ X0 @ zero @ (plus @ X2 @ X4) @ nil @ X0 @ (app @ X0 @ X2 @ X4 @ X3 @ X5)) @ (app @ X0 @ (plus @ zero @ X2) @ X4 @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X5)))))),
% 1.50/1.53 inference(rectify,[status(thm)],[f11])).
% 1.50/1.53 thf(f11,negated_conjecture,(
% 1.50/1.53 ~! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X15 : nat,X17 : list @ X0,X16 : nat,X18 : list @ X0] : ((listStar @ X0 @ X1 @ X15 @ X17 @ X17) => ((listStar @ X0 @ X1 @ X16 @ X18 @ X18) => (listStar @ X0 @ X1 @ (plus @ zero @ (plus @ X15 @ X16)) @ (app @ X0 @ zero @ (plus @ X15 @ X16) @ nil @ X0 @ (app @ X0 @ X15 @ X16 @ X17 @ X18)) @ (app @ X0 @ (plus @ zero @ X15) @ X16 @ (app @ X0 @ zero @ X15 @ nil @ X0 @ X17) @ X18)))))),
% 1.50/1.53 inference(negated_conjecture,[status(cth)],[f10])).
% 1.50/1.53 thf(f10,conjecture,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X15 : nat,X17 : list @ X0,X16 : nat,X18 : list @ X0] : ((listStar @ X0 @ X1 @ X15 @ X17 @ X17) => ((listStar @ X0 @ X1 @ X16 @ X18 @ X18) => (listStar @ X0 @ X1 @ (plus @ zero @ (plus @ X15 @ X16)) @ (app @ X0 @ zero @ (plus @ X15 @ X16) @ nil @ X0 @ (app @ X0 @ X15 @ X16 @ X17 @ X18)) @ (app @ X0 @ (plus @ zero @ X15) @ X16 @ (app @ X0 @ zero @ X15 @ nil @ X0 @ X17) @ X18)))))),
% 1.50/1.53 file('/export/starexec/sandbox2/tmp/tmp.kjTqZzoipf/DTF2THF_11348.p',list_app_assoc_base)).
% 1.50/1.53 thf(f376,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) | spl13_11),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f375,f55])).
% 1.50/1.53 thf(f55,plain,(
% 1.50/1.53 ($true = (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5))),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f44])).
% 1.50/1.53 thf(f375,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5)) | ($true != (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) | spl13_11),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f373,f58])).
% 1.50/1.53 thf(f58,plain,(
% 1.50/1.53 ($true = (isPer @ sK2 @ sK3))),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f44])).
% 1.50/1.53 thf(f373,plain,(
% 1.50/1.53 ($true != (isPer @ sK2 @ sK3)) | ($true != (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5)) | spl13_11),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f369])).
% 1.50/1.53 thf(f369,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) | ($true != $true) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5)) | ($true != (isPer @ sK2 @ sK3)) | spl13_11),
% 1.50/1.53 inference(superposition,[status(thm)],[f272,f73])).
% 1.50/1.53 thf(f73,plain,(
% 1.50/1.53 ( ! [X0 : $tType,X2 : nat,X3 : nat,X1 : X0 > X0 > $o,X6 : list @ X0,X7 : list @ X0,X4 : list @ X0,X5 : list @ X0] : (($true = (listStar @ X0 @ X1 @ (plus @ X2 @ X3) @ (app @ X0 @ X2 @ X3 @ X4 @ X6) @ (app @ X0 @ X2 @ X3 @ X5 @ X7))) | ($true != (listStar @ X0 @ X1 @ X2 @ X4 @ X5)) | ($true != (listStar @ X0 @ X1 @ X3 @ X6 @ X7)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f35])).
% 1.50/1.53 thf(f35,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : nat,X3 : nat,X4 : list @ X0,X5 : list @ X0] : (! [X6 : list @ X0,X7 : list @ X0] : (($true = (listStar @ X0 @ X1 @ (plus @ X2 @ X3) @ (app @ X0 @ X2 @ X3 @ X4 @ X6) @ (app @ X0 @ X2 @ X3 @ X5 @ X7))) | ($true != (listStar @ X0 @ X1 @ X3 @ X6 @ X7))) | ($true != (listStar @ X0 @ X1 @ X2 @ X4 @ X5))))),
% 1.50/1.53 inference(ennf_transformation,[status(thm)],[f24])).
% 1.50/1.53 thf(f24,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat,X3 : nat,X4 : list @ X0,X5 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X2 @ X4 @ X5)) => ! [X6 : list @ X0,X7 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X3 @ X6 @ X7)) => ($true = (listStar @ X0 @ X1 @ (plus @ X2 @ X3) @ (app @ X0 @ X2 @ X3 @ X4 @ X6) @ (app @ X0 @ X2 @ X3 @ X5 @ X7))))))),
% 1.50/1.53 inference(fool_elimination,[status(thm)],[f23])).
% 1.50/1.53 thf(f23,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : nat,X4 : list @ X0,X5 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X4 @ X5) => ! [X6 : list @ X0,X7 : list @ X0] : ((listStar @ X0 @ X1 @ X3 @ X6 @ X7) => (listStar @ X0 @ X1 @ (plus @ X2 @ X3) @ (app @ X0 @ X2 @ X3 @ X4 @ X6) @ (app @ X0 @ X2 @ X3 @ X5 @ X7)))))),
% 1.50/1.53 inference(rectify,[status(thm)],[f6])).
% 1.50/1.53 thf(f6,axiom,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X13 : nat,X9 : list @ X0,X10 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X9 @ X10) => ! [X11 : list @ X0,X12 : list @ X0] : ((listStar @ X0 @ X1 @ X13 @ X11 @ X12) => (listStar @ X0 @ X1 @ (plus @ X8 @ X13) @ (app @ X0 @ X8 @ X13 @ X9 @ X11) @ (app @ X0 @ X8 @ X13 @ X10 @ X12)))))),
% 1.50/1.53 file('/export/starexec/sandbox2/tmp/tmp.kjTqZzoipf/DTF2THF_11348.p',app_tp_ax)).
% 1.50/1.53 thf(f272,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7))) | spl13_11),
% 1.50/1.53 inference(avatar_component_clause,[status(thm)],[f271])).
% 1.50/1.53 thf(f271,definition,(
% 1.50/1.53 spl13_11 <=> ($true = (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[spl13_11])],[avatar_definition])).
% 1.50/1.53 thf(f336,plain,(
% 1.50/1.53 spl13_17),
% 1.50/1.53 inference(avatar_contradiction_clause,[status(thm)],[f335])).
% 1.50/1.53 thf(f335,plain,(
% 1.50/1.53 $false | spl13_17),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f334,f58])).
% 1.50/1.53 thf(f334,plain,(
% 1.50/1.53 ($true != (isPer @ sK2 @ sK3)) | spl13_17),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f333,f55])).
% 1.50/1.53 thf(f333,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5)) | ($true != (isPer @ sK2 @ sK3)) | spl13_17),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f328])).
% 1.50/1.53 thf(f328,plain,(
% 1.50/1.53 ($true != $true) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5)) | ($true != (isPer @ sK2 @ sK3)) | spl13_17),
% 1.50/1.53 inference(superposition,[status(thm)],[f309,f251])).
% 1.50/1.53 thf(f251,plain,(
% 1.50/1.53 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (((listStar @ X0 @ X1 @ X2 @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X3) = $true) | ((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.50/1.53 inference(forward_demodulation,[status(thm)],[f74,f71])).
% 1.50/1.53 thf(f71,plain,(
% 1.50/1.53 ( ! [X0 : nat] : (((plus @ zero @ X0) = X0)) )),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f30])).
% 1.50/1.53 thf(f30,plain,(
% 1.50/1.53 ! [X0 : nat] : ((plus @ zero @ X0) = X0)),
% 1.50/1.53 inference(rectify,[status(thm)],[f7])).
% 1.50/1.53 thf(f7,axiom,(
% 1.50/1.53 ! [X8 : nat] : ((plus @ zero @ X8) = X8)),
% 1.50/1.53 file('/export/starexec/sandbox2/tmp/tmp.kjTqZzoipf/DTF2THF_11348.p',ax1)).
% 1.50/1.53 thf(f74,plain,(
% 1.50/1.53 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) | ($true = (listStar @ X0 @ X1 @ (plus @ zero @ X2) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X3))) )),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f34])).
% 1.50/1.53 thf(f34,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : nat,X3 : list @ X0] : (($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) | ($true = (listStar @ X0 @ X1 @ (plus @ zero @ X2) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X3))))),
% 1.50/1.53 inference(ennf_transformation,[status(thm)],[f14])).
% 1.50/1.53 thf(f14,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat,X3 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) => ($true = (listStar @ X0 @ X1 @ (plus @ zero @ X2) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X3))))),
% 1.50/1.53 inference(fool_elimination,[status(thm)],[f13])).
% 1.50/1.53 thf(f13,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X3 @ X3) => (listStar @ X0 @ X1 @ (plus @ zero @ X2) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X3)))),
% 1.50/1.53 inference(rectify,[status(thm)],[f8])).
% 1.50/1.53 thf(f8,axiom,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X2 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X2 @ X2) => (listStar @ X0 @ X1 @ (plus @ zero @ X8) @ (app @ X0 @ zero @ X8 @ nil @ X0 @ X2) @ X2)))),
% 1.50/1.53 file('/export/starexec/sandbox2/tmp/tmp.kjTqZzoipf/DTF2THF_11348.p',ax3)).
% 1.50/1.53 thf(f309,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK5)) | spl13_17),
% 1.50/1.53 inference(avatar_component_clause,[status(thm)],[f308])).
% 1.50/1.53 thf(f308,definition,(
% 1.50/1.53 spl13_17 <=> ($true = (listStar @ sK2 @ sK3 @ sK4 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK5))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[spl13_17])],[avatar_definition])).
% 1.50/1.53 thf(f325,plain,(
% 1.50/1.53 spl13_16),
% 1.50/1.53 inference(avatar_contradiction_clause,[status(thm)],[f324])).
% 1.50/1.53 thf(f324,plain,(
% 1.50/1.53 $false | spl13_16),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f323,f58])).
% 1.50/1.53 thf(f323,plain,(
% 1.50/1.53 ($true != (isPer @ sK2 @ sK3)) | spl13_16),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f320])).
% 1.50/1.53 thf(f320,plain,(
% 1.50/1.53 ($true != $true) | ($true != (isPer @ sK2 @ sK3)) | spl13_16),
% 1.50/1.53 inference(superposition,[status(thm)],[f317,f59])).
% 1.50/1.53 thf(f59,plain,(
% 1.50/1.53 ( ! [X0 : $tType,X2 : nat,X1 : X0 > X0 > $o] : (($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))) | ((isPer @ X0 @ X1) != $true)) )),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f38])).
% 1.50/1.53 thf(f38,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : nat] : ($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))))),
% 1.50/1.53 inference(ennf_transformation,[status(thm)],[f28])).
% 1.50/1.53 thf(f28,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat] : ($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))))),
% 1.50/1.53 inference(fool_elimination,[status(thm)],[f27])).
% 1.50/1.53 thf(f27,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat] : (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2)))),
% 1.50/1.53 inference(rectify,[status(thm)],[f3])).
% 1.50/1.53 thf(f3,axiom,(
% 1.50/1.53 ! [X5 : $tType,X6 : X5 > X5 > $o] : ((isPer @ X5 @ X6) => ! [X7 : nat] : (isPer @ list @ X5 @ (listStar @ X5 @ X6 @ X7)))),
% 1.50/1.53 file('/export/starexec/sandbox2/tmp/tmp.kjTqZzoipf/DTF2THF_11348.p','\'listStar\'_is_per')).
% 1.50/1.53 thf(f317,plain,(
% 1.50/1.53 ($true != (isPer @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4))) | spl13_16),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f316])).
% 1.50/1.53 thf(f316,plain,(
% 1.50/1.53 ($true != (isPer @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4))) | ($true != $true) | spl13_16),
% 1.50/1.53 inference(superposition,[status(thm)],[f306,f70])).
% 1.50/1.53 thf(f70,plain,(
% 1.50/1.53 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (((sP1 @ X0 @ X1) = $true) | ((isPer @ X0 @ X1) != $true)) )),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f54])).
% 1.50/1.53 thf(f54,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((sP1 @ X0 @ X1) = $true) | ((isPer @ X0 @ X1) != $true)) & (((isPer @ X0 @ X1) = $true) | ((sP1 @ X0 @ X1) != $true)))),
% 1.50/1.53 inference(nnf_transformation,[status(thm)],[f41])).
% 1.50/1.53 thf(f41,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((sP1 @ X0 @ X1) = $true) <=> ((isPer @ X0 @ X1) = $true))),
% 1.50/1.53 inference(definition_folding,[status(thm)],[f37,f40,f39])).
% 1.50/1.53 thf(f39,plain,(
% 1.50/1.53 ! [X1 : X0 > X0 > $o,X0 : $tType] : (($true = (sP0 @ X0 @ X1)) <=> ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X4) = $true) | ((X1 @ X3 @ X4) != $true) | ((X1 @ X2 @ X3) != $true)))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[=])],[predicate_definition_introduction])).
% 1.50/1.53 thf(f40,plain,(
% 1.50/1.53 ! [X1 : X0 > X0 > $o,X0 : $tType] : (((sP1 @ X0 @ X1) = $true) <=> (! [X5 : X0,X6 : X0] : (($true != (X1 @ X5 @ X6)) | ($true = (X1 @ X6 @ X5))) & ($true = (sP0 @ X0 @ X1))))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[=])],[predicate_definition_introduction])).
% 1.50/1.53 thf(f37,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X5 : X0,X6 : X0] : (($true != (X1 @ X5 @ X6)) | ($true = (X1 @ X6 @ X5))) & ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X4) = $true) | ((X1 @ X3 @ X4) != $true) | ((X1 @ X2 @ X3) != $true))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.50/1.53 inference(flattening,[status(thm)],[f36])).
% 1.50/1.53 thf(f36,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) <=> (! [X5 : X0,X6 : X0] : (($true != (X1 @ X5 @ X6)) | ($true = (X1 @ X6 @ X5))) & ! [X2 : X0,X3 : X0,X4 : X0] : ((((X1 @ X2 @ X4) = $true) | ((X1 @ X3 @ X4) != $true)) | ((X1 @ X2 @ X3) != $true))))),
% 1.50/1.53 inference(ennf_transformation,[status(thm)],[f20])).
% 1.50/1.53 thf(f20,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) <=> (! [X5 : X0,X6 : X0] : (($true = (X1 @ X5 @ X6)) => ($true = (X1 @ X6 @ X5))) & ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X3) = $true) => (((X1 @ X3 @ X4) = $true) => ((X1 @ X2 @ X4) = $true)))))),
% 1.50/1.53 inference(fool_elimination,[status(thm)],[f19])).
% 1.50/1.53 thf(f19,plain,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X2 : X0,X3 : X0,X4 : X0] : ((X1 @ X2 @ X3) => ((X1 @ X3 @ X4) => (X1 @ X2 @ X4))) & ! [X5 : X0,X6 : X0] : ((X1 @ X5 @ X6) => (X1 @ X6 @ X5))) <=> (isPer @ X0 @ X1))),
% 1.50/1.53 inference(rectify,[status(thm)],[f1])).
% 1.50/1.53 thf(f1,axiom,(
% 1.50/1.53 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X2 : X0,X3 : X0,X4 : X0] : ((X1 @ X2 @ X3) => ((X1 @ X3 @ X4) => (X1 @ X2 @ X4))) & ! [X2 : X0,X3 : X0] : ((X1 @ X2 @ X3) => (X1 @ X3 @ X2))) <=> (isPer @ X0 @ X1))),
% 1.50/1.53 file('/export/starexec/sandbox2/tmp/tmp.kjTqZzoipf/DTF2THF_11348.p',is_per)).
% 1.50/1.53 thf(f306,plain,(
% 1.50/1.53 ($true != (sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4))) | spl13_16),
% 1.50/1.53 inference(avatar_component_clause,[status(thm)],[f305])).
% 1.50/1.53 thf(f305,definition,(
% 1.50/1.53 spl13_16 <=> ($true = (sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4)))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[spl13_16])],[avatar_definition])).
% 1.50/1.53 thf(f310,plain,(
% 1.50/1.53 ~spl13_16 | ~spl13_17 | spl13_10),
% 1.50/1.53 inference(avatar_split_clause,[status(thm)],[f295,f268,f308,f305])).
% 1.50/1.53 thf(f268,definition,(
% 1.50/1.53 spl13_10 <=> ($true = (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7)))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[spl13_10])],[avatar_definition])).
% 1.50/1.53 thf(f295,plain,(
% 1.50/1.53 ($true != (sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4))) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK5)) | spl13_10),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f294])).
% 1.50/1.53 thf(f294,plain,(
% 1.50/1.53 ($true != $true) | ($true != (sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4))) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK5)) | spl13_10),
% 1.50/1.53 inference(superposition,[status(thm)],[f287,f62])).
% 1.50/1.53 thf(f62,plain,(
% 1.50/1.53 ( ! [X1 : $tType,X0 : X1 > X1 > $o,X4 : X1,X5 : X1] : (($true = (X0 @ X5 @ X4)) | ((X0 @ X4 @ X5) != $true) | ($true != (sP1 @ X1 @ X0))) )),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f49])).
% 1.50/1.53 thf(f49,plain,(
% 1.50/1.53 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP1 @ X1 @ X0)) | (($true = (X0 @ (sK8 @ X1 @ X0) @ (sK9 @ X1 @ X0))) & ($true != (X0 @ (sK9 @ X1 @ X0) @ (sK8 @ X1 @ X0)))) | ($true != (sP0 @ X1 @ X0))) & ((! [X4 : X1,X5 : X1] : (((X0 @ X4 @ X5) != $true) | ($true = (X0 @ X5 @ X4))) & ($true = (sP0 @ X1 @ X0))) | ($true != (sP1 @ X1 @ X0))))),
% 1.50/1.53 inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f47,f48])).
% 1.50/1.53 thf(f48,plain,(
% 1.50/1.53 ! [X1 : $tType,X0 : X1 > X1 > $o] : (? [X2 : X1,X3 : X1] : (($true = (X0 @ X2 @ X3)) & ($true != (X0 @ X3 @ X2))) => (($true = (X0 @ (sK8 @ X1 @ X0) @ (sK9 @ X1 @ X0))) & ($true != (X0 @ (sK9 @ X1 @ X0) @ (sK8 @ X1 @ X0)))))),
% 1.50/1.53 introduced(definition,[],[choice_axiom])).
% 1.50/1.53 thf(f47,plain,(
% 1.50/1.53 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP1 @ X1 @ X0)) | ? [X2 : X1,X3 : X1] : (($true = (X0 @ X2 @ X3)) & ($true != (X0 @ X3 @ X2))) | ($true != (sP0 @ X1 @ X0))) & ((! [X4 : X1,X5 : X1] : (((X0 @ X4 @ X5) != $true) | ($true = (X0 @ X5 @ X4))) & ($true = (sP0 @ X1 @ X0))) | ($true != (sP1 @ X1 @ X0))))),
% 1.50/1.53 inference(rectify,[status(thm)],[f46])).
% 1.50/1.53 thf(f46,plain,(
% 1.50/1.53 ! [X1 : X0 > X0 > $o,X0 : $tType] : ((((sP1 @ X0 @ X1) = $true) | ? [X5 : X0,X6 : X0] : (($true = (X1 @ X5 @ X6)) & ($true != (X1 @ X6 @ X5))) | ($true != (sP0 @ X0 @ X1))) & ((! [X5 : X0,X6 : X0] : (($true != (X1 @ X5 @ X6)) | ($true = (X1 @ X6 @ X5))) & ($true = (sP0 @ X0 @ X1))) | ((sP1 @ X0 @ X1) != $true)))),
% 1.50/1.53 inference(flattening,[status(thm)],[f45])).
% 1.50/1.53 thf(f45,plain,(
% 1.50/1.53 ! [X1 : X0 > X0 > $o,X0 : $tType] : ((((sP1 @ X0 @ X1) = $true) | (? [X5 : X0,X6 : X0] : (($true = (X1 @ X5 @ X6)) & ($true != (X1 @ X6 @ X5))) | ($true != (sP0 @ X0 @ X1)))) & ((! [X5 : X0,X6 : X0] : (($true != (X1 @ X5 @ X6)) | ($true = (X1 @ X6 @ X5))) & ($true = (sP0 @ X0 @ X1))) | ((sP1 @ X0 @ X1) != $true)))),
% 1.50/1.53 inference(nnf_transformation,[status(thm)],[f40])).
% 1.50/1.53 thf(f287,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5))) | spl13_10),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f286,f56])).
% 1.50/1.53 thf(f286,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5))) | spl13_10),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f280,f58])).
% 1.50/1.53 thf(f280,plain,(
% 1.50/1.53 ($true != (isPer @ sK2 @ sK3)) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5))) | ($true != (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) | spl13_10),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f276])).
% 1.50/1.53 thf(f276,plain,(
% 1.50/1.53 ($true != $true) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ sK5 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5))) | ($true != (isPer @ sK2 @ sK3)) | ($true != (listStar @ sK2 @ sK3 @ sK6 @ sK7 @ sK7)) | spl13_10),
% 1.50/1.53 inference(superposition,[status(thm)],[f269,f73])).
% 1.50/1.53 thf(f269,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) | spl13_10),
% 1.50/1.53 inference(avatar_component_clause,[status(thm)],[f268])).
% 1.50/1.53 thf(f273,plain,(
% 1.50/1.53 ~spl13_10 | ~spl13_11 | ~spl13_3),
% 1.50/1.53 inference(avatar_split_clause,[status(thm)],[f266,f186,f271,f268])).
% 1.50/1.53 thf(f186,definition,(
% 1.50/1.53 spl13_3 <=> ! [X0 : list @ sK2] : (($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ X0 @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) | ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ X0)))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[spl13_3])],[avatar_definition])).
% 1.50/1.53 thf(f266,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) | ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7))) | ~spl13_3),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f255,f58])).
% 1.50/1.53 thf(f255,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) | ($true != (isPer @ sK2 @ sK3)) | ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7))) | ~spl13_3),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f252])).
% 1.50/1.53 thf(f252,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) | ($true != (isPer @ sK2 @ sK3)) | ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7) @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7))) | ($true != $true) | ~spl13_3),
% 1.50/1.53 inference(superposition,[status(thm)],[f187,f251])).
% 1.50/1.53 thf(f187,plain,(
% 1.50/1.53 ( ! [X0 : list @ sK2] : (($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ X0)) | ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ X0 @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7)))) ) | ~spl13_3),
% 1.50/1.53 inference(avatar_component_clause,[status(thm)],[f186])).
% 1.50/1.53 thf(f250,plain,(
% 1.50/1.53 spl13_2),
% 1.50/1.53 inference(avatar_contradiction_clause,[status(thm)],[f249])).
% 1.50/1.53 thf(f249,plain,(
% 1.50/1.53 $false | spl13_2),
% 1.50/1.53 inference(subsumption_resolution,[status(thm)],[f247,f58])).
% 1.50/1.53 thf(f247,plain,(
% 1.50/1.53 ($true != (isPer @ sK2 @ sK3)) | spl13_2),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f245])).
% 1.50/1.53 thf(f245,plain,(
% 1.50/1.53 ($true != $true) | ($true != (isPer @ sK2 @ sK3)) | spl13_2),
% 1.50/1.53 inference(superposition,[status(thm)],[f200,f59])).
% 1.50/1.53 thf(f200,plain,(
% 1.50/1.53 ($true != (isPer @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6)))) | spl13_2),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f199])).
% 1.50/1.53 thf(f199,plain,(
% 1.50/1.53 ($true != (isPer @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6)))) | ($true != $true) | spl13_2),
% 1.50/1.53 inference(superposition,[status(thm)],[f102,f70])).
% 1.50/1.53 thf(f102,plain,(
% 1.50/1.53 ($true != (sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6)))) | spl13_2),
% 1.50/1.53 inference(avatar_component_clause,[status(thm)],[f101])).
% 1.50/1.53 thf(f101,definition,(
% 1.50/1.53 spl13_2 <=> ($true = (sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6))))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[spl13_2])],[avatar_definition])).
% 1.50/1.53 thf(f198,plain,(
% 1.50/1.53 ~spl13_2 | spl13_4),
% 1.50/1.53 inference(avatar_split_clause,[status(thm)],[f197,f189,f101])).
% 1.50/1.53 thf(f189,definition,(
% 1.50/1.53 spl13_4 <=> ($true = (sP0 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6))))),
% 1.50/1.53 introduced(definition,[new_symbols(naming,[spl13_4])],[avatar_definition])).
% 1.50/1.53 thf(f197,plain,(
% 1.50/1.53 ($true != (sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6)))) | spl13_4),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f196])).
% 1.50/1.53 thf(f196,plain,(
% 1.50/1.53 ($true != $true) | ($true != (sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6)))) | spl13_4),
% 1.50/1.53 inference(superposition,[status(thm)],[f190,f61])).
% 1.50/1.53 thf(f61,plain,(
% 1.50/1.53 ( ! [X1 : $tType,X0 : X1 > X1 > $o] : (($true = (sP0 @ X1 @ X0)) | ($true != (sP1 @ X1 @ X0))) )),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f49])).
% 1.50/1.53 thf(f190,plain,(
% 1.50/1.53 ($true != (sP0 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6)))) | spl13_4),
% 1.50/1.53 inference(avatar_component_clause,[status(thm)],[f189])).
% 1.50/1.53 thf(f191,plain,(
% 1.50/1.53 spl13_3 | ~spl13_4),
% 1.50/1.53 inference(avatar_split_clause,[status(thm)],[f180,f189,f186])).
% 1.50/1.53 thf(f180,plain,(
% 1.50/1.53 ( ! [X0 : list @ sK2] : (($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ X0 @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) | ($true != (sP0 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6)))) | ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ X0))) )),
% 1.50/1.53 inference(trivial_inequality_removal,[status(thm)],[f162])).
% 1.50/1.53 thf(f162,plain,(
% 1.50/1.53 ( ! [X0 : list @ sK2] : (($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ X0)) | ($true != (sP0 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6)))) | ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ X0 @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7))) | ($true != $true)) )),
% 1.50/1.53 inference(superposition,[status(thm)],[f76,f65])).
% 1.50/1.53 thf(f65,plain,(
% 1.50/1.53 ( ! [X1 : $tType,X0 : X1 > X1 > $o,X6 : X1,X7 : X1,X5 : X1] : (($true = (X0 @ X5 @ X7)) | ($true != (sP0 @ X1 @ X0)) | ($true != (X0 @ X6 @ X7)) | ($true != (X0 @ X5 @ X6))) )),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f53])).
% 1.50/1.53 thf(f53,plain,(
% 1.50/1.53 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP0 @ X1 @ X0)) | (($true != (X0 @ (sK10 @ X1 @ X0) @ (sK12 @ X1 @ X0))) & ($true = (X0 @ (sK11 @ X1 @ X0) @ (sK12 @ X1 @ X0))) & ($true = (X0 @ (sK10 @ X1 @ X0) @ (sK11 @ X1 @ X0))))) & (! [X5 : X1,X6 : X1,X7 : X1] : (($true = (X0 @ X5 @ X7)) | ($true != (X0 @ X6 @ X7)) | ($true != (X0 @ X5 @ X6))) | ($true != (sP0 @ X1 @ X0))))),
% 1.50/1.53 inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f51,f52])).
% 1.50/1.53 thf(f52,plain,(
% 1.50/1.53 ! [X1 : $tType,X0 : X1 > X1 > $o] : (? [X2 : X1,X3 : X1,X4 : X1] : (($true != (X0 @ X2 @ X4)) & ($true = (X0 @ X3 @ X4)) & ($true = (X0 @ X2 @ X3))) => (($true != (X0 @ (sK10 @ X1 @ X0) @ (sK12 @ X1 @ X0))) & ($true = (X0 @ (sK11 @ X1 @ X0) @ (sK12 @ X1 @ X0))) & ($true = (X0 @ (sK10 @ X1 @ X0) @ (sK11 @ X1 @ X0)))))),
% 1.50/1.53 introduced(definition,[],[choice_axiom])).
% 1.50/1.53 thf(f51,plain,(
% 1.50/1.53 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP0 @ X1 @ X0)) | ? [X2 : X1,X3 : X1,X4 : X1] : (($true != (X0 @ X2 @ X4)) & ($true = (X0 @ X3 @ X4)) & ($true = (X0 @ X2 @ X3)))) & (! [X5 : X1,X6 : X1,X7 : X1] : (($true = (X0 @ X5 @ X7)) | ($true != (X0 @ X6 @ X7)) | ($true != (X0 @ X5 @ X6))) | ($true != (sP0 @ X1 @ X0))))),
% 1.50/1.53 inference(rectify,[status(thm)],[f50])).
% 1.50/1.53 thf(f50,plain,(
% 1.50/1.53 ! [X1 : X0 > X0 > $o,X0 : $tType] : ((($true = (sP0 @ X0 @ X1)) | ? [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X4) != $true) & ((X1 @ X3 @ X4) = $true) & ((X1 @ X2 @ X3) = $true))) & (! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X4) = $true) | ((X1 @ X3 @ X4) != $true) | ((X1 @ X2 @ X3) != $true)) | ($true != (sP0 @ X0 @ X1))))),
% 1.50/1.53 inference(nnf_transformation,[status(thm)],[f39])).
% 1.50/1.53 thf(f76,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ (app @ sK2 @ sK4 @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7)))),
% 1.50/1.53 inference(forward_demodulation,[status(thm)],[f75,f71])).
% 1.50/1.53 thf(f75,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ (plus @ sK4 @ sK6) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ (app @ sK2 @ (plus @ zero @ sK4) @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7)))),
% 1.50/1.53 inference(forward_demodulation,[status(thm)],[f57,f71])).
% 1.50/1.53 thf(f57,plain,(
% 1.50/1.53 ($true != (listStar @ sK2 @ sK3 @ (plus @ zero @ (plus @ sK4 @ sK6)) @ (app @ sK2 @ zero @ (plus @ sK4 @ sK6) @ nil @ sK2 @ (app @ sK2 @ sK4 @ sK6 @ sK5 @ sK7)) @ (app @ sK2 @ (plus @ zero @ sK4) @ sK6 @ (app @ sK2 @ zero @ sK4 @ nil @ sK2 @ sK5) @ sK7)))),
% 1.50/1.53 inference(cnf_transformation,[status(thm)],[f44])).
% 1.50/1.53 % SZS output end Proof for DTF2THF_11348
% 1.50/1.53 % (11497)------------------------------
% 1.50/1.53 % (11497)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.53 % (11497)Termination reason: Refutation
% 1.50/1.53
% 1.50/1.53 % (11497)Memory used [KB]: 6012
% 1.50/1.53 % (11497)Time elapsed: 0.054 s
% 1.50/1.53 % (11497)Instructions burned: 94 (million)
% 1.50/1.53 % (11497)------------------------------
% 1.50/1.53 % (11497)------------------------------
% 1.50/1.53 % (11448)Success in time 0.336 s
%------------------------------------------------------------------------------