%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : DAT403^1 : TPTP v9.2.1. Released v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n031.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:40 AM UTC 2026
% Result : Theorem 1.83s 1.65s
% Output : Refutation 1.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT403^1 : TPTP v9.2.1. Released v9.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.34 % Computer : n031.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 06:18:18 EST 2026
% 0.16/0.35 % CPUTime :
% 0.16/0.35 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.20/0.45 ---- Original DTF file ---
% 0.20/0.45 thf(spec,logic,$$dhol).
% 0.20/0.45 %------------------------------------------------------------------------------
% 0.20/0.45 % File : DAT403^1 : TPTP v9.2.1. Released v9.2.0.
% 0.20/0.45 % Domain : Data Structures
% 0.20/0.45 % Problem : List reversal involution polymorphic, step 1
% 0.20/0.45 % Version : Especial.
% 0.20/0.45 % English : List reversal involution for polymorphic fixed-length lists. The
% 0.20/0.45 % proof is split into smaller steps. To simplify proof search, the
% 0.20/0.45 % axioms in each problem file have been preselected.
% 0.20/0.45
% 0.20/0.45 % Refs : [RRB23] Rothgang et al. (2023), Theorem Proving in Dependently
% 0.20/0.45 % : [Rot25] Rothgang (2025), Email to Geoff Sutcliffe
% 0.20/0.45 % : [RK+25] Ranalter et al. (2025), The Dependently Typed Higher-O
% 0.20/0.45 % Source : [Rot25]
% 0.20/0.45 % Names : ListReversalInvolution/list-rev-invol-step1.p [Rot25]
% 0.20/0.45
% 0.20/0.45 % Status : Theorem
% 0.20/0.45 % Rating : ? v9.2.0
% 0.20/0.45 % Syntax : Number of formulae : 22 ( 11 unt; 9 typ; 0 def)
% 0.20/0.45 % Number of atoms : 13 ( 13 equ; 0 cnn)
% 0.20/0.45 % Maximal formula atoms : 2 ( 1 avg)
% 0.20/0.45 % Number of connectives : 142 ( 3 ~; 0 |; 0 &; 135 @)
% 0.20/0.45 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.20/0.45 % Maximal formula depth : 8 ( 4 avg)
% 0.20/0.45 % Number of types : 2 ( 1 usr)
% 0.20/0.45 % Number of type decls : 9 ( 4 !>P; 3 !>D)
% 0.20/0.45 % Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% 0.20/0.45 % Number of symbols : 9 ( 8 usr; 1 con; 0-5 aty)
% 0.20/0.45 % Number of variables : 40 ( 0 ^; 32 !; 0 ?; 40 :)
% 0.20/0.45 % ( 8 !>; 0 ?*; 0 @-; 0 @+)
% 0.20/0.45 % SPC : DH1_THM_EQU_NAR
% 0.20/0.45
% 0.20/0.45 % Comments :
% 0.20/0.45 %------------------------------------------------------------------------------
% 0.20/0.45 thf(nat_type,type,
% 0.20/0.45 nat: $tType ).
% 0.20/0.45
% 0.20/0.45 thf(zero_type,type,
% 0.20/0.45 zero: nat ).
% 0.20/0.45
% 0.20/0.45 thf(suc_type,type,
% 0.20/0.45 suc: nat > nat ).
% 0.20/0.45
% 0.20/0.45 thf(plus_type,type,
% 0.20/0.45 plus: nat > nat > nat ).
% 0.20/0.45
% 0.20/0.45 thf(list_type,type,
% 0.20/0.45 list: $tType > nat > $tType ).
% 0.20/0.45
% 0.20/0.45 thf(nil_type,type,
% 0.20/0.45 nil:
% 0.20/0.45 !>[A: $tType] : ( list @ A @ zero ) ).
% 0.20/0.45
% 0.20/0.45 thf(cons_type,type,
% 0.20/0.45 cons:
% 0.20/0.45 !>[A: $tType,N: nat] : ( A > ( list @ A @ N ) > ( list @ A @ ( suc @ N ) ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(app_type,type,
% 0.20/0.45 app:
% 0.20/0.45 !>[A: $tType,N: nat,M: nat] : ( ( list @ A @ N ) > ( list @ A @ M ) > ( list @ A @ ( plus @ N @ M ) ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(rev_type,type,
% 0.20/0.45 rev:
% 0.20/0.45 !>[A: $tType,N: nat] : ( ( list @ A @ N ) > ( list @ A @ N ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(peano1,axiom,
% 0.20/0.45 ! [N: nat] :
% 0.20/0.45 ( ( suc @ N )
% 0.20/0.45 != zero ) ).
% 0.20/0.45
% 0.20/0.45 thf(peano2,axiom,
% 0.20/0.45 ! [N: nat,M: nat] :
% 0.20/0.45 ( ( N != M )
% 0.20/0.45 => ( ( suc @ N )
% 0.20/0.45 != ( suc @ M ) ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(peano3,axiom,
% 0.20/0.45 ! [P: nat > $o] :
% 0.20/0.45 ( ( P @ zero )
% 0.20/0.45 => ( ! [M: nat] :
% 0.20/0.45 ( ( P @ M )
% 0.20/0.45 => ( P @ ( suc @ M ) ) )
% 0.20/0.45 => ! [N: nat] : ( P @ N ) ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(ax1,axiom,
% 0.20/0.45 ! [N: nat] :
% 0.20/0.45 ( ( plus @ zero @ N )
% 0.20/0.45 = N ) ).
% 0.20/0.45
% 0.20/0.45 thf(ax2,axiom,
% 0.20/0.45 ! [N: nat,M: nat] :
% 0.20/0.45 ( ( plus @ ( suc @ N ) @ M )
% 0.20/0.45 = ( suc @ ( plus @ N @ M ) ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(ax3,axiom,
% 0.20/0.45 ! [A: $tType,N: nat,X: list @ A @ N] :
% 0.20/0.45 ( ( app @ A @ zero @ N @ ( nil @ A ) @ X )
% 0.20/0.45 = X ) ).
% 0.20/0.45
% 0.20/0.45 thf(ax4,axiom,
% 0.20/0.45 ! [A: $tType,N: nat,M: nat,X: A,Y: list @ A @ N,Z: list @ A @ M] :
% 0.20/0.45 ( ( app @ A @ ( suc @ N ) @ M @ ( cons @ A @ N @ X @ Y ) @ Z )
% 0.20/0.45 = ( cons @ A @ ( plus @ N @ M ) @ X @ ( app @ A @ N @ M @ Y @ Z ) ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(ax5,axiom,
% 0.20/0.45 ! [A: $tType] :
% 0.20/0.45 ( ( rev @ A @ zero @ ( nil @ A ) )
% 0.20/0.45 = ( nil @ A ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(ax6,axiom,
% 0.20/0.45 ! [A: $tType,N: nat,X: A,Y: list @ A @ N] :
% 0.20/0.45 ( ( rev @ A @ ( suc @ N ) @ ( cons @ A @ N @ X @ Y ) )
% 0.20/0.45 = ( app @ A @ N @ ( suc @ zero ) @ ( rev @ A @ N @ Y ) @ ( cons @ A @ zero @ X @ ( nil @ A ) ) ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(plus_com,axiom,
% 0.20/0.45 ! [N: nat,M: nat] :
% 0.20/0.45 ( ( plus @ N @ M )
% 0.20/0.45 = ( plus @ M @ N ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(plus1r,axiom,
% 0.20/0.45 ! [N: nat] :
% 0.20/0.45 ( ( suc @ N )
% 0.20/0.45 = ( plus @ N @ ( suc @ zero ) ) ) ).
% 0.20/0.45
% 0.20/0.45 thf(list_app_nil,axiom,
% 0.20/0.45 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.20/0.45 ( ( app @ A @ N @ zero @ L @ ( nil @ A ) )
% 0.20/0.45 = L ) ).
% 0.20/0.45
% 0.20/0.45 thf(list_rev_invol_step1,conjecture,
% 0.20/0.45 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.20/0.45 ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.20/0.45 = ( rev @ A @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ ( rev @ A @ N @ L ) @ ( nil @ A ) ) ) ) ).
% 0.20/0.45
% 0.20/0.45 %------------------------------------------------------------------------------
% 0.20/0.45 ------------------------
% 1.72/1.33 ---- Embedded in THF ---
% 1.72/1.34 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.72/1.34 %%% Generated on Tue Feb 24 06:18:19 EST 2026
% 1.72/1.34 %%% using '$$dhol' embedding, version 1.3.0.
% 1.72/1.34 %%% Logic specification used:
% 1.72/1.34 %%% thf(spec, logic, $$dhol).
% 1.72/1.34
% 1.72/1.34 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2DTF6906.p
% 1.72/1.34 thf(is_per_type, type, isPer: (!> [A:$tType]: (((A > (A > $o)) > $o)))).
% 1.72/1.34 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.72/1.34 thf(nat_type, type, nat: $tType).
% 1.72/1.34 thf(natStar, type, 'natStar': (nat > (nat > $o))).
% 1.72/1.34 thf(natStar_is_eq, axiom, (! [X:nat,Y:nat]: (((('natStar' @ X) @ Y) <=> (X = Y))))).
% 1.72/1.34 thf(zero_type, type, zero: nat).
% 1.72/1.34 thf(suc_type, type, suc: (nat > nat)).
% 1.72/1.34 thf(plus_type, type, plus: (nat > (nat > nat))).
% 1.72/1.34 thf(list_type, type, list: ($tType > $tType)).
% 1.72/1.34 thf(listStar, type, 'listStar': (!> [A:$tType]: (((A > (A > $o)) > (nat > ((list @ A) > ((list @ A) > $o))))))).
% 1.72/1.34 thf('\'listStar\'_is_per', axiom, (! [B:$tType,BStar:(B > (B > $o))]: ((((isPer @ B) @ BStar) => (! [C:nat]: (((isPer @ (list @ B)) @ (((listStar @ B) @ BStar) @ C)))))))).
% 1.72/1.34 thf(nil_type, type, nil: (!> [A:$tType]: ((list @ A)))).
% 1.72/1.34 thf(nil_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (((((listStar @ A) @ AStar) @ zero) @ (nil @ A)) @ (nil @ A)))))).
% 1.72/1.34 thf(cons_type, type, cons: (!> [A:$tType]: ((nat > (A > ((list @ A) > (list @ A))))))).
% 1.72/1.34 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.72/1.34 thf(app_type, type, app: (!> [A:$tType]: ((nat > (nat > ((list @ A) > ((list @ A) > (list @ A)))))))).
% 1.72/1.34 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.72/1.34 thf(rev_type, type, rev: (!> [A:$tType]: ((nat > ((list @ A) > (list @ A)))))).
% 1.72/1.34 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.72/1.34 thf(peano1, axiom, (! [N:nat]: (((suc @ N) != zero)))).
% 1.72/1.34 thf(peano2, axiom, (! [N:nat]: ((! [M:nat]: (((N != M) => ((suc @ N) != (suc @ M)))))))).
% 1.72/1.34 thf(peano3, axiom, (! [P:(nat > $o)]: (((P @ zero) => ((! [M:nat]: (((P @ M) => (P @ (suc @ M))))) => (! [N:nat]: ((P @ N)))))))).
% 1.72/1.34 thf(ax1, axiom, (! [N:nat]: ((((plus @ zero) @ N) = N)))).
% 1.72/1.34 thf(ax2, axiom, (! [N:nat]: ((! [M:nat]: ((((plus @ (suc @ N)) @ M) = (suc @ ((plus @ N) @ M)))))))).
% 1.72/1.34 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.72/1.34 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.72/1.34 thf(ax5, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (((((listStar @ A) @ AStar) @ zero) @ (((rev @ A) @ zero) @ (nil @ A))) @ (nil @ A)))))).
% 1.72/1.34 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.72/1.34 thf(plus_com, axiom, (! [N:nat]: ((! [M:nat]: ((((plus @ N) @ M) = ((plus @ M) @ N))))))).
% 1.72/1.34 thf(plus1r, axiom, (! [N:nat]: (((suc @ N) = ((plus @ N) @ (suc @ zero)))))).
% 1.72/1.34 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.72/1.34 thf(list_rev_invol_step1, 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))) @ (((rev @ A) @ ((plus @ N) @ zero)) @ (((((app @ A) @ N) @ zero) @ (((rev @ A) @ N) @ L)) @ (nil @ A))))))))))))).
% 1.72/1.34 % SZS output end ListOfTHF for /export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2DTF6906.p
% 1.72/1.34 ------------------------
% 1.72/1.35 ---- Cleaned THF ---
% 1.72/1.35 thf(is_per_type,type,
% 1.72/1.35 isPer:
% 1.72/1.35 !>[A: $tType] : ( ( A > A > $o ) > $o ) ).
% 1.72/1.35
% 1.72/1.35 thf(is_per,definition,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 <=> ( ! [X: A,Y: A] :
% 1.72/1.35 ( ( AStar @ X @ Y )
% 1.72/1.35 => ( AStar @ Y @ X ) )
% 1.72/1.35 & ! [X: A,Y: A,Z: A] :
% 1.72/1.35 ( ( AStar @ X @ Y )
% 1.72/1.35 => ( ( AStar @ Y @ Z )
% 1.72/1.35 => ( AStar @ X @ Z ) ) ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(nat_type,type,
% 1.72/1.35 nat: $tType ).
% 1.72/1.35
% 1.72/1.35 thf(natStar,type,
% 1.72/1.35 natStar: nat > nat > $o ).
% 1.72/1.35
% 1.72/1.35 thf(natStar_is_eq,axiom,
% 1.72/1.35 ! [X: nat,Y: nat] :
% 1.72/1.35 ( ( natStar @ X @ Y )
% 1.72/1.35 <=> ( X = Y ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(zero_type,type,
% 1.72/1.35 zero: nat ).
% 1.72/1.35
% 1.72/1.35 thf(suc_type,type,
% 1.72/1.35 suc: nat > nat ).
% 1.72/1.35
% 1.72/1.35 thf(plus_type,type,
% 1.72/1.35 plus: nat > nat > nat ).
% 1.72/1.35
% 1.72/1.35 thf(list_type,type,
% 1.72/1.35 list: $tType > $tType ).
% 1.72/1.35
% 1.72/1.35 thf(listStar,type,
% 1.72/1.35 listStar:
% 1.72/1.35 !>[A: $tType] : ( ( A > A > $o ) > nat > ( list @ A ) > ( list @ A ) > $o ) ).
% 1.72/1.35
% 1.72/1.35 thf('\'listStar\'_is_per',axiom,
% 1.72/1.35 ! [B: $tType,BStar: B > B > $o] :
% 1.72/1.35 ( ( isPer @ B @ BStar )
% 1.72/1.35 => ! [C: nat] : ( isPer @ ( list @ B ) @ ( listStar @ B @ BStar @ C ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(nil_type,type,
% 1.72/1.35 nil:
% 1.72/1.35 !>[A: $tType] : ( list @ A ) ).
% 1.72/1.35
% 1.72/1.35 thf(nil_tp_ax,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ( listStar @ A @ AStar @ zero @ ( nil @ A ) @ ( nil @ A ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(cons_type,type,
% 1.72/1.35 cons:
% 1.72/1.35 !>[A: $tType] : ( nat > A > ( list @ A ) > ( list @ A ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(cons_tp_ax,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ! [N: nat,D: A,D_prime: A] :
% 1.72/1.35 ( ( D = D_prime )
% 1.72/1.35 => ! [D0: list @ A,D0_prime: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ N @ D0 @ D0_prime )
% 1.72/1.35 => ( listStar @ A @ AStar @ ( suc @ N ) @ ( cons @ A @ N @ D @ D0 ) @ ( cons @ A @ N @ D_prime @ D0_prime ) ) ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(app_type,type,
% 1.72/1.35 app:
% 1.72/1.35 !>[A: $tType] : ( nat > nat > ( list @ A ) > ( list @ A ) > ( list @ A ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(app_tp_ax,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ! [N: nat,M: nat,D: list @ A,D_prime: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ N @ D @ D_prime )
% 1.72/1.35 => ! [D0: list @ A,D0_prime: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ M @ D0 @ D0_prime )
% 1.72/1.35 => ( listStar @ A @ AStar @ ( plus @ N @ M ) @ ( app @ A @ N @ M @ D @ D0 ) @ ( app @ A @ N @ M @ D_prime @ D0_prime ) ) ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(rev_type,type,
% 1.72/1.35 rev:
% 1.72/1.35 !>[A: $tType] : ( nat > ( list @ A ) > ( list @ A ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(rev_tp_ax,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ! [N: nat,D: list @ A,D_prime: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ N @ D @ D_prime )
% 1.72/1.35 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ D ) @ ( rev @ A @ N @ D_prime ) ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(peano1,axiom,
% 1.72/1.35 ! [N: nat] :
% 1.72/1.35 ( ( suc @ N )
% 1.72/1.35 != zero ) ).
% 1.72/1.35
% 1.72/1.35 thf(peano2,axiom,
% 1.72/1.35 ! [N: nat,M: nat] :
% 1.72/1.35 ( ( N != M )
% 1.72/1.35 => ( ( suc @ N )
% 1.72/1.35 != ( suc @ M ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(peano3,axiom,
% 1.72/1.35 ! [P: nat > $o] :
% 1.72/1.35 ( ( P @ zero )
% 1.72/1.35 => ( ! [M: nat] :
% 1.72/1.35 ( ( P @ M )
% 1.72/1.35 => ( P @ ( suc @ M ) ) )
% 1.72/1.35 => ! [N: nat] : ( P @ N ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(ax1,axiom,
% 1.72/1.35 ! [N: nat] :
% 1.72/1.35 ( ( plus @ zero @ N )
% 1.72/1.35 = N ) ).
% 1.72/1.35
% 1.72/1.35 thf(ax2,axiom,
% 1.72/1.35 ! [N: nat,M: nat] :
% 1.72/1.35 ( ( plus @ ( suc @ N ) @ M )
% 1.72/1.35 = ( suc @ ( plus @ N @ M ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(ax3,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ! [N: nat,X: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ N @ X @ X )
% 1.72/1.35 => ( listStar @ A @ AStar @ ( plus @ zero @ N ) @ ( app @ A @ zero @ N @ ( nil @ A ) @ X ) @ X ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(ax4,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ! [N: nat,M: nat,X: A,Y: list @ A,Z: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ N @ Y @ Y )
% 1.72/1.35 => ( ( listStar @ A @ AStar @ M @ Z @ Z )
% 1.72/1.35 => ( 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.72/1.35
% 1.72/1.35 thf(ax5,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ( listStar @ A @ AStar @ zero @ ( rev @ A @ zero @ ( nil @ A ) ) @ ( nil @ A ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(ax6,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ! [N: nat,X: A,Y: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ N @ Y @ Y )
% 1.72/1.35 => ( 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.72/1.35
% 1.72/1.35 thf(plus_com,axiom,
% 1.72/1.35 ! [N: nat,M: nat] :
% 1.72/1.35 ( ( plus @ N @ M )
% 1.72/1.35 = ( plus @ M @ N ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(plus1r,axiom,
% 1.72/1.35 ! [N: nat] :
% 1.72/1.35 ( ( suc @ N )
% 1.72/1.35 = ( plus @ N @ ( suc @ zero ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(list_app_nil,axiom,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ! [N: nat,L: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.72/1.35 => ( listStar @ A @ AStar @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ L @ ( nil @ A ) ) @ L ) ) ) ).
% 1.72/1.35
% 1.72/1.35 thf(list_rev_invol_step1,conjecture,
% 1.72/1.35 ! [A: $tType,AStar: A > A > $o] :
% 1.72/1.35 ( ( isPer @ A @ AStar )
% 1.72/1.35 => ! [N: nat,L: list @ A] :
% 1.72/1.35 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.72/1.35 => ( 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.72/1.35 ------------------------
% 1.72/1.37 % (7230)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/2Mi)
% 1.72/1.37 % (7230)Instruction limit reached!
% 1.72/1.37 % (7230)------------------------------
% 1.72/1.37 % (7230)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.37 % (7230)Termination reason: Unknown
% 1.72/1.37 % (7230)Termination phase: shuffling
% 1.72/1.37
% 1.72/1.37 % (7230)Memory used [KB]: 1023
% 1.72/1.37 % (7230)Time elapsed: 0.002 s
% 1.72/1.37 % (7230)Instructions burned: 3 (million)
% 1.72/1.37 % (7230)------------------------------
% 1.72/1.37 % (7230)------------------------------
% 1.72/1.37 % (7228)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_6906 for (2999ds/4Mi)
% 1.72/1.37 % (7227)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/183Mi)
% 1.72/1.37 % (7229)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_6906 for (2999ds/27Mi)
% 1.72/1.37 % (7231)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_6906 for (2999ds/2Mi)
% 1.72/1.37 % (7232)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_6906 for (2999ds/275Mi)
% 1.72/1.37 % (7233)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/18Mi)
% 1.72/1.37 % (7231)Instruction limit reached!
% 1.72/1.37 % (7231)------------------------------
% 1.72/1.37 % (7231)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.37 % (7231)Termination reason: Unknown
% 1.72/1.37 % (7231)Termination phase: shuffling
% 1.72/1.37
% 1.72/1.37 % (7231)Memory used [KB]: 1023
% 1.72/1.37 % (7231)Time elapsed: 0.003 s
% 1.72/1.37 % (7231)Instructions burned: 2 (million)
% 1.72/1.37 % (7231)------------------------------
% 1.72/1.37 % (7231)------------------------------
% 1.72/1.38 % (7228)Instruction limit reached!
% 1.72/1.38 % (7228)------------------------------
% 1.72/1.38 % (7228)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.38 % (7228)Termination reason: Unknown
% 1.72/1.38 % (7228)Termination phase: shuffling
% 1.72/1.38
% 1.72/1.38 % (7228)Memory used [KB]: 1023
% 1.72/1.38 % (7228)Time elapsed: 0.004 s
% 1.72/1.38 % (7228)Instructions burned: 4 (million)
% 1.72/1.38 % (7228)------------------------------
% 1.72/1.38 % (7228)------------------------------
% 1.72/1.38 % (7234)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/3Mi)
% 1.72/1.38 % (7234)Instruction limit reached!
% 1.72/1.38 % (7234)------------------------------
% 1.72/1.38 % (7234)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.38 % (7234)Termination reason: Unknown
% 1.72/1.38 % (7234)Termination phase: shuffling
% 1.72/1.38
% 1.72/1.38 % (7234)Memory used [KB]: 1023
% 1.72/1.38 % (7234)Time elapsed: 0.003 s
% 1.72/1.38 % (7234)Instructions burned: 4 (million)
% 1.72/1.38 % (7234)------------------------------
% 1.72/1.38 % (7234)------------------------------
% 1.72/1.38 % (7233)Instruction limit reached!
% 1.72/1.38 % (7233)------------------------------
% 1.72/1.38 % (7233)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.38 % (7233)Termination reason: Unknown
% 1.72/1.38 % (7233)Termination phase: Saturation
% 1.72/1.38
% 1.72/1.38 % (7233)Memory used [KB]: 5628
% 1.72/1.38 % (7233)Time elapsed: 0.013 s
% 1.72/1.38 % (7233)Instructions burned: 19 (million)
% 1.72/1.38 % (7233)------------------------------
% 1.72/1.38 % (7233)------------------------------
% 1.72/1.39 % (7237)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_6906 for (2999ds/3Mi)
% 1.72/1.39 % (7237)Instruction limit reached!
% 1.72/1.39 % (7237)------------------------------
% 1.72/1.39 % (7237)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.39 % (7237)Termination reason: Unknown
% 1.72/1.39 % (7237)Termination phase: shuffling
% 1.72/1.39
% 1.72/1.39 % (7237)Memory used [KB]: 1023
% 1.72/1.39 % (7237)Time elapsed: 0.003 s
% 1.72/1.39 % (7237)Instructions burned: 4 (million)
% 1.72/1.39 % (7237)------------------------------
% 1.72/1.39 % (7237)------------------------------
% 1.72/1.39 % (7229)Instruction limit reached!
% 1.72/1.39 % (7229)------------------------------
% 1.72/1.39 % (7229)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.39 % (7229)Termination reason: Unknown
% 1.72/1.39 % (7229)Termination phase: Saturation
% 1.72/1.39
% 1.72/1.39 % (7229)Memory used [KB]: 5756
% 1.72/1.39 % (7229)Time elapsed: 0.019 s
% 1.72/1.39 % (7229)Instructions burned: 27 (million)
% 1.72/1.39 % (7229)------------------------------
% 1.72/1.39 % (7229)------------------------------
% 1.72/1.39 % (7235)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_6906 for (2999ds/37Mi)
% 1.72/1.39 % (7236)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_6906 for (2999ds/15Mi)
% 1.72/1.39 % Exception at run slice level
% 1.72/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.83/1.40 % (7236)Instruction limit reached!
% 1.83/1.40 % (7236)------------------------------
% 1.83/1.40 % (7236)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.40 % (7236)Termination reason: Unknown
% 1.83/1.40 % (7236)Termination phase: Saturation
% 1.83/1.40
% 1.83/1.40 % (7236)Memory used [KB]: 1151
% 1.83/1.40 % (7236)Time elapsed: 0.007 s
% 1.83/1.40 % (7236)Instructions burned: 15 (million)
% 1.83/1.40 % (7236)------------------------------
% 1.83/1.40 % (7236)------------------------------
% 1.83/1.40 % (7238)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_6906 for (2999ds/1041Mi)
% 1.83/1.40 % Exception at run slice level
% 1.83/1.40 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.83/1.41 % (7240)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/16Mi)
% 1.83/1.41 % (7239)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/7Mi)
% 1.83/1.41 % (7243)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_6906 for (2999ds/3Mi)
% 1.83/1.41 % (7243)Instruction limit reached!
% 1.83/1.41 % (7243)------------------------------
% 1.83/1.41 % (7243)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.41 % (7243)Termination reason: Unknown
% 1.83/1.41 % (7243)Termination phase: shuffling
% 1.83/1.41
% 1.83/1.41 % (7243)Memory used [KB]: 1023
% 1.83/1.41 % (7243)Time elapsed: 0.002 s
% 1.83/1.41 % (7243)Instructions burned: 4 (million)
% 1.83/1.41 % (7243)------------------------------
% 1.83/1.41 % (7243)------------------------------
% 1.83/1.41 % (7242)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_6906 for (2999ds/3Mi)
% 1.83/1.41 % (7239)Instruction limit reached!
% 1.83/1.41 % (7239)------------------------------
% 1.83/1.41 % (7239)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.41 % (7239)Termination reason: Unknown
% 1.83/1.41 % (7239)Termination phase: Preprocessing 3
% 1.83/1.41
% 1.83/1.41 % (7239)Memory used [KB]: 1023
% 1.83/1.41 % (7239)Time elapsed: 0.006 s
% 1.83/1.41 % (7239)Instructions burned: 7 (million)
% 1.83/1.41 % (7239)------------------------------
% 1.83/1.41 % (7239)------------------------------
% 1.83/1.41 % (7242)Instruction limit reached!
% 1.83/1.41 % (7242)------------------------------
% 1.83/1.41 % (7242)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.41 % (7242)Termination reason: Unknown
% 1.83/1.41 % (7242)Termination phase: shuffling
% 1.83/1.41
% 1.83/1.41 % (7242)Memory used [KB]: 1023
% 1.83/1.41 % (7242)Time elapsed: 0.004 s
% 1.83/1.41 % (7242)Instructions burned: 4 (million)
% 1.83/1.41 % (7242)------------------------------
% 1.83/1.41 % (7242)------------------------------
% 1.83/1.41 % (7240)Instruction limit reached!
% 1.83/1.41 % (7240)------------------------------
% 1.83/1.41 % (7240)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.41 % (7240)Termination reason: Unknown
% 1.83/1.41 % (7240)Termination phase: Saturation
% 1.83/1.41
% 1.83/1.41 % (7240)Memory used [KB]: 5628
% 1.83/1.41 % (7240)Time elapsed: 0.009 s
% 1.83/1.41 % (7240)Instructions burned: 16 (million)
% 1.83/1.41 % (7240)------------------------------
% 1.83/1.41 % (7240)------------------------------
% 1.83/1.42 % (7245)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/3Mi)
% 1.83/1.42 % (7245)Instruction limit reached!
% 1.83/1.42 % (7245)------------------------------
% 1.83/1.42 % (7245)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.42 % (7245)Termination reason: Unknown
% 1.83/1.42 % (7245)Termination phase: shuffling
% 1.83/1.42
% 1.83/1.42 % (7245)Memory used [KB]: 1023
% 1.83/1.42 % (7245)Time elapsed: 0.003 s
% 1.83/1.42 % (7245)Instructions burned: 4 (million)
% 1.83/1.42 % (7245)------------------------------
% 1.83/1.42 % (7245)------------------------------
% 1.83/1.42 % (7244)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/7Mi)
% 1.83/1.42 % (7248)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/710Mi)
% 1.83/1.43 % (7244)Instruction limit reached!
% 1.83/1.43 % (7244)------------------------------
% 1.83/1.43 % (7244)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.43 % (7244)Termination reason: Unknown
% 1.83/1.43 % (7244)Termination phase: Preprocessing 3
% 1.83/1.43
% 1.83/1.43 % (7244)Memory used [KB]: 1023
% 1.83/1.43 % (7244)Time elapsed: 0.006 s
% 1.83/1.43 % (7244)Instructions burned: 7 (million)
% 1.83/1.43 % (7244)------------------------------
% 1.83/1.43 % (7244)------------------------------
% 1.83/1.43 % (7246)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/4Mi)
% 1.83/1.43 % (7247)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/18Mi)
% 1.83/1.43 % (7249)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/6Mi)
% 1.83/1.43 % (7246)Instruction limit reached!
% 1.83/1.43 % (7246)------------------------------
% 1.83/1.43 % (7246)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.43 % (7246)Termination reason: Unknown
% 1.83/1.43 % (7246)Termination phase: shuffling
% 1.83/1.43
% 1.83/1.43 % (7246)Memory used [KB]: 1023
% 1.83/1.43 % (7246)Time elapsed: 0.004 s
% 1.83/1.43 % (7246)Instructions burned: 4 (million)
% 1.83/1.43 % (7246)------------------------------
% 1.83/1.43 % (7246)------------------------------
% 1.83/1.43 % (7249)Instruction limit reached!
% 1.83/1.43 % (7249)------------------------------
% 1.83/1.43 % (7249)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.43 % (7249)Termination reason: Unknown
% 1.83/1.43 % (7249)Termination phase: Preprocessing 3
% 1.83/1.43
% 1.83/1.43 % (7249)Memory used [KB]: 1023
% 1.83/1.43 % (7249)Time elapsed: 0.004 s
% 1.83/1.43 % (7249)Instructions burned: 7 (million)
% 1.83/1.43 % (7249)------------------------------
% 1.83/1.43 % (7249)------------------------------
% 1.83/1.44 % (7247)Instruction limit reached!
% 1.83/1.44 % (7247)------------------------------
% 1.83/1.44 % (7247)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.44 % (7247)Termination reason: Unknown
% 1.83/1.44 % (7247)Termination phase: Saturation
% 1.83/1.44
% 1.83/1.44 % (7247)Memory used [KB]: 5628
% 1.83/1.44 % (7247)Time elapsed: 0.011 s
% 1.83/1.44 % (7247)Instructions burned: 18 (million)
% 1.83/1.44 % (7247)------------------------------
% 1.83/1.44 % (7247)------------------------------
% 1.83/1.44 % (7250)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_6906 for (2999ds/902Mi)
% 1.83/1.44 % (7252)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/5Mi)
% 1.83/1.44 % Exception at run slice level
% 1.83/1.44 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.83/1.45 % (7251)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_6906 for (2999ds/21Mi)
% 1.83/1.45 % (7253)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_6906 for (2999ds/6Mi)
% 1.83/1.45 % Exception at run slice level
% 1.83/1.45 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.83/1.45 % (7254)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/377Mi)
% 1.83/1.46 % (7232)Instruction limit reached!
% 1.83/1.46 % (7232)------------------------------
% 1.83/1.46 % (7232)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.46 % (7232)Termination reason: Unknown
% 1.83/1.46 % (7232)Termination phase: Saturation
% 1.83/1.46
% 1.83/1.46 % (7232)Memory used [KB]: 5884
% 1.83/1.46 % (7232)Time elapsed: 0.086 s
% 1.83/1.46 % (7232)Instructions burned: 279 (million)
% 1.83/1.46 % (7232)------------------------------
% 1.83/1.46 % (7232)------------------------------
% 1.83/1.46 % (7255)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_6906 for (2999ds/779Mi)
% 1.83/1.46 % (7251)Instruction limit reached!
% 1.83/1.46 % (7251)------------------------------
% 1.83/1.46 % (7251)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.46 % (7251)Termination reason: Unknown
% 1.83/1.46 % (7251)Termination phase: Saturation
% 1.83/1.46
% 1.83/1.46 % (7251)Memory used [KB]: 5628
% 1.83/1.46 % (7251)Time elapsed: 0.015 s
% 1.83/1.46 % (7251)Instructions burned: 22 (million)
% 1.83/1.46 % (7251)------------------------------
% 1.83/1.46 % (7251)------------------------------
% 1.83/1.46 % Exception at run slice level
% 1.83/1.46 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.83/1.47 % (7256)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_6906 for (2999ds/19Mi)
% 1.83/1.47 % Exception at run slice level
% 1.83/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.83/1.47 % (7258)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/17Mi)
% 1.83/1.48 % (7227)Instruction limit reached!
% 1.83/1.48 % (7227)------------------------------
% 1.83/1.48 % (7227)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.48 % (7227)Termination reason: Unknown
% 1.83/1.48 % (7227)Termination phase: Saturation
% 1.83/1.48
% 1.83/1.48 % (7227)Memory used [KB]: 6396
% 1.83/1.48 % (7227)Time elapsed: 0.104 s
% 1.83/1.48 % (7227)Instructions burned: 183 (million)
% 1.83/1.48 % (7227)------------------------------
% 1.83/1.48 % (7227)------------------------------
% 1.83/1.48 % (7259)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_6906 for (2998ds/3Mi)
% 1.83/1.48 % (7259)Instruction limit reached!
% 1.83/1.48 % (7259)------------------------------
% 1.83/1.48 % (7259)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.48 % (7259)Termination reason: Unknown
% 1.83/1.48 % (7259)Termination phase: shuffling
% 1.83/1.48
% 1.83/1.48 % (7259)Memory used [KB]: 1023
% 1.83/1.48 % (7259)Time elapsed: 0.002 s
% 1.83/1.48 % (7259)Instructions burned: 4 (million)
% 1.83/1.48 % (7259)------------------------------
% 1.83/1.48 % (7259)------------------------------
% 1.83/1.48 % (7258)Instruction limit reached!
% 1.83/1.48 % (7258)------------------------------
% 1.83/1.48 % (7258)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.48 % (7258)Termination reason: Unknown
% 1.83/1.48 % (7258)Termination phase: Saturation
% 1.83/1.48
% 1.83/1.48 % (7258)Memory used [KB]: 5628
% 1.83/1.48 % (7258)Time elapsed: 0.032 s
% 1.83/1.48 % (7258)Instructions burned: 18 (million)
% 1.83/1.48 % (7258)------------------------------
% 1.83/1.48 % (7258)------------------------------
% 1.83/1.48 % (7257)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_6906 for (2999ds/879Mi)
% 1.83/1.49 % (7260)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_6906 for (2998ds/30Mi)
% 1.83/1.49 % (7261)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_6906 for (2998ds/127Mi)
% 1.83/1.49 % (7262)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on DTF2THF_6906 for (2998ds/100Mi)
% 1.83/1.50 % (7260)Instruction limit reached!
% 1.83/1.50 % (7260)------------------------------
% 1.83/1.50 % (7260)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.50 % (7260)Termination reason: Unknown
% 1.83/1.50 % (7260)Termination phase: Saturation
% 1.83/1.50
% 1.83/1.50 % (7260)Memory used [KB]: 5756
% 1.83/1.50 % (7260)Time elapsed: 0.012 s
% 1.83/1.50 % (7260)Instructions burned: 31 (million)
% 1.83/1.50 % (7260)------------------------------
% 1.83/1.50 % (7260)------------------------------
% 1.83/1.51 % (7263)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_6906 for (2998ds/3Mi)
% 1.83/1.51 % Exception at run slice level
% 1.83/1.51 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.83/1.52 % (7264)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_6906 for (2998ds/20Mi)
% 1.83/1.52 % (7262)Instruction limit reached!
% 1.83/1.52 % (7262)------------------------------
% 1.83/1.52 % (7262)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.52 % (7262)Termination reason: Unknown
% 1.83/1.52 % (7262)Termination phase: Saturation
% 1.83/1.52
% 1.83/1.52 % (7262)Memory used [KB]: 5884
% 1.83/1.52 % (7262)Time elapsed: 0.033 s
% 1.83/1.52 % (7262)Instructions burned: 101 (million)
% 1.83/1.52 % (7262)------------------------------
% 1.83/1.52 % (7262)------------------------------
% 1.83/1.53 % (7261)Instruction limit reached!
% 1.83/1.53 % (7261)------------------------------
% 1.83/1.53 % (7261)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.53 % (7261)Termination reason: Unknown
% 1.83/1.53 % (7261)Termination phase: Saturation
% 1.83/1.53
% 1.83/1.53 % (7261)Memory used [KB]: 6268
% 1.83/1.53 % (7261)Time elapsed: 0.039 s
% 1.83/1.53 % (7261)Instructions burned: 128 (million)
% 1.83/1.53 % (7261)------------------------------
% 1.83/1.53 % (7261)------------------------------
% 1.83/1.53 % (7264)Instruction limit reached!
% 1.83/1.53 % (7264)------------------------------
% 1.83/1.53 % (7264)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.53 % (7264)Termination reason: Unknown
% 1.83/1.53 % (7264)Termination phase: Saturation
% 1.83/1.53
% 1.83/1.53 % (7264)Memory used [KB]: 5628
% 1.83/1.53 % (7264)Time elapsed: 0.009 s
% 1.83/1.53 % (7264)Instructions burned: 22 (million)
% 1.83/1.53 % (7264)------------------------------
% 1.83/1.53 % (7264)------------------------------
% 1.83/1.53 % (7265)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_6906 for (2998ds/86Mi)
% 1.83/1.53 % (7266)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_6906 for (2998ds/107Mi)
% 1.83/1.54 % (7267)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_6906 for (2998ds/39Mi)
% 1.83/1.54 % Exception at run slice level
% 1.83/1.54 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.83/1.55 % (7268)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_6906 for (2998ds/448Mi)
% 1.83/1.55 % Exception at run slice level
% 1.83/1.55 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.83/1.56 % (7269)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_6906 for (2998ds/46Mi)
% 1.83/1.56 % (7265)Instruction limit reached!
% 1.83/1.56 % (7265)------------------------------
% 1.83/1.56 % (7265)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.56 % (7265)Termination reason: Unknown
% 1.83/1.56 % (7265)Termination phase: Saturation
% 1.83/1.56
% 1.83/1.56 % (7265)Memory used [KB]: 6140
% 1.83/1.56 % (7265)Time elapsed: 0.031 s
% 1.83/1.56 % (7265)Instructions burned: 88 (million)
% 1.83/1.56 % (7265)------------------------------
% 1.83/1.56 % (7265)------------------------------
% 1.83/1.57 % (7266)Instruction limit reached!
% 1.83/1.57 % (7266)------------------------------
% 1.83/1.57 % (7266)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.57 % (7266)Termination reason: Unknown
% 1.83/1.57 % (7266)Termination phase: Saturation
% 1.83/1.57
% 1.83/1.57 % (7266)Memory used [KB]: 5884
% 1.83/1.57 % (7266)Time elapsed: 0.035 s
% 1.83/1.57 % (7266)Instructions burned: 108 (million)
% 1.83/1.57 % (7266)------------------------------
% 1.83/1.57 % (7266)------------------------------
% 1.83/1.57 % (7270)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_6906 for (2997ds/98Mi)
% 1.83/1.57 % Exception at run slice level
% 1.83/1.57 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.83/1.57 % (7269)Instruction limit reached!
% 1.83/1.57 % (7269)------------------------------
% 1.83/1.57 % (7269)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.57 % (7269)Termination reason: Unknown
% 1.83/1.57 % (7269)Termination phase: Saturation
% 1.83/1.57
% 1.83/1.57 % (7269)Memory used [KB]: 5756
% 1.83/1.57 % (7269)Time elapsed: 0.017 s
% 1.83/1.57 % (7269)Instructions burned: 46 (million)
% 1.83/1.57 % (7269)------------------------------
% 1.83/1.57 % (7269)------------------------------
% 1.83/1.58 % (7271)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_6906 for (2997ds/507Mi)
% 1.83/1.58 % (7272)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_6906 for (2997ds/149Mi)
% 1.83/1.58 % (7254)Instruction limit reached!
% 1.83/1.58 % (7254)------------------------------
% 1.83/1.58 % (7254)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.58 % (7254)Termination reason: Unknown
% 1.83/1.58 % (7254)Termination phase: Saturation
% 1.83/1.58
% 1.83/1.58 % (7254)Memory used [KB]: 6140
% 1.83/1.58 % (7254)Time elapsed: 0.130 s
% 1.83/1.58 % (7254)Instructions burned: 379 (million)
% 1.83/1.58 % (7254)------------------------------
% 1.83/1.58 % (7254)------------------------------
% 1.83/1.58 % (7273)lrs+21_1:16_au=on:bd=off:piset=and:i=39:si=on:rtra=on_0 on DTF2THF_6906 for (2997ds/39Mi)
% 1.83/1.59 % (7274)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_6906 for (2997ds/6Mi)
% 1.83/1.59 % Exception at run slice level
% 1.83/1.59 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.83/1.60 % (7273)Instruction limit reached!
% 1.83/1.60 % (7273)------------------------------
% 1.83/1.60 % (7273)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.60 % (7273)Termination reason: Unknown
% 1.83/1.60 % (7273)Termination phase: Saturation
% 1.83/1.60
% 1.83/1.60 % (7273)Memory used [KB]: 5756
% 1.83/1.60 % (7273)Time elapsed: 0.015 s
% 1.83/1.60 % (7273)Instructions burned: 39 (million)
% 1.83/1.60 % (7273)------------------------------
% 1.83/1.60 % (7273)------------------------------
% 1.83/1.60 % (7275)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_6906 for (2997ds/1087Mi)
% 1.83/1.61 % (7276)dis+10_1:1_aac=none:cs=on:i=47:si=on:rtra=on_0 on DTF2THF_6906 for (2997ds/47Mi)
% 1.83/1.62 % (7276)Instruction limit reached!
% 1.83/1.62 % (7276)------------------------------
% 1.83/1.62 % (7276)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.62 % (7276)Termination reason: Unknown
% 1.83/1.62 % (7276)Termination phase: Saturation
% 1.83/1.62
% 1.83/1.62 % (7276)Memory used [KB]: 5756
% 1.83/1.62 % (7276)Time elapsed: 0.018 s
% 1.83/1.62 % (7276)Instructions burned: 48 (million)
% 1.83/1.62 % (7276)------------------------------
% 1.83/1.62 % (7276)------------------------------
% 1.83/1.63 % (7272)Instruction limit reached!
% 1.83/1.63 % (7272)------------------------------
% 1.83/1.63 % (7272)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.63 % (7272)Termination reason: Unknown
% 1.83/1.63 % (7272)Termination phase: Saturation
% 1.83/1.63
% 1.83/1.63 % (7272)Memory used [KB]: 6140
% 1.83/1.63 % (7272)Time elapsed: 0.053 s
% 1.83/1.63 % (7272)Instructions burned: 151 (million)
% 1.83/1.63 % (7272)------------------------------
% 1.83/1.63 % (7272)------------------------------
% 1.83/1.63 % (7277)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_6906 for (2997ds/44Mi)
% 1.83/1.63 % Exception at run slice level
% 1.83/1.63 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.83/1.64 % (7278)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_6906 for (2997ds/432Mi)
% 1.83/1.64 % Exception at run slice level
% 1.83/1.64 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.83/1.64 % (7275)First to succeed.
% 1.83/1.64 % (7279)lrs+10_7:1_cnfonf=lazy_gen:fe=off:nwc=5.0:plsq=on:i=62:si=on:rtra=on_0 on DTF2THF_6906 for (2997ds/62Mi)
% 1.83/1.64 % Exception at run slice level
% 1.83/1.64 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.83/1.65 % (7248)Instruction limit reached!
% 1.83/1.65 % (7248)------------------------------
% 1.83/1.65 % (7248)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.65 % (7248)Termination reason: Unknown
% 1.83/1.65 % (7248)Termination phase: Saturation
% 1.83/1.65
% 1.83/1.65 % (7248)Memory used [KB]: 7291
% 1.83/1.65 % (7248)Time elapsed: 0.223 s
% 1.83/1.65 % (7248)Instructions burned: 711 (million)
% 1.83/1.65 % (7248)------------------------------
% 1.83/1.65 % (7248)------------------------------
% 1.83/1.65 % (7275)Refutation found. Thanks to Tanya!
% 1.83/1.65 % SZS status Theorem for DTF2THF_6906
% 1.83/1.65 % SZS output start Proof for DTF2THF_6906
% 1.83/1.65 thf(type_def_6, type, nat: $tType).
% 1.83/1.65 thf(type_def_7, type, list: ($tType) > $tType).
% 1.83/1.65 thf(type_def_8, type, sK2: $tType).
% 1.83/1.65 thf(func_def_0, type, isPer: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.83/1.65 thf(func_def_2, type, nat: $tType).
% 1.83/1.65 thf(func_def_3, type, natStar: nat > nat > $o).
% 1.83/1.65 thf(func_def_4, type, zero: nat).
% 1.83/1.65 thf(func_def_5, type, suc: nat > nat).
% 1.83/1.65 thf(func_def_6, type, plus: nat > nat > nat).
% 1.83/1.65 thf(func_def_7, type, list: ($tType) > $tType).
% 1.83/1.65 thf(func_def_8, type, listStar: !>[X0: $tType]:((X0 > X0 > $o) > nat > list @ X0 > list @ X0 > $o)).
% 1.83/1.65 thf(func_def_9, type, nil: !>[X0: $tType]:(list @ X0)).
% 1.83/1.65 thf(func_def_10, type, cons: !>[X0: $tType]:(nat > X0 > list @ X0 > list @ X0)).
% 1.83/1.65 thf(func_def_11, type, app: !>[X0: $tType]:(nat > nat > list @ X0 > list @ X0 > list @ X0)).
% 1.83/1.65 thf(func_def_12, type, rev: !>[X0: $tType]:(nat > list @ X0 > list @ X0)).
% 1.83/1.65 thf(func_def_15, type, sP0: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.83/1.65 thf(func_def_16, type, sP1: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.83/1.65 thf(func_def_17, type, sK3: sK2 > sK2 > $o).
% 1.83/1.65 thf(func_def_18, type, sK4: nat).
% 1.83/1.65 thf(func_def_19, type, sK5: list @ sK2).
% 1.83/1.65 thf(func_def_20, type, sK6: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.83/1.65 thf(func_def_21, type, sK7: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.83/1.65 thf(func_def_22, type, sK8: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.83/1.65 thf(func_def_23, type, sK9: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.83/1.65 thf(func_def_24, type, sK10: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.83/1.65 thf(func_def_25, type, sK11: (nat > $o) > nat).
% 1.83/1.65 thf(func_def_27, type, ph13: !>[X0: $tType]:(X0)).
% 1.83/1.65 thf(f531,plain,(
% 1.83/1.65 $false),
% 1.83/1.65 inference(avatar_sat_refutation,[status(thm)],[f381,f457,f526])).
% 1.83/1.65 thf(f526,plain,(
% 1.83/1.65 spl12_15),
% 1.83/1.65 inference(avatar_contradiction_clause,[status(thm)],[f525])).
% 1.83/1.65 thf(f525,plain,(
% 1.83/1.65 $false | spl12_15),
% 1.83/1.65 inference(subsumption_resolution,[status(thm)],[f524,f96])).
% 1.83/1.65 thf(f96,plain,(
% 1.83/1.65 ((listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5) = $true)),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f78])).
% 1.83/1.65 thf(f78,plain,(
% 1.83/1.65 (($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ (rev @ sK2 @ sK4 @ sK5)) @ (rev @ sK2 @ (plus @ sK4 @ zero) @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2)))) & ((listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5) = $true)) & ($true = (isPer @ sK2 @ sK3))),
% 1.83/1.65 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f67,f77,f76])).
% 1.83/1.65 thf(f76,plain,(
% 1.83/1.65 ? [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)) => (? [X3 : list @ sK2,X2 : nat] : (($true != (listStar @ sK2 @ sK3 @ X2 @ (rev @ sK2 @ X2 @ (rev @ sK2 @ X2 @ X3)) @ (rev @ sK2 @ (plus @ X2 @ zero) @ (app @ sK2 @ X2 @ zero @ (rev @ sK2 @ X2 @ X3) @ nil @ sK2)))) & ($true = (listStar @ sK2 @ sK3 @ X2 @ X3 @ X3))) & ($true = (isPer @ sK2 @ sK3)))),
% 1.83/1.65 introduced(definition,[],[choice_axiom])).
% 1.83/1.65 thf(f77,plain,(
% 1.83/1.65 ? [X3 : list @ sK2,X2 : nat] : (($true != (listStar @ sK2 @ sK3 @ X2 @ (rev @ sK2 @ X2 @ (rev @ sK2 @ X2 @ X3)) @ (rev @ sK2 @ (plus @ X2 @ zero) @ (app @ sK2 @ X2 @ zero @ (rev @ sK2 @ X2 @ X3) @ nil @ sK2)))) & ($true = (listStar @ sK2 @ sK3 @ X2 @ X3 @ X3))) => (($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ (rev @ sK2 @ sK4 @ sK5)) @ (rev @ sK2 @ (plus @ sK4 @ zero) @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2)))) & ((listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5) = $true))),
% 1.83/1.65 introduced(definition,[],[choice_axiom])).
% 1.83/1.65 thf(f67,plain,(
% 1.83/1.65 ? [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.83/1.65 inference(ennf_transformation,[status(thm)],[f46])).
% 1.83/1.65 thf(f46,plain,(
% 1.83/1.65 ~! [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.83/1.65 inference(fool_elimination,[status(thm)],[f45])).
% 1.83/1.65 thf(f45,plain,(
% 1.83/1.65 ~! [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.83/1.65 inference(rectify,[status(thm)],[f21])).
% 1.83/1.65 thf(f21,negated_conjecture,(
% 1.83/1.65 ~! [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.83/1.65 inference(negated_conjecture,[status(cth)],[f20])).
% 1.83/1.65 thf(f20,conjecture,(
% 1.83/1.65 ! [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.83/1.65 file('/export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2THF_6906.p',list_rev_invol_step1)).
% 1.83/1.65 thf(f524,plain,(
% 1.83/1.65 ((listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5) != $true) | spl12_15),
% 1.83/1.65 inference(subsumption_resolution,[status(thm)],[f523,f95])).
% 1.83/1.65 thf(f95,plain,(
% 1.83/1.65 ($true = (isPer @ sK2 @ sK3))),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f78])).
% 1.83/1.65 thf(f523,plain,(
% 1.83/1.65 ($true != (isPer @ sK2 @ sK3)) | ((listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5) != $true) | spl12_15),
% 1.83/1.65 inference(trivial_inequality_removal,[status(thm)],[f518])).
% 1.83/1.65 thf(f518,plain,(
% 1.83/1.65 ((listStar @ sK2 @ sK3 @ sK4 @ sK5 @ sK5) != $true) | ($true != $true) | ($true != (isPer @ sK2 @ sK3)) | spl12_15),
% 1.83/1.65 inference(superposition,[status(thm)],[f507,f103])).
% 1.83/1.65 thf(f103,plain,(
% 1.83/1.65 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o,X4 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ X3) @ (rev @ X0 @ X2 @ X4))) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X4)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f68])).
% 1.83/1.65 thf(f68,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : nat,X3 : list @ X0,X4 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ X3) @ (rev @ X0 @ X2 @ X4))) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X4))) | ((isPer @ X0 @ X1) != $true))),
% 1.83/1.65 inference(ennf_transformation,[status(thm)],[f50])).
% 1.83/1.65 thf(f50,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat,X3 : list @ X0,X4 : list @ X0] : (($true = (listStar @ X0 @ X1 @ X2 @ X3 @ X4)) => ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ X3) @ (rev @ X0 @ X2 @ X4)))))),
% 1.83/1.65 inference(fool_elimination,[status(thm)],[f49])).
% 1.83/1.65 thf(f49,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : list @ X0,X4 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X3 @ X4) => (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ X3) @ (rev @ X0 @ X2 @ X4))))),
% 1.83/1.65 inference(rectify,[status(thm)],[f7])).
% 1.83/1.65 thf(f7,axiom,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X9 : list @ X0,X10 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X9 @ X10) => (listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ X9) @ (rev @ X0 @ X8 @ X10))))),
% 1.83/1.65 file('/export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2THF_6906.p',rev_tp_ax)).
% 1.83/1.65 thf(f507,plain,(
% 1.83/1.65 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ sK5) @ (rev @ sK2 @ sK4 @ sK5))) | spl12_15),
% 1.83/1.65 inference(subsumption_resolution,[status(thm)],[f506,f95])).
% 1.83/1.65 thf(f506,plain,(
% 1.83/1.65 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ sK5) @ (rev @ sK2 @ sK4 @ sK5))) | ($true != (isPer @ sK2 @ sK3)) | spl12_15),
% 1.83/1.65 inference(trivial_inequality_removal,[status(thm)],[f503])).
% 1.83/1.65 thf(f503,plain,(
% 1.83/1.65 ($true != (isPer @ sK2 @ sK3)) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ sK5) @ (rev @ sK2 @ sK4 @ sK5))) | ($true != $true) | spl12_15),
% 1.83/1.65 inference(superposition,[status(thm)],[f456,f478])).
% 1.83/1.65 thf(f478,plain,(
% 1.83/1.65 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (((listStar @ X0 @ X1 @ X2 @ (app @ X0 @ X2 @ zero @ X3 @ nil @ X0) @ X3) = $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.83/1.65 inference(forward_demodulation,[status(thm)],[f108,f124])).
% 1.83/1.65 thf(f124,plain,(
% 1.83/1.65 ( ! [X0 : nat] : (((plus @ X0 @ zero) = X0)) )),
% 1.83/1.65 inference(superposition,[status(thm)],[f94,f104])).
% 1.83/1.65 thf(f104,plain,(
% 1.83/1.65 ( ! [X0 : nat] : (((plus @ zero @ X0) = X0)) )),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f53])).
% 1.83/1.65 thf(f53,plain,(
% 1.83/1.65 ! [X0 : nat] : ((plus @ zero @ X0) = X0)),
% 1.83/1.65 inference(rectify,[status(thm)],[f11])).
% 1.83/1.65 thf(f11,axiom,(
% 1.83/1.65 ! [X8 : nat] : ((plus @ zero @ X8) = X8)),
% 1.83/1.65 file('/export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2THF_6906.p',ax1)).
% 1.83/1.65 thf(f94,plain,(
% 1.83/1.65 ( ! [X0 : nat,X1 : nat] : (((plus @ X1 @ X0) = (plus @ X0 @ X1))) )),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f52])).
% 1.83/1.65 thf(f52,plain,(
% 1.83/1.65 ! [X0 : nat,X1 : nat] : ((plus @ X1 @ X0) = (plus @ X0 @ X1))),
% 1.83/1.65 inference(rectify,[status(thm)],[f17])).
% 1.83/1.65 thf(f17,axiom,(
% 1.83/1.65 ! [X8 : nat,X13 : nat] : ((plus @ X8 @ X13) = (plus @ X13 @ X8))),
% 1.83/1.65 file('/export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2THF_6906.p',plus_com)).
% 1.83/1.65 thf(f108,plain,(
% 1.83/1.65 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (($true = (listStar @ X0 @ X1 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ X3 @ nil @ X0) @ X3)) | ((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f61])).
% 1.83/1.65 thf(f61,plain,(
% 1.83/1.65 ! [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 @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ X3 @ nil @ X0) @ X3))))),
% 1.83/1.65 inference(ennf_transformation,[status(thm)],[f26])).
% 1.83/1.65 thf(f26,plain,(
% 1.83/1.65 ! [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 @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ X3 @ nil @ X0) @ X3))))),
% 1.83/1.65 inference(fool_elimination,[status(thm)],[f25])).
% 1.83/1.65 thf(f25,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : list @ X0] : ((listStar @ X0 @ X1 @ X2 @ X3 @ X3) => (listStar @ X0 @ X1 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ X3 @ nil @ X0) @ X3)))),
% 1.83/1.65 inference(rectify,[status(thm)],[f19])).
% 1.83/1.65 thf(f19,axiom,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X8 : nat,X15 : list @ X0] : ((listStar @ X0 @ X1 @ X8 @ X15 @ X15) => (listStar @ X0 @ X1 @ (plus @ X8 @ zero) @ (app @ X0 @ X8 @ zero @ X15 @ nil @ X0) @ X15)))),
% 1.83/1.65 file('/export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2THF_6906.p',list_app_nil)).
% 1.83/1.65 thf(f456,plain,(
% 1.83/1.65 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2) @ (rev @ sK2 @ sK4 @ sK5))) | spl12_15),
% 1.83/1.65 inference(avatar_component_clause,[status(thm)],[f455])).
% 1.83/1.65 thf(f455,definition,(
% 1.83/1.65 spl12_15 <=> ($true = (listStar @ sK2 @ sK3 @ sK4 @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2) @ (rev @ sK2 @ sK4 @ sK5)))),
% 1.83/1.65 introduced(definition,[new_symbols(naming,[spl12_15])],[avatar_definition])).
% 1.83/1.65 thf(f457,plain,(
% 1.83/1.65 ~spl12_15 | ~spl12_4),
% 1.83/1.65 inference(avatar_split_clause,[status(thm)],[f448,f261,f455])).
% 1.83/1.65 thf(f261,definition,(
% 1.83/1.65 spl12_4 <=> ((sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4)) = $true)),
% 1.83/1.65 introduced(definition,[new_symbols(naming,[spl12_4])],[avatar_definition])).
% 1.83/1.65 thf(f448,plain,(
% 1.83/1.65 ((sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4)) != $true) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2) @ (rev @ sK2 @ sK4 @ sK5)))),
% 1.83/1.65 inference(trivial_inequality_removal,[status(thm)],[f447])).
% 1.83/1.65 thf(f447,plain,(
% 1.83/1.65 ($true != $true) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2) @ (rev @ sK2 @ sK4 @ sK5))) | ((sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4)) != $true)),
% 1.83/1.65 inference(superposition,[status(thm)],[f442,f109])).
% 1.83/1.65 thf(f109,plain,(
% 1.83/1.65 ( ! [X1 : $tType,X0 : X1 > X1 > $o,X4 : X1,X5 : X1] : (($true = (X0 @ X5 @ X4)) | ((X0 @ X4 @ X5) != $true) | ($true != (sP1 @ X1 @ X0))) )),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f83])).
% 1.83/1.65 thf(f83,plain,(
% 1.83/1.65 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP1 @ X1 @ X0)) | ((sP0 @ X1 @ X0) != $true) | (($true != (X0 @ (sK7 @ X1 @ X0) @ (sK6 @ X1 @ X0))) & ((X0 @ (sK6 @ X1 @ X0) @ (sK7 @ X1 @ X0)) = $true))) & ((((sP0 @ X1 @ X0) = $true) & ! [X4 : X1,X5 : X1] : (($true = (X0 @ X5 @ X4)) | ((X0 @ X4 @ X5) != $true))) | ($true != (sP1 @ X1 @ X0))))),
% 1.83/1.65 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f81,f82])).
% 1.83/1.65 thf(f82,plain,(
% 1.83/1.65 ! [X1 : $tType,X0 : X1 > X1 > $o] : (? [X2 : X1,X3 : X1] : (($true != (X0 @ X3 @ X2)) & ($true = (X0 @ X2 @ X3))) => (($true != (X0 @ (sK7 @ X1 @ X0) @ (sK6 @ X1 @ X0))) & ((X0 @ (sK6 @ X1 @ X0) @ (sK7 @ X1 @ X0)) = $true)))),
% 1.83/1.65 introduced(definition,[],[choice_axiom])).
% 1.83/1.65 thf(f81,plain,(
% 1.83/1.65 ! [X0 : X1 > X1 > $o,X1 : $tType] : ((($true = (sP1 @ X1 @ X0)) | ((sP0 @ X1 @ X0) != $true) | ? [X2 : X1,X3 : X1] : (($true != (X0 @ X3 @ X2)) & ($true = (X0 @ X2 @ X3)))) & ((((sP0 @ X1 @ X0) = $true) & ! [X4 : X1,X5 : X1] : (($true = (X0 @ X5 @ X4)) | ((X0 @ X4 @ X5) != $true))) | ($true != (sP1 @ X1 @ X0))))),
% 1.83/1.65 inference(rectify,[status(thm)],[f80])).
% 1.83/1.65 thf(f80,plain,(
% 1.83/1.65 ! [X1 : X0 > X0 > $o,X0 : $tType] : ((((sP1 @ X0 @ X1) = $true) | ($true != (sP0 @ X0 @ X1)) | ? [X5 : X0,X6 : X0] : (($true != (X1 @ X6 @ X5)) & ((X1 @ X5 @ X6) = $true))) & ((($true = (sP0 @ X0 @ X1)) & ! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ((X1 @ X5 @ X6) != $true))) | ((sP1 @ X0 @ X1) != $true)))),
% 1.83/1.65 inference(flattening,[status(thm)],[f79])).
% 1.83/1.65 thf(f79,plain,(
% 1.83/1.65 ! [X1 : X0 > X0 > $o,X0 : $tType] : ((((sP1 @ X0 @ X1) = $true) | (($true != (sP0 @ X0 @ X1)) | ? [X5 : X0,X6 : X0] : (($true != (X1 @ X6 @ X5)) & ((X1 @ X5 @ X6) = $true)))) & ((($true = (sP0 @ X0 @ X1)) & ! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ((X1 @ X5 @ X6) != $true))) | ((sP1 @ X0 @ X1) != $true)))),
% 1.83/1.65 inference(nnf_transformation,[status(thm)],[f74])).
% 1.83/1.65 thf(f74,plain,(
% 1.83/1.65 ! [X1 : X0 > X0 > $o,X0 : $tType] : (((sP1 @ X0 @ X1) = $true) <=> (($true = (sP0 @ X0 @ X1)) & ! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ((X1 @ X5 @ X6) != $true))))),
% 1.83/1.65 introduced(definition,[new_symbols(naming,[=])],[predicate_definition_introduction])).
% 1.83/1.65 thf(f442,plain,(
% 1.83/1.65 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ sK5) @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2)))),
% 1.83/1.65 inference(subsumption_resolution,[status(thm)],[f441,f95])).
% 1.83/1.65 thf(f441,plain,(
% 1.83/1.65 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ sK5) @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2))) | ($true != (isPer @ sK2 @ sK3))),
% 1.83/1.65 inference(trivial_inequality_removal,[status(thm)],[f434])).
% 1.83/1.65 thf(f434,plain,(
% 1.83/1.65 ($true != $true) | ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ sK5) @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2))) | ($true != (isPer @ sK2 @ sK3))),
% 1.83/1.65 inference(superposition,[status(thm)],[f132,f103])).
% 1.83/1.65 thf(f132,plain,(
% 1.83/1.65 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ (rev @ sK2 @ sK4 @ sK5)) @ (rev @ sK2 @ sK4 @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2))))),
% 1.83/1.65 inference(forward_demodulation,[status(thm)],[f123,f104])).
% 1.83/1.65 thf(f123,plain,(
% 1.83/1.65 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ (rev @ sK2 @ sK4 @ sK5)) @ (rev @ sK2 @ (plus @ zero @ sK4) @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2))))),
% 1.83/1.65 inference(backward_demodulation,[status(thm)],[f97,f94])).
% 1.83/1.65 thf(f97,plain,(
% 1.83/1.65 ($true != (listStar @ sK2 @ sK3 @ sK4 @ (rev @ sK2 @ sK4 @ (rev @ sK2 @ sK4 @ sK5)) @ (rev @ sK2 @ (plus @ sK4 @ zero) @ (app @ sK2 @ sK4 @ zero @ (rev @ sK2 @ sK4 @ sK5) @ nil @ sK2))))),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f78])).
% 1.83/1.65 thf(f381,plain,(
% 1.83/1.65 spl12_4),
% 1.83/1.65 inference(avatar_contradiction_clause,[status(thm)],[f380])).
% 1.83/1.65 thf(f380,plain,(
% 1.83/1.65 $false | spl12_4),
% 1.83/1.65 inference(subsumption_resolution,[status(thm)],[f379,f95])).
% 1.83/1.65 thf(f379,plain,(
% 1.83/1.65 ($true != (isPer @ sK2 @ sK3)) | spl12_4),
% 1.83/1.65 inference(trivial_inequality_removal,[status(thm)],[f376])).
% 1.83/1.65 thf(f376,plain,(
% 1.83/1.65 ($true != (isPer @ sK2 @ sK3)) | ($true != $true) | spl12_4),
% 1.83/1.65 inference(superposition,[status(thm)],[f359,f105])).
% 1.83/1.65 thf(f105,plain,(
% 1.83/1.65 ( ! [X0 : $tType,X2 : nat,X1 : X0 > X0 > $o] : (($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))) | ((isPer @ X0 @ X1) != $true)) )),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f65])).
% 1.83/1.65 thf(f65,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : nat] : ($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))) | ((isPer @ X0 @ X1) != $true))),
% 1.83/1.65 inference(ennf_transformation,[status(thm)],[f24])).
% 1.83/1.65 thf(f24,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat] : ($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))))),
% 1.83/1.65 inference(fool_elimination,[status(thm)],[f23])).
% 1.83/1.65 thf(f23,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat] : (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2)))),
% 1.83/1.65 inference(rectify,[status(thm)],[f3])).
% 1.83/1.65 thf(f3,axiom,(
% 1.83/1.65 ! [X5 : $tType,X6 : X5 > X5 > $o] : ((isPer @ X5 @ X6) => ! [X7 : nat] : (isPer @ list @ X5 @ (listStar @ X5 @ X6 @ X7)))),
% 1.83/1.65 file('/export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2THF_6906.p','\'listStar\'_is_per')).
% 1.83/1.65 thf(f359,plain,(
% 1.83/1.65 ($true != (isPer @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4))) | spl12_4),
% 1.83/1.65 inference(trivial_inequality_removal,[status(thm)],[f358])).
% 1.83/1.65 thf(f358,plain,(
% 1.83/1.65 ($true != $true) | ($true != (isPer @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4))) | spl12_4),
% 1.83/1.65 inference(superposition,[status(thm)],[f262,f117])).
% 1.83/1.65 thf(f117,plain,(
% 1.83/1.65 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (((sP1 @ X0 @ X1) = $true) | ((isPer @ X0 @ X1) != $true)) )),
% 1.83/1.65 inference(cnf_transformation,[status(thm)],[f88])).
% 1.83/1.65 thf(f88,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | ((sP1 @ X0 @ X1) != $true)) & (((sP1 @ X0 @ X1) = $true) | ((isPer @ X0 @ X1) != $true)))),
% 1.83/1.65 inference(nnf_transformation,[status(thm)],[f75])).
% 1.83/1.65 thf(f75,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) <=> ((sP1 @ X0 @ X1) = $true))),
% 1.83/1.65 inference(definition_folding,[status(thm)],[f70,f74,f73])).
% 1.83/1.65 thf(f73,plain,(
% 1.83/1.65 ! [X1 : X0 > X0 > $o,X0 : $tType] : (($true = (sP0 @ X0 @ X1)) <=> ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X3 @ X4) != $true) | ((X1 @ X2 @ X4) = $true) | ((X1 @ X2 @ X3) != $true)))),
% 1.83/1.65 introduced(definition,[new_symbols(naming,[=])],[predicate_definition_introduction])).
% 1.83/1.65 thf(f70,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) <=> (! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X3 @ X4) != $true) | ((X1 @ X2 @ X4) = $true) | ((X1 @ X2 @ X3) != $true)) & ! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ((X1 @ X5 @ X6) != $true))))),
% 1.83/1.65 inference(flattening,[status(thm)],[f69])).
% 1.83/1.65 thf(f69,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ((X1 @ X5 @ X6) != $true)) & ! [X2 : X0,X3 : X0,X4 : X0] : ((((X1 @ X2 @ X4) = $true) | ((X1 @ X3 @ X4) != $true)) | ((X1 @ X2 @ X3) != $true))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.83/1.65 inference(ennf_transformation,[status(thm)],[f48])).
% 1.83/1.65 thf(f48,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X5 : X0,X6 : X0] : (((X1 @ X5 @ X6) = $true) => ($true = (X1 @ X6 @ X5))) & ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X3) = $true) => (((X1 @ X3 @ X4) = $true) => ((X1 @ X2 @ X4) = $true)))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.83/1.65 inference(fool_elimination,[status(thm)],[f47])).
% 1.83/1.65 thf(f47,plain,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) <=> (! [X2 : X0,X3 : X0,X4 : X0] : ((X1 @ X2 @ X3) => ((X1 @ X3 @ X4) => (X1 @ X2 @ X4))) & ! [X5 : X0,X6 : X0] : ((X1 @ X5 @ X6) => (X1 @ X6 @ X5))))),
% 1.83/1.65 inference(rectify,[status(thm)],[f1])).
% 1.83/1.65 thf(f1,axiom,(
% 1.83/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) <=> (! [X2 : X0,X3 : X0,X4 : X0] : ((X1 @ X2 @ X3) => ((X1 @ X3 @ X4) => (X1 @ X2 @ X4))) & ! [X2 : X0,X3 : X0] : ((X1 @ X2 @ X3) => (X1 @ X3 @ X2))))),
% 1.83/1.65 file('/export/starexec/sandbox/tmp/tmp.AGBpAqJsYq/DTF2THF_6906.p',is_per)).
% 1.83/1.65 thf(f262,plain,(
% 1.83/1.65 ((sP1 @ list @ sK2 @ (listStar @ sK2 @ sK3 @ sK4)) != $true) | spl12_4),
% 1.83/1.65 inference(avatar_component_clause,[status(thm)],[f261])).
% 1.83/1.65 % SZS output end Proof for DTF2THF_6906
% 1.83/1.65 % (7275)------------------------------
% 1.83/1.65 % (7275)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.83/1.65 % (7275)Termination reason: Refutation
% 1.83/1.65
% 1.83/1.65 % (7275)Memory used [KB]: 6012
% 1.83/1.65 % (7275)Time elapsed: 0.042 s
% 1.83/1.65 % (7275)Instructions burned: 111 (million)
% 1.83/1.65 % (7275)------------------------------
% 1.83/1.65 % (7275)------------------------------
% 1.83/1.65 % (7226)Success in time 0.285 s
%------------------------------------------------------------------------------