%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET614^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 : n031.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:55 AM UTC 2026
% Result : Theorem 1.65s 1.30s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 16 unt; 0 typ; 6 def)
% Number of atoms : 379 ( 99 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 441 ( 101 ~; 97 |; 49 &; 187 @)
% ( 6 <=>; 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 : 15 ( 12 usr; 9 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_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_10,type,
sK0: a > $o ).
thf(func_def_11,type,
sK1: a > $o ).
thf(func_def_12,type,
sK2: a > $o ).
thf(func_def_14,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
sK5: a ).
thf(f93,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f57,f65,f66,f81,f84,f87,f92]) ).
thf(f92,plain,
( ~ spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[status(thm)],[f91]) ).
thf(f91,plain,
( $false
| ~ spl3_2
| ~ spl3_4 ),
inference(trivial_inequality_removal,[status(thm)],[f90]) ).
thf(f90,plain,
( ( $false = $true )
| ~ spl3_2
| ~ spl3_4 ),
inference(backward_demodulation,[status(thm)],[f55,f72]) ).
thf(f72,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[status(thm)],[f70]) ).
thf(f70,definition,
( spl3_4
<=> ( ( sK0 @ sK5 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl3_4])],[avatar_definition]) ).
thf(f55,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl3_2 ),
inference(avatar_component_clause,[status(thm)],[f53]) ).
thf(f53,definition,
( spl3_2
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl3_2])],[avatar_definition]) ).
thf(f87,plain,
( ~ spl3_1
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[status(thm)],[f86]) ).
thf(f86,plain,
( $false
| ~ spl3_1
| ~ spl3_6 ),
inference(trivial_inequality_removal,[status(thm)],[f85]) ).
thf(f85,plain,
( ( $false = $true )
| ~ spl3_1
| ~ spl3_6 ),
inference(forward_demodulation,[status(thm)],[f80,f51]) ).
thf(f51,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[status(thm)],[f49]) ).
thf(f49,definition,
( spl3_1
<=> ( $false
= ( sK1 @ sK5 ) ) ),
introduced(definition,[new_symbols(naming,[spl3_1])],[avatar_definition]) ).
thf(f80,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl3_6 ),
inference(avatar_component_clause,[status(thm)],[f78]) ).
thf(f78,definition,
( spl3_6
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(definition,[new_symbols(naming,[spl3_6])],[avatar_definition]) ).
thf(f84,plain,
( ~ spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[status(thm)],[f83]) ).
thf(f83,plain,
( $false
| ~ spl3_3
| ~ spl3_5 ),
inference(trivial_inequality_removal,[status(thm)],[f82]) ).
thf(f82,plain,
( ( $false = $true )
| ~ spl3_3
| ~ spl3_5 ),
inference(backward_demodulation,[status(thm)],[f76,f61]) ).
thf(f61,plain,
( ( ( sK2 @ sK5 )
= $false )
| ~ spl3_3 ),
inference(avatar_component_clause,[status(thm)],[f59]) ).
thf(f59,definition,
( spl3_3
<=> ( ( sK2 @ sK5 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl3_3])],[avatar_definition]) ).
thf(f76,plain,
( ( ( sK2 @ sK5 )
= $true )
| ~ spl3_5 ),
inference(avatar_component_clause,[status(thm)],[f74]) ).
thf(f74,definition,
( spl3_5
<=> ( ( sK2 @ sK5 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl3_5])],[avatar_definition]) ).
thf(f81,plain,
( spl3_4
| spl3_5
| spl3_6 ),
inference(avatar_split_clause,[status(thm)],[f23,f78,f74,f70]) ).
thf(f23,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[status(thm)],[f22]) ).
thf(f22,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(not_proxy_clausification,[status(thm)],[f21]) ).
thf(f21,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ~ ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[status(thm)],[f20]) ).
thf(f20,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( ~ ( sK2 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f19,plain,
( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ~ ( sK2 @ sK5 ) )
= $false ) ),
inference(not_proxy_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( ~ ( sK2 @ sK5 ) )
= $false ) ),
inference(not_proxy_clausification,[status(thm)],[f17]) ).
thf(f17,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( ~ ( sK1 @ sK5 ) )
= $false )
| ( ( ~ ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) ) ) ),
inference(duplicate_literal_removal,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ( ~ ( sK2 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ~ ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f15]) ).
thf(f15,plain,
( ( $false
= ( ( sK0 @ sK5 )
& ~ ( sK2 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) ) )
| ( ( ~ ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f14]) ).
thf(f14,plain,
( ( $false
= ( ( sK0 @ sK5 )
& ~ ( sK2 @ sK5 )
& ~ ( sK1 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f13]) ).
thf(f13,plain,
( ( $false
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( $false
= ( ( sK0 @ sK5 )
& ~ ( sK2 @ sK5 )
& ~ ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ( sK0 @ sK5 )
& ~ ( sK2 @ sK5 )
& ~ ( sK1 @ sK5 ) )
!= ( ~ ( ( sK2 @ 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] :
( ( sK0 @ Y0 )
& ~ ( sK2 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ sK5 ) ),
inference(negative_extensionality,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( sK2 @ Y0 )
& ~ ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ~ ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( sK2 @ Y0 )
& ~ ( sK1 @ 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] :
( ( X0 @ Y0 )
& ~ ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
=> ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ~ ( sK2 @ Y0 )
& ~ ( sK1 @ 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] :
( ( X0 @ Y0 )
& ~ ( X2 @ Y0 )
& ~ ( X1 @ 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] :
( ( X0 @ Y0 )
& ~ ( X2 @ Y0 )
& ~ ( X1 @ 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] :
( ~ ( X1 @ X4 )
& ~ ( X2 @ X4 )
& ( X0 @ X4 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X2: a > $o,X1: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
& ~ ( ( X2 @ X3 )
| ( X1 @ X3 ) ) ) )
= ( ^ [X3: a] :
( ~ ( X2 @ X3 )
& ~ ( X1 @ X3 )
& ( X0 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X2: a > $o,X1: a > $o] :
( ( ^ [X3: a] :
( ( X0 @ X3 )
& ~ ( ( X2 @ X3 )
| ( X1 @ X3 ) ) ) )
= ( ^ [X3: a] :
( ~ ( X2 @ X3 )
& ~ ( X1 @ X3 )
& ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zuTx8iO6Ey/DTF2THF_24075.p',cBOOL_PROP_88_pme) ).
thf(f66,plain,
spl3_2,
inference(avatar_split_clause,[status(thm)],[f33,f53]) ).
thf(f33,plain,
( ( sK0 @ sK5 )
= $true ),
inference(duplicate_literal_removal,[status(thm)],[f28]) ).
thf(f28,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f27]) ).
thf(f27,plain,
( ( $true
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
( ( $true
= ( ( sK0 @ sK5 )
& ~ ( sK2 @ sK5 ) ) )
| ( $true
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
thf(f12,plain,
( ( $true
= ( ( sK0 @ sK5 )
& ~ ( sK2 @ sK5 )
& ~ ( sK1 @ sK5 ) ) )
| ( $true
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
thf(f65,plain,
spl3_3,
inference(avatar_split_clause,[status(thm)],[f40,f59]) ).
thf(f40,plain,
( ( sK2 @ sK5 )
= $false ),
inference(duplicate_literal_removal,[status(thm)],[f39]) ).
thf(f39,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f37]) ).
thf(f37,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( sK2 @ sK5 )
= $false ) ),
inference(not_proxy_clausification,[status(thm)],[f36]) ).
thf(f36,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f34]) ).
thf(f34,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( $true
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[status(thm)],[f26]) ).
thf(f26,plain,
( ( ( ~ ( sK2 @ sK5 ) )
= $true )
| ( $true
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f25]) ).
thf(f57,plain,
spl3_1,
inference(avatar_split_clause,[status(thm)],[f47,f49]) ).
thf(f47,plain,
( $false
= ( sK1 @ sK5 ) ),
inference(duplicate_literal_removal,[status(thm)],[f45]) ).
thf(f45,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f44]) ).
thf(f44,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[status(thm)],[f43]) ).
thf(f43,plain,
( ( ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f41]) ).
thf(f41,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $true
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[status(thm)],[f24]) ).
thf(f24,plain,
( ( ( ~ ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( ~ ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET614^5 : TPTP v9.2.1. Released v4.0.0.
% 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.18/0.34 % Computer : n031.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Tue Feb 24 12:01:48 EST 2026
% 0.18/0.34 % CPUTime :
% 0.18/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.30/0.47 ---- Original DTF file ---
% 0.30/0.47 thf(spec,logic,$$dhol).
% 0.30/0.47 %------------------------------------------------------------------------------
% 0.30/0.47 % File : SET614^5 : TPTP v9.2.1. Released v4.0.0.
% 0.30/0.47 % Domain : Set Theory
% 0.30/0.47 % Problem : TPS problem BOOL-PROP-88
% 0.30/0.47 % Version : Especial.
% 0.30/0.47 % English : Trybulec's 88th Boolean property of sets
% 0.30/0.47
% 0.30/0.47 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.30/0.47 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.30/0.47 % Source : [Bro09]
% 0.30/0.47 % Names : tps_0300 [Bro09]
% 0.30/0.47 % : BOOL-PROP-88 [TPS]
% 0.30/0.47
% 0.30/0.47 % Status : Theorem
% 0.30/0.47 % Rating : 0.00 v8.2.0, 0.08 v8.1.0, 0.09 v7.5.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 v5.3.0, 0.40 v5.2.0, 0.20 v5.1.0, 0.40 v5.0.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.30/0.47 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.30/0.47 % Number of atoms : 1 ( 1 equ; 0 cnn)
% 0.30/0.47 % Maximal formula atoms : 1 ( 1 avg)
% 0.30/0.47 % Number of connectives : 13 ( 3 ~; 1 |; 3 &; 6 @)
% 0.30/0.47 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.30/0.47 % Maximal formula depth : 4 ( 4 avg)
% 0.30/0.47 % Number of types : 2 ( 1 usr)
% 0.30/0.47 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.30/0.47 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.30/0.47 % Number of variables : 5 ( 2 ^; 3 !; 0 ?; 5 :)
% 0.30/0.47 % SPC : TH0_THM_EQU_NAR
% 0.30/0.47
% 0.30/0.47 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.30/0.47 % project in the Department of Mathematical Sciences at Carnegie
% 0.30/0.47 % Mellon University. Distributed under the Creative Commons copyleft
% 0.30/0.47 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.30/0.47 % : Polymorphic definitions expanded.
% 0.30/0.47 %------------------------------------------------------------------------------
% 0.30/0.47 thf(a_type,type,
% 0.30/0.47 a: $tType ).
% 0.30/0.47
% 0.30/0.47 thf(cBOOL_PROP_88_pme,conjecture,
% 0.30/0.47 ! [X: a > $o,Y: a > $o,Z: a > $o] :
% 0.30/0.47 ( ( ^ [Xx: a] :
% 0.30/0.47 ( ( X @ Xx )
% 0.30/0.47 & ~ ( Y @ Xx )
% 0.30/0.47 & ~ ( Z @ Xx ) ) )
% 0.30/0.47 = ( ^ [Xx: a] :
% 0.30/0.47 ( ( X @ Xx )
% 0.30/0.47 & ~ ( ( Y @ Xx )
% 0.30/0.47 | ( Z @ Xx ) ) ) ) ) ).
% 0.30/0.47
% 0.30/0.47 %------------------------------------------------------------------------------
% 0.30/0.47 ------------------------
% 1.47/1.27 ---- Embedded in THF ---
% 1.47/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.47/1.28 %%% Generated on Tue Feb 24 12:01:49 EST 2026
% 1.47/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.47/1.28 %%% Logic specification used:
% 1.47/1.28 %%% thf(spec, logic, $$dhol).
% 1.47/1.28
% 1.47/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.zuTx8iO6Ey/DTF2DTF24075.p
% See solution above
% 1.47/1.28 ------------------------
% 1.47/1.28 ---- Cleaned THF ---
% 1.47/1.29 thf(a_type,type,
% 1.47/1.29 a: $tType ).
% 1.47/1.29
% 1.47/1.29 thf(cBOOL_PROP_88_pme,conjecture,
% 1.47/1.29 ! [X: a > $o,Y: a > $o,Z: a > $o] :
% 1.47/1.29 ( ( ^ [Xx: a] :
% 1.47/1.29 ( ( X @ Xx )
% 1.47/1.29 & ~ ( Y @ Xx )
% 1.47/1.29 & ~ ( Z @ Xx ) ) )
% 1.47/1.29 = ( ^ [Xx: a] :
% 1.47/1.29 ( ( X @ Xx )
% 1.47/1.29 & ~ ( ( Y @ Xx )
% 1.47/1.29 | ( Z @ Xx ) ) ) ) ) ).
% 1.47/1.29 ------------------------
% 1.65/1.30 % (24341)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_24075 for (2999ds/27Mi)
% 1.65/1.30 % (24340)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_24075 for (2999ds/4Mi)
% 1.65/1.30 % (24341)First to succeed.
% 1.65/1.30 % (24340)Instruction limit reached!
% 1.65/1.30 % (24340)------------------------------
% 1.65/1.30 % (24340)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.30 % (24340)Termination reason: Unknown
% 1.65/1.30 % (24340)Termination phase: Saturation
% 1.65/1.30
% 1.65/1.30 % (24340)Memory used [KB]: 5500
% 1.65/1.30 % (24340)Time elapsed: 0.003 s
% 1.65/1.30 % (24340)Instructions burned: 4 (million)
% 1.65/1.30 % (24340)------------------------------
% 1.65/1.30 % (24340)------------------------------
% 1.65/1.30 % (24341)Refutation found. Thanks to Tanya!
% 1.65/1.30 % SZS status Theorem for DTF2THF_24075
% 1.65/1.30 % SZS output start Proof for DTF2THF_24075
% 1.65/1.30 thf(type_def_5, type, a: $tType).
% 1.65/1.30 thf(func_def_0, type, a: $tType).
% 1.65/1.30 thf(func_def_2, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.65/1.30 thf(func_def_10, type, sK0: a > $o).
% 1.65/1.30 thf(func_def_11, type, sK1: a > $o).
% 1.65/1.30 thf(func_def_12, type, sK2: a > $o).
% 1.65/1.30 thf(func_def_14, type, ph4: !>[X0: $tType]:(X0)).
% 1.65/1.30 thf(func_def_15, type, sK5: a).
% 1.65/1.30 thf(f93,plain,(
% 1.65/1.30 $false),
% 1.65/1.30 inference(avatar_sat_refutation,[status(thm)],[f57,f65,f66,f81,f84,f87,f92])).
% 1.65/1.30 thf(f92,plain,(
% 1.65/1.30 ~spl3_2 | ~spl3_4),
% 1.65/1.30 inference(avatar_contradiction_clause,[status(thm)],[f91])).
% 1.65/1.30 thf(f91,plain,(
% 1.65/1.30 $false | (~spl3_2 | ~spl3_4)),
% 1.65/1.30 inference(trivial_inequality_removal,[status(thm)],[f90])).
% 1.65/1.30 thf(f90,plain,(
% 1.65/1.30 ($false = $true) | (~spl3_2 | ~spl3_4)),
% 1.65/1.30 inference(backward_demodulation,[status(thm)],[f55,f72])).
% 1.65/1.30 thf(f72,plain,(
% 1.65/1.30 ((sK0 @ sK5) = $false) | ~spl3_4),
% 1.65/1.30 inference(avatar_component_clause,[status(thm)],[f70])).
% 1.65/1.30 thf(f70,definition,(
% 1.65/1.30 spl3_4 <=> ((sK0 @ sK5) = $false)),
% 1.65/1.30 introduced(definition,[new_symbols(naming,[spl3_4])],[avatar_definition])).
% 1.65/1.30 thf(f55,plain,(
% 1.65/1.30 ((sK0 @ sK5) = $true) | ~spl3_2),
% 1.65/1.30 inference(avatar_component_clause,[status(thm)],[f53])).
% 1.65/1.30 thf(f53,definition,(
% 1.65/1.30 spl3_2 <=> ((sK0 @ sK5) = $true)),
% 1.65/1.30 introduced(definition,[new_symbols(naming,[spl3_2])],[avatar_definition])).
% 1.65/1.30 thf(f87,plain,(
% 1.65/1.30 ~spl3_1 | ~spl3_6),
% 1.65/1.30 inference(avatar_contradiction_clause,[status(thm)],[f86])).
% 1.65/1.30 thf(f86,plain,(
% 1.65/1.30 $false | (~spl3_1 | ~spl3_6)),
% 1.65/1.30 inference(trivial_inequality_removal,[status(thm)],[f85])).
% 1.65/1.30 thf(f85,plain,(
% 1.65/1.30 ($false = $true) | (~spl3_1 | ~spl3_6)),
% 1.65/1.30 inference(forward_demodulation,[status(thm)],[f80,f51])).
% 1.65/1.30 thf(f51,plain,(
% 1.65/1.30 ($false = (sK1 @ sK5)) | ~spl3_1),
% 1.65/1.30 inference(avatar_component_clause,[status(thm)],[f49])).
% 1.65/1.30 thf(f49,definition,(
% 1.65/1.30 spl3_1 <=> ($false = (sK1 @ sK5))),
% 1.65/1.30 introduced(definition,[new_symbols(naming,[spl3_1])],[avatar_definition])).
% 1.65/1.30 thf(f80,plain,(
% 1.65/1.30 ($true = (sK1 @ sK5)) | ~spl3_6),
% 1.65/1.30 inference(avatar_component_clause,[status(thm)],[f78])).
% 1.65/1.30 thf(f78,definition,(
% 1.65/1.30 spl3_6 <=> ($true = (sK1 @ sK5))),
% 1.65/1.30 introduced(definition,[new_symbols(naming,[spl3_6])],[avatar_definition])).
% 1.65/1.30 thf(f84,plain,(
% 1.65/1.30 ~spl3_3 | ~spl3_5),
% 1.65/1.30 inference(avatar_contradiction_clause,[status(thm)],[f83])).
% 1.65/1.30 thf(f83,plain,(
% 1.65/1.30 $false | (~spl3_3 | ~spl3_5)),
% 1.65/1.30 inference(trivial_inequality_removal,[status(thm)],[f82])).
% 1.65/1.30 thf(f82,plain,(
% 1.65/1.30 ($false = $true) | (~spl3_3 | ~spl3_5)),
% 1.65/1.30 inference(backward_demodulation,[status(thm)],[f76,f61])).
% 1.65/1.30 thf(f61,plain,(
% 1.65/1.30 ((sK2 @ sK5) = $false) | ~spl3_3),
% 1.65/1.30 inference(avatar_component_clause,[status(thm)],[f59])).
% 1.65/1.30 thf(f59,definition,(
% 1.65/1.30 spl3_3 <=> ((sK2 @ sK5) = $false)),
% 1.65/1.30 introduced(definition,[new_symbols(naming,[spl3_3])],[avatar_definition])).
% 1.65/1.30 thf(f76,plain,(
% 1.65/1.30 ((sK2 @ sK5) = $true) | ~spl3_5),
% 1.65/1.30 inference(avatar_component_clause,[status(thm)],[f74])).
% 1.65/1.30 thf(f74,definition,(
% 1.65/1.30 spl3_5 <=> ((sK2 @ sK5) = $true)),
% 1.65/1.30 introduced(definition,[new_symbols(naming,[spl3_5])],[avatar_definition])).
% 1.65/1.30 thf(f81,plain,(
% 1.65/1.30 spl3_4 | spl3_5 | spl3_6),
% 1.65/1.30 inference(avatar_split_clause,[status(thm)],[f23,f78,f74,f70])).
% 1.65/1.30 thf(f23,plain,(
% 1.65/1.30 ($true = (sK1 @ sK5)) | ((sK2 @ sK5) = $true) | ((sK0 @ sK5) = $false)),
% 1.65/1.30 inference(duplicate_literal_removal,[status(thm)],[f22])).
% 1.65/1.30 thf(f22,plain,(
% 1.65/1.30 ((sK0 @ sK5) = $false) | ((sK2 @ sK5) = $true) | ($true = (sK1 @ sK5)) | ((sK2 @ sK5) = $true)),
% 1.65/1.30 inference(not_proxy_clausification,[status(thm)],[f21])).
% 1.65/1.30 thf(f21,plain,(
% 1.65/1.30 ($true = (sK1 @ sK5)) | ((sK2 @ sK5) = $true) | ((sK0 @ sK5) = $false) | ((~ (sK2 @ sK5)) = $false)),
% 1.65/1.30 inference(duplicate_literal_removal,[status(thm)],[f20])).
% 1.65/1.30 thf(f20,plain,(
% 1.65/1.30 ((sK2 @ sK5) = $true) | ($true = (sK1 @ sK5)) | ((~ (sK2 @ sK5)) = $false) | ((sK0 @ sK5) = $false) | ($true = (sK1 @ sK5))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.65/1.30 thf(f19,plain,(
% 1.65/1.30 (((sK2 @ sK5) | (sK1 @ sK5)) = $true) | ($true = (sK1 @ sK5)) | ((sK0 @ sK5) = $false) | ((~ (sK2 @ sK5)) = $false)),
% 1.65/1.30 inference(not_proxy_clausification,[status(thm)],[f18])).
% 1.65/1.30 thf(f18,plain,(
% 1.65/1.30 ((sK0 @ sK5) = $false) | ($false = (~ ((sK2 @ sK5) | (sK1 @ sK5)))) | ($true = (sK1 @ sK5)) | ((~ (sK2 @ sK5)) = $false)),
% 1.65/1.30 inference(not_proxy_clausification,[status(thm)],[f17])).
% 1.65/1.30 thf(f17,plain,(
% 1.65/1.30 ((sK0 @ sK5) = $false) | ((~ (sK1 @ sK5)) = $false) | ((~ (sK2 @ sK5)) = $false) | ($false = (~ ((sK2 @ sK5) | (sK1 @ sK5))))),
% 1.65/1.30 inference(duplicate_literal_removal,[status(thm)],[f16])).
% 1.65/1.30 thf(f16,plain,(
% 1.65/1.30 ((~ (sK2 @ sK5)) = $false) | ((sK0 @ sK5) = $false) | ((~ (sK1 @ sK5)) = $false) | ($false = (~ ((sK2 @ sK5) | (sK1 @ sK5)))) | ((sK0 @ sK5) = $false)),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f15])).
% 1.65/1.30 thf(f15,plain,(
% 1.65/1.30 ($false = ((sK0 @ sK5) & (~ (sK2 @ sK5)))) | ((sK0 @ sK5) = $false) | ($false = (~ ((sK2 @ sK5) | (sK1 @ sK5)))) | ((~ (sK1 @ sK5)) = $false)),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f14])).
% 1.65/1.30 thf(f14,plain,(
% 1.65/1.30 ($false = (((sK0 @ sK5) & (~ (sK2 @ sK5))) & (~ (sK1 @ sK5)))) | ((sK0 @ sK5) = $false) | ($false = (~ ((sK2 @ sK5) | (sK1 @ sK5))))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.65/1.30 thf(f13,plain,(
% 1.65/1.30 ($false = ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5))) | ($false = (((sK0 @ sK5) & (~ (sK2 @ sK5))) & (~ (sK1 @ sK5))))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.65/1.30 thf(f11,plain,(
% 1.65/1.30 ((((sK0 @ sK5) & (~ (sK2 @ sK5))) & (~ (sK1 @ sK5))) != ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5)))),
% 1.65/1.30 inference(beta_eta_normalization,[status(thm)],[f10])).
% 1.65/1.30 thf(f10,plain,(
% 1.65/1.30 (((^[Y0 : a]: ((~ ((sK2 @ Y0) | (sK1 @ Y0))) & (sK0 @ Y0))) @ sK5) != ((^[Y0 : a]: (((sK0 @ Y0) & (~ (sK2 @ Y0))) & (~ (sK1 @ Y0)))) @ sK5))),
% 1.65/1.30 inference(negative_extensionality,[status(thm)],[f9])).
% 1.65/1.30 thf(f9,plain,(
% 1.65/1.30 ((^[Y0 : a]: (((sK0 @ Y0) & (~ (sK2 @ Y0))) & (~ (sK1 @ Y0)))) != (^[Y0 : a]: ((~ ((sK2 @ Y0) | (sK1 @ Y0))) & (sK0 @ Y0))))),
% 1.65/1.30 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.30 thf(f8,plain,(
% 1.65/1.30 ((^[Y0 : a]: (((sK0 @ Y0) & (~ (sK2 @ Y0))) & (~ (sK1 @ Y0)))) != (^[Y0 : a]: ((~ ((sK2 @ Y0) | (sK1 @ Y0))) & (sK0 @ Y0))))),
% 1.65/1.30 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7])).
% 1.65/1.30 thf(f7,plain,(
% 1.65/1.30 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[Y0 : a]: ((~ ((X2 @ Y0) | (X1 @ Y0))) & (X0 @ Y0))) != (^[Y0 : a]: (((X0 @ Y0) & (~ (X2 @ Y0))) & (~ (X1 @ Y0))))) => ((^[Y0 : a]: (((sK0 @ Y0) & (~ (sK2 @ Y0))) & (~ (sK1 @ Y0)))) != (^[Y0 : a]: ((~ ((sK2 @ Y0) | (sK1 @ Y0))) & (sK0 @ Y0))))),
% 1.65/1.30 introduced(definition,[],[choice_axiom])).
% 1.65/1.30 thf(f6,plain,(
% 1.65/1.30 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[Y0 : a]: ((~ ((X2 @ Y0) | (X1 @ Y0))) & (X0 @ Y0))) != (^[Y0 : a]: (((X0 @ Y0) & (~ (X2 @ Y0))) & (~ (X1 @ Y0)))))),
% 1.65/1.30 inference(ennf_transformation,[status(thm)],[f5])).
% 1.65/1.30 thf(f5,plain,(
% 1.65/1.30 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[Y0 : a]: ((~ ((X2 @ Y0) | (X1 @ Y0))) & (X0 @ Y0))) = (^[Y0 : a]: (((X0 @ Y0) & (~ (X2 @ Y0))) & (~ (X1 @ Y0)))))),
% 1.65/1.30 inference(fool_elimination,[status(thm)],[f4])).
% 1.65/1.30 thf(f4,plain,(
% 1.65/1.30 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o] : ((^[X3 : a] : ((X0 @ X3) & ~((X1 @ X3) | (X2 @ X3)))) = (^[X4 : a] : (~(X1 @ X4) & ~(X2 @ X4) & (X0 @ X4))))),
% 1.65/1.30 inference(rectify,[status(thm)],[f2])).
% 1.65/1.30 thf(f2,negated_conjecture,(
% 1.65/1.30 ~! [X0 : a > $o,X2 : a > $o,X1 : a > $o] : ((^[X3 : a] : ((X0 @ X3) & ~((X2 @ X3) | (X1 @ X3)))) = (^[X3 : a] : (~(X2 @ X3) & ~(X1 @ X3) & (X0 @ X3))))),
% 1.65/1.30 inference(negated_conjecture,[status(cth)],[f1])).
% 1.65/1.30 thf(f1,conjecture,(
% 1.65/1.30 ! [X0 : a > $o,X2 : a > $o,X1 : a > $o] : ((^[X3 : a] : ((X0 @ X3) & ~((X2 @ X3) | (X1 @ X3)))) = (^[X3 : a] : (~(X2 @ X3) & ~(X1 @ X3) & (X0 @ X3))))),
% 1.65/1.30 file('/export/starexec/sandbox2/tmp/tmp.zuTx8iO6Ey/DTF2THF_24075.p',cBOOL_PROP_88_pme)).
% 1.65/1.30 thf(f66,plain,(
% 1.65/1.30 spl3_2),
% 1.65/1.30 inference(avatar_split_clause,[status(thm)],[f33,f53])).
% 1.65/1.30 thf(f33,plain,(
% 1.65/1.30 ((sK0 @ sK5) = $true)),
% 1.65/1.30 inference(duplicate_literal_removal,[status(thm)],[f28])).
% 1.65/1.30 thf(f28,plain,(
% 1.65/1.30 ((sK0 @ sK5) = $true) | ((sK0 @ sK5) = $true)),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f27])).
% 1.65/1.30 thf(f27,plain,(
% 1.65/1.30 ($true = ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5))) | ((sK0 @ sK5) = $true)),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f25])).
% 1.65/1.30 thf(f25,plain,(
% 1.65/1.30 ($true = ((sK0 @ sK5) & (~ (sK2 @ sK5)))) | ($true = ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5)))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.65/1.30 thf(f12,plain,(
% 1.65/1.30 ($true = (((sK0 @ sK5) & (~ (sK2 @ sK5))) & (~ (sK1 @ sK5)))) | ($true = ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5)))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.65/1.30 thf(f65,plain,(
% 1.65/1.30 spl3_3),
% 1.65/1.30 inference(avatar_split_clause,[status(thm)],[f40,f59])).
% 1.65/1.30 thf(f40,plain,(
% 1.65/1.30 ((sK2 @ sK5) = $false)),
% 1.65/1.30 inference(duplicate_literal_removal,[status(thm)],[f39])).
% 1.65/1.30 thf(f39,plain,(
% 1.65/1.30 ((sK2 @ sK5) = $false) | ((sK2 @ sK5) = $false)),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f37])).
% 1.65/1.30 thf(f37,plain,(
% 1.65/1.30 ($false = ((sK2 @ sK5) | (sK1 @ sK5))) | ((sK2 @ sK5) = $false)),
% 1.65/1.30 inference(not_proxy_clausification,[status(thm)],[f36])).
% 1.65/1.30 thf(f36,plain,(
% 1.65/1.30 ((sK2 @ sK5) = $false) | ((~ ((sK2 @ sK5) | (sK1 @ sK5))) = $true)),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f34])).
% 1.65/1.30 thf(f34,plain,(
% 1.65/1.30 ((sK2 @ sK5) = $false) | ($true = ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5)))),
% 1.65/1.30 inference(not_proxy_clausification,[status(thm)],[f26])).
% 1.65/1.30 thf(f26,plain,(
% 1.65/1.30 ((~ (sK2 @ sK5)) = $true) | ($true = ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5)))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f25])).
% 1.65/1.30 thf(f57,plain,(
% 1.65/1.30 spl3_1),
% 1.65/1.30 inference(avatar_split_clause,[status(thm)],[f47,f49])).
% 1.65/1.30 thf(f47,plain,(
% 1.65/1.30 ($false = (sK1 @ sK5))),
% 1.65/1.30 inference(duplicate_literal_removal,[status(thm)],[f45])).
% 1.65/1.30 thf(f45,plain,(
% 1.65/1.30 ($false = (sK1 @ sK5)) | ($false = (sK1 @ sK5))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f44])).
% 1.65/1.30 thf(f44,plain,(
% 1.65/1.30 ($false = (sK1 @ sK5)) | ($false = ((sK2 @ sK5) | (sK1 @ sK5)))),
% 1.65/1.30 inference(not_proxy_clausification,[status(thm)],[f43])).
% 1.65/1.30 thf(f43,plain,(
% 1.65/1.30 ((~ ((sK2 @ sK5) | (sK1 @ sK5))) = $true) | ($false = (sK1 @ sK5))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f41])).
% 1.65/1.30 thf(f41,plain,(
% 1.65/1.30 ($false = (sK1 @ sK5)) | ($true = ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5)))),
% 1.65/1.30 inference(not_proxy_clausification,[status(thm)],[f24])).
% 1.65/1.30 thf(f24,plain,(
% 1.65/1.30 ((~ (sK1 @ sK5)) = $true) | ($true = ((~ ((sK2 @ sK5) | (sK1 @ sK5))) & (sK0 @ sK5)))),
% 1.65/1.30 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.65/1.30 % SZS output end Proof for DTF2THF_24075
% 1.65/1.30 % (24341)------------------------------
% 1.65/1.30 % (24341)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.30 % (24341)Termination reason: Refutation
% 1.65/1.30
% 1.65/1.30 % (24341)Memory used [KB]: 5500
% 1.65/1.30 % (24341)Time elapsed: 0.004 s
% 1.65/1.30 % (24341)Instructions burned: 4 (million)
% 1.65/1.30 % (24341)------------------------------
% 1.65/1.30 % (24341)------------------------------
% 1.65/1.30 % (24338)Success in time 0.013 s
%------------------------------------------------------------------------------