%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : DAT426^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 : n016.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 2.24s 1.57s
% Output : Refutation 2.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT426^1 : TPTP v9.2.1. Released v9.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n016.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue Feb 24 06:18:51 EST 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.29/0.45 ---- Original DTF file ---
% 0.29/0.45 thf(spec,logic,$$dhol).
% 0.29/0.45 %------------------------------------------------------------------------------
% 0.29/0.45 % File : DAT426^1 : TPTP v9.2.1. Released v9.2.0.
% 0.29/0.45 % Domain : Data Structures
% 0.29/0.45 % Problem : Reversal of a red-black-tree is an involution, BT step
% 0.29/0.45 % Version : Especial.
% 0.29/0.45 % English :
% 0.29/0.45
% 0.29/0.45 % Refs : [RRB23] Rothgang et al. (2023), Theorem Proving in Dependently
% 0.29/0.45 % : [Rot25] Rothgang (2025), Email to Geoff Sutcliffe
% 0.29/0.45 % : [RK+25] Ranalter et al. (2025), The Dependently Typed Higher-O
% 0.29/0.45 % Source : [Rot25]
% 0.29/0.45 % Names : RedBlackTree/rbt-rev-invol-composedBTStep.p [Rot25]
% 0.29/0.45
% 0.29/0.45 % Status : Theorem
% 0.29/0.45 % Rating : ? v9.2.0
% 0.29/0.45 % Syntax : Number of formulae : 18 ( 3 unt; 11 typ; 0 def)
% 0.29/0.45 % Number of atoms : 15 ( 15 equ; 0 cnn)
% 0.29/0.45 % Maximal formula atoms : 3 ( 2 avg)
% 0.29/0.45 % Number of connectives : 325 ( 0 ~; 0 |; 0 &; 317 @)
% 0.29/0.45 % ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% 0.29/0.45 % Maximal formula depth : 10 ( 8 avg)
% 0.29/0.45 % Number of types : 2 ( 2 usr)
% 0.29/0.45 % Number of type decls : 11 ( 4 !>P; 3 !>D)
% 0.29/0.45 % Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% 0.29/0.45 % Number of symbols : 10 ( 9 usr; 3 con; 0-7 aty)
% 0.29/0.45 % Number of variables : 51 ( 0 ^; 41 !; 0 ?; 51 :)
% 0.29/0.45 % ( 10 !>; 0 ?*; 0 @-; 0 @+)
% 0.29/0.45 % SPC : DH1_THM_EQU_NAR
% 0.29/0.45
% 0.29/0.45 % Comments :
% 0.29/0.45 %------------------------------------------------------------------------------
% 0.29/0.45 thf(color_type,type,
% 0.29/0.45 color: $tType ).
% 0.29/0.45
% 0.29/0.45 thf(black_type,type,
% 0.29/0.45 black: color ).
% 0.29/0.45
% 0.29/0.45 thf(red_type,type,
% 0.29/0.45 red: color ).
% 0.29/0.45
% 0.29/0.45 thf(nat_type,type,
% 0.29/0.45 nat: $tType ).
% 0.29/0.45
% 0.29/0.45 thf(zero_type,type,
% 0.29/0.45 zero: nat ).
% 0.29/0.45
% 0.29/0.45 thf(suc_type,type,
% 0.29/0.45 suc: nat > nat ).
% 0.29/0.45
% 0.29/0.45 thf(tree_type,type,
% 0.29/0.45 tree: $tType > color > nat > $tType ).
% 0.29/0.45
% 0.29/0.45 thf(leaf_type,type,
% 0.29/0.45 leaf:
% 0.29/0.45 !>[A: $tType] : ( tree @ A @ black @ zero ) ).
% 0.29/0.45
% 0.29/0.45 thf(redTree_type,type,
% 0.29/0.45 rt:
% 0.29/0.45 !>[A: $tType,N: nat] : ( ( tree @ A @ black @ N ) > A > ( tree @ A @ black @ N ) > ( tree @ A @ red @ N ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(blackTree_type,type,
% 0.29/0.45 bt:
% 0.29/0.45 !>[A: $tType,N: nat,C1: color,C2: color] : ( ( tree @ A @ C1 @ N ) > A > ( tree @ A @ C2 @ N ) > ( tree @ A @ black @ ( suc @ N ) ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(rbt_rev,type,
% 0.29/0.45 rev:
% 0.29/0.45 !>[A: $tType,C: color,N: nat] : ( ( tree @ A @ C @ N ) > ( tree @ A @ C @ N ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(rev_leaf,axiom,
% 0.29/0.45 ! [A: $tType] :
% 0.29/0.45 ( ( rev @ A @ black @ zero @ ( leaf @ A ) )
% 0.29/0.45 = ( leaf @ A ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(rev_bt,axiom,
% 0.29/0.45 ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
% 0.29/0.45 ( ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) )
% 0.29/0.45 = ( bt @ A @ N @ C2 @ C1 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(rev_rt,axiom,
% 0.29/0.45 ! [A: $tType,X: A,N: nat,T1: tree @ A @ black @ N,T2: tree @ A @ black @ N] :
% 0.29/0.45 ( ( rev @ A @ red @ N @ ( rt @ A @ N @ T1 @ X @ T2 ) )
% 0.29/0.45 = ( rt @ A @ N @ ( rev @ A @ black @ N @ T2 ) @ X @ ( rev @ A @ black @ N @ T2 ) ) ) ).
% 0.29/0.45
% 0.29/0.45 %vampire --mode casc is able to prove the conjecture with or without the added axioms.
% 0.29/0.45 %With the axioms, it is about 5 times faster.
% 0.29/0.45
% 0.29/0.45 thf(first_step,axiom,
% 0.29/0.45 ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
% 0.29/0.45 ( ( ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) )
% 0.29/0.45 = T1 )
% 0.29/0.45 => ( ( ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) )
% 0.29/0.45 = T2 )
% 0.29/0.45 => ( ( rev @ A @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) )
% 0.29/0.45 = ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C2 @ C1 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) ) ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(second_step,axiom,
% 0.29/0.45 ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
% 0.29/0.45 ( ( ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) )
% 0.29/0.45 = T1 )
% 0.29/0.45 => ( ( ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) )
% 0.29/0.45 = T2 )
% 0.29/0.45 => ( ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C2 @ C1 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) )
% 0.29/0.45 = ( 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.29/0.45
% 0.29/0.45 thf(third_step,axiom,
% 0.29/0.45 ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
% 0.29/0.45 ( ( ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) )
% 0.29/0.45 = T1 )
% 0.29/0.45 => ( ( ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) )
% 0.29/0.45 = T2 )
% 0.29/0.45 => ( ( 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.29/0.45 = ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) ) ) ).
% 0.29/0.45
% 0.29/0.45 thf(bt_step,conjecture,
% 0.29/0.45 ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
% 0.29/0.45 ( ( ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) )
% 0.29/0.45 = T1 )
% 0.29/0.45 => ( ( ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) )
% 0.29/0.45 = T2 )
% 0.29/0.45 => ( ( rev @ A @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) )
% 0.29/0.45 = ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) ) ) ).
% 0.29/0.45
% 0.29/0.45 %------------------------------------------------------------------------------
% 0.29/0.45 ------------------------
% 2.05/1.47 ---- Embedded in THF ---
% 2.05/1.47 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 2.05/1.47 %%% Generated on Tue Feb 24 06:18:52 EST 2026
% 2.05/1.47 %%% using '$$dhol' embedding, version 1.3.0.
% 2.05/1.47 %%% Logic specification used:
% 2.05/1.47 %%% thf(spec, logic, $$dhol).
% 2.05/1.47
% 2.05/1.47 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.0VWROT94jV/DTF2DTF8336.p
% 2.05/1.47 thf(is_per_type, type, isPer: (!> [A:$tType]: (((A > (A > $o)) > $o)))).
% 2.05/1.47 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)))))))))).
% 2.05/1.47 thf(color_type, type, color: $tType).
% 2.05/1.47 thf(colorStar, type, 'colorStar': (color > (color > $o))).
% 2.05/1.47 thf(colorStar_is_eq, axiom, (! [X:color,Y:color]: (((('colorStar' @ X) @ Y) <=> (X = Y))))).
% 2.05/1.47 thf(black_type, type, black: color).
% 2.05/1.47 thf(red_type, type, red: color).
% 2.05/1.47 thf(nat_type, type, nat: $tType).
% 2.05/1.47 thf(natStar, type, 'natStar': (nat > (nat > $o))).
% 2.05/1.47 thf(natStar_is_eq, axiom, (! [X:nat,Y:nat]: (((('natStar' @ X) @ Y) <=> (X = Y))))).
% 2.05/1.47 thf(zero_type, type, zero: nat).
% 2.05/1.47 thf(suc_type, type, suc: (nat > nat)).
% 2.05/1.47 thf(tree_type, type, tree: ($tType > $tType)).
% 2.05/1.47 thf(treeStar, type, 'treeStar': (!> [A:$tType]: (((A > (A > $o)) > (color > (nat > ((tree @ A) > ((tree @ A) > $o)))))))).
% 2.05/1.47 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)))))))))).
% 2.05/1.47 thf(leaf_type, type, leaf: (!> [A:$tType]: ((tree @ A)))).
% 2.05/1.47 thf(leaf_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => ((((((treeStar @ A) @ AStar) @ black) @ zero) @ (leaf @ A)) @ (leaf @ A)))))).
% 2.05/1.47 thf(redTree_type, type, rt: (!> [A:$tType]: ((nat > ((tree @ A) > (A > ((tree @ A) > (tree @ A)))))))).
% 2.05/1.47 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))))))))))))))))).
% 2.05/1.47 thf(blackTree_type, type, bt: (!> [A:$tType]: ((nat > (color > (color > ((tree @ A) > (A > ((tree @ A) > (tree @ A)))))))))).
% 2.05/1.47 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))))))))))))))))))))).
% 2.05/1.47 thf(rbt_rev, type, rev: (!> [A:$tType]: ((color > (nat > ((tree @ A) > (tree @ A))))))).
% 2.05/1.47 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))))))))))))).
% 2.05/1.47 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)))))).
% 2.05/1.47 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))))))))))))))))))).
% 2.05/1.47 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))))))))))))))).
% 2.05/1.47 thf(first_step, 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) @ 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)) @ ((((rev @ A) @ black) @ (suc @ N)) @ (((((((bt @ A) @ N) @ C1) @ C2) @ T1) @ X) @ T2)))) @ ((((rev @ A) @ black) @ (suc @ N)) @ (((((((bt @ A) @ N) @ C2) @ C1) @ ((((rev @ A) @ C2) @ N) @ T2)) @ X) @ ((((rev @ A) @ C1) @ N) @ T1)))))))))))))))))))))).
% 2.05/1.47 thf(second_step, 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) @ 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)))))))))))))))))))))).
% 2.05/1.47 thf(third_step, 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) @ 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)) @ (((((((bt @ A) @ N) @ C1) @ C2) @ ((((rev @ A) @ C1) @ N) @ ((((rev @ A) @ C1) @ N) @ T1))) @ X) @ ((((rev @ A) @ C2) @ N) @ ((((rev @ A) @ C2) @ N) @ T2)))) @ (((((((bt @ A) @ N) @ C1) @ C2) @ T1) @ X) @ T2)))))))))))))))))))).
% 2.05/1.47 thf(bt_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)) @ ((((rev @ A) @ black) @ (suc @ N)) @ (((((((bt @ A) @ N) @ C1) @ C2) @ T1) @ X) @ T2)))) @ (((((((bt @ A) @ N) @ C1) @ C2) @ T1) @ X) @ T2)))))))))))))))))))).
% 2.05/1.47 % SZS output end ListOfTHF for /export/starexec/sandbox2/tmp/tmp.0VWROT94jV/DTF2DTF8336.p
% 2.05/1.47 ------------------------
% 2.05/1.49 ---- Cleaned THF ---
% 2.05/1.49 thf(is_per_type,type,
% 2.05/1.49 isPer:
% 2.05/1.49 !>[A: $tType] : ( ( A > A > $o ) > $o ) ).
% 2.05/1.49
% 2.05/1.49 thf(is_per,definition,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 <=> ( ! [X: A,Y: A] :
% 2.05/1.49 ( ( AStar @ X @ Y )
% 2.05/1.49 => ( AStar @ Y @ X ) )
% 2.05/1.49 & ! [X: A,Y: A,Z: A] :
% 2.05/1.49 ( ( AStar @ X @ Y )
% 2.05/1.49 => ( ( AStar @ Y @ Z )
% 2.05/1.49 => ( AStar @ X @ Z ) ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(color_type,type,
% 2.05/1.49 color: $tType ).
% 2.05/1.49
% 2.05/1.49 thf(colorStar,type,
% 2.05/1.49 colorStar: color > color > $o ).
% 2.05/1.49
% 2.05/1.49 thf(colorStar_is_eq,axiom,
% 2.05/1.49 ! [X: color,Y: color] :
% 2.05/1.49 ( ( colorStar @ X @ Y )
% 2.05/1.49 <=> ( X = Y ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(black_type,type,
% 2.05/1.49 black: color ).
% 2.05/1.49
% 2.05/1.49 thf(red_type,type,
% 2.05/1.49 red: color ).
% 2.05/1.49
% 2.05/1.49 thf(nat_type,type,
% 2.05/1.49 nat: $tType ).
% 2.05/1.49
% 2.05/1.49 thf(natStar,type,
% 2.05/1.49 natStar: nat > nat > $o ).
% 2.05/1.49
% 2.05/1.49 thf(natStar_is_eq,axiom,
% 2.05/1.49 ! [X: nat,Y: nat] :
% 2.05/1.49 ( ( natStar @ X @ Y )
% 2.05/1.49 <=> ( X = Y ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(zero_type,type,
% 2.05/1.49 zero: nat ).
% 2.05/1.49
% 2.05/1.49 thf(suc_type,type,
% 2.05/1.49 suc: nat > nat ).
% 2.05/1.49
% 2.05/1.49 thf(tree_type,type,
% 2.05/1.49 tree: $tType > $tType ).
% 2.05/1.49
% 2.05/1.49 thf(treeStar,type,
% 2.05/1.49 treeStar:
% 2.05/1.49 !>[A: $tType] : ( ( A > A > $o ) > color > nat > ( tree @ A ) > ( tree @ A ) > $o ) ).
% 2.05/1.49
% 2.05/1.49 thf('\'treeStar\'_is_per',axiom,
% 2.05/1.49 ! [B: $tType,BStar: B > B > $o] :
% 2.05/1.49 ( ( isPer @ B @ BStar )
% 2.05/1.49 => ! [C: color,C0: nat] : ( isPer @ ( tree @ B ) @ ( treeStar @ B @ BStar @ C @ C0 ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(leaf_type,type,
% 2.05/1.49 leaf:
% 2.05/1.49 !>[A: $tType] : ( tree @ A ) ).
% 2.05/1.49
% 2.05/1.49 thf(leaf_tp_ax,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ( treeStar @ A @ AStar @ black @ zero @ ( leaf @ A ) @ ( leaf @ A ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(redTree_type,type,
% 2.05/1.49 rt:
% 2.05/1.49 !>[A: $tType] : ( nat > ( tree @ A ) > A > ( tree @ A ) > ( tree @ A ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(rt_tp_ax,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [N: nat,D: tree @ A,D_prime: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ black @ N @ D @ D_prime )
% 2.05/1.49 => ! [D0: A,D0_prime: A] :
% 2.05/1.49 ( ( D0 = D0_prime )
% 2.05/1.49 => ! [D1: tree @ A,D1_prime: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ black @ N @ D1 @ D1_prime )
% 2.05/1.49 => ( treeStar @ A @ AStar @ red @ N @ ( rt @ A @ N @ D @ D0 @ D1 ) @ ( rt @ A @ N @ D_prime @ D0_prime @ D1_prime ) ) ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(blackTree_type,type,
% 2.05/1.49 bt:
% 2.05/1.49 !>[A: $tType] : ( nat > color > color > ( tree @ A ) > A > ( tree @ A ) > ( tree @ A ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(bt_tp_ax,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [N: nat,C1: color,C2: color,D: tree @ A,D_prime: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ C1 @ N @ D @ D_prime )
% 2.05/1.49 => ! [D0: A,D0_prime: A] :
% 2.05/1.49 ( ( D0 = D0_prime )
% 2.05/1.49 => ! [D1: tree @ A,D1_prime: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ C2 @ N @ D1 @ D1_prime )
% 2.05/1.49 => ( 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 ) ) ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(rbt_rev,type,
% 2.05/1.49 rev:
% 2.05/1.49 !>[A: $tType] : ( color > nat > ( tree @ A ) > ( tree @ A ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(rev_tp_ax,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [C: color,N: nat,D: tree @ A,D_prime: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ C @ N @ D @ D_prime )
% 2.05/1.49 => ( treeStar @ A @ AStar @ C @ N @ ( rev @ A @ C @ N @ D ) @ ( rev @ A @ C @ N @ D_prime ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(rev_leaf,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ( treeStar @ A @ AStar @ black @ zero @ ( rev @ A @ black @ zero @ ( leaf @ A ) ) @ ( leaf @ A ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(rev_bt,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [X: A,N: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ C1 @ N @ T1 @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ T2 @ T2 )
% 2.05/1.49 => ( 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 ) ) ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(rev_rt,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [X: A,N: nat,T1: tree @ A,T2: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ black @ N @ T1 @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ black @ N @ T2 @ T2 )
% 2.05/1.49 => ( 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 ) ) ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(first_step,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [X: A,N: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ C1 @ N @ T1 @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ T2 @ T2 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C1 @ N @ ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) ) @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) ) @ T2 )
% 2.05/1.49 => ( treeStar @ A @ AStar @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) ) @ ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C2 @ C1 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) ) ) ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(second_step,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [X: A,N: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ C1 @ N @ T1 @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ T2 @ T2 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C1 @ N @ ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) ) @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) ) @ T2 )
% 2.05/1.49 => ( 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 ) ) ) ) ) ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(third_step,axiom,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [X: A,N: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ C1 @ N @ T1 @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ T2 @ T2 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C1 @ N @ ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) ) @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) ) @ T2 )
% 2.05/1.49 => ( treeStar @ A @ AStar @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) ) @ X @ ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) ) ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) ) ) ) ) ) ).
% 2.05/1.49
% 2.05/1.49 thf(bt_step,conjecture,
% 2.05/1.49 ! [A: $tType,AStar: A > A > $o] :
% 2.05/1.49 ( ( isPer @ A @ AStar )
% 2.05/1.49 => ! [X: A,N: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 2.05/1.49 ( ( treeStar @ A @ AStar @ C1 @ N @ T1 @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ T2 @ T2 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C1 @ N @ ( rev @ A @ C1 @ N @ ( rev @ A @ C1 @ N @ T1 ) ) @ T1 )
% 2.05/1.49 => ( ( treeStar @ A @ AStar @ C2 @ N @ ( rev @ A @ C2 @ N @ ( rev @ A @ C2 @ N @ T2 ) ) @ T2 )
% 2.05/1.49 => ( treeStar @ A @ AStar @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) ) ) ) ) ) ).
% 2.05/1.49 ------------------------
% 2.24/1.51 % (8537)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/2Mi)
% 2.24/1.51 % (8537)Instruction limit reached!
% 2.24/1.51 % (8537)------------------------------
% 2.24/1.51 % (8537)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.51 % (8537)Termination reason: Unknown
% 2.24/1.51 % (8537)Termination phase: shuffling
% 2.24/1.51
% 2.24/1.51 % (8537)Memory used [KB]: 1023
% 2.24/1.51 % (8537)Time elapsed: 0.003 s
% 2.24/1.51 % (8537)Instructions burned: 4 (million)
% 2.24/1.51 % (8537)------------------------------
% 2.24/1.51 % (8537)------------------------------
% 2.24/1.51 % (8536)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_8336 for (2999ds/27Mi)
% 2.24/1.51 % (8538)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_8336 for (2999ds/2Mi)
% 2.24/1.51 % (8535)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_8336 for (2999ds/4Mi)
% 2.24/1.51 % (8539)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_8336 for (2999ds/275Mi)
% 2.24/1.51 % (8538)Instruction limit reached!
% 2.24/1.51 % (8538)------------------------------
% 2.24/1.51 % (8538)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.51 % (8538)Termination reason: Unknown
% 2.24/1.51 % (8538)Termination phase: shuffling
% 2.24/1.51
% 2.24/1.51 % (8538)Memory used [KB]: 1023
% 2.24/1.51 % (8538)Time elapsed: 0.002 s
% 2.24/1.51 % (8538)Instructions burned: 2 (million)
% 2.24/1.51 % (8538)------------------------------
% 2.24/1.51 % (8538)------------------------------
% 2.24/1.51 % (8540)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/18Mi)
% 2.24/1.52 % (8535)Instruction limit reached!
% 2.24/1.52 % (8535)------------------------------
% 2.24/1.52 % (8535)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.52 % (8535)Termination reason: Unknown
% 2.24/1.52 % (8535)Termination phase: shuffling
% 2.24/1.52
% 2.24/1.52 % (8535)Memory used [KB]: 1023
% 2.24/1.52 % (8535)Time elapsed: 0.004 s
% 2.24/1.52 % (8535)Instructions burned: 6 (million)
% 2.24/1.52 % (8535)------------------------------
% 2.24/1.52 % (8535)------------------------------
% 2.24/1.52 % (8544)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/3Mi)
% 2.24/1.52 % (8544)Instruction limit reached!
% 2.24/1.52 % (8544)------------------------------
% 2.24/1.52 % (8544)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.52 % (8544)Termination reason: Unknown
% 2.24/1.52 % (8544)Termination phase: shuffling
% 2.24/1.52
% 2.24/1.52 % (8544)Memory used [KB]: 1023
% 2.24/1.52 % (8544)Time elapsed: 0.002 s
% 2.24/1.52 % (8544)Instructions burned: 4 (million)
% 2.24/1.52 % (8544)------------------------------
% 2.24/1.52 % (8544)------------------------------
% 2.24/1.52 % (8534)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/183Mi)
% 2.24/1.52 % (8540)Instruction limit reached!
% 2.24/1.52 % (8540)------------------------------
% 2.24/1.52 % (8540)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.52 % (8540)Termination reason: Unknown
% 2.24/1.52 % (8540)Termination phase: Property scanning
% 2.24/1.52
% 2.24/1.52 % (8540)Memory used [KB]: 1151
% 2.24/1.52 % (8540)Time elapsed: 0.011 s
% 2.24/1.52 % (8540)Instructions burned: 18 (million)
% 2.24/1.52 % (8540)------------------------------
% 2.24/1.52 % (8540)------------------------------
% 2.24/1.53 % (8536)Instruction limit reached!
% 2.24/1.53 % (8536)------------------------------
% 2.24/1.53 % (8536)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.53 % (8536)Termination reason: Unknown
% 2.24/1.53 % (8536)Termination phase: Saturation
% 2.24/1.53
% 2.24/1.53 % (8536)Memory used [KB]: 5628
% 2.24/1.53 % (8536)Time elapsed: 0.016 s
% 2.24/1.53 % (8536)Instructions burned: 27 (million)
% 2.24/1.53 % (8536)------------------------------
% 2.24/1.53 % (8536)------------------------------
% 2.24/1.53 % (8548)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_8336 for (2999ds/3Mi)
% 2.24/1.53 % (8545)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_8336 for (2999ds/37Mi)
% 2.24/1.53 % (8548)Instruction limit reached!
% 2.24/1.53 % (8548)------------------------------
% 2.24/1.53 % (8548)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.53 % (8548)Termination reason: Unknown
% 2.24/1.53 % (8548)Termination phase: shuffling
% 2.24/1.53
% 2.24/1.53 % (8548)Memory used [KB]: 1023
% 2.24/1.53 % (8548)Time elapsed: 0.002 s
% 2.24/1.53 % (8548)Instructions burned: 4 (million)
% 2.24/1.53 % (8548)------------------------------
% 2.24/1.53 % (8548)------------------------------
% 2.24/1.53 % (8546)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_8336 for (2999ds/15Mi)
% 2.24/1.53 % Exception at run slice level
% 2.24/1.53 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 2.24/1.54 % (8546)Instruction limit reached!
% 2.24/1.54 % (8546)------------------------------
% 2.24/1.54 % (8546)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.54 % (8546)Termination reason: Unknown
% 2.24/1.54 % (8546)Termination phase: Property scanning
% 2.24/1.54
% 2.24/1.54 % (8546)Memory used [KB]: 1151
% 2.24/1.54 % (8546)Time elapsed: 0.008 s
% 2.24/1.54 % (8546)Instructions burned: 15 (million)
% 2.24/1.54 % (8546)------------------------------
% 2.24/1.54 % (8546)------------------------------
% 2.24/1.54 % (8549)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_8336 for (2999ds/1041Mi)
% 2.24/1.54 % Exception at run slice level
% 2.24/1.54 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 2.24/1.54 % (8552)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/16Mi)
% 2.24/1.55 % (8550)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/7Mi)
% 2.24/1.55 % (8553)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_8336 for (2999ds/3Mi)
% 2.24/1.55 % (8550)Instruction limit reached!
% 2.24/1.55 % (8550)------------------------------
% 2.24/1.55 % (8550)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.55 % (8550)Termination reason: Unknown
% 2.24/1.55 % (8550)Termination phase: shuffling
% 2.24/1.55
% 2.24/1.55 % (8550)Memory used [KB]: 1023
% 2.24/1.55 % (8550)Time elapsed: 0.006 s
% 2.24/1.55 % (8550)Instructions burned: 8 (million)
% 2.24/1.55 % (8550)------------------------------
% 2.24/1.55 % (8550)------------------------------
% 2.24/1.55 % (8553)Instruction limit reached!
% 2.24/1.55 % (8553)------------------------------
% 2.24/1.55 % (8553)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.55 % (8553)Termination reason: Unknown
% 2.24/1.55 % (8553)Termination phase: shuffling
% 2.24/1.55
% 2.24/1.55 % (8553)Memory used [KB]: 1023
% 2.24/1.55 % (8553)Time elapsed: 0.003 s
% 2.24/1.55 % (8553)Instructions burned: 3 (million)
% 2.24/1.55 % (8553)------------------------------
% 2.24/1.55 % (8553)------------------------------
% 2.24/1.55 % (8552)Instruction limit reached!
% 2.24/1.55 % (8552)------------------------------
% 2.24/1.55 % (8552)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.55 % (8552)Termination reason: Unknown
% 2.24/1.55 % (8552)Termination phase: Property scanning
% 2.24/1.55
% 2.24/1.55 % (8552)Memory used [KB]: 1151
% 2.24/1.55 % (8552)Time elapsed: 0.009 s
% 2.24/1.55 % (8552)Instructions burned: 16 (million)
% 2.24/1.55 % (8552)------------------------------
% 2.24/1.55 % (8552)------------------------------
% 2.24/1.55 % (8555)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_8336 for (2999ds/3Mi)
% 2.24/1.56 % (8555)Instruction limit reached!
% 2.24/1.56 % (8555)------------------------------
% 2.24/1.56 % (8555)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.56 % (8555)Termination reason: Unknown
% 2.24/1.56 % (8555)Termination phase: shuffling
% 2.24/1.56
% 2.24/1.56 % (8555)Memory used [KB]: 1023
% 2.24/1.56 % (8555)Time elapsed: 0.003 s
% 2.24/1.56 % (8555)Instructions burned: 4 (million)
% 2.24/1.56 % (8555)------------------------------
% 2.24/1.56 % (8555)------------------------------
% 2.24/1.56 % (8556)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/7Mi)
% 2.24/1.56 % (8561)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/18Mi)
% 2.24/1.56 % (8556)Instruction limit reached!
% 2.24/1.56 % (8556)------------------------------
% 2.24/1.56 % (8556)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.56 % (8556)Termination reason: Unknown
% 2.24/1.56 % (8556)Termination phase: shuffling
% 2.24/1.56
% 2.24/1.56 % (8556)Memory used [KB]: 1023
% 2.24/1.56 % (8556)Time elapsed: 0.005 s
% 2.24/1.56 % (8556)Instructions burned: 8 (million)
% 2.24/1.56 % (8556)------------------------------
% 2.24/1.56 % (8556)------------------------------
% 2.24/1.57 % (8539)First to succeed.
% 2.24/1.57 % (8561)Instruction limit reached!
% 2.24/1.57 % (8561)------------------------------
% 2.24/1.57 % (8561)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.57 % (8561)Termination reason: Unknown
% 2.24/1.57 % (8561)Termination phase: Property scanning
% 2.24/1.57
% 2.24/1.57 % (8561)Memory used [KB]: 1151
% 2.24/1.57 % (8561)Time elapsed: 0.006 s
% 2.24/1.57 % (8561)Instructions burned: 18 (million)
% 2.24/1.57 % (8561)------------------------------
% 2.24/1.57 % (8561)------------------------------
% 2.24/1.57 % (8558)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/3Mi)
% 2.24/1.57 % (8559)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/4Mi)
% 2.24/1.57 % (8558)Instruction limit reached!
% 2.24/1.57 % (8558)------------------------------
% 2.24/1.57 % (8558)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.57 % (8558)Termination reason: Unknown
% 2.24/1.57 % (8558)Termination phase: shuffling
% 2.24/1.57
% 2.24/1.57 % (8558)Memory used [KB]: 1023
% 2.24/1.57 % (8558)Time elapsed: 0.003 s
% 2.24/1.57 % (8558)Instructions burned: 3 (million)
% 2.24/1.57 % (8558)------------------------------
% 2.24/1.57 % (8558)------------------------------
% 2.24/1.57 % (8559)Instruction limit reached!
% 2.24/1.57 % (8559)------------------------------
% 2.24/1.57 % (8559)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.57 % (8559)Termination reason: Unknown
% 2.24/1.57 % (8559)Termination phase: shuffling
% 2.24/1.57
% 2.24/1.57 % (8559)Memory used [KB]: 1023
% 2.24/1.57 % (8559)Time elapsed: 0.004 s
% 2.24/1.57 % (8559)Instructions burned: 5 (million)
% 2.24/1.57 % (8559)------------------------------
% 2.24/1.57 % (8559)------------------------------
% 2.24/1.57 % (8562)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_8336 for (2999ds/710Mi)
% 2.24/1.57 % (8564)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_8336 for (2999ds/902Mi)
% 2.24/1.57 % (8539)Refutation found. Thanks to Tanya!
% 2.24/1.57 % SZS status Theorem for DTF2THF_8336
% 2.24/1.57 % SZS output start Proof for DTF2THF_8336
% 2.24/1.57 thf(type_def_6, type, color: $tType).
% 2.24/1.57 thf(type_def_7, type, nat: $tType).
% 2.24/1.57 thf(type_def_8, type, tree: ($tType) > $tType).
% 2.24/1.57 thf(type_def_9, type, sK5: $tType).
% 2.24/1.57 thf(func_def_0, type, isPer: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 2.24/1.57 thf(func_def_2, type, color: $tType).
% 2.24/1.57 thf(func_def_3, type, colorStar: color > color > $o).
% 2.24/1.57 thf(func_def_4, type, black: color).
% 2.24/1.57 thf(func_def_5, type, red: color).
% 2.24/1.57 thf(func_def_6, type, nat: $tType).
% 2.24/1.57 thf(func_def_7, type, natStar: nat > nat > $o).
% 2.24/1.57 thf(func_def_8, type, zero: nat).
% 2.24/1.57 thf(func_def_9, type, suc: nat > nat).
% 2.24/1.57 thf(func_def_10, type, tree: ($tType) > $tType).
% 2.24/1.57 thf(func_def_11, type, treeStar: !>[X0: $tType]:((X0 > X0 > $o) > color > nat > tree @ X0 > tree @ X0 > $o)).
% 2.24/1.57 thf(func_def_12, type, leaf: !>[X0: $tType]:(tree @ X0)).
% 2.24/1.57 thf(func_def_13, type, rt: !>[X0: $tType]:(nat > tree @ X0 > X0 > tree @ X0 > tree @ X0)).
% 2.24/1.57 thf(func_def_14, type, bt: !>[X0: $tType]:(nat > color > color > tree @ X0 > X0 > tree @ X0 > tree @ X0)).
% 2.24/1.57 thf(func_def_15, type, rev: !>[X0: $tType]:(color > nat > tree @ X0 > tree @ X0)).
% 2.24/1.57 thf(func_def_18, type, sK0: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 2.24/1.57 thf(func_def_19, type, sK1: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 2.24/1.57 thf(func_def_20, type, sK2: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 2.24/1.57 thf(func_def_21, type, sK3: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 2.24/1.57 thf(func_def_22, type, sK4: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 2.24/1.57 thf(func_def_23, type, sK6: sK5 > sK5 > $o).
% 2.24/1.57 thf(func_def_24, type, sK7: sK5).
% 2.24/1.57 thf(func_def_25, type, sK8: nat).
% 2.24/1.57 thf(func_def_26, type, sK9: color).
% 2.24/1.57 thf(func_def_27, type, sK10: color).
% 2.24/1.57 thf(func_def_28, type, sK11: tree @ sK5).
% 2.24/1.57 thf(func_def_29, type, sK12: tree @ sK5).
% 2.24/1.57 thf(func_def_31, type, ph14: !>[X0: $tType]:(X0)).
% 2.24/1.57 thf(f269,plain,(
% 2.24/1.57 $false),
% 2.24/1.57 inference(avatar_sat_refutation,[status(thm)],[f105,f114,f246,f267])).
% 2.24/1.57 thf(f267,plain,(
% 2.24/1.57 spl13_6),
% 2.24/1.57 inference(avatar_contradiction_clause,[status(thm)],[f266])).
% 2.24/1.57 thf(f266,plain,(
% 2.24/1.57 $false | spl13_6),
% 2.24/1.57 inference(subsumption_resolution,[status(thm)],[f265,f84])).
% 2.24/1.57 thf(f84,plain,(
% 2.24/1.57 ($true = (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12))),
% 2.24/1.57 inference(cnf_transformation,[status(thm)],[f71])).
% 2.24/1.57 thf(f71,plain,(
% 2.24/1.57 ($true = (isPer @ sK5 @ sK6)) & (($true = (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) & ($true = (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) & ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) & ($true = (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) & ($true = (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)))),
% 2.24/1.57 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9,sK10,sK11,sK12])],[f53,f70,f69])).
% 2.24/1.57 thf(f69,plain,(
% 2.24/1.57 ? [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 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6)) & ($true = (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6)) & ($true != (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) & ($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7)) & ($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)))) => (($true = (isPer @ sK5 @ sK6)) & ? [X7 : tree @ sK5,X6 : tree @ sK5,X5 : color,X4 : color,X3 : nat,X2 : sK5] : (($true = (treeStar @ sK5 @ sK6 @ X4 @ X3 @ (rev @ sK5 @ X4 @ X3 @ (rev @ sK5 @ X4 @ X3 @ X6)) @ X6)) & ($true = (treeStar @ sK5 @ sK6 @ X4 @ X3 @ X6 @ X6)) & ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ X3) @ (rev @ sK5 @ black @ (suc @ X3) @ (rev @ sK5 @ black @ (suc @ X3) @ (bt @ sK5 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (bt @ sK5 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) & ($true = (treeStar @ sK5 @ sK6 @ X5 @ X3 @ (rev @ sK5 @ X5 @ X3 @ (rev @ sK5 @ X5 @ X3 @ X7)) @ X7)) & ($true = (treeStar @ sK5 @ sK6 @ X5 @ X3 @ X7 @ X7))))),
% 2.24/1.58 introduced(definition,[],[choice_axiom])).
% 2.24/1.58 thf(f70,plain,(
% 2.24/1.58 ? [X7 : tree @ sK5,X6 : tree @ sK5,X5 : color,X4 : color,X3 : nat,X2 : sK5] : (($true = (treeStar @ sK5 @ sK6 @ X4 @ X3 @ (rev @ sK5 @ X4 @ X3 @ (rev @ sK5 @ X4 @ X3 @ X6)) @ X6)) & ($true = (treeStar @ sK5 @ sK6 @ X4 @ X3 @ X6 @ X6)) & ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ X3) @ (rev @ sK5 @ black @ (suc @ X3) @ (rev @ sK5 @ black @ (suc @ X3) @ (bt @ sK5 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (bt @ sK5 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) & ($true = (treeStar @ sK5 @ sK6 @ X5 @ X3 @ (rev @ sK5 @ X5 @ X3 @ (rev @ sK5 @ X5 @ X3 @ X7)) @ X7)) & ($true = (treeStar @ sK5 @ sK6 @ X5 @ X3 @ X7 @ X7))) => (($true = (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) & ($true = (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) & ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) & ($true = (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) & ($true = (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)))),
% 2.24/1.58 introduced(definition,[],[choice_axiom])).
% 2.24/1.58 thf(f53,plain,(
% 2.24/1.58 ? [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 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6)) & ($true = (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6)) & ($true != (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) & ($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7)) & ($true = (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7))))),
% 2.24/1.58 inference(flattening,[status(thm)],[f52])).
% 2.24/1.58 thf(f52,plain,(
% 2.24/1.58 ? [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) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ 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))) & ($true = (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6))) & ((isPer @ X0 @ X1) = $true))),
% 2.24/1.58 inference(ennf_transformation,[status(thm)],[f39])).
% 2.24/1.58 thf(f39,plain,(
% 2.24/1.58 ~! [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 @ X4 @ X3 @ X6 @ X6)) => (($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) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))))))))),
% 2.24/1.58 inference(fool_elimination,[status(thm)],[f38])).
% 2.24/1.58 thf(f38,plain,(
% 2.24/1.58 ~! [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) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7)))))))),
% 2.24/1.58 inference(rectify,[status(thm)],[f16])).
% 2.24/1.58 thf(f16,negated_conjecture,(
% 2.24/1.58 ~! [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) @ (rev @ X0 @ black @ (suc @ X9) @ (bt @ X0 @ X9 @ X16 @ X17 @ X18 @ X2 @ X19))) @ (bt @ X0 @ X9 @ X16 @ X17 @ X18 @ X2 @ X19)))))))),
% 2.24/1.58 inference(negated_conjecture,[status(cth)],[f15])).
% 2.24/1.58 thf(f15,conjecture,(
% 2.24/1.58 ! [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) @ (rev @ X0 @ black @ (suc @ X9) @ (bt @ X0 @ X9 @ X16 @ X17 @ X18 @ X2 @ X19))) @ (bt @ X0 @ X9 @ X16 @ X17 @ X18 @ X2 @ X19)))))))),
% 2.24/1.58 file('/export/starexec/sandbox2/tmp/tmp.0VWROT94jV/DTF2THF_8336.p',bt_step)).
% 2.24/1.58 thf(f265,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | spl13_6),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f264,f85])).
% 2.24/1.58 thf(f85,plain,(
% 2.24/1.58 ($true = (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12))),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f71])).
% 2.24/1.58 thf(f264,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | spl13_6),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f263,f87])).
% 2.24/1.58 thf(f87,plain,(
% 2.24/1.58 ($true = (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11))),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f71])).
% 2.24/1.58 thf(f263,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | spl13_6),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f262,f88])).
% 2.24/1.58 thf(f88,plain,(
% 2.24/1.58 ($true = (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11))),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f71])).
% 2.24/1.58 thf(f262,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | spl13_6),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f254,f89])).
% 2.24/1.58 thf(f89,plain,(
% 2.24/1.58 ($true = (isPer @ sK5 @ sK6))),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f71])).
% 2.24/1.58 thf(f254,plain,(
% 2.24/1.58 ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | spl13_6),
% 2.24/1.58 inference(trivial_inequality_removal,[status(thm)],[f249])).
% 2.24/1.58 thf(f249,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ($true != $true) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | spl13_6),
% 2.24/1.58 inference(superposition,[status(thm)],[f239,f83])).
% 2.24/1.58 thf(f83,plain,(
% 2.24/1.58 ( ! [X0 : $tType,X2 : X0,X3 : nat,X1 : X0 > X0 > $o,X6 : tree @ X0,X7 : tree @ X0,X4 : color,X5 : color] : (($true = (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7)) | ((isPer @ X0 @ X1) != $true) | ($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6)) | ($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6)) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7))) )),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f60])).
% 2.24/1.58 thf(f60,plain,(
% 2.24/1.58 ! [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) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ 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 @ X4 @ X3 @ X6 @ X6))) | ((isPer @ X0 @ X1) != $true))),
% 2.24/1.58 inference(flattening,[status(thm)],[f59])).
% 2.24/1.58 thf(f59,plain,(
% 2.24/1.58 ! [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) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ 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))) | ($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6))) | ((isPer @ X0 @ X1) != $true))),
% 2.24/1.58 inference(ennf_transformation,[status(thm)],[f45])).
% 2.24/1.58 thf(f45,plain,(
% 2.24/1.58 ! [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 @ X4 @ X3 @ X6 @ X6)) => (($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) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))))))))),
% 2.24/1.58 inference(fool_elimination,[status(thm)],[f44])).
% 2.24/1.58 thf(f44,plain,(
% 2.24/1.58 ! [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) @ (bt @ X0 @ X3 @ X4 @ X5 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X2 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7))) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7)))))))),
% 2.24/1.58 inference(rectify,[status(thm)],[f14])).
% 2.24/1.58 thf(f14,axiom,(
% 2.24/1.58 ! [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) @ (bt @ X0 @ X9 @ X16 @ X17 @ (rev @ X0 @ X16 @ X9 @ (rev @ X0 @ X16 @ X9 @ X18)) @ X2 @ (rev @ X0 @ X17 @ X9 @ (rev @ X0 @ X17 @ X9 @ X19))) @ (bt @ X0 @ X9 @ X16 @ X17 @ X18 @ X2 @ X19)))))))),
% 2.24/1.58 file('/export/starexec/sandbox2/tmp/tmp.0VWROT94jV/DTF2THF_8336.p',third_step)).
% 2.24/1.58 thf(f239,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | spl13_6),
% 2.24/1.58 inference(avatar_component_clause,[status(thm)],[f237])).
% 2.24/1.58 thf(f237,definition,(
% 2.24/1.58 spl13_6 <=> ($true = (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12)))),
% 2.24/1.58 introduced(definition,[new_symbols(naming,[spl13_6])],[avatar_definition])).
% 2.24/1.58 thf(f246,plain,(
% 2.24/1.58 ~spl13_6 | ~spl13_1 | ~spl13_2),
% 2.24/1.58 inference(avatar_split_clause,[status(thm)],[f245,f102,f99,f237])).
% 2.24/1.58 thf(f99,definition,(
% 2.24/1.58 spl13_1 <=> ! [X0 : tree @ sK5] : (($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ X0 @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) @ X0)))),
% 2.24/1.58 introduced(definition,[new_symbols(naming,[spl13_1])],[avatar_definition])).
% 2.24/1.58 thf(f102,definition,(
% 2.24/1.58 spl13_2 <=> ($true = (isPer @ tree @ sK5 @ (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8))))),
% 2.24/1.58 introduced(definition,[new_symbols(naming,[spl13_2])],[avatar_definition])).
% 2.24/1.58 thf(f245,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | (~spl13_1 | ~spl13_2)),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f244,f87])).
% 2.24/1.58 thf(f244,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | (~spl13_1 | ~spl13_2)),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f243,f89])).
% 2.24/1.58 thf(f243,plain,(
% 2.24/1.58 ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | (~spl13_1 | ~spl13_2)),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f242,f85])).
% 2.24/1.58 thf(f242,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | (~spl13_1 | ~spl13_2)),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f241,f84])).
% 2.24/1.58 thf(f241,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (isPer @ sK5 @ sK6)) | (~spl13_1 | ~spl13_2)),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f223,f88])).
% 2.24/1.58 thf(f223,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | (~spl13_1 | ~spl13_2)),
% 2.24/1.58 inference(trivial_inequality_removal,[status(thm)],[f216])).
% 2.24/1.58 thf(f216,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK7 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != $true) | ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | (~spl13_1 | ~spl13_2)),
% 2.24/1.58 inference(superposition,[status(thm)],[f141,f90])).
% 2.24/1.58 thf(f90,plain,(
% 2.24/1.58 ( ! [X0 : $tType,X2 : X0,X3 : nat,X1 : X0 > X0 > $o,X6 : tree @ X0,X7 : tree @ X0,X4 : color,X5 : color] : (($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 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6)) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)) | ($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6)) | ((isPer @ X0 @ X1) != $true) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7))) )),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f50])).
% 2.24/1.58 thf(f50,plain,(
% 2.24/1.58 ! [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 @ X4 @ X3 @ X6 @ X6)) | ($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))) | ((isPer @ X0 @ X1) != $true))),
% 2.24/1.58 inference(flattening,[status(thm)],[f49])).
% 2.24/1.58 thf(f49,plain,(
% 2.24/1.58 ! [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))) | ($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6))) | ((isPer @ X0 @ X1) != $true))),
% 2.24/1.58 inference(ennf_transformation,[status(thm)],[f35])).
% 2.24/1.58 thf(f35,plain,(
% 2.24/1.58 ! [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 @ X4 @ X3 @ X6 @ X6)) => (($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))))))))))),
% 2.24/1.58 inference(fool_elimination,[status(thm)],[f34])).
% 2.24/1.58 thf(f34,plain,(
% 2.24/1.58 ! [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)))))))))),
% 2.24/1.58 inference(rectify,[status(thm)],[f13])).
% 2.24/1.58 thf(f13,axiom,(
% 2.24/1.58 ! [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)))))))))),
% 2.24/1.58 file('/export/starexec/sandbox2/tmp/tmp.0VWROT94jV/DTF2THF_8336.p',second_step)).
% 2.24/1.58 thf(f141,plain,(
% 2.24/1.58 ( ! [X0 : tree @ sK5] : (($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ X0)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ X0 @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12)))) ) | (~spl13_1 | ~spl13_2)),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f138,f103])).
% 2.24/1.58 thf(f103,plain,(
% 2.24/1.58 ($true = (isPer @ tree @ sK5 @ (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8)))) | ~spl13_2),
% 2.24/1.58 inference(avatar_component_clause,[status(thm)],[f102])).
% 2.24/1.58 thf(f138,plain,(
% 2.24/1.58 ( ! [X0 : tree @ sK5] : (($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ X0 @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (isPer @ tree @ sK5 @ (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8)))) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ X0))) ) | ~spl13_1),
% 2.24/1.58 inference(trivial_inequality_removal,[status(thm)],[f136])).
% 2.24/1.58 thf(f136,plain,(
% 2.24/1.58 ( ! [X0 : tree @ sK5] : (($true != $true) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ X0)) | ($true != (isPer @ tree @ sK5 @ (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8)))) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ X0 @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12)))) ) | ~spl13_1),
% 2.24/1.58 inference(superposition,[status(thm)],[f135,f79])).
% 2.24/1.58 thf(f79,plain,(
% 2.24/1.58 ( ! [X0 : $tType,X1 : X0 > X0 > $o,X6 : X0,X4 : X0,X5 : X0] : (($true = (X1 @ X4 @ X6)) | ($true != (X1 @ X4 @ X5)) | ((isPer @ X0 @ X1) != $true) | ($true != (X1 @ X5 @ X6))) )),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f68])).
% 2.24/1.58 thf(f68,plain,(
% 2.24/1.58 ! [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 @ X6)) | ($true != (X1 @ X4 @ X5)) | ($true != (X1 @ X5 @ X6)))) | ((isPer @ X0 @ X1) != $true)) & (((isPer @ X0 @ X1) = $true) | (($true = (X1 @ (sK0 @ X0 @ X1) @ (sK1 @ X0 @ X1))) & ($true != (X1 @ (sK1 @ X0 @ X1) @ (sK0 @ X0 @ X1)))) | (($true != (X1 @ (sK2 @ X0 @ X1) @ (sK4 @ X0 @ X1))) & ($true = (X1 @ (sK2 @ X0 @ X1) @ (sK3 @ X0 @ X1))) & ($true = (X1 @ (sK3 @ X0 @ X1) @ (sK4 @ X0 @ X1))))))),
% 2.24/1.58 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f65,f67,f66])).
% 2.24/1.58 thf(f66,plain,(
% 2.24/1.58 ! [X0 : $tType,X1 : X0 > X0 > $o] : (? [X7 : X0,X8 : X0] : (($true = (X1 @ X7 @ X8)) & ($true != (X1 @ X8 @ X7))) => (($true = (X1 @ (sK0 @ X0 @ X1) @ (sK1 @ X0 @ X1))) & ($true != (X1 @ (sK1 @ X0 @ X1) @ (sK0 @ X0 @ X1)))))),
% 2.24/1.58 introduced(definition,[],[choice_axiom])).
% 2.24/1.58 thf(f67,plain,(
% 2.24/1.58 ! [X0 : $tType,X1 : X0 > X0 > $o] : (? [X9 : X0,X10 : X0,X11 : X0] : (($true != (X1 @ X9 @ X11)) & ($true = (X1 @ X9 @ X10)) & ($true = (X1 @ X10 @ X11))) => (($true != (X1 @ (sK2 @ X0 @ X1) @ (sK4 @ X0 @ X1))) & ($true = (X1 @ (sK2 @ X0 @ X1) @ (sK3 @ X0 @ X1))) & ($true = (X1 @ (sK3 @ X0 @ X1) @ (sK4 @ X0 @ X1)))))),
% 2.24/1.58 introduced(definition,[],[choice_axiom])).
% 2.24/1.58 thf(f65,plain,(
% 2.24/1.58 ! [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 @ X6)) | ($true != (X1 @ X4 @ X5)) | ($true != (X1 @ X5 @ X6)))) | ((isPer @ X0 @ X1) != $true)) & (((isPer @ X0 @ X1) = $true) | ? [X7 : X0,X8 : X0] : (($true = (X1 @ X7 @ X8)) & ($true != (X1 @ X8 @ X7))) | ? [X9 : X0,X10 : X0,X11 : X0] : (($true != (X1 @ X9 @ X11)) & ($true = (X1 @ X9 @ X10)) & ($true = (X1 @ X10 @ X11)))))),
% 2.24/1.58 inference(rectify,[status(thm)],[f64])).
% 2.24/1.58 thf(f64,plain,(
% 2.24/1.58 ! [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 @ X6)) | ($true != (X1 @ X4 @ X5)) | ($true != (X1 @ X5 @ X6)))) | ((isPer @ X0 @ X1) != $true)) & (((isPer @ X0 @ X1) = $true) | ? [X2 : X0,X3 : X0] : (((X1 @ X2 @ X3) = $true) & ((X1 @ X3 @ X2) != $true)) | ? [X4 : X0,X5 : X0,X6 : X0] : (($true != (X1 @ X4 @ X6)) & ($true = (X1 @ X4 @ X5)) & ($true = (X1 @ X5 @ X6)))))),
% 2.24/1.58 inference(flattening,[status(thm)],[f63])).
% 2.24/1.58 thf(f63,plain,(
% 2.24/1.58 ! [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 @ X6)) | ($true != (X1 @ X4 @ X5)) | ($true != (X1 @ X5 @ X6)))) | ((isPer @ X0 @ X1) != $true)) & (((isPer @ X0 @ X1) = $true) | (? [X2 : X0,X3 : X0] : (((X1 @ X2 @ X3) = $true) & ((X1 @ X3 @ X2) != $true)) | ? [X4 : X0,X5 : X0,X6 : X0] : (($true != (X1 @ X4 @ X6)) & ($true = (X1 @ X4 @ X5)) & ($true = (X1 @ X5 @ X6))))))),
% 2.24/1.58 inference(nnf_transformation,[status(thm)],[f55])).
% 2.24/1.58 thf(f55,plain,(
% 2.24/1.58 ! [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 @ X6)) | ($true != (X1 @ X4 @ X5)) | ($true != (X1 @ X5 @ X6)))) <=> ((isPer @ X0 @ X1) = $true))),
% 2.24/1.58 inference(flattening,[status(thm)],[f54])).
% 2.24/1.58 thf(f54,plain,(
% 2.24/1.58 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X4 : X0,X5 : X0,X6 : X0] : ((($true = (X1 @ X4 @ X6)) | ($true != (X1 @ X5 @ X6))) | ($true != (X1 @ X4 @ X5))) & ! [X2 : X0,X3 : X0] : (((X1 @ X2 @ X3) != $true) | ((X1 @ X3 @ X2) = $true))) <=> ((isPer @ X0 @ X1) = $true))),
% 2.24/1.58 inference(ennf_transformation,[status(thm)],[f33])).
% 2.24/1.58 thf(f33,plain,(
% 2.24/1.58 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X4 @ X5)) => (($true = (X1 @ X5 @ X6)) => ($true = (X1 @ X4 @ X6)))) & ! [X2 : X0,X3 : X0] : (((X1 @ X2 @ X3) = $true) => ((X1 @ X3 @ X2) = $true))) <=> ((isPer @ X0 @ X1) = $true))),
% 2.24/1.58 inference(fool_elimination,[status(thm)],[f32])).
% 2.24/1.58 thf(f32,plain,(
% 2.24/1.58 ! [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))),
% 2.24/1.58 inference(rectify,[status(thm)],[f1])).
% 2.24/1.58 thf(f1,axiom,(
% 2.24/1.58 ! [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))),
% 2.24/1.58 file('/export/starexec/sandbox2/tmp/tmp.0VWROT94jV/DTF2THF_8336.p',is_per)).
% 2.24/1.58 thf(f135,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ~spl13_1),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f134,f89])).
% 2.24/1.58 thf(f134,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (isPer @ sK5 @ sK6)) | ~spl13_1),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f133,f88])).
% 2.24/1.58 thf(f133,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (isPer @ sK5 @ sK6)) | ~spl13_1),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f132,f85])).
% 2.24/1.58 thf(f132,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ~spl13_1),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f131,f84])).
% 2.24/1.58 thf(f131,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ~spl13_1),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f124,f87])).
% 2.24/1.58 thf(f124,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != (isPer @ sK5 @ sK6)) | ~spl13_1),
% 2.24/1.58 inference(trivial_inequality_removal,[status(thm)],[f120])).
% 2.24/1.58 thf(f120,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ sK12 @ sK12)) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ sK11 @ sK11)) | ($true != (treeStar @ sK5 @ sK6 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ (rev @ sK5 @ sK10 @ sK8 @ sK12)) @ sK12)) | ($true != $true) | ($true != (isPer @ sK5 @ sK6)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK10 @ sK9 @ (rev @ sK5 @ sK10 @ sK8 @ sK12) @ sK7 @ (rev @ sK5 @ sK9 @ sK8 @ sK11))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (treeStar @ sK5 @ sK6 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ (rev @ sK5 @ sK9 @ sK8 @ sK11)) @ sK11)) | ~spl13_1),
% 2.24/1.58 inference(superposition,[status(thm)],[f100,f92])).
% 2.24/1.58 thf(f92,plain,(
% 2.24/1.58 ( ! [X0 : $tType,X2 : X0,X3 : nat,X1 : X0 > X0 > $o,X6 : tree @ X0,X7 : tree @ X0,X4 : color,X5 : color] : (($true = (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))))) | ($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6)) | ((isPer @ X0 @ X1) != $true) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ 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))) )),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f58])).
% 2.24/1.58 thf(f58,plain,(
% 2.24/1.58 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : X0,X3 : nat,X4 : color,X5 : color,X6 : tree @ X0,X7 : tree @ X0] : (($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ (rev @ X0 @ X4 @ X3 @ X6)) @ X6)) | ($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6)) | ($true = (treeStar @ X0 @ X1 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))))) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ X7 @ X7)) | ($true != (treeStar @ X0 @ X1 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ (rev @ X0 @ X5 @ X3 @ X7)) @ X7))) | ((isPer @ X0 @ X1) != $true))),
% 2.24/1.58 inference(flattening,[status(thm)],[f57])).
% 2.24/1.58 thf(f57,plain,(
% 2.24/1.58 ! [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) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))))) | ($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))) | ($true != (treeStar @ X0 @ X1 @ X4 @ X3 @ X6 @ X6))) | ((isPer @ X0 @ X1) != $true))),
% 2.24/1.58 inference(ennf_transformation,[status(thm)],[f43])).
% 2.24/1.58 thf(f43,plain,(
% 2.24/1.58 ! [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 @ X4 @ X3 @ X6 @ X6)) => (($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) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6))))))))))),
% 2.24/1.58 inference(fool_elimination,[status(thm)],[f42])).
% 2.24/1.58 thf(f42,plain,(
% 2.24/1.58 ! [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) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X4 @ X5 @ X6 @ X2 @ X7))) @ (rev @ X0 @ black @ (suc @ X3) @ (bt @ X0 @ X3 @ X5 @ X4 @ (rev @ X0 @ X5 @ X3 @ X7) @ X2 @ (rev @ X0 @ X4 @ X3 @ X6)))))))))),
% 2.24/1.58 inference(rectify,[status(thm)],[f12])).
% 2.24/1.58 thf(f12,axiom,(
% 2.24/1.58 ! [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) @ (rev @ X0 @ black @ (suc @ X9) @ (bt @ X0 @ X9 @ X16 @ X17 @ X18 @ X2 @ X19))) @ (rev @ X0 @ black @ (suc @ X9) @ (bt @ X0 @ X9 @ X17 @ X16 @ (rev @ X0 @ X17 @ X9 @ X19) @ X2 @ (rev @ X0 @ X16 @ X9 @ X18)))))))))),
% 2.24/1.58 file('/export/starexec/sandbox2/tmp/tmp.0VWROT94jV/DTF2THF_8336.p',first_step)).
% 2.24/1.58 thf(f100,plain,(
% 2.24/1.58 ( ! [X0 : tree @ sK5] : (($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) @ X0)) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ X0 @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12)))) ) | ~spl13_1),
% 2.24/1.58 inference(avatar_component_clause,[status(thm)],[f99])).
% 2.24/1.58 thf(f114,plain,(
% 2.24/1.58 spl13_2),
% 2.24/1.58 inference(avatar_contradiction_clause,[status(thm)],[f113])).
% 2.24/1.58 thf(f113,plain,(
% 2.24/1.58 $false | spl13_2),
% 2.24/1.58 inference(subsumption_resolution,[status(thm)],[f112,f89])).
% 2.24/1.58 thf(f112,plain,(
% 2.24/1.58 ($true != (isPer @ sK5 @ sK6)) | spl13_2),
% 2.24/1.58 inference(trivial_inequality_removal,[status(thm)],[f111])).
% 2.24/1.58 thf(f111,plain,(
% 2.24/1.58 ($true != (isPer @ sK5 @ sK6)) | ($true != $true) | spl13_2),
% 2.24/1.58 inference(superposition,[status(thm)],[f104,f91])).
% 2.24/1.58 thf(f91,plain,(
% 2.24/1.58 ( ! [X0 : $tType,X2 : color,X3 : nat,X1 : X0 > X0 > $o] : (($true = (isPer @ tree @ X0 @ (treeStar @ X0 @ X1 @ X2 @ X3))) | ((isPer @ X0 @ X1) != $true)) )),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f48])).
% 2.24/1.58 thf(f48,plain,(
% 2.24/1.58 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : color,X3 : nat] : ($true = (isPer @ tree @ X0 @ (treeStar @ X0 @ X1 @ X2 @ X3))))),
% 2.24/1.58 inference(ennf_transformation,[status(thm)],[f47])).
% 2.24/1.58 thf(f47,plain,(
% 2.24/1.58 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : color,X3 : nat] : ($true = (isPer @ tree @ X0 @ (treeStar @ X0 @ X1 @ X2 @ X3))))),
% 2.24/1.58 inference(fool_elimination,[status(thm)],[f46])).
% 2.24/1.58 thf(f46,plain,(
% 2.24/1.58 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : color,X3 : nat] : (isPer @ tree @ X0 @ (treeStar @ X0 @ X1 @ X2 @ X3)))),
% 2.24/1.58 inference(rectify,[status(thm)],[f4])).
% 2.24/1.58 thf(f4,axiom,(
% 2.24/1.58 ! [X5 : $tType,X6 : X5 > X5 > $o] : ((isPer @ X5 @ X6) => ! [X7 : color,X8 : nat] : (isPer @ tree @ X5 @ (treeStar @ X5 @ X6 @ X7 @ X8)))),
% 2.24/1.58 file('/export/starexec/sandbox2/tmp/tmp.0VWROT94jV/DTF2THF_8336.p','\'treeStar\'_is_per')).
% 2.24/1.58 thf(f104,plain,(
% 2.24/1.58 ($true != (isPer @ tree @ sK5 @ (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8)))) | spl13_2),
% 2.24/1.58 inference(avatar_component_clause,[status(thm)],[f102])).
% 2.24/1.58 thf(f105,plain,(
% 2.24/1.58 spl13_1 | ~spl13_2),
% 2.24/1.58 inference(avatar_split_clause,[status(thm)],[f97,f102,f99])).
% 2.24/1.58 thf(f97,plain,(
% 2.24/1.58 ( ! [X0 : tree @ sK5] : (($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ X0 @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (isPer @ tree @ sK5 @ (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8)))) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) @ X0))) )),
% 2.24/1.58 inference(trivial_inequality_removal,[status(thm)],[f94])).
% 2.24/1.58 thf(f94,plain,(
% 2.24/1.58 ( ! [X0 : tree @ sK5] : (($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ X0 @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) | ($true != (isPer @ tree @ sK5 @ (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8)))) | ($true != $true) | ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) @ X0))) )),
% 2.24/1.58 inference(superposition,[status(thm)],[f86,f79])).
% 2.24/1.58 thf(f86,plain,(
% 2.24/1.58 ($true != (treeStar @ sK5 @ sK6 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (rev @ sK5 @ black @ (suc @ sK8) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12))) @ (bt @ sK5 @ sK8 @ sK9 @ sK10 @ sK11 @ sK7 @ sK12)))),
% 2.24/1.58 inference(cnf_transformation,[status(thm)],[f71])).
% 2.24/1.58 % SZS output end Proof for DTF2THF_8336
% 2.24/1.58 % (8539)------------------------------
% 2.24/1.58 % (8539)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.24/1.58 % (8539)Termination reason: Refutation
% 2.24/1.58
% 2.24/1.58 % (8539)Memory used [KB]: 6012
% 2.24/1.58 % (8539)Time elapsed: 0.062 s
% 2.24/1.58 % (8539)Instructions burned: 110 (million)
% 2.24/1.58 % (8539)------------------------------
% 2.24/1.58 % (8539)------------------------------
% 2.24/1.58 % (8533)Success in time 0.069 s
%------------------------------------------------------------------------------