%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : ITP209^2 : TPTP v9.2.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n026.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:56:52 AM UTC 2026
% Result : Theorem 2.11s 1.74s
% Output : Refutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 13 ( 12 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 89 ( 5 ~; 0 |; 0 &; 84 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 4 con; 0-4 aty)
% Number of variables : 15 ( 0 ^; 15 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
syntax_ac_operator:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).
thf(func_def_2,type,
syntax7388354845996824322omatch:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > $o ) ).
thf(func_def_3,type,
syntax2379306206330768139omatch:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > $o ) ).
thf(func_def_4,type,
a2: a ).
thf(func_def_5,type,
b: a ).
thf(func_def_6,type,
c: a ).
thf(func_def_7,type,
f: a > a > a ).
thf(func_def_19,type,
sK0:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_20,type,
sK1:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_21,type,
sK2:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_22,type,
sK3:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_23,type,
sK4:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_25,type,
ph6:
!>[X0: $tType] : X0 ).
thf(f59,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f58,f50]) ).
thf(f50,plain,
! [X2: a,X0: a,X1: a] :
( ( f @ X0 @ ( f @ X1 @ X2 ) )
= ( f @ ( f @ X0 @ X1 ) @ X2 ) ),
inference(cnf_transformation,[status(thm)],[f35]) ).
thf(f35,plain,
! [X0: a,X1: a,X2: a] :
( ( f @ X0 @ ( f @ X1 @ X2 ) )
= ( f @ ( f @ X0 @ X1 ) @ X2 ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,axiom,
! [X2: a,X3: a,X4: a] :
( ( f @ X2 @ ( f @ X3 @ X4 ) )
= ( f @ ( f @ X2 @ X3 ) @ X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.tLlFlsQEXE/DTF2THF_11510.p',fact_3_right__assoc) ).
thf(f58,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ a2 @ ( f @ b @ c ) ) ),
inference(forward_demodulation,[status(thm)],[f57,f49]) ).
thf(f49,plain,
! [X0: a,X1: a] :
( ( f @ X1 @ X0 )
= ( f @ X0 @ X1 ) ),
inference(cnf_transformation,[status(thm)],[f37]) ).
thf(f37,plain,
! [X0: a,X1: a] :
( ( f @ X1 @ X0 )
= ( f @ X0 @ X1 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X2: a,X3: a] :
( ( f @ X2 @ X3 )
= ( f @ X3 @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.tLlFlsQEXE/DTF2THF_11510.p',fact_1_commute) ).
thf(f57,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ a2 @ ( f @ c @ b ) ) ),
inference(forward_demodulation,[status(thm)],[f47,f50]) ).
thf(f47,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(cnf_transformation,[status(thm)],[f34]) ).
thf(f34,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(flattening,[status(thm)],[f14]) ).
thf(f14,negated_conjecture,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
thf(f13,conjecture,
( ( f @ ( f @ a2 @ b ) @ c )
= ( f @ ( f @ a2 @ c ) @ b ) ),
file('/export/starexec/sandbox/tmp/tmp.tLlFlsQEXE/DTF2THF_11510.p',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.17 % Problem : ITP209^2 : TPTP v9.2.1. Released v8.0.0.
% 0.09/0.18 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.13/0.40 % Computer : n026.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8042.1875MB
% 0.13/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Tue Feb 24 08:30:25 EST 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.20/0.51 ---- Original DTF file ---
% 0.20/0.52 thf(spec,logic,$$dhol).
% 0.20/0.52 %------------------------------------------------------------------------------
% 0.20/0.52 % File : ITP209^2 : TPTP v9.2.1. Released v8.0.0.
% 0.20/0.52 % Domain : Interactive Theorem Proving
% 0.20/0.52 % Problem : Sledgehammer problem Syntax_Match 00088_002922
% 0.20/0.52 % Version : [Des22] axioms.
% 0.20/0.52 % English :
% 0.20/0.52
% 0.20/0.52 % Refs : [BH+15] Blanchette et al. (2015), Mining the Archive of Formal
% 0.20/0.52 % : [Des22] Desharnais (2022), Email to Geoff Sutcliffe
% 0.20/0.52 % Source : [Des22]
% 0.20/0.52 % Names : 0023_Syntax_Match_00088_002922 [Des22]
% 0.20/0.52
% 0.20/0.52 % Status : Theorem
% 0.20/0.52 % Rating : 0.00 v8.1.0
% 0.20/0.52 % Syntax : Number of formulae : 21 ( 8 unt; 8 typ; 0 def)
% 0.20/0.52 % Number of atoms : 26 ( 15 equ; 0 cnn)
% 0.20/0.52 % Maximal formula atoms : 3 ( 2 avg)
% 0.20/0.52 % Number of connectives : 104 ( 0 ~; 0 |; 1 &; 97 @)
% 0.20/0.52 % ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% 0.20/0.52 % Maximal formula depth : 9 ( 5 avg)
% 0.20/0.52 % Number of types : 2 ( 1 usr)
% 0.20/0.52 % Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% 0.20/0.52 % Number of symbols : 9 ( 7 usr; 4 con; 0-4 aty)
% 0.20/0.52 % Number of variables : 54 ( 5 ^; 44 !; 0 ?; 54 :)
% 0.20/0.52 % ( 5 !>; 0 ?*; 0 @-; 0 @+)
% 0.20/0.52 % SPC : TH1_THM_EQU_NAR
% 0.20/0.52
% 0.20/0.52 % Comments : This file was generated by Isabelle (most likely Sledgehammer)
% 0.20/0.52 % from the van Emde Boas Trees session in the Archive of Formal
% 0.20/0.52 % proofs -
% 0.20/0.52 % www.isa-afp.org/browser_info/current/AFP/Van_Emde_Boas_Trees
% 0.20/0.52 % 2022-02-17 14:22:46.652
% 0.20/0.52 %------------------------------------------------------------------------------
% 0.20/0.52 % Could-be-implicit typings (1)
% 0.20/0.52 thf(ty_tf_a,type,
% 0.20/0.52 a: $tType ).
% 0.20/0.52
% 0.20/0.52 % Explicit typings (7)
% 0.20/0.52 thf(sy_c_Syntax__Match_Oac__operator,type,
% 0.20/0.52 syntax_ac_operator:
% 0.20/0.52 !>[A: $tType] : ( ( A > A > A ) > $o ) ).
% 0.20/0.52
% 0.20/0.52 thf(sy_c_Syntax__Match_Osyntax__fo__nomatch,type,
% 0.20/0.52 syntax7388354845996824322omatch:
% 0.20/0.52 !>[A: $tType,B: $tType] : ( A > B > $o ) ).
% 0.20/0.52
% 0.20/0.52 thf(sy_c_Syntax__Match_Osyntax__nomatch,type,
% 0.20/0.52 syntax2379306206330768139omatch:
% 0.20/0.52 !>[A: $tType,B: $tType] : ( A > B > $o ) ).
% 0.20/0.52
% 0.20/0.52 thf(sy_v_a,type,
% 0.20/0.52 a2: a ).
% 0.20/0.52
% 0.20/0.52 thf(sy_v_b,type,
% 0.20/0.52 b: a ).
% 0.20/0.52
% 0.20/0.52 thf(sy_v_c,type,
% 0.20/0.52 c: a ).
% 0.20/0.52
% 0.20/0.52 thf(sy_v_f,type,
% 0.20/0.52 f: a > a > a ).
% 0.20/0.52
% 0.20/0.52 % Relevant facts (12)
% 0.20/0.52 thf(fact_0_ac__operator__axioms,axiom,
% 0.20/0.52 syntax_ac_operator @ a @ f ).
% 0.20/0.52
% 0.20/0.52 % ac_operator_axioms
% 0.20/0.52 thf(fact_1_commute,axiom,
% 0.20/0.52 ! [A2: a,B2: a] :
% 0.20/0.52 ( ( f @ A2 @ B2 )
% 0.20/0.52 = ( f @ B2 @ A2 ) ) ).
% 0.20/0.52
% 0.20/0.52 % commute
% 0.20/0.52 thf(fact_2_left__commute,axiom,
% 0.20/0.52 ! [A2: a,B2: a,C: a] :
% 0.20/0.52 ( ( f @ A2 @ ( f @ B2 @ C ) )
% 0.20/0.52 = ( f @ B2 @ ( f @ A2 @ C ) ) ) ).
% 0.20/0.52
% 0.20/0.52 % left_commute
% 0.20/0.52 thf(fact_3_right__assoc,axiom,
% 0.20/0.52 ! [A2: a,B2: a,C: a] :
% 0.20/0.52 ( ( f @ ( f @ A2 @ B2 ) @ C )
% 0.20/0.52 = ( f @ A2 @ ( f @ B2 @ C ) ) ) ).
% 0.20/0.52
% 0.20/0.52 % right_assoc
% 0.20/0.52 thf(fact_4_syntax__nomatch__def,axiom,
% 0.20/0.52 ! [B: $tType,A: $tType] :
% 0.20/0.52 ( ( syntax2379306206330768139omatch @ A @ B )
% 0.20/0.52 = ( ^ [Pat: A,Obj: B] : $true ) ) ).
% 0.20/0.52
% 0.20/0.52 % syntax_nomatch_def
% 0.20/0.52 thf(fact_5_syntax__fo__nomatch__def,axiom,
% 0.20/0.52 ! [B: $tType,A: $tType] :
% 0.20/0.52 ( ( syntax7388354845996824322omatch @ A @ B )
% 0.20/0.52 = ( ^ [Pat: A,Obj: B] : $true ) ) ).
% 0.20/0.52
% 0.20/0.52 % syntax_fo_nomatch_def
% 0.20/0.52 thf(fact_6_ac__operator_Ointro,axiom,
% 0.20/0.52 ! [A: $tType,F: A > A > A] :
% 0.20/0.52 ( ! [A3: A,B3: A,C2: A] :
% 0.20/0.52 ( ( F @ ( F @ A3 @ B3 ) @ C2 )
% 0.20/0.52 = ( F @ A3 @ ( F @ B3 @ C2 ) ) )
% 0.20/0.52 => ( ! [A3: A,B3: A] :
% 0.20/0.52 ( ( F @ A3 @ B3 )
% 0.20/0.52 = ( F @ B3 @ A3 ) )
% 0.20/0.52 => ( syntax_ac_operator @ A @ F ) ) ) ).
% 0.20/0.52
% 0.20/0.52 % ac_operator.intro
% 0.20/0.52 thf(fact_7_ac__operator_Ocommute,axiom,
% 0.20/0.52 ! [A: $tType,F: A > A > A,A2: A,B2: A] :
% 0.20/0.52 ( ( syntax_ac_operator @ A @ F )
% 0.20/0.52 => ( ( F @ A2 @ B2 )
% 0.20/0.52 = ( F @ B2 @ A2 ) ) ) ).
% 0.20/0.52
% 0.20/0.52 % ac_operator.commute
% 0.20/0.52 thf(fact_8_ac__operator_Oleft__assoc,axiom,
% 0.20/0.52 ! [A: $tType,F: A > A > A,A2: A,B2: A,C: A] :
% 0.20/0.52 ( ( syntax_ac_operator @ A @ F )
% 0.20/0.52 => ( ( F @ A2 @ ( F @ B2 @ C ) )
% 0.20/0.52 = ( F @ ( F @ A2 @ B2 ) @ C ) ) ) ).
% 0.20/0.52
% 0.20/0.52 % ac_operator.left_assoc
% 0.20/0.52 thf(fact_9_ac__operator_Oright__assoc,axiom,
% 0.20/0.52 ! [A: $tType,F: A > A > A,A2: A,B2: A,C: A] :
% 0.20/0.52 ( ( syntax_ac_operator @ A @ F )
% 0.20/0.52 => ( ( F @ ( F @ A2 @ B2 ) @ C )
% 0.20/0.52 = ( F @ A2 @ ( F @ B2 @ C ) ) ) ) ).
% 0.20/0.52
% 0.20/0.52 % ac_operator.right_assoc
% 0.20/0.52 thf(fact_10_ac__operator_Oleft__commute,axiom,
% 0.20/0.52 ! [A: $tType,F: A > A > A,A2: A,B2: A,C: A] :
% 0.20/0.52 ( ( syntax_ac_operator @ A @ F )
% 0.20/0.52 => ( ( F @ A2 @ ( F @ B2 @ C ) )
% 0.20/0.52 = ( F @ B2 @ ( F @ A2 @ C ) ) ) ) ).
% 0.20/0.52
% 0.20/0.52 % ac_operator.left_commute
% 0.20/0.52 thf(fact_11_ac__operator__def,axiom,
% 0.20/0.52 ! [A: $tType] :
% 0.20/0.52 ( ( syntax_ac_operator @ A )
% 0.20/0.52 = ( ^ [F2: A > A > A] :
% 0.20/0.52 ( ! [A4: A,B4: A,C3: A] :
% 0.20/0.52 ( ( F2 @ ( F2 @ A4 @ B4 ) @ C3 )
% 0.20/0.52 = ( F2 @ A4 @ ( F2 @ B4 @ C3 ) ) )
% 0.20/0.52 & ! [A4: A,B4: A] :
% 0.20/0.52 ( ( F2 @ A4 @ B4 )
% 0.20/0.52 = ( F2 @ B4 @ A4 ) ) ) ) ) ).
% 0.20/0.52
% 0.20/0.52 % ac_operator_def
% 0.20/0.52
% 0.20/0.52 % Conjectures (1)
% 0.20/0.52 thf(conj_0,conjecture,
% 0.20/0.52 ( ( f @ ( f @ a2 @ b ) @ c )
% 0.20/0.52 = ( f @ ( f @ a2 @ c ) @ b ) ) ).
% 0.20/0.52
% 0.20/0.52 %------------------------------------------------------------------------------
% 0.20/0.52 ------------------------
% 1.90/1.69 ---- Embedded in THF ---
% 1.90/1.70 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.90/1.70 %%% Generated on Tue Feb 24 08:30:26 EST 2026
% 1.90/1.70 %%% using '$$dhol' embedding, version 1.3.0.
% 1.90/1.70 %%% Logic specification used:
% 1.90/1.70 %%% thf(spec, logic, $$dhol).
% 1.90/1.70
% 1.90/1.70 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.tLlFlsQEXE/DTF2DTF11510.p
% See solution above
% 2.11/1.70 ------------------------
% 2.11/1.71 ---- Cleaned THF ---
% 2.11/1.71 thf(ty_tf_a,type,
% 2.11/1.71 a: $tType ).
% 2.11/1.71
% 2.11/1.71 thf(sy_c_Syntax__Match_Oac__operator,type,
% 2.11/1.71 syntax_ac_operator:
% 2.11/1.71 !>[A: $tType] : ( ( A > A > A ) > $o ) ).
% 2.11/1.71
% 2.11/1.71 thf(sy_c_Syntax__Match_Osyntax__fo__nomatch,type,
% 2.11/1.71 syntax7388354845996824322omatch:
% 2.11/1.71 !>[A: $tType,B: $tType] : ( A > B > $o ) ).
% 2.11/1.71
% 2.11/1.71 thf(sy_c_Syntax__Match_Osyntax__nomatch,type,
% 2.11/1.71 syntax2379306206330768139omatch:
% 2.11/1.71 !>[A: $tType,B: $tType] : ( A > B > $o ) ).
% 2.11/1.71
% 2.11/1.71 thf(sy_v_a,type,
% 2.11/1.71 a2: a ).
% 2.11/1.71
% 2.11/1.71 thf(sy_v_b,type,
% 2.11/1.71 b: a ).
% 2.11/1.71
% 2.11/1.71 thf(sy_v_c,type,
% 2.11/1.71 c: a ).
% 2.11/1.71
% 2.11/1.71 thf(sy_v_f,type,
% 2.11/1.71 f: a > a > a ).
% 2.11/1.71
% 2.11/1.71 thf(fact_0_ac__operator__axioms,axiom,
% 2.11/1.71 syntax_ac_operator @ a @ f ).
% 2.11/1.71
% 2.11/1.71 thf(fact_1_commute,axiom,
% 2.11/1.71 ! [A2: a,B2: a] :
% 2.11/1.71 ( ( f @ A2 @ B2 )
% 2.11/1.71 = ( f @ B2 @ A2 ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_2_left__commute,axiom,
% 2.11/1.71 ! [A2: a,B2: a,C: a] :
% 2.11/1.71 ( ( f @ A2 @ ( f @ B2 @ C ) )
% 2.11/1.71 = ( f @ B2 @ ( f @ A2 @ C ) ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_3_right__assoc,axiom,
% 2.11/1.71 ! [A2: a,B2: a,C: a] :
% 2.11/1.71 ( ( f @ ( f @ A2 @ B2 ) @ C )
% 2.11/1.71 = ( f @ A2 @ ( f @ B2 @ C ) ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_4_syntax__nomatch__def,axiom,
% 2.11/1.71 ! [B: $tType,A: $tType] :
% 2.11/1.71 ( ( syntax2379306206330768139omatch @ A @ B )
% 2.11/1.71 = ( ^ [Pat: A,Obj: B] : $true ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_5_syntax__fo__nomatch__def,axiom,
% 2.11/1.71 ! [B: $tType,A: $tType] :
% 2.11/1.71 ( ( syntax7388354845996824322omatch @ A @ B )
% 2.11/1.71 = ( ^ [Pat: A,Obj: B] : $true ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_6_ac__operator_Ointro,axiom,
% 2.11/1.71 ! [A: $tType,F: A > A > A] :
% 2.11/1.71 ( ! [A3: A,B3: A,C2: A] :
% 2.11/1.71 ( ( F @ ( F @ A3 @ B3 ) @ C2 )
% 2.11/1.71 = ( F @ A3 @ ( F @ B3 @ C2 ) ) )
% 2.11/1.71 => ( ! [A3: A,B3: A] :
% 2.11/1.71 ( ( F @ A3 @ B3 )
% 2.11/1.71 = ( F @ B3 @ A3 ) )
% 2.11/1.71 => ( syntax_ac_operator @ A @ F ) ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_7_ac__operator_Ocommute,axiom,
% 2.11/1.71 ! [A: $tType,F: A > A > A,A2: A,B2: A] :
% 2.11/1.71 ( ( syntax_ac_operator @ A @ F )
% 2.11/1.71 => ( ( F @ A2 @ B2 )
% 2.11/1.71 = ( F @ B2 @ A2 ) ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_8_ac__operator_Oleft__assoc,axiom,
% 2.11/1.71 ! [A: $tType,F: A > A > A,A2: A,B2: A,C: A] :
% 2.11/1.71 ( ( syntax_ac_operator @ A @ F )
% 2.11/1.71 => ( ( F @ A2 @ ( F @ B2 @ C ) )
% 2.11/1.71 = ( F @ ( F @ A2 @ B2 ) @ C ) ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_9_ac__operator_Oright__assoc,axiom,
% 2.11/1.71 ! [A: $tType,F: A > A > A,A2: A,B2: A,C: A] :
% 2.11/1.71 ( ( syntax_ac_operator @ A @ F )
% 2.11/1.71 => ( ( F @ ( F @ A2 @ B2 ) @ C )
% 2.11/1.71 = ( F @ A2 @ ( F @ B2 @ C ) ) ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_10_ac__operator_Oleft__commute,axiom,
% 2.11/1.71 ! [A: $tType,F: A > A > A,A2: A,B2: A,C: A] :
% 2.11/1.71 ( ( syntax_ac_operator @ A @ F )
% 2.11/1.71 => ( ( F @ A2 @ ( F @ B2 @ C ) )
% 2.11/1.71 = ( F @ B2 @ ( F @ A2 @ C ) ) ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(fact_11_ac__operator__def,axiom,
% 2.11/1.71 ! [A: $tType] :
% 2.11/1.71 ( ( syntax_ac_operator @ A )
% 2.11/1.71 = ( ^ [F2: A > A > A] :
% 2.11/1.71 ( ! [A4: A,B4: A,C3: A] :
% 2.11/1.71 ( ( F2 @ ( F2 @ A4 @ B4 ) @ C3 )
% 2.11/1.71 = ( F2 @ A4 @ ( F2 @ B4 @ C3 ) ) )
% 2.11/1.71 & ! [A4: A,B4: A] :
% 2.11/1.71 ( ( F2 @ A4 @ B4 )
% 2.11/1.71 = ( F2 @ B4 @ A4 ) ) ) ) ) ).
% 2.11/1.71
% 2.11/1.71 thf(conj_0,conjecture,
% 2.11/1.71 ( ( f @ ( f @ a2 @ b ) @ c )
% 2.11/1.71 = ( f @ ( f @ a2 @ c ) @ b ) ) ).
% 2.11/1.71 ------------------------
% 2.11/1.73 % (11608)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_11510 for (2999ds/4Mi)
% 2.11/1.73 % (11611)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_11510 for (2999ds/2Mi)
% 2.11/1.73 % (11610)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_11510 for (2999ds/2Mi)
% 2.11/1.73 % (11607)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_11510 for (2999ds/183Mi)
% 2.11/1.73 % (11609)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_11510 for (2999ds/27Mi)
% 2.11/1.73 % (11612)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_11510 for (2999ds/275Mi)
% 2.11/1.73 % (11613)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_11510 for (2999ds/18Mi)
% 2.11/1.73 % (11610)Instruction limit reached!
% 2.11/1.73 % (11610)------------------------------
% 2.11/1.73 % (11610)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.11/1.73 % (11610)Termination reason: Unknown
% 2.11/1.73 % (11610)Termination phase: shuffling
% 2.11/1.73 % (11611)Instruction limit reached!
% 2.11/1.73 % (11611)------------------------------
% 2.11/1.73 % (11611)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.11/1.73 % (11611)Termination reason: Unknown
% 2.11/1.73 % (11611)Termination phase: shuffling
% 2.11/1.73
% 2.11/1.73 % (11611)Memory used [KB]: 1023
% 2.11/1.73 % (11611)Time elapsed: 0.003 s
% 2.11/1.73 % (11611)Instructions burned: 2 (million)
% 2.11/1.73 % (11611)------------------------------
% 2.11/1.73 % (11611)------------------------------
% 2.11/1.73
% 2.11/1.73 % (11610)Memory used [KB]: 1023
% 2.11/1.73 % (11610)Time elapsed: 0.003 s
% 2.11/1.73 % (11610)Instructions burned: 2 (million)
% 2.11/1.73 % (11610)------------------------------
% 2.11/1.73 % (11610)------------------------------
% 2.11/1.74 % (11608)Instruction limit reached!
% 2.11/1.74 % (11608)------------------------------
% 2.11/1.74 % (11608)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.11/1.74 % (11608)Termination reason: Unknown
% 2.11/1.74 % (11608)Termination phase: Property scanning
% 2.11/1.74
% 2.11/1.74 % (11608)Memory used [KB]: 1023
% 2.11/1.74 % (11608)Time elapsed: 0.005 s
% 2.11/1.74 % (11608)Instructions burned: 5 (million)
% 2.11/1.74 % (11608)------------------------------
% 2.11/1.74 % (11608)------------------------------
% 2.11/1.74 % (11612)First to succeed.
% 2.11/1.74 % (11612)Refutation found. Thanks to Tanya!
% 2.11/1.74 % SZS status Theorem for DTF2THF_11510
% 2.11/1.74 % SZS output start Proof for DTF2THF_11510
% 2.11/1.74 thf(type_def_6, type, a: $tType).
% 2.11/1.74 thf(func_def_0, type, a: $tType).
% 2.11/1.74 thf(func_def_1, type, syntax_ac_operator: !>[X0: $tType]:((X0 > X0 > X0) > $o)).
% 2.11/1.74 thf(func_def_2, type, syntax7388354845996824322omatch: !>[X0: $tType, X1: $tType]:(X0 > X1 > $o)).
% 2.11/1.74 thf(func_def_3, type, syntax2379306206330768139omatch: !>[X0: $tType, X1: $tType]:(X0 > X1 > $o)).
% 2.11/1.74 thf(func_def_4, type, a2: a).
% 2.11/1.74 thf(func_def_5, type, b: a).
% 2.11/1.74 thf(func_def_6, type, c: a).
% 2.11/1.74 thf(func_def_7, type, f: a > a > a).
% 2.11/1.74 thf(func_def_19, type, sK0: !>[X0: $tType]:((X0 > X0 > X0) > X0)).
% 2.11/1.74 thf(func_def_20, type, sK1: !>[X0: $tType]:((X0 > X0 > X0) > X0)).
% 2.11/1.74 thf(func_def_21, type, sK2: !>[X0: $tType]:((X0 > X0 > X0) > X0)).
% 2.11/1.74 thf(func_def_22, type, sK3: !>[X0: $tType]:((X0 > X0 > X0) > X0)).
% 2.11/1.74 thf(func_def_23, type, sK4: !>[X0: $tType]:((X0 > X0 > X0) > X0)).
% 2.11/1.74 thf(func_def_25, type, ph6: !>[X0: $tType]:(X0)).
% 2.11/1.74 thf(f59,plain,(
% 2.11/1.74 $false),
% 2.11/1.74 inference(subsumption_resolution,[status(thm)],[f58,f50])).
% 2.11/1.74 thf(f50,plain,(
% 2.11/1.74 ( ! [X2 : a,X0 : a,X1 : a] : (((f @ X0 @ (f @ X1 @ X2)) = (f @ (f @ X0 @ X1) @ X2))) )),
% 2.11/1.74 inference(cnf_transformation,[status(thm)],[f35])).
% 2.11/1.74 thf(f35,plain,(
% 2.11/1.74 ! [X0 : a,X1 : a,X2 : a] : ((f @ X0 @ (f @ X1 @ X2)) = (f @ (f @ X0 @ X1) @ X2))),
% 2.11/1.74 inference(rectify,[status(thm)],[f4])).
% 2.11/1.74 thf(f4,axiom,(
% 2.11/1.74 ! [X2 : a,X3 : a,X4 : a] : ((f @ X2 @ (f @ X3 @ X4)) = (f @ (f @ X2 @ X3) @ X4))),
% 2.11/1.74 file('/export/starexec/sandbox/tmp/tmp.tLlFlsQEXE/DTF2THF_11510.p',fact_3_right__assoc)).
% 2.11/1.74 thf(f58,plain,(
% 2.11/1.74 ((f @ (f @ a2 @ b) @ c) != (f @ a2 @ (f @ b @ c)))),
% 2.11/1.74 inference(forward_demodulation,[status(thm)],[f57,f49])).
% 2.11/1.74 thf(f49,plain,(
% 2.11/1.74 ( ! [X0 : a,X1 : a] : (((f @ X1 @ X0) = (f @ X0 @ X1))) )),
% 2.11/1.74 inference(cnf_transformation,[status(thm)],[f37])).
% 2.11/1.74 thf(f37,plain,(
% 2.11/1.74 ! [X0 : a,X1 : a] : ((f @ X1 @ X0) = (f @ X0 @ X1))),
% 2.11/1.74 inference(rectify,[status(thm)],[f2])).
% 2.11/1.74 thf(f2,axiom,(
% 2.11/1.74 ! [X2 : a,X3 : a] : ((f @ X2 @ X3) = (f @ X3 @ X2))),
% 2.11/1.74 file('/export/starexec/sandbox/tmp/tmp.tLlFlsQEXE/DTF2THF_11510.p',fact_1_commute)).
% 2.11/1.74 thf(f57,plain,(
% 2.11/1.74 ((f @ (f @ a2 @ b) @ c) != (f @ a2 @ (f @ c @ b)))),
% 2.11/1.74 inference(forward_demodulation,[status(thm)],[f47,f50])).
% 2.11/1.74 thf(f47,plain,(
% 2.11/1.74 ((f @ (f @ a2 @ b) @ c) != (f @ (f @ a2 @ c) @ b))),
% 2.11/1.74 inference(cnf_transformation,[status(thm)],[f34])).
% 2.11/1.74 thf(f34,plain,(
% 2.11/1.74 ((f @ (f @ a2 @ b) @ c) != (f @ (f @ a2 @ c) @ b))),
% 2.11/1.74 inference(flattening,[status(thm)],[f14])).
% 2.11/1.74 thf(f14,negated_conjecture,(
% 2.11/1.74 ~((f @ (f @ a2 @ b) @ c) = (f @ (f @ a2 @ c) @ b))),
% 2.11/1.74 inference(negated_conjecture,[status(cth)],[f13])).
% 2.11/1.74 thf(f13,conjecture,(
% 2.11/1.74 ((f @ (f @ a2 @ b) @ c) = (f @ (f @ a2 @ c) @ b))),
% 2.11/1.74 file('/export/starexec/sandbox/tmp/tmp.tLlFlsQEXE/DTF2THF_11510.p',conj_0)).
% 2.11/1.74 % SZS output end Proof for DTF2THF_11510
% 2.11/1.74 % (11612)------------------------------
% 2.11/1.74 % (11612)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.11/1.74 % (11612)Termination reason: Refutation
% 2.11/1.74
% 2.11/1.74 % (11612)Memory used [KB]: 5500
% 2.11/1.74 % (11612)Time elapsed: 0.005 s
% 2.11/1.74 % (11612)Instructions burned: 5 (million)
% 2.11/1.74 % (11612)------------------------------
% 2.11/1.74 % (11612)------------------------------
% 2.11/1.74 % (11606)Success in time 0.023 s
%------------------------------------------------------------------------------