%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV049^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n002.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 09:40:09 AM UTC 2026
% Result : Theorem 1.27s 1.16s
% Output : Refutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 130 ( 41 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 171 ( 17 ~; 7 |; 24 &; 116 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 86 ( 86 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 32 ^; 24 !; 18 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_4,type,
sK0: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_5,type,
sK1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_6,type,
sK2: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_9,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f42,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f41]) ).
thf(f41,plain,
$false = $true,
inference(duplicate_literal_removal,[status(thm)],[f40]) ).
thf(f40,plain,
( ( $false = $true )
| ( $false = $true ) ),
inference(beta_eta_normalization,[status(thm)],[f19]) ).
thf(f19,plain,
( ( $true
= ( ^ [Y0: $i > $o,Y1: $i > $o] : $false
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) )
| ( ( ^ [Y0: $i > $o,Y1: $i > $o] : $false
@ ( sK1
@ ^ [Y0: $i > $o,Y1: $i > $o] : $false )
@ ( sK0
@ ^ [Y0: $i > $o,Y1: $i > $o] : $false ) )
= $true ) ),
inference(primitive_instantiation,[status(thm)],[f13]) ).
thf(f13,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X0 @ ( sK1 @ X0 ) @ ( sK0 @ X0 ) )
= $true )
| ( $true
= ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) ) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( $true
= ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) )
| ( ( ( X0 @ ( sK2 @ X0 ) @ ( sK1 @ X0 ) )
= $true )
& ( ( X0 @ ( sK2 @ X0 ) @ ( sK0 @ X0 ) )
!= $true )
& ( ( X0 @ ( sK1 @ X0 ) @ ( sK0 @ X0 ) )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11]) ).
thf(f11,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( ( X0 @ X3 @ X2 )
= $true )
& ( ( X0 @ X3 @ X1 )
!= $true )
& ( $true
= ( X0 @ X2 @ X1 ) ) )
=> ( ( ( X0 @ ( sK2 @ X0 ) @ ( sK1 @ X0 ) )
= $true )
& ( ( X0 @ ( sK2 @ X0 ) @ ( sK0 @ X0 ) )
!= $true )
& ( ( X0 @ ( sK1 @ X0 ) @ ( sK0 @ X0 ) )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( $true
= ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) )
| ? [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( ( X0 @ X3 @ X2 )
= $true )
& ( ( X0 @ X3 @ X1 )
!= $true )
& ( $true
= ( X0 @ X2 @ X1 ) ) ) ),
inference(rectify,[status(thm)],[f9]) ).
thf(f9,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( $true
= ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) )
| ? [X2: $i > $o,X1: $i > $o,X3: $i > $o] :
( ( ( X0 @ X3 @ X1 )
= $true )
& ( ( X0 @ X3 @ X2 )
!= $true )
& ( ( X0 @ X1 @ X2 )
= $true ) ) ),
inference(flattening,[status(thm)],[f8]) ).
thf(f8,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( $true
= ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) )
| ? [X3: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X3 @ X2 )
!= $true )
& ( ( X0 @ X3 @ X1 )
= $true )
& ( ( X0 @ X1 @ X2 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( $true
!= ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) )
& ! [X3: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( ( X0 @ X3 @ X1 )
= $true )
& ( ( X0 @ X1 @ X2 )
= $true ) )
=> ( ( X0 @ X3 @ X2 )
= $true ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( $true
!= ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) )
& ! [X3: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( ( X0 @ X3 @ X1 )
= $true )
& ( ( X0 @ X1 @ X2 )
= $true ) )
=> ( ( X0 @ X3 @ X2 )
= $true ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( $true
!= ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false ) )
& ! [X3: $i > $o,X4: $i > $o,X5: $i > $o] :
( ( ( ( X0 @ X5 @ X3 )
= $true )
& ( ( X0 @ X3 @ X4 )
= $true ) )
=> ( $true
= ( X0 @ X5 @ X4 ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X0
@ ^ [X1: $i] : $true
@ ^ [X2: $i] : $false )
& ! [X3: $i > $o,X4: $i > $o,X5: $i > $o] :
( ( ( X0 @ X5 @ X3 )
& ( X0 @ X3 @ X4 ) )
=> ( X0 @ X5 @ X4 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X0
@ ^ [X1: $i] : $true
@ ^ [X1: $i] : $false )
& ! [X2: $i > $o,X3: $i > $o,X1: $i > $o] :
( ( ( X0 @ X1 @ X2 )
& ( X0 @ X2 @ X3 ) )
=> ( X0 @ X1 @ X3 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X0
@ ^ [X1: $i] : $true
@ ^ [X1: $i] : $false )
& ! [X2: $i > $o,X3: $i > $o,X1: $i > $o] :
( ( ( X0 @ X1 @ X2 )
& ( X0 @ X2 @ X3 ) )
=> ( X0 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XLJW7s4pUE/DTF2THF_1762.p',cTHM120A_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEV049^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.13/0.32 % Computer : n002.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue Feb 24 12:39:33 EST 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.32 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.39 ---- Original DTF file ---
% 0.17/0.39 thf(spec,logic,$$dhol).
% 0.17/0.39 %------------------------------------------------------------------------------
% 0.17/0.39 % File : SEV049^5 : TPTP v9.2.1. Released v4.0.0.
% 0.17/0.39 % Domain : Set Theory (Relations)
% 0.17/0.39 % Problem : TPS problem THM120A
% 0.17/0.39 % Version : Especial.
% 0.17/0.39 % English : Variant of THM120 designed to eliminate trivial proof. Subset is
% 0.17/0.39 % one such relation.
% 0.17/0.39
% 0.17/0.39 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.39 % Source : [Bro09]
% 0.17/0.39 % Names : tps_0137 [Bro09]
% 0.17/0.39 % : THM120A [TPS]
% 0.17/0.39
% 0.17/0.39 % Status : Theorem
% 0.17/0.39 % Rating : 0.00 v8.1.0, 0.08 v7.4.0, 0.00 v7.3.0, 0.10 v7.2.0, 0.00 v6.2.0, 0.33 v6.1.0, 0.17 v6.0.0, 0.00 v4.0.1, 0.33 v4.0.0
% 0.17/0.39 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.17/0.39 % Number of atoms : 2 ( 0 equ; 0 cnn)
% 0.17/0.39 % Maximal formula atoms : 2 ( 2 avg)
% 0.17/0.39 % Number of connectives : 12 ( 1 ~; 0 |; 2 &; 8 @)
% 0.17/0.39 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.17/0.39 % Maximal formula depth : 10 ( 10 avg)
% 0.17/0.39 % Number of types : 2 ( 0 usr)
% 0.17/0.39 % Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% 0.17/0.39 % Number of symbols : 2 ( 0 usr; 2 con; 0-0 aty)
% 0.17/0.39 % Number of variables : 6 ( 2 ^; 3 !; 1 ?; 6 :)
% 0.17/0.39 % SPC : TH0_THM_NEQ_NAR
% 0.17/0.39
% 0.17/0.39 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.17/0.39 % project in the Department of Mathematical Sciences at Carnegie
% 0.17/0.39 % Mellon University. Distributed under the Creative Commons copyleft
% 0.17/0.39 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.17/0.39 % : Polymorphic definitions expanded.
% 0.17/0.39 %------------------------------------------------------------------------------
% 0.17/0.39 thf(cTHM120A_pme,conjecture,
% 0.17/0.39 ? [R: ( $i > $o ) > ( $i > $o ) > $o] :
% 0.17/0.39 ( ~ ( R
% 0.17/0.39 @ ^ [Xx: $i] : $true
% 0.17/0.39 @ ^ [Xx: $i] : $false )
% 0.17/0.39 & ! [Xx: $i > $o,Xy: $i > $o,Xz: $i > $o] :
% 0.17/0.39 ( ( ( R @ Xx @ Xy )
% 0.17/0.39 & ( R @ Xy @ Xz ) )
% 0.17/0.39 => ( R @ Xx @ Xz ) ) ) ).
% 0.17/0.39
% 0.17/0.39 %------------------------------------------------------------------------------
% 0.17/0.39 ------------------------
% 1.27/1.13 ---- Embedded in THF ---
% 1.27/1.13 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.27/1.13 %%% Generated on Tue Feb 24 12:39:34 EST 2026
% 1.27/1.13 %%% using '$$dhol' embedding, version 1.3.0.
% 1.27/1.13 %%% Logic specification used:
% 1.27/1.13 %%% thf(spec, logic, $$dhol).
% 1.27/1.13
% 1.27/1.13 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.XLJW7s4pUE/DTF2DTF1762.p
% See solution above
% 1.27/1.13 ------------------------
% 1.27/1.14 ---- Cleaned THF ---
% 1.27/1.14 thf(cTHM120A_pme,conjecture,
% 1.27/1.14 ? [R: ( $i > $o ) > ( $i > $o ) > $o] :
% 1.27/1.14 ( ~ ( R
% 1.27/1.14 @ ^ [Xx: $i] : $true
% 1.27/1.14 @ ^ [Xx: $i] : $false )
% 1.27/1.14 & ! [Xx: $i > $o,Xy: $i > $o,Xz: $i > $o] :
% 1.27/1.14 ( ( ( R @ Xx @ Xy )
% 1.27/1.14 & ( R @ Xy @ Xz ) )
% 1.27/1.14 => ( R @ Xx @ Xz ) ) ) ).
% 1.27/1.14 ------------------------
% 1.27/1.15 % (1862)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_1762 for (3000ds/183Mi)
% 1.27/1.15 % (1862)First to succeed.
% 1.27/1.16 % (1862)Refutation found. Thanks to Tanya!
% 1.27/1.16 % SZS status Theorem for DTF2THF_1762
% 1.27/1.16 % SZS output start Proof for DTF2THF_1762
% 1.27/1.16 thf(func_def_4, type, sK0: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 1.27/1.16 thf(func_def_5, type, sK1: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 1.27/1.16 thf(func_def_6, type, sK2: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 1.27/1.16 thf(func_def_9, type, ph4: !>[X0: $tType]:(X0)).
% 1.27/1.16 thf(f42,plain,(
% 1.27/1.16 $false),
% 1.27/1.16 inference(trivial_inequality_removal,[status(thm)],[f41])).
% 1.27/1.16 thf(f41,plain,(
% 1.27/1.16 ($false = $true)),
% 1.27/1.16 inference(duplicate_literal_removal,[status(thm)],[f40])).
% 1.27/1.16 thf(f40,plain,(
% 1.27/1.16 ($false = $true) | ($false = $true)),
% 1.27/1.16 inference(beta_eta_normalization,[status(thm)],[f19])).
% 1.27/1.16 thf(f19,plain,(
% 1.27/1.16 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ($false)))) @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false)))) | (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ($false)))) @ (sK1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ($false))))) @ (sK0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ($false)))))) = $true)),
% 1.27/1.16 inference(primitive_instantiation,[status(thm)],[f13])).
% 1.27/1.16 thf(f13,plain,(
% 1.27/1.16 ( ! [X0 : ($i > $o) > ($i > $o) > $o] : (((X0 @ (sK1 @ X0) @ (sK0 @ X0)) = $true) | ($true = (X0 @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false))))) )),
% 1.27/1.16 inference(cnf_transformation,[status(thm)],[f12])).
% 1.27/1.16 thf(f12,plain,(
% 1.27/1.16 ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (X0 @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false)))) | (((X0 @ (sK2 @ X0) @ (sK1 @ X0)) = $true) & ((X0 @ (sK2 @ X0) @ (sK0 @ X0)) != $true) & ((X0 @ (sK1 @ X0) @ (sK0 @ X0)) = $true)))),
% 1.27/1.16 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11])).
% 1.27/1.16 thf(f11,plain,(
% 1.27/1.16 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X1 : $i > $o,X2 : $i > $o,X3 : $i > $o] : (((X0 @ X3 @ X2) = $true) & ((X0 @ X3 @ X1) != $true) & ($true = (X0 @ X2 @ X1))) => (((X0 @ (sK2 @ X0) @ (sK1 @ X0)) = $true) & ((X0 @ (sK2 @ X0) @ (sK0 @ X0)) != $true) & ((X0 @ (sK1 @ X0) @ (sK0 @ X0)) = $true)))),
% 1.27/1.16 introduced(definition,[],[choice_axiom])).
% 1.27/1.16 thf(f10,plain,(
% 1.27/1.16 ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (X0 @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false)))) | ? [X1 : $i > $o,X2 : $i > $o,X3 : $i > $o] : (((X0 @ X3 @ X2) = $true) & ((X0 @ X3 @ X1) != $true) & ($true = (X0 @ X2 @ X1))))),
% 1.27/1.16 inference(rectify,[status(thm)],[f9])).
% 1.27/1.16 thf(f9,plain,(
% 1.27/1.16 ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (X0 @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false)))) | ? [X2 : $i > $o,X1 : $i > $o,X3 : $i > $o] : (((X0 @ X3 @ X1) = $true) & ((X0 @ X3 @ X2) != $true) & ((X0 @ X1 @ X2) = $true)))),
% 1.27/1.16 inference(flattening,[status(thm)],[f8])).
% 1.27/1.16 thf(f8,plain,(
% 1.27/1.16 ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (X0 @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false)))) | ? [X3 : $i > $o,X1 : $i > $o,X2 : $i > $o] : (((X0 @ X3 @ X2) != $true) & (((X0 @ X3 @ X1) = $true) & ((X0 @ X1 @ X2) = $true))))),
% 1.27/1.16 inference(ennf_transformation,[status(thm)],[f7])).
% 1.27/1.16 thf(f7,plain,(
% 1.27/1.16 ~? [X0 : ($i > $o) > ($i > $o) > $o] : (($true != (X0 @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false)))) & ! [X3 : $i > $o,X1 : $i > $o,X2 : $i > $o] : ((((X0 @ X3 @ X1) = $true) & ((X0 @ X1 @ X2) = $true)) => ((X0 @ X3 @ X2) = $true)))),
% 1.27/1.16 inference(flattening,[status(thm)],[f6])).
% 1.27/1.16 thf(f6,plain,(
% 1.27/1.16 ~? [X0 : ($i > $o) > ($i > $o) > $o] : (~($true = (X0 @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false)))) & ! [X3 : $i > $o,X1 : $i > $o,X2 : $i > $o] : ((((X0 @ X3 @ X1) = $true) & ((X0 @ X1 @ X2) = $true)) => ((X0 @ X3 @ X2) = $true)))),
% 1.27/1.16 inference(rectify,[status(thm)],[f5])).
% 1.27/1.16 thf(f5,plain,(
% 1.27/1.16 ~? [X0 : ($i > $o) > ($i > $o) > $o] : (~($true = (X0 @ (^[Y0 : $i]: ($true)) @ (^[Y0 : $i]: ($false)))) & ! [X3 : $i > $o,X4 : $i > $o,X5 : $i > $o] : ((((X0 @ X5 @ X3) = $true) & ((X0 @ X3 @ X4) = $true)) => ($true = (X0 @ X5 @ X4))))),
% 1.27/1.16 inference(fool_elimination,[status(thm)],[f4])).
% 1.27/1.16 thf(f4,plain,(
% 1.27/1.16 ~? [X0 : ($i > $o) > ($i > $o) > $o] : (~(X0 @ (^[X1 : $i] : ($true)) @ (^[X2 : $i] : ($false))) & ! [X3 : $i > $o,X4 : $i > $o,X5 : $i > $o] : (((X0 @ X5 @ X3) & (X0 @ X3 @ X4)) => (X0 @ X5 @ X4)))),
% 1.27/1.16 inference(rectify,[status(thm)],[f2])).
% 1.27/1.16 thf(f2,negated_conjecture,(
% 1.27/1.16 ~? [X0 : ($i > $o) > ($i > $o) > $o] : (~(X0 @ (^[X1 : $i] : ($true)) @ (^[X1 : $i] : ($false))) & ! [X2 : $i > $o,X3 : $i > $o,X1 : $i > $o] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X3)) => (X0 @ X1 @ X3)))),
% 1.27/1.16 inference(negated_conjecture,[status(cth)],[f1])).
% 1.27/1.16 thf(f1,conjecture,(
% 1.27/1.16 ? [X0 : ($i > $o) > ($i > $o) > $o] : (~(X0 @ (^[X1 : $i] : ($true)) @ (^[X1 : $i] : ($false))) & ! [X2 : $i > $o,X3 : $i > $o,X1 : $i > $o] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X3)) => (X0 @ X1 @ X3)))),
% 1.27/1.16 file('/export/starexec/sandbox/tmp/tmp.XLJW7s4pUE/DTF2THF_1762.p',cTHM120A_pme)).
% 1.27/1.16 % SZS output end Proof for DTF2THF_1762
% 1.27/1.16 % (1862)------------------------------
% 1.27/1.16 % (1862)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.27/1.16 % (1862)Termination reason: Refutation
% 1.27/1.16
% 1.27/1.16 % (1862)Memory used [KB]: 5500
% 1.27/1.16 % (1862)Time elapsed: 0.003 s
% 1.27/1.16 % (1862)Instructions burned: 4 (million)
% 1.27/1.16 % (1862)------------------------------
% 1.27/1.16 % (1862)------------------------------
% 1.27/1.16 % (1861)Success in time 0.012 s
%------------------------------------------------------------------------------