%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : DAT412^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 : n015.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:41 AM UTC 2026
% Result : Theorem 1.57s 1.60s
% Output : Refutation 1.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT412^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.12/0.32 % Computer : n015.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Feb 24 06:17:31 EST 2026
% 0.12/0.32 % CPUTime :
% 0.12/0.32 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.41 ---- Original DTF file ---
% 0.15/0.41 thf(spec,logic,$$dhol).
% 0.15/0.41 %------------------------------------------------------------------------------
% 0.15/0.41 % File : DAT412^1 : TPTP v9.2.1. Released v9.2.0.
% 0.15/0.41 % Domain : Data Structures
% 0.15/0.41 % Problem : List reversal involution polymorphic, step 5
% 0.15/0.41 % Version : Especial.
% 0.15/0.41 % English : List reversal involution for polymorphic fixed-length lists. The
% 0.15/0.41 % proof is split into smaller steps. To simplify proof search, the
% 0.15/0.41 % axioms in each problem file have been preselected.
% 0.15/0.41
% 0.15/0.41 % Refs : [RRB23] Rothgang et al. (2023), Theorem Proving in Dependently
% 0.15/0.41 % : [Rot25] Rothgang (2025), Email to Geoff Sutcliffe
% 0.15/0.41 % : [RK+25] Ranalter et al. (2025), The Dependently Typed Higher-O
% 0.15/0.41 % Source : [Rot25]
% 0.15/0.41 % Names : ListReversalInvolution/list-rev-invol-step5.p [Rot25]
% 0.15/0.41
% 0.15/0.41 % Status : Theorem
% 0.15/0.41 % Rating : ? v9.2.0
% 0.15/0.41 % Syntax : Number of formulae : 26 ( 12 unt; 9 typ; 0 def)
% 0.15/0.41 % Number of atoms : 20 ( 20 equ; 0 cnn)
% 0.15/0.41 % Maximal formula atoms : 2 ( 1 avg)
% 0.15/0.41 % Number of connectives : 239 ( 3 ~; 0 |; 0 &; 229 @)
% 0.15/0.41 % ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% 0.15/0.41 % Maximal formula depth : 8 ( 4 avg)
% 0.15/0.41 % Number of types : 2 ( 1 usr)
% 0.15/0.41 % Number of type decls : 9 ( 4 !>P; 3 !>D)
% 0.15/0.41 % Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% 0.15/0.41 % Number of symbols : 9 ( 8 usr; 1 con; 0-5 aty)
% 0.15/0.41 % Number of variables : 52 ( 0 ^; 44 !; 0 ?; 52 :)
% 0.15/0.41 % ( 8 !>; 0 ?*; 0 @-; 0 @+)
% 0.15/0.41 % SPC : DH1_THM_EQU_NAR
% 0.15/0.41
% 0.15/0.41 % Comments :
% 0.15/0.41 %------------------------------------------------------------------------------
% 0.15/0.41 thf(nat_type,type,
% 0.15/0.41 nat: $tType ).
% 0.15/0.41
% 0.15/0.41 thf(zero_type,type,
% 0.15/0.41 zero: nat ).
% 0.15/0.41
% 0.15/0.41 thf(suc_type,type,
% 0.15/0.41 suc: nat > nat ).
% 0.15/0.41
% 0.15/0.41 thf(plus_type,type,
% 0.15/0.41 plus: nat > nat > nat ).
% 0.15/0.41
% 0.15/0.41 thf(list_type,type,
% 0.15/0.41 list: $tType > nat > $tType ).
% 0.15/0.41
% 0.15/0.41 thf(nil_type,type,
% 0.15/0.41 nil:
% 0.15/0.41 !>[A: $tType] : ( list @ A @ zero ) ).
% 0.15/0.41
% 0.15/0.41 thf(cons_type,type,
% 0.15/0.41 cons:
% 0.15/0.41 !>[A: $tType,N: nat] : ( A > ( list @ A @ N ) > ( list @ A @ ( suc @ N ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(app_type,type,
% 0.15/0.41 app:
% 0.15/0.41 !>[A: $tType,N: nat,M: nat] : ( ( list @ A @ N ) > ( list @ A @ M ) > ( list @ A @ ( plus @ N @ M ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(rev_type,type,
% 0.15/0.41 rev:
% 0.15/0.41 !>[A: $tType,N: nat] : ( ( list @ A @ N ) > ( list @ A @ N ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(peano1,axiom,
% 0.15/0.41 ! [N: nat] :
% 0.15/0.41 ( ( suc @ N )
% 0.15/0.41 != zero ) ).
% 0.15/0.41
% 0.15/0.41 thf(peano2,axiom,
% 0.15/0.41 ! [N: nat,M: nat] :
% 0.15/0.41 ( ( N != M )
% 0.15/0.41 => ( ( suc @ N )
% 0.15/0.41 != ( suc @ M ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(peano3,axiom,
% 0.15/0.41 ! [P: nat > $o] :
% 0.15/0.41 ( ( P @ zero )
% 0.15/0.41 => ( ! [M: nat] :
% 0.15/0.41 ( ( P @ M )
% 0.15/0.41 => ( P @ ( suc @ M ) ) )
% 0.15/0.41 => ! [N: nat] : ( P @ N ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(ax1,axiom,
% 0.15/0.41 ! [N: nat] :
% 0.15/0.41 ( ( plus @ zero @ N )
% 0.15/0.41 = N ) ).
% 0.15/0.41
% 0.15/0.41 thf(ax2,axiom,
% 0.15/0.41 ! [N: nat,M: nat] :
% 0.15/0.41 ( ( plus @ ( suc @ N ) @ M )
% 0.15/0.41 = ( suc @ ( plus @ N @ M ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(ax3,axiom,
% 0.15/0.41 ! [A: $tType,N: nat,X: list @ A @ N] :
% 0.15/0.41 ( ( app @ A @ zero @ N @ ( nil @ A ) @ X )
% 0.15/0.41 = X ) ).
% 0.15/0.41
% 0.15/0.41 thf(ax4,axiom,
% 0.15/0.41 ! [A: $tType,N: nat,M: nat,X: A,Y: list @ A @ N,Z: list @ A @ M] :
% 0.15/0.41 ( ( app @ A @ ( suc @ N ) @ M @ ( cons @ A @ N @ X @ Y ) @ Z )
% 0.15/0.41 = ( cons @ A @ ( plus @ N @ M ) @ X @ ( app @ A @ N @ M @ Y @ Z ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(ax5,axiom,
% 0.15/0.41 ! [A: $tType] :
% 0.15/0.41 ( ( rev @ A @ zero @ ( nil @ A ) )
% 0.15/0.41 = ( nil @ A ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(ax6,axiom,
% 0.15/0.41 ! [A: $tType,N: nat,X: A,Y: list @ A @ N] :
% 0.15/0.41 ( ( rev @ A @ ( suc @ N ) @ ( cons @ A @ N @ X @ Y ) )
% 0.15/0.41 = ( app @ A @ N @ ( suc @ zero ) @ ( rev @ A @ N @ Y ) @ ( cons @ A @ zero @ X @ ( nil @ A ) ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(plus_com,axiom,
% 0.15/0.41 ! [N: nat,M: nat] :
% 0.15/0.41 ( ( plus @ N @ M )
% 0.15/0.41 = ( plus @ M @ N ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(plus1r,axiom,
% 0.15/0.41 ! [N: nat] :
% 0.15/0.41 ( ( suc @ N )
% 0.15/0.41 = ( plus @ N @ ( suc @ zero ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(list_app_nil,axiom,
% 0.15/0.41 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.15/0.41 ( ( app @ A @ N @ zero @ L @ ( nil @ A ) )
% 0.15/0.41 = L ) ).
% 0.15/0.41
% 0.15/0.41 thf(list_rev_invol_step1,axiom,
% 0.15/0.41 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.15/0.41 ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.15/0.41 = ( rev @ A @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ ( rev @ A @ N @ L ) @ ( nil @ A ) ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(list_rev_invol_step2,axiom,
% 0.15/0.41 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.15/0.41 ( ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.15/0.41 = ( rev @ A @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ ( rev @ A @ N @ L ) @ ( nil @ A ) ) ) )
% 0.15/0.41 => ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.15/0.41 = ( app @ A @ zero @ N @ ( rev @ A @ zero @ ( nil @ A ) ) @ L ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(list_rev_invol_step3,axiom,
% 0.15/0.41 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.15/0.41 ( ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.15/0.41 = ( app @ A @ zero @ N @ ( rev @ A @ zero @ ( nil @ A ) ) @ L ) )
% 0.15/0.41 => ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.15/0.41 = ( app @ A @ zero @ N @ ( nil @ A ) @ L ) ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(list_rev_invol_step4,axiom,
% 0.15/0.41 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.15/0.41 ( ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.15/0.41 = ( app @ A @ zero @ N @ ( nil @ A ) @ L ) )
% 0.15/0.41 => ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.15/0.41 = L ) ) ).
% 0.15/0.41
% 0.15/0.41 thf(list_rev_invol,conjecture,
% 0.15/0.41 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.15/0.41 ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.15/0.41 = L ) ).
% 0.15/0.41
% 0.15/0.41 %------------------------------------------------------------------------------
% 0.15/0.41 ------------------------
% 1.42/1.18 ---- Embedded in THF ---
% 1.42/1.19 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.42/1.19 %%% Generated on Tue Feb 24 06:17:32 EST 2026
% 1.42/1.19 %%% using '$$dhol' embedding, version 1.3.0.
% 1.42/1.19 %%% Logic specification used:
% 1.42/1.19 %%% thf(spec, logic, $$dhol).
% 1.42/1.19
% 1.42/1.19 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2DTF28630.p
% 1.42/1.19 thf(is_per_type, type, isPer: (!> [A:$tType]: (((A > (A > $o)) > $o)))).
% 1.42/1.19 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.42/1.19 thf(nat_type, type, nat: $tType).
% 1.42/1.19 thf(natStar, type, 'natStar': (nat > (nat > $o))).
% 1.42/1.19 thf(natStar_is_eq, axiom, (! [X:nat,Y:nat]: (((('natStar' @ X) @ Y) <=> (X = Y))))).
% 1.42/1.19 thf(zero_type, type, zero: nat).
% 1.42/1.19 thf(suc_type, type, suc: (nat > nat)).
% 1.42/1.19 thf(plus_type, type, plus: (nat > (nat > nat))).
% 1.42/1.19 thf(list_type, type, list: ($tType > $tType)).
% 1.42/1.19 thf(listStar, type, 'listStar': (!> [A:$tType]: (((A > (A > $o)) > (nat > ((list @ A) > ((list @ A) > $o))))))).
% 1.42/1.19 thf('\'listStar\'_is_per', axiom, (! [B:$tType,BStar:(B > (B > $o))]: ((((isPer @ B) @ BStar) => (! [C:nat]: (((isPer @ (list @ B)) @ (((listStar @ B) @ BStar) @ C)))))))).
% 1.42/1.19 thf(nil_type, type, nil: (!> [A:$tType]: ((list @ A)))).
% 1.42/1.19 thf(nil_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (((((listStar @ A) @ AStar) @ zero) @ (nil @ A)) @ (nil @ A)))))).
% 1.42/1.19 thf(cons_type, type, cons: (!> [A:$tType]: ((nat > (A > ((list @ A) > (list @ A))))))).
% 1.42/1.19 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.42/1.19 thf(app_type, type, app: (!> [A:$tType]: ((nat > (nat > ((list @ A) > ((list @ A) > (list @ A)))))))).
% 1.42/1.19 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.42/1.19 thf(rev_type, type, rev: (!> [A:$tType]: ((nat > ((list @ A) > (list @ A)))))).
% 1.42/1.19 thf(rev_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [D:(list @ A),D_prime:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ D) @ D_prime) => (((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ D)) @ (((rev @ A) @ N) @ D_prime))))))))))).
% 1.42/1.19 thf(peano1, axiom, (! [N:nat]: (((suc @ N) != zero)))).
% 1.42/1.19 thf(peano2, axiom, (! [N:nat]: ((! [M:nat]: (((N != M) => ((suc @ N) != (suc @ M)))))))).
% 1.42/1.19 thf(peano3, axiom, (! [P:(nat > $o)]: (((P @ zero) => ((! [M:nat]: (((P @ M) => (P @ (suc @ M))))) => (! [N:nat]: ((P @ N)))))))).
% 1.42/1.19 thf(ax1, axiom, (! [N:nat]: ((((plus @ zero) @ N) = N)))).
% 1.42/1.19 thf(ax2, axiom, (! [N:nat]: ((! [M:nat]: ((((plus @ (suc @ N)) @ M) = (suc @ ((plus @ N) @ M)))))))).
% 1.42/1.19 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.42/1.19 thf(ax4, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [M:nat]: ((! [X:A]: ((! [Y:(list @ A),Z:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ Y) @ Y) => ((((((listStar @ A) @ AStar) @ M) @ Z) @ Z) => (((((listStar @ A) @ AStar) @ ((plus @ (suc @ N)) @ M)) @ (((((app @ A) @ (suc @ N)) @ M) @ ((((cons @ A) @ N) @ X) @ Y)) @ Z)) @ ((((cons @ A) @ ((plus @ N) @ M)) @ X) @ (((((app @ A) @ N) @ M) @ Y) @ Z))))))))))))))))).
% 1.42/1.19 thf(ax5, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (((((listStar @ A) @ AStar) @ zero) @ (((rev @ A) @ zero) @ (nil @ A))) @ (nil @ A)))))).
% 1.42/1.19 thf(ax6, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [X:A]: ((! [Y:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ Y) @ Y) => (((((listStar @ A) @ AStar) @ (suc @ N)) @ (((rev @ A) @ (suc @ N)) @ ((((cons @ A) @ N) @ X) @ Y))) @ (((((app @ A) @ N) @ (suc @ zero)) @ (((rev @ A) @ N) @ Y)) @ ((((cons @ A) @ zero) @ X) @ (nil @ A))))))))))))))).
% 1.42/1.19 thf(plus_com, axiom, (! [N:nat]: ((! [M:nat]: ((((plus @ N) @ M) = ((plus @ M) @ N))))))).
% 1.42/1.19 thf(plus1r, axiom, (! [N:nat]: (((suc @ N) = ((plus @ N) @ (suc @ zero)))))).
% 1.42/1.19 thf(list_app_nil, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [L:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ L) @ L) => (((((listStar @ A) @ AStar) @ ((plus @ N) @ zero)) @ (((((app @ A) @ N) @ zero) @ L) @ (nil @ A))) @ L)))))))))).
% 1.42/1.19 thf(list_rev_invol_step1, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [L:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ L) @ L) => (((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ (((rev @ A) @ N) @ L))) @ (((rev @ A) @ ((plus @ N) @ zero)) @ (((((app @ A) @ N) @ zero) @ (((rev @ A) @ N) @ L)) @ (nil @ A))))))))))))).
% 1.42/1.19 thf(list_rev_invol_step2, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [L:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ L) @ L) => ((((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ (((rev @ A) @ N) @ L))) @ (((rev @ A) @ ((plus @ N) @ zero)) @ (((((app @ A) @ N) @ zero) @ (((rev @ A) @ N) @ L)) @ (nil @ A)))) => (((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ (((rev @ A) @ N) @ L))) @ (((((app @ A) @ zero) @ N) @ (((rev @ A) @ zero) @ (nil @ A))) @ L)))))))))))).
% 1.42/1.19 thf(list_rev_invol_step3, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [L:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ L) @ L) => ((((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ (((rev @ A) @ N) @ L))) @ (((((app @ A) @ zero) @ N) @ (((rev @ A) @ zero) @ (nil @ A))) @ L)) => (((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ (((rev @ A) @ N) @ L))) @ (((((app @ A) @ zero) @ N) @ (nil @ A)) @ L)))))))))))).
% 1.42/1.19 thf(list_rev_invol_step4, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [L:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ L) @ L) => ((((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ (((rev @ A) @ N) @ L))) @ (((((app @ A) @ zero) @ N) @ (nil @ A)) @ L)) => (((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ (((rev @ A) @ N) @ L))) @ L))))))))))).
% 1.42/1.19 thf(list_rev_invol, conjecture, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [L:(list @ A)]: (((((((listStar @ A) @ AStar) @ N) @ L) @ L) => (((((listStar @ A) @ AStar) @ N) @ (((rev @ A) @ N) @ (((rev @ A) @ N) @ L))) @ L)))))))))).
% 1.42/1.19 % SZS output end ListOfTHF for /export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2DTF28630.p
% 1.42/1.19 ------------------------
% 1.56/1.20 ---- Cleaned THF ---
% 1.56/1.20 thf(is_per_type,type,
% 1.56/1.20 isPer:
% 1.56/1.20 !>[A: $tType] : ( ( A > A > $o ) > $o ) ).
% 1.56/1.20
% 1.56/1.20 thf(is_per,definition,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 <=> ( ! [X: A,Y: A] :
% 1.56/1.20 ( ( AStar @ X @ Y )
% 1.56/1.20 => ( AStar @ Y @ X ) )
% 1.56/1.20 & ! [X: A,Y: A,Z: A] :
% 1.56/1.20 ( ( AStar @ X @ Y )
% 1.56/1.20 => ( ( AStar @ Y @ Z )
% 1.56/1.20 => ( AStar @ X @ Z ) ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(nat_type,type,
% 1.56/1.20 nat: $tType ).
% 1.56/1.20
% 1.56/1.20 thf(natStar,type,
% 1.56/1.20 natStar: nat > nat > $o ).
% 1.56/1.20
% 1.56/1.20 thf(natStar_is_eq,axiom,
% 1.56/1.20 ! [X: nat,Y: nat] :
% 1.56/1.20 ( ( natStar @ X @ Y )
% 1.56/1.20 <=> ( X = Y ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(zero_type,type,
% 1.56/1.20 zero: nat ).
% 1.56/1.20
% 1.56/1.20 thf(suc_type,type,
% 1.56/1.20 suc: nat > nat ).
% 1.56/1.20
% 1.56/1.20 thf(plus_type,type,
% 1.56/1.20 plus: nat > nat > nat ).
% 1.56/1.20
% 1.56/1.20 thf(list_type,type,
% 1.56/1.20 list: $tType > $tType ).
% 1.56/1.20
% 1.56/1.20 thf(listStar,type,
% 1.56/1.20 listStar:
% 1.56/1.20 !>[A: $tType] : ( ( A > A > $o ) > nat > ( list @ A ) > ( list @ A ) > $o ) ).
% 1.56/1.20
% 1.56/1.20 thf('\'listStar\'_is_per',axiom,
% 1.56/1.20 ! [B: $tType,BStar: B > B > $o] :
% 1.56/1.20 ( ( isPer @ B @ BStar )
% 1.56/1.20 => ! [C: nat] : ( isPer @ ( list @ B ) @ ( listStar @ B @ BStar @ C ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(nil_type,type,
% 1.56/1.20 nil:
% 1.56/1.20 !>[A: $tType] : ( list @ A ) ).
% 1.56/1.20
% 1.56/1.20 thf(nil_tp_ax,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ( listStar @ A @ AStar @ zero @ ( nil @ A ) @ ( nil @ A ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(cons_type,type,
% 1.56/1.20 cons:
% 1.56/1.20 !>[A: $tType] : ( nat > A > ( list @ A ) > ( list @ A ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(cons_tp_ax,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,D: A,D_prime: A] :
% 1.56/1.20 ( ( D = D_prime )
% 1.56/1.20 => ! [D0: list @ A,D0_prime: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ D0 @ D0_prime )
% 1.56/1.20 => ( listStar @ A @ AStar @ ( suc @ N ) @ ( cons @ A @ N @ D @ D0 ) @ ( cons @ A @ N @ D_prime @ D0_prime ) ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(app_type,type,
% 1.56/1.20 app:
% 1.56/1.20 !>[A: $tType] : ( nat > nat > ( list @ A ) > ( list @ A ) > ( list @ A ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(app_tp_ax,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,M: nat,D: list @ A,D_prime: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ D @ D_prime )
% 1.56/1.20 => ! [D0: list @ A,D0_prime: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ M @ D0 @ D0_prime )
% 1.56/1.20 => ( listStar @ A @ AStar @ ( plus @ N @ M ) @ ( app @ A @ N @ M @ D @ D0 ) @ ( app @ A @ N @ M @ D_prime @ D0_prime ) ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(rev_type,type,
% 1.56/1.20 rev:
% 1.56/1.20 !>[A: $tType] : ( nat > ( list @ A ) > ( list @ A ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(rev_tp_ax,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,D: list @ A,D_prime: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ D @ D_prime )
% 1.56/1.20 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ D ) @ ( rev @ A @ N @ D_prime ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(peano1,axiom,
% 1.56/1.20 ! [N: nat] :
% 1.56/1.20 ( ( suc @ N )
% 1.56/1.20 != zero ) ).
% 1.56/1.20
% 1.56/1.20 thf(peano2,axiom,
% 1.56/1.20 ! [N: nat,M: nat] :
% 1.56/1.20 ( ( N != M )
% 1.56/1.20 => ( ( suc @ N )
% 1.56/1.20 != ( suc @ M ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(peano3,axiom,
% 1.56/1.20 ! [P: nat > $o] :
% 1.56/1.20 ( ( P @ zero )
% 1.56/1.20 => ( ! [M: nat] :
% 1.56/1.20 ( ( P @ M )
% 1.56/1.20 => ( P @ ( suc @ M ) ) )
% 1.56/1.20 => ! [N: nat] : ( P @ N ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(ax1,axiom,
% 1.56/1.20 ! [N: nat] :
% 1.56/1.20 ( ( plus @ zero @ N )
% 1.56/1.20 = N ) ).
% 1.56/1.20
% 1.56/1.20 thf(ax2,axiom,
% 1.56/1.20 ! [N: nat,M: nat] :
% 1.56/1.20 ( ( plus @ ( suc @ N ) @ M )
% 1.56/1.20 = ( suc @ ( plus @ N @ M ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(ax3,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,X: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ X @ X )
% 1.56/1.20 => ( listStar @ A @ AStar @ ( plus @ zero @ N ) @ ( app @ A @ zero @ N @ ( nil @ A ) @ X ) @ X ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(ax4,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,M: nat,X: A,Y: list @ A,Z: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ Y @ Y )
% 1.56/1.20 => ( ( listStar @ A @ AStar @ M @ Z @ Z )
% 1.56/1.20 => ( listStar @ A @ AStar @ ( plus @ ( suc @ N ) @ M ) @ ( app @ A @ ( suc @ N ) @ M @ ( cons @ A @ N @ X @ Y ) @ Z ) @ ( cons @ A @ ( plus @ N @ M ) @ X @ ( app @ A @ N @ M @ Y @ Z ) ) ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(ax5,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ( listStar @ A @ AStar @ zero @ ( rev @ A @ zero @ ( nil @ A ) ) @ ( nil @ A ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(ax6,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,X: A,Y: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ Y @ Y )
% 1.56/1.20 => ( listStar @ A @ AStar @ ( suc @ N ) @ ( rev @ A @ ( suc @ N ) @ ( cons @ A @ N @ X @ Y ) ) @ ( app @ A @ N @ ( suc @ zero ) @ ( rev @ A @ N @ Y ) @ ( cons @ A @ zero @ X @ ( nil @ A ) ) ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(plus_com,axiom,
% 1.56/1.20 ! [N: nat,M: nat] :
% 1.56/1.20 ( ( plus @ N @ M )
% 1.56/1.20 = ( plus @ M @ N ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(plus1r,axiom,
% 1.56/1.20 ! [N: nat] :
% 1.56/1.20 ( ( suc @ N )
% 1.56/1.20 = ( plus @ N @ ( suc @ zero ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(list_app_nil,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,L: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.56/1.20 => ( listStar @ A @ AStar @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ L @ ( nil @ A ) ) @ L ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(list_rev_invol_step1,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,L: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.56/1.20 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( rev @ A @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ ( rev @ A @ N @ L ) @ ( nil @ A ) ) ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(list_rev_invol_step2,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,L: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.56/1.20 => ( ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( rev @ A @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ ( rev @ A @ N @ L ) @ ( nil @ A ) ) ) )
% 1.56/1.20 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( app @ A @ zero @ N @ ( rev @ A @ zero @ ( nil @ A ) ) @ L ) ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(list_rev_invol_step3,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,L: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.56/1.20 => ( ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( app @ A @ zero @ N @ ( rev @ A @ zero @ ( nil @ A ) ) @ L ) )
% 1.56/1.20 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( app @ A @ zero @ N @ ( nil @ A ) @ L ) ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(list_rev_invol_step4,axiom,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,L: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.56/1.20 => ( ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( app @ A @ zero @ N @ ( nil @ A ) @ L ) )
% 1.56/1.20 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ L ) ) ) ) ).
% 1.56/1.20
% 1.56/1.20 thf(list_rev_invol,conjecture,
% 1.56/1.20 ! [A: $tType,AStar: A > A > $o] :
% 1.56/1.20 ( ( isPer @ A @ AStar )
% 1.56/1.20 => ! [N: nat,L: list @ A] :
% 1.56/1.20 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.56/1.20 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ L ) ) ) ).
% 1.56/1.20 ------------------------
% 1.56/1.22 % (28877)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_28630 for (2999ds/27Mi)
% 1.56/1.22 % (28879)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_28630 for (2999ds/2Mi)
% 1.56/1.22 % (28876)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_28630 for (2999ds/4Mi)
% 1.56/1.22 % (28879)Instruction limit reached!
% 1.56/1.22 % (28879)------------------------------
% 1.56/1.22 % (28879)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.22 % (28879)Termination reason: Unknown
% 1.56/1.22 % (28879)Termination phase: shuffling
% 1.56/1.22
% 1.56/1.22 % (28879)Memory used [KB]: 1023
% 1.56/1.22 % (28879)Time elapsed: 0.002 s
% 1.56/1.22 % (28879)Instructions burned: 2 (million)
% 1.56/1.22 % (28879)------------------------------
% 1.56/1.22 % (28879)------------------------------
% 1.56/1.22 % (28876)Instruction limit reached!
% 1.56/1.22 % (28876)------------------------------
% 1.56/1.22 % (28876)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.22 % (28876)Termination reason: Unknown
% 1.56/1.22 % (28876)Termination phase: shuffling
% 1.56/1.22
% 1.56/1.22 % (28876)Memory used [KB]: 1023
% 1.56/1.22 % (28876)Time elapsed: 0.003 s
% 1.56/1.22 % (28876)Instructions burned: 5 (million)
% 1.56/1.22 % (28876)------------------------------
% 1.56/1.22 % (28876)------------------------------
% 1.56/1.22 % (28875)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/183Mi)
% 1.56/1.22 % (28878)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/2Mi)
% 1.56/1.22 % (28880)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_28630 for (2999ds/275Mi)
% 1.56/1.22 % (28881)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/18Mi)
% 1.56/1.22 % (28878)Instruction limit reached!
% 1.56/1.22 % (28878)------------------------------
% 1.56/1.22 % (28878)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.22 % (28878)Termination reason: Unknown
% 1.56/1.22 % (28878)Termination phase: shuffling
% 1.56/1.22
% 1.56/1.22 % (28878)Memory used [KB]: 1023
% 1.56/1.22 % (28878)Time elapsed: 0.003 s
% 1.56/1.22 % (28878)Instructions burned: 2 (million)
% 1.56/1.22 % (28878)------------------------------
% 1.56/1.22 % (28878)------------------------------
% 1.56/1.22 % (28877)Instruction limit reached!
% 1.56/1.22 % (28877)------------------------------
% 1.56/1.22 % (28877)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.22 % (28877)Termination reason: Unknown
% 1.56/1.22 % (28877)Termination phase: Saturation
% 1.56/1.22
% 1.56/1.22 % (28877)Memory used [KB]: 5756
% 1.56/1.22 % (28877)Time elapsed: 0.011 s
% 1.56/1.22 % (28877)Instructions burned: 27 (million)
% 1.56/1.22 % (28877)------------------------------
% 1.56/1.22 % (28877)------------------------------
% 1.56/1.23 % (28885)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/3Mi)
% 1.56/1.23 % (28886)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_28630 for (2999ds/37Mi)
% 1.56/1.23 % (28885)Instruction limit reached!
% 1.56/1.23 % (28885)------------------------------
% 1.56/1.23 % (28885)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.23 % (28885)Termination reason: Unknown
% 1.56/1.23 % (28885)Termination phase: shuffling
% 1.56/1.23
% 1.56/1.23 % (28885)Memory used [KB]: 1023
% 1.56/1.23 % (28885)Time elapsed: 0.002 s
% 1.56/1.23 % (28885)Instructions burned: 3 (million)
% 1.56/1.23 % (28885)------------------------------
% 1.56/1.23 % (28885)------------------------------
% 1.56/1.23 % Exception at run slice level
% 1.56/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.56/1.23 % (28881)Instruction limit reached!
% 1.56/1.23 % (28881)------------------------------
% 1.56/1.23 % (28881)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.23 % (28881)Termination reason: Unknown
% 1.56/1.23 % (28881)Termination phase: Saturation
% 1.56/1.23
% 1.56/1.23 % (28881)Memory used [KB]: 5628
% 1.56/1.23 % (28881)Time elapsed: 0.013 s
% 1.56/1.23 % (28881)Instructions burned: 19 (million)
% 1.56/1.23 % (28881)------------------------------
% 1.56/1.23 % (28881)------------------------------
% 1.56/1.23 % (28892)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_28630 for (2999ds/3Mi)
% 1.56/1.23 % (28892)Instruction limit reached!
% 1.56/1.23 % (28892)------------------------------
% 1.56/1.23 % (28892)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.23 % (28892)Termination reason: Unknown
% 1.56/1.23 % (28892)Termination phase: shuffling
% 1.56/1.23
% 1.56/1.23 % (28892)Memory used [KB]: 1023
% 1.56/1.23 % (28892)Time elapsed: 0.002 s
% 1.56/1.23 % (28892)Instructions burned: 3 (million)
% 1.56/1.23 % (28892)------------------------------
% 1.56/1.23 % (28892)------------------------------
% 1.56/1.24 % (28893)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_28630 for (2999ds/1041Mi)
% 1.56/1.24 % Exception at run slice level
% 1.56/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.56/1.24 % (28895)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/7Mi)
% 1.56/1.24 % (28895)Instruction limit reached!
% 1.56/1.24 % (28895)------------------------------
% 1.56/1.24 % (28895)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.24 % (28895)Termination reason: Unknown
% 1.56/1.24 % (28895)Termination phase: Preprocessing 3
% 1.56/1.24
% 1.56/1.24 % (28895)Memory used [KB]: 1023
% 1.56/1.24 % (28895)Time elapsed: 0.004 s
% 1.56/1.24 % (28895)Instructions burned: 10 (million)
% 1.56/1.24 % (28895)------------------------------
% 1.56/1.24 % (28895)------------------------------
% 1.56/1.24 % (28891)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_28630 for (2999ds/15Mi)
% 1.56/1.24 % (28900)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_28630 for (2999ds/3Mi)
% 1.56/1.25 % (28901)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_28630 for (2999ds/3Mi)
% 1.56/1.25 % (28900)Instruction limit reached!
% 1.56/1.25 % (28900)------------------------------
% 1.56/1.25 % (28900)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.25 % (28900)Termination reason: Unknown
% 1.56/1.25 % (28900)Termination phase: shuffling
% 1.56/1.25
% 1.56/1.25 % (28900)Memory used [KB]: 1023
% 1.56/1.25 % (28900)Time elapsed: 0.003 s
% 1.56/1.25 % (28900)Instructions burned: 5 (million)
% 1.56/1.25 % (28900)------------------------------
% 1.56/1.25 % (28900)------------------------------
% 1.56/1.25 % (28901)Instruction limit reached!
% 1.56/1.25 % (28901)------------------------------
% 1.56/1.25 % (28901)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.25 % (28901)Termination reason: Unknown
% 1.56/1.25 % (28901)Termination phase: shuffling
% 1.56/1.25
% 1.56/1.25 % (28901)Memory used [KB]: 1023
% 1.56/1.25 % (28901)Time elapsed: 0.002 s
% 1.56/1.25 % (28901)Instructions burned: 3 (million)
% 1.56/1.25 % (28901)------------------------------
% 1.56/1.25 % (28901)------------------------------
% 1.56/1.25 % (28904)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/7Mi)
% 1.56/1.25 % (28891)Instruction limit reached!
% 1.56/1.25 % (28891)------------------------------
% 1.56/1.25 % (28891)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.25 % (28891)Termination reason: Unknown
% 1.56/1.25 % (28891)Termination phase: Saturation
% 1.56/1.25
% 1.56/1.25 % (28891)Memory used [KB]: 1151
% 1.56/1.25 % (28891)Time elapsed: 0.011 s
% 1.56/1.25 % (28891)Instructions burned: 16 (million)
% 1.56/1.25 % (28891)------------------------------
% 1.56/1.25 % (28891)------------------------------
% 1.56/1.25 % (28899)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/16Mi)
% 1.56/1.25 % (28904)Instruction limit reached!
% 1.56/1.25 % (28904)------------------------------
% 1.56/1.25 % (28904)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.25 % (28904)Termination reason: Unknown
% 1.56/1.25 % (28904)Termination phase: Preprocessing 3
% 1.56/1.25
% 1.56/1.25 % (28904)Memory used [KB]: 1023
% 1.56/1.25 % (28904)Time elapsed: 0.004 s
% 1.56/1.25 % (28904)Instructions burned: 9 (million)
% 1.56/1.25 % (28904)------------------------------
% 1.56/1.25 % (28904)------------------------------
% 1.56/1.26 % (28906)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/3Mi)
% 1.56/1.26 % (28907)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/4Mi)
% 1.56/1.26 % Exception at run slice level
% 1.56/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.56/1.26 % (28907)Instruction limit reached!
% 1.56/1.26 % (28907)------------------------------
% 1.56/1.26 % (28907)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.26 % (28907)Termination reason: Unknown
% 1.56/1.26 % (28907)Termination phase: Property scanning
% 1.56/1.26
% 1.56/1.26 % (28907)Memory used [KB]: 1023
% 1.56/1.26 % (28907)Time elapsed: 0.003 s
% 1.56/1.26 % (28907)Instructions burned: 6 (million)
% 1.56/1.26 % (28907)------------------------------
% 1.56/1.26 % (28907)------------------------------
% 1.56/1.26 % (28899)Instruction limit reached!
% 1.56/1.26 % (28899)------------------------------
% 1.56/1.26 % (28899)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.26 % (28899)Termination reason: Unknown
% 1.56/1.26 % (28899)Termination phase: Saturation
% 1.56/1.26
% 1.56/1.26 % (28899)Memory used [KB]: 5628
% 1.56/1.26 % (28899)Time elapsed: 0.011 s
% 1.56/1.26 % (28899)Instructions burned: 16 (million)
% 1.56/1.26 % (28899)------------------------------
% 1.56/1.26 % (28899)------------------------------
% 1.56/1.26 % (28912)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/710Mi)
% 1.56/1.27 % (28915)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/6Mi)
% 1.56/1.27 % (28917)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_28630 for (2999ds/902Mi)
% 1.56/1.27 % (28910)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/18Mi)
% 1.56/1.27 % (28915)Instruction limit reached!
% 1.56/1.27 % (28915)------------------------------
% 1.56/1.27 % (28915)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.27 % (28915)Termination reason: Unknown
% 1.56/1.27 % (28915)Termination phase: Property scanning
% 1.56/1.27
% 1.56/1.27 % (28915)Memory used [KB]: 1023
% 1.56/1.27 % (28915)Time elapsed: 0.003 s
% 1.56/1.27 % (28915)Instructions burned: 6 (million)
% 1.56/1.27 % (28915)------------------------------
% 1.56/1.27 % (28915)------------------------------
% 1.56/1.28 % (28924)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/5Mi)
% 1.56/1.28 % (28910)Instruction limit reached!
% 1.56/1.28 % (28910)------------------------------
% 1.56/1.28 % (28910)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.28 % (28910)Termination reason: Unknown
% 1.56/1.28 % (28910)Termination phase: Saturation
% 1.56/1.28
% 1.56/1.28 % (28910)Memory used [KB]: 5628
% 1.56/1.28 % (28910)Time elapsed: 0.012 s
% 1.56/1.28 % (28910)Instructions burned: 18 (million)
% 1.56/1.28 % (28910)------------------------------
% 1.56/1.28 % (28910)------------------------------
% 1.56/1.28 % (28919)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_28630 for (2999ds/21Mi)
% 1.56/1.28 % Exception at run slice level
% 1.56/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.56/1.29 % (28929)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/377Mi)
% 1.56/1.29 % (28919)Instruction limit reached!
% 1.56/1.29 % (28919)------------------------------
% 1.56/1.29 % (28919)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.29 % (28919)Termination reason: Unknown
% 1.56/1.29 % (28919)Termination phase: Saturation
% 1.56/1.29
% 1.56/1.29 % (28919)Memory used [KB]: 5628
% 1.56/1.29 % (28919)Time elapsed: 0.014 s
% 1.56/1.29 % (28919)Instructions burned: 21 (million)
% 1.56/1.29 % (28919)------------------------------
% 1.56/1.29 % (28919)------------------------------
% 1.56/1.29 % (28928)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_28630 for (2999ds/6Mi)
% 1.56/1.29 % Exception at run slice level
% 1.56/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.57/1.30 % (28875)Instruction limit reached!
% 1.57/1.30 % (28875)------------------------------
% 1.57/1.30 % (28875)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.30 % (28875)Termination reason: Unknown
% 1.57/1.30 % (28875)Termination phase: Saturation
% 1.57/1.30
% 1.57/1.30 % (28875)Memory used [KB]: 6396
% 1.57/1.30 % (28875)Time elapsed: 0.079 s
% 1.57/1.30 % (28875)Instructions burned: 184 (million)
% 1.57/1.30 % (28875)------------------------------
% 1.57/1.30 % (28875)------------------------------
% 1.57/1.30 % (28934)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_28630 for (2999ds/779Mi)
% 1.57/1.30 % Exception at run slice level
% 1.57/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.57/1.31 % (28936)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_28630 for (2999ds/19Mi)
% 1.57/1.31 % Exception at run slice level
% 1.57/1.31 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.57/1.31 % (28939)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/879Mi)
% 1.57/1.31 % (28941)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/17Mi)
% 1.57/1.32 % (28944)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_28630 for (2999ds/3Mi)
% 1.57/1.32 % (28944)Instruction limit reached!
% 1.57/1.32 % (28944)------------------------------
% 1.57/1.32 % (28944)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.32 % (28944)Termination reason: Unknown
% 1.57/1.32 % (28944)Termination phase: shuffling
% 1.57/1.32
% 1.57/1.32 % (28944)Memory used [KB]: 1023
% 1.57/1.32 % (28944)Time elapsed: 0.003 s
% 1.57/1.32 % (28944)Instructions burned: 4 (million)
% 1.57/1.32 % (28944)------------------------------
% 1.57/1.32 % (28944)------------------------------
% 1.57/1.32 % (28941)Instruction limit reached!
% 1.57/1.32 % (28941)------------------------------
% 1.57/1.32 % (28941)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.32 % (28941)Termination reason: Unknown
% 1.57/1.32 % (28941)Termination phase: Saturation
% 1.57/1.32
% 1.57/1.32 % (28941)Memory used [KB]: 5628
% 1.57/1.32 % (28941)Time elapsed: 0.007 s
% 1.57/1.32 % (28941)Instructions burned: 17 (million)
% 1.57/1.32 % (28941)------------------------------
% 1.57/1.32 % (28941)------------------------------
% 1.57/1.33 % (28949)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_28630 for (2998ds/127Mi)
% 1.57/1.33 % (28948)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_28630 for (2998ds/30Mi)
% 1.57/1.33 % (28880)Instruction limit reached!
% 1.57/1.33 % (28880)------------------------------
% 1.57/1.33 % (28880)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.33 % (28880)Termination reason: Unknown
% 1.57/1.33 % (28880)Termination phase: Saturation
% 1.57/1.33
% 1.57/1.33 % (28880)Memory used [KB]: 6012
% 1.57/1.33 % (28880)Time elapsed: 0.112 s
% 1.57/1.33 % (28880)Instructions burned: 276 (million)
% 1.57/1.33 % (28880)------------------------------
% 1.57/1.33 % (28880)------------------------------
% 1.57/1.34 % (28948)Instruction limit reached!
% 1.57/1.34 % (28948)------------------------------
% 1.57/1.34 % (28948)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.34 % (28948)Termination reason: Unknown
% 1.57/1.34 % (28948)Termination phase: Saturation
% 1.57/1.34
% 1.57/1.34 % (28948)Memory used [KB]: 5756
% 1.57/1.34 % (28948)Time elapsed: 0.012 s
% 1.57/1.34 % (28948)Instructions burned: 32 (million)
% 1.57/1.34 % (28948)------------------------------
% 1.57/1.34 % (28948)------------------------------
% 1.57/1.34 % (28957)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on DTF2THF_28630 for (2998ds/100Mi)
% 1.57/1.35 % (28961)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_28630 for (2998ds/3Mi)
% 1.57/1.35 % (28961)Instruction limit reached!
% 1.57/1.35 % (28961)------------------------------
% 1.57/1.35 % (28961)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.35 % (28961)Termination reason: Unknown
% 1.57/1.35 % (28961)Termination phase: shuffling
% 1.57/1.35
% 1.57/1.35 % (28961)Memory used [KB]: 1023
% 1.57/1.35 % (28961)Time elapsed: 0.003 s
% 1.57/1.35 % (28961)Instructions burned: 5 (million)
% 1.57/1.35 % (28961)------------------------------
% 1.57/1.35 % (28961)------------------------------
% 1.57/1.36 % (28965)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_28630 for (2998ds/20Mi)
% 1.57/1.37 % (28949)Instruction limit reached!
% 1.57/1.37 % (28949)------------------------------
% 1.57/1.37 % (28949)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.37 % (28949)Termination reason: Unknown
% 1.57/1.37 % (28949)Termination phase: Saturation
% 1.57/1.37
% 1.57/1.37 % (28949)Memory used [KB]: 6268
% 1.57/1.37 % (28949)Time elapsed: 0.039 s
% 1.57/1.37 % (28949)Instructions burned: 127 (million)
% 1.57/1.37 % (28949)------------------------------
% 1.57/1.37 % (28949)------------------------------
% 1.57/1.37 % (28965)Instruction limit reached!
% 1.57/1.37 % (28965)------------------------------
% 1.57/1.37 % (28965)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.37 % (28965)Termination reason: Unknown
% 1.57/1.37 % (28965)Termination phase: Saturation
% 1.57/1.37
% 1.57/1.37 % (28965)Memory used [KB]: 5628
% 1.57/1.37 % (28965)Time elapsed: 0.009 s
% 1.57/1.37 % (28965)Instructions burned: 22 (million)
% 1.57/1.37 % (28965)------------------------------
% 1.57/1.37 % (28965)------------------------------
% 1.57/1.37 % (28957)Instruction limit reached!
% 1.57/1.37 % (28957)------------------------------
% 1.57/1.37 % (28957)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.37 % (28957)Termination reason: Unknown
% 1.57/1.37 % (28957)Termination phase: Saturation
% 1.57/1.37
% 1.57/1.37 % (28957)Memory used [KB]: 6012
% 1.57/1.37 % (28957)Time elapsed: 0.030 s
% 1.57/1.37 % (28957)Instructions burned: 101 (million)
% 1.57/1.37 % (28957)------------------------------
% 1.57/1.37 % (28957)------------------------------
% 1.57/1.38 % (28973)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_28630 for (2998ds/86Mi)
% 1.57/1.38 % (28974)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_28630 for (2998ds/107Mi)
% 1.57/1.38 % (28978)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_28630 for (2998ds/39Mi)
% 1.57/1.38 % Exception at run slice level
% 1.57/1.38 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.57/1.39 % (28987)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_28630 for (2998ds/448Mi)
% 1.57/1.39 % Exception at run slice level
% 1.57/1.39 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.57/1.40 % (28996)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_28630 for (2998ds/46Mi)
% 1.57/1.40 % (28973)Instruction limit reached!
% 1.57/1.40 % (28973)------------------------------
% 1.57/1.40 % (28973)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.40 % (28973)Termination reason: Unknown
% 1.57/1.40 % (28973)Termination phase: Saturation
% 1.57/1.40
% 1.57/1.40 % (28973)Memory used [KB]: 6140
% 1.57/1.40 % (28973)Time elapsed: 0.049 s
% 1.57/1.40 % (28973)Instructions burned: 89 (million)
% 1.57/1.40 % (28973)------------------------------
% 1.57/1.40 % (28973)------------------------------
% 1.57/1.41 % (28929)Instruction limit reached!
% 1.57/1.41 % (28929)------------------------------
% 1.57/1.41 % (28929)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.41 % (28929)Termination reason: Unknown
% 1.57/1.41 % (28929)Termination phase: Saturation
% 1.57/1.41
% 1.57/1.41 % (28929)Memory used [KB]: 6140
% 1.57/1.41 % (28929)Time elapsed: 0.121 s
% 1.57/1.41 % (28929)Instructions burned: 378 (million)
% 1.57/1.41 % (28929)------------------------------
% 1.57/1.41 % (28929)------------------------------
% 1.57/1.41 % (29004)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_28630 for (2998ds/98Mi)
% 1.57/1.41 % Exception at run slice level
% 1.57/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.57/1.41 % (28974)Instruction limit reached!
% 1.57/1.41 % (28974)------------------------------
% 1.57/1.41 % (28974)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.41 % (28974)Termination reason: Unknown
% 1.57/1.41 % (28974)Termination phase: Saturation
% 1.57/1.41
% 1.57/1.41 % (28974)Memory used [KB]: 5884
% 1.57/1.41 % (28974)Time elapsed: 0.059 s
% 1.57/1.41 % (28974)Instructions burned: 107 (million)
% 1.57/1.41 % (28974)------------------------------
% 1.57/1.41 % (28974)------------------------------
% 1.57/1.42 % (28996)Instruction limit reached!
% 1.57/1.42 % (28996)------------------------------
% 1.57/1.42 % (28996)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.42 % (28996)Termination reason: Unknown
% 1.57/1.42 % (28996)Termination phase: Saturation
% 1.57/1.42
% 1.57/1.42 % (28996)Memory used [KB]: 5884
% 1.57/1.42 % (28996)Time elapsed: 0.015 s
% 1.57/1.42 % (28996)Instructions burned: 46 (million)
% 1.57/1.42 % (28996)------------------------------
% 1.57/1.42 % (28996)------------------------------
% 1.57/1.42 % (29007)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_28630 for (2997ds/507Mi)
% 1.57/1.42 % (29009)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_28630 for (2997ds/149Mi)
% 1.57/1.42 % (29010)lrs+21_1:16_au=on:bd=off:piset=and:i=39:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/39Mi)
% 1.57/1.43 % (29012)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_28630 for (2997ds/6Mi)
% 1.57/1.43 % Exception at run slice level
% 1.57/1.43 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.57/1.44 % (29017)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_28630 for (2997ds/1087Mi)
% 1.57/1.44 % (29010)Instruction limit reached!
% 1.57/1.44 % (29010)------------------------------
% 1.57/1.44 % (29010)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.44 % (29010)Termination reason: Unknown
% 1.57/1.44 % (29010)Termination phase: Saturation
% 1.57/1.44
% 1.57/1.44 % (29010)Memory used [KB]: 5756
% 1.57/1.44 % (29010)Time elapsed: 0.015 s
% 1.57/1.44 % (29010)Instructions burned: 40 (million)
% 1.57/1.44 % (29010)------------------------------
% 1.57/1.44 % (29010)------------------------------
% 1.57/1.45 % (29018)dis+10_1:1_aac=none:cs=on:i=47:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/47Mi)
% 1.57/1.46 % (29018)Instruction limit reached!
% 1.57/1.46 % (29018)------------------------------
% 1.57/1.46 % (29018)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.46 % (29018)Termination reason: Unknown
% 1.57/1.46 % (29018)Termination phase: Saturation
% 1.57/1.46
% 1.57/1.46 % (29018)Memory used [KB]: 5756
% 1.57/1.46 % (29018)Time elapsed: 0.018 s
% 1.57/1.46 % (29018)Instructions burned: 49 (million)
% 1.57/1.46 % (29018)------------------------------
% 1.57/1.46 % (29018)------------------------------
% 1.57/1.46 % (28912)Instruction limit reached!
% 1.57/1.46 % (28912)------------------------------
% 1.57/1.46 % (28912)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.46 % (28912)Termination reason: Unknown
% 1.57/1.46 % (28912)Termination phase: Saturation
% 1.57/1.46
% 1.57/1.46 % (28912)Memory used [KB]: 7291
% 1.57/1.46 % (28912)Time elapsed: 0.204 s
% 1.57/1.46 % (28912)Instructions burned: 710 (million)
% 1.57/1.46 % (28912)------------------------------
% 1.57/1.46 % (28912)------------------------------
% 1.57/1.47 % (29009)Instruction limit reached!
% 1.57/1.47 % (29009)------------------------------
% 1.57/1.47 % (29009)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.47 % (29009)Termination reason: Unknown
% 1.57/1.47 % (29009)Termination phase: Saturation
% 1.57/1.47
% 1.57/1.47 % (29009)Memory used [KB]: 6140
% 1.57/1.47 % (29009)Time elapsed: 0.048 s
% 1.57/1.47 % (29009)Instructions burned: 149 (million)
% 1.57/1.47 % (29009)------------------------------
% 1.57/1.47 % (29009)------------------------------
% 1.57/1.47 % (29019)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_28630 for (2997ds/44Mi)
% 1.57/1.47 % (29020)dis+10_1:1_av=off:bd=off:cnfonf=lazy_gen:fe=off:hud=10:plsq=on:plsqc=1:plsqr=32,1:prag=on:tnu=1:i=432:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/432Mi)
% 1.57/1.47 % Exception at run slice level
% 1.57/1.47 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.57/1.48 % Exception at run slice level
% 1.57/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.57/1.48 % (29021)lrs+10_7:1_cnfonf=lazy_gen:fe=off:nwc=5.0:plsq=on:i=62:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/62Mi)
% 1.57/1.48 % Exception at run slice level
% 1.57/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.57/1.48 % (29022)lrs+1010_1:16_add=large:amm=off:anc=all_dependent:chr=on:fd=off:ins=2:sp=const_max:tnu=5:uhcvi=on:i=31:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/31Mi)
% 1.57/1.48 % (29023)dis+10_1:128_hud=1:i=96:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/96Mi)
% 1.57/1.49 % (29024)lrs+1002_1:4_au=on:cbe=off:cnfonf=lazy_pi_sigma_gen:hud=15:inj=on:nwc=4.0:s2a=on:sac=on:sp=reverse_arity:i=453:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/453Mi)
% 1.57/1.49 % Exception at run slice level
% 1.57/1.49 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.57/1.49 % (29022)Instruction limit reached!
% 1.57/1.49 % (29022)------------------------------
% 1.57/1.49 % (29022)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.49 % (29022)Termination reason: Unknown
% 1.57/1.49 % (29022)Termination phase: Saturation
% 1.57/1.49
% 1.57/1.49 % (29022)Memory used [KB]: 5756
% 1.57/1.49 % (29022)Time elapsed: 0.010 s
% 1.57/1.49 % (29022)Instructions burned: 31 (million)
% 1.57/1.49 % (29022)------------------------------
% 1.57/1.49 % (29022)------------------------------
% 1.57/1.50 % (29025)lrs-1004_1:1_au=on:bsd=on:cbe=off:cnfonf=off:fe=axiom:fsd=on:i=71:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/71Mi)
% 1.57/1.50 % (29026)dis+1002_1:1_bd=off:fsr=off:ntd=on:s2a=on:ss=axioms:i=83:si=on:rtra=on_0 on DTF2THF_28630 for (2997ds/83Mi)
% 1.57/1.52 % (29023)Instruction limit reached!
% 1.57/1.52 % (29023)------------------------------
% 1.57/1.52 % (29023)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.52 % (29023)Termination reason: Unknown
% 1.57/1.52 % (29023)Termination phase: Saturation
% 1.57/1.52
% 1.57/1.52 % (29023)Memory used [KB]: 5884
% 1.57/1.52 % (29023)Time elapsed: 0.032 s
% 1.57/1.52 % (29023)Instructions burned: 98 (million)
% 1.57/1.52 % (29023)------------------------------
% 1.57/1.52 % (29023)------------------------------
% 1.57/1.52 % (29025)Instruction limit reached!
% 1.57/1.52 % (29025)------------------------------
% 1.57/1.52 % (29025)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.52 % (29025)Termination reason: Unknown
% 1.57/1.52 % (29025)Termination phase: Saturation
% 1.57/1.52
% 1.57/1.52 % (29025)Memory used [KB]: 5884
% 1.57/1.52 % (29025)Time elapsed: 0.023 s
% 1.57/1.52 % (29025)Instructions burned: 71 (million)
% 1.57/1.52 % (29025)------------------------------
% 1.57/1.52 % (29025)------------------------------
% 1.57/1.52 % (29027)lrs+10_1:128_cnfonf=lazy_not_gen_be_off:hud=1:ins=1:i=11:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/11Mi)
% 1.57/1.53 % Exception at run slice level
% 1.57/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.57/1.53 % (29026)Instruction limit reached!
% 1.57/1.53 % (29026)------------------------------
% 1.57/1.53 % (29026)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.53 % (29026)Termination reason: Unknown
% 1.57/1.53 % (29026)Termination phase: Saturation
% 1.57/1.53
% 1.57/1.53 % (29026)Memory used [KB]: 6012
% 1.57/1.53 % (29026)Time elapsed: 0.026 s
% 1.57/1.53 % (29026)Instructions burned: 84 (million)
% 1.57/1.53 % (29026)------------------------------
% 1.57/1.53 % (29026)------------------------------
% 1.57/1.53 % (29028)lrs+1010_1:1_au=on:cbe=off:cnfonf=lazy_not_gen_be_off:fsr=off:spb=non_intro:i=41:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/41Mi)
% 1.57/1.53 % Exception at run slice level
% 1.57/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.57/1.53 % (29029)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/6Mi)
% 1.57/1.54 % (29030)dis+10_1:1_avsq=on:cnfonf=off:e2e=on:nm=32:i=150:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/150Mi)
% 1.57/1.54 % (29029)Instruction limit reached!
% 1.57/1.54 % (29029)------------------------------
% 1.57/1.54 % (29029)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.54 % (29029)Termination reason: Unknown
% 1.57/1.54 % (29029)Termination phase: Property scanning
% 1.57/1.54
% 1.57/1.54 % (29029)Memory used [KB]: 1023
% 1.57/1.54 % (29029)Time elapsed: 0.003 s
% 1.57/1.54 % (29029)Instructions burned: 7 (million)
% 1.57/1.54 % (29029)------------------------------
% 1.57/1.54 % (29029)------------------------------
% 1.57/1.54 % (28917)Instruction limit reached!
% 1.57/1.54 % (28917)------------------------------
% 1.57/1.54 % (28917)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.54 % (28917)Termination reason: Unknown
% 1.57/1.54 % (28917)Termination phase: Saturation
% 1.57/1.54
% 1.57/1.54 % (28917)Memory used [KB]: 6908
% 1.57/1.54 % (28917)Time elapsed: 0.274 s
% 1.57/1.54 % (28917)Instructions burned: 903 (million)
% 1.57/1.54 % (28917)------------------------------
% 1.57/1.54 % (28917)------------------------------
% 1.57/1.54 % (29031)ott+1010_1:1_au=on:s2a=on:sd=7:ss=axioms:st=1.5:i=343:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/343Mi)
% 1.57/1.55 % (29032)ott+1010_1:4_cbe=off:chr=on:hfsq=on:hfsqr=1,16:hud=3:sac=on:sp=unary_frequency:ss=axioms:st=5.0:tnu=2:i=109:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/109Mi)
% 1.57/1.55 % (29033)dis+10_1:1_au=on:c=on:e2e=on:fsr=off:sos=all:sp=const_frequency:ss=axioms:i=253:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/253Mi)
% 1.57/1.57 % (29007)Instruction limit reached!
% 1.57/1.57 % (29007)------------------------------
% 1.57/1.57 % (29007)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.57 % (29007)Termination reason: Unknown
% 1.57/1.57 % (29007)Termination phase: Saturation
% 1.57/1.57
% 1.57/1.57 % (29007)Memory used [KB]: 6268
% 1.57/1.57 % (29007)Time elapsed: 0.153 s
% 1.57/1.57 % (29007)Instructions burned: 509 (million)
% 1.57/1.57 % (29007)------------------------------
% 1.57/1.57 % (29007)------------------------------
% 1.57/1.58 % (29034)lrs+10_1:1_au=on:cnfonf=off:sd=1:sgt=16:ss=axioms:i=140:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/140Mi)
% 1.57/1.58 % (29032)Instruction limit reached!
% 1.57/1.58 % (29032)------------------------------
% 1.57/1.58 % (29032)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.58 % (29032)Termination reason: Unknown
% 1.57/1.58 % (29032)Termination phase: Saturation
% 1.57/1.58
% 1.57/1.58 % (29032)Memory used [KB]: 6140
% 1.57/1.58 % (29032)Time elapsed: 0.035 s
% 1.57/1.58 % (29032)Instructions burned: 111 (million)
% 1.57/1.58 % (29032)------------------------------
% 1.57/1.58 % (29032)------------------------------
% 1.57/1.58 % (29030)Instruction limit reached!
% 1.57/1.58 % (29030)------------------------------
% 1.57/1.58 % (29030)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.58 % (29030)Termination reason: Unknown
% 1.57/1.58 % (29030)Termination phase: Saturation
% 1.57/1.58
% 1.57/1.58 % (29030)Memory used [KB]: 6268
% 1.57/1.58 % (29030)Time elapsed: 0.046 s
% 1.57/1.58 % (29030)Instructions burned: 151 (million)
% 1.57/1.58 % (29030)------------------------------
% 1.57/1.58 % (29030)------------------------------
% 1.57/1.59 % (28939)Instruction limit reached!
% 1.57/1.59 % (28939)------------------------------
% 1.57/1.59 % (28939)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.59 % (28939)Termination reason: Unknown
% 1.57/1.59 % (28939)Termination phase: Saturation
% 1.57/1.59
% 1.57/1.59 % (28939)Memory used [KB]: 7036
% 1.57/1.59 % (28939)Time elapsed: 0.278 s
% 1.57/1.59 % (28939)Instructions burned: 881 (million)
% 1.57/1.59 % (28939)------------------------------
% 1.57/1.59 % (28939)------------------------------
% 1.57/1.59 % (29035)dis+1010_16:1_acc=model:au=on:avsq=on:cond=fast:plsq=on:plsqc=2:plsqr=9267,262144:i=614:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/614Mi)
% 1.57/1.59 % (29036)lrs+1002_1:1_e2e=on:fde=unused:fe=axiom:prag=on:sd=1:sos=on:ss=axioms:st=2.0:i=202:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/202Mi)
% 1.57/1.60 % (29037)dis+1002_1:1_au=on:cs=on:ins=3:kws=inv_frequency:nwc=10.0:ss=axioms:st=3.0:i=339:si=on:rtra=on_0 on DTF2THF_28630 for (2996ds/339Mi)
% 1.57/1.60 % (29017)First to succeed.
% 1.57/1.60 % (29036)Refutation not found, incomplete strategy
% 1.57/1.60 % (29036)------------------------------
% 1.57/1.60 % (29036)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.60 % (29036)Termination reason: Refutation not found, incomplete strategy
% 1.57/1.60
% 1.57/1.60
% 1.57/1.60 % (29036)Memory used [KB]: 5756
% 1.57/1.60 % (29036)Time elapsed: 0.009 s
% 1.57/1.60 % (29036)Instructions burned: 27 (million)
% 1.57/1.60 % (29036)------------------------------
% 1.57/1.60 % (29036)------------------------------
% 1.57/1.60 % (29017)Refutation found. Thanks to Tanya!
% 1.57/1.60 % SZS status Theorem for DTF2THF_28630
% 1.57/1.60 % SZS output start Proof for DTF2THF_28630
% 1.57/1.60 thf(type_def_6, type, nat: $tType).
% 1.57/1.60 thf(type_def_7, type, list: ($tType) > $tType).
% 1.57/1.60 thf(type_def_8, type, sK7: $tType).
% 1.57/1.60 thf(func_def_0, type, isPer: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.57/1.60 thf(func_def_2, type, nat: $tType).
% 1.57/1.60 thf(func_def_3, type, natStar: nat > nat > $o).
% 1.57/1.60 thf(func_def_4, type, zero: nat).
% 1.57/1.60 thf(func_def_5, type, suc: nat > nat).
% 1.57/1.60 thf(func_def_6, type, plus: nat > nat > nat).
% 1.57/1.60 thf(func_def_7, type, list: ($tType) > $tType).
% 1.57/1.60 thf(func_def_8, type, listStar: !>[X0: $tType]:((X0 > X0 > $o) > nat > list @ X0 > list @ X0 > $o)).
% 1.57/1.60 thf(func_def_9, type, nil: !>[X0: $tType]:(list @ X0)).
% 1.57/1.60 thf(func_def_10, type, cons: !>[X0: $tType]:(nat > X0 > list @ X0 > list @ X0)).
% 1.57/1.60 thf(func_def_11, type, app: !>[X0: $tType]:(nat > nat > list @ X0 > list @ X0 > list @ X0)).
% 1.57/1.60 thf(func_def_12, type, rev: !>[X0: $tType]:(nat > list @ X0 > list @ X0)).
% 1.57/1.60 thf(func_def_15, type, sP0: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.57/1.60 thf(func_def_16, type, sP1: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.57/1.60 thf(func_def_17, type, sK2: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.57/1.60 thf(func_def_18, type, sK3: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.57/1.60 thf(func_def_19, type, sK4: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.57/1.60 thf(func_def_20, type, sK5: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.57/1.60 thf(func_def_21, type, sK6: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.57/1.60 thf(func_def_22, type, sK8: sK7 > sK7 > $o).
% 1.57/1.60 thf(func_def_23, type, sK9: nat).
% 1.57/1.60 thf(func_def_24, type, sK10: list @ sK7).
% 1.57/1.60 thf(func_def_25, type, sK11: (nat > $o) > nat).
% 1.57/1.60 thf(func_def_27, type, ph13: !>[X0: $tType]:(X0)).
% 1.57/1.60 thf(f1667,plain,(
% 1.57/1.60 $false),
% 1.57/1.60 inference(avatar_sat_refutation,[status(thm)],[f371,f377,f378,f1666])).
% 1.57/1.60 thf(f1666,plain,(
% 1.57/1.60 ~spl12_8),
% 1.57/1.60 inference(avatar_contradiction_clause,[status(thm)],[f1665])).
% 1.57/1.60 thf(f1665,plain,(
% 1.57/1.60 $false | ~spl12_8),
% 1.57/1.60 inference(subsumption_resolution,[status(thm)],[f1664,f130])).
% 1.57/1.60 thf(f130,plain,(
% 1.57/1.60 ($true = (isPer @ sK7 @ sK8))),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f105])).
% 1.57/1.60 thf(f105,plain,(
% 1.57/1.60 (($true != (listStar @ sK7 @ sK8 @ sK9 @ (rev @ sK7 @ sK9 @ (rev @ sK7 @ sK9 @ sK10)) @ sK10)) & ($true = (listStar @ sK7 @ sK8 @ sK9 @ sK10 @ sK10))) & ($true = (isPer @ sK7 @ sK8))),
% 1.57/1.60 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10])],[f75,f104,f103])).
% 1.57/1.60 thf(f103,plain,(
% 1.57/1.60 ? [X0 : $tType,X1 : X0 > X0 > $o] : (? [X2 : nat,X3 : list @ X0] : (((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ X3) != $true) & ($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) & ((isPer @ X0 @ X1) = $true)) => (? [X3 : list @ sK7,X2 : nat] : (($true != (listStar @ sK7 @ sK8 @ X2 @ (rev @ sK7 @ X2 @ (rev @ sK7 @ X2 @ X3)) @ X3)) & ($true = (listStar @ sK7 @ sK8 @ X2 @ X3 @ X3))) & ($true = (isPer @ sK7 @ sK8)))),
% 1.57/1.60 introduced(definition,[],[choice_axiom])).
% 1.57/1.60 thf(f104,plain,(
% 1.57/1.60 ? [X3 : list @ sK7,X2 : nat] : (($true != (listStar @ sK7 @ sK8 @ X2 @ (rev @ sK7 @ X2 @ (rev @ sK7 @ X2 @ X3)) @ X3)) & ($true = (listStar @ sK7 @ sK8 @ X2 @ X3 @ X3))) => (($true != (listStar @ sK7 @ sK8 @ sK9 @ (rev @ sK7 @ sK9 @ (rev @ sK7 @ sK9 @ sK10)) @ sK10)) & ($true = (listStar @ sK7 @ sK8 @ sK9 @ sK10 @ sK10)))),
% 1.57/1.60 introduced(definition,[],[choice_axiom])).
% 1.57/1.60 thf(f75,plain,(
% 1.57/1.60 ? [X0 : $tType,X1 : X0 > X0 > $o] : (? [X2 : nat,X3 : list @ X0] : (((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ X3) != $true) & ($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) & ((isPer @ X0 @ X1) = $true))),
% 1.57/1.60 inference(ennf_transformation,[status(thm)],[f36])).
% 1.57/1.60 thf(f36,plain,(
% 1.57/1.60 ~! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat,X3 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) => ((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ X3) = $true)))),
% 1.57/1.60 inference(fool_elimination,[status(thm)],[f35])).
% 1.57/1.60 thf(f35,plain,(
% 1.57/1.60 ~! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X3 @ X3) => (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ X3)))),
% 1.57/1.60 inference(rectify,[status(thm)],[f25])).
% 1.57/1.60 thf(f25,negated_conjecture,(
% 1.57/1.60 ~! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X15 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X15 @ X15) => (listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ (rev @ X0 @ X8 @ X15)) @ X15)))),
% 1.57/1.60 inference(negated_conjecture,[status(cth)],[f24])).
% 1.57/1.60 thf(f24,conjecture,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X15 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X15 @ X15) => (listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ (rev @ X0 @ X8 @ X15)) @ X15)))),
% 1.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p',list_rev_invol)).
% 1.57/1.60 thf(f1664,plain,(
% 1.57/1.60 ($true != (isPer @ sK7 @ sK8)) | ~spl12_8),
% 1.57/1.60 inference(subsumption_resolution,[status(thm)],[f1653,f131])).
% 1.57/1.60 thf(f131,plain,(
% 1.57/1.60 ($true = (listStar @ sK7 @ sK8 @ sK9 @ sK10 @ sK10))),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f105])).
% 1.57/1.60 thf(f1653,plain,(
% 1.57/1.60 ($true != (listStar @ sK7 @ sK8 @ sK9 @ sK10 @ sK10)) | ($true != (isPer @ sK7 @ sK8)) | ~spl12_8),
% 1.57/1.60 inference(trivial_inequality_removal,[status(thm)],[f1650])).
% 1.57/1.60 thf(f1650,plain,(
% 1.57/1.60 ($true != (isPer @ sK7 @ sK8)) | ($true != (listStar @ sK7 @ sK8 @ sK9 @ sK10 @ sK10)) | ($true != $true) | ~spl12_8),
% 1.57/1.60 inference(superposition,[status(thm)],[f1649,f488])).
% 1.57/1.60 thf(f488,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (($true = (listStar @ X0 @ X1 @ X2 @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X3)) | ((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.57/1.60 inference(forward_demodulation,[status(thm)],[f108,f110])).
% 1.57/1.60 thf(f110,plain,(
% 1.57/1.60 ( ! [X0 : nat] : (((plus @ zero @ X0) = X0)) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f63])).
% 1.57/1.60 thf(f63,plain,(
% 1.57/1.60 ! [X0 : nat] : ((plus @ zero @ X0) = X0)),
% 1.57/1.60 inference(rectify,[status(thm)],[f11])).
% 1.57/1.60 thf(f11,axiom,(
% 1.57/1.60 ! [X8 : nat] : ((plus @ zero @ X8) = X8)),
% 1.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p',ax1)).
% 1.57/1.60 thf(f108,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) | ((isPer @ X0 @ X1) != $true) | ($true = (listStar @ X0 @ X1 @ (plus @ zero @ X2) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3) @ X3))) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f80])).
% 1.57/1.60 thf(f80,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [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))) | ((isPer @ X0 @ X1) != $true))),
% 1.57/1.60 inference(ennf_transformation,[status(thm)],[f46])).
% 1.57/1.60 thf(f46,plain,(
% 1.57/1.60 ! [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.57/1.60 inference(fool_elimination,[status(thm)],[f45])).
% 1.57/1.60 thf(f45,plain,(
% 1.57/1.60 ! [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.57/1.60 inference(rectify,[status(thm)],[f13])).
% 1.57/1.60 thf(f13,axiom,(
% 1.57/1.60 ! [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.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p',ax3)).
% 1.57/1.60 thf(f1649,plain,(
% 1.57/1.60 ($true != (listStar @ sK7 @ sK8 @ sK9 @ (app @ sK7 @ zero @ sK9 @ nil @ sK7 @ sK10) @ sK10)) | ~spl12_8),
% 1.57/1.60 inference(subsumption_resolution,[status(thm)],[f1648,f130])).
% 1.57/1.60 thf(f1648,plain,(
% 1.57/1.60 ($true != (listStar @ sK7 @ sK8 @ sK9 @ (app @ sK7 @ zero @ sK9 @ nil @ sK7 @ sK10) @ sK10)) | ($true != (isPer @ sK7 @ sK8)) | ~spl12_8),
% 1.57/1.60 inference(subsumption_resolution,[status(thm)],[f1630,f131])).
% 1.57/1.60 thf(f1630,plain,(
% 1.57/1.60 ($true != (listStar @ sK7 @ sK8 @ sK9 @ (app @ sK7 @ zero @ sK9 @ nil @ sK7 @ sK10) @ sK10)) | ($true != (listStar @ sK7 @ sK8 @ sK9 @ sK10 @ sK10)) | ($true != (isPer @ sK7 @ sK8)) | ~spl12_8),
% 1.57/1.60 inference(trivial_inequality_removal,[status(thm)],[f1628])).
% 1.57/1.60 thf(f1628,plain,(
% 1.57/1.60 ($true != (listStar @ sK7 @ sK8 @ sK9 @ (app @ sK7 @ zero @ sK9 @ nil @ sK7 @ sK10) @ sK10)) | ($true != $true) | ($true != (listStar @ sK7 @ sK8 @ sK9 @ sK10 @ sK10)) | ($true != (isPer @ sK7 @ sK8)) | ~spl12_8),
% 1.57/1.60 inference(superposition,[status(thm)],[f370,f640])).
% 1.57/1.60 thf(f640,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)) = $true) | ((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.57/1.60 inference(trivial_inequality_removal,[status(thm)],[f639])).
% 1.57/1.60 thf(f639,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)) = $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) | ($true != $true)) )),
% 1.57/1.60 inference(duplicate_literal_removal,[status(thm)],[f637])).
% 1.57/1.60 thf(f637,plain,(
% 1.57/1.60 ( ! [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 @ X2 @ X3 @ X3)) | ((isPer @ X0 @ X1) != $true) | ((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)) = $true) | ($true != $true)) )),
% 1.57/1.60 inference(superposition,[status(thm)],[f139,f633])).
% 1.57/1.60 thf(f633,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))) | ((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.57/1.60 inference(subsumption_resolution,[status(thm)],[f632,f563])).
% 1.57/1.60 thf(f563,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ X2 @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0)))) | ((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.57/1.60 inference(forward_demodulation,[status(thm)],[f129,f142])).
% 1.57/1.60 thf(f142,plain,(
% 1.57/1.60 ( ! [X0 : nat] : (((plus @ X0 @ zero) = X0)) )),
% 1.57/1.60 inference(superposition,[status(thm)],[f127,f110])).
% 1.57/1.60 thf(f127,plain,(
% 1.57/1.60 ( ! [X0 : nat,X1 : nat] : (((plus @ X0 @ X1) = (plus @ X1 @ X0))) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f64])).
% 1.57/1.60 thf(f64,plain,(
% 1.57/1.60 ! [X0 : nat,X1 : nat] : ((plus @ X0 @ X1) = (plus @ X1 @ X0))),
% 1.57/1.60 inference(rectify,[status(thm)],[f17])).
% 1.57/1.60 thf(f17,axiom,(
% 1.57/1.60 ! [X8 : nat,X13 : nat] : ((plus @ X8 @ X13) = (plus @ X13 @ X8))),
% 1.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p',plus_com)).
% 1.57/1.60 thf(f129,plain,(
% 1.57/1.60 ( ! [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 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0))))) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f69])).
% 1.57/1.60 thf(f69,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : nat,X3 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0)))) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) | ((isPer @ X0 @ X1) != $true))),
% 1.57/1.60 inference(ennf_transformation,[status(thm)],[f62])).
% 1.57/1.60 thf(f62,plain,(
% 1.57/1.60 ! [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 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0))))))),
% 1.57/1.60 inference(fool_elimination,[status(thm)],[f61])).
% 1.57/1.60 thf(f61,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X3 @ X3) => (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0)))))),
% 1.57/1.60 inference(rectify,[status(thm)],[f20])).
% 1.57/1.60 thf(f20,axiom,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X15 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X15 @ X15) => (listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ (rev @ X0 @ X8 @ X15)) @ (rev @ X0 @ (plus @ X8 @ zero) @ (app @ X0 @ X8 @ zero @ (rev @ X0 @ X8 @ X15) @ nil @ X0)))))),
% 1.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p',list_rev_invol_step1)).
% 1.57/1.60 thf(f632,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))) | ($true != (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ X2 @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0)))) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.57/1.60 inference(forward_demodulation,[status(thm)],[f123,f142])).
% 1.57/1.60 thf(f123,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (($true != (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0)))) | ((isPer @ X0 @ X1) != $true) | ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f85])).
% 1.57/1.60 thf(f85,plain,(
% 1.57/1.60 ! [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 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0)))) | ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3)))))),
% 1.57/1.60 inference(flattening,[status(thm)],[f84])).
% 1.57/1.60 thf(f84,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : nat,X3 : list @ X0] : ((($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))) | ($true != (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0))))) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) | ((isPer @ X0 @ X1) != $true))),
% 1.57/1.60 inference(ennf_transformation,[status(thm)],[f52])).
% 1.57/1.60 thf(f52,plain,(
% 1.57/1.60 ! [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 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0)))) => ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))))))),
% 1.57/1.60 inference(fool_elimination,[status(thm)],[f51])).
% 1.57/1.60 thf(f51,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X3 @ X3) => ((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0))) => (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3)))))),
% 1.57/1.60 inference(rectify,[status(thm)],[f21])).
% 1.57/1.60 thf(f21,axiom,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X15 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X15 @ X15) => ((listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ (rev @ X0 @ X8 @ X15)) @ (rev @ X0 @ (plus @ X8 @ zero) @ (app @ X0 @ X8 @ zero @ (rev @ X0 @ X8 @ X15) @ nil @ X0))) => (listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ (rev @ X0 @ X8 @ X15)) @ (app @ X0 @ zero @ X8 @ (rev @ X0 @ zero @ nil @ X0) @ X15)))))),
% 1.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p',list_rev_invol_step2)).
% 1.57/1.60 thf(f139,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (($true != (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))) | ((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) | ((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)) = $true)) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f82])).
% 1.57/1.60 thf(f82,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : nat,X3 : list @ X0] : (($true != (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))) | ((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)) = $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))))),
% 1.57/1.60 inference(flattening,[status(thm)],[f81])).
% 1.57/1.60 thf(f81,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : nat,X3 : list @ X0] : ((((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)) = $true) | ($true != (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3)))) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) | ((isPer @ X0 @ X1) != $true))),
% 1.57/1.60 inference(ennf_transformation,[status(thm)],[f38])).
% 1.57/1.60 thf(f38,plain,(
% 1.57/1.60 ! [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 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))) => ((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)) = $true))))),
% 1.57/1.60 inference(fool_elimination,[status(thm)],[f37])).
% 1.57/1.60 thf(f37,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X3 @ X3) => ((listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3)) => (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)))))),
% 1.57/1.60 inference(rectify,[status(thm)],[f22])).
% 1.57/1.60 thf(f22,axiom,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X15 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X15 @ X15) => ((listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ (rev @ X0 @ X8 @ X15)) @ (app @ X0 @ zero @ X8 @ (rev @ X0 @ zero @ nil @ X0) @ X15)) => (listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ (rev @ X0 @ X8 @ X15)) @ (app @ X0 @ zero @ X8 @ nil @ X0 @ X15)))))),
% 1.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p',list_rev_invol_step3)).
% 1.57/1.60 thf(f370,plain,(
% 1.57/1.60 ( ! [X0 : list @ sK7] : (($true != (listStar @ sK7 @ sK8 @ sK9 @ (rev @ sK7 @ sK9 @ (rev @ sK7 @ sK9 @ sK10)) @ X0)) | ($true != (listStar @ sK7 @ sK8 @ sK9 @ X0 @ sK10))) ) | ~spl12_8),
% 1.57/1.60 inference(avatar_component_clause,[status(thm)],[f369])).
% 1.57/1.60 thf(f369,definition,(
% 1.57/1.60 spl12_8 <=> ! [X0 : list @ sK7] : (($true != (listStar @ sK7 @ sK8 @ sK9 @ (rev @ sK7 @ sK9 @ (rev @ sK7 @ sK9 @ sK10)) @ X0)) | ($true != (listStar @ sK7 @ sK8 @ sK9 @ X0 @ sK10)))),
% 1.57/1.60 introduced(definition,[new_symbols(naming,[spl12_8])],[avatar_definition])).
% 1.57/1.60 thf(f378,plain,(
% 1.57/1.60 ~spl12_3 | spl12_7),
% 1.57/1.60 inference(avatar_split_clause,[status(thm)],[f373,f366,f270])).
% 1.57/1.60 thf(f270,definition,(
% 1.57/1.60 spl12_3 <=> ($true = (sP1 @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9)))),
% 1.57/1.60 introduced(definition,[new_symbols(naming,[spl12_3])],[avatar_definition])).
% 1.57/1.60 thf(f366,definition,(
% 1.57/1.60 spl12_7 <=> ($true = (sP0 @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9)))),
% 1.57/1.60 introduced(definition,[new_symbols(naming,[spl12_7])],[avatar_definition])).
% 1.57/1.60 thf(f373,plain,(
% 1.57/1.60 ($true != (sP1 @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9))) | spl12_7),
% 1.57/1.60 inference(trivial_inequality_removal,[status(thm)],[f372])).
% 1.57/1.60 thf(f372,plain,(
% 1.57/1.60 ($true != (sP1 @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9))) | ($true != $true) | spl12_7),
% 1.57/1.60 inference(superposition,[status(thm)],[f367,f113])).
% 1.57/1.60 thf(f113,plain,(
% 1.57/1.60 ( ! [X1 : $tType,X0 : X1 > X1 > $o] : (($true = (sP0 @ X1 @ X0)) | ($true != (sP1 @ X1 @ X0))) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f97])).
% 1.57/1.60 thf(f97,plain,(
% 1.57/1.60 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP1 @ X1 @ X0)) | ($true != (sP0 @ X1 @ X0)) | (($true != (X0 @ (sK3 @ X1 @ X0) @ (sK2 @ X1 @ X0))) & ($true = (X0 @ (sK2 @ X1 @ X0) @ (sK3 @ X1 @ X0))))) & ((($true = (sP0 @ X1 @ X0)) & ! [X4 : X1,X5 : X1] : (($true = (X0 @ X5 @ X4)) | ($true != (X0 @ X4 @ X5)))) | ($true != (sP1 @ X1 @ X0))))),
% 1.57/1.60 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f95,f96])).
% 1.57/1.60 thf(f96,plain,(
% 1.57/1.60 ! [X1 : $tType,X0 : X1 > X1 > $o] : (? [X2 : X1,X3 : X1] : (((X0 @ X3 @ X2) != $true) & ($true = (X0 @ X2 @ X3))) => (($true != (X0 @ (sK3 @ X1 @ X0) @ (sK2 @ X1 @ X0))) & ($true = (X0 @ (sK2 @ X1 @ X0) @ (sK3 @ X1 @ X0)))))),
% 1.57/1.60 introduced(definition,[],[choice_axiom])).
% 1.57/1.60 thf(f95,plain,(
% 1.57/1.60 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP1 @ X1 @ X0)) | ($true != (sP0 @ X1 @ X0)) | ? [X2 : X1,X3 : X1] : (((X0 @ X3 @ X2) != $true) & ($true = (X0 @ X2 @ X3)))) & ((($true = (sP0 @ X1 @ X0)) & ! [X4 : X1,X5 : X1] : (($true = (X0 @ X5 @ X4)) | ($true != (X0 @ X4 @ X5)))) | ($true != (sP1 @ X1 @ X0))))),
% 1.57/1.60 inference(rectify,[status(thm)],[f94])).
% 1.57/1.60 thf(f94,plain,(
% 1.57/1.60 ! [X1 : X0 > X0 > $o,X0 : $tType] : ((($true = (sP1 @ X0 @ X1)) | ($true != (sP0 @ X0 @ X1)) | ? [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) != $true) & ((X1 @ X2 @ X3) = $true))) & ((($true = (sP0 @ X0 @ X1)) & ! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true))) | ($true != (sP1 @ X0 @ X1))))),
% 1.57/1.60 inference(flattening,[status(thm)],[f93])).
% 1.57/1.60 thf(f93,plain,(
% 1.57/1.60 ! [X1 : X0 > X0 > $o,X0 : $tType] : ((($true = (sP1 @ X0 @ X1)) | (($true != (sP0 @ X0 @ X1)) | ? [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) != $true) & ((X1 @ X2 @ X3) = $true)))) & ((($true = (sP0 @ X0 @ X1)) & ! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true))) | ($true != (sP1 @ X0 @ X1))))),
% 1.57/1.60 inference(nnf_transformation,[status(thm)],[f91])).
% 1.57/1.60 thf(f91,plain,(
% 1.57/1.60 ! [X1 : X0 > X0 > $o,X0 : $tType] : (($true = (sP1 @ X0 @ X1)) <=> (($true = (sP0 @ X0 @ X1)) & ! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true))))),
% 1.57/1.60 introduced(definition,[new_symbols(naming,[=])],[predicate_definition_introduction])).
% 1.57/1.60 thf(f367,plain,(
% 1.57/1.60 ($true != (sP0 @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9))) | spl12_7),
% 1.57/1.60 inference(avatar_component_clause,[status(thm)],[f366])).
% 1.57/1.60 thf(f377,plain,(
% 1.57/1.60 spl12_3),
% 1.57/1.60 inference(avatar_contradiction_clause,[status(thm)],[f376])).
% 1.57/1.60 thf(f376,plain,(
% 1.57/1.60 $false | spl12_3),
% 1.57/1.60 inference(subsumption_resolution,[status(thm)],[f375,f130])).
% 1.57/1.60 thf(f375,plain,(
% 1.57/1.60 ($true != (isPer @ sK7 @ sK8)) | spl12_3),
% 1.57/1.60 inference(trivial_inequality_removal,[status(thm)],[f374])).
% 1.57/1.60 thf(f374,plain,(
% 1.57/1.60 ($true != $true) | ($true != (isPer @ sK7 @ sK8)) | spl12_3),
% 1.57/1.60 inference(superposition,[status(thm)],[f277,f140])).
% 1.57/1.60 thf(f140,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X2 : nat,X1 : X0 > X0 > $o] : (($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))) | ((isPer @ X0 @ X1) != $true)) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f74])).
% 1.57/1.60 thf(f74,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : nat] : ($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))))),
% 1.57/1.60 inference(ennf_transformation,[status(thm)],[f44])).
% 1.57/1.60 thf(f44,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat] : ($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))))),
% 1.57/1.60 inference(fool_elimination,[status(thm)],[f43])).
% 1.57/1.60 thf(f43,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat] : (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2)))),
% 1.57/1.60 inference(rectify,[status(thm)],[f3])).
% 1.57/1.60 thf(f3,axiom,(
% 1.57/1.60 ! [X5 : $tType,X6 : X5 > X5 > $o] : ((isPer @ X5 @ X6) => ! [X7 : nat] : (isPer @ list @ X5 @ (listStar @ X5 @ X6 @ X7)))),
% 1.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p','\'listStar\'_is_per')).
% 1.57/1.60 thf(f277,plain,(
% 1.57/1.60 ($true != (isPer @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9))) | spl12_3),
% 1.57/1.60 inference(trivial_inequality_removal,[status(thm)],[f276])).
% 1.57/1.60 thf(f276,plain,(
% 1.57/1.60 ($true != (isPer @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9))) | ($true != $true) | spl12_3),
% 1.57/1.60 inference(superposition,[status(thm)],[f271,f121])).
% 1.57/1.60 thf(f121,plain,(
% 1.57/1.60 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (($true = (sP1 @ X0 @ X1)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f102])).
% 1.57/1.60 thf(f102,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((($true = (sP1 @ X0 @ X1)) | ((isPer @ X0 @ X1) != $true)) & (((isPer @ X0 @ X1) = $true) | ($true != (sP1 @ X0 @ X1))))),
% 1.57/1.60 inference(nnf_transformation,[status(thm)],[f92])).
% 1.57/1.60 thf(f92,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : (($true = (sP1 @ X0 @ X1)) <=> ((isPer @ X0 @ X1) = $true))),
% 1.57/1.60 inference(definition_folding,[status(thm)],[f89,f91,f90])).
% 1.57/1.60 thf(f90,plain,(
% 1.57/1.60 ! [X1 : X0 > X0 > $o,X0 : $tType] : (($true = (sP0 @ X0 @ X1)) <=> ! [X4 : X0,X5 : X0,X6 : X0] : (($true != (X1 @ X4 @ X5)) | ($true = (X1 @ X4 @ X6)) | ($true != (X1 @ X5 @ X6))))),
% 1.57/1.60 introduced(definition,[new_symbols(naming,[=])],[predicate_definition_introduction])).
% 1.57/1.60 thf(f89,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X4 : X0,X5 : X0,X6 : X0] : (($true != (X1 @ X4 @ X5)) | ($true = (X1 @ X4 @ X6)) | ($true != (X1 @ X5 @ X6))) & ! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.57/1.60 inference(flattening,[status(thm)],[f88])).
% 1.57/1.60 thf(f88,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X4 : X0,X5 : X0,X6 : X0] : ((($true = (X1 @ X4 @ X6)) | ($true != (X1 @ X5 @ X6))) | ($true != (X1 @ X4 @ X5))) & ! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.57/1.60 inference(ennf_transformation,[status(thm)],[f56])).
% 1.57/1.60 thf(f56,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X4 @ X5)) => (($true = (X1 @ X5 @ X6)) => ($true = (X1 @ X4 @ X6)))) & ! [X2 : X0,X3 : X0] : (((X1 @ X2 @ X3) = $true) => ((X1 @ X3 @ X2) = $true))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.57/1.60 inference(fool_elimination,[status(thm)],[f55])).
% 1.57/1.60 thf(f55,plain,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X2 : X0,X3 : X0] : ((X1 @ X2 @ X3) => (X1 @ X3 @ X2)) & ! [X4 : X0,X5 : X0,X6 : X0] : ((X1 @ X4 @ X5) => ((X1 @ X5 @ X6) => (X1 @ X4 @ X6)))) <=> (isPer @ X0 @ X1))),
% 1.57/1.60 inference(rectify,[status(thm)],[f1])).
% 1.57/1.60 thf(f1,axiom,(
% 1.57/1.60 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X2 : X0,X3 : X0] : ((X1 @ X2 @ X3) => (X1 @ X3 @ X2)) & ! [X2 : X0,X3 : X0,X4 : X0] : ((X1 @ X2 @ X3) => ((X1 @ X3 @ X4) => (X1 @ X2 @ X4)))) <=> (isPer @ X0 @ X1))),
% 1.57/1.60 file('/export/starexec/sandbox2/tmp/tmp.G5cTPWZ7qp/DTF2THF_28630.p',is_per)).
% 1.57/1.60 thf(f271,plain,(
% 1.57/1.60 ($true != (sP1 @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9))) | spl12_3),
% 1.57/1.60 inference(avatar_component_clause,[status(thm)],[f270])).
% 1.57/1.60 thf(f371,plain,(
% 1.57/1.60 ~spl12_7 | spl12_8),
% 1.57/1.60 inference(avatar_split_clause,[status(thm)],[f352,f369,f366])).
% 1.57/1.60 thf(f352,plain,(
% 1.57/1.60 ( ! [X0 : list @ sK7] : (($true != (sP0 @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9))) | ($true != (listStar @ sK7 @ sK8 @ sK9 @ (rev @ sK7 @ sK9 @ (rev @ sK7 @ sK9 @ sK10)) @ X0)) | ($true != (listStar @ sK7 @ sK8 @ sK9 @ X0 @ sK10))) )),
% 1.57/1.60 inference(trivial_inequality_removal,[status(thm)],[f343])).
% 1.57/1.60 thf(f343,plain,(
% 1.57/1.60 ( ! [X0 : list @ sK7] : (($true != (listStar @ sK7 @ sK8 @ sK9 @ X0 @ sK10)) | ($true != $true) | ($true != (listStar @ sK7 @ sK8 @ sK9 @ (rev @ sK7 @ sK9 @ (rev @ sK7 @ sK9 @ sK10)) @ X0)) | ($true != (sP0 @ list @ sK7 @ (listStar @ sK7 @ sK8 @ sK9)))) )),
% 1.57/1.60 inference(superposition,[status(thm)],[f132,f116])).
% 1.57/1.60 thf(f116,plain,(
% 1.57/1.60 ( ! [X1 : $tType,X0 : X1 > X1 > $o,X6 : X1,X7 : X1,X5 : X1] : (($true = (X0 @ X5 @ X7)) | ($true != (X0 @ X6 @ X7)) | ($true != (X0 @ X5 @ X6)) | ($true != (sP0 @ X1 @ X0))) )),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f101])).
% 1.57/1.60 thf(f101,plain,(
% 1.57/1.60 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP0 @ X1 @ X0)) | (($true = (X0 @ (sK4 @ X1 @ X0) @ (sK5 @ X1 @ X0))) & ($true != (X0 @ (sK4 @ X1 @ X0) @ (sK6 @ X1 @ X0))) & ($true = (X0 @ (sK5 @ X1 @ X0) @ (sK6 @ X1 @ X0))))) & (! [X5 : X1,X6 : X1,X7 : X1] : (($true != (X0 @ X5 @ X6)) | ($true = (X0 @ X5 @ X7)) | ($true != (X0 @ X6 @ X7))) | ($true != (sP0 @ X1 @ X0))))),
% 1.57/1.60 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f99,f100])).
% 1.57/1.60 thf(f100,plain,(
% 1.57/1.60 ! [X1 : $tType,X0 : X1 > X1 > $o] : (? [X2 : X1,X3 : X1,X4 : X1] : (($true = (X0 @ X2 @ X3)) & ($true != (X0 @ X2 @ X4)) & ($true = (X0 @ X3 @ X4))) => (($true = (X0 @ (sK4 @ X1 @ X0) @ (sK5 @ X1 @ X0))) & ($true != (X0 @ (sK4 @ X1 @ X0) @ (sK6 @ X1 @ X0))) & ($true = (X0 @ (sK5 @ X1 @ X0) @ (sK6 @ X1 @ X0)))))),
% 1.57/1.60 introduced(definition,[],[choice_axiom])).
% 1.57/1.60 thf(f99,plain,(
% 1.57/1.60 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP0 @ X1 @ X0)) | ? [X2 : X1,X3 : X1,X4 : X1] : (($true = (X0 @ X2 @ X3)) & ($true != (X0 @ X2 @ X4)) & ($true = (X0 @ X3 @ X4)))) & (! [X5 : X1,X6 : X1,X7 : X1] : (($true != (X0 @ X5 @ X6)) | ($true = (X0 @ X5 @ X7)) | ($true != (X0 @ X6 @ X7))) | ($true != (sP0 @ X1 @ X0))))),
% 1.57/1.60 inference(rectify,[status(thm)],[f98])).
% 1.57/1.60 thf(f98,plain,(
% 1.57/1.60 ! [X1 : X0 > X0 > $o,X0 : $tType] : ((($true = (sP0 @ X0 @ X1)) | ? [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X4 @ X5)) & ($true != (X1 @ X4 @ X6)) & ($true = (X1 @ X5 @ X6)))) & (! [X4 : X0,X5 : X0,X6 : X0] : (($true != (X1 @ X4 @ X5)) | ($true = (X1 @ X4 @ X6)) | ($true != (X1 @ X5 @ X6))) | ($true != (sP0 @ X0 @ X1))))),
% 1.57/1.60 inference(nnf_transformation,[status(thm)],[f90])).
% 1.57/1.60 thf(f132,plain,(
% 1.57/1.60 ($true != (listStar @ sK7 @ sK8 @ sK9 @ (rev @ sK7 @ sK9 @ (rev @ sK7 @ sK9 @ sK10)) @ sK10))),
% 1.57/1.60 inference(cnf_transformation,[status(thm)],[f105])).
% 1.57/1.60 % SZS output end Proof for DTF2THF_28630
% 1.57/1.60 % (29017)------------------------------
% 1.57/1.60 % (29017)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.57/1.60 % (29017)Termination reason: Refutation
% 1.57/1.60
% 1.57/1.60 % (29017)Memory used [KB]: 7036
% 1.57/1.60 % (29017)Time elapsed: 0.164 s
% 1.57/1.60 % (29017)Instructions burned: 518 (million)
% 1.57/1.60 % (29017)------------------------------
% 1.57/1.60 % (29017)------------------------------
% 1.57/1.60 % (28873)Success in time 0.383 s
%------------------------------------------------------------------------------