%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : DAT425^1 : TPTP v9.2.1. Released v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n011.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.94s 1.65s
% Output : Refutation 1.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : DAT425^1 : TPTP v9.2.1. Released v9.2.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.13/0.31 % Computer : n011.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 300
% 0.13/0.31 % DateTime : Tue Feb 24 06:16:32 EST 2026
% 0.13/0.31 % CPUTime :
% 0.13/0.31 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.22/0.45 ---- Original DTF file ---
% 0.22/0.45 thf(spec,logic,$$dhol).
% 0.22/0.45 %------------------------------------------------------------------------------
% 0.22/0.45 % File : DAT425^1 : TPTP v9.2.1. Released v9.2.0.
% 0.22/0.45 % Domain : Data Structures
% 0.22/0.45 % Problem : Reversal of a red-black-tree is an involution, RT leaf
% 0.22/0.45 % Version : Especial.
% 0.22/0.45 % English :
% 0.22/0.45
% 0.22/0.45 % Refs : [RRB23] Rothgang et al. (2023), Theorem Proving in Dependently
% 0.22/0.45 % : [Rot25] Rothgang (2025), Email to Geoff Sutcliffe
% 0.22/0.45 % : [RK+25] Ranalter et al. (2025), The Dependently Typed Higher-O
% 0.22/0.45 % Source : [Rot25]
% 0.22/0.45 % Names : RedBlackTree/rbt-rev-invol-base-RTLeaf.p [Rot25]
% 0.22/0.45
% 0.22/0.45 % Status : Theorem
% 0.22/0.45 % Rating : ? v9.2.0
% 0.22/0.45 % Syntax : Number of formulae : 22 ( 7 unt; 11 typ; 0 def)
% 0.22/0.45 % Number of atoms : 19 ( 19 equ; 0 cnn)
% 0.22/0.45 % Maximal formula atoms : 6 ( 1 avg)
% 0.22/0.45 % Number of connectives : 201 ( 7 ~; 2 |; 6 &; 182 @)
% 0.22/0.45 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.22/0.45 % Maximal formula depth : 14 ( 6 avg)
% 0.22/0.45 % Number of types : 3 ( 2 usr)
% 0.22/0.45 % Number of type decls : 11 ( 4 !>P; 3 !>D)
% 0.22/0.45 % Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% 0.22/0.45 % Number of symbols : 10 ( 9 usr; 3 con; 0-7 aty)
% 0.22/0.45 % Number of variables : 54 ( 0 ^; 29 !; 15 ?; 54 :)
% 0.22/0.45 % ( 10 !>; 0 ?*; 0 @-; 0 @+)
% 0.22/0.45 % SPC : DH1_THM_EQU_NAR
% 0.22/0.45
% 0.22/0.45 % Comments :
% 0.22/0.45 %------------------------------------------------------------------------------
% 0.22/0.45 thf(color_type,type,
% 0.22/0.45 color: $tType ).
% 0.22/0.45
% 0.22/0.45 thf(black_type,type,
% 0.22/0.45 black: color ).
% 0.22/0.45
% 0.22/0.45 thf(red_type,type,
% 0.22/0.45 red: color ).
% 0.22/0.45
% 0.22/0.45 thf(red_black,axiom,
% 0.22/0.45 ! [C: color] :
% 0.22/0.45 ( ( ( C = red )
% 0.22/0.45 & ( C != black ) )
% 0.22/0.45 | ( ( C != red )
% 0.22/0.45 & ( C = black ) ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(nat_type,type,
% 0.22/0.45 nat: $tType ).
% 0.22/0.45
% 0.22/0.45 thf(zero_type,type,
% 0.22/0.45 zero: nat ).
% 0.22/0.45
% 0.22/0.45 thf(suc_type,type,
% 0.22/0.45 suc: nat > nat ).
% 0.22/0.45
% 0.22/0.45 thf(peano1,axiom,
% 0.22/0.45 ! [N: nat] :
% 0.22/0.45 ( ( suc @ N )
% 0.22/0.45 != zero ) ).
% 0.22/0.45
% 0.22/0.45 thf(peano2,axiom,
% 0.22/0.45 ! [N: nat,M: nat] :
% 0.22/0.45 ( ( N != M )
% 0.22/0.45 => ( ( suc @ N )
% 0.22/0.45 != ( suc @ M ) ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(peano3,axiom,
% 0.22/0.45 ! [P: nat > $o] :
% 0.22/0.45 ( ( P @ zero )
% 0.22/0.45 => ( ! [M: nat] :
% 0.22/0.45 ( ( P @ M )
% 0.22/0.45 => ( P @ ( suc @ M ) ) )
% 0.22/0.45 => ! [N: nat] : ( P @ N ) ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(tree_type,type,
% 0.22/0.45 tree: $tType > color > nat > $tType ).
% 0.22/0.45
% 0.22/0.45 thf(leaf_type,type,
% 0.22/0.45 leaf:
% 0.22/0.45 !>[A: $tType] : ( tree @ A @ black @ zero ) ).
% 0.22/0.45
% 0.22/0.45 thf(redTree_type,type,
% 0.22/0.45 rt:
% 0.22/0.45 !>[A: $tType,N: nat] : ( ( tree @ A @ black @ N ) > A > ( tree @ A @ black @ N ) > ( tree @ A @ red @ N ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(rt_cons,axiom,
% 0.22/0.45 ! [A: $tType,N: nat,T: tree @ A @ red @ N] :
% 0.22/0.45 ? [X: A,T1: tree @ A @ black @ N,T2: tree @ A @ black @ N] :
% 0.22/0.45 ( T
% 0.22/0.45 = ( rt @ A @ N @ T1 @ X @ T2 ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(blackTree_type,type,
% 0.22/0.45 bt:
% 0.22/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.22/0.45
% 0.22/0.45 thf(bt_cons,axiom,
% 0.22/0.45 ! [A: $tType,N: nat,T: tree @ A @ black @ N] :
% 0.22/0.45 ( ( ( T
% 0.22/0.45 != ( leaf @ A ) )
% 0.22/0.45 & ? [X: A,M: nat,C1: color,C2: color,T1: tree @ A @ C1 @ M,T2: tree @ A @ C2 @ M] :
% 0.22/0.45 ( ( N
% 0.22/0.45 = ( suc @ M ) )
% 0.22/0.45 & ( T
% 0.22/0.45 = ( bt @ A @ M @ C1 @ C2 @ T1 @ X @ T2 ) ) ) )
% 0.22/0.45 | ( ( T
% 0.22/0.45 = ( leaf @ A ) )
% 0.22/0.45 & ~ ? [X: A,M: nat,C1: color,C2: color,T1: tree @ A @ C1 @ M,T2: tree @ A @ C2 @ M] :
% 0.22/0.45 ( ( N
% 0.22/0.45 = ( suc @ M ) )
% 0.22/0.45 & ( T
% 0.22/0.45 = ( bt @ A @ M @ C1 @ C2 @ T1 @ X @ T2 ) ) ) ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(rbt_rev,type,
% 0.22/0.45 rev:
% 0.22/0.45 !>[A: $tType,C: color,N: nat] : ( ( tree @ A @ C @ N ) > ( tree @ A @ C @ N ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(rev_leaf,axiom,
% 0.22/0.45 ! [A: $tType] :
% 0.22/0.45 ( ( rev @ A @ black @ zero @ ( leaf @ A ) )
% 0.22/0.45 = ( leaf @ A ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(rev_bt,axiom,
% 0.22/0.45 ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
% 0.22/0.45 ( ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) )
% 0.22/0.45 = ( bt @ A @ N @ C1 @ C2 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(rev_rt,axiom,
% 0.22/0.45 ! [A: $tType,X: A,N: nat,T1: tree @ A @ black @ N,T2: tree @ A @ black @ N] :
% 0.22/0.45 ( ( rev @ A @ red @ N @ ( rt @ A @ N @ T1 @ X @ T2 ) )
% 0.22/0.45 = ( rt @ A @ N @ ( rev @ A @ black @ N @ T2 ) @ X @ ( rev @ A @ black @ N @ T1 ) ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(bt_base,axiom,
% 0.22/0.45 ! [A: $tType] :
% 0.22/0.45 ( ( rev @ A @ black @ zero @ ( rev @ A @ black @ zero @ ( leaf @ A ) ) )
% 0.22/0.45 = ( leaf @ A ) ) ).
% 0.22/0.45
% 0.22/0.45 thf(rt_base,conjecture,
% 0.22/0.45 ! [A: $tType,X: A] :
% 0.22/0.45 ( ( rev @ A @ red @ zero @ ( rev @ A @ red @ zero @ ( rt @ A @ zero @ ( leaf @ A ) @ X @ ( leaf @ A ) ) ) )
% 0.22/0.45 = ( rt @ A @ zero @ ( leaf @ A ) @ X @ ( leaf @ A ) ) ) ).
% 0.22/0.45
% 0.22/0.45 %------------------------------------------------------------------------------
% 0.22/0.45 ------------------------
% 1.84/1.34 ---- Embedded in THF ---
% 1.84/1.34 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.84/1.34 %%% Generated on Tue Feb 24 06:16:33 EST 2026
% 1.84/1.34 %%% using '$$dhol' embedding, version 1.3.0.
% 1.84/1.34 %%% Logic specification used:
% 1.84/1.34 %%% thf(spec, logic, $$dhol).
% 1.84/1.34
% 1.84/1.34 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2DTF10659.p
% 1.84/1.34 thf(is_per_type, type, isPer: (!> [A:$tType]: (((A > (A > $o)) > $o)))).
% 1.84/1.34 thf(is_per, definition, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) <=> ((! [X:A,Y:A]: ((((AStar @ X) @ Y) => ((AStar @ Y) @ X)))) & (! [X:A,Y:A,Z:A]: ((((AStar @ X) @ Y) => (((AStar @ Y) @ Z) => ((AStar @ X) @ Z)))))))))).
% 1.84/1.34 thf(color_type, type, color: $tType).
% 1.84/1.34 thf(colorStar, type, 'colorStar': (color > (color > $o))).
% 1.84/1.34 thf(colorStar_is_eq, axiom, (! [X:color,Y:color]: (((('colorStar' @ X) @ Y) <=> (X = Y))))).
% 1.84/1.34 thf(black_type, type, black: color).
% 1.84/1.34 thf(red_type, type, red: color).
% 1.84/1.34 thf(nat_type, type, nat: $tType).
% 1.84/1.34 thf(natStar, type, 'natStar': (nat > (nat > $o))).
% 1.84/1.34 thf(natStar_is_eq, axiom, (! [X:nat,Y:nat]: (((('natStar' @ X) @ Y) <=> (X = Y))))).
% 1.84/1.35 thf(zero_type, type, zero: nat).
% 1.84/1.35 thf(suc_type, type, suc: (nat > nat)).
% 1.84/1.35 thf(tree_type, type, tree: ($tType > $tType)).
% 1.84/1.35 thf(treeStar, type, 'treeStar': (!> [A:$tType]: (((A > (A > $o)) > (color > (nat > ((tree @ A) > ((tree @ A) > $o)))))))).
% 1.84/1.35 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.84/1.35 thf(leaf_type, type, leaf: (!> [A:$tType]: ((tree @ A)))).
% 1.84/1.35 thf(leaf_tp_ax, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => ((((((treeStar @ A) @ AStar) @ black) @ zero) @ (leaf @ A)) @ (leaf @ A)))))).
% 1.84/1.35 thf(redTree_type, type, rt: (!> [A:$tType]: ((nat > ((tree @ A) > (A > ((tree @ A) > (tree @ A)))))))).
% 1.84/1.35 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.84/1.35 thf(blackTree_type, type, bt: (!> [A:$tType]: ((nat > (color > (color > ((tree @ A) > (A > ((tree @ A) > (tree @ A)))))))))).
% 1.84/1.35 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.84/1.35 thf(rbt_rev, type, rev: (!> [A:$tType]: ((color > (nat > ((tree @ A) > (tree @ A))))))).
% 1.84/1.35 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.84/1.35 thf(red_black, axiom, (! [C:color]: ((((C = red) & (C != black)) | ((C != red) & (C = black)))))).
% 1.84/1.35 thf(peano1, axiom, (! [N:nat]: (((suc @ N) != zero)))).
% 1.84/1.35 thf(peano2, axiom, (! [N:nat]: ((! [M:nat]: (((N != M) => ((suc @ N) != (suc @ M)))))))).
% 1.84/1.35 thf(peano3, axiom, (! [P:(nat > $o)]: (((P @ zero) => ((! [M:nat]: (((P @ M) => (P @ (suc @ M))))) => (! [N:nat]: ((P @ N)))))))).
% 1.84/1.35 thf(rt_cons, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [T:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ red) @ N) @ T) @ T) => (? [X:A]: ((? [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) @ T) @ (((((rt @ A) @ N) @ T1) @ X) @ T2))))))))))))))))).
% 1.84/1.35 thf(bt_cons, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [N:nat]: ((! [T:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ black) @ N) @ T) @ T) => (((~ (((((((treeStar @ A) @ AStar) @ black) @ N) @ T) @ (leaf @ A)))) & (? [X:A]: ((? [M:nat]: ((? [C1:color]: ((? [C2:color]: ((? [T1:(tree @ A),T2:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ C1) @ M) @ T1) @ T1) & (((((((treeStar @ A) @ AStar) @ C2) @ M) @ T2) @ T2) & ((N = (suc @ M)) & ((((((treeStar @ A) @ AStar) @ black) @ N) @ T) @ (((((((bt @ A) @ M) @ C1) @ C2) @ T1) @ X) @ T2)))))))))))))))) | (((((((treeStar @ A) @ AStar) @ black) @ N) @ T) @ (leaf @ A)) & (~ ((? [X:A]: ((? [M:nat]: ((? [C1:color]: ((? [C2:color]: ((? [T1:(tree @ A),T2:(tree @ A)]: ((((((((treeStar @ A) @ AStar) @ C1) @ M) @ T1) @ T1) & (((((((treeStar @ A) @ AStar) @ C2) @ M) @ T2) @ T2) & ((N = (suc @ M)) & ((((((treeStar @ A) @ AStar) @ black) @ N) @ T) @ (((((((bt @ A) @ M) @ C1) @ C2) @ T1) @ X) @ T2)))))))))))))))))))))))))))).
% 1.84/1.35 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.84/1.35 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) @ C1) @ C2) @ ((((rev @ A) @ C2) @ N) @ T2)) @ X) @ ((((rev @ A) @ C1) @ N) @ T1))))))))))))))))))).
% 1.84/1.35 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) @ T1))))))))))))))).
% 1.84/1.35 thf(bt_base, axiom, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => ((((((treeStar @ A) @ AStar) @ black) @ zero) @ ((((rev @ A) @ black) @ zero) @ ((((rev @ A) @ black) @ zero) @ (leaf @ A)))) @ (leaf @ A)))))).
% 1.84/1.35 thf(rt_base, conjecture, (! [A:$tType,AStar:(A > (A > $o))]: ((((isPer @ A) @ AStar) => (! [X:A]: (((((((treeStar @ A) @ AStar) @ red) @ zero) @ ((((rev @ A) @ red) @ zero) @ ((((rev @ A) @ red) @ zero) @ (((((rt @ A) @ zero) @ (leaf @ A)) @ X) @ (leaf @ A))))) @ (((((rt @ A) @ zero) @ (leaf @ A)) @ X) @ (leaf @ A))))))))).
% 1.84/1.35 % SZS output end ListOfTHF for /export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2DTF10659.p
% 1.84/1.35 ------------------------
% 1.84/1.36 ---- Cleaned THF ---
% 1.84/1.36 thf(is_per_type,type,
% 1.84/1.36 isPer:
% 1.84/1.36 !>[A: $tType] : ( ( A > A > $o ) > $o ) ).
% 1.84/1.36
% 1.84/1.36 thf(is_per,definition,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 <=> ( ! [X: A,Y: A] :
% 1.84/1.36 ( ( AStar @ X @ Y )
% 1.84/1.36 => ( AStar @ Y @ X ) )
% 1.84/1.36 & ! [X: A,Y: A,Z: A] :
% 1.84/1.36 ( ( AStar @ X @ Y )
% 1.84/1.36 => ( ( AStar @ Y @ Z )
% 1.84/1.36 => ( AStar @ X @ Z ) ) ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(color_type,type,
% 1.84/1.36 color: $tType ).
% 1.84/1.36
% 1.84/1.36 thf(colorStar,type,
% 1.84/1.36 colorStar: color > color > $o ).
% 1.84/1.36
% 1.84/1.36 thf(colorStar_is_eq,axiom,
% 1.84/1.36 ! [X: color,Y: color] :
% 1.84/1.36 ( ( colorStar @ X @ Y )
% 1.84/1.36 <=> ( X = Y ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(black_type,type,
% 1.84/1.36 black: color ).
% 1.84/1.36
% 1.84/1.36 thf(red_type,type,
% 1.84/1.36 red: color ).
% 1.84/1.36
% 1.84/1.36 thf(nat_type,type,
% 1.84/1.36 nat: $tType ).
% 1.84/1.36
% 1.84/1.36 thf(natStar,type,
% 1.84/1.36 natStar: nat > nat > $o ).
% 1.84/1.36
% 1.84/1.36 thf(natStar_is_eq,axiom,
% 1.84/1.36 ! [X: nat,Y: nat] :
% 1.84/1.36 ( ( natStar @ X @ Y )
% 1.84/1.36 <=> ( X = Y ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(zero_type,type,
% 1.84/1.36 zero: nat ).
% 1.84/1.36
% 1.84/1.36 thf(suc_type,type,
% 1.84/1.36 suc: nat > nat ).
% 1.84/1.36
% 1.84/1.36 thf(tree_type,type,
% 1.84/1.36 tree: $tType > $tType ).
% 1.84/1.36
% 1.84/1.36 thf(treeStar,type,
% 1.84/1.36 treeStar:
% 1.84/1.36 !>[A: $tType] : ( ( A > A > $o ) > color > nat > ( tree @ A ) > ( tree @ A ) > $o ) ).
% 1.84/1.36
% 1.84/1.36 thf('\'treeStar\'_is_per',axiom,
% 1.84/1.36 ! [B: $tType,BStar: B > B > $o] :
% 1.84/1.36 ( ( isPer @ B @ BStar )
% 1.84/1.36 => ! [C: color,C0: nat] : ( isPer @ ( tree @ B ) @ ( treeStar @ B @ BStar @ C @ C0 ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(leaf_type,type,
% 1.84/1.36 leaf:
% 1.84/1.36 !>[A: $tType] : ( tree @ A ) ).
% 1.84/1.36
% 1.84/1.36 thf(leaf_tp_ax,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ( treeStar @ A @ AStar @ black @ zero @ ( leaf @ A ) @ ( leaf @ A ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(redTree_type,type,
% 1.84/1.36 rt:
% 1.84/1.36 !>[A: $tType] : ( nat > ( tree @ A ) > A > ( tree @ A ) > ( tree @ A ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(rt_tp_ax,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ! [N: nat,D: tree @ A,D_prime: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ black @ N @ D @ D_prime )
% 1.84/1.36 => ! [D0: A,D0_prime: A] :
% 1.84/1.36 ( ( D0 = D0_prime )
% 1.84/1.36 => ! [D1: tree @ A,D1_prime: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ black @ N @ D1 @ D1_prime )
% 1.84/1.36 => ( treeStar @ A @ AStar @ red @ N @ ( rt @ A @ N @ D @ D0 @ D1 ) @ ( rt @ A @ N @ D_prime @ D0_prime @ D1_prime ) ) ) ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(blackTree_type,type,
% 1.84/1.36 bt:
% 1.84/1.36 !>[A: $tType] : ( nat > color > color > ( tree @ A ) > A > ( tree @ A ) > ( tree @ A ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(bt_tp_ax,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ! [N: nat,C1: color,C2: color,D: tree @ A,D_prime: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ C1 @ N @ D @ D_prime )
% 1.84/1.36 => ! [D0: A,D0_prime: A] :
% 1.84/1.36 ( ( D0 = D0_prime )
% 1.84/1.36 => ! [D1: tree @ A,D1_prime: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ C2 @ N @ D1 @ D1_prime )
% 1.84/1.36 => ( 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.84/1.36
% 1.84/1.36 thf(rbt_rev,type,
% 1.84/1.36 rev:
% 1.84/1.36 !>[A: $tType] : ( color > nat > ( tree @ A ) > ( tree @ A ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(rev_tp_ax,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ! [C: color,N: nat,D: tree @ A,D_prime: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ C @ N @ D @ D_prime )
% 1.84/1.36 => ( treeStar @ A @ AStar @ C @ N @ ( rev @ A @ C @ N @ D ) @ ( rev @ A @ C @ N @ D_prime ) ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(red_black,axiom,
% 1.84/1.36 ! [C: color] :
% 1.84/1.36 ( ( ( C = red )
% 1.84/1.36 & ( C != black ) )
% 1.84/1.36 | ( ( C != red )
% 1.84/1.36 & ( C = black ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(peano1,axiom,
% 1.84/1.36 ! [N: nat] :
% 1.84/1.36 ( ( suc @ N )
% 1.84/1.36 != zero ) ).
% 1.84/1.36
% 1.84/1.36 thf(peano2,axiom,
% 1.84/1.36 ! [N: nat,M: nat] :
% 1.84/1.36 ( ( N != M )
% 1.84/1.36 => ( ( suc @ N )
% 1.84/1.36 != ( suc @ M ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(peano3,axiom,
% 1.84/1.36 ! [P: nat > $o] :
% 1.84/1.36 ( ( P @ zero )
% 1.84/1.36 => ( ! [M: nat] :
% 1.84/1.36 ( ( P @ M )
% 1.84/1.36 => ( P @ ( suc @ M ) ) )
% 1.84/1.36 => ! [N: nat] : ( P @ N ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(rt_cons,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ! [N: nat,T: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ red @ N @ T @ T )
% 1.84/1.36 => ? [X: A,T1: tree @ A,T2: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ black @ N @ T1 @ T1 )
% 1.84/1.36 & ( treeStar @ A @ AStar @ black @ N @ T2 @ T2 )
% 1.84/1.36 & ( treeStar @ A @ AStar @ red @ N @ T @ ( rt @ A @ N @ T1 @ X @ T2 ) ) ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(bt_cons,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ! [N: nat,T: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ black @ N @ T @ T )
% 1.84/1.36 => ( ( ~ ( treeStar @ A @ AStar @ black @ N @ T @ ( leaf @ A ) )
% 1.84/1.36 & ? [X: A,M: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ C1 @ M @ T1 @ T1 )
% 1.84/1.36 & ( treeStar @ A @ AStar @ C2 @ M @ T2 @ T2 )
% 1.84/1.36 & ( N
% 1.84/1.36 = ( suc @ M ) )
% 1.84/1.36 & ( treeStar @ A @ AStar @ black @ N @ T @ ( bt @ A @ M @ C1 @ C2 @ T1 @ X @ T2 ) ) ) )
% 1.84/1.36 | ( ( treeStar @ A @ AStar @ black @ N @ T @ ( leaf @ A ) )
% 1.84/1.36 & ~ ? [X: A,M: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ C1 @ M @ T1 @ T1 )
% 1.84/1.36 & ( treeStar @ A @ AStar @ C2 @ M @ T2 @ T2 )
% 1.84/1.36 & ( N
% 1.84/1.36 = ( suc @ M ) )
% 1.84/1.36 & ( treeStar @ A @ AStar @ black @ N @ T @ ( bt @ A @ M @ C1 @ C2 @ T1 @ X @ T2 ) ) ) ) ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(rev_leaf,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ( treeStar @ A @ AStar @ black @ zero @ ( rev @ A @ black @ zero @ ( leaf @ A ) ) @ ( leaf @ A ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(rev_bt,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ! [X: A,N: nat,C1: color,C2: color,T1: tree @ A,T2: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ C1 @ N @ T1 @ T1 )
% 1.84/1.36 => ( ( treeStar @ A @ AStar @ C2 @ N @ T2 @ T2 )
% 1.84/1.36 => ( treeStar @ A @ AStar @ black @ ( suc @ N ) @ ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) ) @ ( bt @ A @ N @ C1 @ C2 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(rev_rt,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ! [X: A,N: nat,T1: tree @ A,T2: tree @ A] :
% 1.84/1.36 ( ( treeStar @ A @ AStar @ black @ N @ T1 @ T1 )
% 1.84/1.36 => ( ( treeStar @ A @ AStar @ black @ N @ T2 @ T2 )
% 1.84/1.36 => ( 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 @ T1 ) ) ) ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(bt_base,axiom,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ( treeStar @ A @ AStar @ black @ zero @ ( rev @ A @ black @ zero @ ( rev @ A @ black @ zero @ ( leaf @ A ) ) ) @ ( leaf @ A ) ) ) ).
% 1.84/1.36
% 1.84/1.36 thf(rt_base,conjecture,
% 1.84/1.36 ! [A: $tType,AStar: A > A > $o] :
% 1.84/1.36 ( ( isPer @ A @ AStar )
% 1.84/1.36 => ! [X: A] : ( treeStar @ A @ AStar @ red @ zero @ ( rev @ A @ red @ zero @ ( rev @ A @ red @ zero @ ( rt @ A @ zero @ ( leaf @ A ) @ X @ ( leaf @ A ) ) ) ) @ ( rt @ A @ zero @ ( leaf @ A ) @ X @ ( leaf @ A ) ) ) ) ).
% 1.84/1.36 ------------------------
% 1.84/1.38 % (10996)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_10659 for (2999ds/2Mi)
% 1.84/1.38 % (10992)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/183Mi)
% 1.84/1.38 % (10994)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_10659 for (2999ds/27Mi)
% 1.84/1.38 % Exception at run slice level
% 1.84/1.38 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.84/1.39 % (10993)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_10659 for (2999ds/4Mi)
% 1.84/1.39 % (10995)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/2Mi)
% 1.84/1.39 % (10997)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_10659 for (2999ds/275Mi)
% 1.84/1.39 % (10998)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/18Mi)
% 1.84/1.39 % (10993)Instruction limit reached!
% 1.84/1.39 % (10993)------------------------------
% 1.84/1.39 % (10993)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.84/1.39 % (10993)Termination reason: Unknown
% 1.84/1.39 % (10993)Termination phase: shuffling
% 1.84/1.39
% 1.84/1.39 % (10993)Memory used [KB]: 1023
% 1.84/1.39 % (10993)Time elapsed: 0.004 s
% 1.84/1.39 % (10993)Instructions burned: 4 (million)
% 1.84/1.39 % (10993)------------------------------
% 1.84/1.39 % (10993)------------------------------
% 1.84/1.39 % (10994)Instruction limit reached!
% 1.84/1.39 % (10994)------------------------------
% 1.84/1.39 % (10994)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.84/1.39 % (10994)Termination reason: Unknown
% 1.84/1.39 % (10994)Termination phase: Saturation
% 1.84/1.39
% 1.84/1.39 % (10994)Memory used [KB]: 5628
% 1.84/1.39 % (10994)Time elapsed: 0.010 s
% 1.84/1.39 % (10994)Instructions burned: 27 (million)
% 1.84/1.39 % (10994)------------------------------
% 1.84/1.39 % (10994)------------------------------
% 1.84/1.39 % (10995)Instruction limit reached!
% 1.84/1.39 % (10995)------------------------------
% 1.84/1.39 % (10995)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.84/1.39 % (10995)Termination reason: Unknown
% 1.84/1.39 % (10995)Termination phase: shuffling
% 1.84/1.39
% 1.84/1.39 % (10995)Memory used [KB]: 1023
% 1.84/1.39 % (10995)Time elapsed: 0.004 s
% 1.84/1.39 % (10995)Instructions burned: 3 (million)
% 1.84/1.39 % (10995)------------------------------
% 1.84/1.39 % (10995)------------------------------
% 1.84/1.39 % (10999)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/3Mi)
% 1.84/1.39 % (10999)Instruction limit reached!
% 1.84/1.39 % (10999)------------------------------
% 1.84/1.39 % (10999)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.84/1.39 % (10999)Termination reason: Unknown
% 1.84/1.39 % (10999)Termination phase: shuffling
% 1.84/1.39
% 1.84/1.39 % (10999)Memory used [KB]: 1023
% 1.84/1.39 % (10999)Time elapsed: 0.002 s
% 1.84/1.39 % (10999)Instructions burned: 4 (million)
% 1.84/1.39 % (10999)------------------------------
% 1.84/1.39 % (10999)------------------------------
% 1.94/1.40 % (10998)Instruction limit reached!
% 1.94/1.40 % (10998)------------------------------
% 1.94/1.40 % (10998)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.40 % (10998)Termination reason: Unknown
% 1.94/1.40 % (10998)Termination phase: Saturation
% 1.94/1.40
% 1.94/1.40 % (10998)Memory used [KB]: 5628
% 1.94/1.40 % (10998)Time elapsed: 0.013 s
% 1.94/1.40 % (10998)Instructions burned: 19 (million)
% 1.94/1.40 % (10998)------------------------------
% 1.94/1.40 % (10998)------------------------------
% 1.94/1.40 % (11001)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_10659 for (2999ds/15Mi)
% 1.94/1.40 % (11003)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_10659 for (2999ds/1041Mi)
% 1.94/1.40 % Exception at run slice level
% 1.94/1.40 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.40 % (11001)Instruction limit reached!
% 1.94/1.40 % (11001)------------------------------
% 1.94/1.40 % (11001)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.40 % (11001)Termination reason: Unknown
% 1.94/1.40 % (11001)Termination phase: Property scanning
% 1.94/1.40
% 1.94/1.40 % (11001)Memory used [KB]: 1151
% 1.94/1.40 % (11001)Time elapsed: 0.007 s
% 1.94/1.40 % (11001)Instructions burned: 17 (million)
% 1.94/1.40 % (11001)------------------------------
% 1.94/1.40 % (11001)------------------------------
% 1.94/1.40 % (11000)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_10659 for (2999ds/37Mi)
% 1.94/1.40 % (11002)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_10659 for (2999ds/3Mi)
% 1.94/1.41 % (11002)Instruction limit reached!
% 1.94/1.41 % (11002)------------------------------
% 1.94/1.41 % (11002)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.41 % (11002)Termination reason: Unknown
% 1.94/1.41 % (11002)Termination phase: shuffling
% 1.94/1.41
% 1.94/1.41 % (11002)Memory used [KB]: 1023
% 1.94/1.41 % (11002)Time elapsed: 0.004 s
% 1.94/1.41 % (11002)Instructions burned: 4 (million)
% 1.94/1.41 % (11002)------------------------------
% 1.94/1.41 % (11002)------------------------------
% 1.94/1.41 % Exception at run slice level
% 1.94/1.41 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.41 % (11005)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/16Mi)
% 1.94/1.41 % (11006)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_10659 for (2999ds/3Mi)
% 1.94/1.41 % (11005)Instruction limit reached!
% 1.94/1.41 % (11005)------------------------------
% 1.94/1.41 % (11005)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.41 % (11005)Termination reason: Unknown
% 1.94/1.41 % (11005)Termination phase: Property scanning
% 1.94/1.41
% 1.94/1.41 % (11005)Memory used [KB]: 1151
% 1.94/1.41 % (11005)Time elapsed: 0.006 s
% 1.94/1.41 % (11005)Instructions burned: 17 (million)
% 1.94/1.41 % (11005)------------------------------
% 1.94/1.41 % (11005)------------------------------
% 1.94/1.41 % (11006)Instruction limit reached!
% 1.94/1.41 % (11006)------------------------------
% 1.94/1.41 % (11006)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.41 % (11006)Termination reason: Unknown
% 1.94/1.41 % (11006)Termination phase: shuffling
% 1.94/1.41
% 1.94/1.41 % (11006)Memory used [KB]: 1023
% 1.94/1.41 % (11006)Time elapsed: 0.003 s
% 1.94/1.41 % (11006)Instructions burned: 4 (million)
% 1.94/1.41 % (11006)------------------------------
% 1.94/1.41 % (11006)------------------------------
% 1.94/1.41 % (11004)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/7Mi)
% 1.94/1.42 % (11004)Instruction limit reached!
% 1.94/1.42 % (11004)------------------------------
% 1.94/1.42 % (11004)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.42 % (11004)Termination reason: Unknown
% 1.94/1.42 % (11004)Termination phase: Property scanning
% 1.94/1.42
% 1.94/1.42 % (11004)Memory used [KB]: 1023
% 1.94/1.42 % (11004)Time elapsed: 0.006 s
% 1.94/1.42 % (11004)Instructions burned: 7 (million)
% 1.94/1.42 % (11004)------------------------------
% 1.94/1.42 % (11004)------------------------------
% 1.94/1.42 % (11009)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/3Mi)
% 1.94/1.42 % (11010)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/4Mi)
% 1.94/1.42 % (11009)Instruction limit reached!
% 1.94/1.42 % (11009)------------------------------
% 1.94/1.42 % (11009)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.42 % (11009)Termination reason: Unknown
% 1.94/1.42 % (11009)Termination phase: shuffling
% 1.94/1.42
% 1.94/1.42 % (11009)Memory used [KB]: 1023
% 1.94/1.42 % (11009)Time elapsed: 0.002 s
% 1.94/1.42 % (11009)Instructions burned: 4 (million)
% 1.94/1.42 % (11009)------------------------------
% 1.94/1.42 % (11009)------------------------------
% 1.94/1.42 % (11007)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_10659 for (2999ds/3Mi)
% 1.94/1.43 % (11010)Instruction limit reached!
% 1.94/1.43 % (11010)------------------------------
% 1.94/1.43 % (11010)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.43 % (11010)Termination reason: Unknown
% 1.94/1.43 % (11010)Termination phase: shuffling
% 1.94/1.43
% 1.94/1.43 % (11010)Memory used [KB]: 1023
% 1.94/1.43 % (11010)Time elapsed: 0.003 s
% 1.94/1.43 % (11010)Instructions burned: 4 (million)
% 1.94/1.43 % (11010)------------------------------
% 1.94/1.43 % (11010)------------------------------
% 1.94/1.43 % (11008)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/7Mi)
% 1.94/1.43 % (11007)Instruction limit reached!
% 1.94/1.43 % (11007)------------------------------
% 1.94/1.43 % (11007)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.43 % (11007)Termination reason: Unknown
% 1.94/1.43 % (11007)Termination phase: shuffling
% 1.94/1.43
% 1.94/1.43 % (11007)Memory used [KB]: 1023
% 1.94/1.43 % (11007)Time elapsed: 0.004 s
% 1.94/1.43 % (11007)Instructions burned: 4 (million)
% 1.94/1.43 % (11007)------------------------------
% 1.94/1.43 % (11007)------------------------------
% 1.94/1.43 % (11008)Instruction limit reached!
% 1.94/1.43 % (11008)------------------------------
% 1.94/1.43 % (11008)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.43 % (11008)Termination reason: Unknown
% 1.94/1.43 % (11008)Termination phase: Property scanning
% 1.94/1.43
% 1.94/1.43 % (11008)Memory used [KB]: 1023
% 1.94/1.43 % (11008)Time elapsed: 0.006 s
% 1.94/1.43 % (11008)Instructions burned: 7 (million)
% 1.94/1.43 % (11008)------------------------------
% 1.94/1.43 % (11008)------------------------------
% 1.94/1.43 % (11012)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/710Mi)
% 1.94/1.44 % (11013)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/6Mi)
% 1.94/1.44 % (11011)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/18Mi)
% 1.94/1.44 % (11013)Instruction limit reached!
% 1.94/1.44 % (11013)------------------------------
% 1.94/1.44 % (11013)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.44 % (11013)Termination reason: Unknown
% 1.94/1.44 % (11013)Termination phase: Property scanning
% 1.94/1.44
% 1.94/1.44 % (11013)Memory used [KB]: 1023
% 1.94/1.44 % (11013)Time elapsed: 0.004 s
% 1.94/1.44 % (11013)Instructions burned: 7 (million)
% 1.94/1.44 % (11013)------------------------------
% 1.94/1.44 % (11013)------------------------------
% 1.94/1.44 % (10992)Instruction limit reached!
% 1.94/1.44 % (10992)------------------------------
% 1.94/1.44 % (10992)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.44 % (10992)Termination reason: Unknown
% 1.94/1.44 % (10992)Termination phase: Saturation
% 1.94/1.44
% 1.94/1.44 % (10992)Memory used [KB]: 6012
% 1.94/1.44 % (10992)Time elapsed: 0.062 s
% 1.94/1.44 % (10992)Instructions burned: 183 (million)
% 1.94/1.44 % (10992)------------------------------
% 1.94/1.44 % (10992)------------------------------
% 1.94/1.44 % (11014)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_10659 for (2999ds/902Mi)
% 1.94/1.45 % (11011)Instruction limit reached!
% 1.94/1.45 % (11011)------------------------------
% 1.94/1.45 % (11011)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.45 % (11011)Termination reason: Unknown
% 1.94/1.45 % (11011)Termination phase: Saturation
% 1.94/1.45
% 1.94/1.45 % (11011)Memory used [KB]: 5628
% 1.94/1.45 % (11011)Time elapsed: 0.012 s
% 1.94/1.45 % (11011)Instructions burned: 18 (million)
% 1.94/1.45 % (11011)------------------------------
% 1.94/1.45 % (11011)------------------------------
% 1.94/1.45 % (11015)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/21Mi)
% 1.94/1.45 % (11016)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/5Mi)
% 1.94/1.45 % (11016)Instruction limit reached!
% 1.94/1.45 % (11016)------------------------------
% 1.94/1.45 % (11016)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.45 % (11016)Termination reason: Unknown
% 1.94/1.45 % (11016)Termination phase: shuffling
% 1.94/1.45
% 1.94/1.45 % (11016)Memory used [KB]: 1023
% 1.94/1.45 % (11016)Time elapsed: 0.003 s
% 1.94/1.45 % (11016)Instructions burned: 5 (million)
% 1.94/1.45 % (11016)------------------------------
% 1.94/1.45 % (11016)------------------------------
% 1.94/1.45 % (11017)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/6Mi)
% 1.94/1.45 % Exception at run slice level
% 1.94/1.45 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.46 % (11015)Instruction limit reached!
% 1.94/1.46 % (11015)------------------------------
% 1.94/1.46 % (11015)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.46 % (11015)Termination reason: Unknown
% 1.94/1.46 % (11015)Termination phase: Property scanning
% 1.94/1.46
% 1.94/1.46 % (11015)Memory used [KB]: 1151
% 1.94/1.46 % (11015)Time elapsed: 0.013 s
% 1.94/1.46 % (11015)Instructions burned: 21 (million)
% 1.94/1.46 % (11015)------------------------------
% 1.94/1.46 % (11015)------------------------------
% 1.94/1.46 % (11020)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/19Mi)
% 1.94/1.46 % (11018)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/377Mi)
% 1.94/1.46 % Exception at run slice level
% 1.94/1.46 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.47 % (11019)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/779Mi)
% 1.94/1.47 % Exception at run slice level
% 1.94/1.47 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.47 % (11022)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/17Mi)
% 1.94/1.48 % (11021)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/879Mi)
% 1.94/1.48 % (11022)Instruction limit reached!
% 1.94/1.48 % (11022)------------------------------
% 1.94/1.48 % (11022)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.48 % (11022)Termination reason: Unknown
% 1.94/1.48 % (11022)Termination phase: Saturation
% 1.94/1.48
% 1.94/1.48 % (11022)Memory used [KB]: 1151
% 1.94/1.48 % (11022)Time elapsed: 0.007 s
% 1.94/1.48 % (11022)Instructions burned: 17 (million)
% 1.94/1.48 % (11022)------------------------------
% 1.94/1.48 % (11022)------------------------------
% 1.94/1.49 % (11023)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/3Mi)
% 1.94/1.49 % (11024)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_10659 for (2999ds/30Mi)
% 1.94/1.49 % (11023)Instruction limit reached!
% 1.94/1.49 % (11023)------------------------------
% 1.94/1.49 % (11023)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.49 % (11023)Termination reason: Unknown
% 1.94/1.49 % (11023)Termination phase: shuffling
% 1.94/1.49
% 1.94/1.49 % (11023)Memory used [KB]: 1023
% 1.94/1.49 % (11023)Time elapsed: 0.004 s
% 1.94/1.49 % (11023)Instructions burned: 4 (million)
% 1.94/1.49 % (11023)------------------------------
% 1.94/1.49 % (11023)------------------------------
% 1.94/1.50 % (11024)Instruction limit reached!
% 1.94/1.50 % (11024)------------------------------
% 1.94/1.50 % (11024)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.50 % (11024)Termination reason: Unknown
% 1.94/1.50 % (11024)Termination phase: Saturation
% 1.94/1.50
% 1.94/1.50 % (11024)Memory used [KB]: 5756
% 1.94/1.50 % (11024)Time elapsed: 0.012 s
% 1.94/1.50 % (11024)Instructions burned: 33 (million)
% 1.94/1.50 % (11024)------------------------------
% 1.94/1.50 % (11024)------------------------------
% 1.94/1.51 % (11025)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_10659 for (2998ds/127Mi)
% 1.94/1.51 % (11026)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on DTF2THF_10659 for (2998ds/100Mi)
% 1.94/1.52 % (10997)Instruction limit reached!
% 1.94/1.52 % (10997)------------------------------
% 1.94/1.52 % (10997)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.52 % (10997)Termination reason: Unknown
% 1.94/1.52 % (10997)Termination phase: Saturation
% 1.94/1.52
% 1.94/1.52 % (10997)Memory used [KB]: 6140
% 1.94/1.52 % (10997)Time elapsed: 0.135 s
% 1.94/1.52 % (10997)Instructions burned: 277 (million)
% 1.94/1.52 % (10997)------------------------------
% 1.94/1.52 % (10997)------------------------------
% 1.94/1.53 % (11027)dis+10_1:1_anc=none:cnfonf=lazy_gen:fd=preordered:fe=off:hud=10:ins=3:ixr=off:nwc=5.0:plsq=on:plsqc=1:plsqr=32,1:sp=const_frequency:uhcvi=on:i=3:si=on:rtra=on_0 on DTF2THF_10659 for (2998ds/3Mi)
% 1.94/1.53 % (11027)Instruction limit reached!
% 1.94/1.53 % (11027)------------------------------
% 1.94/1.53 % (11027)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.53 % (11027)Termination reason: Unknown
% 1.94/1.53 % (11027)Termination phase: shuffling
% 1.94/1.53
% 1.94/1.53 % (11027)Memory used [KB]: 1023
% 1.94/1.53 % (11027)Time elapsed: 0.003 s
% 1.94/1.53 % (11027)Instructions burned: 5 (million)
% 1.94/1.53 % (11027)------------------------------
% 1.94/1.53 % (11027)------------------------------
% 1.94/1.54 % (11026)Instruction limit reached!
% 1.94/1.54 % (11026)------------------------------
% 1.94/1.54 % (11026)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.54 % (11026)Termination reason: Unknown
% 1.94/1.54 % (11026)Termination phase: Saturation
% 1.94/1.54
% 1.94/1.54 % (11026)Memory used [KB]: 6140
% 1.94/1.54 % (11026)Time elapsed: 0.033 s
% 1.94/1.54 % (11026)Instructions burned: 102 (million)
% 1.94/1.54 % (11026)------------------------------
% 1.94/1.54 % (11026)------------------------------
% 1.94/1.54 % (11028)lrs+10_8:1_au=on:avsq=on:e2e=on:ins=3:s2a=on:s2at=3.0:ss=axioms:i=20:si=on:rtra=on_0 on DTF2THF_10659 for (2998ds/20Mi)
% 1.94/1.55 % (11028)Instruction limit reached!
% 1.94/1.55 % (11028)------------------------------
% 1.94/1.55 % (11028)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.55 % (11028)Termination reason: Unknown
% 1.94/1.55 % (11028)Termination phase: Saturation
% 1.94/1.55
% 1.94/1.55 % (11028)Memory used [KB]: 5628
% 1.94/1.55 % (11028)Time elapsed: 0.009 s
% 1.94/1.55 % (11028)Instructions burned: 22 (million)
% 1.94/1.55 % (11028)------------------------------
% 1.94/1.55 % (11028)------------------------------
% 1.94/1.55 % (11029)dis+1002_1:1_cbe=off:hud=5:nm=4:plsq=on:plsqr=7,1:prag=on:sp=const_max:tnu=1:i=86:si=on:rtra=on_0 on DTF2THF_10659 for (2998ds/86Mi)
% 1.94/1.56 % (11030)lrs+1010_1:1_au=on:cbe=off:nm=2:ntd=on:sd=2:ss=axioms:st=5.0:i=107:si=on:rtra=on_0 on DTF2THF_10659 for (2998ds/107Mi)
% 1.94/1.58 % (11025)Instruction limit reached!
% 1.94/1.58 % (11025)------------------------------
% 1.94/1.58 % (11025)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.58 % (11025)Termination reason: Unknown
% 1.94/1.58 % (11025)Termination phase: Saturation
% 1.94/1.58
% 1.94/1.58 % (11025)Memory used [KB]: 6396
% 1.94/1.58 % (11025)Time elapsed: 0.093 s
% 1.94/1.58 % (11025)Instructions burned: 129 (million)
% 1.94/1.58 % (11025)------------------------------
% 1.94/1.58 % (11025)------------------------------
% 1.94/1.58 % (11029)Instruction limit reached!
% 1.94/1.58 % (11029)------------------------------
% 1.94/1.58 % (11029)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.58 % (11029)Termination reason: Unknown
% 1.94/1.58 % (11029)Termination phase: Saturation
% 1.94/1.58
% 1.94/1.58 % (11029)Memory used [KB]: 6140
% 1.94/1.58 % (11029)Time elapsed: 0.030 s
% 1.94/1.58 % (11029)Instructions burned: 87 (million)
% 1.94/1.58 % (11029)------------------------------
% 1.94/1.58 % (11029)------------------------------
% 1.94/1.59 % (11032)dis+10_1:1_cnfonf=lazy_not_gen:fsr=off:kws=precedence:nwc=5.0:s2a=on:ss=axioms:st=1.5:i=448:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/448Mi)
% 1.94/1.59 % (11031)lrs+2_1:1024_cnfonf=lazy_gen:fe=off:hud=15:plsq=on:plsqc=1:plsqr=32,1:i=39:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/39Mi)
% 1.94/1.59 % Exception at run slice level
% 1.94/1.59 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.59 % Exception at run slice level
% 1.94/1.59 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.59 % (11018)Instruction limit reached!
% 1.94/1.59 % (11018)------------------------------
% 1.94/1.59 % (11018)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.59 % (11018)Termination reason: Unknown
% 1.94/1.59 % (11018)Termination phase: Saturation
% 1.94/1.59
% 1.94/1.59 % (11018)Memory used [KB]: 6012
% 1.94/1.59 % (11018)Time elapsed: 0.129 s
% 1.94/1.59 % (11018)Instructions burned: 377 (million)
% 1.94/1.59 % (11018)------------------------------
% 1.94/1.59 % (11018)------------------------------
% 1.94/1.59 % (11030)Instruction limit reached!
% 1.94/1.59 % (11030)------------------------------
% 1.94/1.59 % (11030)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.59 % (11030)Termination reason: Unknown
% 1.94/1.59 % (11030)Termination phase: Saturation
% 1.94/1.59
% 1.94/1.59 % (11030)Memory used [KB]: 6012
% 1.94/1.59 % (11030)Time elapsed: 0.038 s
% 1.94/1.59 % (11030)Instructions burned: 107 (million)
% 1.94/1.59 % (11030)------------------------------
% 1.94/1.59 % (11030)------------------------------
% 1.94/1.60 % (11034)lrs+10_1:10_au=on:av=off:cbe=off:cnfonf=lazy_pi_sigma_gen:ntd=on:plsq=on:plsqc=1:plsqr=32,1:i=98:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/98Mi)
% 1.94/1.60 % (11033)lrs+10_1:512_au=on:fde=unused:lma=on:nm=32:plsq=on:plsqc=1:plsqr=16121663,131072:sfv=off:sp=const_max:ss=axioms:st=3.0:tgt=full:i=46:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/46Mi)
% 1.94/1.60 % (11035)ott+1002_1:1_apa=on:au=on:bd=off:cnfonf=off:fd=off:sos=on:sp=weighted_frequency:i=507:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/507Mi)
% 1.94/1.60 % Exception at run slice level
% 1.94/1.60 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.60 % (11036)dis+1010_2:3_amm=off:fd=preordered:ixr=off:nm=0:pe=on:piset=equals:prag=on:sac=on:tgt=ground:i=149:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/149Mi)
% 1.94/1.61 % (11037)lrs+21_1:16_au=on:bd=off:piset=and:i=39:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/39Mi)
% 1.94/1.61 % (11033)Instruction limit reached!
% 1.94/1.61 % (11033)------------------------------
% 1.94/1.61 % (11033)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.61 % (11033)Termination reason: Unknown
% 1.94/1.61 % (11033)Termination phase: Saturation
% 1.94/1.61
% 1.94/1.61 % (11033)Memory used [KB]: 5756
% 1.94/1.61 % (11033)Time elapsed: 0.016 s
% 1.94/1.61 % (11033)Instructions burned: 46 (million)
% 1.94/1.61 % (11033)------------------------------
% 1.94/1.61 % (11033)------------------------------
% 1.94/1.62 % (11037)Instruction limit reached!
% 1.94/1.62 % (11037)------------------------------
% 1.94/1.62 % (11037)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.62 % (11037)Termination reason: Unknown
% 1.94/1.62 % (11037)Termination phase: Saturation
% 1.94/1.62
% 1.94/1.62 % (11037)Memory used [KB]: 5756
% 1.94/1.62 % (11037)Time elapsed: 0.013 s
% 1.94/1.62 % (11037)Instructions burned: 40 (million)
% 1.94/1.62 % (11037)------------------------------
% 1.94/1.62 % (11037)------------------------------
% 1.94/1.62 % (11038)lrs+1004_1:1_cnfonf=lazy_pi_sigma_gen:fe=off:gs=on:hud=10:prag=on:tnu=1:i=6:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/6Mi)
% 1.94/1.62 % Exception at run slice level
% 1.94/1.62 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.94/1.63 % (11039)dis+1002_1:1_aac=none:au=on:e2e=on:nm=2:nwc=10.0:sd=1:ss=axioms:st=3.0:i=1087:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/1087Mi)
% 1.94/1.63 % (11040)dis+10_1:1_aac=none:cs=on:i=47:si=on:rtra=on_0 on DTF2THF_10659 for (2997ds/47Mi)
% 1.94/1.65 % (11012)Instruction limit reached!
% 1.94/1.65 % (11012)------------------------------
% 1.94/1.65 % (11012)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.65 % (11012)Termination reason: Unknown
% 1.94/1.65 % (11012)Termination phase: Saturation
% 1.94/1.65
% 1.94/1.65 % (11012)Memory used [KB]: 6524
% 1.94/1.65 % (11012)Time elapsed: 0.215 s
% 1.94/1.65 % (11012)Instructions burned: 711 (million)
% 1.94/1.65 % (11012)------------------------------
% 1.94/1.65 % (11012)------------------------------
% 1.94/1.65 % (11040)Instruction limit reached!
% 1.94/1.65 % (11040)------------------------------
% 1.94/1.65 % (11040)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.65 % (11040)Termination reason: Unknown
% 1.94/1.65 % (11040)Termination phase: Saturation
% 1.94/1.65
% 1.94/1.65 % (11040)Memory used [KB]: 5756
% 1.94/1.65 % (11040)Time elapsed: 0.018 s
% 1.94/1.65 % (11040)Instructions burned: 48 (million)
% 1.94/1.65 % (11040)------------------------------
% 1.94/1.65 % (11040)------------------------------
% 1.94/1.65 % (11014)First to succeed.
% 1.94/1.65 % (11036)Instruction limit reached!
% 1.94/1.65 % (11036)------------------------------
% 1.94/1.65 % (11036)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.65 % (11036)Termination reason: Unknown
% 1.94/1.65 % (11036)Termination phase: Saturation
% 1.94/1.65
% 1.94/1.65 % (11036)Memory used [KB]: 6012
% 1.94/1.65 % (11036)Time elapsed: 0.052 s
% 1.94/1.65 % (11036)Instructions burned: 150 (million)
% 1.94/1.65 % (11036)------------------------------
% 1.94/1.65 % (11036)------------------------------
% 1.94/1.65 % (11014)Refutation found. Thanks to Tanya!
% 1.94/1.65 % SZS status Theorem for DTF2THF_10659
% 1.94/1.65 % SZS output start Proof for DTF2THF_10659
% 1.94/1.65 thf(type_def_6, type, color: $tType).
% 1.94/1.65 thf(type_def_7, type, nat: $tType).
% 1.94/1.65 thf(type_def_8, type, tree: ($tType) > $tType).
% 1.94/1.65 thf(type_def_9, type, sK10: $tType).
% 1.94/1.65 thf(func_def_0, type, isPer: !>[X0: $tType]:((X0 > X0 > $o) > $o)).
% 1.94/1.65 thf(func_def_2, type, color: $tType).
% 1.94/1.65 thf(func_def_3, type, colorStar: color > color > $o).
% 1.94/1.65 thf(func_def_4, type, black: color).
% 1.94/1.65 thf(func_def_5, type, red: color).
% 1.94/1.65 thf(func_def_6, type, nat: $tType).
% 1.94/1.65 thf(func_def_7, type, natStar: nat > nat > $o).
% 1.94/1.65 thf(func_def_8, type, zero: nat).
% 1.94/1.65 thf(func_def_9, type, suc: nat > nat).
% 1.94/1.65 thf(func_def_10, type, tree: ($tType) > $tType).
% 1.94/1.65 thf(func_def_11, type, treeStar: !>[X0: $tType]:((X0 > X0 > $o) > color > nat > tree @ X0 > tree @ X0 > $o)).
% 1.94/1.65 thf(func_def_12, type, leaf: !>[X0: $tType]:(tree @ X0)).
% 1.94/1.65 thf(func_def_13, type, rt: !>[X0: $tType]:(nat > tree @ X0 > X0 > tree @ X0 > tree @ X0)).
% 1.94/1.65 thf(func_def_14, type, bt: !>[X0: $tType]:(nat > color > color > tree @ X0 > X0 > tree @ X0 > tree @ X0)).
% 1.94/1.65 thf(func_def_15, type, rev: !>[X0: $tType]:(color > nat > tree @ X0 > tree @ X0)).
% 1.94/1.65 thf(func_def_18, type, sP0: !>[X0: $tType]:((X0 > X0 > $o) > nat > tree @ X0 > $o)).
% 1.94/1.65 thf(func_def_19, type, sK1: !>[X0: $tType]:(tree @ X0 > nat > (X0 > X0 > $o) > X0)).
% 1.94/1.65 thf(func_def_20, type, sK2: !>[X0: $tType]:(tree @ X0 > nat > (X0 > X0 > $o) > tree @ X0)).
% 1.94/1.65 thf(func_def_21, type, sK3: !>[X0: $tType]:(tree @ X0 > nat > (X0 > X0 > $o) > tree @ X0)).
% 1.94/1.65 thf(func_def_22, type, sK4: (nat > $o) > nat).
% 1.94/1.65 thf(func_def_23, type, sK5: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.94/1.65 thf(func_def_24, type, sK6: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.94/1.65 thf(func_def_25, type, sK7: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.94/1.65 thf(func_def_26, type, sK8: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.94/1.65 thf(func_def_27, type, sK9: !>[X0: $tType]:((X0 > X0 > $o) > X0)).
% 1.94/1.65 thf(func_def_28, type, sK11: sK10 > sK10 > $o).
% 1.94/1.65 thf(func_def_29, type, sK12: sK10).
% 1.94/1.65 thf(func_def_30, type, sK13: !>[X0: $tType]:((X0 > X0 > $o) > nat > tree @ X0 > X0)).
% 1.94/1.65 thf(func_def_31, type, sK14: !>[X0: $tType]:((X0 > X0 > $o) > nat > tree @ X0 > nat)).
% 1.94/1.65 thf(func_def_32, type, sK15: !>[X0: $tType]:((X0 > X0 > $o) > nat > tree @ X0 > color)).
% 1.94/1.65 thf(func_def_33, type, sK16: !>[X0: $tType]:((X0 > X0 > $o) > nat > tree @ X0 > color)).
% 1.94/1.65 thf(func_def_34, type, sK17: !>[X0: $tType]:((X0 > X0 > $o) > nat > tree @ X0 > tree @ X0)).
% 1.94/1.65 thf(func_def_35, type, sK18: !>[X0: $tType]:((X0 > X0 > $o) > nat > tree @ X0 > tree @ X0)).
% 1.94/1.65 thf(func_def_37, type, ph20: !>[X0: $tType]:(X0)).
% 1.94/1.65 thf(f2106,plain,(
% 1.94/1.65 $false),
% 1.94/1.65 inference(avatar_sat_refutation,[status(thm)],[f177,f445,f820,f994,f1110,f1545,f1582,f1974,f2105])).
% 1.94/1.65 thf(f2105,plain,(
% 1.94/1.65 spl19_28),
% 1.94/1.65 inference(avatar_contradiction_clause,[status(thm)],[f2104])).
% 1.94/1.65 thf(f2104,plain,(
% 1.94/1.65 $false | spl19_28),
% 1.94/1.65 inference(trivial_inequality_removal,[status(thm)],[f2103])).
% 1.94/1.65 thf(f2103,plain,(
% 1.94/1.65 ($true != $true) | spl19_28),
% 1.94/1.65 inference(superposition,[status(thm)],[f2010,f129])).
% 1.94/1.65 thf(f129,plain,(
% 1.94/1.65 ($true = (isPer @ sK10 @ sK11))),
% 1.94/1.65 inference(cnf_transformation,[status(thm)],[f95])).
% 1.94/1.65 thf(f95,plain,(
% 1.94/1.65 ($true = (isPer @ sK10 @ sK11)) & ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))),
% 1.94/1.65 inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f65,f94,f93])).
% 1.94/1.65 thf(f93,plain,(
% 1.94/1.65 ? [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) & ? [X2 : X0] : ((treeStar @ X0 @ X1 @ red @ zero @ (rev @ X0 @ red @ zero @ (rev @ X0 @ red @ zero @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0))) @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0)) != $true)) => (($true = (isPer @ sK10 @ sK11)) & ? [X2 : sK10] : ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ X2 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ X2 @ leaf @ sK10))))),
% 1.94/1.65 introduced(definition,[],[choice_axiom])).
% 1.94/1.65 thf(f94,plain,(
% 1.94/1.65 ? [X2 : sK10] : ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ X2 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ X2 @ leaf @ sK10))) => ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))),
% 1.94/1.65 introduced(definition,[],[choice_axiom])).
% 1.94/1.65 thf(f65,plain,(
% 1.94/1.65 ? [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) & ? [X2 : X0] : ((treeStar @ X0 @ X1 @ red @ zero @ (rev @ X0 @ red @ zero @ (rev @ X0 @ red @ zero @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0))) @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0)) != $true))),
% 1.94/1.65 inference(ennf_transformation,[status(thm)],[f51])).
% 1.94/1.65 thf(f51,plain,(
% 1.94/1.65 ~! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : X0] : ((treeStar @ X0 @ X1 @ red @ zero @ (rev @ X0 @ red @ zero @ (rev @ X0 @ red @ zero @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0))) @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0)) = $true))),
% 1.94/1.65 inference(fool_elimination,[status(thm)],[f50])).
% 1.94/1.65 thf(f50,plain,(
% 1.94/1.65 ~! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0] : (treeStar @ X0 @ X1 @ red @ zero @ (rev @ X0 @ red @ zero @ (rev @ X0 @ red @ zero @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0))) @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0)))),
% 1.94/1.65 inference(rectify,[status(thm)],[f20])).
% 1.94/1.65 thf(f20,negated_conjecture,(
% 1.94/1.65 ~! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0] : (treeStar @ X0 @ X1 @ red @ zero @ (rev @ X0 @ red @ zero @ (rev @ X0 @ red @ zero @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0))) @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0)))),
% 1.94/1.65 inference(negated_conjecture,[status(cth)],[f19])).
% 1.94/1.65 thf(f19,conjecture,(
% 1.94/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0] : (treeStar @ X0 @ X1 @ red @ zero @ (rev @ X0 @ red @ zero @ (rev @ X0 @ red @ zero @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0))) @ (rt @ X0 @ zero @ leaf @ X0 @ X2 @ leaf @ X0)))),
% 1.94/1.65 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p',rt_base)).
% 1.94/1.65 thf(f2010,plain,(
% 1.94/1.65 ($true != (isPer @ sK10 @ sK11)) | spl19_28),
% 1.94/1.65 inference(trivial_inequality_removal,[status(thm)],[f2004])).
% 1.94/1.65 thf(f2004,plain,(
% 1.94/1.65 ($true != $true) | ($true != (isPer @ sK10 @ sK11)) | spl19_28),
% 1.94/1.65 inference(superposition,[status(thm)],[f1857,f127])).
% 1.94/1.65 thf(f127,plain,(
% 1.94/1.65 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (((treeStar @ X0 @ X1 @ black @ zero @ (rev @ X0 @ black @ zero @ (rev @ X0 @ black @ zero @ leaf @ X0)) @ leaf @ X0) = $true) | ((isPer @ X0 @ X1) != $true)) )),
% 1.94/1.65 inference(cnf_transformation,[status(thm)],[f71])).
% 1.94/1.65 thf(f71,plain,(
% 1.94/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ((treeStar @ X0 @ X1 @ black @ zero @ (rev @ X0 @ black @ zero @ (rev @ X0 @ black @ zero @ leaf @ X0)) @ leaf @ X0) = $true))),
% 1.94/1.65 inference(ennf_transformation,[status(thm)],[f53])).
% 1.94/1.65 thf(f53,plain,(
% 1.94/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ((treeStar @ X0 @ X1 @ black @ zero @ (rev @ X0 @ black @ zero @ (rev @ X0 @ black @ zero @ leaf @ X0)) @ leaf @ X0) = $true))),
% 1.94/1.65 inference(fool_elimination,[status(thm)],[f52])).
% 1.94/1.65 thf(f52,plain,(
% 1.94/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => (treeStar @ X0 @ X1 @ black @ zero @ (rev @ X0 @ black @ zero @ (rev @ X0 @ black @ zero @ leaf @ X0)) @ leaf @ X0))),
% 1.94/1.65 inference(rectify,[status(thm)],[f18])).
% 1.94/1.65 thf(f18,axiom,(
% 1.94/1.65 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => (treeStar @ X0 @ X1 @ black @ zero @ (rev @ X0 @ black @ zero @ (rev @ X0 @ black @ zero @ leaf @ X0)) @ leaf @ X0))),
% 1.94/1.65 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p',bt_base)).
% 1.94/1.65 thf(f1857,plain,(
% 1.94/1.65 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ leaf @ sK10)) | spl19_28),
% 1.94/1.65 inference(trivial_inequality_removal,[status(thm)],[f1856])).
% 1.94/1.65 thf(f1856,plain,(
% 1.94/1.65 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ leaf @ sK10)) | ($true != $true) | spl19_28),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f1855,f129])).
% 1.94/1.66 thf(f1855,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ leaf @ sK10)) | spl19_28),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1854])).
% 1.94/1.66 thf(f1854,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ leaf @ sK10)) | ($true != $true) | spl19_28),
% 1.94/1.66 inference(duplicate_literal_removal,[status(thm)],[f1849])).
% 1.94/1.66 thf(f1849,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ leaf @ sK10)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ leaf @ sK10)) | ($true != (isPer @ sK10 @ sK11)) | ($true != $true) | spl19_28),
% 1.94/1.66 inference(superposition,[status(thm)],[f1486,f143])).
% 1.94/1.66 thf(f143,plain,(
% 1.94/1.66 ( ! [X0 : $tType,X2 : nat,X3 : tree @ X0,X1 : X0 > X0 > $o,X8 : tree @ X0,X6 : X0,X7 : tree @ X0,X4 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ red @ X2 @ (rt @ X0 @ X2 @ X3 @ X6 @ X7) @ (rt @ X0 @ X2 @ X4 @ X6 @ X8))) | ($true != (treeStar @ X0 @ X1 @ black @ X2 @ X3 @ X4)) | ($true != (treeStar @ X0 @ X1 @ black @ X2 @ X7 @ X8)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.94/1.66 inference(equality_resolution,[status(thm)],[f105])).
% 1.94/1.66 thf(f105,plain,(
% 1.94/1.66 ( ! [X0 : $tType,X2 : nat,X3 : tree @ X0,X1 : X0 > X0 > $o,X8 : tree @ X0,X6 : X0,X7 : tree @ X0,X4 : tree @ X0,X5 : X0] : (((isPer @ X0 @ X1) != $true) | ($true = (treeStar @ X0 @ X1 @ red @ X2 @ (rt @ X0 @ X2 @ X3 @ X5 @ X7) @ (rt @ X0 @ X2 @ X4 @ X6 @ X8))) | ($true != (treeStar @ X0 @ X1 @ black @ X2 @ X7 @ X8)) | (X5 != X6) | ($true != (treeStar @ X0 @ X1 @ black @ X2 @ X3 @ X4))) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f61])).
% 1.94/1.66 thf(f61,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) != $true) | ! [X2 : nat,X3 : tree @ X0,X4 : tree @ X0] : (! [X5 : X0,X6 : X0] : (! [X7 : tree @ X0,X8 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ red @ X2 @ (rt @ X0 @ X2 @ X3 @ X5 @ X7) @ (rt @ X0 @ X2 @ X4 @ X6 @ X8))) | ($true != (treeStar @ X0 @ X1 @ black @ X2 @ X7 @ X8))) | (X5 != X6)) | ($true != (treeStar @ X0 @ X1 @ black @ X2 @ X3 @ X4))))),
% 1.94/1.66 inference(ennf_transformation,[status(thm)],[f43])).
% 1.94/1.66 thf(f43,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : nat,X3 : tree @ X0,X4 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ black @ X2 @ X3 @ X4)) => ! [X5 : X0,X6 : X0] : ((X5 = X6) => ! [X7 : tree @ X0,X8 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ black @ X2 @ X7 @ X8)) => ($true = (treeStar @ X0 @ X1 @ red @ X2 @ (rt @ X0 @ X2 @ X3 @ X5 @ X7) @ (rt @ X0 @ X2 @ X4 @ X6 @ X8)))))))),
% 1.94/1.66 inference(fool_elimination,[status(thm)],[f42])).
% 1.94/1.66 thf(f42,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : nat,X3 : tree @ X0,X4 : tree @ X0] : ((treeStar @ X0 @ X1 @ black @ X2 @ X3 @ X4) => ! [X5 : X0,X6 : X0] : ((X5 = X6) => ! [X7 : tree @ X0,X8 : tree @ X0] : ((treeStar @ X0 @ X1 @ black @ X2 @ X7 @ X8) => (treeStar @ X0 @ X1 @ red @ X2 @ (rt @ X0 @ X2 @ X3 @ X5 @ X7) @ (rt @ X0 @ X2 @ X4 @ X6 @ X8))))))),
% 1.94/1.66 inference(rectify,[status(thm)],[f6])).
% 1.94/1.66 thf(f6,axiom,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X9 : nat,X10 : tree @ X0,X11 : tree @ X0] : ((treeStar @ X0 @ X1 @ black @ X9 @ X10 @ X11) => ! [X12 : X0,X13 : X0] : ((X12 = X13) => ! [X14 : tree @ X0,X15 : tree @ X0] : ((treeStar @ X0 @ X1 @ black @ X9 @ X14 @ X15) => (treeStar @ X0 @ X1 @ red @ X9 @ (rt @ X0 @ X9 @ X10 @ X12 @ X14) @ (rt @ X0 @ X9 @ X11 @ X13 @ X15))))))),
% 1.94/1.66 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p',rt_tp_ax)).
% 1.94/1.66 thf(f1486,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ sK12 @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | spl19_28),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f1484])).
% 1.94/1.66 thf(f1484,definition,(
% 1.94/1.66 spl19_28 <=> ($true = (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ sK12 @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))),
% 1.94/1.66 introduced(definition,[new_symbols(naming,[spl19_28])],[avatar_definition])).
% 1.94/1.66 thf(f1974,plain,(
% 1.94/1.66 ~spl19_20 | spl19_10 | ~spl19_2 | ~spl19_4),
% 1.94/1.66 inference(avatar_split_clause,[status(thm)],[f1973,f202,f160,f339,f865])).
% 1.94/1.66 thf(f865,definition,(
% 1.94/1.66 spl19_20 <=> ($true = (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))),
% 1.94/1.66 introduced(definition,[new_symbols(naming,[spl19_20])],[avatar_definition])).
% 1.94/1.66 thf(f339,definition,(
% 1.94/1.66 spl19_10 <=> (black = red)),
% 1.94/1.66 introduced(definition,[new_symbols(naming,[spl19_10])],[avatar_definition])).
% 1.94/1.66 thf(f160,definition,(
% 1.94/1.66 spl19_2 <=> ($true = (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero)))),
% 1.94/1.66 introduced(definition,[new_symbols(naming,[spl19_2])],[avatar_definition])).
% 1.94/1.66 thf(f202,definition,(
% 1.94/1.66 spl19_4 <=> ($true = (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))))),
% 1.94/1.66 introduced(definition,[new_symbols(naming,[spl19_4])],[avatar_definition])).
% 1.94/1.66 thf(f1973,plain,(
% 1.94/1.66 (black = red) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | (~spl19_2 | ~spl19_4)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1972])).
% 1.94/1.66 thf(f1972,plain,(
% 1.94/1.66 ($true != $true) | (black = red) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | (~spl19_2 | ~spl19_4)),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f1954,f161])).
% 1.94/1.66 thf(f161,plain,(
% 1.94/1.66 ($true = (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero))) | ~spl19_2),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f160])).
% 1.94/1.66 thf(f1954,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero))) | (black = red) | ~spl19_4),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1946])).
% 1.94/1.66 thf(f1946,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero))) | ($true != $true) | (black = red) | ~spl19_4),
% 1.94/1.66 inference(superposition,[status(thm)],[f516,f203])).
% 1.94/1.66 thf(f203,plain,(
% 1.94/1.66 ($true = (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))))) | ~spl19_4),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f202])).
% 1.94/1.66 thf(f516,plain,(
% 1.94/1.66 ( ! [X0 : color,X1 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X1)) | (black = X0) | ($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ X1 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero)))) )),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f515])).
% 1.94/1.66 thf(f515,plain,(
% 1.94/1.66 ( ! [X0 : color,X1 : tree @ sK10] : (($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X1)) | ($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ X1 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | (black = X0) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero)))) )),
% 1.94/1.66 inference(duplicate_literal_removal,[status(thm)],[f513])).
% 1.94/1.66 thf(f513,plain,(
% 1.94/1.66 ( ! [X0 : color,X1 : tree @ sK10] : ((black = X0) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero))) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero))) | ($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ X1 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X1)) | ($true != $true)) )),
% 1.94/1.66 inference(superposition,[status(thm)],[f325,f118])).
% 1.94/1.66 thf(f118,plain,(
% 1.94/1.66 ( ! [X0 : $tType,X10 : X0,X11 : X0,X1 : X0 > X0 > $o,X9 : X0] : (($true = (X1 @ X9 @ X11)) | ((isPer @ X0 @ X1) != $true) | ($true != (X1 @ X10 @ X11)) | ($true != (X1 @ X9 @ X10))) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f92])).
% 1.94/1.66 thf(f92,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | (($true != (X1 @ (sK6 @ X0 @ X1) @ (sK5 @ X0 @ X1))) & ($true = (X1 @ (sK5 @ X0 @ X1) @ (sK6 @ X0 @ X1)))) | (($true = (X1 @ (sK7 @ X0 @ X1) @ (sK8 @ X0 @ X1))) & ($true = (X1 @ (sK8 @ X0 @ X1) @ (sK9 @ X0 @ X1))) & ($true != (X1 @ (sK7 @ X0 @ X1) @ (sK9 @ X0 @ X1))))) & ((! [X7 : X0,X8 : X0] : (($true = (X1 @ X8 @ X7)) | ($true != (X1 @ X7 @ X8))) & ! [X9 : X0,X10 : X0,X11 : X0] : (($true != (X1 @ X9 @ X10)) | ($true != (X1 @ X10 @ X11)) | ($true = (X1 @ X9 @ X11)))) | ((isPer @ X0 @ X1) != $true)))),
% 1.94/1.66 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9])],[f89,f91,f90])).
% 1.94/1.66 thf(f90,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (? [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) != $true) & ((X1 @ X2 @ X3) = $true)) => (($true != (X1 @ (sK6 @ X0 @ X1) @ (sK5 @ X0 @ X1))) & ($true = (X1 @ (sK5 @ X0 @ X1) @ (sK6 @ X0 @ X1)))))),
% 1.94/1.66 introduced(definition,[],[choice_axiom])).
% 1.94/1.66 thf(f91,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (? [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X4 @ X5)) & ($true = (X1 @ X5 @ X6)) & ($true != (X1 @ X4 @ X6))) => (($true = (X1 @ (sK7 @ X0 @ X1) @ (sK8 @ X0 @ X1))) & ($true = (X1 @ (sK8 @ X0 @ X1) @ (sK9 @ X0 @ X1))) & ($true != (X1 @ (sK7 @ X0 @ X1) @ (sK9 @ X0 @ X1)))))),
% 1.94/1.66 introduced(definition,[],[choice_axiom])).
% 1.94/1.66 thf(f89,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | ? [X2 : X0,X3 : X0] : (((X1 @ X3 @ X2) != $true) & ((X1 @ X2 @ X3) = $true)) | ? [X4 : X0,X5 : X0,X6 : X0] : (($true = (X1 @ X4 @ X5)) & ($true = (X1 @ X5 @ X6)) & ($true != (X1 @ X4 @ X6)))) & ((! [X7 : X0,X8 : X0] : (($true = (X1 @ X8 @ X7)) | ($true != (X1 @ X7 @ X8))) & ! [X9 : X0,X10 : X0,X11 : X0] : (($true != (X1 @ X9 @ X10)) | ($true != (X1 @ X10 @ X11)) | ($true = (X1 @ X9 @ X11)))) | ((isPer @ X0 @ X1) != $true)))),
% 1.94/1.66 inference(rectify,[status(thm)],[f88])).
% 1.94/1.66 thf(f88,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | ? [X5 : X0,X6 : X0] : (($true != (X1 @ X6 @ X5)) & ($true = (X1 @ X5 @ X6))) | ? [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X3) = $true) & ((X1 @ X3 @ X4) = $true) & ((X1 @ X2 @ X4) != $true))) & ((! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ($true != (X1 @ X5 @ X6))) & ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X3) != $true) | ((X1 @ X3 @ X4) != $true) | ((X1 @ X2 @ X4) = $true))) | ((isPer @ X0 @ X1) != $true)))),
% 1.94/1.66 inference(flattening,[status(thm)],[f87])).
% 1.94/1.66 thf(f87,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((((isPer @ X0 @ X1) = $true) | (? [X5 : X0,X6 : X0] : (($true != (X1 @ X6 @ X5)) & ($true = (X1 @ X5 @ X6))) | ? [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X3) = $true) & ((X1 @ X3 @ X4) = $true) & ((X1 @ X2 @ X4) != $true)))) & ((! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ($true != (X1 @ X5 @ X6))) & ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X3) != $true) | ((X1 @ X3 @ X4) != $true) | ((X1 @ X2 @ X4) = $true))) | ((isPer @ X0 @ X1) != $true)))),
% 1.94/1.66 inference(nnf_transformation,[status(thm)],[f60])).
% 1.94/1.66 thf(f60,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) <=> (! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ($true != (X1 @ X5 @ X6))) & ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X3) != $true) | ((X1 @ X3 @ X4) != $true) | ((X1 @ X2 @ X4) = $true))))),
% 1.94/1.66 inference(flattening,[status(thm)],[f59])).
% 1.94/1.66 thf(f59,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X5 : X0,X6 : X0] : (($true = (X1 @ X6 @ X5)) | ($true != (X1 @ X5 @ X6))) & ! [X2 : X0,X3 : X0,X4 : X0] : ((((X1 @ X2 @ X4) = $true) | ((X1 @ X3 @ X4) != $true)) | ((X1 @ X2 @ X3) != $true))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.94/1.66 inference(ennf_transformation,[status(thm)],[f45])).
% 1.94/1.66 thf(f45,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((! [X5 : X0,X6 : X0] : (($true = (X1 @ X5 @ X6)) => ($true = (X1 @ X6 @ X5))) & ! [X2 : X0,X3 : X0,X4 : X0] : (((X1 @ X2 @ X3) = $true) => (((X1 @ X3 @ X4) = $true) => ((X1 @ X2 @ X4) = $true)))) <=> ((isPer @ X0 @ X1) = $true))),
% 1.94/1.66 inference(fool_elimination,[status(thm)],[f44])).
% 1.94/1.66 thf(f44,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) <=> (! [X2 : X0,X3 : X0,X4 : X0] : ((X1 @ X2 @ X3) => ((X1 @ X3 @ X4) => (X1 @ X2 @ X4))) & ! [X5 : X0,X6 : X0] : ((X1 @ X5 @ X6) => (X1 @ X6 @ X5))))),
% 1.94/1.66 inference(rectify,[status(thm)],[f1])).
% 1.94/1.66 thf(f1,axiom,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) <=> (! [X2 : X0,X3 : X0,X4 : X0] : ((X1 @ X2 @ X3) => ((X1 @ X3 @ X4) => (X1 @ X2 @ X4))) & ! [X2 : X0,X3 : X0] : ((X1 @ X2 @ X3) => (X1 @ X3 @ X2))))),
% 1.94/1.66 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p',is_per)).
% 1.94/1.66 thf(f325,plain,(
% 1.94/1.66 ( ! [X0 : color] : (($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero))) | (black = X0)) )),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f324])).
% 1.94/1.66 thf(f324,plain,(
% 1.94/1.66 ( ! [X0 : color] : (($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero))) | (black = X0) | ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) )),
% 1.94/1.66 inference(duplicate_literal_removal,[status(thm)],[f321])).
% 1.94/1.66 thf(f321,plain,(
% 1.94/1.66 ( ! [X0 : color] : (($true != $true) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero))) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero))) | ($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | (black = X0)) )),
% 1.94/1.66 inference(superposition,[status(thm)],[f173,f119])).
% 1.94/1.66 thf(f119,plain,(
% 1.94/1.66 ( ! [X0 : $tType,X1 : X0 > X0 > $o,X8 : X0,X7 : X0] : (($true = (X1 @ X8 @ X7)) | ($true != (X1 @ X7 @ X8)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f92])).
% 1.94/1.66 thf(f173,plain,(
% 1.94/1.66 ( ! [X0 : color] : (($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10) @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))))) | (black = X0) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero)))) )),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f172])).
% 1.94/1.66 thf(f172,plain,(
% 1.94/1.66 ( ! [X0 : color] : (($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10) @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))))) | (black = X0) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ X0 @ zero)))) )),
% 1.94/1.66 inference(superposition,[status(thm)],[f150,f119])).
% 1.94/1.66 thf(f150,plain,(
% 1.94/1.66 ( ! [X0 : color] : (($true != (treeStar @ sK10 @ sK11 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rev @ sK10 @ X0 @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | (black = X0)) )),
% 1.94/1.66 inference(superposition,[status(thm)],[f128,f140])).
% 1.94/1.66 thf(f140,plain,(
% 1.94/1.66 ( ! [X0 : color] : ((red = X0) | (black = X0)) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f56])).
% 1.94/1.66 thf(f56,plain,(
% 1.94/1.66 ! [X0 : color] : (((red = X0) & (black != X0)) | ((red != X0) & (black = X0)))),
% 1.94/1.66 inference(rectify,[status(thm)],[f9])).
% 1.94/1.66 thf(f9,axiom,(
% 1.94/1.66 ! [X7 : color] : (((red != X7) & (black = X7)) | ((black != X7) & (red = X7)))),
% 1.94/1.66 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p',red_black)).
% 1.94/1.66 thf(f128,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f95])).
% 1.94/1.66 thf(f1582,plain,(
% 1.94/1.66 ~spl19_9 | spl19_27),
% 1.94/1.66 inference(avatar_split_clause,[status(thm)],[f1581,f1480,f310])).
% 1.94/1.66 thf(f310,definition,(
% 1.94/1.66 spl19_9 <=> ($true = (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10))),
% 1.94/1.66 introduced(definition,[new_symbols(naming,[spl19_9])],[avatar_definition])).
% 1.94/1.66 thf(f1480,definition,(
% 1.94/1.66 spl19_27 <=> ($true = (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ (rev @ sK10 @ black @ zero @ leaf @ sK10)))),
% 1.94/1.66 introduced(definition,[new_symbols(naming,[spl19_27])],[avatar_definition])).
% 1.94/1.66 thf(f1581,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | spl19_27),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1580])).
% 1.94/1.66 thf(f1580,plain,(
% 1.94/1.66 ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | spl19_27),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f1579,f129])).
% 1.94/1.66 thf(f1579,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | spl19_27),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1574])).
% 1.94/1.66 thf(f1574,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != (isPer @ sK10 @ sK11)) | ($true != $true) | spl19_27),
% 1.94/1.66 inference(superposition,[status(thm)],[f1482,f114])).
% 1.94/1.66 thf(f114,plain,(
% 1.94/1.66 ( ! [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))) | ($true != (treeStar @ X0 @ X1 @ X2 @ X3 @ X4 @ X5)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f58])).
% 1.94/1.66 thf(f58,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : color,X3 : nat,X4 : tree @ X0,X5 : tree @ X0] : (($true != (treeStar @ X0 @ X1 @ X2 @ X3 @ X4 @ X5)) | ($true = (treeStar @ X0 @ X1 @ X2 @ X3 @ (rev @ X0 @ X2 @ X3 @ X4) @ (rev @ X0 @ X2 @ X3 @ X5)))) | ((isPer @ X0 @ X1) != $true))),
% 1.94/1.66 inference(ennf_transformation,[status(thm)],[f35])).
% 1.94/1.66 thf(f35,plain,(
% 1.94/1.66 ! [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 @ X4 @ X5)) => ($true = (treeStar @ X0 @ X1 @ X2 @ X3 @ (rev @ X0 @ X2 @ X3 @ X4) @ (rev @ X0 @ X2 @ X3 @ X5)))))),
% 1.94/1.66 inference(fool_elimination,[status(thm)],[f34])).
% 1.94/1.66 thf(f34,plain,(
% 1.94/1.66 ! [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.94/1.66 inference(rectify,[status(thm)],[f8])).
% 1.94/1.66 thf(f8,axiom,(
% 1.94/1.66 ! [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.94/1.66 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p',rev_tp_ax)).
% 1.94/1.66 thf(f1482,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) | spl19_27),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f1480])).
% 1.94/1.66 thf(f1545,plain,(
% 1.94/1.66 ~spl19_27 | ~spl19_28 | ~spl19_2 | ~spl19_3 | ~spl19_9),
% 1.94/1.66 inference(avatar_split_clause,[status(thm)],[f1544,f310,f165,f160,f1484,f1480])).
% 1.94/1.66 thf(f165,definition,(
% 1.94/1.66 spl19_3 <=> ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X0)))),
% 1.94/1.66 introduced(definition,[new_symbols(naming,[spl19_3])],[avatar_definition])).
% 1.94/1.66 thf(f1544,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ sK12 @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) | (~spl19_2 | ~spl19_3 | ~spl19_9)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1543])).
% 1.94/1.66 thf(f1543,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ sK12 @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) | (~spl19_2 | ~spl19_3 | ~spl19_9)),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f1542,f129])).
% 1.94/1.66 thf(f1542,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ sK12 @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) | (~spl19_2 | ~spl19_3 | ~spl19_9)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1541])).
% 1.94/1.66 thf(f1541,plain,(
% 1.94/1.66 ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ sK12 @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (isPer @ sK10 @ sK11)) | (~spl19_2 | ~spl19_3 | ~spl19_9)),
% 1.94/1.66 inference(duplicate_literal_removal,[status(thm)],[f1532])).
% 1.94/1.66 thf(f1532,plain,(
% 1.94/1.66 ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10)) @ sK12 @ (rev @ sK10 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) | (~spl19_2 | ~spl19_3 | ~spl19_9)),
% 1.94/1.66 inference(superposition,[status(thm)],[f696,f137])).
% 1.94/1.66 thf(f137,plain,(
% 1.94/1.66 ( ! [X0 : $tType,X2 : X0,X3 : nat,X1 : X0 > X0 > $o,X4 : tree @ X0,X5 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ red @ X3 @ (rev @ X0 @ red @ X3 @ (rt @ X0 @ X3 @ X4 @ X2 @ X5)) @ (rt @ X0 @ X3 @ (rev @ X0 @ black @ X3 @ X5) @ X2 @ (rev @ X0 @ black @ X3 @ X4)))) | ($true != (treeStar @ X0 @ X1 @ black @ X3 @ X4 @ X4)) | ($true != (treeStar @ X0 @ X1 @ black @ X3 @ X5 @ X5)) | ((isPer @ X0 @ X1) != $true)) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f67])).
% 1.94/1.66 thf(f67,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : X0,X3 : nat,X4 : tree @ X0,X5 : tree @ X0] : (($true != (treeStar @ X0 @ X1 @ black @ X3 @ X5 @ X5)) | ($true != (treeStar @ X0 @ X1 @ black @ X3 @ X4 @ X4)) | ($true = (treeStar @ X0 @ X1 @ red @ X3 @ (rev @ X0 @ red @ X3 @ (rt @ X0 @ X3 @ X4 @ X2 @ X5)) @ (rt @ X0 @ X3 @ (rev @ X0 @ black @ X3 @ X5) @ X2 @ (rev @ X0 @ black @ X3 @ X4))))) | ((isPer @ X0 @ X1) != $true))),
% 1.94/1.66 inference(flattening,[status(thm)],[f66])).
% 1.94/1.66 thf(f66,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : X0,X3 : nat,X4 : tree @ X0,X5 : tree @ X0] : ((($true = (treeStar @ X0 @ X1 @ red @ X3 @ (rev @ X0 @ red @ X3 @ (rt @ X0 @ X3 @ X4 @ X2 @ X5)) @ (rt @ X0 @ X3 @ (rev @ X0 @ black @ X3 @ X5) @ X2 @ (rev @ X0 @ black @ X3 @ X4)))) | ($true != (treeStar @ X0 @ X1 @ black @ X3 @ X5 @ X5))) | ($true != (treeStar @ X0 @ X1 @ black @ X3 @ X4 @ X4))) | ((isPer @ X0 @ X1) != $true))),
% 1.94/1.66 inference(ennf_transformation,[status(thm)],[f49])).
% 1.94/1.66 thf(f49,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : X0,X3 : nat,X4 : tree @ X0,X5 : tree @ X0] : (($true = (treeStar @ X0 @ X1 @ black @ X3 @ X4 @ X4)) => (($true = (treeStar @ X0 @ X1 @ black @ X3 @ X5 @ X5)) => ($true = (treeStar @ X0 @ X1 @ red @ X3 @ (rev @ X0 @ red @ X3 @ (rt @ X0 @ X3 @ X4 @ X2 @ X5)) @ (rt @ X0 @ X3 @ (rev @ X0 @ black @ X3 @ X5) @ X2 @ (rev @ X0 @ black @ X3 @ X4)))))))),
% 1.94/1.66 inference(fool_elimination,[status(thm)],[f48])).
% 1.94/1.66 thf(f48,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0,X3 : nat,X4 : tree @ X0,X5 : tree @ X0] : ((treeStar @ X0 @ X1 @ black @ X3 @ X4 @ X4) => ((treeStar @ X0 @ X1 @ black @ X3 @ X5 @ X5) => (treeStar @ X0 @ X1 @ red @ X3 @ (rev @ X0 @ red @ X3 @ (rt @ X0 @ X3 @ X4 @ X2 @ X5)) @ (rt @ X0 @ X3 @ (rev @ X0 @ black @ X3 @ X5) @ X2 @ (rev @ X0 @ black @ X3 @ X4))))))),
% 1.94/1.66 inference(rectify,[status(thm)],[f17])).
% 1.94/1.66 thf(f17,axiom,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : X0,X9 : nat,X21 : tree @ X0,X22 : tree @ X0] : ((treeStar @ X0 @ X1 @ black @ X9 @ X21 @ X21) => ((treeStar @ X0 @ X1 @ black @ X9 @ X22 @ X22) => (treeStar @ X0 @ X1 @ red @ X9 @ (rev @ X0 @ red @ X9 @ (rt @ X0 @ X9 @ X21 @ X2 @ X22)) @ (rt @ X0 @ X9 @ (rev @ X0 @ black @ X9 @ X22) @ X2 @ (rev @ X0 @ black @ X9 @ X21))))))),
% 1.94/1.66 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p',rev_rt)).
% 1.94/1.66 thf(f696,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ sK12 @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) ) | (~spl19_2 | ~spl19_3 | ~spl19_9)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f695])).
% 1.94/1.66 thf(f695,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ sK12 @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ X0))) ) | (~spl19_2 | ~spl19_3 | ~spl19_9)),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f694,f311])).
% 1.94/1.66 thf(f311,plain,(
% 1.94/1.66 ($true = (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ~spl19_9),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f310])).
% 1.94/1.66 thf(f694,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ sK12 @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f693])).
% 1.94/1.66 thf(f693,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ sK12 @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ X0))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f686,f129])).
% 1.94/1.66 thf(f686,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ sK12 @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ X0))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f685])).
% 1.94/1.66 thf(f685,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != $true) | ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ sK12 @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(duplicate_literal_removal,[status(thm)],[f678])).
% 1.94/1.66 thf(f678,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ (rev @ sK10 @ black @ zero @ leaf @ sK10) @ sK12 @ (rev @ sK10 @ black @ zero @ leaf @ sK10))) @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != $true)) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(superposition,[status(thm)],[f365,f137])).
% 1.94/1.66 thf(f365,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10,X1 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)) @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X1 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ X0) @ X1))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f364])).
% 1.94/1.66 thf(f364,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10,X1 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ X0) @ X1)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X1 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)) @ X0)) | ($true != $true)) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f350,f129])).
% 1.94/1.66 thf(f350,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10,X1 : tree @ sK10] : (($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ X0) @ X1)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)) @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X1 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f346])).
% 1.94/1.66 thf(f346,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10,X1 : tree @ sK10] : (($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ X0) @ X1)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X1 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)) @ X0)) | ($true != (isPer @ sK10 @ sK11))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(superposition,[status(thm)],[f211,f114])).
% 1.94/1.66 thf(f211,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10,X1 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X1)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X1 @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f210])).
% 1.94/1.66 thf(f210,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10,X1 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X1 @ X0)) | ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X1))) ) | (~spl19_2 | ~spl19_3)),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f194,f161])).
% 1.94/1.66 thf(f194,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10,X1 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X1 @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X1)) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) ) | ~spl19_3),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f191])).
% 1.94/1.66 thf(f191,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10,X1 : tree @ sK10] : (($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X1 @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X1)) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero)))) ) | ~spl19_3),
% 1.94/1.66 inference(superposition,[status(thm)],[f166,f118])).
% 1.94/1.66 thf(f166,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) ) | ~spl19_3),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f165])).
% 1.94/1.66 thf(f1110,plain,(
% 1.94/1.66 spl19_3 | ~spl19_2 | spl19_20),
% 1.94/1.66 inference(avatar_split_clause,[status(thm)],[f1109,f865,f160,f165])).
% 1.94/1.66 thf(f1109,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X0))) ) | (~spl19_2 | spl19_20)),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1108])).
% 1.94/1.66 thf(f1108,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X0)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != $true)) ) | (~spl19_2 | spl19_20)),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f1107,f161])).
% 1.94/1.66 thf(f1107,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X0)) | ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero)))) ) | spl19_20),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f1104])).
% 1.94/1.66 thf(f1104,plain,(
% 1.94/1.66 ( ! [X0 : tree @ sK10] : (($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero))) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ X0 @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ X0))) ) | spl19_20),
% 1.94/1.66 inference(superposition,[status(thm)],[f867,f118])).
% 1.94/1.66 thf(f867,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | spl19_20),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f865])).
% 1.94/1.66 thf(f994,plain,(
% 1.94/1.66 ~spl19_10),
% 1.94/1.66 inference(avatar_contradiction_clause,[status(thm)],[f993])).
% 1.94/1.66 thf(f993,plain,(
% 1.94/1.66 $false | ~spl19_10),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f967])).
% 1.94/1.66 thf(f967,plain,(
% 1.94/1.66 (black != black) | ~spl19_10),
% 1.94/1.66 inference(superposition,[status(thm)],[f148,f341])).
% 1.94/1.66 thf(f341,plain,(
% 1.94/1.66 (black = red) | ~spl19_10),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f339])).
% 1.94/1.66 thf(f148,plain,(
% 1.94/1.66 (black != red)),
% 1.94/1.66 inference(equality_resolution,[status(thm)],[f139])).
% 1.94/1.66 thf(f139,plain,(
% 1.94/1.66 ( ! [X0 : color] : ((black != X0) | (red != X0)) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f56])).
% 1.94/1.66 thf(f820,plain,(
% 1.94/1.66 ~spl19_9 | spl19_4),
% 1.94/1.66 inference(avatar_split_clause,[status(thm)],[f819,f202,f310])).
% 1.94/1.66 thf(f819,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | spl19_4),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f818])).
% 1.94/1.66 thf(f818,plain,(
% 1.94/1.66 ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | spl19_4),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f817,f129])).
% 1.94/1.66 thf(f817,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != (isPer @ sK10 @ sK11)) | spl19_4),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f816])).
% 1.94/1.66 thf(f816,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != (isPer @ sK10 @ sK11)) | ($true != $true) | spl19_4),
% 1.94/1.66 inference(duplicate_literal_removal,[status(thm)],[f811])).
% 1.94/1.66 thf(f811,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | ($true != $true) | ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | spl19_4),
% 1.94/1.66 inference(superposition,[status(thm)],[f262,f143])).
% 1.94/1.66 thf(f262,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | spl19_4),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f261])).
% 1.94/1.66 thf(f261,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != $true) | spl19_4),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f260,f129])).
% 1.94/1.66 thf(f260,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | spl19_4),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f255])).
% 1.94/1.66 thf(f255,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10) @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) | ($true != $true) | spl19_4),
% 1.94/1.66 inference(superposition,[status(thm)],[f240,f114])).
% 1.94/1.66 thf(f240,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)) @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) | spl19_4),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f239])).
% 1.94/1.66 thf(f239,plain,(
% 1.94/1.66 ($true != $true) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)) @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) | spl19_4),
% 1.94/1.66 inference(forward_demodulation,[status(thm)],[f232,f129])).
% 1.94/1.66 thf(f232,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)) @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) | spl19_4),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f229])).
% 1.94/1.66 thf(f229,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)) @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10)))) | ($true != (isPer @ sK10 @ sK11)) | ($true != $true) | spl19_4),
% 1.94/1.66 inference(superposition,[status(thm)],[f204,f114])).
% 1.94/1.66 thf(f204,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))) @ (rev @ sK10 @ red @ zero @ (rev @ sK10 @ red @ zero @ (rt @ sK10 @ zero @ leaf @ sK10 @ sK12 @ leaf @ sK10))))) | spl19_4),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f202])).
% 1.94/1.66 thf(f445,plain,(
% 1.94/1.66 spl19_9),
% 1.94/1.66 inference(avatar_contradiction_clause,[status(thm)],[f444])).
% 1.94/1.66 thf(f444,plain,(
% 1.94/1.66 $false | spl19_9),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f443])).
% 1.94/1.66 thf(f443,plain,(
% 1.94/1.66 ($true != $true) | spl19_9),
% 1.94/1.66 inference(superposition,[status(thm)],[f372,f129])).
% 1.94/1.66 thf(f372,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | spl19_9),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f366])).
% 1.94/1.66 thf(f366,plain,(
% 1.94/1.66 ($true != $true) | ($true != (isPer @ sK10 @ sK11)) | spl19_9),
% 1.94/1.66 inference(superposition,[status(thm)],[f312,f112])).
% 1.94/1.66 thf(f112,plain,(
% 1.94/1.66 ( ! [X0 : $tType,X1 : X0 > X0 > $o] : (((treeStar @ X0 @ X1 @ black @ zero @ leaf @ X0 @ leaf @ X0) = $true) | ((isPer @ X0 @ X1) != $true)) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f70])).
% 1.94/1.66 thf(f70,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((treeStar @ X0 @ X1 @ black @ zero @ leaf @ X0 @ leaf @ X0) = $true) | ((isPer @ X0 @ X1) != $true))),
% 1.94/1.66 inference(ennf_transformation,[status(thm)],[f37])).
% 1.94/1.66 thf(f37,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ((treeStar @ X0 @ X1 @ black @ zero @ leaf @ X0 @ leaf @ X0) = $true))),
% 1.94/1.66 inference(fool_elimination,[status(thm)],[f36])).
% 1.94/1.66 thf(f36,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => (treeStar @ X0 @ X1 @ black @ zero @ leaf @ X0 @ leaf @ X0))),
% 1.94/1.66 inference(rectify,[status(thm)],[f5])).
% 1.94/1.66 thf(f5,axiom,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => (treeStar @ X0 @ X1 @ black @ zero @ leaf @ X0 @ leaf @ X0))),
% 1.94/1.66 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p',leaf_tp_ax)).
% 1.94/1.66 thf(f312,plain,(
% 1.94/1.66 ($true != (treeStar @ sK10 @ sK11 @ black @ zero @ leaf @ sK10 @ leaf @ sK10)) | spl19_9),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f310])).
% 1.94/1.66 thf(f177,plain,(
% 1.94/1.66 spl19_2),
% 1.94/1.66 inference(avatar_contradiction_clause,[status(thm)],[f176])).
% 1.94/1.66 thf(f176,plain,(
% 1.94/1.66 $false | spl19_2),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f175])).
% 1.94/1.66 thf(f175,plain,(
% 1.94/1.66 ($true != $true) | spl19_2),
% 1.94/1.66 inference(superposition,[status(thm)],[f170,f129])).
% 1.94/1.66 thf(f170,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | spl19_2),
% 1.94/1.66 inference(trivial_inequality_removal,[status(thm)],[f169])).
% 1.94/1.66 thf(f169,plain,(
% 1.94/1.66 ($true != (isPer @ sK10 @ sK11)) | ($true != $true) | spl19_2),
% 1.94/1.66 inference(superposition,[status(thm)],[f162,f113])).
% 1.94/1.66 thf(f113,plain,(
% 1.94/1.66 ( ! [X0 : $tType,X2 : color,X3 : nat,X1 : X0 > X0 > $o] : (($true = (isPer @ tree @ X0 @ (treeStar @ X0 @ X1 @ X2 @ X3))) | ((isPer @ X0 @ X1) != $true)) )),
% 1.94/1.66 inference(cnf_transformation,[status(thm)],[f75])).
% 1.94/1.66 thf(f75,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (! [X2 : color,X3 : nat] : ($true = (isPer @ tree @ X0 @ (treeStar @ X0 @ X1 @ X2 @ X3))) | ((isPer @ X0 @ X1) != $true))),
% 1.94/1.66 inference(ennf_transformation,[status(thm)],[f33])).
% 1.94/1.66 thf(f33,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : (((isPer @ X0 @ X1) = $true) => ! [X2 : color,X3 : nat] : ($true = (isPer @ tree @ X0 @ (treeStar @ X0 @ X1 @ X2 @ X3))))),
% 1.94/1.66 inference(fool_elimination,[status(thm)],[f32])).
% 1.94/1.66 thf(f32,plain,(
% 1.94/1.66 ! [X0 : $tType,X1 : X0 > X0 > $o] : ((isPer @ X0 @ X1) => ! [X2 : color,X3 : nat] : (isPer @ tree @ X0 @ (treeStar @ X0 @ X1 @ X2 @ X3)))),
% 1.94/1.66 inference(rectify,[status(thm)],[f4])).
% 1.94/1.66 thf(f4,axiom,(
% 1.94/1.66 ! [X5 : $tType,X6 : X5 > X5 > $o] : ((isPer @ X5 @ X6) => ! [X7 : color,X8 : nat] : (isPer @ tree @ X5 @ (treeStar @ X5 @ X6 @ X7 @ X8)))),
% 1.94/1.66 file('/export/starexec/sandbox/tmp/tmp.fbpYKA4pRt/DTF2THF_10659.p','\'treeStar\'_is_per')).
% 1.94/1.66 thf(f162,plain,(
% 1.94/1.66 ($true != (isPer @ tree @ sK10 @ (treeStar @ sK10 @ sK11 @ red @ zero))) | spl19_2),
% 1.94/1.66 inference(avatar_component_clause,[status(thm)],[f160])).
% 1.94/1.66 % SZS output end Proof for DTF2THF_10659
% 1.94/1.66 % (11014)------------------------------
% 1.94/1.66 % (11014)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.94/1.66 % (11014)Termination reason: Refutation
% 1.94/1.66
% 1.94/1.66 % (11014)Memory used [KB]: 6652
% 1.94/1.66 % (11014)Time elapsed: 0.212 s
% 1.94/1.66 % (11014)Instructions burned: 578 (million)
% 1.94/1.66 % (11014)------------------------------
% 1.94/1.66 % (11014)------------------------------
% 1.94/1.66 % (10991)Success in time 0.288 s
%------------------------------------------------------------------------------