%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET600^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 : n021.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:52 AM UTC 2026
% Result : Theorem 1.65s 1.48s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 57 ( 1 unt; 0 typ; 3 def)
% Number of atoms : 344 ( 94 equ; 0 cnn)
% Maximal formula atoms : 12 ( 6 avg)
% Number of connectives : 304 ( 77 ~; 119 |; 15 &; 84 @)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 115 ( 89 ^; 18 !; 8 ?; 115 :)
% 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_8,type,
sK0: a > $o ).
thf(func_def_9,type,
sK1: a > $o ).
thf(func_def_11,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK4: a ).
thf(func_def_13,type,
sK5: a ).
thf(func_def_14,type,
sK6: a ).
thf(f66,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f22,f27,f28,f37,f42,f65]) ).
thf(f65,plain,
( ~ spl2_1
| spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[status(thm)],[f64]) ).
thf(f64,plain,
( $false
| ~ spl2_1
| spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[status(thm)],[f63]) ).
thf(f63,plain,
( ( $true = $false )
| ~ spl2_1
| spl2_2
| ~ spl2_3 ),
inference(forward_demodulation,[status(thm)],[f62,f44]) ).
thf(f44,plain,
( ! [X1: a] :
( ( sK0 @ X1 )
= $false )
| ~ spl2_1 ),
inference(beta_eta_normalization,[status(thm)],[f43]) ).
thf(f43,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( sK0 @ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[status(thm)],[f17]) ).
thf(f17,plain,
( ( sK0
= ( ^ [Y0: a] : $false ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[status(thm)],[f15]) ).
thf(f15,definition,
( spl2_1
<=> ( sK0
= ( ^ [Y0: a] : $false ) ) ),
introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition]) ).
thf(f62,plain,
( ( ( sK0 @ sK6 )
= $true )
| ~ spl2_1
| spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[status(thm)],[f61]) ).
thf(f61,plain,
( ( $true = $false )
| ( ( sK0 @ sK6 )
= $true )
| ~ spl2_1
| spl2_2
| ~ spl2_3 ),
inference(forward_demodulation,[status(thm)],[f60,f50]) ).
thf(f50,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= $false )
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[status(thm)],[f49]) ).
thf(f49,plain,
( ! [X1: a] :
( ( ( sK1 @ X1 )
= $false )
| ( $true = $false ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(forward_demodulation,[status(thm)],[f48,f44]) ).
thf(f48,plain,
( ! [X1: a] :
( ( ( sK1 @ X1 )
= $false )
| ( $true
= ( sK0 @ X1 ) ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(binary_proxy_clausification,[status(thm)],[f46]) ).
thf(f46,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( sK0 @ X1 ) )
| ~ spl2_1
| ~ spl2_3 ),
inference(argument_congruence,[status(thm)],[f45]) ).
thf(f45,plain,
( ( sK0 = sK1 )
| ~ spl2_1
| ~ spl2_3 ),
inference(forward_demodulation,[status(thm)],[f25,f17]) ).
thf(f25,plain,
( ( ( ^ [Y0: a] : $false )
= sK1 )
| ~ spl2_3 ),
inference(avatar_component_clause,[status(thm)],[f24]) ).
thf(f24,definition,
( spl2_3
<=> ( ( ^ [Y0: a] : $false )
= sK1 ) ),
introduced(definition,[new_symbols(naming,[spl2_3])],[avatar_definition]) ).
thf(f60,plain,
( ( ( sK1 @ sK6 )
= $true )
| ( ( sK0 @ sK6 )
= $true )
| ~ spl2_1
| spl2_2 ),
inference(duplicate_literal_removal,[status(thm)],[f59]) ).
thf(f59,plain,
( ( ( sK1 @ sK6 )
= $true )
| ( ( sK0 @ sK6 )
= $true )
| ( ( sK0 @ sK6 )
= $true )
| ~ spl2_1
| spl2_2 ),
inference(binary_proxy_clausification,[status(thm)],[f54]) ).
thf(f54,plain,
( ( ( sK0 @ sK6 )
= $true )
| ( ( ( sK1 @ sK6 )
| ( sK0 @ sK6 ) )
= $true )
| ~ spl2_1
| spl2_2 ),
inference(binary_proxy_clausification,[status(thm)],[f53]) ).
thf(f53,plain,
( ( ( sK0 @ sK6 )
!= ( ( sK1 @ sK6 )
| ( sK0 @ sK6 ) ) )
| ~ spl2_1
| spl2_2 ),
inference(beta_eta_normalization,[status(thm)],[f52]) ).
thf(f52,plain,
( ( ( sK0 @ sK6 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK6 ) )
| ~ spl2_1
| spl2_2 ),
inference(negative_extensionality,[status(thm)],[f51]) ).
thf(f51,plain,
( ( sK0
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) )
| ~ spl2_1
| spl2_2 ),
inference(forward_demodulation,[status(thm)],[f20,f17]) ).
thf(f20,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| spl2_2 ),
inference(avatar_component_clause,[status(thm)],[f19]) ).
thf(f19,definition,
( spl2_2
<=> ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ),
introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition]) ).
thf(f42,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[status(thm)],[f41]) ).
thf(f41,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[status(thm)],[f40]) ).
thf(f40,plain,
( ( $false != $false )
| spl2_1
| ~ spl2_2 ),
inference(superposition,[status(thm)],[f39,f33]) ).
thf(f33,plain,
( ! [X1: a] :
( ( sK0 @ X1 )
= $false )
| ~ spl2_2 ),
inference(binary_proxy_clausification,[status(thm)],[f32]) ).
thf(f32,plain,
( ! [X1: a] :
( ( ( sK1 @ X1 )
| ( sK0 @ X1 ) )
= $false )
| ~ spl2_2 ),
inference(beta_eta_normalization,[status(thm)],[f31]) ).
thf(f31,plain,
( ! [X1: a] :
( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[status(thm)],[f21]) ).
thf(f21,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[status(thm)],[f19]) ).
thf(f39,plain,
( ( ( sK0 @ sK5 )
!= $false )
| spl2_1 ),
inference(beta_eta_normalization,[status(thm)],[f38]) ).
thf(f38,plain,
( ( ( sK0 @ sK5 )
!= ( ^ [Y0: a] : $false
@ sK5 ) )
| spl2_1 ),
inference(negative_extensionality,[status(thm)],[f16]) ).
thf(f16,plain,
( ( sK0
!= ( ^ [Y0: a] : $false ) )
| spl2_1 ),
inference(avatar_component_clause,[status(thm)],[f15]) ).
thf(f37,plain,
( ~ spl2_2
| spl2_3 ),
inference(avatar_contradiction_clause,[status(thm)],[f36]) ).
thf(f36,plain,
( $false
| ~ spl2_2
| spl2_3 ),
inference(trivial_inequality_removal,[status(thm)],[f35]) ).
thf(f35,plain,
( ( $false != $false )
| ~ spl2_2
| spl2_3 ),
inference(superposition,[status(thm)],[f30,f34]) ).
thf(f34,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= $false )
| ~ spl2_2 ),
inference(binary_proxy_clausification,[status(thm)],[f32]) ).
thf(f30,plain,
( ( ( sK1 @ sK4 )
!= $false )
| spl2_3 ),
inference(beta_eta_normalization,[status(thm)],[f29]) ).
thf(f29,plain,
( ( ( sK1 @ sK4 )
!= ( ^ [Y0: a] : $false
@ sK4 ) )
| spl2_3 ),
inference(negative_extensionality,[status(thm)],[f26]) ).
thf(f26,plain,
( ( ( ^ [Y0: a] : $false )
!= sK1 )
| spl2_3 ),
inference(avatar_component_clause,[status(thm)],[f24]) ).
thf(f28,plain,
( spl2_3
| spl2_2 ),
inference(avatar_split_clause,[status(thm)],[f11,f19,f24]) ).
thf(f11,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] : $false )
= sK1 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ( sK0
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] : $false )
!= sK1 )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) ) )
& ( ( ( sK0
= ( ^ [Y0: a] : $false ) )
& ( ( ^ [Y0: a] : $false )
= sK1 ) )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= X0 )
| ( ( ^ [Y0: a] : $false )
!= X1 )
| ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) )
& ( ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) )
| ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) ) )
=> ( ( ( sK0
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] : $false )
!= sK1 )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) ) )
& ( ( ( sK0
= ( ^ [Y0: a] : $false ) )
& ( ( ^ [Y0: a] : $false )
= sK1 ) )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= X0 )
| ( ( ^ [Y0: a] : $false )
!= X1 )
| ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) )
& ( ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) )
| ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) ) ),
inference(flattening,[status(thm)],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= X0 )
| ( ( ^ [Y0: a] : $false )
!= X1 )
| ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) )
& ( ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) )
| ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ) ) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
<~> ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
<=> ( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
= X1 ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [X2: a] : $false )
= X1 )
& ( X0
= ( ^ [X3: a] : $false ) ) )
<=> ( ( ^ [X4: a] :
( ( X0 @ X4 )
| ( X1 @ X4 ) ) )
= ( ^ [X5: a] : $false ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ( ( ( ^ [X3: a] : $false )
= X0 )
& ( X1
= ( ^ [X3: a] : $false ) ) )
<=> ( ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= ( ^ [X3: a] : $false ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ( ( ( ^ [X3: a] : $false )
= X0 )
& ( X1
= ( ^ [X3: a] : $false ) ) )
<=> ( ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= ( ^ [X3: a] : $false ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6clsEQKD9J/DTF2THF_24176.p',cBOOL_PROP_59_pme) ).
thf(f27,plain,
( ~ spl2_2
| ~ spl2_3
| ~ spl2_1 ),
inference(avatar_split_clause,[status(thm)],[f13,f15,f24,f19]) ).
thf(f13,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| ( sK0
!= ( ^ [Y0: a] : $false ) )
| ( ( ^ [Y0: a] : $false )
!= sK1 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f22,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[status(thm)],[f12,f19,f15]) ).
thf(f12,plain,
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
| ( sK0
= ( ^ [Y0: a] : $false ) ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET600^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n021.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue Feb 24 12:00:09 EST 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.33 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.19/0.46 ---- Original DTF file ---
% 0.19/0.47 thf(spec,logic,$$dhol).
% 0.19/0.47 %------------------------------------------------------------------------------
% 0.19/0.47 % File : SET600^5 : TPTP v9.2.1. Released v4.0.0.
% 0.19/0.47 % Domain : Set Theory
% 0.19/0.47 % Problem : TPS problem BOOL-PROP-59
% 0.19/0.47 % Version : Especial.
% 0.19/0.47 % English : Trybulec's 59th Boolean property of sets
% 0.19/0.47
% 0.19/0.47 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.19/0.47 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.19/0.47 % Source : [Bro09]
% 0.19/0.47 % Names : tps_0475 [Bro09]
% 0.19/0.47 % : BOOL-PROP-59 [TPS]
% 0.19/0.47
% 0.19/0.47 % Status : Theorem
% 0.19/0.47 % Rating : 0.00 v8.2.0, 0.15 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.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.19/0.47 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.19/0.47 % Number of atoms : 6 ( 3 equ; 0 cnn)
% 0.19/0.47 % Maximal formula atoms : 3 ( 6 avg)
% 0.19/0.47 % Number of connectives : 5 ( 0 ~; 1 |; 1 &; 2 @)
% 0.19/0.47 % ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% 0.19/0.47 % Maximal formula depth : 5 ( 5 avg)
% 0.19/0.47 % Number of types : 2 ( 1 usr)
% 0.19/0.47 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.19/0.47 % Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% 0.19/0.47 % Number of variables : 6 ( 4 ^; 2 !; 0 ?; 6 :)
% 0.19/0.47 % SPC : TH0_THM_EQU_NAR
% 0.19/0.47
% 0.19/0.47 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.19/0.47 % project in the Department of Mathematical Sciences at Carnegie
% 0.19/0.47 % Mellon University. Distributed under the Creative Commons copyleft
% 0.19/0.47 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.19/0.47 % : Polymorphic definitions expanded.
% 0.19/0.47 %------------------------------------------------------------------------------
% 0.19/0.47 thf(a_type,type,
% 0.19/0.47 a: $tType ).
% 0.19/0.47
% 0.19/0.47 thf(cBOOL_PROP_59_pme,conjecture,
% 0.19/0.47 ! [X: a > $o,Y: a > $o] :
% 0.19/0.47 ( ( ( ^ [Xz: a] :
% 0.19/0.47 ( ( X @ Xz )
% 0.19/0.47 | ( Y @ Xz ) ) )
% 0.19/0.47 = ( ^ [Xx: a] : $false ) )
% 0.19/0.47 <=> ( ( X
% 0.19/0.47 = ( ^ [Xx: a] : $false ) )
% 0.19/0.47 & ( Y
% 0.19/0.47 = ( ^ [Xx: a] : $false ) ) ) ) ).
% 0.19/0.47
% 0.19/0.47 %------------------------------------------------------------------------------
% 0.19/0.47 ------------------------
% 1.65/1.45 ---- Embedded in THF ---
% 1.65/1.45 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.65/1.45 %%% Generated on Tue Feb 24 12:00:10 EST 2026
% 1.65/1.45 %%% using '$$dhol' embedding, version 1.3.0.
% 1.65/1.45 %%% Logic specification used:
% 1.65/1.45 %%% thf(spec, logic, $$dhol).
% 1.65/1.45
% 1.65/1.45 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.6clsEQKD9J/DTF2DTF24176.p
% See solution above
% 1.65/1.45 ------------------------
% 1.65/1.46 ---- Cleaned THF ---
% 1.65/1.46 thf(a_type,type,
% 1.65/1.46 a: $tType ).
% 1.65/1.46
% 1.65/1.46 thf(cBOOL_PROP_59_pme,conjecture,
% 1.65/1.46 ! [X: a > $o,Y: a > $o] :
% 1.65/1.46 ( ( ( ^ [Xz: a] :
% 1.65/1.46 ( ( X @ Xz )
% 1.65/1.46 | ( Y @ Xz ) ) )
% 1.65/1.46 = ( ^ [Xx: a] : $false ) )
% 1.65/1.46 <=> ( ( X
% 1.65/1.46 = ( ^ [Xx: a] : $false ) )
% 1.65/1.46 & ( Y
% 1.65/1.46 = ( ^ [Xx: a] : $false ) ) ) ) ).
% 1.65/1.46 ------------------------
% 1.65/1.48 % (24348)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_24176 for (3000ds/183Mi)
% 1.65/1.48 % (24350)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_24176 for (3000ds/27Mi)
% 1.65/1.48 % (24351)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_24176 for (3000ds/2Mi)
% 1.65/1.48 % (24349)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_24176 for (3000ds/4Mi)
% 1.65/1.48 % (24353)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_24176 for (3000ds/275Mi)
% 1.65/1.48 % (24352)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_24176 for (3000ds/2Mi)
% 1.65/1.48 % (24354)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_24176 for (3000ds/18Mi)
% 1.65/1.48 % (24351)Instruction limit reached!
% 1.65/1.48 % (24351)------------------------------
% 1.65/1.48 % (24351)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.48 % (24351)Termination reason: Unknown
% 1.65/1.48 % (24351)Termination phase: Saturation
% 1.65/1.48 % (24352)Instruction limit reached!
% 1.65/1.48 % (24352)------------------------------
% 1.65/1.48 % (24352)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.48 % (24352)Termination reason: Unknown
% 1.65/1.48 % (24352)Termination phase: Saturation
% 1.65/1.48
% 1.65/1.48 % (24352)Memory used [KB]: 5500
% 1.65/1.48 % (24352)Time elapsed: 0.003 s
% 1.65/1.48 % (24352)Instructions burned: 2 (million)
% 1.65/1.48 % (24352)------------------------------
% 1.65/1.48 % (24352)------------------------------
% 1.65/1.48
% 1.65/1.48 % (24351)Memory used [KB]: 5500
% 1.65/1.48 % (24351)Time elapsed: 0.003 s
% 1.65/1.48 % (24351)Instructions burned: 2 (million)
% 1.65/1.48 % (24351)------------------------------
% 1.65/1.48 % (24351)------------------------------
% 1.65/1.48 % (24350)First to succeed.
% 1.65/1.48 % (24349)Instruction limit reached!
% 1.65/1.48 % (24349)------------------------------
% 1.65/1.48 % (24349)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.48 % (24349)Termination reason: Unknown
% 1.65/1.48 % (24349)Termination phase: Saturation
% 1.65/1.48
% 1.65/1.48 % (24349)Memory used [KB]: 5500
% 1.65/1.48 % (24349)Time elapsed: 0.005 s
% 1.65/1.48 % (24349)Instructions burned: 5 (million)
% 1.65/1.48 % (24349)------------------------------
% 1.65/1.48 % (24349)------------------------------
% 1.65/1.48 % (24353)Also succeeded, but the first one will report.
% 1.65/1.48 % (24348)Also succeeded, but the first one will report.
% 1.65/1.48 % (24350)Refutation found. Thanks to Tanya!
% 1.65/1.48 % SZS status Theorem for DTF2THF_24176
% 1.65/1.48 % SZS output start Proof for DTF2THF_24176
% 1.65/1.48 thf(type_def_5, type, a: $tType).
% 1.65/1.48 thf(func_def_0, type, a: $tType).
% 1.65/1.48 thf(func_def_2, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.65/1.48 thf(func_def_8, type, sK0: a > $o).
% 1.65/1.48 thf(func_def_9, type, sK1: a > $o).
% 1.65/1.48 thf(func_def_11, type, ph3: !>[X0: $tType]:(X0)).
% 1.65/1.48 thf(func_def_12, type, sK4: a).
% 1.65/1.48 thf(func_def_13, type, sK5: a).
% 1.65/1.48 thf(func_def_14, type, sK6: a).
% 1.65/1.48 thf(f66,plain,(
% 1.65/1.48 $false),
% 1.65/1.48 inference(avatar_sat_refutation,[status(thm)],[f22,f27,f28,f37,f42,f65])).
% 1.65/1.48 thf(f65,plain,(
% 1.65/1.48 ~spl2_1 | spl2_2 | ~spl2_3),
% 1.65/1.48 inference(avatar_contradiction_clause,[status(thm)],[f64])).
% 1.65/1.48 thf(f64,plain,(
% 1.65/1.48 $false | (~spl2_1 | spl2_2 | ~spl2_3)),
% 1.65/1.48 inference(trivial_inequality_removal,[status(thm)],[f63])).
% 1.65/1.48 thf(f63,plain,(
% 1.65/1.48 ($true = $false) | (~spl2_1 | spl2_2 | ~spl2_3)),
% 1.65/1.48 inference(forward_demodulation,[status(thm)],[f62,f44])).
% 1.65/1.48 thf(f44,plain,(
% 1.65/1.48 ( ! [X1 : a] : (((sK0 @ X1) = $false)) ) | ~spl2_1),
% 1.65/1.48 inference(beta_eta_normalization,[status(thm)],[f43])).
% 1.65/1.48 thf(f43,plain,(
% 1.65/1.48 ( ! [X1 : a] : ((((^[Y0 : a]: ($false)) @ X1) = (sK0 @ X1))) ) | ~spl2_1),
% 1.65/1.48 inference(argument_congruence,[status(thm)],[f17])).
% 1.65/1.48 thf(f17,plain,(
% 1.65/1.48 (sK0 = (^[Y0 : a]: ($false))) | ~spl2_1),
% 1.65/1.48 inference(avatar_component_clause,[status(thm)],[f15])).
% 1.65/1.48 thf(f15,definition,(
% 1.65/1.48 spl2_1 <=> (sK0 = (^[Y0 : a]: ($false)))),
% 1.65/1.48 introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition])).
% 1.65/1.48 thf(f62,plain,(
% 1.65/1.48 ((sK0 @ sK6) = $true) | (~spl2_1 | spl2_2 | ~spl2_3)),
% 1.65/1.48 inference(trivial_inequality_removal,[status(thm)],[f61])).
% 1.65/1.48 thf(f61,plain,(
% 1.65/1.48 ($true = $false) | ((sK0 @ sK6) = $true) | (~spl2_1 | spl2_2 | ~spl2_3)),
% 1.65/1.48 inference(forward_demodulation,[status(thm)],[f60,f50])).
% 1.65/1.48 thf(f50,plain,(
% 1.65/1.48 ( ! [X1 : a] : (((sK1 @ X1) = $false)) ) | (~spl2_1 | ~spl2_3)),
% 1.65/1.48 inference(trivial_inequality_removal,[status(thm)],[f49])).
% 1.65/1.48 thf(f49,plain,(
% 1.65/1.48 ( ! [X1 : a] : (((sK1 @ X1) = $false) | ($true = $false)) ) | (~spl2_1 | ~spl2_3)),
% 1.65/1.48 inference(forward_demodulation,[status(thm)],[f48,f44])).
% 1.65/1.48 thf(f48,plain,(
% 1.65/1.48 ( ! [X1 : a] : (((sK1 @ X1) = $false) | ($true = (sK0 @ X1))) ) | (~spl2_1 | ~spl2_3)),
% 1.65/1.48 inference(binary_proxy_clausification,[status(thm)],[f46])).
% 1.65/1.48 thf(f46,plain,(
% 1.65/1.48 ( ! [X1 : a] : (((sK1 @ X1) = (sK0 @ X1))) ) | (~spl2_1 | ~spl2_3)),
% 1.65/1.48 inference(argument_congruence,[status(thm)],[f45])).
% 1.65/1.48 thf(f45,plain,(
% 1.65/1.48 (sK0 = sK1) | (~spl2_1 | ~spl2_3)),
% 1.65/1.48 inference(forward_demodulation,[status(thm)],[f25,f17])).
% 1.65/1.48 thf(f25,plain,(
% 1.65/1.48 ((^[Y0 : a]: ($false)) = sK1) | ~spl2_3),
% 1.65/1.48 inference(avatar_component_clause,[status(thm)],[f24])).
% 1.65/1.48 thf(f24,definition,(
% 1.65/1.48 spl2_3 <=> ((^[Y0 : a]: ($false)) = sK1)),
% 1.65/1.48 introduced(definition,[new_symbols(naming,[spl2_3])],[avatar_definition])).
% 1.65/1.48 thf(f60,plain,(
% 1.65/1.48 ((sK1 @ sK6) = $true) | ((sK0 @ sK6) = $true) | (~spl2_1 | spl2_2)),
% 1.65/1.48 inference(duplicate_literal_removal,[status(thm)],[f59])).
% 1.65/1.48 thf(f59,plain,(
% 1.65/1.48 ((sK1 @ sK6) = $true) | ((sK0 @ sK6) = $true) | ((sK0 @ sK6) = $true) | (~spl2_1 | spl2_2)),
% 1.65/1.48 inference(binary_proxy_clausification,[status(thm)],[f54])).
% 1.65/1.48 thf(f54,plain,(
% 1.65/1.48 ((sK0 @ sK6) = $true) | (((sK1 @ sK6) | (sK0 @ sK6)) = $true) | (~spl2_1 | spl2_2)),
% 1.65/1.48 inference(binary_proxy_clausification,[status(thm)],[f53])).
% 1.65/1.48 thf(f53,plain,(
% 1.65/1.48 ((sK0 @ sK6) != ((sK1 @ sK6) | (sK0 @ sK6))) | (~spl2_1 | spl2_2)),
% 1.65/1.48 inference(beta_eta_normalization,[status(thm)],[f52])).
% 1.65/1.48 thf(f52,plain,(
% 1.65/1.48 ((sK0 @ sK6) != ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) @ sK6)) | (~spl2_1 | spl2_2)),
% 1.65/1.48 inference(negative_extensionality,[status(thm)],[f51])).
% 1.65/1.48 thf(f51,plain,(
% 1.65/1.48 (sK0 != (^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0)))) | (~spl2_1 | spl2_2)),
% 1.65/1.48 inference(forward_demodulation,[status(thm)],[f20,f17])).
% 1.65/1.48 thf(f20,plain,(
% 1.65/1.48 ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) != (^[Y0 : a]: ($false))) | spl2_2),
% 1.65/1.48 inference(avatar_component_clause,[status(thm)],[f19])).
% 1.65/1.48 thf(f19,definition,(
% 1.65/1.48 spl2_2 <=> ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) = (^[Y0 : a]: ($false)))),
% 1.65/1.48 introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition])).
% 1.65/1.48 thf(f42,plain,(
% 1.65/1.48 spl2_1 | ~spl2_2),
% 1.65/1.48 inference(avatar_contradiction_clause,[status(thm)],[f41])).
% 1.65/1.48 thf(f41,plain,(
% 1.65/1.48 $false | (spl2_1 | ~spl2_2)),
% 1.65/1.48 inference(trivial_inequality_removal,[status(thm)],[f40])).
% 1.65/1.48 thf(f40,plain,(
% 1.65/1.48 ($false != $false) | (spl2_1 | ~spl2_2)),
% 1.65/1.48 inference(superposition,[status(thm)],[f39,f33])).
% 1.65/1.48 thf(f33,plain,(
% 1.65/1.48 ( ! [X1 : a] : (((sK0 @ X1) = $false)) ) | ~spl2_2),
% 1.65/1.48 inference(binary_proxy_clausification,[status(thm)],[f32])).
% 1.65/1.48 thf(f32,plain,(
% 1.65/1.48 ( ! [X1 : a] : ((((sK1 @ X1) | (sK0 @ X1)) = $false)) ) | ~spl2_2),
% 1.65/1.48 inference(beta_eta_normalization,[status(thm)],[f31])).
% 1.65/1.48 thf(f31,plain,(
% 1.65/1.48 ( ! [X1 : a] : ((((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) @ X1) = ((^[Y0 : a]: ($false)) @ X1))) ) | ~spl2_2),
% 1.65/1.48 inference(argument_congruence,[status(thm)],[f21])).
% 1.65/1.48 thf(f21,plain,(
% 1.65/1.48 ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) = (^[Y0 : a]: ($false))) | ~spl2_2),
% 1.65/1.48 inference(avatar_component_clause,[status(thm)],[f19])).
% 1.65/1.48 thf(f39,plain,(
% 1.65/1.48 ((sK0 @ sK5) != $false) | spl2_1),
% 1.65/1.48 inference(beta_eta_normalization,[status(thm)],[f38])).
% 1.65/1.48 thf(f38,plain,(
% 1.65/1.48 ((sK0 @ sK5) != ((^[Y0 : a]: ($false)) @ sK5)) | spl2_1),
% 1.65/1.48 inference(negative_extensionality,[status(thm)],[f16])).
% 1.65/1.48 thf(f16,plain,(
% 1.65/1.48 (sK0 != (^[Y0 : a]: ($false))) | spl2_1),
% 1.65/1.48 inference(avatar_component_clause,[status(thm)],[f15])).
% 1.65/1.48 thf(f37,plain,(
% 1.65/1.48 ~spl2_2 | spl2_3),
% 1.65/1.48 inference(avatar_contradiction_clause,[status(thm)],[f36])).
% 1.65/1.48 thf(f36,plain,(
% 1.65/1.48 $false | (~spl2_2 | spl2_3)),
% 1.65/1.48 inference(trivial_inequality_removal,[status(thm)],[f35])).
% 1.65/1.48 thf(f35,plain,(
% 1.65/1.48 ($false != $false) | (~spl2_2 | spl2_3)),
% 1.65/1.48 inference(superposition,[status(thm)],[f30,f34])).
% 1.65/1.48 thf(f34,plain,(
% 1.65/1.48 ( ! [X1 : a] : (((sK1 @ X1) = $false)) ) | ~spl2_2),
% 1.65/1.48 inference(binary_proxy_clausification,[status(thm)],[f32])).
% 1.65/1.48 thf(f30,plain,(
% 1.65/1.48 ((sK1 @ sK4) != $false) | spl2_3),
% 1.65/1.48 inference(beta_eta_normalization,[status(thm)],[f29])).
% 1.65/1.48 thf(f29,plain,(
% 1.65/1.48 ((sK1 @ sK4) != ((^[Y0 : a]: ($false)) @ sK4)) | spl2_3),
% 1.65/1.48 inference(negative_extensionality,[status(thm)],[f26])).
% 1.65/1.48 thf(f26,plain,(
% 1.65/1.48 ((^[Y0 : a]: ($false)) != sK1) | spl2_3),
% 1.65/1.48 inference(avatar_component_clause,[status(thm)],[f24])).
% 1.65/1.48 thf(f28,plain,(
% 1.65/1.48 spl2_3 | spl2_2),
% 1.65/1.48 inference(avatar_split_clause,[status(thm)],[f11,f19,f24])).
% 1.65/1.48 thf(f11,plain,(
% 1.65/1.48 ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) = (^[Y0 : a]: ($false))) | ((^[Y0 : a]: ($false)) = sK1)),
% 1.65/1.48 inference(cnf_transformation,[status(thm)],[f10])).
% 1.65/1.48 thf(f10,plain,(
% 1.65/1.48 ((sK0 != (^[Y0 : a]: ($false))) | ((^[Y0 : a]: ($false)) != sK1) | ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) != (^[Y0 : a]: ($false)))) & (((sK0 = (^[Y0 : a]: ($false))) & ((^[Y0 : a]: ($false)) = sK1)) | ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) = (^[Y0 : a]: ($false))))),
% 1.65/1.48 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f9])).
% 1.65/1.48 thf(f9,plain,(
% 1.65/1.48 ? [X0 : a > $o,X1 : a > $o] : ((((^[Y0 : a]: ($false)) != X0) | ((^[Y0 : a]: ($false)) != X1) | ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0))))) & ((((^[Y0 : a]: ($false)) = X0) & ((^[Y0 : a]: ($false)) = X1)) | ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0)))))) => (((sK0 != (^[Y0 : a]: ($false))) | ((^[Y0 : a]: ($false)) != sK1) | ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) != (^[Y0 : a]: ($false)))) & (((sK0 = (^[Y0 : a]: ($false))) & ((^[Y0 : a]: ($false)) = sK1)) | ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) = (^[Y0 : a]: ($false)))))),
% 1.65/1.48 introduced(definition,[],[choice_axiom])).
% 1.65/1.48 thf(f8,plain,(
% 1.65/1.48 ? [X0 : a > $o,X1 : a > $o] : ((((^[Y0 : a]: ($false)) != X0) | ((^[Y0 : a]: ($false)) != X1) | ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0))))) & ((((^[Y0 : a]: ($false)) = X0) & ((^[Y0 : a]: ($false)) = X1)) | ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0))))))),
% 1.65/1.48 inference(flattening,[status(thm)],[f7])).
% 1.65/1.48 thf(f7,plain,(
% 1.65/1.48 ? [X0 : a > $o,X1 : a > $o] : (((((^[Y0 : a]: ($false)) != X0) | ((^[Y0 : a]: ($false)) != X1)) | ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0))))) & ((((^[Y0 : a]: ($false)) = X0) & ((^[Y0 : a]: ($false)) = X1)) | ((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0))))))),
% 1.65/1.48 inference(nnf_transformation,[status(thm)],[f6])).
% 1.65/1.48 thf(f6,plain,(
% 1.65/1.48 ? [X0 : a > $o,X1 : a > $o] : (((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0)))) <~> (((^[Y0 : a]: ($false)) = X0) & ((^[Y0 : a]: ($false)) = X1)))),
% 1.65/1.48 inference(ennf_transformation,[status(thm)],[f5])).
% 1.65/1.48 thf(f5,plain,(
% 1.65/1.48 ~! [X0 : a > $o,X1 : a > $o] : (((^[Y0 : a]: ($false)) = (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0)))) <=> (((^[Y0 : a]: ($false)) = X0) & ((^[Y0 : a]: ($false)) = X1)))),
% 1.65/1.48 inference(fool_elimination,[status(thm)],[f4])).
% 1.65/1.48 thf(f4,plain,(
% 1.65/1.48 ~! [X0 : a > $o,X1 : a > $o] : ((((^[X2 : a] : ($false)) = X1) & (X0 = (^[X3 : a] : ($false)))) <=> ((^[X4 : a] : ((X0 @ X4) | (X1 @ X4))) = (^[X5 : a] : ($false))))),
% 1.65/1.48 inference(rectify,[status(thm)],[f2])).
% 1.65/1.48 thf(f2,negated_conjecture,(
% 1.65/1.48 ~! [X1 : a > $o,X0 : a > $o] : ((((^[X3 : a] : ($false)) = X0) & (X1 = (^[X3 : a] : ($false)))) <=> ((^[X2 : a] : ((X1 @ X2) | (X0 @ X2))) = (^[X3 : a] : ($false))))),
% 1.65/1.48 inference(negated_conjecture,[status(cth)],[f1])).
% 1.65/1.48 thf(f1,conjecture,(
% 1.65/1.48 ! [X1 : a > $o,X0 : a > $o] : ((((^[X3 : a] : ($false)) = X0) & (X1 = (^[X3 : a] : ($false)))) <=> ((^[X2 : a] : ((X1 @ X2) | (X0 @ X2))) = (^[X3 : a] : ($false))))),
% 1.65/1.48 file('/export/starexec/sandbox/tmp/tmp.6clsEQKD9J/DTF2THF_24176.p',cBOOL_PROP_59_pme)).
% 1.65/1.48 thf(f27,plain,(
% 1.65/1.48 ~spl2_2 | ~spl2_3 | ~spl2_1),
% 1.65/1.48 inference(avatar_split_clause,[status(thm)],[f13,f15,f24,f19])).
% 1.65/1.48 thf(f13,plain,(
% 1.65/1.48 ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) != (^[Y0 : a]: ($false))) | (sK0 != (^[Y0 : a]: ($false))) | ((^[Y0 : a]: ($false)) != sK1)),
% 1.65/1.48 inference(cnf_transformation,[status(thm)],[f10])).
% 1.65/1.48 thf(f22,plain,(
% 1.65/1.48 spl2_1 | spl2_2),
% 1.65/1.48 inference(avatar_split_clause,[status(thm)],[f12,f19,f15])).
% 1.65/1.48 thf(f12,plain,(
% 1.65/1.48 ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) = (^[Y0 : a]: ($false))) | (sK0 = (^[Y0 : a]: ($false)))),
% 1.65/1.48 inference(cnf_transformation,[status(thm)],[f10])).
% 1.65/1.48 % SZS output end Proof for DTF2THF_24176
% 1.65/1.48 % (24350)------------------------------
% 1.65/1.48 % (24350)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.48 % (24350)Termination reason: Refutation
% 1.65/1.48
% 1.65/1.48 % (24350)Memory used [KB]: 5500
% 1.65/1.48 % (24350)Time elapsed: 0.005 s
% 1.65/1.48 % (24350)Instructions burned: 3 (million)
% 1.65/1.48 % (24350)------------------------------
% 1.65/1.48 % (24350)------------------------------
% 1.65/1.48 % (24347)Success in time 0.018 s
%------------------------------------------------------------------------------