%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV062^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Feb 25 09:40:11 AM UTC 2026
% Result : Theorem 1.40s 1.23s
% Output : Refutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 61 ( 3 unt; 0 typ; 5 def)
% Number of atoms : 653 ( 198 equ; 0 cnn)
% Maximal formula atoms : 24 ( 10 avg)
% Number of connectives : 883 ( 108 ~; 120 |; 62 &; 556 @)
% ( 5 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 80 ( 80 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 173 ( 0 ^; 125 !; 48 ?; 173 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK1: $i > $i > $o ).
thf(func_def_7,type,
sK3: ( $i > $i > $o ) > $i ).
thf(func_def_8,type,
sK4: ( $i > $i > $o ) > $i ).
thf(func_def_9,type,
sK5: ( $i > $i > $o ) > $i ).
thf(func_def_10,type,
sK6: ( $i > $i > $o ) > $i ).
thf(func_def_11,type,
sK7: ( $i > $i > $o ) > $i ).
thf(func_def_12,type,
sK8: $i > $i > $o ).
thf(func_def_14,type,
ph10:
!>[X0: $tType] : X0 ).
thf(f140,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f94,f107,f111,f127,f132,f139]) ).
thf(f139,plain,
( spl9_7
| ~ spl9_8 ),
inference(avatar_split_clause,[status(thm)],[f138,f129,f124]) ).
thf(f124,definition,
( spl9_7
<=> ( $true
= ( sK8 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) ) ),
introduced(definition,[new_symbols(naming,[spl9_7])],[avatar_definition]) ).
thf(f129,definition,
( spl9_8
<=> ( $true
= ( sK1 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) ) ),
introduced(definition,[new_symbols(naming,[spl9_8])],[avatar_definition]) ).
thf(f138,plain,
( ( $true
= ( sK8 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) )
| ~ spl9_8 ),
inference(trivial_inequality_removal,[status(thm)],[f137]) ).
thf(f137,plain,
( ( $true
= ( sK8 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) )
| ( $true != $true )
| ~ spl9_8 ),
inference(superposition,[status(thm)],[f15,f131]) ).
thf(f131,plain,
( ( $true
= ( sK1 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) )
| ~ spl9_8 ),
inference(avatar_component_clause,[status(thm)],[f129]) ).
thf(f15,plain,
! [X10: $i,X11: $i] :
( ( $true
!= ( sK1 @ X11 @ X10 ) )
| ( $true
= ( sK8 @ X11 @ X10 ) ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ! [X3: $i > $i > $o] :
( ( ( $true
= ( sK1 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) ) )
& ( ( X3 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) )
!= $true ) )
| ( ( X3 @ sK0 @ sK2 )
= $true )
| ( ( ( X3 @ ( sK5 @ X3 ) @ ( sK6 @ X3 ) )
!= $true )
& ( ( sK1 @ ( sK7 @ X3 ) @ ( sK6 @ X3 ) )
= $true )
& ( ( X3 @ ( sK5 @ X3 ) @ ( sK7 @ X3 ) )
= $true ) ) )
& ( $true
!= ( sK8 @ sK0 @ sK2 ) )
& ! [X10: $i,X11: $i] :
( ( $true
= ( sK8 @ X11 @ X10 ) )
| ( $true
!= ( sK1 @ X11 @ X10 ) ) )
& ! [X12: $i,X13: $i,X14: $i] :
( ( $true
= ( sK8 @ X12 @ X14 ) )
| ( ( sK8 @ X12 @ X13 )
!= $true )
| ( $true
!= ( sK8 @ X13 @ X14 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i > $i > $o,X2: $i] :
( ! [X3: $i > $i > $o] :
( ? [X4: $i,X5: $i] :
( ( ( X1 @ X4 @ X5 )
= $true )
& ( ( X3 @ X4 @ X5 )
!= $true ) )
| ( ( X3 @ X0 @ X2 )
= $true )
| ? [X6: $i,X7: $i,X8: $i] :
( ( ( X3 @ X6 @ X7 )
!= $true )
& ( ( X1 @ X8 @ X7 )
= $true )
& ( ( X3 @ X6 @ X8 )
= $true ) ) )
& ? [X9: $i > $i > $o] :
( ( $true
!= ( X9 @ X0 @ X2 ) )
& ! [X10: $i,X11: $i] :
( ( ( X9 @ X11 @ X10 )
= $true )
| ( ( X1 @ X11 @ X10 )
!= $true ) )
& ! [X12: $i,X13: $i,X14: $i] :
( ( ( X9 @ X12 @ X14 )
= $true )
| ( ( X9 @ X12 @ X13 )
!= $true )
| ( $true
!= ( X9 @ X13 @ X14 ) ) ) ) )
=> ( ! [X3: $i > $i > $o] :
( ? [X5: $i,X4: $i] :
( ( $true
= ( sK1 @ X4 @ X5 ) )
& ( ( X3 @ X4 @ X5 )
!= $true ) )
| ( ( X3 @ sK0 @ sK2 )
= $true )
| ? [X8: $i,X7: $i,X6: $i] :
( ( ( X3 @ X6 @ X7 )
!= $true )
& ( ( sK1 @ X8 @ X7 )
= $true )
& ( ( X3 @ X6 @ X8 )
= $true ) ) )
& ? [X9: $i > $i > $o] :
( ( $true
!= ( X9 @ sK0 @ sK2 ) )
& ! [X11: $i,X10: $i] :
( ( ( X9 @ X11 @ X10 )
= $true )
| ( $true
!= ( sK1 @ X11 @ X10 ) ) )
& ! [X12: $i,X13: $i,X14: $i] :
( ( ( X9 @ X12 @ X14 )
= $true )
| ( ( X9 @ X12 @ X13 )
!= $true )
| ( $true
!= ( X9 @ X13 @ X14 ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
! [X3: $i > $i > $o] :
( ? [X5: $i,X4: $i] :
( ( $true
= ( sK1 @ X4 @ X5 ) )
& ( ( X3 @ X4 @ X5 )
!= $true ) )
=> ( ( $true
= ( sK1 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) ) )
& ( ( X3 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f11,plain,
! [X3: $i > $i > $o] :
( ? [X8: $i,X7: $i,X6: $i] :
( ( ( X3 @ X6 @ X7 )
!= $true )
& ( ( sK1 @ X8 @ X7 )
= $true )
& ( ( X3 @ X6 @ X8 )
= $true ) )
=> ( ( ( X3 @ ( sK5 @ X3 ) @ ( sK6 @ X3 ) )
!= $true )
& ( ( sK1 @ ( sK7 @ X3 ) @ ( sK6 @ X3 ) )
= $true )
& ( ( X3 @ ( sK5 @ X3 ) @ ( sK7 @ X3 ) )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f12,plain,
( ? [X9: $i > $i > $o] :
( ( $true
!= ( X9 @ sK0 @ sK2 ) )
& ! [X11: $i,X10: $i] :
( ( ( X9 @ X11 @ X10 )
= $true )
| ( $true
!= ( sK1 @ X11 @ X10 ) ) )
& ! [X12: $i,X13: $i,X14: $i] :
( ( ( X9 @ X12 @ X14 )
= $true )
| ( ( X9 @ X12 @ X13 )
!= $true )
| ( $true
!= ( X9 @ X13 @ X14 ) ) ) )
=> ( ( $true
!= ( sK8 @ sK0 @ sK2 ) )
& ! [X11: $i,X10: $i] :
( ( $true
= ( sK8 @ X11 @ X10 ) )
| ( $true
!= ( sK1 @ X11 @ X10 ) ) )
& ! [X14: $i,X13: $i,X12: $i] :
( ( $true
= ( sK8 @ X12 @ X14 ) )
| ( ( sK8 @ X12 @ X13 )
!= $true )
| ( $true
!= ( sK8 @ X13 @ X14 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
? [X0: $i,X1: $i > $i > $o,X2: $i] :
( ! [X3: $i > $i > $o] :
( ? [X4: $i,X5: $i] :
( ( ( X1 @ X4 @ X5 )
= $true )
& ( ( X3 @ X4 @ X5 )
!= $true ) )
| ( ( X3 @ X0 @ X2 )
= $true )
| ? [X6: $i,X7: $i,X8: $i] :
( ( ( X3 @ X6 @ X7 )
!= $true )
& ( ( X1 @ X8 @ X7 )
= $true )
& ( ( X3 @ X6 @ X8 )
= $true ) ) )
& ? [X9: $i > $i > $o] :
( ( $true
!= ( X9 @ X0 @ X2 ) )
& ! [X10: $i,X11: $i] :
( ( ( X9 @ X11 @ X10 )
= $true )
| ( ( X1 @ X11 @ X10 )
!= $true ) )
& ! [X12: $i,X13: $i,X14: $i] :
( ( ( X9 @ X12 @ X14 )
= $true )
| ( ( X9 @ X12 @ X13 )
!= $true )
| ( $true
!= ( X9 @ X13 @ X14 ) ) ) ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
? [X1: $i,X0: $i > $i > $o,X2: $i] :
( ! [X3: $i > $i > $o] :
( ? [X5: $i,X4: $i] :
( ( $true
= ( X0 @ X5 @ X4 ) )
& ( ( X3 @ X5 @ X4 )
!= $true ) )
| ( ( X3 @ X1 @ X2 )
= $true )
| ? [X6: $i,X8: $i,X7: $i] :
( ( ( X3 @ X6 @ X8 )
!= $true )
& ( ( X0 @ X7 @ X8 )
= $true )
& ( ( X3 @ X6 @ X7 )
= $true ) ) )
& ? [X9: $i > $i > $o] :
( ( ( X9 @ X1 @ X2 )
!= $true )
& ! [X10: $i,X11: $i] :
( ( ( X9 @ X11 @ X10 )
= $true )
| ( ( X0 @ X11 @ X10 )
!= $true ) )
& ! [X14: $i,X12: $i,X13: $i] :
( ( $true
= ( X9 @ X14 @ X13 ) )
| ( $true
!= ( X9 @ X14 @ X12 ) )
| ( ( X9 @ X12 @ X13 )
!= $true ) ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: $i > $i > $o,X2: $i,X1: $i] :
( ? [X9: $i > $i > $o] :
( ( ( X9 @ X1 @ X2 )
!= $true )
& ! [X12: $i,X13: $i,X14: $i] :
( ( $true
= ( X9 @ X14 @ X13 ) )
| ( $true
!= ( X9 @ X14 @ X12 ) )
| ( ( X9 @ X12 @ X13 )
!= $true ) )
& ! [X10: $i,X11: $i] :
( ( ( X9 @ X11 @ X10 )
= $true )
| ( ( X0 @ X11 @ X10 )
!= $true ) ) )
& ! [X3: $i > $i > $o] :
( ( ( X3 @ X1 @ X2 )
= $true )
| ? [X7: $i,X6: $i,X8: $i] :
( ( ( X3 @ X6 @ X8 )
!= $true )
& ( ( X0 @ X7 @ X8 )
= $true )
& ( ( X3 @ X6 @ X7 )
= $true ) )
| ? [X5: $i,X4: $i] :
( ( $true
= ( X0 @ X5 @ X4 ) )
& ( ( X3 @ X5 @ X4 )
!= $true ) ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: $i > $i > $o,X2: $i,X1: $i] :
( ! [X3: $i > $i > $o] :
( ( ! [X7: $i,X6: $i,X8: $i] :
( ( ( ( X0 @ X7 @ X8 )
= $true )
& ( ( X3 @ X6 @ X7 )
= $true ) )
=> ( ( X3 @ X6 @ X8 )
= $true ) )
& ! [X4: $i,X5: $i] :
( ( $true
= ( X0 @ X5 @ X4 ) )
=> ( ( X3 @ X5 @ X4 )
= $true ) ) )
=> ( ( X3 @ X1 @ X2 )
= $true ) )
=> ! [X9: $i > $i > $o] :
( ( ! [X12: $i,X13: $i,X14: $i] :
( ( ( $true
= ( X9 @ X14 @ X12 ) )
& ( ( X9 @ X12 @ X13 )
= $true ) )
=> ( $true
= ( X9 @ X14 @ X13 ) ) )
& ! [X10: $i,X11: $i] :
( ( ( X0 @ X11 @ X10 )
= $true )
=> ( ( X9 @ X11 @ X10 )
= $true ) ) )
=> ( ( X9 @ X1 @ X2 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: $i > $i > $o,X1: $i,X2: $i] :
( ! [X3: $i > $i > $o] :
( ( ! [X4: $i,X5: $i] :
( ( X0 @ X5 @ X4 )
=> ( X3 @ X5 @ X4 ) )
& ! [X6: $i,X7: $i,X8: $i] :
( ( ( X0 @ X7 @ X8 )
& ( X3 @ X6 @ X7 ) )
=> ( X3 @ X6 @ X8 ) ) )
=> ( X3 @ X1 @ X2 ) )
=> ! [X9: $i > $i > $o] :
( ( ! [X10: $i,X11: $i] :
( ( X0 @ X11 @ X10 )
=> ( X9 @ X11 @ X10 ) )
& ! [X12: $i,X13: $i,X14: $i] :
( ( ( X9 @ X12 @ X13 )
& ( X9 @ X14 @ X12 ) )
=> ( X9 @ X14 @ X13 ) ) )
=> ( X9 @ X1 @ X2 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: $i > $i > $o,X1: $i,X2: $i] :
( ! [X3: $i > $i > $o] :
( ( ! [X5: $i,X4: $i] :
( ( X0 @ X4 @ X5 )
=> ( X3 @ X4 @ X5 ) )
& ! [X6: $i,X7: $i,X8: $i] :
( ( ( X0 @ X7 @ X8 )
& ( X3 @ X6 @ X7 ) )
=> ( X3 @ X6 @ X8 ) ) )
=> ( X3 @ X1 @ X2 ) )
=> ! [X3: $i > $i > $o] :
( ( ! [X5: $i,X4: $i] :
( ( X0 @ X4 @ X5 )
=> ( X3 @ X4 @ X5 ) )
& ! [X5: $i,X9: $i,X4: $i] :
( ( ( X3 @ X5 @ X9 )
& ( X3 @ X4 @ X5 ) )
=> ( X3 @ X4 @ X9 ) ) )
=> ( X3 @ X1 @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: $i > $i > $o,X1: $i,X2: $i] :
( ! [X3: $i > $i > $o] :
( ( ! [X5: $i,X4: $i] :
( ( X0 @ X4 @ X5 )
=> ( X3 @ X4 @ X5 ) )
& ! [X6: $i,X7: $i,X8: $i] :
( ( ( X0 @ X7 @ X8 )
& ( X3 @ X6 @ X7 ) )
=> ( X3 @ X6 @ X8 ) ) )
=> ( X3 @ X1 @ X2 ) )
=> ! [X3: $i > $i > $o] :
( ( ! [X5: $i,X4: $i] :
( ( X0 @ X4 @ X5 )
=> ( X3 @ X4 @ X5 ) )
& ! [X5: $i,X9: $i,X4: $i] :
( ( ( X3 @ X5 @ X9 )
& ( X3 @ X4 @ X5 ) )
=> ( X3 @ X4 @ X9 ) ) )
=> ( X3 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ygt2reKnyU/DTF2THF_2519.p',cT146A_pme) ).
thf(f132,plain,
( spl9_8
| spl9_4
| ~ spl9_5
| ~ spl9_6 ),
inference(avatar_split_clause,[status(thm)],[f121,f90,f86,f82,f129]) ).
thf(f82,definition,
( spl9_4
<=> ( $true
= ( sK8 @ sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(naming,[spl9_4])],[avatar_definition]) ).
thf(f86,definition,
( spl9_5
<=> ( $true
= ( sK8 @ ( sK5 @ sK8 ) @ ( sK7 @ sK8 ) ) ) ),
introduced(definition,[new_symbols(naming,[spl9_5])],[avatar_definition]) ).
thf(f90,definition,
( spl9_6
<=> ( ( sK1 @ ( sK7 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl9_6])],[avatar_definition]) ).
thf(f121,plain,
( ( $true
= ( sK1 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) )
| ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ~ spl9_5
| ~ spl9_6 ),
inference(trivial_inequality_removal,[status(thm)],[f118]) ).
thf(f118,plain,
( ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ( $true
= ( sK1 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) )
| ( $true != $true )
| ~ spl9_5
| ~ spl9_6 ),
inference(superposition,[status(thm)],[f22,f115]) ).
thf(f115,plain,
( ( ( sK8 @ ( sK5 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ~ spl9_5
| ~ spl9_6 ),
inference(trivial_inequality_removal,[status(thm)],[f113]) ).
thf(f113,plain,
( ( ( sK8 @ ( sK5 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ( $true != $true )
| ~ spl9_5
| ~ spl9_6 ),
inference(superposition,[status(thm)],[f98,f88]) ).
thf(f88,plain,
( ( $true
= ( sK8 @ ( sK5 @ sK8 ) @ ( sK7 @ sK8 ) ) )
| ~ spl9_5 ),
inference(avatar_component_clause,[status(thm)],[f86]) ).
thf(f98,plain,
( ! [X0: $i] :
( ( $true
!= ( sK8 @ X0 @ ( sK7 @ sK8 ) ) )
| ( ( sK8 @ X0 @ ( sK6 @ sK8 ) )
= $true ) )
| ~ spl9_6 ),
inference(trivial_inequality_removal,[status(thm)],[f97]) ).
thf(f97,plain,
( ! [X0: $i] :
( ( $true
!= ( sK8 @ X0 @ ( sK7 @ sK8 ) ) )
| ( ( sK8 @ X0 @ ( sK6 @ sK8 ) )
= $true )
| ( $true != $true ) )
| ~ spl9_6 ),
inference(superposition,[status(thm)],[f14,f96]) ).
thf(f96,plain,
( ( ( sK8 @ ( sK7 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ~ spl9_6 ),
inference(trivial_inequality_removal,[status(thm)],[f95]) ).
thf(f95,plain,
( ( ( sK8 @ ( sK7 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ( $true != $true )
| ~ spl9_6 ),
inference(superposition,[status(thm)],[f15,f92]) ).
thf(f92,plain,
( ( ( sK1 @ ( sK7 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ~ spl9_6 ),
inference(avatar_component_clause,[status(thm)],[f90]) ).
thf(f14,plain,
! [X14: $i,X12: $i,X13: $i] :
( ( $true
!= ( sK8 @ X13 @ X14 ) )
| ( $true
= ( sK8 @ X12 @ X14 ) )
| ( ( sK8 @ X12 @ X13 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f22,plain,
! [X3: $i > $i > $o] :
( ( ( X3 @ ( sK5 @ X3 ) @ ( sK6 @ X3 ) )
!= $true )
| ( ( X3 @ sK0 @ sK2 )
= $true )
| ( $true
= ( sK1 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f127,plain,
( ~ spl9_7
| spl9_4
| ~ spl9_5
| ~ spl9_6 ),
inference(avatar_split_clause,[status(thm)],[f122,f90,f86,f82,f124]) ).
thf(f122,plain,
( ( $true
!= ( sK8 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) )
| ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ~ spl9_5
| ~ spl9_6 ),
inference(trivial_inequality_removal,[status(thm)],[f119]) ).
thf(f119,plain,
( ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ( $true
!= ( sK8 @ ( sK3 @ sK8 ) @ ( sK4 @ sK8 ) ) )
| ( $true != $true )
| ~ spl9_5
| ~ spl9_6 ),
inference(superposition,[status(thm)],[f19,f115]) ).
thf(f19,plain,
! [X3: $i > $i > $o] :
( ( ( X3 @ ( sK5 @ X3 ) @ ( sK6 @ X3 ) )
!= $true )
| ( ( X3 @ sK0 @ sK2 )
= $true )
| ( ( X3 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f111,plain,
~ spl9_4,
inference(avatar_contradiction_clause,[status(thm)],[f110]) ).
thf(f110,plain,
( $false
| ~ spl9_4 ),
inference(trivial_inequality_removal,[status(thm)],[f108]) ).
thf(f108,plain,
( ( $true != $true )
| ~ spl9_4 ),
inference(superposition,[status(thm)],[f16,f84]) ).
thf(f84,plain,
( ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ~ spl9_4 ),
inference(avatar_component_clause,[status(thm)],[f82]) ).
thf(f16,plain,
( $true
!= ( sK8 @ sK0 @ sK2 ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f107,plain,
( spl9_4
| spl9_5 ),
inference(avatar_split_clause,[status(thm)],[f106,f86,f82]) ).
thf(f106,plain,
( ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ( $true
= ( sK8 @ ( sK5 @ sK8 ) @ ( sK7 @ sK8 ) ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f105]) ).
thf(f105,plain,
( ( $true
= ( sK8 @ ( sK5 @ sK8 ) @ ( sK7 @ sK8 ) ) )
| ( $true != $true )
| ( $true
= ( sK8 @ sK0 @ sK2 ) ) ),
inference(duplicate_literal_removal,[status(thm)],[f101]) ).
thf(f101,plain,
( ( $true
= ( sK8 @ ( sK5 @ sK8 ) @ ( sK7 @ sK8 ) ) )
| ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ( $true != $true )
| ( $true
= ( sK8 @ ( sK5 @ sK8 ) @ ( sK7 @ sK8 ) ) ) ),
inference(superposition,[status(thm)],[f17,f59]) ).
thf(f59,plain,
! [X0: $i > $i > $o] :
( ( $true
= ( sK8 @ ( sK3 @ X0 ) @ ( sK4 @ X0 ) ) )
| ( ( X0 @ ( sK5 @ X0 ) @ ( sK7 @ X0 ) )
= $true )
| ( ( X0 @ sK0 @ sK2 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f56]) ).
thf(f56,plain,
! [X0: $i > $i > $o] :
( ( ( X0 @ ( sK5 @ X0 ) @ ( sK7 @ X0 ) )
= $true )
| ( $true
= ( sK8 @ ( sK3 @ X0 ) @ ( sK4 @ X0 ) ) )
| ( $true != $true )
| ( ( X0 @ sK0 @ sK2 )
= $true ) ),
inference(superposition,[status(thm)],[f15,f20]) ).
thf(f20,plain,
! [X3: $i > $i > $o] :
( ( $true
= ( sK1 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) ) )
| ( ( X3 @ sK0 @ sK2 )
= $true )
| ( ( X3 @ ( sK5 @ X3 ) @ ( sK7 @ X3 ) )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f17,plain,
! [X3: $i > $i > $o] :
( ( ( X3 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) )
!= $true )
| ( ( X3 @ sK0 @ sK2 )
= $true )
| ( ( X3 @ ( sK5 @ X3 ) @ ( sK7 @ X3 ) )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f94,plain,
( spl9_4
| spl9_6 ),
inference(avatar_split_clause,[status(thm)],[f77,f90,f82]) ).
thf(f77,plain,
( ( ( sK1 @ ( sK7 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ( $true
= ( sK8 @ sK0 @ sK2 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f76]) ).
thf(f76,plain,
( ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ( ( sK1 @ ( sK7 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ( $true != $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f74]) ).
thf(f74,plain,
( ( ( sK1 @ ( sK7 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ( $true
= ( sK8 @ sK0 @ sK2 ) )
| ( ( sK1 @ ( sK7 @ sK8 ) @ ( sK6 @ sK8 ) )
= $true )
| ( $true != $true )
| ( $true
= ( sK8 @ sK0 @ sK2 ) ) ),
inference(superposition,[status(thm)],[f18,f25]) ).
thf(f25,plain,
! [X0: $i > $i > $o] :
( ( $true
= ( sK8 @ ( sK3 @ X0 ) @ ( sK4 @ X0 ) ) )
| ( ( X0 @ sK0 @ sK2 )
= $true )
| ( $true
= ( sK1 @ ( sK7 @ X0 ) @ ( sK6 @ X0 ) ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f23]) ).
thf(f23,plain,
! [X0: $i > $i > $o] :
( ( ( X0 @ sK0 @ sK2 )
= $true )
| ( $true
= ( sK8 @ ( sK3 @ X0 ) @ ( sK4 @ X0 ) ) )
| ( $true
= ( sK1 @ ( sK7 @ X0 ) @ ( sK6 @ X0 ) ) )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f15,f21]) ).
thf(f21,plain,
! [X3: $i > $i > $o] :
( ( $true
= ( sK1 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) ) )
| ( ( sK1 @ ( sK7 @ X3 ) @ ( sK6 @ X3 ) )
= $true )
| ( ( X3 @ sK0 @ sK2 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f18,plain,
! [X3: $i > $i > $o] :
( ( ( X3 @ ( sK3 @ X3 ) @ ( sK4 @ X3 ) )
!= $true )
| ( ( X3 @ sK0 @ sK2 )
= $true )
| ( ( sK1 @ ( sK7 @ X3 ) @ ( sK6 @ X3 ) )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEV062^5 : TPTP v9.2.1. Released v4.0.0.
% 0.10/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Feb 24 12:39:48 EST 2026
% 0.12/0.33 % CPUTime :
% 0.12/0.33 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.43 ---- Original DTF file ---
% 0.16/0.44 thf(spec,logic,$$dhol).
% 0.16/0.44 %------------------------------------------------------------------------------
% 0.16/0.44 % File : SEV062^5 : TPTP v9.2.1. Released v4.0.0.
% 0.16/0.44 % Domain : Set Theory (Relations)
% 0.16/0.44 % Problem : TPS problem T146A
% 0.16/0.44 % Version : Especial.
% 0.16/0.44 % English :
% 0.16/0.44
% 0.16/0.44 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.16/0.44 % Source : [Bro09]
% 0.16/0.44 % Names : tps_0338 [Bro09]
% 0.16/0.44 % : T146A [TPS]
% 0.16/0.44
% 0.16/0.44 % Status : Theorem
% 0.16/0.44 % Rating : 0.00 v8.1.0, 0.08 v7.4.0, 0.00 v7.3.0, 0.10 v7.2.0, 0.00 v6.2.0, 0.17 v6.0.0, 0.00 v5.1.0, 0.25 v5.0.0, 0.00 v4.0.1, 0.33 v4.0.0
% 0.16/0.44 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.16/0.44 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.16/0.44 % Maximal formula atoms : 0 ( 0 avg)
% 0.16/0.44 % Number of connectives : 35 ( 0 ~; 0 |; 4 &; 24 @)
% 0.16/0.44 % ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% 0.16/0.44 % Maximal formula depth : 15 ( 15 avg)
% 0.16/0.44 % Number of types : 2 ( 0 usr)
% 0.16/0.44 % Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% 0.16/0.44 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.16/0.44 % Number of variables : 15 ( 0 ^; 15 !; 0 ?; 15 :)
% 0.16/0.44 % SPC : TH0_THM_NEQ_NAR
% 0.16/0.44
% 0.16/0.44 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.16/0.44 % project in the Department of Mathematical Sciences at Carnegie
% 0.16/0.44 % Mellon University. Distributed under the Creative Commons copyleft
% 0.16/0.44 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.16/0.44 % : Polymorphic definitions expanded.
% 0.16/0.44 %------------------------------------------------------------------------------
% 0.16/0.44 thf(cT146A_pme,conjecture,
% 0.16/0.44 ! [Xr: $i > $i > $o,Xx: $i,Xy: $i] :
% 0.16/0.44 ( ! [Xp: $i > $i > $o] :
% 0.16/0.44 ( ( ! [Xx0: $i,Xy0: $i] :
% 0.16/0.44 ( ( Xr @ Xx0 @ Xy0 )
% 0.16/0.44 => ( Xp @ Xx0 @ Xy0 ) )
% 0.16/0.44 & ! [Xu: $i,Xv: $i,Xw: $i] :
% 0.16/0.44 ( ( ( Xp @ Xu @ Xv )
% 0.16/0.44 & ( Xr @ Xv @ Xw ) )
% 0.16/0.44 => ( Xp @ Xu @ Xw ) ) )
% 0.16/0.44 => ( Xp @ Xx @ Xy ) )
% 0.16/0.44 => ! [Xp: $i > $i > $o] :
% 0.16/0.44 ( ( ! [Xx0: $i,Xy0: $i] :
% 0.16/0.44 ( ( Xr @ Xx0 @ Xy0 )
% 0.16/0.44 => ( Xp @ Xx0 @ Xy0 ) )
% 0.16/0.44 & ! [Xx0: $i,Xy0: $i,Xz: $i] :
% 0.16/0.44 ( ( ( Xp @ Xx0 @ Xy0 )
% 0.16/0.44 & ( Xp @ Xy0 @ Xz ) )
% 0.16/0.44 => ( Xp @ Xx0 @ Xz ) ) )
% 0.16/0.44 => ( Xp @ Xx @ Xy ) ) ) ).
% 0.16/0.44
% 0.16/0.44 %------------------------------------------------------------------------------
% 0.16/0.44 ------------------------
% 1.24/1.19 ---- Embedded in THF ---
% 1.24/1.19 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.24/1.19 %%% Generated on Tue Feb 24 12:39:49 EST 2026
% 1.24/1.19 %%% using '$$dhol' embedding, version 1.3.0.
% 1.24/1.19 %%% Logic specification used:
% 1.24/1.19 %%% thf(spec, logic, $$dhol).
% 1.24/1.19
% 1.24/1.19 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.ygt2reKnyU/DTF2DTF2519.p
% See solution above
% 1.24/1.19 ------------------------
% 1.40/1.20 ---- Cleaned THF ---
% 1.40/1.20 thf(cT146A_pme,conjecture,
% 1.40/1.20 ! [Xr: $i > $i > $o,Xx: $i,Xy: $i] :
% 1.40/1.20 ( ! [Xp: $i > $i > $o] :
% 1.40/1.20 ( ( ! [Xx0: $i,Xy0: $i] :
% 1.40/1.20 ( ( Xr @ Xx0 @ Xy0 )
% 1.40/1.20 => ( Xp @ Xx0 @ Xy0 ) )
% 1.40/1.20 & ! [Xu: $i,Xv: $i,Xw: $i] :
% 1.40/1.20 ( ( ( Xp @ Xu @ Xv )
% 1.40/1.20 & ( Xr @ Xv @ Xw ) )
% 1.40/1.20 => ( Xp @ Xu @ Xw ) ) )
% 1.40/1.20 => ( Xp @ Xx @ Xy ) )
% 1.40/1.20 => ! [Xp: $i > $i > $o] :
% 1.40/1.20 ( ( ! [Xx0: $i,Xy0: $i] :
% 1.40/1.20 ( ( Xr @ Xx0 @ Xy0 )
% 1.40/1.20 => ( Xp @ Xx0 @ Xy0 ) )
% 1.40/1.20 & ! [Xx0: $i,Xy0: $i,Xz: $i] :
% 1.40/1.20 ( ( ( Xp @ Xx0 @ Xy0 )
% 1.40/1.20 & ( Xp @ Xy0 @ Xz ) )
% 1.40/1.20 => ( Xp @ Xx0 @ Xz ) ) )
% 1.40/1.20 => ( Xp @ Xx @ Xy ) ) ) ).
% 1.40/1.20 ------------------------
% 1.40/1.21 % (2618)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_2519 for (3000ds/183Mi)
% 1.40/1.22 % (2621)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_2519 for (3000ds/2Mi)
% 1.40/1.22 % (2622)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_2519 for (3000ds/2Mi)
% 1.40/1.22 % (2624)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_2519 for (3000ds/18Mi)
% 1.40/1.22 % (2619)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_2519 for (3000ds/4Mi)
% 1.40/1.22 % (2620)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_2519 for (3000ds/27Mi)
% 1.40/1.22 % (2623)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_2519 for (3000ds/275Mi)
% 1.40/1.22 % (2621)Instruction limit reached!
% 1.40/1.22 % (2621)------------------------------
% 1.40/1.22 % (2621)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.40/1.22 % (2621)Termination reason: Unknown
% 1.40/1.22 % (2622)Instruction limit reached!
% 1.40/1.22 % (2622)------------------------------
% 1.40/1.22 % (2622)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.40/1.22 % (2621)Termination phase: Preprocessing 3
% 1.40/1.22
% 1.40/1.22 % (2621)Memory used [KB]: 895
% 1.40/1.22 % (2621)Time elapsed: 0.002 s
% 1.40/1.22 % (2621)Instructions burned: 2 (million)
% 1.40/1.22 % (2621)------------------------------
% 1.40/1.22 % (2621)------------------------------
% 1.40/1.22 % (2622)Termination reason: Unknown
% 1.40/1.22 % (2622)Termination phase: Property scanning
% 1.40/1.22
% 1.40/1.22 % (2622)Memory used [KB]: 895
% 1.40/1.22 % (2622)Time elapsed: 0.002 s
% 1.40/1.22 % (2622)Instructions burned: 2 (million)
% 1.40/1.22 % (2622)------------------------------
% 1.40/1.22 % (2622)------------------------------
% 1.40/1.22 % (2619)Instruction limit reached!
% 1.40/1.22 % (2619)------------------------------
% 1.40/1.22 % (2619)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.40/1.22 % (2619)Termination reason: Unknown
% 1.40/1.22 % (2619)Termination phase: Saturation
% 1.40/1.22
% 1.40/1.22 % (2619)Memory used [KB]: 5500
% 1.40/1.22 % (2619)Time elapsed: 0.004 s
% 1.40/1.22 % (2619)Instructions burned: 4 (million)
% 1.40/1.22 % (2619)------------------------------
% 1.40/1.22 % (2619)------------------------------
% 1.40/1.22 % (2624)Instruction limit reached!
% 1.40/1.22 % (2624)------------------------------
% 1.40/1.22 % (2624)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.40/1.22 % (2624)Termination reason: Unknown
% 1.40/1.22 % (2624)Termination phase: Saturation
% 1.40/1.22
% 1.40/1.22 % (2624)Memory used [KB]: 5628
% 1.40/1.22 % (2624)Time elapsed: 0.010 s
% 1.40/1.22 % (2624)Instructions burned: 18 (million)
% 1.40/1.22 % (2624)------------------------------
% 1.40/1.22 % (2624)------------------------------
% 1.40/1.23 % (2620)First to succeed.
% 1.40/1.23 % (2626)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_2519 for (2999ds/37Mi)
% 1.40/1.23 % (2620)Refutation found. Thanks to Tanya!
% 1.40/1.23 % SZS status Theorem for DTF2THF_2519
% 1.40/1.23 % SZS output start Proof for DTF2THF_2519
% 1.40/1.23 thf(func_def_1, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.40/1.23 thf(func_def_5, type, sK1: $i > $i > $o).
% 1.40/1.23 thf(func_def_7, type, sK3: ($i > $i > $o) > $i).
% 1.40/1.23 thf(func_def_8, type, sK4: ($i > $i > $o) > $i).
% 1.40/1.23 thf(func_def_9, type, sK5: ($i > $i > $o) > $i).
% 1.40/1.23 thf(func_def_10, type, sK6: ($i > $i > $o) > $i).
% 1.40/1.23 thf(func_def_11, type, sK7: ($i > $i > $o) > $i).
% 1.40/1.23 thf(func_def_12, type, sK8: $i > $i > $o).
% 1.40/1.23 thf(func_def_14, type, ph10: !>[X0: $tType]:(X0)).
% 1.40/1.23 thf(f140,plain,(
% 1.40/1.23 $false),
% 1.40/1.23 inference(avatar_sat_refutation,[status(thm)],[f94,f107,f111,f127,f132,f139])).
% 1.40/1.23 thf(f139,plain,(
% 1.40/1.23 spl9_7 | ~spl9_8),
% 1.40/1.23 inference(avatar_split_clause,[status(thm)],[f138,f129,f124])).
% 1.40/1.23 thf(f124,definition,(
% 1.40/1.23 spl9_7 <=> ($true = (sK8 @ (sK3 @ sK8) @ (sK4 @ sK8)))),
% 1.40/1.23 introduced(definition,[new_symbols(naming,[spl9_7])],[avatar_definition])).
% 1.40/1.23 thf(f129,definition,(
% 1.40/1.23 spl9_8 <=> ($true = (sK1 @ (sK3 @ sK8) @ (sK4 @ sK8)))),
% 1.40/1.23 introduced(definition,[new_symbols(naming,[spl9_8])],[avatar_definition])).
% 1.40/1.23 thf(f138,plain,(
% 1.40/1.23 ($true = (sK8 @ (sK3 @ sK8) @ (sK4 @ sK8))) | ~spl9_8),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f137])).
% 1.40/1.23 thf(f137,plain,(
% 1.40/1.23 ($true = (sK8 @ (sK3 @ sK8) @ (sK4 @ sK8))) | ($true != $true) | ~spl9_8),
% 1.40/1.23 inference(superposition,[status(thm)],[f15,f131])).
% 1.40/1.23 thf(f131,plain,(
% 1.40/1.23 ($true = (sK1 @ (sK3 @ sK8) @ (sK4 @ sK8))) | ~spl9_8),
% 1.40/1.23 inference(avatar_component_clause,[status(thm)],[f129])).
% 1.40/1.23 thf(f15,plain,(
% 1.40/1.23 ( ! [X10 : $i,X11 : $i] : (($true != (sK1 @ X11 @ X10)) | ($true = (sK8 @ X11 @ X10))) )),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 thf(f13,plain,(
% 1.40/1.23 ! [X3 : $i > $i > $o] : ((($true = (sK1 @ (sK3 @ X3) @ (sK4 @ X3))) & ((X3 @ (sK3 @ X3) @ (sK4 @ X3)) != $true)) | ((X3 @ sK0 @ sK2) = $true) | (((X3 @ (sK5 @ X3) @ (sK6 @ X3)) != $true) & ((sK1 @ (sK7 @ X3) @ (sK6 @ X3)) = $true) & ((X3 @ (sK5 @ X3) @ (sK7 @ X3)) = $true))) & (($true != (sK8 @ sK0 @ sK2)) & ! [X10 : $i,X11 : $i] : (($true = (sK8 @ X11 @ X10)) | ($true != (sK1 @ X11 @ X10))) & ! [X12 : $i,X13 : $i,X14 : $i] : (($true = (sK8 @ X12 @ X14)) | ((sK8 @ X12 @ X13) != $true) | ($true != (sK8 @ X13 @ X14))))),
% 1.40/1.23 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f8,f12,f11,f10,f9])).
% 1.40/1.23 thf(f9,plain,(
% 1.40/1.23 ? [X0 : $i,X1 : $i > $i > $o,X2 : $i] : (! [X3 : $i > $i > $o] : (? [X4 : $i,X5 : $i] : (((X1 @ X4 @ X5) = $true) & ((X3 @ X4 @ X5) != $true)) | ((X3 @ X0 @ X2) = $true) | ? [X6 : $i,X7 : $i,X8 : $i] : (((X3 @ X6 @ X7) != $true) & ((X1 @ X8 @ X7) = $true) & ((X3 @ X6 @ X8) = $true))) & ? [X9 : $i > $i > $o] : (($true != (X9 @ X0 @ X2)) & ! [X10 : $i,X11 : $i] : (((X9 @ X11 @ X10) = $true) | ((X1 @ X11 @ X10) != $true)) & ! [X12 : $i,X13 : $i,X14 : $i] : (((X9 @ X12 @ X14) = $true) | ((X9 @ X12 @ X13) != $true) | ($true != (X9 @ X13 @ X14))))) => (! [X3 : $i > $i > $o] : (? [X5 : $i,X4 : $i] : (($true = (sK1 @ X4 @ X5)) & ((X3 @ X4 @ X5) != $true)) | ((X3 @ sK0 @ sK2) = $true) | ? [X8 : $i,X7 : $i,X6 : $i] : (((X3 @ X6 @ X7) != $true) & ((sK1 @ X8 @ X7) = $true) & ((X3 @ X6 @ X8) = $true))) & ? [X9 : $i > $i > $o] : (($true != (X9 @ sK0 @ sK2)) & ! [X11 : $i,X10 : $i] : (((X9 @ X11 @ X10) = $true) | ($true != (sK1 @ X11 @ X10))) & ! [X12 : $i,X13 : $i,X14 : $i] : (((X9 @ X12 @ X14) = $true) | ((X9 @ X12 @ X13) != $true) | ($true != (X9 @ X13 @ X14)))))),
% 1.40/1.23 introduced(definition,[],[choice_axiom])).
% 1.40/1.23 thf(f10,plain,(
% 1.40/1.23 ! [X3 : $i > $i > $o] : (? [X5 : $i,X4 : $i] : (($true = (sK1 @ X4 @ X5)) & ((X3 @ X4 @ X5) != $true)) => (($true = (sK1 @ (sK3 @ X3) @ (sK4 @ X3))) & ((X3 @ (sK3 @ X3) @ (sK4 @ X3)) != $true)))),
% 1.40/1.23 introduced(definition,[],[choice_axiom])).
% 1.40/1.23 thf(f11,plain,(
% 1.40/1.23 ! [X3 : $i > $i > $o] : (? [X8 : $i,X7 : $i,X6 : $i] : (((X3 @ X6 @ X7) != $true) & ((sK1 @ X8 @ X7) = $true) & ((X3 @ X6 @ X8) = $true)) => (((X3 @ (sK5 @ X3) @ (sK6 @ X3)) != $true) & ((sK1 @ (sK7 @ X3) @ (sK6 @ X3)) = $true) & ((X3 @ (sK5 @ X3) @ (sK7 @ X3)) = $true)))),
% 1.40/1.23 introduced(definition,[],[choice_axiom])).
% 1.40/1.23 thf(f12,plain,(
% 1.40/1.23 ? [X9 : $i > $i > $o] : (($true != (X9 @ sK0 @ sK2)) & ! [X11 : $i,X10 : $i] : (((X9 @ X11 @ X10) = $true) | ($true != (sK1 @ X11 @ X10))) & ! [X12 : $i,X13 : $i,X14 : $i] : (((X9 @ X12 @ X14) = $true) | ((X9 @ X12 @ X13) != $true) | ($true != (X9 @ X13 @ X14)))) => (($true != (sK8 @ sK0 @ sK2)) & ! [X11 : $i,X10 : $i] : (($true = (sK8 @ X11 @ X10)) | ($true != (sK1 @ X11 @ X10))) & ! [X14 : $i,X13 : $i,X12 : $i] : (($true = (sK8 @ X12 @ X14)) | ((sK8 @ X12 @ X13) != $true) | ($true != (sK8 @ X13 @ X14))))),
% 1.40/1.23 introduced(definition,[],[choice_axiom])).
% 1.40/1.23 thf(f8,plain,(
% 1.40/1.23 ? [X0 : $i,X1 : $i > $i > $o,X2 : $i] : (! [X3 : $i > $i > $o] : (? [X4 : $i,X5 : $i] : (((X1 @ X4 @ X5) = $true) & ((X3 @ X4 @ X5) != $true)) | ((X3 @ X0 @ X2) = $true) | ? [X6 : $i,X7 : $i,X8 : $i] : (((X3 @ X6 @ X7) != $true) & ((X1 @ X8 @ X7) = $true) & ((X3 @ X6 @ X8) = $true))) & ? [X9 : $i > $i > $o] : (($true != (X9 @ X0 @ X2)) & ! [X10 : $i,X11 : $i] : (((X9 @ X11 @ X10) = $true) | ((X1 @ X11 @ X10) != $true)) & ! [X12 : $i,X13 : $i,X14 : $i] : (((X9 @ X12 @ X14) = $true) | ((X9 @ X12 @ X13) != $true) | ($true != (X9 @ X13 @ X14)))))),
% 1.40/1.23 inference(rectify,[status(thm)],[f7])).
% 1.40/1.23 thf(f7,plain,(
% 1.40/1.23 ? [X1 : $i,X0 : $i > $i > $o,X2 : $i] : (! [X3 : $i > $i > $o] : (? [X5 : $i,X4 : $i] : (($true = (X0 @ X5 @ X4)) & ((X3 @ X5 @ X4) != $true)) | ((X3 @ X1 @ X2) = $true) | ? [X6 : $i,X8 : $i,X7 : $i] : (((X3 @ X6 @ X8) != $true) & ((X0 @ X7 @ X8) = $true) & ((X3 @ X6 @ X7) = $true))) & ? [X9 : $i > $i > $o] : (((X9 @ X1 @ X2) != $true) & ! [X10 : $i,X11 : $i] : (((X9 @ X11 @ X10) = $true) | ((X0 @ X11 @ X10) != $true)) & ! [X14 : $i,X12 : $i,X13 : $i] : (($true = (X9 @ X14 @ X13)) | ($true != (X9 @ X14 @ X12)) | ((X9 @ X12 @ X13) != $true))))),
% 1.40/1.23 inference(flattening,[status(thm)],[f6])).
% 1.40/1.23 thf(f6,plain,(
% 1.40/1.23 ? [X0 : $i > $i > $o,X2 : $i,X1 : $i] : (? [X9 : $i > $i > $o] : (((X9 @ X1 @ X2) != $true) & (! [X12 : $i,X13 : $i,X14 : $i] : (($true = (X9 @ X14 @ X13)) | (($true != (X9 @ X14 @ X12)) | ((X9 @ X12 @ X13) != $true))) & ! [X10 : $i,X11 : $i] : (((X9 @ X11 @ X10) = $true) | ((X0 @ X11 @ X10) != $true)))) & ! [X3 : $i > $i > $o] : (((X3 @ X1 @ X2) = $true) | (? [X7 : $i,X6 : $i,X8 : $i] : (((X3 @ X6 @ X8) != $true) & (((X0 @ X7 @ X8) = $true) & ((X3 @ X6 @ X7) = $true))) | ? [X5 : $i,X4 : $i] : (($true = (X0 @ X5 @ X4)) & ((X3 @ X5 @ X4) != $true)))))),
% 1.40/1.23 inference(ennf_transformation,[status(thm)],[f5])).
% 1.40/1.23 thf(f5,plain,(
% 1.40/1.23 ~! [X0 : $i > $i > $o,X2 : $i,X1 : $i] : (! [X3 : $i > $i > $o] : ((! [X7 : $i,X6 : $i,X8 : $i] : ((((X0 @ X7 @ X8) = $true) & ((X3 @ X6 @ X7) = $true)) => ((X3 @ X6 @ X8) = $true)) & ! [X4 : $i,X5 : $i] : (($true = (X0 @ X5 @ X4)) => ((X3 @ X5 @ X4) = $true))) => ((X3 @ X1 @ X2) = $true)) => ! [X9 : $i > $i > $o] : ((! [X12 : $i,X13 : $i,X14 : $i] : ((($true = (X9 @ X14 @ X12)) & ((X9 @ X12 @ X13) = $true)) => ($true = (X9 @ X14 @ X13))) & ! [X10 : $i,X11 : $i] : (((X0 @ X11 @ X10) = $true) => ((X9 @ X11 @ X10) = $true))) => ((X9 @ X1 @ X2) = $true)))),
% 1.40/1.23 inference(fool_elimination,[status(thm)],[f4])).
% 1.40/1.23 thf(f4,plain,(
% 1.40/1.23 ~! [X0 : $i > $i > $o,X1 : $i,X2 : $i] : (! [X3 : $i > $i > $o] : ((! [X4 : $i,X5 : $i] : ((X0 @ X5 @ X4) => (X3 @ X5 @ X4)) & ! [X6 : $i,X7 : $i,X8 : $i] : (((X0 @ X7 @ X8) & (X3 @ X6 @ X7)) => (X3 @ X6 @ X8))) => (X3 @ X1 @ X2)) => ! [X9 : $i > $i > $o] : ((! [X10 : $i,X11 : $i] : ((X0 @ X11 @ X10) => (X9 @ X11 @ X10)) & ! [X12 : $i,X13 : $i,X14 : $i] : (((X9 @ X12 @ X13) & (X9 @ X14 @ X12)) => (X9 @ X14 @ X13))) => (X9 @ X1 @ X2)))),
% 1.40/1.23 inference(rectify,[status(thm)],[f2])).
% 1.40/1.23 thf(f2,negated_conjecture,(
% 1.40/1.23 ~! [X0 : $i > $i > $o,X1 : $i,X2 : $i] : (! [X3 : $i > $i > $o] : ((! [X5 : $i,X4 : $i] : ((X0 @ X4 @ X5) => (X3 @ X4 @ X5)) & ! [X6 : $i,X7 : $i,X8 : $i] : (((X0 @ X7 @ X8) & (X3 @ X6 @ X7)) => (X3 @ X6 @ X8))) => (X3 @ X1 @ X2)) => ! [X3 : $i > $i > $o] : ((! [X5 : $i,X4 : $i] : ((X0 @ X4 @ X5) => (X3 @ X4 @ X5)) & ! [X5 : $i,X9 : $i,X4 : $i] : (((X3 @ X5 @ X9) & (X3 @ X4 @ X5)) => (X3 @ X4 @ X9))) => (X3 @ X1 @ X2)))),
% 1.40/1.23 inference(negated_conjecture,[status(cth)],[f1])).
% 1.40/1.23 thf(f1,conjecture,(
% 1.40/1.23 ! [X0 : $i > $i > $o,X1 : $i,X2 : $i] : (! [X3 : $i > $i > $o] : ((! [X5 : $i,X4 : $i] : ((X0 @ X4 @ X5) => (X3 @ X4 @ X5)) & ! [X6 : $i,X7 : $i,X8 : $i] : (((X0 @ X7 @ X8) & (X3 @ X6 @ X7)) => (X3 @ X6 @ X8))) => (X3 @ X1 @ X2)) => ! [X3 : $i > $i > $o] : ((! [X5 : $i,X4 : $i] : ((X0 @ X4 @ X5) => (X3 @ X4 @ X5)) & ! [X5 : $i,X9 : $i,X4 : $i] : (((X3 @ X5 @ X9) & (X3 @ X4 @ X5)) => (X3 @ X4 @ X9))) => (X3 @ X1 @ X2)))),
% 1.40/1.23 file('/export/starexec/sandbox/tmp/tmp.ygt2reKnyU/DTF2THF_2519.p',cT146A_pme)).
% 1.40/1.23 thf(f132,plain,(
% 1.40/1.23 spl9_8 | spl9_4 | ~spl9_5 | ~spl9_6),
% 1.40/1.23 inference(avatar_split_clause,[status(thm)],[f121,f90,f86,f82,f129])).
% 1.40/1.23 thf(f82,definition,(
% 1.40/1.23 spl9_4 <=> ($true = (sK8 @ sK0 @ sK2))),
% 1.40/1.23 introduced(definition,[new_symbols(naming,[spl9_4])],[avatar_definition])).
% 1.40/1.23 thf(f86,definition,(
% 1.40/1.23 spl9_5 <=> ($true = (sK8 @ (sK5 @ sK8) @ (sK7 @ sK8)))),
% 1.40/1.23 introduced(definition,[new_symbols(naming,[spl9_5])],[avatar_definition])).
% 1.40/1.23 thf(f90,definition,(
% 1.40/1.23 spl9_6 <=> ((sK1 @ (sK7 @ sK8) @ (sK6 @ sK8)) = $true)),
% 1.40/1.23 introduced(definition,[new_symbols(naming,[spl9_6])],[avatar_definition])).
% 1.40/1.23 thf(f121,plain,(
% 1.40/1.23 ($true = (sK1 @ (sK3 @ sK8) @ (sK4 @ sK8))) | ($true = (sK8 @ sK0 @ sK2)) | (~spl9_5 | ~spl9_6)),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f118])).
% 1.40/1.23 thf(f118,plain,(
% 1.40/1.23 ($true = (sK8 @ sK0 @ sK2)) | ($true = (sK1 @ (sK3 @ sK8) @ (sK4 @ sK8))) | ($true != $true) | (~spl9_5 | ~spl9_6)),
% 1.40/1.23 inference(superposition,[status(thm)],[f22,f115])).
% 1.40/1.23 thf(f115,plain,(
% 1.40/1.23 ((sK8 @ (sK5 @ sK8) @ (sK6 @ sK8)) = $true) | (~spl9_5 | ~spl9_6)),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f113])).
% 1.40/1.23 thf(f113,plain,(
% 1.40/1.23 ((sK8 @ (sK5 @ sK8) @ (sK6 @ sK8)) = $true) | ($true != $true) | (~spl9_5 | ~spl9_6)),
% 1.40/1.23 inference(superposition,[status(thm)],[f98,f88])).
% 1.40/1.23 thf(f88,plain,(
% 1.40/1.23 ($true = (sK8 @ (sK5 @ sK8) @ (sK7 @ sK8))) | ~spl9_5),
% 1.40/1.23 inference(avatar_component_clause,[status(thm)],[f86])).
% 1.40/1.23 thf(f98,plain,(
% 1.40/1.23 ( ! [X0 : $i] : (($true != (sK8 @ X0 @ (sK7 @ sK8))) | ((sK8 @ X0 @ (sK6 @ sK8)) = $true)) ) | ~spl9_6),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f97])).
% 1.40/1.23 thf(f97,plain,(
% 1.40/1.23 ( ! [X0 : $i] : (($true != (sK8 @ X0 @ (sK7 @ sK8))) | ((sK8 @ X0 @ (sK6 @ sK8)) = $true) | ($true != $true)) ) | ~spl9_6),
% 1.40/1.23 inference(superposition,[status(thm)],[f14,f96])).
% 1.40/1.23 thf(f96,plain,(
% 1.40/1.23 ((sK8 @ (sK7 @ sK8) @ (sK6 @ sK8)) = $true) | ~spl9_6),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f95])).
% 1.40/1.23 thf(f95,plain,(
% 1.40/1.23 ((sK8 @ (sK7 @ sK8) @ (sK6 @ sK8)) = $true) | ($true != $true) | ~spl9_6),
% 1.40/1.23 inference(superposition,[status(thm)],[f15,f92])).
% 1.40/1.23 thf(f92,plain,(
% 1.40/1.23 ((sK1 @ (sK7 @ sK8) @ (sK6 @ sK8)) = $true) | ~spl9_6),
% 1.40/1.23 inference(avatar_component_clause,[status(thm)],[f90])).
% 1.40/1.23 thf(f14,plain,(
% 1.40/1.23 ( ! [X14 : $i,X12 : $i,X13 : $i] : (($true != (sK8 @ X13 @ X14)) | ($true = (sK8 @ X12 @ X14)) | ((sK8 @ X12 @ X13) != $true)) )),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 thf(f22,plain,(
% 1.40/1.23 ( ! [X3 : $i > $i > $o] : (((X3 @ (sK5 @ X3) @ (sK6 @ X3)) != $true) | ((X3 @ sK0 @ sK2) = $true) | ($true = (sK1 @ (sK3 @ X3) @ (sK4 @ X3)))) )),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 thf(f127,plain,(
% 1.40/1.23 ~spl9_7 | spl9_4 | ~spl9_5 | ~spl9_6),
% 1.40/1.23 inference(avatar_split_clause,[status(thm)],[f122,f90,f86,f82,f124])).
% 1.40/1.23 thf(f122,plain,(
% 1.40/1.23 ($true != (sK8 @ (sK3 @ sK8) @ (sK4 @ sK8))) | ($true = (sK8 @ sK0 @ sK2)) | (~spl9_5 | ~spl9_6)),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f119])).
% 1.40/1.23 thf(f119,plain,(
% 1.40/1.23 ($true = (sK8 @ sK0 @ sK2)) | ($true != (sK8 @ (sK3 @ sK8) @ (sK4 @ sK8))) | ($true != $true) | (~spl9_5 | ~spl9_6)),
% 1.40/1.23 inference(superposition,[status(thm)],[f19,f115])).
% 1.40/1.23 thf(f19,plain,(
% 1.40/1.23 ( ! [X3 : $i > $i > $o] : (((X3 @ (sK5 @ X3) @ (sK6 @ X3)) != $true) | ((X3 @ sK0 @ sK2) = $true) | ((X3 @ (sK3 @ X3) @ (sK4 @ X3)) != $true)) )),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 thf(f111,plain,(
% 1.40/1.23 ~spl9_4),
% 1.40/1.23 inference(avatar_contradiction_clause,[status(thm)],[f110])).
% 1.40/1.23 thf(f110,plain,(
% 1.40/1.23 $false | ~spl9_4),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f108])).
% 1.40/1.23 thf(f108,plain,(
% 1.40/1.23 ($true != $true) | ~spl9_4),
% 1.40/1.23 inference(superposition,[status(thm)],[f16,f84])).
% 1.40/1.23 thf(f84,plain,(
% 1.40/1.23 ($true = (sK8 @ sK0 @ sK2)) | ~spl9_4),
% 1.40/1.23 inference(avatar_component_clause,[status(thm)],[f82])).
% 1.40/1.23 thf(f16,plain,(
% 1.40/1.23 ($true != (sK8 @ sK0 @ sK2))),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 thf(f107,plain,(
% 1.40/1.23 spl9_4 | spl9_5),
% 1.40/1.23 inference(avatar_split_clause,[status(thm)],[f106,f86,f82])).
% 1.40/1.23 thf(f106,plain,(
% 1.40/1.23 ($true = (sK8 @ sK0 @ sK2)) | ($true = (sK8 @ (sK5 @ sK8) @ (sK7 @ sK8)))),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f105])).
% 1.40/1.23 thf(f105,plain,(
% 1.40/1.23 ($true = (sK8 @ (sK5 @ sK8) @ (sK7 @ sK8))) | ($true != $true) | ($true = (sK8 @ sK0 @ sK2))),
% 1.40/1.23 inference(duplicate_literal_removal,[status(thm)],[f101])).
% 1.40/1.23 thf(f101,plain,(
% 1.40/1.23 ($true = (sK8 @ (sK5 @ sK8) @ (sK7 @ sK8))) | ($true = (sK8 @ sK0 @ sK2)) | ($true = (sK8 @ sK0 @ sK2)) | ($true != $true) | ($true = (sK8 @ (sK5 @ sK8) @ (sK7 @ sK8)))),
% 1.40/1.23 inference(superposition,[status(thm)],[f17,f59])).
% 1.40/1.23 thf(f59,plain,(
% 1.40/1.23 ( ! [X0 : $i > $i > $o] : (($true = (sK8 @ (sK3 @ X0) @ (sK4 @ X0))) | ((X0 @ (sK5 @ X0) @ (sK7 @ X0)) = $true) | ((X0 @ sK0 @ sK2) = $true)) )),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f56])).
% 1.40/1.23 thf(f56,plain,(
% 1.40/1.23 ( ! [X0 : $i > $i > $o] : (((X0 @ (sK5 @ X0) @ (sK7 @ X0)) = $true) | ($true = (sK8 @ (sK3 @ X0) @ (sK4 @ X0))) | ($true != $true) | ((X0 @ sK0 @ sK2) = $true)) )),
% 1.40/1.23 inference(superposition,[status(thm)],[f15,f20])).
% 1.40/1.23 thf(f20,plain,(
% 1.40/1.23 ( ! [X3 : $i > $i > $o] : (($true = (sK1 @ (sK3 @ X3) @ (sK4 @ X3))) | ((X3 @ sK0 @ sK2) = $true) | ((X3 @ (sK5 @ X3) @ (sK7 @ X3)) = $true)) )),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 thf(f17,plain,(
% 1.40/1.23 ( ! [X3 : $i > $i > $o] : (((X3 @ (sK3 @ X3) @ (sK4 @ X3)) != $true) | ((X3 @ sK0 @ sK2) = $true) | ((X3 @ (sK5 @ X3) @ (sK7 @ X3)) = $true)) )),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 thf(f94,plain,(
% 1.40/1.23 spl9_4 | spl9_6),
% 1.40/1.23 inference(avatar_split_clause,[status(thm)],[f77,f90,f82])).
% 1.40/1.23 thf(f77,plain,(
% 1.40/1.23 ((sK1 @ (sK7 @ sK8) @ (sK6 @ sK8)) = $true) | ($true = (sK8 @ sK0 @ sK2))),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f76])).
% 1.40/1.23 thf(f76,plain,(
% 1.40/1.23 ($true = (sK8 @ sK0 @ sK2)) | ((sK1 @ (sK7 @ sK8) @ (sK6 @ sK8)) = $true) | ($true != $true)),
% 1.40/1.23 inference(duplicate_literal_removal,[status(thm)],[f74])).
% 1.40/1.23 thf(f74,plain,(
% 1.40/1.23 ((sK1 @ (sK7 @ sK8) @ (sK6 @ sK8)) = $true) | ($true = (sK8 @ sK0 @ sK2)) | ((sK1 @ (sK7 @ sK8) @ (sK6 @ sK8)) = $true) | ($true != $true) | ($true = (sK8 @ sK0 @ sK2))),
% 1.40/1.23 inference(superposition,[status(thm)],[f18,f25])).
% 1.40/1.23 thf(f25,plain,(
% 1.40/1.23 ( ! [X0 : $i > $i > $o] : (($true = (sK8 @ (sK3 @ X0) @ (sK4 @ X0))) | ((X0 @ sK0 @ sK2) = $true) | ($true = (sK1 @ (sK7 @ X0) @ (sK6 @ X0)))) )),
% 1.40/1.23 inference(trivial_inequality_removal,[status(thm)],[f23])).
% 1.40/1.23 thf(f23,plain,(
% 1.40/1.23 ( ! [X0 : $i > $i > $o] : (((X0 @ sK0 @ sK2) = $true) | ($true = (sK8 @ (sK3 @ X0) @ (sK4 @ X0))) | ($true = (sK1 @ (sK7 @ X0) @ (sK6 @ X0))) | ($true != $true)) )),
% 1.40/1.23 inference(superposition,[status(thm)],[f15,f21])).
% 1.40/1.23 thf(f21,plain,(
% 1.40/1.23 ( ! [X3 : $i > $i > $o] : (($true = (sK1 @ (sK3 @ X3) @ (sK4 @ X3))) | ((sK1 @ (sK7 @ X3) @ (sK6 @ X3)) = $true) | ((X3 @ sK0 @ sK2) = $true)) )),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 thf(f18,plain,(
% 1.40/1.23 ( ! [X3 : $i > $i > $o] : (((X3 @ (sK3 @ X3) @ (sK4 @ X3)) != $true) | ((X3 @ sK0 @ sK2) = $true) | ((sK1 @ (sK7 @ X3) @ (sK6 @ X3)) = $true)) )),
% 1.40/1.23 inference(cnf_transformation,[status(thm)],[f13])).
% 1.40/1.23 % SZS output end Proof for DTF2THF_2519
% 1.40/1.23 % (2620)------------------------------
% 1.40/1.23 % (2620)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.40/1.23 % (2620)Termination reason: Refutation
% 1.40/1.23
% 1.40/1.23 % (2620)Memory used [KB]: 5628
% 1.40/1.23 % (2620)Time elapsed: 0.016 s
% 1.40/1.23 % (2620)Instructions burned: 21 (million)
% 1.40/1.23 % (2620)------------------------------
% 1.40/1.23 % (2620)------------------------------
% 1.40/1.23 % (2617)Success in time 0.03 s
%------------------------------------------------------------------------------