%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : DAT422^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 : n004.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:43 AM UTC 2026
% Result : Theorem 1.96s 1.40s
% Output : Refutation 1.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT422^1 : TPTP v9.2.1. Released v9.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n004.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 06:16:41 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.30/0.46 ---- Original DTF file ---
% 0.30/0.46 thf(spec,logic,$$dhol).
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 % File : DAT422^1 : TPTP v9.2.1. Released v9.2.0.
% 0.30/0.46 % Domain : Data Structures
% 0.30/0.46 % Problem : Reversal of a red-black-tree is an involution, RT substep 2
% 0.30/0.46 % Version : Especial.
% 0.30/0.46 % English :
% 0.30/0.46
% 0.30/0.46 % Refs : [RRB23] Rothgang et al. (2023), Theorem Proving in Dependently
% 0.30/0.46 % : [Rot25] Rothgang (2025), Email to Geoff Sutcliffe
% 0.30/0.46 % : [RK+25] Ranalter et al. (2025), The Dependently Typed Higher-O
% 0.30/0.46 % Source : [Rot25]
% 0.30/0.46 % Names : RedBlackTree/rbt-rev-invol-subBTStep2.p [Rot25]
% 0.30/0.46
% 0.30/0.46 % Status : Theorem
% 0.30/0.46 % Rating : ? v9.2.0
% 0.30/0.46 % Syntax : Number of formulae : 15 ( 3 unt; 11 typ; 0 def)
% 0.30/0.46 % Number of atoms : 6 ( 6 equ; 0 cnn)
% 0.30/0.46 % Maximal formula atoms : 3 ( 1 avg)
% 0.30/0.46 % Number of connectives : 162 ( 0 ~; 0 |; 0 &; 160 @)
% 0.30/0.46 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.30/0.46 % Maximal formula depth : 10 ( 7 avg)
% 0.30/0.46 % Number of types : 2 ( 2 usr)
% 0.30/0.46 % Number of type decls : 11 ( 4 !>P; 3 !>D)
% 0.30/0.46 % Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% 0.30/0.46 % Number of symbols : 10 ( 9 usr; 3 con; 0-7 aty)
% 0.30/0.46 % Number of variables : 30 ( 0 ^; 20 !; 0 ?; 30 :)
% 0.30/0.46 % ( 10 !>; 0 ?*; 0 @-; 0 @+)
% 0.30/0.46 % SPC : DH1_THM_EQU_NAR
% 0.30/0.46
% 0.30/0.46 % Comments :
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 thf(color_type,type,
% 0.30/0.46 color: $tType ).
% 0.30/0.46
% 0.30/0.46 thf(black_type,type,
% 0.30/0.46 black: color ).
% 0.30/0.46
% 0.30/0.46 thf(red_type,type,
% 0.30/0.46 red: color ).
% 0.30/0.46
% 0.30/0.46 thf(nat_type,type,
% 0.30/0.46 nat: $tType ).
% 0.30/0.46
% 0.30/0.46 thf(zero_type,type,
% 0.30/0.46 zero: nat ).
% 0.30/0.46
% 0.30/0.46 thf(suc_type,type,
% 0.30/0.46 suc: nat > nat ).
% 0.30/0.46
% 0.30/0.46 thf(tree_type,type,
% 0.30/0.46 tree: $tType > color > nat > $tType ).
% 0.30/0.46
% 0.30/0.46 thf(leaf_type,type,
% 0.30/0.46 leaf:
% 0.30/0.46 !>[A: $tType] : ( tree @ A @ black @ zero ) ).
% 0.30/0.46
% 0.30/0.46 thf(redTree_type,type,
% 0.30/0.46 rt:
% 0.30/0.46 !>[A: $tType,N: nat] : ( ( tree @ A @ black @ N ) > A > ( tree @ A @ black @ N ) > ( tree @ A @ red @ N ) ) ).
% 0.30/0.46
% 0.30/0.46 thf(blackTree_type,type,
% 0.30/0.46 bt:
% 0.30/0.46 !>[A: $tType,N: nat,C1: color,C2: color] : ( ( tree @ A @ C1 @ N ) > A > ( tree @ A @ C2 @ N ) > ( tree @ A @ black @ ( suc @ N ) ) ) ).
% 0.30/0.46
% 0.30/0.46 thf(rbt_rev,type,
% 0.30/0.46 rev:
% 0.30/0.46 !>[A: $tType,C: color,N: nat] : ( ( tree @ A @ C @ N ) > ( tree @ A @ C @ N ) ) ).
% 0.30/0.46
% 0.30/0.46 thf(rev_leaf,axiom,
% 0.30/0.46 ! [A: $tType] :
% 0.30/0.46 ( ( rev @ A @ black @ zero @ ( leaf @ A ) )
% 0.30/0.46 = ( leaf @ A ) ) ).
% 0.30/0.46
% 0.30/0.46 thf(rev_bt,axiom,
% 0.30/0.46 ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
% 0.30/0.46 ( ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) )
% 0.30/0.46 = ( bt @ A @ N @ C2 @ C1 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) ).
% 0.30/0.46
% 0.30/0.46 thf(rev_rt,axiom,
% 0.30/0.46 ! [A: $tType,X: A,N: nat,T1: tree @ A @ black @ N,T2: tree @ A @ black @ N] :
% 0.30/0.46 ( ( rev @ A @ red @ N @ ( rt @ A @ N @ T1 @ X @ T2 ) )
% 0.30/0.46 = ( rt @ A @ N @ ( rev @ A @ black @ N @ T2 ) @ X @ ( rev @ A @ black @ N @ T2 ) ) ) ).
% 0.30/0.46
% 0.30/0.46 %thf(first_step,axiom,
% 0.30/0.46 % ! [A:$tType,X:A,N:nat,C1:color,C2:color,T1:tree @ A @ C1 @ N,T2:tree @ A @ C2 @ N] :
% 0.30/0.46 % ( ( ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) )
% 0.30/0.46 % = T1 )
% 0.30/0.46 % => ( ( ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) )
% 0.30/0.46 % = T2 )
% 0.30/0.46 % => ( ( ( rev @ A @ black @ (suc @ N) @ ( rev @ A @ black @ (suc @ N) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) )
% 0.30/0.46 % = ( rev @ A @ black @ (suc @ N) @ (bt @ A @ N @ C2 @ C1 @ (rev @ A @ C2 @ N @ T2) @ X @ (rev @ A @ C1 @ N @ T1) ) ) ) ) ) ) ).
% 0.30/0.46
% 0.30/0.46 thf(second_step,conjecture,
% 0.30/0.46 ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
% 0.30/0.46 ( ( ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) )
% 0.30/0.46 = T1 )
% 0.30/0.46 => ( ( ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) )
% 0.30/0.46 = T2 )
% 0.30/0.46 => ( ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C2 @ C1 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) )
% 0.30/0.46 = ( bt @ A @ N @ C1 @ C2 @ ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) ) @ X @ ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) ) ) ) ) ) ).
% 0.30/0.46
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 ------------------------
% 1.80/1.36 ---- Embedded in THF ---
% 1.80/1.36 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.80/1.36 %%% Generated on Tue Feb 24 06:16:42 EST 2026
% 1.80/1.36 %%% using '$$dhol' embedding, version 1.3.0.
% 1.80/1.36 %%% Logic specification used:
% 1.80/1.36 %%% thf(spec, logic, $$dhol).
% 1.80/1.36
% 1.80/1.36 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.FzTv1zdSVA/DTF2DTF26404.p
% 1.80/1.36 thf(is_per_type, type, isPer: (!> [A:$tType]: (((A > (A > $o)) > $o)))).
% 1.80/1.36 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.80/1.36 thf(color_type, type, color: $tType).
% 1.80/1.36 thf(colorStar, type, 'colorStar': (color > (color > $o))).
% 1.80/1.36 thf(colorStar_is_eq, axiom, (! [X:color,Y:color]: (((('colorStar' @ X) @ Y) <=> (X = Y))))).
% 1.80/1.36 thf(black_type, type, black: color).
% 1.80/1.36 thf(red_type, type, red: color).
% 1.80/1.36 thf(nat_type, type, nat: $tType).
% 1.80/1.36 thf(natStar, type, 'natStar': (nat > (nat > $o))).
% 1.80/1.36 thf(natStar_is_eq, axiom, (! [X:nat,Y:nat]: (((('natStar' @ X) @ Y) <=> (X = Y))))).
% 1.80/1.36 thf(zero_type, type, zero: nat).
% 1.80/1.36 thf(suc_type, type, suc: (nat > nat)).
% 1.80/1.36 thf(tree_type, type, tree: ($tType > $tType)).
% 1.80/1.36 thf(treeStar, type, 'treeStar': (!> [A:$tType]: (((A > (A > $o)) > (color > (nat > ((tree @ A) > ((tree @ A) > $o)))))))).
% 1.80/1.36 thf('\'treeStar\'_is_per', axiom, (! [B:$tType,BStar:(B > (B > $o))]: ((((isPer @ B) @ BStar) => (! [C:color]: ((! [C0:nat]: (((isPer @ (tree @ B)) @ ((((treeStar @ B) @ BStar) @ C) @ C0)))))))))).
% 1.80/1.36 thf(leaf_type, type, leaf: (!> [A:$tType]: ((tree @ A)))).
% 1.80/1.36 thf(leaf_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => ((((((treeStar @ A) @ AStar) @ black) @ zero) @ (leaf @ A)) @ (leaf @ A)))))).
% 1.80/1.36 thf(redTree_type, type, rt: (!> [A:$tType]: ((nat > ((tree @ A) > (A > ((tree @ A) > (tree @ A)))))))).
% 1.80/1.36 thf(rt_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [D:(tree @ A),D_prime:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ black) @ N) @ D) @ D_prime) => (! [D0:A,D0_prime:A]: (((D0 = D0_prime) => (! [D1:(tree @ A),D1_prime:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ black) @ N) @ D1) @ D1_prime) => ((((((treeStar @ A) @ AStar) @ red) @ N) @ (((((rt @ A) @ N) @ D) @ D0) @ D1)) @ (((((rt @ A) @ N) @ D_prime) @ D0_prime) @ D1_prime))))))))))))))))).
% 1.80/1.36 thf(blackTree_type, type, bt: (!> [A:$tType]: ((nat > (color > (color > ((tree @ A) > (A > ((tree @ A) > (tree @ A)))))))))).
% 1.80/1.36 thf(bt_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [C1:color]: ((! [C2:color]: ((! [D:(tree @ A),D_prime:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ C1) @ N) @ D) @ D_prime) => (! [D0:A,D0_prime:A]: (((D0 = D0_prime) => (! [D1:(tree @ A),D1_prime:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ C2) @ N) @ D1) @ D1_prime) => ((((((treeStar @ A) @ AStar) @ black) @ (suc @ N)) @ (((((((bt @ A) @ N) @ C1) @ C2) @ D) @ D0) @ D1)) @ (((((((bt @ A) @ N) @ C1) @ C2) @ D_prime) @ D0_prime) @ D1_prime))))))))))))))))))))).
% 1.80/1.36 thf(rbt_rev, type, rev: (!> [A:$tType]: ((color > (nat > ((tree @ A) > (tree @ A))))))).
% 1.80/1.36 thf(rev_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [C:color]: ((! [N:nat]: ((! [D:(tree @ A),D_prime:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ C) @ N) @ D) @ D_prime) => ((((((treeStar @ A) @ AStar) @ C) @ N) @ ((((rev @ A) @ C) @ N) @ D)) @ ((((rev @ A) @ C) @ N) @ D_prime))))))))))))).
% 1.80/1.36 thf(rev_leaf, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => ((((((treeStar @ A) @ AStar) @ black) @ zero) @ ((((rev @ A) @ black) @ zero) @ (leaf @ A))) @ (leaf @ A)))))).
% 1.80/1.36 thf(rev_bt, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [X:A]: ((! [N:nat]: ((! [C1:color]: ((! [C2:color]: ((! [T1:(tree @ A),T2:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ C1) @ N) @ T1) @ T1) => (((((((treeStar @ A) @ AStar) @ C2) @ N) @ T2) @ T2) => ((((((treeStar @ A) @ AStar) @ black) @ (suc @ N)) @ ((((rev @ A) @ black) @ (suc @ N)) @ (((((((bt @ A) @ N) @ C1) @ C2) @ T1) @ X) @ T2))) @ (((((((bt @ A) @ N) @ C2) @ C1) @ ((((rev @ A) @ C2) @ N) @ T2)) @ X) @ ((((rev @ A) @ C1) @ N) @ T1))))))))))))))))))).
% 1.80/1.36 thf(rev_rt, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [X:A]: ((! [N:nat]: ((! [T1:(tree @ A),T2:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ black) @ N) @ T1) @ T1) => (((((((treeStar @ A) @ AStar) @ black) @ N) @ T2) @ T2) => ((((((treeStar @ A) @ AStar) @ red) @ N) @ ((((rev @ A) @ red) @ N) @ (((((rt @ A) @ N) @ T1) @ X) @ T2))) @ (((((rt @ A) @ N) @ ((((rev @ A) @ black) @ N) @ T2)) @ X) @ ((((rev @ A) @ black) @ N) @ T2))))))))))))))).
% 1.80/1.36 thf(second_step, conjecture, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [X:A]: ((! [N:nat]: ((! [C1:color]: ((! [C2:color]: ((! [T1:(tree @ A),T2:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ C1) @ N) @ T1) @ T1) => (((((((treeStar @ A) @ AStar) @ C2) @ N) @ T2) @ T2) => (((((((treeStar @ A) @ AStar) @ C1) @ N) @ ((((rev @ A) @ C1) @ N) @ ((((rev @ A) @ C1) @ N) @ T1))) @ T1) => (((((((treeStar @ A) @ AStar) @ C2) @ N) @ ((((rev @ A) @ C2) @ N) @ ((((rev @ A) @ C2) @ N) @ T2))) @ T2) => ((((((treeStar @ A) @ AStar) @ black) @ (suc @ N)) @ ((((rev @ A) @ black) @ (suc @ N)) @ (((((((bt @ A) @ N) @ C2) @ C1) @ ((((rev @ A) @ C2) @ N) @ T2)) @ X) @ ((((rev @ A) @ C1) @ N) @ T1)))) @ (((((((bt @ A) @ N) @ C1) @ C2) @ ((((rev @ A) @ C1) @ N) @ ((((rev @ A) @ C1) @ N) @ T1))) @ X) @ ((((rev @ A) @ C2) @ N) @ ((((rev @ A) @ C2) @ N) @ T2)))))))))))))))))))))).
% 1.80/1.36 % SZS output end ListOfTHF for /export/starexec/sandbox2/tmp/tmp.FzTv1zdSVA/DTF2DTF26404.p
% 1.80/1.36 ------------------------
% 1.80/1.37 ---- Cleaned THF ---
% 1.80/1.37 thf(is_per_type,type,
% 1.80/1.37 isPer:
% 1.80/1.37 !>[A: $tType] : ( ( A > A > $o ) > $o ) ).
% 1.80/1.37
% 1.80/1.37 thf(is_per,definition,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 <=> ( ! [X: A,Y: A] :
% 1.80/1.37 ( ( AStar @ X @ Y )
% 1.80/1.37 => ( AStar @ Y @ X ) )
% 1.80/1.37 & ! [X: A,Y: A,Z: A] :
% 1.80/1.37 ( ( AStar @ X @ Y )
% 1.80/1.37 => ( ( AStar @ Y @ Z )
% 1.80/1.37 => ( AStar @ X @ Z ) ) ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(color_type,type,
% 1.80/1.37 color: $tType ).
% 1.80/1.37
% 1.80/1.37 thf(colorStar,type,
% 1.80/1.37 colorStar: color > color > $o ).
% 1.80/1.37
% 1.80/1.37 thf(colorStar_is_eq,axiom,
% 1.80/1.37 ! [X: color,Y: color] :
% 1.80/1.37 ( ( colorStar @ X @ Y )
% 1.80/1.37 <=> ( X = Y ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(black_type,type,
% 1.80/1.37 black: color ).
% 1.80/1.37
% 1.80/1.37 thf(red_type,type,
% 1.80/1.37 red: color ).
% 1.80/1.37
% 1.80/1.37 thf(nat_type,type,
% 1.80/1.37 nat: $tType ).
% 1.80/1.37
% 1.80/1.37 thf(natStar,type,
% 1.80/1.37 natStar: nat > nat > $o ).
% 1.80/1.37
% 1.80/1.37 thf(natStar_is_eq,axiom,
% 1.80/1.37 ! [X: nat,Y: nat] :
% 1.80/1.37 ( ( natStar @ X @ Y )
% 1.80/1.37 <=> ( X = Y ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(zero_type,type,
% 1.80/1.37 zero: nat ).
% 1.80/1.37
% 1.80/1.37 thf(suc_type,type,
% 1.80/1.37 suc: nat > nat ).
% 1.80/1.37
% 1.80/1.37 thf(tree_type,type,
% 1.80/1.37 tree: $tType > $tType ).
% 1.80/1.37
% 1.80/1.37 thf(treeStar,type,
% 1.80/1.37 treeStar:
% 1.80/1.37 !>[A: $tType] : ( ( A > A > $o ) > color > nat > ( tree @ A ) > ( tree @ A ) > $o ) ).
% 1.80/1.37
% 1.80/1.37 thf('\'treeStar\'_is_per',axiom,
% 1.80/1.37 ! [B: $tType,BStar: B > B > $o] :
% 1.80/1.37 ( ( isPer @ B @ BStar )
% 1.80/1.37 => ! [C: color,C0: nat] : ( isPer @ ( tree @ B ) @ ( treeStar @ B @ BStar @ C @ C0 ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(leaf_type,type,
% 1.80/1.37 leaf:
% 1.80/1.37 !>[A: $tType] : ( tree @ A ) ).
% 1.80/1.37
% 1.80/1.37 thf(leaf_tp_ax,axiom,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 => ( treeStar @ A @ AStar @ black @ zero @ ( leaf @ A ) @ ( leaf @ A ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(redTree_type,type,
% 1.80/1.37 rt:
% 1.80/1.37 !>[A: $tType] : ( nat > ( tree @ A ) > A > ( tree @ A ) > ( tree @ A ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(rt_tp_ax,axiom,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 => ! [N: nat,D: tree @ A,D_prime: tree @ A] :
% 1.80/1.37 ( ( treeStar @ A @ AStar @ black @ N @ D @ D_prime )
% 1.80/1.37 => ! [D0: A,D0_prime: A] :
% 1.80/1.37 ( ( D0 = D0_prime )
% 1.80/1.37 => ! [D1: tree @ A,D1_prime: tree @ A] :
% 1.80/1.37 ( ( treeStar @ A @ AStar @ black @ N @ D1 @ D1_prime )
% 1.80/1.37 => ( treeStar @ A @ AStar @ red @ N @ ( rt @ A @ N @ D @ D0 @ D1 ) @ ( rt @ A @ N @ D_prime @ D0_prime @ D1_prime ) ) ) ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(blackTree_type,type,
% 1.80/1.37 bt:
% 1.80/1.37 !>[A: $tType] : ( nat > color > color > ( tree @ A ) > A > ( tree @ A ) > ( tree @ A ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(bt_tp_ax,axiom,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 => ! [N: nat,C1: color,C2: color,D: tree @ A,D_prime: tree @ A] :
% 1.80/1.37 ( ( treeStar @ A @ AStar @ C1 @ N @ D @ D_prime )
% 1.80/1.37 => ! [D0: A,D0_prime: A] :
% 1.80/1.37 ( ( D0 = D0_prime )
% 1.80/1.37 => ! [D1: tree @ A,D1_prime: tree @ A] :
% 1.80/1.37 ( ( treeStar @ A @ AStar @ C2 @ N @ D1 @ D1_prime )
% 1.80/1.37 => ( treeStar @ A @ AStar @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ D @ D0 @ D1 ) @ ( bt @ A @ N @ C1 @ C2 @ D_prime @ D0_prime @ D1_prime ) ) ) ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(rbt_rev,type,
% 1.80/1.37 rev:
% 1.80/1.37 !>[A: $tType] : ( color > nat > ( tree @ A ) > ( tree @ A ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(rev_tp_ax,axiom,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 => ! [C: color,N: nat,D: tree @ A,D_prime: tree @ A] :
% 1.80/1.37 ( ( treeStar @ A @ AStar @ C @ N @ D @ D_prime )
% 1.80/1.37 => ( treeStar @ A @ AStar @ C @ N @ ( rev @ A @ C @ N @ D ) @ ( rev @ A @ C @ N @ D_prime ) ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(rev_leaf,axiom,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 => ( treeStar @ A @ AStar @ black @ zero @ ( rev @ A @ black @ zero @ ( leaf @ A ) ) @ ( leaf @ A ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(rev_bt,axiom,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 => ! [X: A,N: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 1.80/1.37 ( ( treeStar @ A @ AStar @ C1 @ N @ T1 @ T1 )
% 1.80/1.37 => ( ( treeStar @ A @ AStar @ C2 @ N @ T2 @ T2 )
% 1.80/1.37 => ( treeStar @ A @ AStar @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) @ ( bt @ A @ N @ C2 @ C1 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(rev_rt,axiom,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 => ! [X: A,N: nat,T1: tree @ A,T2: tree @ A] :
% 1.80/1.37 ( ( treeStar @ A @ AStar @ black @ N @ T1 @ T1 )
% 1.80/1.37 => ( ( treeStar @ A @ AStar @ black @ N @ T2 @ T2 )
% 1.80/1.37 => ( treeStar @ A @ AStar @ red @ N @ ( rev @ A @ red @ N @ ( rt @ A @ N @ T1 @ X @ T2 ) ) @ ( rt @ A @ N @ ( rev @ A @ black @ N @ T2 ) @ X @ ( rev @ A @ black @ N @ T2 ) ) ) ) ) ) ).
% 1.80/1.37
% 1.80/1.37 thf(second_step,conjecture,
% 1.80/1.37 ! [A: $tType,AStar: A > A > $o] :
% 1.80/1.37 ( ( isPer @ A @ AStar )
% 1.80/1.37 => ! [X: A,N: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 1.80/1.37 ( ( treeStar @ A @ AStar @ C1 @ N @ T1 @ T1 )
% 1.80/1.37 => ( ( treeStar @ A @ AStar @ C2 @ N @ T2 @ T2 )
% 1.80/1.37 => ( ( treeStar @ A @ AStar @ C1 @ N @ ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) ) @ T1 )
% 1.80/1.37 => ( ( treeStar @ A @ AStar @ C2 @ N @ ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) ) @ T2 )
% 1.80/1.37 => ( treeStar @ A @ AStar @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C2 @ C1 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) @ ( bt @ A @ N @ C1 @ C2 @ ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) ) @ X @ ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) ) ) ) ) ) ) ) ) ).
% 1.80/1.37 ------------------------
% 1.80/1.39 % (26549)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_26404 for (2999ds/4Mi)
% 1.80/1.39 % (26550)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_26404 for (2999ds/27Mi)
% 1.80/1.39 % (26553)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_26404 for (2999ds/275Mi)
% 1.80/1.39 % (26548)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_26404 for (2999ds/183Mi)
% 1.80/1.39 % (26549)Instruction limit reached!
% 1.80/1.39 % (26549)------------------------------
% 1.80/1.39 % (26549)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.80/1.39 % (26549)Termination reason: Unknown
% 1.80/1.39 % (26549)Termination phase: shuffling
% 1.80/1.39
% 1.80/1.39 % (26549)Memory used [KB]: 1023
% 1.80/1.39 % (26549)Time elapsed: 0.003 s
% 1.80/1.39 % (26549)Instructions burned: 5 (million)
% 1.80/1.39 % (26549)------------------------------
% 1.80/1.39 % (26549)------------------------------
% 1.80/1.39 % (26551)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_26404 for (2999ds/2Mi)
% 1.80/1.40 % (26551)Instruction limit reached!
% 1.80/1.40 % (26551)------------------------------
% 1.80/1.40 % (26551)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.80/1.40 % (26551)Termination reason: Unknown
% 1.80/1.40 % (26551)Termination phase: shuffling
% 1.80/1.40
% 1.80/1.40 % (26551)Memory used [KB]: 1023
% 1.80/1.40 % (26551)Time elapsed: 0.004 s
% 1.80/1.40 % (26551)Instructions burned: 3 (million)
% 1.80/1.40 % (26551)------------------------------
% 1.80/1.40 % (26551)------------------------------
% 1.96/1.40 % (26552)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_26404 for (2999ds/2Mi)
% 1.96/1.40 % (26554)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_26404 for (2999ds/18Mi)
% 1.96/1.40 % (26550)Instruction limit reached!
% 1.96/1.40 % (26550)------------------------------
% 1.96/1.40 % (26550)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.96/1.40 % (26550)Termination reason: Unknown
% 1.96/1.40 % (26550)Termination phase: Saturation
% 1.96/1.40
% 1.96/1.40 % (26550)Memory used [KB]: 5756
% 1.96/1.40 % (26550)Time elapsed: 0.011 s
% 1.96/1.40 % (26550)Instructions burned: 28 (million)
% 1.96/1.40 % (26550)------------------------------
% 1.96/1.40 % (26550)------------------------------
% 1.96/1.40 % (26555)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_26404 for (2999ds/3Mi)
% 1.96/1.40 % (26552)Instruction limit reached!
% 1.96/1.40 % (26552)------------------------------
% 1.96/1.40 % (26552)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.96/1.40 % (26552)Termination reason: Unknown
% 1.96/1.40 % (26552)Termination phase: shuffling
% 1.96/1.40
% 1.96/1.40 % (26552)Memory used [KB]: 1023
% 1.96/1.40 % (26552)Time elapsed: 0.004 s
% 1.96/1.40 % (26552)Instructions burned: 3 (million)
% 1.96/1.40 % (26552)------------------------------
% 1.96/1.40 % (26552)------------------------------
% 1.96/1.40 % (26555)Instruction limit reached!
% 1.96/1.40 % (26555)------------------------------
% 1.96/1.40 % (26555)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.96/1.40 % (26555)Termination reason: Unknown
% 1.96/1.40 % (26555)Termination phase: shuffling
% 1.96/1.40
% 1.96/1.40 % (26555)Memory used [KB]: 1023
% 1.96/1.40 % (26555)Time elapsed: 0.002 s
% 1.96/1.40 % (26555)Instructions burned: 4 (million)
% 1.96/1.40 % (26555)------------------------------
% 1.96/1.40 % (26555)------------------------------
% 1.96/1.40 % (26553)First to succeed.
% 1.96/1.40 % (26553)Refutation found. Thanks to Tanya!
% 1.96/1.40 % SZS status Theorem for DTF2THF_26404
% 1.96/1.40 % SZS output start Proof for DTF2THF_26404
% 1.96/1.40 thf(type_def_6, type, color: $tType).
% 1.96/1.40 thf(type_def_7, type, nat: $tType).
% 1.96/1.40 thf(type_def_8, type, tree: ($tType) > $tType).
% 1.96/1.40 thf(type_def_9, type, sK0: $tType).
% 1.96/1.40 thf(func_def_0, type, isPer: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.96/1.40 thf(func_def_2, type, color: $tType).
% 1.96/1.40 thf(func_def_3, type, colorStar: color > color > $o).
% 1.96/1.40 thf(func_def_4, type, black: color).
% 1.96/1.40 thf(func_def_5, type, red: color).
% 1.96/1.40 thf(func_def_6, type, nat: $tType).
% 1.96/1.40 thf(func_def_7, type, natStar: nat > nat > $o).
% 1.96/1.40 thf(func_def_8, type, zero: nat).
% 1.96/1.40 thf(func_def_9, type, suc: nat > nat).
% 1.96/1.40 thf(func_def_10, type, tree: ($tType) > $tType).
% 1.96/1.40 thf(func_def_11, type, treeStar: !>[X0: $tType]:((X0 > X0 > $o) > color > nat > tree @ X0 > tree @ X0 > $o)).
% 1.96/1.40 thf(func_def_12, type, leaf: !>[X0: $tType]:(tree @ X0)).
% 1.96/1.40 thf(func_def_13, type, rt: !>[X0: $tType]:(nat > tree @ X0 > X0 > tree @ X0 > tree @ X0)).
% 1.96/1.40 thf(func_def_14, type, bt: !>[X0: $tType]:(nat > color > color > tree @ X0 > X0 > tree @ X0 > tree @ X0)).
% 1.96/1.40 thf(func_def_15, type, rev: !>[X0: $tType]:(color > nat > tree @ X0 > tree @ X0)).
% 1.96/1.40 thf(func_def_18, type, sK1: sK0 > sK0 > $o).
% 1.96/1.40 thf(func_def_19, type, sK2: sK0).
% 1.96/1.40 thf(func_def_20, type, sK3: nat).
% 1.96/1.40 thf(func_def_21, type, sK4: color).
% 1.96/1.40 thf(func_def_22, type, sK5: color).
% 1.96/1.40 thf(func_def_23, type, sK6: tree @ sK0).
% 1.96/1.40 thf(func_def_24, type, sK7: tree @ sK0).
% 1.96/1.40 thf(func_def_25, type, sK8: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.96/1.40 thf(func_def_26, type, sK9: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.96/1.40 thf(func_def_27, type, sK10: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.96/1.40 thf(func_def_28, type, sK11: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.96/1.40 thf(func_def_29, type, sK12: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.96/1.40 thf(func_def_31, type, ph14: !>[X0: $tType]:(X0)).
% 1.96/1.40 thf(f145,plain,(
% 1.96/1.40 $false),
% 1.96/1.40 inference(avatar_sat_refutation,[status(thm)],[f99,f117,f135])).
% 1.96/1.40 thf(f135,plain,(
% 1.96/1.40 spl13_4),
% 1.96/1.40 inference(avatar_contradiction_clause,[status(thm)],[f134])).
% 1.96/1.40 thf(f134,plain,(
% 1.96/1.40 $false | spl13_4),
% 1.96/1.40 inference(subsumption_resolution,[status(thm)],[f133,f60])).
% 1.96/1.40 thf(f60,plain,(
% 1.96/1.40 ((treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ sK6 @ sK6) = $true)),
% 1.96/1.40 inference(cnf_transformation,[status(thm)],[f50])).
% 1.96/1.40 thf(f50,plain,(
% 1.96/1.40 (((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ sK7 @ sK7) = $true) & ($true = (treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6)) @ sK6)) & ((treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ sK6 @ sK6) = $true) & ($true = (treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7)) @ sK7)) & ((treeStar @ sK0 @ sK1 @ black @ (suc @ sK3) @ (rev @ sK0 @ black @ (suc @ sK3) @ (bt @ sK0 @ sK3 @ sK5 @ sK4 @ (rev @ sK0 @ sK5 @ sK3 @ sK7) @ sK2 @ (rev @ sK0 @ sK4 @ sK3 @ sK6))) @ (bt @ sK0 @ sK3 @ sK4 @ sK5 @ (rev @ sK0 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6)) @ sK2 @ (rev @ sK0 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7)))) != $true)) & ((isPer @ sK0 @ sK1) = $true)),
% 1.96/1.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f44,f49,f48])).
% 1.96/1.40 thf(f48,plain,(
% 1.96/1.40 ? [X0 : $tType,X1 : X0 > X0 > $o] : (? [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)) & ($true = (treeStar @ X0 @ X1 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6)) & ((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) = $true) & ($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7)) & ($true != (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)))))) & ((isPer @ X0 @ X1) = $true)) => (? [X7 : tree @ sK0,X6 : tree @ sK0,X5 : color,X4 : color,X3 : nat,X2 : sK0] : (($true = (treeStar @ sK0 @ sK1 @ X5 @ X3 @ X7 @ X7)) & ($true = (treeStar @ sK0 @ sK1 @ X4 @ X3 @ (rev @ sK0 @ X4 @ X3 @ (rev @ sK0 @ X4 @ X3 @ X6)) @ X6)) & ($true = (treeStar @ sK0 @ sK1 @ X4 @ X3 @ X6 @ X6)) & ((treeStar @ sK0 @ sK1 @ X5 @ X3 @ (rev @ sK0 @ X5 @ X3 @ (rev @ sK0 @ X5 @ X3 @ X7)) @ X7) = $true) & ((treeStar @ sK0 @ sK1 @ black @ (suc @ X3) @ (rev @ sK0 @ black @ (suc @ X3) @ (bt @ sK0 @ X3 @ X5 @ X4 @ (rev @ sK0 @ X5 @ X3 @ X7) @ X2 @ (rev @ sK0 @ X4 @ X3 @ X6))) @ (bt @ sK0 @ X3 @ X4 @ X5 @ (rev @ sK0 @ X4 @ X3 @ (rev @ sK0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ sK0 @ X5 @ X3 @ (rev @ sK0 @ X5 @ X3 @ X7)))) != $true)) & ((isPer @ sK0 @ sK1) = $true))),
% 1.96/1.40 introduced(definition,[],[choice_axiom])).
% 1.96/1.40 thf(f49,plain,(
% 1.96/1.40 ? [X7 : tree @ sK0,X6 : tree @ sK0,X5 : color,X4 : color,X3 : nat,X2 : sK0] : (($true = (treeStar @ sK0 @ sK1 @ X5 @ X3 @ X7 @ X7)) & ($true = (treeStar @ sK0 @ sK1 @ X4 @ X3 @ (rev @ sK0 @ X4 @ X3 @ (rev @ sK0 @ X4 @ X3 @ X6)) @ X6)) & ($true = (treeStar @ sK0 @ sK1 @ X4 @ X3 @ X6 @ X6)) & ((treeStar @ sK0 @ sK1 @ X5 @ X3 @ (rev @ sK0 @ X5 @ X3 @ (rev @ sK0 @ X5 @ X3 @ X7)) @ X7) = $true) & ((treeStar @ sK0 @ sK1 @ black @ (suc @ X3) @ (rev @ sK0 @ black @ (suc @ X3) @ (bt @ sK0 @ X3 @ X5 @ X4 @ (rev @ sK0 @ X5 @ X3 @ X7) @ X2 @ (rev @ sK0 @ X4 @ X3 @ X6))) @ (bt @ sK0 @ X3 @ X4 @ X5 @ (rev @ sK0 @ X4 @ X3 @ (rev @ sK0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ sK0 @ X5 @ X3 @ (rev @ sK0 @ X5 @ X3 @ X7)))) != $true)) => (((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ sK7 @ sK7) = $true) & ($true = (treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6)) @ sK6)) & ((treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ sK6 @ sK6) = $true) & ($true = (treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7)) @ sK7)) & ((treeStar @ sK0 @ sK1 @ black @ (suc @ sK3) @ (rev @ sK0 @ black @ (suc @ sK3) @ (bt @ sK0 @ sK3 @ sK5 @ sK4 @ (rev @ sK0 @ sK5 @ sK3 @ sK7) @ sK2 @ (rev @ sK0 @ sK4 @ sK3 @ sK6))) @ (bt @ sK0 @ sK3 @ sK4 @ sK5 @ (rev @ sK0 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6)) @ sK2 @ (rev @ sK0 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7)))) != $true))),
% 1.96/1.40 introduced(definition,[],[choice_axiom])).
% 1.96/1.40 thf(f44,plain,(
% 1.96/1.40 ? [X0 : $tType,X1 : X0 > X0 > $o] : (? [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)) & ($true = (treeStar @ X0 @ X1 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6)) & ((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) = $true) & ($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7)) & ($true != (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)))))) & ((isPer @ X0 @ X1) = $true))),
% 1.96/1.40 inference(flattening,[status(thm)],[f43])).
% 1.96/1.40 thf(f43,plain,(
% 1.96/1.40 ? [X0 : $tType,X1 : X0 > X0 > $o] : (? [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : ((((($true != (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7))))) & ($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7))) & ($true = (treeStar @ X0 @ X1 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6))) & ($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7))) & ((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) = $true)) & ((isPer @ X0 @ X1) = $true))),
% 1.96/1.40 inference(ennf_transformation,[status(thm)],[f16])).
% 1.96/1.40 thf(f16,plain,(
% 1.96/1.40 ~! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : (((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) = $true) => (($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)) => (($true = (treeStar @ X0 @ X1 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6)) => (($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7)) => ($true = (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7))))))))))),
% 1.96/1.40 inference(fool_elimination,[status(thm)],[f15])).
% 1.96/1.40 thf(f15,plain,(
% 1.96/1.40 ~! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : ((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) => ((treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7) => ((treeStar @ X0 @ X1 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6) => ((treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7) => (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)))))))))),
% 1.96/1.40 inference(rectify,[status(thm)],[f13])).
% 1.96/1.40 thf(f13,negated_conjecture,(
% 1.96/1.40 ~! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0,X9 : nat,X16 : color,X17 : color,X18 : tree @ X0,X19 : tree @ X0] : ((treeStar @ X0 @ X1 @ X16 @ X9 @ X18 @ X18) => ((treeStar @ X0 @ X1 @ X17 @ X9 @ X19 @ X19) => ((treeStar @ X0 @ X1 @ X16 @ X9 @ (rev @ X0 @ X16 @ X9 @ (rev @ X0 @ X16 @ X9 @ X18)) @ X18) => ((treeStar @ X0 @ X1 @ X17 @ X9 @ (rev @ X0 @ X17 @ X9 @ (rev @ X0 @ X17 @ X9 @ X19)) @ X19) => (treeStar @ X0 @ X1 @ black @ (suc @ X9) @ (rev @ X0 @ black @ (suc @ X9) @ (bt @ X0 @ X9 @ X17 @ X16 @ (rev @ X0 @ X17 @ X9 @ X19) @ X2 @ (rev @ X0 @ X16 @ X9 @ X18))) @ (bt @ X0 @ X9 @ X16 @ X17 @ (rev @ X0 @ X16 @ X9 @ (rev @ X0 @ X16 @ X9 @ X18)) @ X2 @ (rev @ X0 @ X17 @ X9 @ (rev @ X0 @ X17 @ X9 @ X19)))))))))),
% 1.96/1.40 inference(negated_conjecture,[status(cth)],[f12])).
% 1.96/1.40 thf(f12,conjecture,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0,X9 : nat,X16 : color,X17 : color,X18 : tree @ X0,X19 : tree @ X0] : ((treeStar @ X0 @ X1 @ X16 @ X9 @ X18 @ X18) => ((treeStar @ X0 @ X1 @ X17 @ X9 @ X19 @ X19) => ((treeStar @ X0 @ X1 @ X16 @ X9 @ (rev @ X0 @ X16 @ X9 @ (rev @ X0 @ X16 @ X9 @ X18)) @ X18) => ((treeStar @ X0 @ X1 @ X17 @ X9 @ (rev @ X0 @ X17 @ X9 @ (rev @ X0 @ X17 @ X9 @ X19)) @ X19) => (treeStar @ X0 @ X1 @ black @ (suc @ X9) @ (rev @ X0 @ black @ (suc @ X9) @ (bt @ X0 @ X9 @ X17 @ X16 @ (rev @ X0 @ X17 @ X9 @ X19) @ X2 @ (rev @ X0 @ X16 @ X9 @ X18))) @ (bt @ X0 @ X9 @ X16 @ X17 @ (rev @ X0 @ X16 @ X9 @ (rev @ X0 @ X16 @ X9 @ X18)) @ X2 @ (rev @ X0 @ X17 @ X9 @ (rev @ X0 @ X17 @ X9 @ X19)))))))))),
% 1.96/1.40 file('/export/starexec/sandbox2/tmp/tmp.FzTv1zdSVA/DTF2THF_26404.p',second_step)).
% 1.96/1.40 thf(f133,plain,(
% 1.96/1.40 ((treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ sK6 @ sK6) != $true) | spl13_4),
% 1.96/1.40 inference(subsumption_resolution,[status(thm)],[f131,f57])).
% 1.96/1.40 thf(f57,plain,(
% 1.96/1.40 ((isPer @ sK0 @ sK1) = $true)),
% 1.96/1.40 inference(cnf_transformation,[status(thm)],[f50])).
% 1.96/1.40 thf(f131,plain,(
% 1.96/1.40 ((isPer @ sK0 @ sK1) != $true) | ((treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ sK6 @ sK6) != $true) | spl13_4),
% 1.96/1.40 inference(trivial_inequality_removal,[status(thm)],[f127])).
% 1.96/1.40 thf(f127,plain,(
% 1.96/1.40 ((isPer @ sK0 @ sK1) != $true) | ($true != $true) | ((treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ sK6 @ sK6) != $true) | spl13_4),
% 1.96/1.40 inference(superposition,[status(thm)],[f98,f74])).
% 1.96/1.40 thf(f74,plain,(
% 1.96/1.40 ( ! [X0 : $tType,X2 : color,X3 : nat,X1 : X0 > X0 > $o,X4 : tree @ X0,X5 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ X2 @ X3 @ (rev @ X0 @ X2 @ X3 @ X4) @ (rev @ X0 @ X2 @ X3 @ X5))) | ((treeStar @ X0 @ X1 @ X2 @ X3 @ X4 @ X5) != $true) | ((isPer @ X0 @ X1) != $true)) )),
% 1.96/1.40 inference(cnf_transformation,[status(thm)],[f46])).
% 1.96/1.40 thf(f46,plain,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : color,X3 : nat,X4 : tree @ X0,X5 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ X2 @ X3 @ (rev @ X0 @ X2 @ X3 @ X4) @ (rev @ X0 @ X2 @ X3 @ X5))) | ((treeStar @ X0 @ X1 @ X2 @ X3 @ X4 @ X5) != $true)))),
% 1.96/1.40 inference(ennf_transformation,[status(thm)],[f34])).
% 1.96/1.40 thf(f34,plain,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : color,X3 : nat,X4 : tree @ X0,X5 : tree @ X0] : (((treeStar @ X0 @ X1 @ X2 @ X3 @ X4 @ X5) = $true) => ($true = (treeStar @ X0 @ X1 @ X2 @ X3 @ (rev @ X0 @ X2 @ X3 @ X4) @ (rev @ X0 @ X2 @ X3 @ X5)))))),
% 1.96/1.40 inference(fool_elimination,[status(thm)],[f33])).
% 1.96/1.40 thf(f33,plain,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : color,X3 : nat,X4 : tree @ X0,X5 : tree @ X0] : ((treeStar @ X0 @ X1 @ X2 @ X3 @ X4 @ X5) => (treeStar @ X0 @ X1 @ X2 @ X3 @ (rev @ X0 @ X2 @ X3 @ X4) @ (rev @ X0 @ X2 @ X3 @ X5))))),
% 1.96/1.40 inference(rectify,[status(thm)],[f8])).
% 1.96/1.40 thf(f8,axiom,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X7 : color,X9 : nat,X10 : tree @ X0,X11 : tree @ X0] : ((treeStar @ X0 @ X1 @ X7 @ X9 @ X10 @ X11) => (treeStar @ X0 @ X1 @ X7 @ X9 @ (rev @ X0 @ X7 @ X9 @ X10) @ (rev @ X0 @ X7 @ X9 @ X11))))),
% 1.96/1.40 file('/export/starexec/sandbox2/tmp/tmp.FzTv1zdSVA/DTF2THF_26404.p',rev_tp_ax)).
% 1.96/1.40 thf(f98,plain,(
% 1.96/1.40 ($true != (treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6) @ (rev @ sK0 @ sK4 @ sK3 @ sK6))) | spl13_4),
% 1.96/1.40 inference(avatar_component_clause,[status(thm)],[f96])).
% 1.96/1.40 thf(f96,definition,(
% 1.96/1.40 spl13_4 <=> ($true = (treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6) @ (rev @ sK0 @ sK4 @ sK3 @ sK6)))),
% 1.96/1.40 introduced(definition,[new_symbols(naming,[spl13_4])],[avatar_definition])).
% 1.96/1.40 thf(f117,plain,(
% 1.96/1.40 spl13_3),
% 1.96/1.40 inference(avatar_contradiction_clause,[status(thm)],[f116])).
% 1.96/1.40 thf(f116,plain,(
% 1.96/1.40 $false | spl13_3),
% 1.96/1.40 inference(subsumption_resolution,[status(thm)],[f115,f62])).
% 1.96/1.40 thf(f62,plain,(
% 1.96/1.40 ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ sK7 @ sK7) = $true)),
% 1.96/1.40 inference(cnf_transformation,[status(thm)],[f50])).
% 1.96/1.40 thf(f115,plain,(
% 1.96/1.40 ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ sK7 @ sK7) != $true) | spl13_3),
% 1.96/1.40 inference(subsumption_resolution,[status(thm)],[f114,f57])).
% 1.96/1.40 thf(f114,plain,(
% 1.96/1.40 ((isPer @ sK0 @ sK1) != $true) | ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ sK7 @ sK7) != $true) | spl13_3),
% 1.96/1.40 inference(trivial_inequality_removal,[status(thm)],[f109])).
% 1.96/1.40 thf(f109,plain,(
% 1.96/1.40 ((isPer @ sK0 @ sK1) != $true) | ($true != $true) | ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ sK7 @ sK7) != $true) | spl13_3),
% 1.96/1.40 inference(superposition,[status(thm)],[f94,f74])).
% 1.96/1.40 thf(f94,plain,(
% 1.96/1.40 ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7) @ (rev @ sK0 @ sK5 @ sK3 @ sK7)) != $true) | spl13_3),
% 1.96/1.40 inference(avatar_component_clause,[status(thm)],[f92])).
% 1.96/1.40 thf(f92,definition,(
% 1.96/1.40 spl13_3 <=> ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7) @ (rev @ sK0 @ sK5 @ sK3 @ sK7)) = $true)),
% 1.96/1.40 introduced(definition,[new_symbols(naming,[spl13_3])],[avatar_definition])).
% 1.96/1.40 thf(f99,plain,(
% 1.96/1.40 ~spl13_3 | ~spl13_4),
% 1.96/1.40 inference(avatar_split_clause,[status(thm)],[f90,f96,f92])).
% 1.96/1.40 thf(f90,plain,(
% 1.96/1.40 ($true != (treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6) @ (rev @ sK0 @ sK4 @ sK3 @ sK6))) | ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7) @ (rev @ sK0 @ sK5 @ sK3 @ sK7)) != $true)),
% 1.96/1.40 inference(subsumption_resolution,[status(thm)],[f80,f57])).
% 1.96/1.40 thf(f80,plain,(
% 1.96/1.40 ($true != (treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6) @ (rev @ sK0 @ sK4 @ sK3 @ sK6))) | ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7) @ (rev @ sK0 @ sK5 @ sK3 @ sK7)) != $true) | ((isPer @ sK0 @ sK1) != $true)),
% 1.96/1.40 inference(trivial_inequality_removal,[status(thm)],[f76])).
% 1.96/1.40 thf(f76,plain,(
% 1.96/1.40 ((treeStar @ sK0 @ sK1 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7) @ (rev @ sK0 @ sK5 @ sK3 @ sK7)) != $true) | ($true != (treeStar @ sK0 @ sK1 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6) @ (rev @ sK0 @ sK4 @ sK3 @ sK6))) | ((isPer @ sK0 @ sK1) != $true) | ($true != $true)),
% 1.96/1.40 inference(superposition,[status(thm)],[f58,f71])).
% 1.96/1.40 thf(f71,plain,(
% 1.96/1.40 ( ! [X0 : $tType,X2 : X0,X3 : nat,X1 : X0 > X0 > $o,X6 : tree @ X0,X7 : tree @ X0,X4 : color,X5 : color] : (((treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7)) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) = $true) | ((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) != $true) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.96/1.40 inference(cnf_transformation,[status(thm)],[f40])).
% 1.96/1.40 thf(f40,plain,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : (($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)) | ((treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7)) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) = $true) | ((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) != $true)))),
% 1.96/1.40 inference(flattening,[status(thm)],[f39])).
% 1.96/1.40 thf(f39,plain,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : ((((treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7)) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) = $true) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7))) | ((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) != $true)) | ((isPer @ X0 @ X1) != $true))),
% 1.96/1.40 inference(ennf_transformation,[status(thm)],[f20])).
% 1.96/1.40 thf(f20,plain,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : (((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) = $true) => (($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)) => ((treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7)) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))) = $true))))),
% 1.96/1.40 inference(fool_elimination,[status(thm)],[f19])).
% 1.96/1.40 thf(f19,plain,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : ((treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6) => ((treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7) => (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7)) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))))))),
% 1.96/1.40 inference(rectify,[status(thm)],[f10])).
% 1.96/1.40 thf(f10,axiom,(
% 1.96/1.40 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0,X9 : nat,X16 : color,X17 : color,X18 : tree @ X0,X19 : tree @ X0] : ((treeStar @ X0 @ X1 @ X16 @ X9 @ X18 @ X18) => ((treeStar @ X0 @ X1 @ X17 @ X9 @ X19 @ X19) => (treeStar @ X0 @ X1 @ black @ (suc @ X9) @ (rev @ X0 @ black @ (suc @ X9) @ (bt @ X0 @ X9 @ X16 @ X17 @ X18 @ X2 @ X19)) @ (bt @ X0 @ X9 @ X17 @ X16 @ (rev @ X0 @ X17 @ X9 @ X19) @ X2 @ (rev @ X0 @ X16 @ X9 @ X18))))))),
% 1.96/1.40 file('/export/starexec/sandbox2/tmp/tmp.FzTv1zdSVA/DTF2THF_26404.p',rev_bt)).
% 1.96/1.40 thf(f58,plain,(
% 1.96/1.40 ((treeStar @ sK0 @ sK1 @ black @ (suc @ sK3) @ (rev @ sK0 @ black @ (suc @ sK3) @ (bt @ sK0 @ sK3 @ sK5 @ sK4 @ (rev @ sK0 @ sK5 @ sK3 @ sK7) @ sK2 @ (rev @ sK0 @ sK4 @ sK3 @ sK6))) @ (bt @ sK0 @ sK3 @ sK4 @ sK5 @ (rev @ sK0 @ sK4 @ sK3 @ (rev @ sK0 @ sK4 @ sK3 @ sK6)) @ sK2 @ (rev @ sK0 @ sK5 @ sK3 @ (rev @ sK0 @ sK5 @ sK3 @ sK7)))) != $true)),
% 1.96/1.40 inference(cnf_transformation,[status(thm)],[f50])).
% 1.96/1.40 % SZS output end Proof for DTF2THF_26404
% 1.96/1.40 % (26553)------------------------------
% 1.96/1.40 % (26553)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.96/1.40 % (26553)Termination reason: Refutation
% 1.96/1.40
% 1.96/1.40 % (26553)Memory used [KB]: 5884
% 1.96/1.40 % (26553)Time elapsed: 0.015 s
% 1.96/1.40 % (26553)Instructions burned: 35 (million)
% 1.96/1.40 % (26553)------------------------------
% 1.96/1.40 % (26553)------------------------------
% 1.96/1.40 % (26547)Success in time 0.017 s
%------------------------------------------------------------------------------