%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET171^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:31:21 AM UTC 2026
% Result : Theorem 1.60s 1.31s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 57 ( 12 unt; 0 typ; 5 def)
% Number of atoms : 350 ( 88 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 380 ( 30 ~; 115 |; 38 &; 191 @)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 38 ( 20 ^; 12 !; 6 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_8,type,
sK0: a > $o ).
thf(func_def_9,type,
sK1: a > $o ).
thf(func_def_10,type,
sK2: a > $o ).
thf(func_def_12,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
sK5: a ).
thf(f100,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f63,f70,f79,f85,f92,f99]) ).
thf(f99,plain,
( ~ spl3_1
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[status(thm)],[f98]) ).
thf(f98,plain,
( $false
| ~ spl3_1
| ~ spl3_5 ),
inference(trivial_inequality_removal,[status(thm)],[f95]) ).
thf(f95,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_5 ),
inference(superposition,[status(thm)],[f58,f78]) ).
thf(f78,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ~ spl3_5 ),
inference(avatar_component_clause,[status(thm)],[f76]) ).
thf(f76,definition,
( spl3_5
<=> ( $false
= ( sK1 @ sK5 ) ) ),
introduced(definition,[new_symbols(naming,[spl3_5])],[avatar_definition]) ).
thf(f58,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[status(thm)],[f56]) ).
thf(f56,definition,
( spl3_1
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl3_1])],[avatar_definition]) ).
thf(f92,plain,
( ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[status(thm)],[f91]) ).
thf(f91,plain,
( $false
| ~ spl3_3
| ~ spl3_4 ),
inference(trivial_inequality_removal,[status(thm)],[f87]) ).
thf(f87,plain,
( ( $false = $true )
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[status(thm)],[f74,f67]) ).
thf(f67,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[status(thm)],[f65]) ).
thf(f65,definition,
( spl3_3
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(definition,[new_symbols(naming,[spl3_3])],[avatar_definition]) ).
thf(f74,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[status(thm)],[f72]) ).
thf(f72,definition,
( spl3_4
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(definition,[new_symbols(naming,[spl3_4])],[avatar_definition]) ).
thf(f85,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[status(thm)],[f84]) ).
thf(f84,plain,
( $false
| ~ spl3_2 ),
inference(trivial_inequality_removal,[status(thm)],[f80]) ).
thf(f80,plain,
( ( $false = $true )
| ~ spl3_2 ),
inference(superposition,[status(thm)],[f40,f62]) ).
thf(f62,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl3_2 ),
inference(avatar_component_clause,[status(thm)],[f60]) ).
thf(f60,definition,
( spl3_2
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl3_2])],[avatar_definition]) ).
thf(f40,plain,
( $false
= ( sK0 @ sK5 ) ),
inference(duplicate_literal_removal,[status(thm)],[f38]) ).
thf(f38,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f37]) ).
thf(f37,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[status(thm)],[f32]) ).
thf(f32,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f31]) ).
thf(f31,plain,
( ( $false
= ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f14]) ).
thf(f14,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ( ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK0 @ sK5 ) )
= $false )
| ( $false
= ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK0 @ sK5 ) )
!= ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
| ( sK0 @ Y0 ) )
@ sK5 )
!= ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
| ( sK0 @ Y0 ) )
& ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
@ sK5 ) ),
inference(negative_extensionality,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
| ( sK0 @ Y0 ) )
& ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
| ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
| ( sK0 @ Y0 ) )
& ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
| ( sK0 @ Y0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ( X1 @ Y0 ) )
| ( X0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
| ( X0 @ Y0 ) )
& ( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) )
=> ( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
| ( sK0 @ Y0 ) )
& ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ( sK1 @ Y0 ) )
| ( sK0 @ Y0 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ( X1 @ Y0 ) )
| ( X0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
| ( X0 @ Y0 ) )
& ( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ( X1 @ Y0 ) )
| ( X0 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
| ( X0 @ Y0 ) )
& ( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
| ( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) )
= ( ^ [X4: a] :
( ( ( X0 @ X4 )
| ( X1 @ X4 ) )
& ( ( X0 @ X4 )
| ( X2 @ X4 ) ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
| ( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) )
= ( ^ [X4: a] :
( ( ( X0 @ X4 )
| ( X1 @ X4 ) )
& ( ( X0 @ X4 )
| ( X2 @ X4 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
| ( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) )
= ( ^ [X4: a] :
( ( ( X0 @ X4 )
| ( X1 @ X4 ) )
& ( ( X0 @ X4 )
| ( X2 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.b9CGcqmrdV/DTF2THF_5637.p',cBOOL_PROP_71_pme) ).
thf(f79,plain,
( spl3_4
| spl3_5 ),
inference(avatar_split_clause,[status(thm)],[f22,f76,f72]) ).
thf(f22,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(duplicate_literal_removal,[status(thm)],[f21]) ).
thf(f21,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f20]) ).
thf(f20,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
( ( $false
= ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f16]) ).
thf(f16,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $false
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f15]) ).
thf(f15,plain,
( ( $false
= ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) ) )
| ( $false
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f13]) ).
thf(f70,plain,
( spl3_2
| spl3_3 ),
inference(avatar_split_clause,[status(thm)],[f48,f65,f60]) ).
thf(f48,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f47]) ).
thf(f47,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f45]) ).
thf(f45,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f44]) ).
thf(f44,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f43]) ).
thf(f43,plain,
( ( $true
= ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f41]) ).
thf(f41,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $true )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
thf(f12,plain,
( ( ( ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) )
| ( sK0 @ sK5 ) )
= $true )
| ( ( ( ( sK2 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
thf(f63,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[status(thm)],[f54,f60,f56]) ).
thf(f54,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f53]) ).
thf(f53,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f49]) ).
thf(f49,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f42]) ).
thf(f42,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET171^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n002.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 11:54:18 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.30/0.46 ---- Original DTF file ---
% 0.30/0.46 thf(spec,logic,$$dhol).
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 % File : SET171^5 : TPTP v9.2.1. Released v4.0.0.
% 0.30/0.46 % Domain : Set Theory
% 0.30/0.46 % Problem : TPS problem BOOL-PROP-71
% 0.30/0.46 % Version : Especial.
% 0.30/0.46 % English : Trybulec's 71st Boolean property of sets
% 0.30/0.46
% 0.30/0.46 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.30/0.46 % : [Bar92] Barker-Plummer D (1992), Gazing: An Approach to the Pr
% 0.30/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.30/0.46 % Source : [Bro09]
% 0.30/0.46 % Names : tps_0301 [Bro09]
% 0.30/0.46 % : 30 [Bar92]
% 0.30/0.46 % : GAZING-THM30 [TPS]
% 0.30/0.46 % : BOOL-PROP-71 [TPS]
% 0.30/0.46
% 0.30/0.46 % Status : Theorem
% 0.30/0.46 % Rating : 0.00 v8.2.0, 0.08 v8.1.0, 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.00 v6.1.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.1, 0.33 v4.0.0
% 0.30/0.46 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.30/0.46 % Number of atoms : 1 ( 1 equ; 0 cnn)
% 0.30/0.46 % Maximal formula atoms : 1 ( 1 avg)
% 0.30/0.46 % Number of connectives : 12 ( 0 ~; 3 |; 2 &; 7 @)
% 0.30/0.46 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.30/0.46 % Maximal formula depth : 4 ( 4 avg)
% 0.30/0.46 % Number of types : 2 ( 1 usr)
% 0.30/0.46 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.30/0.46 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.30/0.46 % Number of variables : 5 ( 2 ^; 3 !; 0 ?; 5 :)
% 0.30/0.46 % SPC : TH0_THM_EQU_NAR
% 0.30/0.46
% 0.30/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.30/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.30/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.30/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.30/0.46 % : Polymorphic definitions expanded.
% 0.30/0.46 % :
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 thf(a_type,type,
% 0.30/0.46 a: $tType ).
% 0.30/0.46
% 0.30/0.46 thf(cBOOL_PROP_71_pme,conjecture,
% 0.30/0.46 ! [X: a > $o,Y: a > $o,Z: a > $o] :
% 0.30/0.46 ( ( ^ [Xz: a] :
% 0.30/0.46 ( ( X @ Xz )
% 0.30/0.46 | ( ( Y @ Xz )
% 0.30/0.46 & ( Z @ Xz ) ) ) )
% 0.30/0.46 = ( ^ [Xx: a] :
% 0.30/0.46 ( ( ( X @ Xx )
% 0.30/0.46 | ( Y @ Xx ) )
% 0.30/0.46 & ( ( X @ Xx )
% 0.30/0.46 | ( Z @ Xx ) ) ) ) ) ).
% 0.30/0.46
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.47 ------------------------
% 1.44/1.27 ---- Embedded in THF ---
% 1.44/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.44/1.28 %%% Generated on Tue Feb 24 11:54:19 EST 2026
% 1.44/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.44/1.28 %%% Logic specification used:
% 1.44/1.28 %%% thf(spec, logic, $$dhol).
% 1.44/1.28
% 1.44/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.b9CGcqmrdV/DTF2DTF5637.p
% See solution above
% 1.44/1.28 ------------------------
% 1.44/1.29 ---- Cleaned THF ---
% 1.44/1.29 thf(a_type,type,
% 1.44/1.29 a: $tType ).
% 1.44/1.29
% 1.44/1.29 thf(cBOOL_PROP_71_pme,conjecture,
% 1.44/1.29 ! [X: a > $o,Y: a > $o,Z: a > $o] :
% 1.44/1.29 ( ( ^ [Xz: a] :
% 1.44/1.29 ( ( X @ Xz )
% 1.44/1.29 | ( ( Y @ Xz )
% 1.44/1.29 & ( Z @ Xz ) ) ) )
% 1.44/1.29 = ( ^ [Xx: a] :
% 1.44/1.29 ( ( ( X @ Xx )
% 1.44/1.29 | ( Y @ Xx ) )
% 1.44/1.29 & ( ( X @ Xx )
% 1.44/1.29 | ( Z @ Xx ) ) ) ) ) ).
% 1.44/1.29 ------------------------
% 1.60/1.30 % (5969)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_5637 for (2999ds/2Mi)
% 1.60/1.30 % (5969)Instruction limit reached!
% 1.60/1.30 % (5969)------------------------------
% 1.60/1.30 % (5969)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.30 % (5969)Termination reason: Unknown
% 1.60/1.30 % (5969)Termination phase: Saturation
% 1.60/1.30
% 1.60/1.30 % (5969)Memory used [KB]: 5373
% 1.60/1.30 % (5969)Time elapsed: 0.002 s
% 1.60/1.30 % (5969)Instructions burned: 2 (million)
% 1.60/1.30 % (5969)------------------------------
% 1.60/1.30 % (5969)------------------------------
% 1.60/1.31 % (5965)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_5637 for (2999ds/183Mi)
% 1.60/1.31 % (5966)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_5637 for (2999ds/4Mi)
% 1.60/1.31 % (5967)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_5637 for (2999ds/27Mi)
% 1.60/1.31 % (5968)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_5637 for (2999ds/2Mi)
% 1.60/1.31 % (5970)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_5637 for (2999ds/275Mi)
% 1.60/1.31 % (5971)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_5637 for (2999ds/18Mi)
% 1.60/1.31 % (5968)Instruction limit reached!
% 1.60/1.31 % (5968)------------------------------
% 1.60/1.31 % (5968)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.31 % (5968)Termination reason: Unknown
% 1.60/1.31 % (5968)Termination phase: Saturation
% 1.60/1.31
% 1.60/1.31 % (5968)Memory used [KB]: 895
% 1.60/1.31 % (5968)Time elapsed: 0.003 s
% 1.60/1.31 % (5968)Instructions burned: 2 (million)
% 1.60/1.31 % (5968)------------------------------
% 1.60/1.31 % (5968)------------------------------
% 1.60/1.31 % (5972)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_5637 for (2999ds/3Mi)
% 1.60/1.31 % (5965)First to succeed.
% 1.60/1.31 % (5966)Instruction limit reached!
% 1.60/1.31 % (5966)------------------------------
% 1.60/1.31 % (5966)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.31 % (5966)Termination reason: Unknown
% 1.60/1.31 % (5966)Termination phase: Saturation
% 1.60/1.31
% 1.60/1.31 % (5966)Memory used [KB]: 5500
% 1.60/1.31 % (5966)Time elapsed: 0.005 s
% 1.60/1.31 % (5966)Instructions burned: 4 (million)
% 1.60/1.31 % (5966)------------------------------
% 1.60/1.31 % (5966)------------------------------
% 1.60/1.31 % (5972)Refutation not found, incomplete strategy
% 1.60/1.31 % (5972)------------------------------
% 1.60/1.31 % (5972)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.31 % (5972)Termination reason: Refutation not found, incomplete strategy
% 1.60/1.31
% 1.60/1.31
% 1.60/1.31 % (5972)Memory used [KB]: 5500
% 1.60/1.31 % (5972)Time elapsed: 0.001 s
% 1.60/1.31 % (5972)Instructions burned: 1 (million)
% 1.60/1.31 % (5972)------------------------------
% 1.60/1.31 % (5972)------------------------------
% 1.60/1.31 % (5967)Also succeeded, but the first one will report.
% 1.60/1.31 % (5970)Also succeeded, but the first one will report.
% 1.60/1.31 % (5965)Refutation found. Thanks to Tanya!
% 1.60/1.31 % SZS status Theorem for DTF2THF_5637
% 1.60/1.31 % SZS output start Proof for DTF2THF_5637
% 1.60/1.31 thf(type_def_5, type, a: $tType).
% 1.60/1.31 thf(func_def_0, type, a: $tType).
% 1.60/1.31 thf(func_def_8, type, sK0: a > $o).
% 1.60/1.31 thf(func_def_9, type, sK1: a > $o).
% 1.60/1.31 thf(func_def_10, type, sK2: a > $o).
% 1.60/1.31 thf(func_def_12, type, ph4: !>[X0: $tType]:(X0)).
% 1.60/1.31 thf(func_def_13, type, sK5: a).
% 1.60/1.31 thf(f100,plain,(
% 1.60/1.31 $false),
% 1.60/1.31 inference(avatar_sat_refutation,[status(thm)],[f63,f70,f79,f85,f92,f99])).
% 1.60/1.31 thf(f99,plain,(
% 1.60/1.31 ~spl3_1 | ~spl3_5),
% 1.60/1.31 inference(avatar_contradiction_clause,[status(thm)],[f98])).
% 1.60/1.31 thf(f98,plain,(
% 1.60/1.31 $false | (~spl3_1 | ~spl3_5)),
% 1.60/1.31 inference(trivial_inequality_removal,[status(thm)],[f95])).
% 1.60/1.31 thf(f95,plain,(
% 1.60/1.31 ($false = $true) | (~spl3_1 | ~spl3_5)),
% 1.60/1.31 inference(superposition,[status(thm)],[f58,f78])).
% 1.60/1.31 thf(f78,plain,(
% 1.60/1.31 ($false = (sK1 @ sK5)) | ~spl3_5),
% 1.60/1.31 inference(avatar_component_clause,[status(thm)],[f76])).
% 1.60/1.31 thf(f76,definition,(
% 1.60/1.31 spl3_5 <=> ($false = (sK1 @ sK5))),
% 1.60/1.31 introduced(definition,[new_symbols(naming,[spl3_5])],[avatar_definition])).
% 1.60/1.31 thf(f58,plain,(
% 1.60/1.31 ((sK1 @ sK5) = $true) | ~spl3_1),
% 1.60/1.31 inference(avatar_component_clause,[status(thm)],[f56])).
% 1.60/1.31 thf(f56,definition,(
% 1.60/1.31 spl3_1 <=> ((sK1 @ sK5) = $true)),
% 1.60/1.31 introduced(definition,[new_symbols(naming,[spl3_1])],[avatar_definition])).
% 1.60/1.31 thf(f92,plain,(
% 1.60/1.31 ~spl3_3 | ~spl3_4),
% 1.60/1.31 inference(avatar_contradiction_clause,[status(thm)],[f91])).
% 1.60/1.31 thf(f91,plain,(
% 1.60/1.31 $false | (~spl3_3 | ~spl3_4)),
% 1.60/1.31 inference(trivial_inequality_removal,[status(thm)],[f87])).
% 1.60/1.31 thf(f87,plain,(
% 1.60/1.31 ($false = $true) | (~spl3_3 | ~spl3_4)),
% 1.60/1.31 inference(superposition,[status(thm)],[f74,f67])).
% 1.60/1.31 thf(f67,plain,(
% 1.60/1.31 ($true = (sK2 @ sK5)) | ~spl3_3),
% 1.60/1.31 inference(avatar_component_clause,[status(thm)],[f65])).
% 1.60/1.31 thf(f65,definition,(
% 1.60/1.31 spl3_3 <=> ($true = (sK2 @ sK5))),
% 1.60/1.31 introduced(definition,[new_symbols(naming,[spl3_3])],[avatar_definition])).
% 1.60/1.31 thf(f74,plain,(
% 1.60/1.31 ($false = (sK2 @ sK5)) | ~spl3_4),
% 1.60/1.31 inference(avatar_component_clause,[status(thm)],[f72])).
% 1.60/1.31 thf(f72,definition,(
% 1.60/1.31 spl3_4 <=> ($false = (sK2 @ sK5))),
% 1.60/1.31 introduced(definition,[new_symbols(naming,[spl3_4])],[avatar_definition])).
% 1.60/1.31 thf(f85,plain,(
% 1.60/1.31 ~spl3_2),
% 1.60/1.31 inference(avatar_contradiction_clause,[status(thm)],[f84])).
% 1.60/1.31 thf(f84,plain,(
% 1.60/1.31 $false | ~spl3_2),
% 1.60/1.31 inference(trivial_inequality_removal,[status(thm)],[f80])).
% 1.60/1.31 thf(f80,plain,(
% 1.60/1.31 ($false = $true) | ~spl3_2),
% 1.60/1.31 inference(superposition,[status(thm)],[f40,f62])).
% 1.60/1.31 thf(f62,plain,(
% 1.60/1.31 ((sK0 @ sK5) = $true) | ~spl3_2),
% 1.60/1.31 inference(avatar_component_clause,[status(thm)],[f60])).
% 1.60/1.31 thf(f60,definition,(
% 1.60/1.31 spl3_2 <=> ((sK0 @ sK5) = $true)),
% 1.60/1.31 introduced(definition,[new_symbols(naming,[spl3_2])],[avatar_definition])).
% 1.60/1.31 thf(f40,plain,(
% 1.60/1.31 ($false = (sK0 @ sK5))),
% 1.60/1.31 inference(duplicate_literal_removal,[status(thm)],[f38])).
% 1.60/1.31 thf(f38,plain,(
% 1.60/1.31 ($false = (sK0 @ sK5)) | ($false = (sK0 @ sK5))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f37])).
% 1.60/1.31 thf(f37,plain,(
% 1.60/1.31 ($false = ((sK2 @ sK5) | (sK0 @ sK5))) | ($false = (sK0 @ sK5))),
% 1.60/1.31 inference(duplicate_literal_removal,[status(thm)],[f32])).
% 1.60/1.31 thf(f32,plain,(
% 1.60/1.31 ($false = (sK0 @ sK5)) | ($false = (sK0 @ sK5)) | ($false = ((sK2 @ sK5) | (sK0 @ sK5)))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f31])).
% 1.60/1.31 thf(f31,plain,(
% 1.60/1.31 ($false = ((sK1 @ sK5) | (sK0 @ sK5))) | ($false = (sK0 @ sK5)) | ($false = ((sK2 @ sK5) | (sK0 @ sK5)))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f14])).
% 1.60/1.31 thf(f14,plain,(
% 1.60/1.31 ($false = (sK0 @ sK5)) | ($false = (((sK2 @ sK5) | (sK0 @ sK5)) & ((sK1 @ sK5) | (sK0 @ sK5))))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.60/1.31 thf(f13,plain,(
% 1.60/1.31 ((((sK2 @ sK5) & (sK1 @ sK5)) | (sK0 @ sK5)) = $false) | ($false = (((sK2 @ sK5) | (sK0 @ sK5)) & ((sK1 @ sK5) | (sK0 @ sK5))))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.60/1.31 thf(f11,plain,(
% 1.60/1.31 ((((sK2 @ sK5) & (sK1 @ sK5)) | (sK0 @ sK5)) != (((sK2 @ sK5) | (sK0 @ sK5)) & ((sK1 @ sK5) | (sK0 @ sK5))))),
% 1.60/1.31 inference(beta_eta_normalization,[status(thm)],[f10])).
% 1.60/1.31 thf(f10,plain,(
% 1.60/1.31 (((^[Y0 : a]: (((sK2 @ Y0) & (sK1 @ Y0)) | (sK0 @ Y0))) @ sK5) != ((^[Y0 : a]: (((sK2 @ Y0) | (sK0 @ Y0)) & ((sK1 @ Y0) | (sK0 @ Y0)))) @ sK5))),
% 1.60/1.31 inference(negative_extensionality,[status(thm)],[f9])).
% 1.60/1.31 thf(f9,plain,(
% 1.60/1.31 ((^[Y0 : a]: (((sK2 @ Y0) | (sK0 @ Y0)) & ((sK1 @ Y0) | (sK0 @ Y0)))) != (^[Y0 : a]: (((sK2 @ Y0) & (sK1 @ Y0)) | (sK0 @ Y0))))),
% 1.60/1.31 inference(cnf_transformation,[status(thm)],[f8])).
% 1.60/1.31 thf(f8,plain,(
% 1.60/1.31 ((^[Y0 : a]: (((sK2 @ Y0) | (sK0 @ Y0)) & ((sK1 @ Y0) | (sK0 @ Y0)))) != (^[Y0 : a]: (((sK2 @ Y0) & (sK1 @ Y0)) | (sK0 @ Y0))))),
% 1.60/1.31 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7])).
% 1.60/1.31 thf(f7,plain,(
% 1.60/1.31 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[Y0 : a]: (((X2 @ Y0) & (X1 @ Y0)) | (X0 @ Y0))) != (^[Y0 : a]: (((X2 @ Y0) | (X0 @ Y0)) & ((X1 @ Y0) | (X0 @ Y0))))) => ((^[Y0 : a]: (((sK2 @ Y0) | (sK0 @ Y0)) & ((sK1 @ Y0) | (sK0 @ Y0)))) != (^[Y0 : a]: (((sK2 @ Y0) & (sK1 @ Y0)) | (sK0 @ Y0))))),
% 1.60/1.31 introduced(definition,[],[choice_axiom])).
% 1.60/1.31 thf(f6,plain,(
% 1.60/1.31 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[Y0 : a]: (((X2 @ Y0) & (X1 @ Y0)) | (X0 @ Y0))) != (^[Y0 : a]: (((X2 @ Y0) | (X0 @ Y0)) & ((X1 @ Y0) | (X0 @ Y0)))))),
% 1.60/1.31 inference(ennf_transformation,[status(thm)],[f5])).
% 1.60/1.31 thf(f5,plain,(
% 1.60/1.31 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[Y0 : a]: (((X2 @ Y0) & (X1 @ Y0)) | (X0 @ Y0))) = (^[Y0 : a]: (((X2 @ Y0) | (X0 @ Y0)) & ((X1 @ Y0) | (X0 @ Y0)))))),
% 1.60/1.31 inference(fool_elimination,[status(thm)],[f4])).
% 1.60/1.31 thf(f4,plain,(
% 1.60/1.31 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[X3 : a] : ((X0 @ X3) | ((X1 @ X3) & (X2 @ X3)))) = (^[X4 : a] : (((X0 @ X4) | (X1 @ X4)) & ((X0 @ X4) | (X2 @ X4)))))),
% 1.60/1.31 inference(rectify,[status(thm)],[f2])).
% 1.60/1.31 thf(f2,negated_conjecture,(
% 1.60/1.31 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[X3 : a] : ((X0 @ X3) | ((X1 @ X3) & (X2 @ X3)))) = (^[X4 : a] : (((X0 @ X4) | (X1 @ X4)) & ((X0 @ X4) | (X2 @ X4)))))),
% 1.60/1.31 inference(negated_conjecture,[status(cth)],[f1])).
% 1.60/1.31 thf(f1,conjecture,(
% 1.60/1.31 ! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[X3 : a] : ((X0 @ X3) | ((X1 @ X3) & (X2 @ X3)))) = (^[X4 : a] : (((X0 @ X4) | (X1 @ X4)) & ((X0 @ X4) | (X2 @ X4)))))),
% 1.60/1.31 file('/export/starexec/sandbox/tmp/tmp.b9CGcqmrdV/DTF2THF_5637.p',cBOOL_PROP_71_pme)).
% 1.60/1.31 thf(f79,plain,(
% 1.60/1.31 spl3_4 | spl3_5),
% 1.60/1.31 inference(avatar_split_clause,[status(thm)],[f22,f76,f72])).
% 1.60/1.31 thf(f22,plain,(
% 1.60/1.31 ($false = (sK1 @ sK5)) | ($false = (sK2 @ sK5))),
% 1.60/1.31 inference(duplicate_literal_removal,[status(thm)],[f21])).
% 1.60/1.31 thf(f21,plain,(
% 1.60/1.31 ($false = (sK2 @ sK5)) | ($false = (sK2 @ sK5)) | ($false = (sK1 @ sK5)) | ($false = (sK1 @ sK5))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f20])).
% 1.60/1.31 thf(f20,plain,(
% 1.60/1.31 ($false = (sK2 @ sK5)) | ($false = ((sK2 @ sK5) & (sK1 @ sK5))) | ($false = (sK1 @ sK5))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.60/1.31 thf(f18,plain,(
% 1.60/1.31 ($false = ((sK1 @ sK5) | (sK0 @ sK5))) | ($false = ((sK2 @ sK5) & (sK1 @ sK5))) | ($false = (sK2 @ sK5))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f16])).
% 1.60/1.31 thf(f16,plain,(
% 1.60/1.31 ($false = ((sK2 @ sK5) | (sK0 @ sK5))) | ($false = ((sK1 @ sK5) | (sK0 @ sK5))) | ($false = ((sK2 @ sK5) & (sK1 @ sK5)))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f15])).
% 1.60/1.31 thf(f15,plain,(
% 1.60/1.31 ($false = (((sK2 @ sK5) | (sK0 @ sK5)) & ((sK1 @ sK5) | (sK0 @ sK5)))) | ($false = ((sK2 @ sK5) & (sK1 @ sK5)))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.60/1.31 thf(f70,plain,(
% 1.60/1.31 spl3_2 | spl3_3),
% 1.60/1.31 inference(avatar_split_clause,[status(thm)],[f48,f65,f60])).
% 1.60/1.31 thf(f48,plain,(
% 1.60/1.31 ($true = (sK2 @ sK5)) | ((sK0 @ sK5) = $true)),
% 1.60/1.31 inference(duplicate_literal_removal,[status(thm)],[f47])).
% 1.60/1.31 thf(f47,plain,(
% 1.60/1.31 ((sK0 @ sK5) = $true) | ($true = (sK2 @ sK5)) | ($true = (sK2 @ sK5))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f45])).
% 1.60/1.31 thf(f45,plain,(
% 1.60/1.31 ($true = (sK2 @ sK5)) | ($true = ((sK2 @ sK5) & (sK1 @ sK5))) | ((sK0 @ sK5) = $true)),
% 1.60/1.31 inference(duplicate_literal_removal,[status(thm)],[f44])).
% 1.60/1.31 thf(f44,plain,(
% 1.60/1.31 ($true = (sK2 @ sK5)) | ((sK0 @ sK5) = $true) | ((sK0 @ sK5) = $true) | ($true = ((sK2 @ sK5) & (sK1 @ sK5)))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f43])).
% 1.60/1.31 thf(f43,plain,(
% 1.60/1.31 ($true = ((sK2 @ sK5) | (sK0 @ sK5))) | ($true = ((sK2 @ sK5) & (sK1 @ sK5))) | ((sK0 @ sK5) = $true)),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f41])).
% 1.60/1.31 thf(f41,plain,(
% 1.60/1.31 ((sK0 @ sK5) = $true) | ((((sK2 @ sK5) | (sK0 @ sK5)) & ((sK1 @ sK5) | (sK0 @ sK5))) = $true) | ($true = ((sK2 @ sK5) & (sK1 @ sK5)))),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.60/1.31 thf(f12,plain,(
% 1.60/1.31 ((((sK2 @ sK5) & (sK1 @ sK5)) | (sK0 @ sK5)) = $true) | ((((sK2 @ sK5) | (sK0 @ sK5)) & ((sK1 @ sK5) | (sK0 @ sK5))) = $true)),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.60/1.31 thf(f63,plain,(
% 1.60/1.31 spl3_1 | spl3_2),
% 1.60/1.31 inference(avatar_split_clause,[status(thm)],[f54,f60,f56])).
% 1.60/1.31 thf(f54,plain,(
% 1.60/1.31 ((sK1 @ sK5) = $true) | ((sK0 @ sK5) = $true)),
% 1.60/1.31 inference(duplicate_literal_removal,[status(thm)],[f53])).
% 1.60/1.31 thf(f53,plain,(
% 1.60/1.31 ((sK0 @ sK5) = $true) | ((sK1 @ sK5) = $true) | ((sK0 @ sK5) = $true) | ((sK1 @ sK5) = $true)),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f49])).
% 1.60/1.31 thf(f49,plain,(
% 1.60/1.31 ((sK1 @ sK5) = $true) | (((sK1 @ sK5) | (sK0 @ sK5)) = $true) | ((sK0 @ sK5) = $true)),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f42])).
% 1.60/1.31 thf(f42,plain,(
% 1.60/1.31 ((sK0 @ sK5) = $true) | ($true = ((sK2 @ sK5) & (sK1 @ sK5))) | (((sK1 @ sK5) | (sK0 @ sK5)) = $true)),
% 1.60/1.31 inference(binary_proxy_clausification,[status(thm)],[f41])).
% 1.60/1.31 % SZS output end Proof for DTF2THF_5637
% 1.60/1.31 % (5965)------------------------------
% 1.60/1.31 % (5965)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.31 % (5965)Termination reason: Refutation
% 1.60/1.31
% 1.60/1.31 % (5965)Memory used [KB]: 5500
% 1.60/1.31 % (5965)Time elapsed: 0.006 s
% 1.60/1.31 % (5965)Instructions burned: 3 (million)
% 1.60/1.31 % (5965)------------------------------
% 1.60/1.31 % (5965)------------------------------
% 1.60/1.31 % (5964)Success in time 0.02 s
%------------------------------------------------------------------------------