%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : DAT410^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 : n017.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.70s 1.75s
% Output : Refutation 1.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT410^1 : TPTP v9.2.1. Released v9.2.0.
% 0.09/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Feb 24 06:15:56 EST 2026
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.42 ---- Original DTF file ---
% 0.16/0.42 thf(spec,logic,$$dhol).
% 0.16/0.42 %------------------------------------------------------------------------------
% 0.16/0.42 % File : DAT410^1 : TPTP v9.2.1. Released v9.2.0.
% 0.16/0.42 % Domain : Data Structures
% 0.16/0.42 % Problem : List reversal involution polymorphic, step 5 type instantiated
% 0.16/0.42 % Version : Especial.
% 0.16/0.42 % English : List reversal involution for polymorphic fixed-length lists. The
% 0.16/0.42 % proof is split into smaller steps. To simplify proof search, the
% 0.16/0.42 % axioms in each problem file have been preselected.
% 0.16/0.42
% 0.16/0.42 % Refs : [RRB23] Rothgang et al. (2023), Theorem Proving in Dependently
% 0.16/0.42 % : [Rot25] Rothgang (2025), Email to Geoff Sutcliffe
% 0.16/0.42 % : [RK+25] Ranalter et al. (2025), The Dependently Typed Higher-O
% 0.16/0.42 % Source : [Rot25]
% 0.16/0.42 % Names : ListReversalInvolution/list-rev-invol-step5-typeInstantiated.p [Rot25]
% 0.16/0.42
% 0.16/0.42 % Status : Theorem
% 0.16/0.42 % Rating : ? v9.2.0
% 0.16/0.42 % Syntax : Number of formulae : 26 ( 12 unt; 9 typ; 0 def)
% 0.16/0.42 % Number of atoms : 20 ( 20 equ; 0 cnn)
% 0.16/0.42 % Maximal formula atoms : 2 ( 1 avg)
% 0.16/0.42 % Number of connectives : 257 ( 3 ~; 0 |; 0 &; 247 @)
% 0.16/0.42 % ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% 0.16/0.42 % Maximal formula depth : 8 ( 4 avg)
% 0.16/0.42 % Number of types : 2 ( 1 usr)
% 0.16/0.42 % Number of type decls : 9 ( 4 !>P; 3 !>D)
% 0.16/0.42 % Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% 0.16/0.42 % Number of symbols : 9 ( 8 usr; 1 con; 0-5 aty)
% 0.16/0.42 % Number of variables : 51 ( 0 ^; 43 !; 0 ?; 51 :)
% 0.16/0.42 % ( 8 !>; 0 ?*; 0 @-; 0 @+)
% 0.16/0.42 % SPC : DH1_THM_EQU_NAR
% 0.16/0.42
% 0.16/0.42 % Comments :
% 0.16/0.42 %------------------------------------------------------------------------------
% 0.16/0.42 thf(nat_type,type,
% 0.16/0.42 nat: $tType ).
% 0.16/0.42
% 0.16/0.42 thf(zero_type,type,
% 0.16/0.42 zero: nat ).
% 0.16/0.42
% 0.16/0.42 thf(suc_type,type,
% 0.16/0.42 suc: nat > nat ).
% 0.16/0.42
% 0.16/0.42 thf(plus_type,type,
% 0.16/0.42 plus: nat > nat > nat ).
% 0.16/0.42
% 0.16/0.42 thf(list_type,type,
% 0.16/0.42 list: $tType > nat > $tType ).
% 0.16/0.42
% 0.16/0.42 thf(nil_type,type,
% 0.16/0.42 nil:
% 0.16/0.42 !>[A: $tType] : ( list @ A @ zero ) ).
% 0.16/0.42
% 0.16/0.42 thf(cons_type,type,
% 0.16/0.42 cons:
% 0.16/0.42 !>[A: $tType,N: nat] : ( A > ( list @ A @ N ) > ( list @ A @ ( suc @ N ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(app_type,type,
% 0.16/0.42 app:
% 0.16/0.42 !>[A: $tType,N: nat,M: nat] : ( ( list @ A @ N ) > ( list @ A @ M ) > ( list @ A @ ( plus @ N @ M ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(rev_type,type,
% 0.16/0.42 rev:
% 0.16/0.42 !>[A: $tType,N: nat] : ( ( list @ A @ N ) > ( list @ A @ N ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(peano1,axiom,
% 0.16/0.42 ! [N: nat] :
% 0.16/0.42 ( ( suc @ N )
% 0.16/0.42 != zero ) ).
% 0.16/0.42
% 0.16/0.42 thf(peano2,axiom,
% 0.16/0.42 ! [N: nat,M: nat] :
% 0.16/0.42 ( ( N != M )
% 0.16/0.42 => ( ( suc @ N )
% 0.16/0.42 != ( suc @ M ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(peano3,axiom,
% 0.16/0.42 ! [P: nat > $o] :
% 0.16/0.42 ( ( P @ zero )
% 0.16/0.42 => ( ! [M: nat] :
% 0.16/0.42 ( ( P @ M )
% 0.16/0.42 => ( P @ ( suc @ M ) ) )
% 0.16/0.42 => ! [N: nat] : ( P @ N ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(ax1,axiom,
% 0.16/0.42 ! [N: nat] :
% 0.16/0.42 ( ( plus @ zero @ N )
% 0.16/0.42 = N ) ).
% 0.16/0.42
% 0.16/0.42 thf(ax2,axiom,
% 0.16/0.42 ! [N: nat,M: nat] :
% 0.16/0.42 ( ( plus @ ( suc @ N ) @ M )
% 0.16/0.42 = ( suc @ ( plus @ N @ M ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(ax3,axiom,
% 0.16/0.42 ! [A: $tType,N: nat,X: list @ A @ N] :
% 0.16/0.42 ( ( app @ A @ zero @ N @ ( nil @ A ) @ X )
% 0.16/0.42 = X ) ).
% 0.16/0.42
% 0.16/0.42 thf(ax4,axiom,
% 0.16/0.42 ! [A: $tType,N: nat,M: nat,X: A,Y: list @ A @ N,Z: list @ A @ M] :
% 0.16/0.42 ( ( app @ A @ ( suc @ N ) @ M @ ( cons @ A @ N @ X @ Y ) @ Z )
% 0.16/0.42 = ( cons @ A @ ( plus @ N @ M ) @ X @ ( app @ A @ N @ M @ Y @ Z ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(ax5,axiom,
% 0.16/0.42 ! [A: $tType] :
% 0.16/0.42 ( ( rev @ A @ zero @ ( nil @ A ) )
% 0.16/0.42 = ( nil @ A ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(ax6,axiom,
% 0.16/0.42 ! [A: $tType,N: nat,X: A,Y: list @ A @ N] :
% 0.16/0.42 ( ( rev @ A @ ( suc @ N ) @ ( cons @ A @ N @ X @ Y ) )
% 0.16/0.42 = ( app @ A @ N @ ( suc @ zero ) @ ( rev @ A @ N @ Y ) @ ( cons @ A @ zero @ X @ ( nil @ A ) ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(plus_com,axiom,
% 0.16/0.42 ! [N: nat,M: nat] :
% 0.16/0.42 ( ( plus @ N @ M )
% 0.16/0.42 = ( plus @ M @ N ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(plus1r,axiom,
% 0.16/0.42 ! [N: nat] :
% 0.16/0.42 ( ( suc @ N )
% 0.16/0.42 = ( plus @ N @ ( suc @ zero ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(list_app_nil,axiom,
% 0.16/0.42 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.16/0.42 ( ( app @ A @ N @ zero @ L @ ( nil @ A ) )
% 0.16/0.42 = L ) ).
% 0.16/0.42
% 0.16/0.42 thf(list_rev_invol_step1,axiom,
% 0.16/0.42 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.16/0.42 ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.16/0.42 = ( rev @ A @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ ( rev @ A @ N @ L ) @ ( nil @ A ) ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(list_rev_invol_step2,axiom,
% 0.16/0.42 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.16/0.42 ( ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.16/0.42 = ( rev @ A @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ ( rev @ A @ N @ L ) @ ( nil @ A ) ) ) )
% 0.16/0.42 => ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.16/0.42 = ( app @ A @ zero @ N @ ( rev @ A @ zero @ ( nil @ A ) ) @ L ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(list_rev_invol_step3,axiom,
% 0.16/0.42 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.16/0.42 ( ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.16/0.42 = ( app @ A @ zero @ N @ ( rev @ A @ zero @ ( nil @ A ) ) @ L ) )
% 0.16/0.42 => ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.16/0.42 = ( app @ A @ zero @ N @ ( nil @ A ) @ L ) ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(list_rev_invol_step4,axiom,
% 0.16/0.42 ! [A: $tType,N: nat,L: list @ A @ N] :
% 0.16/0.42 ( ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.16/0.42 = ( app @ A @ zero @ N @ ( nil @ A ) @ L ) )
% 0.16/0.42 => ( ( rev @ A @ N @ ( rev @ A @ N @ L ) )
% 0.16/0.42 = L ) ) ).
% 0.16/0.42
% 0.16/0.42 thf(list_rev_invol,conjecture,
% 0.16/0.42 ! [N: nat,L: list @ ( list @ ( list @ nat @ ( suc @ zero ) ) @ ( suc @ zero ) ) @ N] :
% 0.16/0.42 ( ( rev @ ( list @ ( list @ nat @ ( suc @ zero ) ) @ ( suc @ zero ) ) @ N @ ( rev @ ( list @ ( list @ nat @ ( suc @ zero ) ) @ ( suc @ zero ) ) @ N @ L ) )
% 0.16/0.42 = L ) ).
% 0.16/0.42
% 0.16/0.42 %------------------------------------------------------------------------------
% 0.16/0.42 ------------------------
% 1.51/1.27 ---- Embedded in THF ---
% 1.51/1.27 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.51/1.27 %%% Generated on Tue Feb 24 06:15:56 EST 2026
% 1.51/1.27 %%% using '$$dhol' embedding, version 1.3.0.
% 1.51/1.27 %%% Logic specification used:
% 1.51/1.27 %%% thf(spec, logic, $$dhol).
% 1.51/1.27
% 1.51/1.27 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2DTF20548.p
% 1.51/1.27 thf(is_per_type, type, isPer: (!> [A:$tType]: (((A > (A > $o)) > $o)))).
% 1.51/1.27 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.51/1.27 thf(nat_type, type, nat: $tType).
% 1.51/1.27 thf(natStar, type, 'natStar': (nat > (nat > $o))).
% 1.51/1.27 thf(natStar_is_eq, axiom, (! [X:nat,Y:nat]: (((('natStar' @ X) @ Y) <=> (X = Y))))).
% 1.51/1.27 thf(zero_type, type, zero: nat).
% 1.51/1.27 thf(suc_type, type, suc: (nat > nat)).
% 1.51/1.27 thf(plus_type, type, plus: (nat > (nat > nat))).
% 1.51/1.27 thf(list_type, type, list: ($tType > $tType)).
% 1.51/1.27 thf(listStar, type, 'listStar': (!> [A:$tType]: (((A > (A > $o)) > (nat > ((list @ A) > ((list @ A) > $o))))))).
% 1.51/1.27 thf('\'listStar\'_is_per', axiom, (! [B:$tType,BStar:(B > (B > $o))]: ((((isPer @ B) @ BStar) => (! [C:nat]: (((isPer @ (list @ B)) @ (((listStar @ B) @ BStar) @ C)))))))).
% 1.51/1.27 thf(nil_type, type, nil: (!> [A:$tType]: ((list @ A)))).
% 1.51/1.27 thf(nil_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (((((listStar @ A) @ AStar) @ zero) @ (nil @ A)) @ (nil @ A)))))).
% 1.51/1.27 thf(cons_type, type, cons: (!> [A:$tType]: ((nat > (A > ((list @ A) > (list @ A))))))).
% 1.51/1.27 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.51/1.27 thf(app_type, type, app: (!> [A:$tType]: ((nat > (nat > ((list @ A) > ((list @ A) > (list @ A)))))))).
% 1.51/1.27 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.51/1.27 thf(rev_type, type, rev: (!> [A:$tType]: ((nat > ((list @ A) > (list @ A)))))).
% 1.51/1.27 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.51/1.27 thf(peano1, axiom, (! [N:nat]: (((suc @ N) != zero)))).
% 1.51/1.27 thf(peano2, axiom, (! [N:nat]: ((! [M:nat]: (((N != M) => ((suc @ N) != (suc @ M)))))))).
% 1.51/1.27 thf(peano3, axiom, (! [P:(nat > $o)]: (((P @ zero) => ((! [M:nat]: (((P @ M) => (P @ (suc @ M))))) => (! [N:nat]: ((P @ N)))))))).
% 1.51/1.27 thf(ax1, axiom, (! [N:nat]: ((((plus @ zero) @ N) = N)))).
% 1.51/1.27 thf(ax2, axiom, (! [N:nat]: ((! [M:nat]: ((((plus @ (suc @ N)) @ M) = (suc @ ((plus @ N) @ M)))))))).
% 1.51/1.27 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.51/1.27 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.51/1.27 thf(ax5, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (((((listStar @ A) @ AStar) @ zero) @ (((rev @ A) @ zero) @ (nil @ A))) @ (nil @ A)))))).
% 1.51/1.27 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.51/1.27 thf(plus_com, axiom, (! [N:nat]: ((! [M:nat]: ((((plus @ N) @ M) = ((plus @ M) @ N))))))).
% 1.51/1.27 thf(plus1r, axiom, (! [N:nat]: (((suc @ N) = ((plus @ N) @ (suc @ zero)))))).
% 1.51/1.27 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.51/1.27 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.51/1.27 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.51/1.27 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.51/1.27 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.51/1.27 thf(list_rev_invol, conjecture, (! [N:nat]: ((! [L:(list @ (list @ (list @ nat)))]: (((((((listStar @ (list @ (list @ nat))) @ (((listStar @ (list @ nat)) @ (((listStar @ nat) @ natStar) @ (suc @ zero))) @ (suc @ zero))) @ N) @ L) @ L) => (((((listStar @ (list @ (list @ nat))) @ (((listStar @ (list @ nat)) @ (((listStar @ nat) @ natStar) @ (suc @ zero))) @ (suc @ zero))) @ N) @ (((rev @ (list @ (list @ nat))) @ N) @ (((rev @ (list @ (list @ nat))) @ N) @ L))) @ L))))))).
% 1.51/1.27 % SZS output end ListOfTHF for /export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2DTF20548.p
% 1.51/1.27 ------------------------
% 1.51/1.28 ---- Cleaned THF ---
% 1.51/1.28 thf(is_per_type,type,
% 1.51/1.28 isPer:
% 1.51/1.28 !>[A: $tType] : ( ( A > A > $o ) > $o ) ).
% 1.51/1.28
% 1.51/1.28 thf(is_per,definition,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 <=> ( ! [X: A,Y: A] :
% 1.51/1.28 ( ( AStar @ X @ Y )
% 1.51/1.28 => ( AStar @ Y @ X ) )
% 1.51/1.28 & ! [X: A,Y: A,Z: A] :
% 1.51/1.28 ( ( AStar @ X @ Y )
% 1.51/1.28 => ( ( AStar @ Y @ Z )
% 1.51/1.28 => ( AStar @ X @ Z ) ) ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(nat_type,type,
% 1.51/1.28 nat: $tType ).
% 1.51/1.28
% 1.51/1.28 thf(natStar,type,
% 1.51/1.28 natStar: nat > nat > $o ).
% 1.51/1.28
% 1.51/1.28 thf(natStar_is_eq,axiom,
% 1.51/1.28 ! [X: nat,Y: nat] :
% 1.51/1.28 ( ( natStar @ X @ Y )
% 1.51/1.28 <=> ( X = Y ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(zero_type,type,
% 1.51/1.28 zero: nat ).
% 1.51/1.28
% 1.51/1.28 thf(suc_type,type,
% 1.51/1.28 suc: nat > nat ).
% 1.51/1.28
% 1.51/1.28 thf(plus_type,type,
% 1.51/1.28 plus: nat > nat > nat ).
% 1.51/1.28
% 1.51/1.28 thf(list_type,type,
% 1.51/1.28 list: $tType > $tType ).
% 1.51/1.28
% 1.51/1.28 thf(listStar,type,
% 1.51/1.28 listStar:
% 1.51/1.28 !>[A: $tType] : ( ( A > A > $o ) > nat > ( list @ A ) > ( list @ A ) > $o ) ).
% 1.51/1.28
% 1.51/1.28 thf('\'listStar\'_is_per',axiom,
% 1.51/1.28 ! [B: $tType,BStar: B > B > $o] :
% 1.51/1.28 ( ( isPer @ B @ BStar )
% 1.51/1.28 => ! [C: nat] : ( isPer @ ( list @ B ) @ ( listStar @ B @ BStar @ C ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(nil_type,type,
% 1.51/1.28 nil:
% 1.51/1.28 !>[A: $tType] : ( list @ A ) ).
% 1.51/1.28
% 1.51/1.28 thf(nil_tp_ax,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ( listStar @ A @ AStar @ zero @ ( nil @ A ) @ ( nil @ A ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(cons_type,type,
% 1.51/1.28 cons:
% 1.51/1.28 !>[A: $tType] : ( nat > A > ( list @ A ) > ( list @ A ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(cons_tp_ax,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,D: A,D_prime: A] :
% 1.51/1.28 ( ( D = D_prime )
% 1.51/1.28 => ! [D0: list @ A,D0_prime: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ D0 @ D0_prime )
% 1.51/1.28 => ( listStar @ A @ AStar @ ( suc @ N ) @ ( cons @ A @ N @ D @ D0 ) @ ( cons @ A @ N @ D_prime @ D0_prime ) ) ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(app_type,type,
% 1.51/1.28 app:
% 1.51/1.28 !>[A: $tType] : ( nat > nat > ( list @ A ) > ( list @ A ) > ( list @ A ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(app_tp_ax,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,M: nat,D: list @ A,D_prime: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ D @ D_prime )
% 1.51/1.28 => ! [D0: list @ A,D0_prime: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ M @ D0 @ D0_prime )
% 1.51/1.28 => ( listStar @ A @ AStar @ ( plus @ N @ M ) @ ( app @ A @ N @ M @ D @ D0 ) @ ( app @ A @ N @ M @ D_prime @ D0_prime ) ) ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(rev_type,type,
% 1.51/1.28 rev:
% 1.51/1.28 !>[A: $tType] : ( nat > ( list @ A ) > ( list @ A ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(rev_tp_ax,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,D: list @ A,D_prime: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ D @ D_prime )
% 1.51/1.28 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ D ) @ ( rev @ A @ N @ D_prime ) ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(peano1,axiom,
% 1.51/1.28 ! [N: nat] :
% 1.51/1.28 ( ( suc @ N )
% 1.51/1.28 != zero ) ).
% 1.51/1.28
% 1.51/1.28 thf(peano2,axiom,
% 1.51/1.28 ! [N: nat,M: nat] :
% 1.51/1.28 ( ( N != M )
% 1.51/1.28 => ( ( suc @ N )
% 1.51/1.28 != ( suc @ M ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(peano3,axiom,
% 1.51/1.28 ! [P: nat > $o] :
% 1.51/1.28 ( ( P @ zero )
% 1.51/1.28 => ( ! [M: nat] :
% 1.51/1.28 ( ( P @ M )
% 1.51/1.28 => ( P @ ( suc @ M ) ) )
% 1.51/1.28 => ! [N: nat] : ( P @ N ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(ax1,axiom,
% 1.51/1.28 ! [N: nat] :
% 1.51/1.28 ( ( plus @ zero @ N )
% 1.51/1.28 = N ) ).
% 1.51/1.28
% 1.51/1.28 thf(ax2,axiom,
% 1.51/1.28 ! [N: nat,M: nat] :
% 1.51/1.28 ( ( plus @ ( suc @ N ) @ M )
% 1.51/1.28 = ( suc @ ( plus @ N @ M ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(ax3,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,X: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ X @ X )
% 1.51/1.28 => ( listStar @ A @ AStar @ ( plus @ zero @ N ) @ ( app @ A @ zero @ N @ ( nil @ A ) @ X ) @ X ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(ax4,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,M: nat,X: A,Y: list @ A,Z: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ Y @ Y )
% 1.51/1.28 => ( ( listStar @ A @ AStar @ M @ Z @ Z )
% 1.51/1.28 => ( 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.51/1.28
% 1.51/1.28 thf(ax5,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ( listStar @ A @ AStar @ zero @ ( rev @ A @ zero @ ( nil @ A ) ) @ ( nil @ A ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(ax6,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,X: A,Y: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ Y @ Y )
% 1.51/1.28 => ( 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.51/1.28
% 1.51/1.28 thf(plus_com,axiom,
% 1.51/1.28 ! [N: nat,M: nat] :
% 1.51/1.28 ( ( plus @ N @ M )
% 1.51/1.28 = ( plus @ M @ N ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(plus1r,axiom,
% 1.51/1.28 ! [N: nat] :
% 1.51/1.28 ( ( suc @ N )
% 1.51/1.28 = ( plus @ N @ ( suc @ zero ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(list_app_nil,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,L: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.51/1.28 => ( listStar @ A @ AStar @ ( plus @ N @ zero ) @ ( app @ A @ N @ zero @ L @ ( nil @ A ) ) @ L ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(list_rev_invol_step1,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,L: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.51/1.28 => ( 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.51/1.28
% 1.51/1.28 thf(list_rev_invol_step2,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,L: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.51/1.28 => ( ( 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.51/1.28 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( app @ A @ zero @ N @ ( rev @ A @ zero @ ( nil @ A ) ) @ L ) ) ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(list_rev_invol_step3,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,L: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.51/1.28 => ( ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( app @ A @ zero @ N @ ( rev @ A @ zero @ ( nil @ A ) ) @ L ) )
% 1.51/1.28 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( app @ A @ zero @ N @ ( nil @ A ) @ L ) ) ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(list_rev_invol_step4,axiom,
% 1.51/1.28 ! [A: $tType,AStar: A > A > $o] :
% 1.51/1.28 ( ( isPer @ A @ AStar )
% 1.51/1.28 => ! [N: nat,L: list @ A] :
% 1.51/1.28 ( ( listStar @ A @ AStar @ N @ L @ L )
% 1.51/1.28 => ( ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ ( app @ A @ zero @ N @ ( nil @ A ) @ L ) )
% 1.51/1.28 => ( listStar @ A @ AStar @ N @ ( rev @ A @ N @ ( rev @ A @ N @ L ) ) @ L ) ) ) ) ).
% 1.51/1.28
% 1.51/1.28 thf(list_rev_invol,conjecture,
% 1.51/1.28 ! [N: nat,L: list @ ( list @ ( list @ nat ) )] :
% 1.51/1.28 ( ( listStar @ ( list @ ( list @ nat ) ) @ ( listStar @ ( list @ nat ) @ ( listStar @ nat @ natStar @ ( suc @ zero ) ) @ ( suc @ zero ) ) @ N @ L @ L )
% 1.51/1.28 => ( listStar @ ( list @ ( list @ nat ) ) @ ( listStar @ ( list @ nat ) @ ( listStar @ nat @ natStar @ ( suc @ zero ) ) @ ( suc @ zero ) ) @ N @ ( rev @ ( list @ ( list @ nat ) ) @ N @ ( rev @ ( list @ ( list @ nat ) ) @ N @ L ) ) @ L ) ) ).
% 1.51/1.28 ------------------------
% 1.51/1.29 % (20723)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_20548 for (2999ds/2Mi)
% 1.51/1.29 % (20722)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/2Mi)
% 1.51/1.29 % (20719)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/183Mi)
% 1.51/1.29 % (20724)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_20548 for (2999ds/275Mi)
% 1.51/1.29 % (20721)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_20548 for (2999ds/27Mi)
% 1.51/1.29 % (20720)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_20548 for (2999ds/4Mi)
% 1.51/1.29 % (20722)Instruction limit reached!
% 1.51/1.29 % (20722)------------------------------
% 1.51/1.29 % (20722)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.29 % (20722)Termination reason: Unknown
% 1.51/1.29 % (20722)Termination phase: shuffling
% 1.51/1.29
% 1.51/1.29 % (20722)Memory used [KB]: 1023
% 1.51/1.29 % (20722)Time elapsed: 0.002 s
% 1.51/1.29 % (20722)Instructions burned: 2 (million)
% 1.51/1.29 % (20722)------------------------------
% 1.51/1.29 % (20722)------------------------------
% 1.51/1.29 % (20723)Instruction limit reached!
% 1.51/1.29 % (20723)------------------------------
% 1.51/1.29 % (20723)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.29 % (20723)Termination reason: Unknown
% 1.51/1.29 % (20723)Termination phase: shuffling
% 1.51/1.29
% 1.51/1.29 % (20723)Memory used [KB]: 1023
% 1.51/1.29 % (20723)Time elapsed: 0.002 s
% 1.51/1.29 % (20723)Instructions burned: 2 (million)
% 1.51/1.29 % (20723)------------------------------
% 1.51/1.29 % (20723)------------------------------
% 1.51/1.29 % (20720)Instruction limit reached!
% 1.51/1.29 % (20720)------------------------------
% 1.51/1.29 % (20720)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.29 % (20720)Termination reason: Unknown
% 1.51/1.29 % (20720)Termination phase: shuffling
% 1.51/1.29
% 1.51/1.29 % (20720)Memory used [KB]: 1023
% 1.51/1.29 % (20720)Time elapsed: 0.003 s
% 1.51/1.29 % (20720)Instructions burned: 5 (million)
% 1.51/1.29 % (20720)------------------------------
% 1.51/1.29 % (20720)------------------------------
% 1.70/1.30 % (20724)Refutation not found, incomplete strategy
% 1.70/1.30 % (20724)------------------------------
% 1.70/1.30 % (20724)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.30 % (20724)Termination reason: Refutation not found, incomplete strategy
% 1.70/1.30
% 1.70/1.30
% 1.70/1.30 % (20724)Memory used [KB]: 5756
% 1.70/1.30 % (20724)Time elapsed: 0.009 s
% 1.70/1.30 % (20724)Instructions burned: 24 (million)
% 1.70/1.30 % (20724)------------------------------
% 1.70/1.30 % (20724)------------------------------
% 1.70/1.30 % (20725)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/18Mi)
% 1.70/1.30 % (20721)Instruction limit reached!
% 1.70/1.30 % (20721)------------------------------
% 1.70/1.30 % (20721)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.30 % (20721)Termination reason: Unknown
% 1.70/1.30 % (20721)Termination phase: Saturation
% 1.70/1.30
% 1.70/1.30 % (20721)Memory used [KB]: 5756
% 1.70/1.30 % (20721)Time elapsed: 0.011 s
% 1.70/1.30 % (20721)Instructions burned: 28 (million)
% 1.70/1.30 % (20721)------------------------------
% 1.70/1.30 % (20721)------------------------------
% 1.70/1.30 % (20736)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/3Mi)
% 1.70/1.30 % (20737)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_20548 for (2999ds/37Mi)
% 1.70/1.30 % (20738)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_20548 for (2999ds/15Mi)
% 1.70/1.30 % (20736)Instruction limit reached!
% 1.70/1.30 % (20736)------------------------------
% 1.70/1.30 % (20736)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.30 % (20736)Termination reason: Unknown
% 1.70/1.30 % (20736)Termination phase: shuffling
% 1.70/1.30
% 1.70/1.30 % (20736)Memory used [KB]: 1023
% 1.70/1.30 % (20736)Time elapsed: 0.002 s
% 1.70/1.30 % (20736)Instructions burned: 3 (million)
% 1.70/1.30 % (20736)------------------------------
% 1.70/1.30 % (20736)------------------------------
% 1.70/1.31 % (20738)Instruction limit reached!
% 1.70/1.31 % (20738)------------------------------
% 1.70/1.31 % (20738)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.31 % (20738)Termination reason: Unknown
% 1.70/1.31 % (20738)Termination phase: Saturation
% 1.70/1.31
% 1.70/1.31 % (20738)Memory used [KB]: 1151
% 1.70/1.31 % (20738)Time elapsed: 0.006 s
% 1.70/1.31 % (20738)Instructions burned: 17 (million)
% 1.70/1.31 % (20738)------------------------------
% 1.70/1.31 % (20738)------------------------------
% 1.70/1.31 % (20742)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_20548 for (2999ds/3Mi)
% 1.70/1.31 % (20742)Instruction limit reached!
% 1.70/1.31 % (20742)------------------------------
% 1.70/1.31 % (20742)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.31 % (20742)Termination reason: Unknown
% 1.70/1.31 % (20742)Termination phase: shuffling
% 1.70/1.31
% 1.70/1.31 % (20742)Memory used [KB]: 1023
% 1.70/1.31 % (20742)Time elapsed: 0.002 s
% 1.70/1.31 % (20742)Instructions burned: 3 (million)
% 1.70/1.31 % (20742)------------------------------
% 1.70/1.31 % (20742)------------------------------
% 1.70/1.31 % (20725)Instruction limit reached!
% 1.70/1.31 % (20725)------------------------------
% 1.70/1.31 % (20725)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.31 % (20725)Termination reason: Unknown
% 1.70/1.31 % (20725)Termination phase: Saturation
% 1.70/1.31
% 1.70/1.31 % (20725)Memory used [KB]: 5628
% 1.70/1.31 % (20725)Time elapsed: 0.012 s
% 1.70/1.31 % (20725)Instructions burned: 18 (million)
% 1.70/1.31 % (20725)------------------------------
% 1.70/1.31 % (20725)------------------------------
% 1.70/1.31 % (20744)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_20548 for (2999ds/1041Mi)
% 1.70/1.31 % (20745)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/7Mi)
% 1.70/1.31 % (20737)Instruction limit reached!
% 1.70/1.31 % (20737)------------------------------
% 1.70/1.31 % (20737)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.31 % (20737)Termination reason: Unknown
% 1.70/1.31 % (20737)Termination phase: Saturation
% 1.70/1.31
% 1.70/1.31 % (20737)Memory used [KB]: 5628
% 1.70/1.31 % (20737)Time elapsed: 0.012 s
% 1.70/1.31 % (20737)Instructions burned: 39 (million)
% 1.70/1.31 % (20737)------------------------------
% 1.70/1.31 % (20737)------------------------------
% 1.70/1.31 % (20745)Instruction limit reached!
% 1.70/1.31 % (20745)------------------------------
% 1.70/1.31 % (20745)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.31 % (20745)Termination reason: Unknown
% 1.70/1.31 % (20745)Termination phase: Property scanning
% 1.70/1.31
% 1.70/1.31 % (20745)Memory used [KB]: 1023
% 1.70/1.31 % (20745)Time elapsed: 0.003 s
% 1.70/1.31 % (20745)Instructions burned: 7 (million)
% 1.70/1.31 % (20745)------------------------------
% 1.70/1.31 % (20745)------------------------------
% 1.70/1.32 % (20751)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/16Mi)
% 1.70/1.32 % (20752)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_20548 for (2999ds/3Mi)
% 1.70/1.32 % (20752)Instruction limit reached!
% 1.70/1.32 % (20752)------------------------------
% 1.70/1.32 % (20752)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.32 % (20752)Termination reason: Unknown
% 1.70/1.32 % (20752)Termination phase: shuffling
% 1.70/1.32
% 1.70/1.32 % (20752)Memory used [KB]: 1023
% 1.70/1.32 % (20752)Time elapsed: 0.003 s
% 1.70/1.32 % (20752)Instructions burned: 3 (million)
% 1.70/1.32 % (20752)------------------------------
% 1.70/1.32 % (20752)------------------------------
% 1.70/1.32 % (20751)Instruction limit reached!
% 1.70/1.32 % (20751)------------------------------
% 1.70/1.32 % (20751)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.32 % (20751)Termination reason: Unknown
% 1.70/1.32 % (20751)Termination phase: Saturation
% 1.70/1.32
% 1.70/1.32 % (20751)Memory used [KB]: 5628
% 1.70/1.32 % (20751)Time elapsed: 0.006 s
% 1.70/1.32 % (20751)Instructions burned: 16 (million)
% 1.70/1.32 % (20751)------------------------------
% 1.70/1.32 % (20751)------------------------------
% 1.70/1.32 % (20754)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/7Mi)
% 1.70/1.32 % (20755)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/3Mi)
% 1.70/1.32 % (20755)Instruction limit reached!
% 1.70/1.32 % (20755)------------------------------
% 1.70/1.32 % (20755)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.32 % (20755)Termination reason: Unknown
% 1.70/1.32 % (20755)Termination phase: shuffling
% 1.70/1.32
% 1.70/1.32 % (20755)Memory used [KB]: 1023
% 1.70/1.32 % (20755)Time elapsed: 0.002 s
% 1.70/1.32 % (20755)Instructions burned: 3 (million)
% 1.70/1.32 % (20755)------------------------------
% 1.70/1.32 % (20755)------------------------------
% 1.70/1.33 % (20754)Instruction limit reached!
% 1.70/1.33 % (20754)------------------------------
% 1.70/1.33 % (20754)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.33 % (20754)Termination reason: Unknown
% 1.70/1.33 % (20754)Termination phase: Preprocessing 3
% 1.70/1.33
% 1.70/1.33 % (20754)Memory used [KB]: 1023
% 1.70/1.33 % (20754)Time elapsed: 0.004 s
% 1.70/1.33 % (20754)Instructions burned: 9 (million)
% 1.70/1.33 % (20754)------------------------------
% 1.70/1.33 % (20754)------------------------------
% 1.70/1.33 % (20753)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_20548 for (2999ds/3Mi)
% 1.70/1.33 % (20753)Instruction limit reached!
% 1.70/1.33 % (20753)------------------------------
% 1.70/1.33 % (20753)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.33 % (20753)Termination reason: Unknown
% 1.70/1.33 % (20753)Termination phase: shuffling
% 1.70/1.33
% 1.70/1.33 % (20753)Memory used [KB]: 1023
% 1.70/1.33 % (20753)Time elapsed: 0.003 s
% 1.70/1.33 % (20753)Instructions burned: 3 (million)
% 1.70/1.33 % (20753)------------------------------
% 1.70/1.33 % (20753)------------------------------
% 1.70/1.33 % (20756)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/4Mi)
% 1.70/1.33 % (20757)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/18Mi)
% 1.70/1.33 % (20756)Instruction limit reached!
% 1.70/1.33 % (20756)------------------------------
% 1.70/1.33 % (20756)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.33 % (20756)Termination reason: Unknown
% 1.70/1.33 % (20756)Termination phase: Property scanning
% 1.70/1.33
% 1.70/1.33 % (20756)Memory used [KB]: 1023
% 1.70/1.33 % (20756)Time elapsed: 0.003 s
% 1.70/1.33 % (20756)Instructions burned: 6 (million)
% 1.70/1.33 % (20756)------------------------------
% 1.70/1.33 % (20756)------------------------------
% 1.70/1.33 % (20762)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/710Mi)
% 1.70/1.33 % (20764)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/6Mi)
% 1.70/1.34 % (20764)Instruction limit reached!
% 1.70/1.34 % (20764)------------------------------
% 1.70/1.34 % (20764)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.34 % (20764)Termination reason: Unknown
% 1.70/1.34 % (20764)Termination phase: shuffling
% 1.70/1.34
% 1.70/1.34 % (20764)Memory used [KB]: 1023
% 1.70/1.34 % (20764)Time elapsed: 0.003 s
% 1.70/1.34 % (20764)Instructions burned: 6 (million)
% 1.70/1.34 % (20764)------------------------------
% 1.70/1.34 % (20764)------------------------------
% 1.70/1.34 % (20757)Instruction limit reached!
% 1.70/1.34 % (20757)------------------------------
% 1.70/1.34 % (20757)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.34 % (20757)Termination reason: Unknown
% 1.70/1.34 % (20757)Termination phase: Saturation
% 1.70/1.34
% 1.70/1.34 % (20757)Memory used [KB]: 5628
% 1.70/1.34 % (20757)Time elapsed: 0.007 s
% 1.70/1.34 % (20757)Instructions burned: 19 (million)
% 1.70/1.34 % (20757)------------------------------
% 1.70/1.34 % (20757)------------------------------
% 1.70/1.34 % (20768)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_20548 for (2999ds/902Mi)
% 1.70/1.34 % (20772)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_20548 for (2999ds/21Mi)
% 1.70/1.35 % (20777)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/5Mi)
% 1.70/1.35 % (20778)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_20548 for (2999ds/6Mi)
% 1.70/1.35 % (20777)Instruction limit reached!
% 1.70/1.35 % (20777)------------------------------
% 1.70/1.35 % (20777)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.35 % (20777)Termination reason: Unknown
% 1.70/1.35 % (20777)Termination phase: Property scanning
% 1.70/1.35
% 1.70/1.35 % (20777)Memory used [KB]: 1023
% 1.70/1.35 % (20777)Time elapsed: 0.003 s
% 1.70/1.35 % (20777)Instructions burned: 7 (million)
% 1.70/1.35 % (20777)------------------------------
% 1.70/1.35 % (20777)------------------------------
% 1.70/1.35 % (20768)Refutation not found, incomplete strategy
% 1.70/1.35 % (20768)------------------------------
% 1.70/1.35 % (20768)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.35 % (20768)Termination reason: Refutation not found, incomplete strategy
% 1.70/1.35
% 1.70/1.35
% 1.70/1.35 % (20768)Memory used [KB]: 5628
% 1.70/1.35 % (20768)Time elapsed: 0.009 s
% 1.70/1.35 % (20768)Instructions burned: 23 (million)
% 1.70/1.35 % (20768)------------------------------
% 1.70/1.35 % (20768)------------------------------
% 1.70/1.35 % (20778)Instruction limit reached!
% 1.70/1.35 % (20778)------------------------------
% 1.70/1.35 % (20778)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.35 % (20778)Termination reason: Unknown
% 1.70/1.35 % (20778)Termination phase: Property scanning
% 1.70/1.35
% 1.70/1.35 % (20778)Memory used [KB]: 1023
% 1.70/1.35 % (20778)Time elapsed: 0.003 s
% 1.70/1.35 % (20778)Instructions burned: 7 (million)
% 1.70/1.35 % (20778)------------------------------
% 1.70/1.35 % (20778)------------------------------
% 1.70/1.35 % (20772)Instruction limit reached!
% 1.70/1.35 % (20772)------------------------------
% 1.70/1.35 % (20772)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.35 % (20772)Termination reason: Unknown
% 1.70/1.35 % (20772)Termination phase: Saturation
% 1.70/1.35
% 1.70/1.35 % (20772)Memory used [KB]: 5628
% 1.70/1.35 % (20772)Time elapsed: 0.008 s
% 1.70/1.35 % (20772)Instructions burned: 22 (million)
% 1.70/1.35 % (20772)------------------------------
% 1.70/1.35 % (20772)------------------------------
% 1.70/1.35 % (20719)Instruction limit reached!
% 1.70/1.35 % (20719)------------------------------
% 1.70/1.35 % (20719)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.35 % (20719)Termination reason: Unknown
% 1.70/1.35 % (20719)Termination phase: Saturation
% 1.70/1.35
% 1.70/1.35 % (20719)Memory used [KB]: 6268
% 1.70/1.35 % (20719)Time elapsed: 0.060 s
% 1.70/1.35 % (20719)Instructions burned: 185 (million)
% 1.70/1.35 % (20719)------------------------------
% 1.70/1.35 % (20719)------------------------------
% 1.70/1.36 % (20784)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/377Mi)
% 1.70/1.36 % (20787)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_20548 for (2999ds/779Mi)
% 1.70/1.36 % (20788)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_20548 for (2999ds/19Mi)
% 1.70/1.36 % (20789)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/879Mi)
% 1.70/1.36 % (20790)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/17Mi)
% 1.70/1.36 % (20788)Instruction limit reached!
% 1.70/1.36 % (20788)------------------------------
% 1.70/1.36 % (20788)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.36 % (20788)Termination reason: Unknown
% 1.70/1.36 % (20788)Termination phase: Saturation
% 1.70/1.36
% 1.70/1.36 % (20788)Memory used [KB]: 5628
% 1.70/1.36 % (20788)Time elapsed: 0.006 s
% 1.70/1.36 % (20788)Instructions burned: 19 (million)
% 1.70/1.36 % (20788)------------------------------
% 1.70/1.36 % (20788)------------------------------
% 1.70/1.36 % (20790)Instruction limit reached!
% 1.70/1.36 % (20790)------------------------------
% 1.70/1.36 % (20790)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.36 % (20790)Termination reason: Unknown
% 1.70/1.36 % (20790)Termination phase: Saturation
% 1.70/1.36
% 1.70/1.36 % (20790)Memory used [KB]: 5628
% 1.70/1.36 % (20790)Time elapsed: 0.006 s
% 1.70/1.36 % (20790)Instructions burned: 17 (million)
% 1.70/1.36 % (20790)------------------------------
% 1.70/1.36 % (20790)------------------------------
% 1.70/1.37 % (20793)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/3Mi)
% 1.70/1.37 % (20793)Instruction limit reached!
% 1.70/1.37 % (20793)------------------------------
% 1.70/1.37 % (20793)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.37 % (20793)Termination reason: Unknown
% 1.70/1.37 % (20793)Termination phase: shuffling
% 1.70/1.37
% 1.70/1.37 % (20793)Memory used [KB]: 1023
% 1.70/1.37 % (20793)Time elapsed: 0.002 s
% 1.70/1.37 % (20793)Instructions burned: 4 (million)
% 1.70/1.37 % (20793)------------------------------
% 1.70/1.37 % (20793)------------------------------
% 1.70/1.37 % (20794)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/30Mi)
% 1.70/1.38 % (20801)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/127Mi)
% 1.70/1.38 % (20794)Instruction limit reached!
% 1.70/1.38 % (20794)------------------------------
% 1.70/1.38 % (20794)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.38 % (20794)Termination reason: Unknown
% 1.70/1.38 % (20794)Termination phase: Saturation
% 1.70/1.38
% 1.70/1.38 % (20794)Memory used [KB]: 5756
% 1.70/1.38 % (20794)Time elapsed: 0.011 s
% 1.70/1.38 % (20794)Instructions burned: 32 (million)
% 1.70/1.38 % (20794)------------------------------
% 1.70/1.38 % (20794)------------------------------
% 1.70/1.39 % (20811)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on DTF2THF_20548 for (2999ds/100Mi)
% 1.70/1.42 % (20811)Instruction limit reached!
% 1.70/1.42 % (20811)------------------------------
% 1.70/1.42 % (20811)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.42 % (20811)Termination reason: Unknown
% 1.70/1.42 % (20801)Instruction limit reached!
% 1.70/1.42 % (20801)------------------------------
% 1.70/1.42 % (20801)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.42 % (20811)Termination phase: Saturation
% 1.70/1.42
% 1.70/1.42 % (20811)Memory used [KB]: 6012
% 1.70/1.42 % (20811)Time elapsed: 0.031 s
% 1.70/1.42 % (20811)Instructions burned: 100 (million)
% 1.70/1.42 % (20811)------------------------------
% 1.70/1.42 % (20811)------------------------------
% 1.70/1.42 % (20801)Termination reason: Unknown
% 1.70/1.42 % (20801)Termination phase: Saturation
% 1.70/1.42
% 1.70/1.42 % (20801)Memory used [KB]: 6140
% 1.70/1.42 % (20801)Time elapsed: 0.042 s
% 1.70/1.42 % (20801)Instructions burned: 128 (million)
% 1.70/1.42 % (20801)------------------------------
% 1.70/1.42 % (20801)------------------------------
% 1.70/1.43 % (20827)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_20548 for (2998ds/3Mi)
% 1.70/1.43 % (20828)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_20548 for (2998ds/20Mi)
% 1.70/1.43 % (20827)Instruction limit reached!
% 1.70/1.43 % (20827)------------------------------
% 1.70/1.43 % (20827)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.43 % (20827)Termination reason: Unknown
% 1.70/1.43 % (20827)Termination phase: shuffling
% 1.70/1.43
% 1.70/1.43 % (20827)Memory used [KB]: 1023
% 1.70/1.43 % (20827)Time elapsed: 0.002 s
% 1.70/1.43 % (20827)Instructions burned: 4 (million)
% 1.70/1.43 % (20827)------------------------------
% 1.70/1.43 % (20827)------------------------------
% 1.70/1.44 % (20828)Instruction limit reached!
% 1.70/1.44 % (20828)------------------------------
% 1.70/1.44 % (20828)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.44 % (20828)Termination reason: Unknown
% 1.70/1.44 % (20828)Termination phase: Saturation
% 1.70/1.44
% 1.70/1.44 % (20828)Memory used [KB]: 5628
% 1.70/1.44 % (20828)Time elapsed: 0.007 s
% 1.70/1.44 % (20828)Instructions burned: 20 (million)
% 1.70/1.44 % (20828)------------------------------
% 1.70/1.44 % (20828)------------------------------
% 1.70/1.44 % (20834)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_20548 for (2998ds/86Mi)
% 1.70/1.45 % (20836)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_20548 for (2998ds/107Mi)
% 1.70/1.47 % (20834)Instruction limit reached!
% 1.70/1.47 % (20834)------------------------------
% 1.70/1.47 % (20834)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.47 % (20834)Termination reason: Unknown
% 1.70/1.47 % (20834)Termination phase: Saturation
% 1.70/1.47
% 1.70/1.47 % (20834)Memory used [KB]: 6268
% 1.70/1.47 % (20834)Time elapsed: 0.028 s
% 1.70/1.47 % (20834)Instructions burned: 88 (million)
% 1.70/1.47 % (20834)------------------------------
% 1.70/1.47 % (20834)------------------------------
% 1.70/1.48 % (20784)Instruction limit reached!
% 1.70/1.48 % (20784)------------------------------
% 1.70/1.48 % (20784)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.48 % (20784)Termination reason: Unknown
% 1.70/1.48 % (20784)Termination phase: Saturation
% 1.70/1.48
% 1.70/1.48 % (20784)Memory used [KB]: 6140
% 1.70/1.48 % (20784)Time elapsed: 0.123 s
% 1.70/1.48 % (20784)Instructions burned: 378 (million)
% 1.70/1.48 % (20784)------------------------------
% 1.70/1.48 % (20784)------------------------------
% 1.70/1.48 % (20850)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_20548 for (2998ds/39Mi)
% 1.70/1.48 % (20836)Instruction limit reached!
% 1.70/1.48 % (20836)------------------------------
% 1.70/1.48 % (20836)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.48 % (20836)Termination reason: Unknown
% 1.70/1.48 % (20836)Termination phase: Saturation
% 1.70/1.48
% 1.70/1.48 % (20836)Memory used [KB]: 5884
% 1.70/1.48 % (20836)Time elapsed: 0.035 s
% 1.70/1.48 % (20836)Instructions burned: 108 (million)
% 1.70/1.48 % (20836)------------------------------
% 1.70/1.48 % (20836)------------------------------
% 1.70/1.49 % (20855)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_20548 for (2998ds/448Mi)
% 1.70/1.49 % (20850)Instruction limit reached!
% 1.70/1.49 % (20850)------------------------------
% 1.70/1.49 % (20850)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.49 % (20850)Termination reason: Unknown
% 1.70/1.49 % (20850)Termination phase: Saturation
% 1.70/1.49
% 1.70/1.49 % (20850)Memory used [KB]: 5756
% 1.70/1.49 % (20850)Time elapsed: 0.013 s
% 1.70/1.49 % (20850)Instructions burned: 40 (million)
% 1.70/1.49 % (20850)------------------------------
% 1.70/1.49 % (20850)------------------------------
% 1.70/1.49 % (20857)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_20548 for (2998ds/46Mi)
% 1.70/1.50 % (20860)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_20548 for (2998ds/98Mi)
% 1.70/1.51 % (20857)Instruction limit reached!
% 1.70/1.51 % (20857)------------------------------
% 1.70/1.51 % (20857)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.51 % (20857)Termination reason: Unknown
% 1.70/1.51 % (20857)Termination phase: Saturation
% 1.70/1.51
% 1.70/1.51 % (20857)Memory used [KB]: 5884
% 1.70/1.51 % (20857)Time elapsed: 0.015 s
% 1.70/1.51 % (20857)Instructions burned: 46 (million)
% 1.70/1.51 % (20857)------------------------------
% 1.70/1.51 % (20857)------------------------------
% 1.70/1.51 % (20866)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_20548 for (2997ds/507Mi)
% 1.70/1.52 % (20866)Refutation not found, incomplete strategy
% 1.70/1.52 % (20866)------------------------------
% 1.70/1.52 % (20866)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.52 % (20866)Termination reason: Refutation not found, incomplete strategy
% 1.70/1.52
% 1.70/1.52
% 1.70/1.52 % (20866)Memory used [KB]: 5756
% 1.70/1.52 % (20866)Time elapsed: 0.009 s
% 1.70/1.52 % (20866)Instructions burned: 27 (million)
% 1.70/1.52 % (20866)------------------------------
% 1.70/1.52 % (20866)------------------------------
% 1.70/1.53 % (20860)Instruction limit reached!
% 1.70/1.53 % (20860)------------------------------
% 1.70/1.53 % (20860)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.53 % (20860)Termination reason: Unknown
% 1.70/1.53 % (20860)Termination phase: Saturation
% 1.70/1.53
% 1.70/1.53 % (20860)Memory used [KB]: 1407
% 1.70/1.53 % (20860)Time elapsed: 0.051 s
% 1.70/1.53 % (20860)Instructions burned: 99 (million)
% 1.70/1.53 % (20860)------------------------------
% 1.70/1.53 % (20860)------------------------------
% 1.70/1.53 % (20872)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_20548 for (2997ds/149Mi)
% 1.70/1.54 % (20874)lrs+21_1:16_au=on:bd=off:piset=and:i=39:si=on:rtra=on_0 on DTF2THF_20548 for (2997ds/39Mi)
% 1.70/1.54 % (20762)Instruction limit reached!
% 1.70/1.54 % (20762)------------------------------
% 1.70/1.54 % (20762)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.54 % (20762)Termination reason: Unknown
% 1.70/1.54 % (20762)Termination phase: Saturation
% 1.70/1.54
% 1.70/1.54 % (20762)Memory used [KB]: 7164
% 1.70/1.54 % (20762)Time elapsed: 0.208 s
% 1.70/1.54 % (20762)Instructions burned: 712 (million)
% 1.70/1.54 % (20762)------------------------------
% 1.70/1.54 % (20762)------------------------------
% 1.70/1.55 % (20881)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_20548 for (2997ds/6Mi)
% 1.70/1.55 % (20874)Instruction limit reached!
% 1.70/1.55 % (20874)------------------------------
% 1.70/1.55 % (20874)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.55 % (20874)Termination reason: Unknown
% 1.70/1.55 % (20874)Termination phase: Saturation
% 1.70/1.55
% 1.70/1.55 % (20874)Memory used [KB]: 5756
% 1.70/1.55 % (20874)Time elapsed: 0.014 s
% 1.70/1.55 % (20874)Instructions burned: 41 (million)
% 1.70/1.55 % (20874)------------------------------
% 1.70/1.55 % (20874)------------------------------
% 1.70/1.55 % (20881)Instruction limit reached!
% 1.70/1.55 % (20881)------------------------------
% 1.70/1.55 % (20881)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.55 % (20881)Termination reason: Unknown
% 1.70/1.55 % (20881)Termination phase: shuffling
% 1.70/1.55
% 1.70/1.55 % (20881)Memory used [KB]: 1023
% 1.70/1.55 % (20881)Time elapsed: 0.003 s
% 1.70/1.55 % (20881)Instructions burned: 6 (million)
% 1.70/1.55 % (20881)------------------------------
% 1.70/1.55 % (20881)------------------------------
% 1.70/1.56 % (20887)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_20548 for (2997ds/1087Mi)
% 1.70/1.56 % (20888)dis+10_1:1_aac=none:cs=on:i=47:si=on:rtra=on_0 on DTF2THF_20548 for (2997ds/47Mi)
% 1.70/1.58 % (20888)Instruction limit reached!
% 1.70/1.58 % (20888)------------------------------
% 1.70/1.58 % (20888)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.58 % (20888)Termination reason: Unknown
% 1.70/1.58 % (20888)Termination phase: Saturation
% 1.70/1.58
% 1.70/1.58 % (20888)Memory used [KB]: 5756
% 1.70/1.58 % (20888)Time elapsed: 0.016 s
% 1.70/1.58 % (20888)Instructions burned: 47 (million)
% 1.70/1.58 % (20888)------------------------------
% 1.70/1.58 % (20888)------------------------------
% 1.70/1.58 % (20872)Instruction limit reached!
% 1.70/1.58 % (20872)------------------------------
% 1.70/1.58 % (20872)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.58 % (20872)Termination reason: Unknown
% 1.70/1.58 % (20872)Termination phase: Saturation
% 1.70/1.58
% 1.70/1.58 % (20872)Memory used [KB]: 6140
% 1.70/1.58 % (20872)Time elapsed: 0.070 s
% 1.70/1.58 % (20872)Instructions burned: 150 (million)
% 1.70/1.58 % (20872)------------------------------
% 1.70/1.58 % (20872)------------------------------
% 1.70/1.59 % (20895)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_20548 for (2997ds/44Mi)
% 1.70/1.59 % (20898)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_20548 for (2997ds/432Mi)
% 1.70/1.59 % (20787)Instruction limit reached!
% 1.70/1.59 % (20787)------------------------------
% 1.70/1.59 % (20787)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.59 % (20787)Termination reason: Unknown
% 1.70/1.59 % (20787)Termination phase: Saturation
% 1.70/1.59
% 1.70/1.59 % (20787)Memory used [KB]: 6908
% 1.70/1.59 % (20787)Time elapsed: 0.236 s
% 1.70/1.59 % (20787)Instructions burned: 779 (million)
% 1.70/1.59 % (20787)------------------------------
% 1.70/1.59 % (20787)------------------------------
% 1.70/1.60 % (20895)Instruction limit reached!
% 1.70/1.60 % (20895)------------------------------
% 1.70/1.60 % (20895)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.60 % (20895)Termination reason: Unknown
% 1.70/1.60 % (20895)Termination phase: Saturation
% 1.70/1.60
% 1.70/1.60 % (20895)Memory used [KB]: 1279
% 1.70/1.60 % (20895)Time elapsed: 0.014 s
% 1.70/1.60 % (20895)Instructions burned: 44 (million)
% 1.70/1.60 % (20895)------------------------------
% 1.70/1.60 % (20895)------------------------------
% 1.70/1.60 % (20908)lrs+10_7:1_cnfonf=lazy_gen:fe=off:nwc=5.0:plsq=on:i=62:si=on:rtra=on_0 on DTF2THF_20548 for (2996ds/62Mi)
% 1.70/1.61 % (20914)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_20548 for (2996ds/31Mi)
% 1.70/1.62 % (20914)Instruction limit reached!
% 1.70/1.62 % (20914)------------------------------
% 1.70/1.62 % (20914)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.62 % (20914)Termination reason: Unknown
% 1.70/1.62 % (20914)Termination phase: Saturation
% 1.70/1.62
% 1.70/1.62 % (20914)Memory used [KB]: 5756
% 1.70/1.62 % (20914)Time elapsed: 0.011 s
% 1.70/1.62 % (20914)Instructions burned: 31 (million)
% 1.70/1.62 % (20914)------------------------------
% 1.70/1.62 % (20914)------------------------------
% 1.70/1.62 % (20855)Instruction limit reached!
% 1.70/1.62 % (20855)------------------------------
% 1.70/1.62 % (20855)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.62 % (20855)Termination reason: Unknown
% 1.70/1.62 % (20855)Termination phase: Saturation
% 1.70/1.62
% 1.70/1.62 % (20855)Memory used [KB]: 6396
% 1.70/1.62 % (20855)Time elapsed: 0.153 s
% 1.70/1.62 % (20855)Instructions burned: 450 (million)
% 1.70/1.62 % (20855)------------------------------
% 1.70/1.62 % (20855)------------------------------
% 1.70/1.62 % (20908)Instruction limit reached!
% 1.70/1.62 % (20908)------------------------------
% 1.70/1.62 % (20908)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.62 % (20908)Termination reason: Unknown
% 1.70/1.62 % (20908)Termination phase: Saturation
% 1.70/1.62
% 1.70/1.62 % (20908)Memory used [KB]: 5884
% 1.70/1.62 % (20908)Time elapsed: 0.021 s
% 1.70/1.62 % (20908)Instructions burned: 63 (million)
% 1.70/1.62 % (20908)------------------------------
% 1.70/1.62 % (20908)------------------------------
% 1.70/1.63 % (20744)Instruction limit reached!
% 1.70/1.63 % (20744)------------------------------
% 1.70/1.63 % (20744)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.63 % (20744)Termination reason: Unknown
% 1.70/1.63 % (20744)Termination phase: Saturation
% 1.70/1.63
% 1.70/1.63 % (20744)Memory used [KB]: 7164
% 1.70/1.63 % (20744)Time elapsed: 0.317 s
% 1.70/1.63 % (20744)Instructions burned: 1043 (million)
% 1.70/1.63 % (20744)------------------------------
% 1.70/1.63 % (20744)------------------------------
% 1.70/1.63 % (20928)dis+10_1:128_hud=1:i=96:si=on:rtra=on_0 on DTF2THF_20548 for (2996ds/96Mi)
% 1.70/1.63 % (20930)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_20548 for (2996ds/453Mi)
% 1.70/1.63 % (20933)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_20548 for (2996ds/71Mi)
% 1.70/1.64 % (20936)dis+1002_1:1_bd=off:fsr=off:ntd=on:s2a=on:ss=axioms:i=83:si=on:rtra=on_0 on DTF2THF_20548 for (2996ds/83Mi)
% 1.70/1.64 % (20789)Instruction limit reached!
% 1.70/1.64 % (20789)------------------------------
% 1.70/1.64 % (20789)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.64 % (20789)Termination reason: Unknown
% 1.70/1.64 % (20789)Termination phase: Saturation
% 1.70/1.64
% 1.70/1.64 % (20789)Memory used [KB]: 7291
% 1.70/1.64 % (20789)Time elapsed: 0.282 s
% 1.70/1.64 % (20789)Instructions burned: 880 (million)
% 1.70/1.64 % (20789)------------------------------
% 1.70/1.64 % (20789)------------------------------
% 1.70/1.65 % (20940)lrs+10_1:128_cnfonf=lazy_not_gen_be_off:hud=1:ins=1:i=11:si=on:rtra=on_0 on DTF2THF_20548 for (2996ds/11Mi)
% 1.70/1.65 % (20940)Instruction limit reached!
% 1.70/1.65 % (20940)------------------------------
% 1.70/1.65 % (20940)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.65 % (20940)Termination reason: Unknown
% 1.70/1.65 % (20940)Termination phase: Property scanning
% 1.70/1.65
% 1.70/1.65 % (20940)Memory used [KB]: 1023
% 1.70/1.65 % (20940)Time elapsed: 0.005 s
% 1.70/1.65 % (20940)Instructions burned: 13 (million)
% 1.70/1.65 % (20940)------------------------------
% 1.70/1.65 % (20940)------------------------------
% 1.70/1.65 % (20933)Instruction limit reached!
% 1.70/1.65 % (20933)------------------------------
% 1.70/1.65 % (20933)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.65 % (20933)Termination reason: Unknown
% 1.70/1.65 % (20933)Termination phase: Saturation
% 1.70/1.65
% 1.70/1.65 % (20933)Memory used [KB]: 5884
% 1.70/1.65 % (20933)Time elapsed: 0.024 s
% 1.70/1.65 % (20933)Instructions burned: 71 (million)
% 1.70/1.65 % (20933)------------------------------
% 1.70/1.65 % (20933)------------------------------
% 1.70/1.66 % (20928)Instruction limit reached!
% 1.70/1.66 % (20928)------------------------------
% 1.70/1.66 % (20928)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.66 % (20928)Termination reason: Unknown
% 1.70/1.66 % (20928)Termination phase: Saturation
% 1.70/1.66
% 1.70/1.66 % (20928)Memory used [KB]: 5884
% 1.70/1.66 % (20928)Time elapsed: 0.033 s
% 1.70/1.66 % (20928)Instructions burned: 97 (million)
% 1.70/1.66 % (20928)------------------------------
% 1.70/1.66 % (20928)------------------------------
% 1.70/1.66 % (20936)Instruction limit reached!
% 1.70/1.66 % (20936)------------------------------
% 1.70/1.66 % (20936)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.66 % (20936)Termination reason: Unknown
% 1.70/1.66 % (20936)Termination phase: Saturation
% 1.70/1.66
% 1.70/1.66 % (20936)Memory used [KB]: 5884
% 1.70/1.66 % (20936)Time elapsed: 0.027 s
% 1.70/1.66 % (20936)Instructions burned: 83 (million)
% 1.70/1.66 % (20936)------------------------------
% 1.70/1.66 % (20936)------------------------------
% 1.70/1.66 % (20944)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_20548 for (2996ds/41Mi)
% 1.70/1.66 % (20945)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_20548 for (2996ds/6Mi)
% 1.70/1.67 % (20945)Instruction limit reached!
% 1.70/1.67 % (20945)------------------------------
% 1.70/1.67 % (20945)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.67 % (20945)Termination reason: Unknown
% 1.70/1.67 % (20945)Termination phase: Property scanning
% 1.70/1.67
% 1.70/1.67 % (20945)Memory used [KB]: 1023
% 1.70/1.67 % (20945)Time elapsed: 0.003 s
% 1.70/1.67 % (20945)Instructions burned: 7 (million)
% 1.70/1.67 % (20945)------------------------------
% 1.70/1.67 % (20945)------------------------------
% 1.70/1.67 % (20946)dis+10_1:1_avsq=on:cnfonf=off:e2e=on:nm=32:i=150:si=on:rtra=on_0 on DTF2THF_20548 for (2996ds/150Mi)
% 1.70/1.67 % (20947)ott+1010_1:1_au=on:s2a=on:sd=7:ss=axioms:st=1.5:i=343:si=on:rtra=on_0 on DTF2THF_20548 for (2996ds/343Mi)
% 1.70/1.67 % (20944)Instruction limit reached!
% 1.70/1.67 % (20944)------------------------------
% 1.70/1.67 % (20944)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.67 % (20944)Termination reason: Unknown
% 1.70/1.67 % (20944)Termination phase: Saturation
% 1.70/1.67
% 1.70/1.67 % (20944)Memory used [KB]: 5756
% 1.70/1.67 % (20944)Time elapsed: 0.013 s
% 1.70/1.67 % (20944)Instructions burned: 44 (million)
% 1.70/1.67 % (20944)------------------------------
% 1.70/1.67 % (20944)------------------------------
% 1.70/1.68 % (20948)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_20548 for (2996ds/109Mi)
% 1.70/1.68 % (20949)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_20548 for (2996ds/253Mi)
% 1.70/1.71 % (20948)Instruction limit reached!
% 1.70/1.71 % (20948)------------------------------
% 1.70/1.71 % (20948)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.71 % (20948)Termination reason: Unknown
% 1.70/1.71 % (20948)Termination phase: Saturation
% 1.70/1.71
% 1.70/1.71 % (20948)Memory used [KB]: 5884
% 1.70/1.71 % (20948)Time elapsed: 0.035 s
% 1.70/1.71 % (20948)Instructions burned: 109 (million)
% 1.70/1.71 % (20948)------------------------------
% 1.70/1.71 % (20948)------------------------------
% 1.70/1.71 % (20898)Instruction limit reached!
% 1.70/1.71 % (20898)------------------------------
% 1.70/1.71 % (20898)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.71 % (20898)Termination reason: Unknown
% 1.70/1.71 % (20898)Termination phase: Saturation
% 1.70/1.71
% 1.70/1.71 % (20898)Memory used [KB]: 3582
% 1.70/1.71 % (20898)Time elapsed: 0.126 s
% 1.70/1.71 % (20898)Instructions burned: 433 (million)
% 1.70/1.71 % (20898)------------------------------
% 1.70/1.71 % (20898)------------------------------
% 1.70/1.72 % (20946)Instruction limit reached!
% 1.70/1.72 % (20946)------------------------------
% 1.70/1.72 % (20946)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.72 % (20946)Termination reason: Unknown
% 1.70/1.72 % (20946)Termination phase: Saturation
% 1.70/1.72
% 1.70/1.72 % (20946)Memory used [KB]: 6268
% 1.70/1.72 % (20946)Time elapsed: 0.047 s
% 1.70/1.72 % (20946)Instructions burned: 151 (million)
% 1.70/1.72 % (20946)------------------------------
% 1.70/1.72 % (20946)------------------------------
% 1.70/1.72 % (20950)lrs+10_1:1_au=on:cnfonf=off:sd=1:sgt=16:ss=axioms:i=140:si=on:rtra=on_0 on DTF2THF_20548 for (2995ds/140Mi)
% 1.70/1.72 % (20951)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_20548 for (2995ds/614Mi)
% 1.70/1.72 % (20952)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_20548 for (2995ds/202Mi)
% 1.70/1.74 % (20952)Refutation not found, incomplete strategy
% 1.70/1.74 % (20952)------------------------------
% 1.70/1.74 % (20952)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.74 % (20952)Termination reason: Refutation not found, incomplete strategy
% 1.70/1.74
% 1.70/1.74
% 1.70/1.74 % (20952)Memory used [KB]: 5756
% 1.70/1.74 % (20952)Time elapsed: 0.011 s
% 1.70/1.74 % (20952)Instructions burned: 32 (million)
% 1.70/1.74 % (20952)------------------------------
% 1.70/1.74 % (20952)------------------------------
% 1.70/1.74 % (20949)First to succeed.
% 1.70/1.75 % (20953)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_20548 for (2995ds/339Mi)
% 1.70/1.75 % (20949)Refutation found. Thanks to Tanya!
% 1.70/1.75 % SZS status Theorem for DTF2THF_20548
% 1.70/1.75 % SZS output start Proof for DTF2THF_20548
% 1.70/1.75 thf(type_def_6, type, nat: $tType).
% 1.70/1.75 thf(type_def_7, type, list: ($tType) > $tType).
% 1.70/1.75 thf(func_def_0, type, isPer: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.70/1.75 thf(func_def_2, type, nat: $tType).
% 1.70/1.75 thf(func_def_3, type, natStar: nat > nat > $o).
% 1.70/1.75 thf(func_def_4, type, zero: nat).
% 1.70/1.75 thf(func_def_5, type, suc: nat > nat).
% 1.70/1.75 thf(func_def_6, type, plus: nat > nat > nat).
% 1.70/1.75 thf(func_def_7, type, list: ($tType) > $tType).
% 1.70/1.75 thf(func_def_8, type, listStar: !>[X0: $tType]:((X0 > X0 > $o) > nat > list @ X0 > list @ X0 > $o)).
% 1.70/1.75 thf(func_def_9, type, nil: !>[X0: $tType]:(list @ X0)).
% 1.70/1.75 thf(func_def_10, type, cons: !>[X0: $tType]:(nat > X0 > list @ X0 > list @ X0)).
% 1.70/1.75 thf(func_def_11, type, app: !>[X0: $tType]:(nat > nat > list @ X0 > list @ X0 > list @ X0)).
% 1.70/1.75 thf(func_def_12, type, rev: !>[X0: $tType]:(nat > list @ X0 > list @ X0)).
% 1.70/1.75 thf(func_def_15, type, sK0: nat).
% 1.70/1.75 thf(func_def_16, type, sK1: list @ list @ list @ nat).
% 1.70/1.75 thf(func_def_17, type, sK2: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.70/1.75 thf(func_def_18, type, sK3: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.70/1.75 thf(func_def_19, type, sK4: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.70/1.75 thf(func_def_20, type, sK5: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.70/1.75 thf(func_def_21, type, sK6: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.70/1.75 thf(func_def_22, type, sK7: (nat > $o) > nat).
% 1.70/1.75 thf(func_def_24, type, ph9: !>[X0: $tType]:(X0)).
% 1.70/1.75 thf(f910,plain,(
% 1.70/1.75 $false),
% 1.70/1.75 inference(avatar_sat_refutation,[status(thm)],[f165,f174,f183,f190,f209,f581,f582,f784,f895,f900,f909])).
% 1.70/1.75 thf(f909,plain,(
% 1.70/1.75 spl8_45 | spl8_1 | ~spl8_44),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f904,f493,f158,f498])).
% 1.70/1.75 thf(f498,definition,(
% 1.70/1.75 spl8_45 <=> ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true)),
% 1.70/1.75 introduced(definition,[new_symbols(naming,[spl8_45])],[avatar_definition])).
% 1.70/1.75 thf(f158,definition,(
% 1.70/1.75 spl8_1 <=> ($true = (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero))))),
% 1.70/1.75 introduced(definition,[new_symbols(naming,[spl8_1])],[avatar_definition])).
% 1.70/1.75 thf(f493,definition,(
% 1.70/1.75 spl8_44 <=> ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar)))),
% 1.70/1.75 introduced(definition,[new_symbols(naming,[spl8_44])],[avatar_definition])).
% 1.70/1.75 thf(f904,plain,(
% 1.70/1.75 ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f903])).
% 1.70/1.75 thf(f903,plain,(
% 1.70/1.75 ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true) | ($true != $true) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f902,f132])).
% 1.70/1.75 thf(f132,plain,(
% 1.70/1.75 ( ! [X1 : nat] : (($true = (natStar @ X1 @ X1))) )),
% 1.70/1.75 inference(equality_resolution,[status(thm)],[f103])).
% 1.70/1.75 thf(f103,plain,(
% 1.70/1.75 ( ! [X0 : nat,X1 : nat] : (($true = (natStar @ X0 @ X1)) | (X0 != X1)) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f89])).
% 1.70/1.75 thf(f89,plain,(
% 1.70/1.75 ! [X0 : nat,X1 : nat] : (((X0 = X1) | ($true != (natStar @ X0 @ X1))) & (($true = (natStar @ X0 @ X1)) | (X0 != X1)))),
% 1.70/1.75 inference(nnf_transformation,[status(thm)],[f38])).
% 1.70/1.75 thf(f38,plain,(
% 1.70/1.75 ! [X0 : nat,X1 : nat] : ((X0 = X1) <=> ($true = (natStar @ X0 @ X1)))),
% 1.70/1.75 inference(fool_elimination,[status(thm)],[f37])).
% 1.70/1.75 thf(f37,plain,(
% 1.70/1.75 ! [X0 : nat,X1 : nat] : ((X0 = X1) <=> (natStar @ X0 @ X1))),
% 1.70/1.75 inference(rectify,[status(thm)],[f2])).
% 1.70/1.75 thf(f2,axiom,(
% 1.70/1.75 ! [X2 : nat,X3 : nat] : ((X2 = X3) <=> (natStar @ X2 @ X3))),
% 1.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',natStar_is_eq)).
% 1.70/1.75 thf(f902,plain,(
% 1.70/1.75 ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f901])).
% 1.70/1.75 thf(f901,plain,(
% 1.70/1.75 ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true) | ($true = $false) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f889,f486])).
% 1.70/1.75 thf(f486,plain,(
% 1.70/1.75 ((isPer @ nat @ natStar) = $false) | spl8_1),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f474])).
% 1.70/1.75 thf(f474,plain,(
% 1.70/1.75 ((isPer @ nat @ natStar) = $false) | ($true != $true) | spl8_1),
% 1.70/1.75 inference(fool_paramodulation,[status(thm)],[f285])).
% 1.70/1.75 thf(f285,plain,(
% 1.70/1.75 ((isPer @ nat @ natStar) != $true) | spl8_1),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f274])).
% 1.70/1.75 thf(f274,plain,(
% 1.70/1.75 ((isPer @ nat @ natStar) != $true) | ($true != $true) | spl8_1),
% 1.70/1.75 inference(superposition,[status(thm)],[f221,f125])).
% 1.70/1.75 thf(f125,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X2 : nat,X1 : X0 > X0 > $o] : (($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))) | ((isPer @ X0 @ X1) != $true)) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f84])).
% 1.70/1.75 thf(f84,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : nat] : ($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))))),
% 1.70/1.75 inference(ennf_transformation,[status(thm)],[f52])).
% 1.70/1.75 thf(f52,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat] : ($true = (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2))))),
% 1.70/1.75 inference(fool_elimination,[status(thm)],[f51])).
% 1.70/1.75 thf(f51,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat] : (isPer @ list @ X0 @ (listStar @ X0 @ X1 @ X2)))),
% 1.70/1.75 inference(rectify,[status(thm)],[f3])).
% 1.70/1.75 thf(f3,axiom,(
% 1.70/1.75 ! [X5 : $tType,X6 : X5 > X5 > $o] : ((isPer @ X5 @ X6) => ! [X7 : nat] : (isPer @ list @ X5 @ (listStar @ X5 @ X6 @ X7)))),
% 1.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p','\'listStar\'_is_per')).
% 1.70/1.75 thf(f221,plain,(
% 1.70/1.75 ($true != (isPer @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)))) | spl8_1),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f211])).
% 1.70/1.75 thf(f211,plain,(
% 1.70/1.75 ($true != (isPer @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)))) | ($true != $true) | spl8_1),
% 1.70/1.75 inference(superposition,[status(thm)],[f160,f125])).
% 1.70/1.75 thf(f160,plain,(
% 1.70/1.75 ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)))) | spl8_1),
% 1.70/1.75 inference(avatar_component_clause,[status(thm)],[f158])).
% 1.70/1.75 thf(f889,plain,(
% 1.70/1.75 ((isPer @ nat @ natStar) = $true) | ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true) | ~spl8_44),
% 1.70/1.75 inference(superposition,[status(thm)],[f120,f856])).
% 1.70/1.75 thf(f856,plain,(
% 1.70/1.75 ((sK3 @ nat @ natStar) = (sK2 @ nat @ natStar)) | ~spl8_44),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f850])).
% 1.70/1.75 thf(f850,plain,(
% 1.70/1.75 ((sK3 @ nat @ natStar) = (sK2 @ nat @ natStar)) | ($true != $true) | ~spl8_44),
% 1.70/1.75 inference(superposition,[status(thm)],[f104,f495])).
% 1.70/1.75 thf(f495,plain,(
% 1.70/1.75 ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar))) | ~spl8_44),
% 1.70/1.75 inference(avatar_component_clause,[status(thm)],[f493])).
% 1.70/1.75 thf(f104,plain,(
% 1.70/1.75 ( ! [X0 : nat,X1 : nat] : (($true != (natStar @ X0 @ X1)) | (X0 = X1)) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f89])).
% 1.70/1.75 thf(f120,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (($true = (X1 @ (sK5 @ X0 @ X1) @ (sK6 @ X0 @ X1))) | ((isPer @ X0 @ X1) = $true) | ($true != (X1 @ (sK3 @ X0 @ X1) @ (sK2 @ X0 @ X1)))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f97])).
% 1.70/1.75 thf(f97,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | (($true != (X1 @ (sK3 @ X0 @ X1) @ (sK2 @ X0 @ X1))) & ($true = (X1 @ (sK2 @ X0 @ X1) @ (sK3 @ X0 @ X1)))) | (($true = (X1 @ (sK5 @ X0 @ X1) @ (sK6 @ X0 @ X1))) & ($true = (X1 @ (sK4 @ X0 @ X1) @ (sK5 @ X0 @ X1))) & ($true != (X1 @ (sK4 @ X0 @ X1) @ (sK6 @ X0 @ X1))))) & ((! [X7 : X0,X8 : X0] : (($true = (X1 @ X8 @ X7)) | ($true != (X1 @ X7 @ X8))) & ! [X9 : X0,X10 : X0,X11 : X0] : (((X1 @ X10 @ X11) != $true) | ($true != (X1 @ X9 @ X10)) | ($true = (X1 @ X9 @ X11)))) | ((isPer @ X0 @ X1) != $true)))),
% 1.70/1.75 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6])],[f94,f96,f95])).
% 1.70/1.75 thf(f95,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (? [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) != $true) & ((X1 @ X2 @ X3) = $true)) => (($true != (X1 @ (sK3 @ X0 @ X1) @ (sK2 @ X0 @ X1))) & ($true = (X1 @ (sK2 @ X0 @ X1) @ (sK3 @ X0 @ X1)))))),
% 1.70/1.75 introduced(definition,[],[choice_axiom])).
% 1.70/1.75 thf(f96,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (? [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X5 @ X6)) & ($true = (X1 @ X4 @ X5)) & ($true != (X1 @ X4 @ X6))) => (($true = (X1 @ (sK5 @ X0 @ X1) @ (sK6 @ X0 @ X1))) & ($true = (X1 @ (sK4 @ X0 @ X1) @ (sK5 @ X0 @ X1))) & ($true != (X1 @ (sK4 @ X0 @ X1) @ (sK6 @ X0 @ X1)))))),
% 1.70/1.75 introduced(definition,[],[choice_axiom])).
% 1.70/1.75 thf(f94,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | ? [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) != $true) & ((X1 @ X2 @ X3) = $true)) | ? [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X5 @ X6)) & ($true = (X1 @ X4 @ X5)) & ($true != (X1 @ X4 @ X6)))) & ((! [X7 : X0,X8 : X0] : (($true = (X1 @ X8 @ X7)) | ($true != (X1 @ X7 @ X8))) & ! [X9 : X0,X10 : X0,X11 : X0] : (((X1 @ X10 @ X11) != $true) | ($true != (X1 @ X9 @ X10)) | ($true = (X1 @ X9 @ X11)))) | ((isPer @ X0 @ X1) != $true)))),
% 1.70/1.75 inference(rectify,[status(thm)],[f93])).
% 1.70/1.75 thf(f93,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | ? [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) != $true) & ((X1 @ X2 @ X3) = $true)) | ? [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X5 @ X6)) & ($true = (X1 @ X4 @ X5)) & ($true != (X1 @ X4 @ X6)))) & ((! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true)) & ! [X4 : X0,X5 : X0,X6 : X0] : (($true != (X1 @ X5 @ X6)) | ($true != (X1 @ X4 @ X5)) | ($true = (X1 @ X4 @ X6)))) | ((isPer @ X0 @ X1) != $true)))),
% 1.70/1.75 inference(flattening,[status(thm)],[f92])).
% 1.70/1.75 thf(f92,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | (? [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) != $true) & ((X1 @ X2 @ X3) = $true)) | ? [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X5 @ X6)) & ($true = (X1 @ X4 @ X5)) & ($true != (X1 @ X4 @ X6))))) & ((! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true)) & ! [X4 : X0,X5 : X0,X6 : X0] : (($true != (X1 @ X5 @ X6)) | ($true != (X1 @ X4 @ X5)) | ($true = (X1 @ X4 @ X6)))) | ((isPer @ X0 @ X1) != $true)))),
% 1.70/1.75 inference(nnf_transformation,[status(thm)],[f83])).
% 1.70/1.75 thf(f83,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) <=> (! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true)) & ! [X4 : X0,X5 : X0,X6 : X0] : (($true != (X1 @ X5 @ X6)) | ($true != (X1 @ X4 @ X5)) | ($true = (X1 @ X4 @ X6)))))),
% 1.70/1.75 inference(flattening,[status(thm)],[f82])).
% 1.70/1.75 thf(f82,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) = $true) | ((X1 @ X2 @ X3) != $true)) & ! [X4 : X0,X5 : X0,X6 : X0] : ((($true = (X1 @ X4 @ X6)) | ($true != (X1 @ X5 @ X6))) | ($true != (X1 @ X4 @ X5)))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.70/1.75 inference(ennf_transformation,[status(thm)],[f60])).
% 1.70/1.75 thf(f60,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X2 : X0,X3 : X0] : (((X1 @ X2 @ X3) = $true) => ((X1 @ X3 @ X2) = $true)) & ! [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X4 @ X5)) => (($true = (X1 @ X5 @ X6)) => ($true = (X1 @ X4 @ X6))))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.70/1.75 inference(fool_elimination,[status(thm)],[f59])).
% 1.70/1.75 thf(f59,plain,(
% 1.70/1.75 ! [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.70/1.75 inference(rectify,[status(thm)],[f1])).
% 1.70/1.75 thf(f1,axiom,(
% 1.70/1.75 ! [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.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',is_per)).
% 1.70/1.75 thf(f900,plain,(
% 1.70/1.75 spl8_47 | spl8_1 | ~spl8_44),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f899,f493,f158,f508])).
% 1.70/1.75 thf(f508,definition,(
% 1.70/1.75 spl8_47 <=> ($true = (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar)))),
% 1.70/1.75 introduced(definition,[new_symbols(naming,[spl8_47])],[avatar_definition])).
% 1.70/1.75 thf(f899,plain,(
% 1.70/1.75 ($true = (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f898])).
% 1.70/1.75 thf(f898,plain,(
% 1.70/1.75 ($true != $true) | ($true = (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f897,f132])).
% 1.70/1.75 thf(f897,plain,(
% 1.70/1.75 ($true = (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f896])).
% 1.70/1.75 thf(f896,plain,(
% 1.70/1.75 ($true = $false) | ($true = (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f888,f486])).
% 1.70/1.75 thf(f888,plain,(
% 1.70/1.75 ((isPer @ nat @ natStar) = $true) | ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | ($true = (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | ~spl8_44),
% 1.70/1.75 inference(superposition,[status(thm)],[f119,f856])).
% 1.70/1.75 thf(f119,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) | ($true != (X1 @ (sK3 @ X0 @ X1) @ (sK2 @ X0 @ X1))) | ($true = (X1 @ (sK4 @ X0 @ X1) @ (sK5 @ X0 @ X1)))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f97])).
% 1.70/1.75 thf(f895,plain,(
% 1.70/1.75 ~spl8_47 | spl8_1 | ~spl8_44 | ~spl8_45),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f894,f498,f493,f158,f508])).
% 1.70/1.75 thf(f894,plain,(
% 1.70/1.75 ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | (spl8_1 | ~spl8_44 | ~spl8_45)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f893])).
% 1.70/1.75 thf(f893,plain,(
% 1.70/1.75 ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | ($true != $true) | (spl8_1 | ~spl8_44 | ~spl8_45)),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f892,f132])).
% 1.70/1.75 thf(f892,plain,(
% 1.70/1.75 ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | (spl8_1 | ~spl8_44 | ~spl8_45)),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f891,f713])).
% 1.70/1.75 thf(f713,plain,(
% 1.70/1.75 ((sK5 @ nat @ natStar) = (sK6 @ nat @ natStar)) | ~spl8_45),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f707])).
% 1.70/1.75 thf(f707,plain,(
% 1.70/1.75 ($true != $true) | ((sK5 @ nat @ natStar) = (sK6 @ nat @ natStar)) | ~spl8_45),
% 1.70/1.75 inference(superposition,[status(thm)],[f104,f500])).
% 1.70/1.75 thf(f500,plain,(
% 1.70/1.75 ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true) | ~spl8_45),
% 1.70/1.75 inference(avatar_component_clause,[status(thm)],[f498])).
% 1.70/1.75 thf(f891,plain,(
% 1.70/1.75 ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK6 @ nat @ natStar))) | ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f890])).
% 1.70/1.75 thf(f890,plain,(
% 1.70/1.75 ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | ($true = $false) | ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK6 @ nat @ natStar))) | (spl8_1 | ~spl8_44)),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f887,f486])).
% 1.70/1.75 thf(f887,plain,(
% 1.70/1.75 ((isPer @ nat @ natStar) = $true) | ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK6 @ nat @ natStar))) | ($true != (natStar @ (sK2 @ nat @ natStar) @ (sK2 @ nat @ natStar))) | ~spl8_44),
% 1.70/1.75 inference(superposition,[status(thm)],[f118,f856])).
% 1.70/1.75 thf(f118,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) | ($true != (X1 @ (sK3 @ X0 @ X1) @ (sK2 @ X0 @ X1))) | ($true != (X1 @ (sK4 @ X0 @ X1) @ (sK6 @ X0 @ X1)))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f97])).
% 1.70/1.75 thf(f784,plain,(
% 1.70/1.75 ~spl8_47 | spl8_44 | spl8_1 | ~spl8_45),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f783,f498,f158,f493,f508])).
% 1.70/1.75 thf(f783,plain,(
% 1.70/1.75 ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar))) | ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | (spl8_1 | ~spl8_45)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f782])).
% 1.70/1.75 thf(f782,plain,(
% 1.70/1.75 ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar))) | ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | ($true = $false) | (spl8_1 | ~spl8_45)),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f778,f486])).
% 1.70/1.75 thf(f778,plain,(
% 1.70/1.75 ($true != (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar))) | ((isPer @ nat @ natStar) = $true) | ~spl8_45),
% 1.70/1.75 inference(superposition,[status(thm)],[f115,f713])).
% 1.70/1.75 thf(f115,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (($true != (X1 @ (sK4 @ X0 @ X1) @ (sK6 @ X0 @ X1))) | ((isPer @ X0 @ X1) = $true) | ($true = (X1 @ (sK2 @ X0 @ X1) @ (sK3 @ X0 @ X1)))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f97])).
% 1.70/1.75 thf(f582,plain,(
% 1.70/1.75 spl8_47 | spl8_44 | spl8_1),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f575,f158,f493,f508])).
% 1.70/1.75 thf(f575,plain,(
% 1.70/1.75 ($true = (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar))) | spl8_1),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f546])).
% 1.70/1.75 thf(f546,plain,(
% 1.70/1.75 ($true = $false) | ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar))) | ($true = (natStar @ (sK4 @ nat @ natStar) @ (sK5 @ nat @ natStar))) | spl8_1),
% 1.70/1.75 inference(superposition,[status(thm)],[f486,f116])).
% 1.70/1.75 thf(f116,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) | ($true = (X1 @ (sK4 @ X0 @ X1) @ (sK5 @ X0 @ X1))) | ($true = (X1 @ (sK2 @ X0 @ X1) @ (sK3 @ X0 @ X1)))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f97])).
% 1.70/1.75 thf(f581,plain,(
% 1.70/1.75 spl8_44 | spl8_45 | spl8_1),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f576,f158,f498,f493])).
% 1.70/1.75 thf(f576,plain,(
% 1.70/1.75 ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true) | ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar))) | spl8_1),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f554])).
% 1.70/1.75 thf(f554,plain,(
% 1.70/1.75 ((natStar @ (sK5 @ nat @ natStar) @ (sK6 @ nat @ natStar)) = $true) | ($true = (natStar @ (sK2 @ nat @ natStar) @ (sK3 @ nat @ natStar))) | ($true = $false) | spl8_1),
% 1.70/1.75 inference(superposition,[status(thm)],[f117,f486])).
% 1.70/1.75 thf(f117,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (($true = (X1 @ (sK5 @ X0 @ X1) @ (sK6 @ X0 @ X1))) | ((isPer @ X0 @ X1) = $true) | ($true = (X1 @ (sK2 @ X0 @ X1) @ (sK3 @ X0 @ X1)))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f97])).
% 1.70/1.75 thf(f209,plain,(
% 1.70/1.75 ~spl8_6),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f109,f180])).
% 1.70/1.75 thf(f180,definition,(
% 1.70/1.75 spl8_6 <=> ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ sK1) = $true)),
% 1.70/1.75 introduced(definition,[new_symbols(naming,[spl8_6])],[avatar_definition])).
% 1.70/1.75 thf(f109,plain,(
% 1.70/1.75 ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ sK1) != $true)),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f91])).
% 1.70/1.75 thf(f91,plain,(
% 1.70/1.75 ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ sK1) != $true) & ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ sK1 @ sK1))),
% 1.70/1.75 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f73,f90])).
% 1.70/1.75 thf(f90,plain,(
% 1.70/1.75 ? [X0 : nat,X1 : list @ list @ list @ nat] : (((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X0 @ (rev @ list @ list @ nat @ X0 @ (rev @ list @ list @ nat @ X0 @ X1)) @ X1) != $true) & ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X0 @ X1 @ X1))) => (((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ sK1) != $true) & ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ sK1 @ sK1)))),
% 1.70/1.75 introduced(definition,[],[choice_axiom])).
% 1.70/1.75 thf(f73,plain,(
% 1.70/1.75 ? [X0 : nat,X1 : list @ list @ list @ nat] : (((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X0 @ (rev @ list @ list @ nat @ X0 @ (rev @ list @ list @ nat @ X0 @ X1)) @ X1) != $true) & ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X0 @ X1 @ X1)))),
% 1.70/1.75 inference(ennf_transformation,[status(thm)],[f50])).
% 1.70/1.75 thf(f50,plain,(
% 1.70/1.75 ~! [X0 : nat,X1 : list @ list @ list @ nat] : (($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X0 @ X1 @ X1)) => ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X0 @ (rev @ list @ list @ nat @ X0 @ (rev @ list @ list @ nat @ X0 @ X1)) @ X1) = $true))),
% 1.70/1.75 inference(fool_elimination,[status(thm)],[f49])).
% 1.70/1.75 thf(f49,plain,(
% 1.70/1.75 ~! [X0 : nat,X1 : list @ list @ list @ nat] : ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X0 @ X1 @ X1) => (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X0 @ (rev @ list @ list @ nat @ X0 @ (rev @ list @ list @ nat @ X0 @ X1)) @ X1))),
% 1.70/1.75 inference(rectify,[status(thm)],[f25])).
% 1.70/1.75 thf(f25,negated_conjecture,(
% 1.70/1.75 ~! [X8 : nat,X15 : list @ list @ list @ nat] : ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X8 @ X15 @ X15) => (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X8 @ (rev @ list @ list @ nat @ X8 @ (rev @ list @ list @ nat @ X8 @ X15)) @ X15))),
% 1.70/1.75 inference(negated_conjecture,[status(cth)],[f24])).
% 1.70/1.75 thf(f24,conjecture,(
% 1.70/1.75 ! [X8 : nat,X15 : list @ list @ list @ nat] : ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X8 @ X15 @ X15) => (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ X8 @ (rev @ list @ list @ nat @ X8 @ (rev @ list @ list @ nat @ X8 @ X15)) @ X15))),
% 1.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',list_rev_invol)).
% 1.70/1.75 thf(f190,plain,(
% 1.70/1.75 spl8_4 | ~spl8_1 | ~spl8_2),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f189,f162,f158,f171])).
% 1.70/1.75 thf(f171,definition,(
% 1.70/1.75 spl8_4 <=> ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ (rev @ list @ list @ nat @ zero @ nil @ list @ list @ nat) @ sK1)))),
% 1.70/1.75 introduced(definition,[new_symbols(naming,[spl8_4])],[avatar_definition])).
% 1.70/1.75 thf(f162,definition,(
% 1.70/1.75 spl8_2 <=> ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ sK0 @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat))))),
% 1.70/1.75 introduced(definition,[new_symbols(naming,[spl8_2])],[avatar_definition])).
% 1.70/1.75 thf(f189,plain,(
% 1.70/1.75 ($true != (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ sK0 @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat)))) | ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ (rev @ list @ list @ nat @ zero @ nil @ list @ list @ nat) @ sK1))) | ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero))))),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f188,f107])).
% 1.70/1.75 thf(f107,plain,(
% 1.70/1.75 ( ! [X0 : nat] : (((plus @ zero @ X0) = X0)) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f67])).
% 1.70/1.75 thf(f67,plain,(
% 1.70/1.75 ! [X0 : nat] : ((plus @ zero @ X0) = X0)),
% 1.70/1.75 inference(rectify,[status(thm)],[f11])).
% 1.70/1.75 thf(f11,axiom,(
% 1.70/1.75 ! [X8 : nat] : ((plus @ zero @ X8) = X8)),
% 1.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',ax1)).
% 1.70/1.75 thf(f188,plain,(
% 1.70/1.75 ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)))) | ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ (rev @ list @ list @ nat @ zero @ nil @ list @ list @ nat) @ sK1))) | ($true != (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ (plus @ zero @ sK0) @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat))))),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f149,f106])).
% 1.70/1.75 thf(f106,plain,(
% 1.70/1.75 ( ! [X0 : nat,X1 : nat] : (((plus @ X0 @ X1) = (plus @ X1 @ X0))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f68])).
% 1.70/1.75 thf(f68,plain,(
% 1.70/1.75 ! [X0 : nat,X1 : nat] : ((plus @ X0 @ X1) = (plus @ X1 @ X0))),
% 1.70/1.75 inference(rectify,[status(thm)],[f17])).
% 1.70/1.75 thf(f17,axiom,(
% 1.70/1.75 ! [X8 : nat,X13 : nat] : ((plus @ X8 @ X13) = (plus @ X13 @ X8))),
% 1.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',plus_com)).
% 1.70/1.75 thf(f149,plain,(
% 1.70/1.75 ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ (rev @ list @ list @ nat @ zero @ nil @ list @ list @ nat) @ sK1))) | ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)))) | ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ (plus @ sK0 @ zero) @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat))) != $true)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f135])).
% 1.70/1.75 thf(f135,plain,(
% 1.70/1.75 ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)))) | ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ (plus @ sK0 @ zero) @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat))) != $true) | ($true != $true) | ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ (rev @ list @ list @ nat @ zero @ nil @ list @ list @ nat) @ sK1)))),
% 1.70/1.75 inference(superposition,[status(thm)],[f123,f108])).
% 1.70/1.75 thf(f108,plain,(
% 1.70/1.75 ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ sK1 @ sK1))),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f91])).
% 1.70/1.75 thf(f123,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (((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) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) | ((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)))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f78])).
% 1.70/1.75 thf(f78,plain,(
% 1.70/1.75 ! [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)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0))) != $true) | ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3)))))),
% 1.70/1.75 inference(flattening,[status(thm)],[f77])).
% 1.70/1.75 thf(f77,plain,(
% 1.70/1.75 ! [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))) | ((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)) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) | ((isPer @ X0 @ X1) != $true))),
% 1.70/1.75 inference(ennf_transformation,[status(thm)],[f62])).
% 1.70/1.75 thf(f62,plain,(
% 1.70/1.75 ! [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)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0))) = $true) => ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3))))))),
% 1.70/1.75 inference(fool_elimination,[status(thm)],[f61])).
% 1.70/1.75 thf(f61,plain,(
% 1.70/1.75 ! [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.70/1.75 inference(rectify,[status(thm)],[f21])).
% 1.70/1.75 thf(f21,axiom,(
% 1.70/1.75 ! [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.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',list_rev_invol_step2)).
% 1.70/1.75 thf(f183,plain,(
% 1.70/1.75 spl8_6 | ~spl8_1 | ~spl8_3),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f151,f167,f158,f180])).
% 1.70/1.75 thf(f167,definition,(
% 1.70/1.75 spl8_3 <=> ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ nil @ list @ list @ nat @ sK1)))),
% 1.70/1.75 introduced(definition,[new_symbols(naming,[spl8_3])],[avatar_definition])).
% 1.70/1.75 thf(f151,plain,(
% 1.70/1.75 ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)))) | ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ sK1) = $true) | ($true != (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ nil @ list @ list @ nat @ sK1)))),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f138])).
% 1.70/1.75 thf(f138,plain,(
% 1.70/1.75 ($true != (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ nil @ list @ list @ nat @ sK1))) | ($true != $true) | ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)))) | ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ sK1) = $true)),
% 1.70/1.75 inference(superposition,[status(thm)],[f121,f108])).
% 1.70/1.75 thf(f121,plain,(
% 1.70/1.75 ( ! [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) | ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ X3)) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f76])).
% 1.70/1.75 thf(f76,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [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 @ X3 @ X3)) | ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ X3))))),
% 1.70/1.75 inference(flattening,[status(thm)],[f75])).
% 1.70/1.75 thf(f75,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : nat,X3 : list @ X0] : ((($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ 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))) | ((isPer @ X0 @ X1) != $true))),
% 1.70/1.75 inference(ennf_transformation,[status(thm)],[f58])).
% 1.70/1.75 thf(f58,plain,(
% 1.70/1.75 ! [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)) @ (app @ X0 @ zero @ X2 @ nil @ X0 @ X3)) = $true) => ($true = (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ X3)))))),
% 1.70/1.75 inference(fool_elimination,[status(thm)],[f57])).
% 1.70/1.75 thf(f57,plain,(
% 1.70/1.75 ! [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 @ nil @ X0 @ X3)) => (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ X3))))),
% 1.70/1.75 inference(rectify,[status(thm)],[f23])).
% 1.70/1.75 thf(f23,axiom,(
% 1.70/1.75 ! [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 @ nil @ X0 @ X15)) => (listStar @ X0 @ X1 @ X8 @ (rev @ X0 @ X8 @ (rev @ X0 @ X8 @ X15)) @ X15))))),
% 1.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',list_rev_invol_step4)).
% 1.70/1.75 thf(f174,plain,(
% 1.70/1.75 ~spl8_1 | spl8_3 | ~spl8_4),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f153,f171,f167,f158])).
% 1.70/1.75 thf(f153,plain,(
% 1.70/1.75 ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ nil @ list @ list @ nat @ sK1))) | ($true != (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ (rev @ list @ list @ nat @ zero @ nil @ list @ list @ nat) @ sK1))) | ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero))))),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f136])).
% 1.70/1.75 thf(f136,plain,(
% 1.70/1.75 ($true != (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ (rev @ list @ list @ nat @ zero @ nil @ list @ list @ nat) @ sK1))) | ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (app @ list @ list @ nat @ zero @ sK0 @ nil @ list @ list @ nat @ sK1))) | ($true != $true) | ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero))))),
% 1.70/1.75 inference(superposition,[status(thm)],[f122,f108])).
% 1.70/1.75 thf(f122,plain,(
% 1.70/1.75 ( ! [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) | ((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.70/1.75 inference(cnf_transformation,[status(thm)],[f80])).
% 1.70/1.75 thf(f80,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [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 @ X3 @ X3)) | ($true != (listStar @ X0 @ X1 @ X2 @ (rev @ X0 @ X2 @ (rev @ X0 @ X2 @ X3)) @ (app @ X0 @ zero @ X2 @ (rev @ X0 @ zero @ nil @ X0) @ X3)))))),
% 1.70/1.75 inference(flattening,[status(thm)],[f79])).
% 1.70/1.75 thf(f79,plain,(
% 1.70/1.75 ! [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.70/1.75 inference(ennf_transformation,[status(thm)],[f42])).
% 1.70/1.75 thf(f42,plain,(
% 1.70/1.75 ! [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.70/1.75 inference(fool_elimination,[status(thm)],[f41])).
% 1.70/1.75 thf(f41,plain,(
% 1.70/1.75 ! [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.70/1.75 inference(rectify,[status(thm)],[f22])).
% 1.70/1.75 thf(f22,axiom,(
% 1.70/1.75 ! [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.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',list_rev_invol_step3)).
% 1.70/1.75 thf(f165,plain,(
% 1.70/1.75 ~spl8_1 | spl8_2),
% 1.70/1.75 inference(avatar_split_clause,[status(thm)],[f156,f162,f158])).
% 1.70/1.75 thf(f156,plain,(
% 1.70/1.75 ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ sK0 @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat)))) | ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero))))),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f155,f107])).
% 1.70/1.75 thf(f155,plain,(
% 1.70/1.75 ($true = (listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ (plus @ zero @ sK0) @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat)))) | ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero))))),
% 1.70/1.75 inference(forward_demodulation,[status(thm)],[f154,f106])).
% 1.70/1.75 thf(f154,plain,(
% 1.70/1.75 ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)))) | ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ (plus @ sK0 @ zero) @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat))) = $true)),
% 1.70/1.75 inference(trivial_inequality_removal,[status(thm)],[f137])).
% 1.70/1.75 thf(f137,plain,(
% 1.70/1.75 ($true != $true) | ((listStar @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero)) @ sK0 @ (rev @ list @ list @ nat @ sK0 @ (rev @ list @ list @ nat @ sK0 @ sK1)) @ (rev @ list @ list @ nat @ (plus @ sK0 @ zero) @ (app @ list @ list @ nat @ sK0 @ zero @ (rev @ list @ list @ nat @ sK0 @ sK1) @ nil @ list @ list @ nat))) = $true) | ($true != (isPer @ list @ list @ nat @ (listStar @ list @ nat @ (listStar @ nat @ natStar @ (suc @ zero)) @ (suc @ zero))))),
% 1.70/1.75 inference(superposition,[status(thm)],[f128,f108])).
% 1.70/1.75 thf(f128,plain,(
% 1.70/1.75 ( ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : X0 > X0 > $o] : (((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) | ((isPer @ X0 @ X1) != $true) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) )),
% 1.70/1.75 inference(cnf_transformation,[status(thm)],[f70])).
% 1.70/1.75 thf(f70,plain,(
% 1.70/1.75 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : nat,X3 : list @ X0] : (((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) | ($true != (listStar @ X0 @ X1 @ X2 @ X3 @ X3))) | ((isPer @ X0 @ X1) != $true))),
% 1.70/1.75 inference(ennf_transformation,[status(thm)],[f46])).
% 1.70/1.75 thf(f46,plain,(
% 1.70/1.75 ! [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)) @ (rev @ X0 @ (plus @ X2 @ zero) @ (app @ X0 @ X2 @ zero @ (rev @ X0 @ X2 @ X3) @ nil @ X0))) = $true)))),
% 1.70/1.75 inference(fool_elimination,[status(thm)],[f45])).
% 1.70/1.75 thf(f45,plain,(
% 1.70/1.75 ! [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.70/1.75 inference(rectify,[status(thm)],[f20])).
% 1.70/1.75 thf(f20,axiom,(
% 1.70/1.75 ! [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.70/1.75 file('/export/starexec/sandbox2/tmp/tmp.hZZEgoHWre/DTF2THF_20548.p',list_rev_invol_step1)).
% 1.70/1.75 % SZS output end Proof for DTF2THF_20548
% 1.70/1.75 % (20949)------------------------------
% 1.70/1.75 % (20949)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.75 % (20949)Termination reason: Refutation
% 1.70/1.75
% 1.70/1.75 % (20949)Memory used [KB]: 6268
% 1.70/1.75 % (20949)Time elapsed: 0.062 s
% 1.70/1.75 % (20949)Instructions burned: 192 (million)
% 1.70/1.75 % (20949)------------------------------
% 1.70/1.75 % (20949)------------------------------
% 1.70/1.75 % (20717)Success in time 0.456 s
%------------------------------------------------------------------------------