%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO107^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 : n029.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:23 AM UTC 2026
% Result : Theorem 1.64s 1.32s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 1 unt; 0 typ; 3 def)
% Number of atoms : 210 ( 56 equ; 0 cnn)
% Maximal formula atoms : 8 ( 7 avg)
% Number of connectives : 174 ( 39 ~; 31 |; 11 &; 73 @)
% ( 7 <=>; 12 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 56 ( 0 ^; 34 !; 22 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cP: $i > $o ).
thf(func_def_4,type,
sK0: $i > $i ).
thf(f46,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f26,f40,f43,f45]) ).
thf(f45,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[status(thm)],[f44]) ).
thf(f44,plain,
( $false
| ~ spl4_1
| ~ spl4_2 ),
inference(subsumption_resolution,[status(thm)],[f21,f24]) ).
thf(f24,plain,
( ! [X2: $i] :
( ( cP @ X2 )
= $true )
| ~ spl4_2 ),
inference(avatar_component_clause,[status(thm)],[f23]) ).
thf(f23,definition,
( spl4_2
<=> ! [X2: $i] :
( ( cP @ X2 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl4_2])],[avatar_definition]) ).
thf(f21,plain,
( ! [X0: $i] :
( $true
!= ( cP @ ( sK0 @ X0 ) ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[status(thm)],[f20]) ).
thf(f20,definition,
( spl4_1
<=> ! [X0: $i] :
( $true
!= ( cP @ ( sK0 @ X0 ) ) ) ),
introduced(definition,[new_symbols(naming,[spl4_1])],[avatar_definition]) ).
thf(f43,plain,
( ~ spl4_2
| spl4_5 ),
inference(avatar_contradiction_clause,[status(thm)],[f42]) ).
thf(f42,plain,
( $false
| ~ spl4_2
| spl4_5 ),
inference(subsumption_resolution,[status(thm)],[f39,f24]) ).
thf(f39,plain,
( ( $true
!= ( cP @ sK1 ) )
| spl4_5 ),
inference(avatar_component_clause,[status(thm)],[f37]) ).
thf(f37,definition,
( spl4_5
<=> ( $true
= ( cP @ sK1 ) ) ),
introduced(definition,[new_symbols(naming,[spl4_5])],[avatar_definition]) ).
thf(f40,plain,
( ~ spl4_5
| spl4_1 ),
inference(avatar_split_clause,[status(thm)],[f17,f20,f37]) ).
thf(f17,plain,
! [X0: $i] :
( ( $true
!= ( cP @ ( sK0 @ X0 ) ) )
| ( $true
!= ( cP @ sK1 ) ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ! [X0: $i] :
( ( $true
!= ( cP @ ( sK0 @ X0 ) ) )
& ( ( cP @ X0 )
= $true ) )
| ! [X2: $i] :
( ( ( cP @ X2 )
= $true )
& ( $true
!= ( cP @ sK1 ) ) ) )
& ( ! [X5: $i] :
( ( ( cP @ X5 )
= $true )
| ( ( cP @ sK2 )
!= $true ) )
| ( $true
!= ( cP @ sK3 ) )
| ! [X7: $i] :
( ( cP @ X7 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
! [X0: $i] :
( ? [X1: $i] :
( ( ( cP @ X1 )
!= $true )
& ( ( cP @ X0 )
= $true ) )
=> ( ( $true
!= ( cP @ ( sK0 @ X0 ) ) )
& ( ( cP @ X0 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ? [X3: $i] :
( ( cP @ X3 )
!= $true )
=> ( $true
!= ( cP @ sK1 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f11,plain,
( ? [X4: $i] :
! [X5: $i] :
( ( ( cP @ X5 )
= $true )
| ( ( cP @ X4 )
!= $true ) )
=> ! [X5: $i] :
( ( ( cP @ X5 )
= $true )
| ( ( cP @ sK2 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f12,plain,
( ? [X6: $i] :
( ( $true
!= ( cP @ X6 ) )
| ! [X7: $i] :
( ( cP @ X7 )
= $true ) )
=> ( ( $true
!= ( cP @ sK3 ) )
| ! [X7: $i] :
( ( cP @ X7 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
( ( ! [X0: $i] :
? [X1: $i] :
( ( ( cP @ X1 )
!= $true )
& ( ( cP @ X0 )
= $true ) )
| ! [X2: $i] :
( ( ( cP @ X2 )
= $true )
& ? [X3: $i] :
( ( cP @ X3 )
!= $true ) ) )
& ( ? [X4: $i] :
! [X5: $i] :
( ( ( cP @ X5 )
= $true )
| ( ( cP @ X4 )
!= $true ) )
| ? [X6: $i] :
( ( $true
!= ( cP @ X6 ) )
| ! [X7: $i] :
( ( cP @ X7 )
= $true ) ) ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ! [X2: $i] :
? [X3: $i] :
( ( ( cP @ X3 )
!= $true )
& ( ( cP @ X2 )
= $true ) )
| ! [X0: $i] :
( ( ( cP @ X0 )
= $true )
& ? [X1: $i] :
( ( cP @ X1 )
!= $true ) ) )
& ( ? [X2: $i] :
! [X3: $i] :
( ( ( cP @ X3 )
= $true )
| ( ( cP @ X2 )
!= $true ) )
| ? [X0: $i] :
( ( ( cP @ X0 )
!= $true )
| ! [X1: $i] :
( ( cP @ X1 )
= $true ) ) ) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
( ? [X0: $i] :
( ( ( cP @ X0 )
!= $true )
| ! [X1: $i] :
( ( cP @ X1 )
= $true ) )
<~> ? [X2: $i] :
! [X3: $i] :
( ( ( cP @ X3 )
= $true )
| ( ( cP @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ? [X0: $i] :
( ( ( cP @ X0 )
= $true )
=> ! [X1: $i] :
( ( cP @ X1 )
= $true ) )
<=> ? [X2: $i] :
! [X3: $i] :
( ( ( cP @ X2 )
= $true )
=> ( ( cP @ X3 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ? [X0: $i] :
( ( cP @ X0 )
=> ! [X1: $i] : ( cP @ X1 ) )
<=> ? [X2: $i] :
! [X3: $i] :
( ( cP @ X2 )
=> ( cP @ X3 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ? [X0: $i] :
( ( cP @ X0 )
=> ! [X1: $i] : ( cP @ X1 ) )
<=> ? [X0: $i] :
! [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ? [X0: $i] :
( ( cP @ X0 )
=> ! [X1: $i] : ( cP @ X1 ) )
<=> ? [X0: $i] :
! [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SosqoHvPvs/DTF2THF_29174.p',cTHM66) ).
thf(f26,plain,
( spl4_2
| spl4_2 ),
inference(avatar_split_clause,[status(thm)],[f16,f23,f23]) ).
thf(f16,plain,
! [X2: $i,X0: $i] :
( ( ( cP @ X2 )
= $true )
| ( ( cP @ X0 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO107^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.34 % Computer : n029.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 14:25:14 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.46 ---- Original DTF file ---
% 0.19/0.46 thf(spec,logic,$$dhol).
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 % File : SYO107^5 : TPTP v9.2.1. Released v4.0.0.
% 0.19/0.46 % Domain : Syntactic
% 0.19/0.46 % Problem : TPS problem THM66
% 0.19/0.46 % Version : Especial.
% 0.19/0.46 % English :
% 0.19/0.46
% 0.19/0.46 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.19/0.46 % Source : [Bro09]
% 0.19/0.46 % Names : tps_0404 [Bro09]
% 0.19/0.46 % : THM66 [TPS]
% 0.19/0.46
% 0.19/0.46 % Status : Theorem
% 0.19/0.46 % Rating : 0.08 v9.1.0, 0.12 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.19/0.46 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.19/0.46 % Number of atoms : 4 ( 0 equ; 0 cnn)
% 0.19/0.46 % Maximal formula atoms : 4 ( 4 avg)
% 0.19/0.46 % Number of connectives : 7 ( 0 ~; 0 |; 0 &; 4 @)
% 0.19/0.46 % ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% 0.19/0.46 % Maximal formula depth : 6 ( 6 avg)
% 0.19/0.46 % Number of types : 2 ( 0 usr)
% 0.19/0.46 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.19/0.46 % Number of symbols : 1 ( 1 usr; 0 con; 1-1 aty)
% 0.19/0.46 % Number of variables : 4 ( 0 ^; 2 !; 2 ?; 4 :)
% 0.19/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.19/0.46
% 0.19/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.19/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.19/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.19/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 thf(cP,type,
% 0.19/0.46 cP: $i > $o ).
% 0.19/0.46
% 0.19/0.46 thf(cTHM66,conjecture,
% 0.19/0.46 ( ? [X: $i] :
% 0.19/0.46 ! [Y: $i] :
% 0.19/0.46 ( ( cP @ X )
% 0.19/0.46 => ( cP @ Y ) )
% 0.19/0.46 <=> ? [X: $i] :
% 0.19/0.46 ( ( cP @ X )
% 0.19/0.46 => ! [Y: $i] : ( cP @ Y ) ) ) ).
% 0.19/0.46
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 ------------------------
% 1.43/1.29 ---- Embedded in THF ---
% 1.43/1.29 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.43/1.29 %%% Generated on Tue Feb 24 14:25:15 EST 2026
% 1.43/1.29 %%% using '$$dhol' embedding, version 1.3.0.
% 1.43/1.29 %%% Logic specification used:
% 1.43/1.29 %%% thf(spec, logic, $$dhol).
% 1.43/1.29
% 1.43/1.29 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.SosqoHvPvs/DTF2DTF29174.p
% See solution above
% 1.43/1.29 ------------------------
% 1.64/1.30 ---- Cleaned THF ---
% 1.64/1.30 thf(cP,type,
% 1.64/1.30 cP: $i > $o ).
% 1.64/1.30
% 1.64/1.30 thf(cTHM66,conjecture,
% 1.64/1.30 ( ? [X: $i] :
% 1.64/1.30 ! [Y: $i] :
% 1.64/1.30 ( ( cP @ X )
% 1.64/1.30 => ( cP @ Y ) )
% 1.64/1.30 <=> ? [X: $i] :
% 1.64/1.30 ( ( cP @ X )
% 1.64/1.30 => ! [Y: $i] : ( cP @ Y ) ) ) ).
% 1.64/1.30 ------------------------
% 1.64/1.31 % (29370)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_29174 for (3000ds/183Mi)
% 1.64/1.32 % (29370)First to succeed.
% 1.64/1.32 % (29370)Refutation found. Thanks to Tanya!
% 1.64/1.32 % SZS status Theorem for DTF2THF_29174
% 1.64/1.32 % SZS output start Proof for DTF2THF_29174
% 1.64/1.32 thf(func_def_0, type, cP: $i > $o).
% 1.64/1.32 thf(func_def_4, type, sK0: $i > $i).
% 1.64/1.32 thf(f46,plain,(
% 1.64/1.32 $false),
% 1.64/1.32 inference(avatar_sat_refutation,[status(thm)],[f26,f40,f43,f45])).
% 1.64/1.32 thf(f45,plain,(
% 1.64/1.32 ~spl4_1 | ~spl4_2),
% 1.64/1.32 inference(avatar_contradiction_clause,[status(thm)],[f44])).
% 1.64/1.32 thf(f44,plain,(
% 1.64/1.32 $false | (~spl4_1 | ~spl4_2)),
% 1.64/1.32 inference(subsumption_resolution,[status(thm)],[f21,f24])).
% 1.64/1.32 thf(f24,plain,(
% 1.64/1.32 ( ! [X2 : $i] : (((cP @ X2) = $true)) ) | ~spl4_2),
% 1.64/1.32 inference(avatar_component_clause,[status(thm)],[f23])).
% 1.64/1.32 thf(f23,definition,(
% 1.64/1.32 spl4_2 <=> ! [X2 : $i] : ((cP @ X2) = $true)),
% 1.64/1.32 introduced(definition,[new_symbols(naming,[spl4_2])],[avatar_definition])).
% 1.64/1.32 thf(f21,plain,(
% 1.64/1.32 ( ! [X0 : $i] : (($true != (cP @ (sK0 @ X0)))) ) | ~spl4_1),
% 1.64/1.32 inference(avatar_component_clause,[status(thm)],[f20])).
% 1.64/1.32 thf(f20,definition,(
% 1.64/1.32 spl4_1 <=> ! [X0 : $i] : ($true != (cP @ (sK0 @ X0)))),
% 1.64/1.32 introduced(definition,[new_symbols(naming,[spl4_1])],[avatar_definition])).
% 1.64/1.32 thf(f43,plain,(
% 1.64/1.32 ~spl4_2 | spl4_5),
% 1.64/1.32 inference(avatar_contradiction_clause,[status(thm)],[f42])).
% 1.64/1.32 thf(f42,plain,(
% 1.64/1.32 $false | (~spl4_2 | spl4_5)),
% 1.64/1.32 inference(subsumption_resolution,[status(thm)],[f39,f24])).
% 1.64/1.32 thf(f39,plain,(
% 1.64/1.32 ($true != (cP @ sK1)) | spl4_5),
% 1.64/1.32 inference(avatar_component_clause,[status(thm)],[f37])).
% 1.64/1.32 thf(f37,definition,(
% 1.64/1.32 spl4_5 <=> ($true = (cP @ sK1))),
% 1.64/1.32 introduced(definition,[new_symbols(naming,[spl4_5])],[avatar_definition])).
% 1.64/1.32 thf(f40,plain,(
% 1.64/1.32 ~spl4_5 | spl4_1),
% 1.64/1.32 inference(avatar_split_clause,[status(thm)],[f17,f20,f37])).
% 1.64/1.32 thf(f17,plain,(
% 1.64/1.32 ( ! [X0 : $i] : (($true != (cP @ (sK0 @ X0))) | ($true != (cP @ sK1))) )),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f13])).
% 1.64/1.32 thf(f13,plain,(
% 1.64/1.32 (! [X0 : $i] : (($true != (cP @ (sK0 @ X0))) & ((cP @ X0) = $true)) | ! [X2 : $i] : (((cP @ X2) = $true) & ($true != (cP @ sK1)))) & (! [X5 : $i] : (((cP @ X5) = $true) | ((cP @ sK2) != $true)) | (($true != (cP @ sK3)) | ! [X7 : $i] : ((cP @ X7) = $true)))),
% 1.64/1.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f12,f11,f10,f9])).
% 1.64/1.32 thf(f9,plain,(
% 1.64/1.32 ! [X0 : $i] : (? [X1 : $i] : (((cP @ X1) != $true) & ((cP @ X0) = $true)) => (($true != (cP @ (sK0 @ X0))) & ((cP @ X0) = $true)))),
% 1.64/1.32 introduced(definition,[],[choice_axiom])).
% 1.64/1.32 thf(f10,plain,(
% 1.64/1.32 ? [X3 : $i] : ((cP @ X3) != $true) => ($true != (cP @ sK1))),
% 1.64/1.32 introduced(definition,[],[choice_axiom])).
% 1.64/1.32 thf(f11,plain,(
% 1.64/1.32 ? [X4 : $i] : ! [X5 : $i] : (((cP @ X5) = $true) | ((cP @ X4) != $true)) => ! [X5 : $i] : (((cP @ X5) = $true) | ((cP @ sK2) != $true))),
% 1.64/1.32 introduced(definition,[],[choice_axiom])).
% 1.64/1.32 thf(f12,plain,(
% 1.64/1.32 ? [X6 : $i] : (($true != (cP @ X6)) | ! [X7 : $i] : ((cP @ X7) = $true)) => (($true != (cP @ sK3)) | ! [X7 : $i] : ((cP @ X7) = $true))),
% 1.64/1.32 introduced(definition,[],[choice_axiom])).
% 1.64/1.32 thf(f8,plain,(
% 1.64/1.32 (! [X0 : $i] : ? [X1 : $i] : (((cP @ X1) != $true) & ((cP @ X0) = $true)) | ! [X2 : $i] : (((cP @ X2) = $true) & ? [X3 : $i] : ((cP @ X3) != $true))) & (? [X4 : $i] : ! [X5 : $i] : (((cP @ X5) = $true) | ((cP @ X4) != $true)) | ? [X6 : $i] : (($true != (cP @ X6)) | ! [X7 : $i] : ((cP @ X7) = $true)))),
% 1.64/1.32 inference(rectify,[status(thm)],[f7])).
% 1.64/1.32 thf(f7,plain,(
% 1.64/1.32 (! [X2 : $i] : ? [X3 : $i] : (((cP @ X3) != $true) & ((cP @ X2) = $true)) | ! [X0 : $i] : (((cP @ X0) = $true) & ? [X1 : $i] : ((cP @ X1) != $true))) & (? [X2 : $i] : ! [X3 : $i] : (((cP @ X3) = $true) | ((cP @ X2) != $true)) | ? [X0 : $i] : (((cP @ X0) != $true) | ! [X1 : $i] : ((cP @ X1) = $true)))),
% 1.64/1.32 inference(nnf_transformation,[status(thm)],[f6])).
% 1.64/1.32 thf(f6,plain,(
% 1.64/1.32 ? [X0 : $i] : (((cP @ X0) != $true) | ! [X1 : $i] : ((cP @ X1) = $true)) <~> ? [X2 : $i] : ! [X3 : $i] : (((cP @ X3) = $true) | ((cP @ X2) != $true))),
% 1.64/1.32 inference(ennf_transformation,[status(thm)],[f5])).
% 1.64/1.32 thf(f5,plain,(
% 1.64/1.32 ~(? [X0 : $i] : (((cP @ X0) = $true) => ! [X1 : $i] : ((cP @ X1) = $true)) <=> ? [X2 : $i] : ! [X3 : $i] : (((cP @ X2) = $true) => ((cP @ X3) = $true)))),
% 1.64/1.32 inference(fool_elimination,[status(thm)],[f4])).
% 1.64/1.32 thf(f4,plain,(
% 1.64/1.32 ~(? [X0 : $i] : ((cP @ X0) => ! [X1 : $i] : (cP @ X1)) <=> ? [X2 : $i] : ! [X3 : $i] : ((cP @ X2) => (cP @ X3)))),
% 1.64/1.32 inference(rectify,[status(thm)],[f2])).
% 1.64/1.32 thf(f2,negated_conjecture,(
% 1.64/1.32 ~(? [X0 : $i] : ((cP @ X0) => ! [X1 : $i] : (cP @ X1)) <=> ? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) => (cP @ X1)))),
% 1.64/1.32 inference(negated_conjecture,[status(cth)],[f1])).
% 1.64/1.32 thf(f1,conjecture,(
% 1.64/1.32 ? [X0 : $i] : ((cP @ X0) => ! [X1 : $i] : (cP @ X1)) <=> ? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) => (cP @ X1))),
% 1.64/1.32 file('/export/starexec/sandbox2/tmp/tmp.SosqoHvPvs/DTF2THF_29174.p',cTHM66)).
% 1.64/1.32 thf(f26,plain,(
% 1.64/1.32 spl4_2 | spl4_2),
% 1.64/1.32 inference(avatar_split_clause,[status(thm)],[f16,f23,f23])).
% 1.64/1.32 thf(f16,plain,(
% 1.64/1.32 ( ! [X2 : $i,X0 : $i] : (((cP @ X2) = $true) | ((cP @ X0) = $true)) )),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f13])).
% 1.64/1.32 % SZS output end Proof for DTF2THF_29174
% 1.64/1.32 % (29370)------------------------------
% 1.64/1.32 % (29370)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.32 % (29370)Termination reason: Refutation
% 1.64/1.32
% 1.64/1.32 % (29370)Memory used [KB]: 5500
% 1.64/1.32 % (29370)Time elapsed: 0.002 s
% 1.64/1.32 % (29370)Instructions burned: 1 (million)
% 1.64/1.32 % (29370)------------------------------
% 1.64/1.32 % (29370)------------------------------
% 1.64/1.32 % (29368)Success in time 0.011 s
%------------------------------------------------------------------------------