%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO277^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n028.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:53:50 AM UTC 2026
% Result : Theorem 1.46s 1.28s
% Output : Refutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 1 unt; 0 typ; 6 def)
% Number of atoms : 385 ( 113 equ; 0 cnn)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 400 ( 88 ~; 83 |; 19 &; 187 @)
% ( 10 <=>; 12 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 56 ( 56 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 96 ( 22 ^; 50 !; 24 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_5,type,
sK2: $i > $i > $o ).
thf(func_def_6,type,
sK3: $i > $o ).
thf(func_def_7,type,
sK4: ( $i > $i > $o ) > $i ).
thf(func_def_10,type,
ph6:
!>[X0: $tType] : X0 ).
thf(f93,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f26,f31,f36,f43,f44,f72,f73,f90,f92]) ).
thf(f92,plain,
( ~ spl5_2
| spl5_3
| ~ spl5_6 ),
inference(avatar_contradiction_clause,[status(thm)],[f91]) ).
thf(f91,plain,
( $false
| ~ spl5_2
| spl5_3
| ~ spl5_6 ),
inference(subsumption_resolution,[status(thm)],[f82,f25]) ).
thf(f25,plain,
( ! [X3: $i] :
( ( sK2 @ X3 @ X3 )
= $true )
| ~ spl5_2 ),
inference(avatar_component_clause,[status(thm)],[f24]) ).
thf(f24,definition,
( spl5_2
<=> ! [X3: $i] :
( ( sK2 @ X3 @ X3 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl5_2])],[avatar_definition]) ).
thf(f82,plain,
( ( ( sK2 @ sK0 @ sK0 )
!= $true )
| spl5_3
| ~ spl5_6 ),
inference(beta_eta_normalization,[status(thm)],[f81]) ).
thf(f81,plain,
( ( ( ^ [Y0: $i] :
( sK2
@ ( ^ [Y1: $i] : sK0
@ Y0 )
@ ( ^ [Y1: $i] : Y1
@ Y0 ) )
@ sK0 )
!= $true )
| spl5_3
| ~ spl5_6 ),
inference(trivial_inequality_removal,[status(thm)],[f80]) ).
thf(f80,plain,
( ( $true != $true )
| ( ( ^ [Y0: $i] :
( sK2
@ ( ^ [Y1: $i] : sK0
@ Y0 )
@ ( ^ [Y1: $i] : Y1
@ Y0 ) )
@ sK0 )
!= $true )
| spl5_3
| ~ spl5_6 ),
inference(superposition,[status(thm)],[f30,f42]) ).
thf(f42,plain,
( ! [X7: $i > $o] :
( ( ( X7 @ sK1 )
= $true )
| ( ( X7 @ sK0 )
!= $true ) )
| ~ spl5_6 ),
inference(avatar_component_clause,[status(thm)],[f41]) ).
thf(f41,definition,
( spl5_6
<=> ! [X7: $i > $o] :
( ( ( X7 @ sK1 )
= $true )
| ( ( X7 @ sK0 )
!= $true ) ) ),
introduced(definition,[new_symbols(naming,[spl5_6])],[avatar_definition]) ).
thf(f30,plain,
( ( ( sK2 @ sK0 @ sK1 )
!= $true )
| spl5_3 ),
inference(avatar_component_clause,[status(thm)],[f28]) ).
thf(f28,definition,
( spl5_3
<=> ( ( sK2 @ sK0 @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl5_3])],[avatar_definition]) ).
thf(f90,plain,
( ~ spl5_4
| spl5_1
| ~ spl5_6 ),
inference(avatar_split_clause,[status(thm)],[f87,f41,f20,f33]) ).
thf(f33,definition,
( spl5_4
<=> ( ( sK3 @ sK0 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl5_4])],[avatar_definition]) ).
thf(f20,definition,
( spl5_1
<=> ( ( sK3 @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl5_1])],[avatar_definition]) ).
thf(f87,plain,
( ( ( sK3 @ sK0 )
!= $true )
| spl5_1
| ~ spl5_6 ),
inference(beta_eta_normalization,[status(thm)],[f86]) ).
thf(f86,plain,
( ( $true
!= ( ^ [Y0: $i] :
( sK3
@ ( ^ [Y1: $i] : Y1
@ Y0 ) )
@ sK0 ) )
| spl5_1
| ~ spl5_6 ),
inference(trivial_inequality_removal,[status(thm)],[f79]) ).
thf(f79,plain,
( ( $true != $true )
| ( $true
!= ( ^ [Y0: $i] :
( sK3
@ ( ^ [Y1: $i] : Y1
@ Y0 ) )
@ sK0 ) )
| spl5_1
| ~ spl5_6 ),
inference(superposition,[status(thm)],[f22,f42]) ).
thf(f22,plain,
( ( ( sK3 @ sK1 )
!= $true )
| spl5_1 ),
inference(avatar_component_clause,[status(thm)],[f20]) ).
thf(f73,plain,
( ~ spl5_4
| spl5_1
| ~ spl5_5 ),
inference(avatar_split_clause,[status(thm)],[f70,f38,f20,f33]) ).
thf(f38,definition,
( spl5_5
<=> ! [X5: $i > $i > $o] :
( ( ( X5 @ sK0 @ sK1 )
= $true )
| ( ( X5 @ ( sK4 @ X5 ) @ ( sK4 @ X5 ) )
!= $true ) ) ),
introduced(definition,[new_symbols(naming,[spl5_5])],[avatar_definition]) ).
thf(f70,plain,
( ( ( sK3 @ sK0 )
!= $true )
| spl5_1
| ~ spl5_5 ),
inference(superposition,[status(thm)],[f22,f60]) ).
thf(f60,plain,
( ( sK0 = sK1 )
| ~ spl5_5 ),
inference(equality_proxy_clausification,[status(thm)],[f59]) ).
thf(f59,plain,
( ( ( sK1 = sK0 )
= $true )
| ~ spl5_5 ),
inference(trivial_inequality_removal,[status(thm)],[f58]) ).
thf(f58,plain,
( ( ( sK1 = sK0 )
= $true )
| ( $true != $true )
| ~ spl5_5 ),
inference(boolean_simplification,[status(thm)],[f57]) ).
thf(f57,plain,
( ( ( sK1 = sK0 )
= $true )
| ( ( ( sK4
@ ^ [Y0: $i,Y1: $i] : ( Y1 = Y0 ) )
= ( sK4
@ ^ [Y0: $i,Y1: $i] : ( Y1 = Y0 ) ) )
!= $true )
| ~ spl5_5 ),
inference(beta_eta_normalization,[status(thm)],[f45]) ).
thf(f45,plain,
( ( ( ^ [Y0: $i,Y1: $i] : ( Y1 = Y0 )
@ ( sK4
@ ^ [Y0: $i,Y1: $i] : ( Y1 = Y0 ) )
@ ( sK4
@ ^ [Y0: $i,Y1: $i] : ( Y1 = Y0 ) ) )
!= $true )
| ( ( ^ [Y0: $i,Y1: $i] : ( Y1 = Y0 )
@ sK0
@ sK1 )
= $true )
| ~ spl5_5 ),
inference(primitive_instantiation,[status(thm)],[f39]) ).
thf(f39,plain,
( ! [X5: $i > $i > $o] :
( ( ( X5 @ ( sK4 @ X5 ) @ ( sK4 @ X5 ) )
!= $true )
| ( ( X5 @ sK0 @ sK1 )
= $true ) )
| ~ spl5_5 ),
inference(avatar_component_clause,[status(thm)],[f38]) ).
thf(f72,plain,
( ~ spl5_2
| spl5_3
| ~ spl5_5 ),
inference(avatar_contradiction_clause,[status(thm)],[f71]) ).
thf(f71,plain,
( $false
| ~ spl5_2
| spl5_3
| ~ spl5_5 ),
inference(subsumption_resolution,[status(thm)],[f69,f25]) ).
thf(f69,plain,
( ( ( sK2 @ sK0 @ sK0 )
!= $true )
| spl5_3
| ~ spl5_5 ),
inference(superposition,[status(thm)],[f30,f60]) ).
thf(f44,plain,
( spl5_2
| spl5_4 ),
inference(avatar_split_clause,[status(thm)],[f18,f33,f24]) ).
thf(f18,plain,
! [X3: $i] :
( ( ( sK3 @ sK0 )
= $true )
| ( ( sK2 @ X3 @ X3 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ( ! [X3: $i] :
( ( sK2 @ X3 @ X3 )
= $true )
& ( ( sK2 @ sK0 @ sK1 )
!= $true ) )
| ( ( ( sK3 @ sK0 )
= $true )
& ( ( sK3 @ sK1 )
!= $true ) ) )
& ( ! [X5: $i > $i > $o] :
( ( ( X5 @ ( sK4 @ X5 ) @ ( sK4 @ X5 ) )
!= $true )
| ( ( X5 @ sK0 @ sK1 )
= $true ) )
| ! [X7: $i > $o] :
( ( ( X7 @ sK0 )
!= $true )
| ( ( X7 @ sK1 )
= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i] :
( ( ? [X2: $i > $i > $o] :
( ! [X3: $i] :
( ( X2 @ X3 @ X3 )
= $true )
& ( ( X2 @ X0 @ X1 )
!= $true ) )
| ? [X4: $i > $o] :
( ( ( X4 @ X0 )
= $true )
& ( ( X4 @ X1 )
!= $true ) ) )
& ( ! [X5: $i > $i > $o] :
( ? [X6: $i] :
( ( X5 @ X6 @ X6 )
!= $true )
| ( ( X5 @ X0 @ X1 )
= $true ) )
| ! [X7: $i > $o] :
( ( $true
!= ( X7 @ X0 ) )
| ( $true
= ( X7 @ X1 ) ) ) ) )
=> ( ( ? [X2: $i > $i > $o] :
( ! [X3: $i] :
( ( X2 @ X3 @ X3 )
= $true )
& ( ( X2 @ sK0 @ sK1 )
!= $true ) )
| ? [X4: $i > $o] :
( ( ( X4 @ sK0 )
= $true )
& ( ( X4 @ sK1 )
!= $true ) ) )
& ( ! [X5: $i > $i > $o] :
( ? [X6: $i] :
( ( X5 @ X6 @ X6 )
!= $true )
| ( ( X5 @ sK0 @ sK1 )
= $true ) )
| ! [X7: $i > $o] :
( ( ( X7 @ sK0 )
!= $true )
| ( ( X7 @ sK1 )
= $true ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ? [X2: $i > $i > $o] :
( ! [X3: $i] :
( ( X2 @ X3 @ X3 )
= $true )
& ( ( X2 @ sK0 @ sK1 )
!= $true ) )
=> ( ! [X3: $i] :
( ( sK2 @ X3 @ X3 )
= $true )
& ( ( sK2 @ sK0 @ sK1 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f11,plain,
( ? [X4: $i > $o] :
( ( ( X4 @ sK0 )
= $true )
& ( ( X4 @ sK1 )
!= $true ) )
=> ( ( ( sK3 @ sK0 )
= $true )
& ( ( sK3 @ sK1 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f12,plain,
! [X5: $i > $i > $o] :
( ? [X6: $i] :
( ( X5 @ X6 @ X6 )
!= $true )
=> ( ( X5 @ ( sK4 @ X5 ) @ ( sK4 @ X5 ) )
!= $true ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
? [X0: $i,X1: $i] :
( ( ? [X2: $i > $i > $o] :
( ! [X3: $i] :
( ( X2 @ X3 @ X3 )
= $true )
& ( ( X2 @ X0 @ X1 )
!= $true ) )
| ? [X4: $i > $o] :
( ( ( X4 @ X0 )
= $true )
& ( ( X4 @ X1 )
!= $true ) ) )
& ( ! [X5: $i > $i > $o] :
( ? [X6: $i] :
( ( X5 @ X6 @ X6 )
!= $true )
| ( ( X5 @ X0 @ X1 )
= $true ) )
| ! [X7: $i > $o] :
( ( $true
!= ( X7 @ X0 ) )
| ( $true
= ( X7 @ X1 ) ) ) ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
? [X0: $i,X1: $i] :
( ( ? [X3: $i > $i > $o] :
( ! [X4: $i] :
( ( X3 @ X4 @ X4 )
= $true )
& ( ( X3 @ X0 @ X1 )
!= $true ) )
| ? [X2: $i > $o] :
( ( ( X2 @ X0 )
= $true )
& ( ( X2 @ X1 )
!= $true ) ) )
& ( ! [X3: $i > $i > $o] :
( ? [X4: $i] :
( ( X3 @ X4 @ X4 )
!= $true )
| ( ( X3 @ X0 @ X1 )
= $true ) )
| ! [X2: $i > $o] :
( ( ( X2 @ X0 )
!= $true )
| ( ( X2 @ X1 )
= $true ) ) ) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: $i,X1: $i] :
( ! [X2: $i > $o] :
( ( ( X2 @ X0 )
!= $true )
| ( ( X2 @ X1 )
= $true ) )
<~> ! [X3: $i > $i > $o] :
( ? [X4: $i] :
( ( X3 @ X4 @ X4 )
!= $true )
| ( ( X3 @ X0 @ X1 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: $i,X1: $i] :
( ! [X3: $i > $i > $o] :
( ! [X4: $i] :
( ( X3 @ X4 @ X4 )
= $true )
=> ( ( X3 @ X0 @ X1 )
= $true ) )
<=> ! [X2: $i > $o] :
( ( ( X2 @ X0 )
= $true )
=> ( ( X2 @ X1 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: $i,X1: $i] :
( ! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) )
<=> ! [X3: $i > $i > $o] :
( ! [X4: $i] : ( X3 @ X4 @ X4 )
=> ( X3 @ X0 @ X1 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: $i,X1: $i] :
( ! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) )
<=> ! [X3: $i > $i > $o] :
( ! [X4: $i] : ( X3 @ X4 @ X4 )
=> ( X3 @ X0 @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: $i,X1: $i] :
( ! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) )
<=> ! [X3: $i > $i > $o] :
( ! [X4: $i] : ( X3 @ X4 @ X4 )
=> ( X3 @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tVLtOpAXv4/DTF2THF_22541.p',cTHM47D) ).
thf(f43,plain,
( spl5_5
| spl5_6 ),
inference(avatar_split_clause,[status(thm)],[f14,f41,f38]) ).
thf(f14,plain,
! [X7: $i > $o,X5: $i > $i > $o] :
( ( ( X7 @ sK1 )
= $true )
| ( ( X5 @ sK0 @ sK1 )
= $true )
| ( ( X5 @ ( sK4 @ X5 ) @ ( sK4 @ X5 ) )
!= $true )
| ( ( X7 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f36,plain,
( spl5_4
| ~ spl5_3 ),
inference(avatar_split_clause,[status(thm)],[f16,f28,f33]) ).
thf(f16,plain,
( ( ( sK2 @ sK0 @ sK1 )
!= $true )
| ( ( sK3 @ sK0 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f31,plain,
( ~ spl5_1
| ~ spl5_3 ),
inference(avatar_split_clause,[status(thm)],[f15,f28,f20]) ).
thf(f15,plain,
( ( ( sK3 @ sK1 )
!= $true )
| ( ( sK2 @ sK0 @ sK1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f26,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[status(thm)],[f17,f24,f20]) ).
thf(f17,plain,
! [X3: $i] :
( ( ( sK2 @ X3 @ X3 )
= $true )
| ( ( sK3 @ sK1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO277^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Feb 24 14:27:27 EST 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.21/0.44 ---- Original DTF file ---
% 0.21/0.44 thf(spec,logic,$$dhol).
% 0.21/0.44 %------------------------------------------------------------------------------
% 0.21/0.44 % File : SYO277^5 : TPTP v9.2.1. Released v4.0.0.
% 0.21/0.44 % Domain : Syntactic
% 0.21/0.44 % Problem : TPS problem THM47D
% 0.21/0.44 % Version : Especial.
% 0.21/0.44 % English :
% 0.21/0.44
% 0.21/0.44 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.21/0.44 % Source : [Bro09]
% 0.21/0.44 % Names : tps_0526 [Bro09]
% 0.21/0.44 % : THM47D [TPS]
% 0.21/0.44
% 0.21/0.44 % Status : Theorem
% 0.21/0.44 % Rating : 0.17 v9.1.0, 0.00 v8.1.0, 0.08 v7.4.0, 0.00 v7.3.0, 0.20 v7.2.0, 0.12 v7.1.0, 0.00 v6.2.0, 0.33 v6.1.0, 0.17 v5.5.0, 0.20 v5.4.0, 0.25 v4.1.0, 0.33 v4.0.1, 0.67 v4.0.0
% 0.21/0.44 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.21/0.44 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.21/0.44 % Maximal formula atoms : 0 ( 0 avg)
% 0.21/0.44 % Number of connectives : 9 ( 0 ~; 0 |; 0 &; 6 @)
% 0.21/0.44 % ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% 0.21/0.44 % Maximal formula depth : 9 ( 9 avg)
% 0.21/0.44 % Number of types : 2 ( 0 usr)
% 0.21/0.44 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.21/0.44 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.21/0.44 % Number of variables : 5 ( 0 ^; 5 !; 0 ?; 5 :)
% 0.21/0.44 % SPC : TH0_THM_NEQ_NAR
% 0.21/0.44
% 0.21/0.44 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.21/0.44 % project in the Department of Mathematical Sciences at Carnegie
% 0.21/0.44 % Mellon University. Distributed under the Creative Commons copyleft
% 0.21/0.44 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.21/0.44 %------------------------------------------------------------------------------
% 0.21/0.44 thf(cTHM47D,conjecture,
% 0.21/0.44 ! [X: $i,Y: $i] :
% 0.21/0.44 ( ! [Xq: $i > $o] :
% 0.21/0.44 ( ( Xq @ X )
% 0.21/0.44 => ( Xq @ Y ) )
% 0.21/0.44 <=> ! [R: $i > $i > $o] :
% 0.21/0.44 ( ! [Z: $i] : ( R @ Z @ Z )
% 0.21/0.44 => ( R @ X @ Y ) ) ) ).
% 0.21/0.44
% 0.21/0.44 %------------------------------------------------------------------------------
% 0.21/0.44 ------------------------
% 1.46/1.24 ---- Embedded in THF ---
% 1.46/1.24 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.46/1.24 %%% Generated on Tue Feb 24 14:27:27 EST 2026
% 1.46/1.24 %%% using '$$dhol' embedding, version 1.3.0.
% 1.46/1.24 %%% Logic specification used:
% 1.46/1.24 %%% thf(spec, logic, $$dhol).
% 1.46/1.24
% 1.46/1.24 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.tVLtOpAXv4/DTF2DTF22541.p
% See solution above
% 1.46/1.24 ------------------------
% 1.46/1.25 ---- Cleaned THF ---
% 1.46/1.25 thf(cTHM47D,conjecture,
% 1.46/1.25 ! [X: $i,Y: $i] :
% 1.46/1.25 ( ! [Xq: $i > $o] :
% 1.46/1.25 ( ( Xq @ X )
% 1.46/1.25 => ( Xq @ Y ) )
% 1.46/1.25 <=> ! [R: $i > $i > $o] :
% 1.46/1.25 ( ! [Z: $i] : ( R @ Z @ Z )
% 1.46/1.25 => ( R @ X @ Y ) ) ) ).
% 1.46/1.25 ------------------------
% 1.46/1.26 % (22692)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_22541 for (3000ds/4Mi)
% 1.46/1.26 % (22695)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_22541 for (3000ds/2Mi)
% 1.46/1.27 % (22695)Instruction limit reached!
% 1.46/1.27 % (22695)------------------------------
% 1.46/1.27 % (22695)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.27 % (22695)Termination reason: Unknown
% 1.46/1.27 % (22695)Termination phase: Saturation
% 1.46/1.27
% 1.46/1.27 % (22695)Memory used [KB]: 5500
% 1.46/1.27 % (22695)Time elapsed: 0.002 s
% 1.46/1.27 % (22695)Instructions burned: 2 (million)
% 1.46/1.27 % (22695)------------------------------
% 1.46/1.27 % (22695)------------------------------
% 1.46/1.27 % (22692)Instruction limit reached!
% 1.46/1.27 % (22692)------------------------------
% 1.46/1.27 % (22692)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.27 % (22692)Termination reason: Unknown
% 1.46/1.27 % (22692)Termination phase: Saturation
% 1.46/1.27
% 1.46/1.27 % (22692)Memory used [KB]: 5500
% 1.46/1.27 % (22692)Time elapsed: 0.003 s
% 1.46/1.27 % (22692)Instructions burned: 4 (million)
% 1.46/1.27 % (22692)------------------------------
% 1.46/1.27 % (22692)------------------------------
% 1.46/1.27 % (22691)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_22541 for (3000ds/183Mi)
% 1.46/1.27 % (22693)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_22541 for (3000ds/27Mi)
% 1.46/1.27 % (22694)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_22541 for (3000ds/2Mi)
% 1.46/1.27 % (22697)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_22541 for (3000ds/18Mi)
% 1.46/1.27 % (22696)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_22541 for (3000ds/275Mi)
% 1.46/1.27 % (22694)Instruction limit reached!
% 1.46/1.27 % (22694)------------------------------
% 1.46/1.27 % (22694)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.27 % (22694)Termination reason: Unknown
% 1.46/1.27 % (22694)Termination phase: Saturation
% 1.46/1.27
% 1.46/1.27 % (22694)Memory used [KB]: 5500
% 1.46/1.27 % (22694)Time elapsed: 0.004 s
% 1.46/1.27 % (22694)Instructions burned: 2 (million)
% 1.46/1.27 % (22694)------------------------------
% 1.46/1.27 % (22694)------------------------------
% 1.46/1.27 % (22693)Refutation not found, incomplete strategy
% 1.46/1.27 % (22693)------------------------------
% 1.46/1.27 % (22693)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.27 % (22693)Termination reason: Refutation not found, incomplete strategy
% 1.46/1.27
% 1.46/1.27
% 1.46/1.27 % (22693)Memory used [KB]: 5500
% 1.46/1.27 % (22693)Time elapsed: 0.004 s
% 1.46/1.27 % (22693)Instructions burned: 2 (million)
% 1.46/1.27 % (22693)------------------------------
% 1.46/1.27 % (22693)------------------------------
% 1.46/1.28 % (22698)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_22541 for (2999ds/3Mi)
% 1.46/1.28 % (22699)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_22541 for (2999ds/37Mi)
% 1.46/1.28 % (22698)Instruction limit reached!
% 1.46/1.28 % (22698)------------------------------
% 1.46/1.28 % (22698)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.28 % (22698)Termination reason: Unknown
% 1.46/1.28 % (22698)Termination phase: Saturation
% 1.46/1.28
% 1.46/1.28 % (22698)Memory used [KB]: 5500
% 1.46/1.28 % (22698)Time elapsed: 0.003 s
% 1.46/1.28 % (22698)Instructions burned: 5 (million)
% 1.46/1.28 % (22698)------------------------------
% 1.46/1.28 % (22698)------------------------------
% 1.46/1.28 % (22691)First to succeed.
% 1.46/1.28 % (22696)Also succeeded, but the first one will report.
% 1.46/1.28 % (22691)Refutation found. Thanks to Tanya!
% 1.46/1.28 % SZS status Theorem for DTF2THF_22541
% 1.46/1.28 % SZS output start Proof for DTF2THF_22541
% 1.46/1.28 thf(func_def_5, type, sK2: $i > $i > $o).
% 1.46/1.28 thf(func_def_6, type, sK3: $i > $o).
% 1.46/1.28 thf(func_def_7, type, sK4: ($i > $i > $o) > $i).
% 1.46/1.28 thf(func_def_10, type, ph6: !>[X0: $tType]:(X0)).
% 1.46/1.28 thf(f93,plain,(
% 1.46/1.28 $false),
% 1.46/1.28 inference(avatar_sat_refutation,[status(thm)],[f26,f31,f36,f43,f44,f72,f73,f90,f92])).
% 1.46/1.28 thf(f92,plain,(
% 1.46/1.28 ~spl5_2 | spl5_3 | ~spl5_6),
% 1.46/1.28 inference(avatar_contradiction_clause,[status(thm)],[f91])).
% 1.46/1.28 thf(f91,plain,(
% 1.46/1.28 $false | (~spl5_2 | spl5_3 | ~spl5_6)),
% 1.46/1.28 inference(subsumption_resolution,[status(thm)],[f82,f25])).
% 1.46/1.28 thf(f25,plain,(
% 1.46/1.28 ( ! [X3 : $i] : (((sK2 @ X3 @ X3) = $true)) ) | ~spl5_2),
% 1.46/1.28 inference(avatar_component_clause,[status(thm)],[f24])).
% 1.46/1.28 thf(f24,definition,(
% 1.46/1.28 spl5_2 <=> ! [X3 : $i] : ((sK2 @ X3 @ X3) = $true)),
% 1.46/1.28 introduced(definition,[new_symbols(naming,[spl5_2])],[avatar_definition])).
% 1.46/1.28 thf(f82,plain,(
% 1.46/1.28 ((sK2 @ sK0 @ sK0) != $true) | (spl5_3 | ~spl5_6)),
% 1.46/1.28 inference(beta_eta_normalization,[status(thm)],[f81])).
% 1.46/1.28 thf(f81,plain,(
% 1.46/1.28 (((^[Y0 : $i]: (sK2 @ ((^[Y1 : $i]: (sK0)) @ Y0) @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ sK0) != $true) | (spl5_3 | ~spl5_6)),
% 1.46/1.28 inference(trivial_inequality_removal,[status(thm)],[f80])).
% 1.46/1.28 thf(f80,plain,(
% 1.46/1.28 ($true != $true) | (((^[Y0 : $i]: (sK2 @ ((^[Y1 : $i]: (sK0)) @ Y0) @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ sK0) != $true) | (spl5_3 | ~spl5_6)),
% 1.46/1.28 inference(superposition,[status(thm)],[f30,f42])).
% 1.46/1.28 thf(f42,plain,(
% 1.46/1.28 ( ! [X7 : $i > $o] : (((X7 @ sK1) = $true) | ((X7 @ sK0) != $true)) ) | ~spl5_6),
% 1.46/1.28 inference(avatar_component_clause,[status(thm)],[f41])).
% 1.46/1.28 thf(f41,definition,(
% 1.46/1.28 spl5_6 <=> ! [X7 : $i > $o] : (((X7 @ sK1) = $true) | ((X7 @ sK0) != $true))),
% 1.46/1.28 introduced(definition,[new_symbols(naming,[spl5_6])],[avatar_definition])).
% 1.46/1.28 thf(f30,plain,(
% 1.46/1.28 ((sK2 @ sK0 @ sK1) != $true) | spl5_3),
% 1.46/1.28 inference(avatar_component_clause,[status(thm)],[f28])).
% 1.46/1.28 thf(f28,definition,(
% 1.46/1.28 spl5_3 <=> ((sK2 @ sK0 @ sK1) = $true)),
% 1.46/1.28 introduced(definition,[new_symbols(naming,[spl5_3])],[avatar_definition])).
% 1.46/1.28 thf(f90,plain,(
% 1.46/1.28 ~spl5_4 | spl5_1 | ~spl5_6),
% 1.46/1.28 inference(avatar_split_clause,[status(thm)],[f87,f41,f20,f33])).
% 1.46/1.28 thf(f33,definition,(
% 1.46/1.28 spl5_4 <=> ((sK3 @ sK0) = $true)),
% 1.46/1.28 introduced(definition,[new_symbols(naming,[spl5_4])],[avatar_definition])).
% 1.46/1.28 thf(f20,definition,(
% 1.46/1.28 spl5_1 <=> ((sK3 @ sK1) = $true)),
% 1.46/1.28 introduced(definition,[new_symbols(naming,[spl5_1])],[avatar_definition])).
% 1.46/1.28 thf(f87,plain,(
% 1.46/1.28 ((sK3 @ sK0) != $true) | (spl5_1 | ~spl5_6)),
% 1.46/1.28 inference(beta_eta_normalization,[status(thm)],[f86])).
% 1.46/1.28 thf(f86,plain,(
% 1.46/1.28 ($true != ((^[Y0 : $i]: (sK3 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ sK0)) | (spl5_1 | ~spl5_6)),
% 1.46/1.28 inference(trivial_inequality_removal,[status(thm)],[f79])).
% 1.46/1.28 thf(f79,plain,(
% 1.46/1.28 ($true != $true) | ($true != ((^[Y0 : $i]: (sK3 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ sK0)) | (spl5_1 | ~spl5_6)),
% 1.46/1.28 inference(superposition,[status(thm)],[f22,f42])).
% 1.46/1.28 thf(f22,plain,(
% 1.46/1.28 ((sK3 @ sK1) != $true) | spl5_1),
% 1.46/1.28 inference(avatar_component_clause,[status(thm)],[f20])).
% 1.46/1.28 thf(f73,plain,(
% 1.46/1.28 ~spl5_4 | spl5_1 | ~spl5_5),
% 1.46/1.28 inference(avatar_split_clause,[status(thm)],[f70,f38,f20,f33])).
% 1.46/1.28 thf(f38,definition,(
% 1.46/1.28 spl5_5 <=> ! [X5 : $i > $i > $o] : (((X5 @ sK0 @ sK1) = $true) | ((X5 @ (sK4 @ X5) @ (sK4 @ X5)) != $true))),
% 1.46/1.28 introduced(definition,[new_symbols(naming,[spl5_5])],[avatar_definition])).
% 1.46/1.28 thf(f70,plain,(
% 1.46/1.28 ((sK3 @ sK0) != $true) | (spl5_1 | ~spl5_5)),
% 1.46/1.28 inference(superposition,[status(thm)],[f22,f60])).
% 1.46/1.28 thf(f60,plain,(
% 1.46/1.28 (sK0 = sK1) | ~spl5_5),
% 1.46/1.28 inference(equality_proxy_clausification,[status(thm)],[f59])).
% 1.46/1.28 thf(f59,plain,(
% 1.46/1.28 ((sK1 = sK0) = $true) | ~spl5_5),
% 1.46/1.28 inference(trivial_inequality_removal,[status(thm)],[f58])).
% 1.46/1.28 thf(f58,plain,(
% 1.46/1.28 ((sK1 = sK0) = $true) | ($true != $true) | ~spl5_5),
% 1.46/1.28 inference(boolean_simplification,[status(thm)],[f57])).
% 1.46/1.28 thf(f57,plain,(
% 1.46/1.28 ((sK1 = sK0) = $true) | (((sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != $true) | ~spl5_5),
% 1.46/1.28 inference(beta_eta_normalization,[status(thm)],[f45])).
% 1.46/1.28 thf(f45,plain,(
% 1.46/1.28 (((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ (sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) @ (sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != $true) | (((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ sK0 @ sK1) = $true) | ~spl5_5),
% 1.46/1.28 inference(primitive_instantiation,[status(thm)],[f39])).
% 1.46/1.28 thf(f39,plain,(
% 1.46/1.28 ( ! [X5 : $i > $i > $o] : (((X5 @ (sK4 @ X5) @ (sK4 @ X5)) != $true) | ((X5 @ sK0 @ sK1) = $true)) ) | ~spl5_5),
% 1.46/1.28 inference(avatar_component_clause,[status(thm)],[f38])).
% 1.46/1.28 thf(f72,plain,(
% 1.46/1.28 ~spl5_2 | spl5_3 | ~spl5_5),
% 1.46/1.28 inference(avatar_contradiction_clause,[status(thm)],[f71])).
% 1.46/1.28 thf(f71,plain,(
% 1.46/1.28 $false | (~spl5_2 | spl5_3 | ~spl5_5)),
% 1.46/1.28 inference(subsumption_resolution,[status(thm)],[f69,f25])).
% 1.46/1.28 thf(f69,plain,(
% 1.46/1.28 ((sK2 @ sK0 @ sK0) != $true) | (spl5_3 | ~spl5_5)),
% 1.46/1.28 inference(superposition,[status(thm)],[f30,f60])).
% 1.46/1.28 thf(f44,plain,(
% 1.46/1.28 spl5_2 | spl5_4),
% 1.46/1.28 inference(avatar_split_clause,[status(thm)],[f18,f33,f24])).
% 1.46/1.28 thf(f18,plain,(
% 1.46/1.28 ( ! [X3 : $i] : (((sK3 @ sK0) = $true) | ((sK2 @ X3 @ X3) = $true)) )),
% 1.46/1.28 inference(cnf_transformation,[status(thm)],[f13])).
% 1.46/1.28 thf(f13,plain,(
% 1.46/1.28 ((! [X3 : $i] : ((sK2 @ X3 @ X3) = $true) & ((sK2 @ sK0 @ sK1) != $true)) | (((sK3 @ sK0) = $true) & ((sK3 @ sK1) != $true))) & (! [X5 : $i > $i > $o] : (((X5 @ (sK4 @ X5) @ (sK4 @ X5)) != $true) | ((X5 @ sK0 @ sK1) = $true)) | ! [X7 : $i > $o] : (((X7 @ sK0) != $true) | ((X7 @ sK1) = $true)))),
% 1.46/1.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f8,f12,f11,f10,f9])).
% 1.46/1.28 thf(f9,plain,(
% 1.46/1.28 ? [X0 : $i,X1 : $i] : ((? [X2 : $i > $i > $o] : (! [X3 : $i] : ((X2 @ X3 @ X3) = $true) & ((X2 @ X0 @ X1) != $true)) | ? [X4 : $i > $o] : (((X4 @ X0) = $true) & ((X4 @ X1) != $true))) & (! [X5 : $i > $i > $o] : (? [X6 : $i] : ((X5 @ X6 @ X6) != $true) | ((X5 @ X0 @ X1) = $true)) | ! [X7 : $i > $o] : (($true != (X7 @ X0)) | ($true = (X7 @ X1))))) => ((? [X2 : $i > $i > $o] : (! [X3 : $i] : ((X2 @ X3 @ X3) = $true) & ((X2 @ sK0 @ sK1) != $true)) | ? [X4 : $i > $o] : (((X4 @ sK0) = $true) & ((X4 @ sK1) != $true))) & (! [X5 : $i > $i > $o] : (? [X6 : $i] : ((X5 @ X6 @ X6) != $true) | ((X5 @ sK0 @ sK1) = $true)) | ! [X7 : $i > $o] : (((X7 @ sK0) != $true) | ((X7 @ sK1) = $true))))),
% 1.46/1.28 introduced(definition,[],[choice_axiom])).
% 1.46/1.28 thf(f10,plain,(
% 1.46/1.28 ? [X2 : $i > $i > $o] : (! [X3 : $i] : ((X2 @ X3 @ X3) = $true) & ((X2 @ sK0 @ sK1) != $true)) => (! [X3 : $i] : ((sK2 @ X3 @ X3) = $true) & ((sK2 @ sK0 @ sK1) != $true))),
% 1.46/1.28 introduced(definition,[],[choice_axiom])).
% 1.46/1.28 thf(f11,plain,(
% 1.46/1.28 ? [X4 : $i > $o] : (((X4 @ sK0) = $true) & ((X4 @ sK1) != $true)) => (((sK3 @ sK0) = $true) & ((sK3 @ sK1) != $true))),
% 1.46/1.28 introduced(definition,[],[choice_axiom])).
% 1.46/1.28 thf(f12,plain,(
% 1.46/1.28 ! [X5 : $i > $i > $o] : (? [X6 : $i] : ((X5 @ X6 @ X6) != $true) => ((X5 @ (sK4 @ X5) @ (sK4 @ X5)) != $true))),
% 1.46/1.28 introduced(definition,[],[choice_axiom])).
% 1.46/1.28 thf(f8,plain,(
% 1.46/1.28 ? [X0 : $i,X1 : $i] : ((? [X2 : $i > $i > $o] : (! [X3 : $i] : ((X2 @ X3 @ X3) = $true) & ((X2 @ X0 @ X1) != $true)) | ? [X4 : $i > $o] : (((X4 @ X0) = $true) & ((X4 @ X1) != $true))) & (! [X5 : $i > $i > $o] : (? [X6 : $i] : ((X5 @ X6 @ X6) != $true) | ((X5 @ X0 @ X1) = $true)) | ! [X7 : $i > $o] : (($true != (X7 @ X0)) | ($true = (X7 @ X1)))))),
% 1.46/1.28 inference(rectify,[status(thm)],[f7])).
% 1.46/1.28 thf(f7,plain,(
% 1.46/1.28 ? [X0 : $i,X1 : $i] : ((? [X3 : $i > $i > $o] : (! [X4 : $i] : ((X3 @ X4 @ X4) = $true) & ((X3 @ X0 @ X1) != $true)) | ? [X2 : $i > $o] : (((X2 @ X0) = $true) & ((X2 @ X1) != $true))) & (! [X3 : $i > $i > $o] : (? [X4 : $i] : ((X3 @ X4 @ X4) != $true) | ((X3 @ X0 @ X1) = $true)) | ! [X2 : $i > $o] : (((X2 @ X0) != $true) | ((X2 @ X1) = $true))))),
% 1.46/1.28 inference(nnf_transformation,[status(thm)],[f6])).
% 1.46/1.28 thf(f6,plain,(
% 1.46/1.28 ? [X0 : $i,X1 : $i] : (! [X2 : $i > $o] : (((X2 @ X0) != $true) | ((X2 @ X1) = $true)) <~> ! [X3 : $i > $i > $o] : (? [X4 : $i] : ((X3 @ X4 @ X4) != $true) | ((X3 @ X0 @ X1) = $true)))),
% 1.46/1.28 inference(ennf_transformation,[status(thm)],[f5])).
% 1.46/1.28 thf(f5,plain,(
% 1.46/1.28 ~! [X0 : $i,X1 : $i] : (! [X3 : $i > $i > $o] : (! [X4 : $i] : ((X3 @ X4 @ X4) = $true) => ((X3 @ X0 @ X1) = $true)) <=> ! [X2 : $i > $o] : (((X2 @ X0) = $true) => ((X2 @ X1) = $true)))),
% 1.46/1.28 inference(fool_elimination,[status(thm)],[f4])).
% 1.46/1.28 thf(f4,plain,(
% 1.46/1.28 ~! [X0 : $i,X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)) <=> ! [X3 : $i > $i > $o] : (! [X4 : $i] : (X3 @ X4 @ X4) => (X3 @ X0 @ X1)))),
% 1.46/1.28 inference(rectify,[status(thm)],[f2])).
% 1.46/1.28 thf(f2,negated_conjecture,(
% 1.46/1.28 ~! [X0 : $i,X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)) <=> ! [X3 : $i > $i > $o] : (! [X4 : $i] : (X3 @ X4 @ X4) => (X3 @ X0 @ X1)))),
% 1.46/1.28 inference(negated_conjecture,[status(cth)],[f1])).
% 1.46/1.28 thf(f1,conjecture,(
% 1.46/1.28 ! [X0 : $i,X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)) <=> ! [X3 : $i > $i > $o] : (! [X4 : $i] : (X3 @ X4 @ X4) => (X3 @ X0 @ X1)))),
% 1.46/1.28 file('/export/starexec/sandbox2/tmp/tmp.tVLtOpAXv4/DTF2THF_22541.p',cTHM47D)).
% 1.46/1.28 thf(f43,plain,(
% 1.46/1.28 spl5_5 | spl5_6),
% 1.46/1.28 inference(avatar_split_clause,[status(thm)],[f14,f41,f38])).
% 1.46/1.28 thf(f14,plain,(
% 1.46/1.28 ( ! [X7 : $i > $o,X5 : $i > $i > $o] : (((X7 @ sK1) = $true) | ((X5 @ sK0 @ sK1) = $true) | ((X5 @ (sK4 @ X5) @ (sK4 @ X5)) != $true) | ((X7 @ sK0) != $true)) )),
% 1.46/1.28 inference(cnf_transformation,[status(thm)],[f13])).
% 1.46/1.28 thf(f36,plain,(
% 1.46/1.28 spl5_4 | ~spl5_3),
% 1.46/1.28 inference(avatar_split_clause,[status(thm)],[f16,f28,f33])).
% 1.46/1.28 thf(f16,plain,(
% 1.46/1.28 ((sK2 @ sK0 @ sK1) != $true) | ((sK3 @ sK0) = $true)),
% 1.46/1.28 inference(cnf_transformation,[status(thm)],[f13])).
% 1.46/1.28 thf(f31,plain,(
% 1.46/1.28 ~spl5_1 | ~spl5_3),
% 1.46/1.28 inference(avatar_split_clause,[status(thm)],[f15,f28,f20])).
% 1.46/1.28 thf(f15,plain,(
% 1.46/1.28 ((sK3 @ sK1) != $true) | ((sK2 @ sK0 @ sK1) != $true)),
% 1.46/1.28 inference(cnf_transformation,[status(thm)],[f13])).
% 1.46/1.28 thf(f26,plain,(
% 1.46/1.28 ~spl5_1 | spl5_2),
% 1.46/1.28 inference(avatar_split_clause,[status(thm)],[f17,f24,f20])).
% 1.46/1.28 thf(f17,plain,(
% 1.46/1.28 ( ! [X3 : $i] : (((sK2 @ X3 @ X3) = $true) | ((sK3 @ sK1) != $true)) )),
% 1.46/1.28 inference(cnf_transformation,[status(thm)],[f13])).
% 1.46/1.28 % SZS output end Proof for DTF2THF_22541
% 1.46/1.28 % (22691)------------------------------
% 1.46/1.28 % (22691)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.28 % (22691)Termination reason: Refutation
% 1.46/1.28
% 1.46/1.28 % (22691)Memory used [KB]: 5500
% 1.46/1.28 % (22691)Time elapsed: 0.009 s
% 1.46/1.28 % (22691)Instructions burned: 5 (million)
% 1.46/1.28 % (22691)------------------------------
% 1.46/1.28 % (22691)------------------------------
% 1.46/1.28 % (22690)Success in time 0.022 s
%------------------------------------------------------------------------------