%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM788^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n017.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:24:44 AM UTC 2026
% Result : Theorem 1.64s 1.32s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 7 unt; 0 typ; 2 def)
% Number of atoms : 199 ( 54 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 277 ( 76 ~; 24 |; 6 &; 144 @)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 ^; 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
rat: $tType ).
thf(func_def_0,type,
rat: $tType ).
thf(func_def_1,type,
x0: rat ).
thf(func_def_2,type,
y0: rat ).
thf(func_def_3,type,
more: rat > rat > $o ).
thf(func_def_5,type,
less: rat > rat > $o ).
thf(func_def_6,type,
is: rat > rat > $o ).
thf(f49,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f38,f42,f48]) ).
thf(f48,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[status(thm)],[f47]) ).
thf(f47,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[status(thm)],[f46,f25]) ).
thf(f25,plain,
( ( more @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( ( more @ x0 @ y0 )
= $true ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
more @ x0 @ y0,
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
more @ x0 @ y0,
file('/export/starexec/sandbox/tmp/tmp.g9HpFLH104/DTF2THF_18090.p',m) ).
thf(f46,plain,
( ( ( more @ x0 @ y0 )
!= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[status(thm)],[f43]) ).
thf(f43,plain,
( ( ( more @ x0 @ y0 )
!= $true )
| ( $true != $true )
| ~ spl0_1 ),
inference(superposition,[status(thm)],[f26,f33]) ).
thf(f33,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f31]) ).
thf(f31,definition,
( spl0_1
<=> ( ( is @ x0 @ y0 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f26,plain,
! [X0: rat,X1: rat] :
( ( ( is @ X1 @ X0 )
!= $true )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
thf(f22,plain,
! [X0: rat,X1: rat] :
( ( ( ( less @ X1 @ X0 )
!= $true )
| ( ( is @ X1 @ X0 )
!= $true ) )
& ( ( ( less @ X1 @ X0 )
!= $true )
| ( ( more @ X1 @ X0 )
!= $true ) )
& ( ( ( is @ X1 @ X0 )
!= $true )
| ( ( more @ X1 @ X0 )
!= $true ) ) ),
inference(rectify,[status(thm)],[f21]) ).
thf(f21,plain,
! [X1: rat,X0: rat] :
( ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( is @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ) ),
inference(flattening,[status(thm)],[f20]) ).
thf(f20,plain,
! [X1: rat,X0: rat] :
( ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( is @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f17]) ).
thf(f17,plain,
! [X1: rat,X0: rat] :
~ ( ( ( ( is @ X0 @ X1 )
= $true )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( ( is @ X0 @ X1 )
!= $true ) ) ) ),
inference(flattening,[status(thm)],[f14]) ).
thf(f14,plain,
! [X0: rat,X1: rat] :
~ ( ( ( ( is @ X0 @ X1 )
= $true )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ~ ~ ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( ( is @ X0 @ X1 )
!= $true ) ) ) ),
inference(fool_elimination,[status(thm)],[f13]) ).
thf(f13,plain,
! [X0: rat,X1: rat] :
~ ( ( ( is @ X0 @ X1 )
=> ~ ( more @ X0 @ X1 ) )
=> ~ ~ ( ( ( more @ X0 @ X1 )
=> ~ ( less @ X0 @ X1 ) )
=> ~ ( ( less @ X0 @ X1 )
=> ~ ( is @ X0 @ X1 ) ) ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X1: rat,X2: rat] :
~ ( ( ( is @ X1 @ X2 )
=> ~ ( more @ X1 @ X2 ) )
=> ~ ~ ( ( ( more @ X1 @ X2 )
=> ~ ( less @ X1 @ X2 ) )
=> ~ ( ( less @ X1 @ X2 )
=> ~ ( is @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.g9HpFLH104/DTF2THF_18090.p',satz81b) ).
thf(f42,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[status(thm)],[f41]) ).
thf(f41,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[status(thm)],[f40,f25]) ).
thf(f40,plain,
( ( ( more @ x0 @ y0 )
!= $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f39]) ).
thf(f39,plain,
( ( ( more @ x0 @ y0 )
!= $true )
| ( $true != $true )
| ~ spl0_2 ),
inference(superposition,[status(thm)],[f27,f37]) ).
thf(f37,plain,
( ( ( less @ x0 @ y0 )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f35]) ).
thf(f35,definition,
( spl0_2
<=> ( ( less @ x0 @ y0 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f27,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X1 @ X0 )
!= $true )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
thf(f38,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[status(thm)],[f23,f35,f31]) ).
thf(f23,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
thf(f18,plain,
( ( ( less @ x0 @ y0 )
= $true )
| ( ( is @ x0 @ y0 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
( ( ( less @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(flattening,[status(thm)],[f10]) ).
thf(f10,plain,
~ ~ ( ( ( less @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
~ ~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
~ ( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox/tmp/tmp.g9HpFLH104/DTF2THF_18090.p',satz81g) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM788^1 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n017.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 11:12:41 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.20/0.46 ---- Original DTF file ---
% 0.20/0.46 thf(spec,logic,$$dhol).
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 % File : NUM788^1 : TPTP v9.2.1. Released v3.7.0.
% 0.20/0.46 % Domain : Number Theory
% 0.20/0.46 % Problem : Landau theorem 81g
% 0.20/0.46 % Version : Especial.
% 0.20/0.46 % English : ~(~(less x0 y0) -> is x0 y0)
% 0.20/0.46
% 0.20/0.46 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.20/0.46 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.20/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.46 % Source : [Bro09]
% 0.20/0.46 % Names : satz81g [Lan30]
% 0.20/0.46 % : satz41g [Lan30]
% 0.20/0.46
% 0.20/0.46 % Status : Theorem
% 0.20/0.46 % : Without extensionality : Theorem
% 0.20/0.46 % Rating : 0.08 v9.1.0, 0.00 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v3.7.0
% 0.20/0.46 % Syntax : Number of formulae : 10 ( 1 unt; 6 typ; 0 def)
% 0.20/0.46 % Number of atoms : 9 ( 0 equ; 0 cnn)
% 0.20/0.46 % Maximal formula atoms : 6 ( 2 avg)
% 0.20/0.46 % Number of connectives : 36 ( 11 ~; 0 |; 0 &; 18 @)
% 0.20/0.46 % ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% 0.20/0.46 % Maximal formula depth : 13 ( 7 avg)
% 0.20/0.46 % Number of types : 2 ( 1 usr)
% 0.20/0.46 % Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% 0.20/0.46 % Number of symbols : 5 ( 5 usr; 2 con; 0-2 aty)
% 0.20/0.46 % Number of variables : 3 ( 0 ^; 3 !; 0 ?; 3 :)
% 0.20/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.20/0.46
% 0.20/0.46 % Comments :
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 thf(rat_type,type,
% 0.20/0.46 rat: $tType ).
% 0.20/0.46
% 0.20/0.46 thf(x0,type,
% 0.20/0.46 x0: rat ).
% 0.20/0.46
% 0.20/0.46 thf(y0,type,
% 0.20/0.46 y0: rat ).
% 0.20/0.46
% 0.20/0.46 thf(more,type,
% 0.20/0.46 more: rat > rat > $o ).
% 0.20/0.46
% 0.20/0.46 thf(m,axiom,
% 0.20/0.46 more @ x0 @ y0 ).
% 0.20/0.46
% 0.20/0.46 thf(less,type,
% 0.20/0.46 less: rat > rat > $o ).
% 0.20/0.46
% 0.20/0.46 thf(is,type,
% 0.20/0.46 is: rat > rat > $o ).
% 0.20/0.46
% 0.20/0.46 thf(et,axiom,
% 0.20/0.46 ! [Xa: $o] :
% 0.20/0.46 ( ~ ~ Xa
% 0.20/0.46 => Xa ) ).
% 0.20/0.46
% 0.20/0.46 thf(satz81b,axiom,
% 0.20/0.46 ! [Xx0: rat,Xy0: rat] :
% 0.20/0.46 ~ ( ( ( is @ Xx0 @ Xy0 )
% 0.20/0.46 => ~ ( more @ Xx0 @ Xy0 ) )
% 0.20/0.46 => ~ ~ ( ( ( more @ Xx0 @ Xy0 )
% 0.20/0.46 => ~ ( less @ Xx0 @ Xy0 ) )
% 0.20/0.46 => ~ ( ( less @ Xx0 @ Xy0 )
% 0.20/0.46 => ~ ( is @ Xx0 @ Xy0 ) ) ) ) ).
% 0.20/0.46
% 0.20/0.46 thf(satz81g,conjecture,
% 0.20/0.46 ~ ( ~ ( less @ x0 @ y0 )
% 0.20/0.46 => ( is @ x0 @ y0 ) ) ).
% 0.20/0.46
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 ------------------------
% 1.48/1.28 ---- Embedded in THF ---
% 1.48/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.28 %%% Generated on Tue Feb 24 11:12:42 EST 2026
% 1.48/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.28 %%% Logic specification used:
% 1.48/1.28 %%% thf(spec, logic, $$dhol).
% 1.48/1.28
% 1.48/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.g9HpFLH104/DTF2DTF18090.p
% See solution above
% 1.48/1.28 ------------------------
% 1.48/1.29 ---- Cleaned THF ---
% 1.48/1.29 thf(rat_type,type,
% 1.48/1.29 rat: $tType ).
% 1.48/1.29
% 1.48/1.29 thf(x0,type,
% 1.48/1.29 x0: rat ).
% 1.48/1.29
% 1.48/1.29 thf(y0,type,
% 1.48/1.29 y0: rat ).
% 1.48/1.29
% 1.48/1.29 thf(more,type,
% 1.48/1.29 more: rat > rat > $o ).
% 1.48/1.29
% 1.48/1.29 thf(m,axiom,
% 1.48/1.29 more @ x0 @ y0 ).
% 1.48/1.29
% 1.48/1.29 thf(less,type,
% 1.48/1.29 less: rat > rat > $o ).
% 1.48/1.29
% 1.48/1.29 thf(is,type,
% 1.48/1.29 is: rat > rat > $o ).
% 1.48/1.29
% 1.48/1.29 thf(et,axiom,
% 1.48/1.29 ! [Xa: $o] :
% 1.48/1.29 ( ~ ~ Xa
% 1.48/1.29 => Xa ) ).
% 1.48/1.29
% 1.48/1.29 thf(satz81b,axiom,
% 1.48/1.29 ! [Xx0: rat,Xy0: rat] :
% 1.48/1.29 ~ ( ( ( is @ Xx0 @ Xy0 )
% 1.48/1.29 => ~ ( more @ Xx0 @ Xy0 ) )
% 1.48/1.29 => ~ ~ ( ( ( more @ Xx0 @ Xy0 )
% 1.48/1.29 => ~ ( less @ Xx0 @ Xy0 ) )
% 1.48/1.29 => ~ ( ( less @ Xx0 @ Xy0 )
% 1.48/1.29 => ~ ( is @ Xx0 @ Xy0 ) ) ) ) ).
% 1.48/1.29
% 1.48/1.29 thf(satz81g,conjecture,
% 1.48/1.29 ~ ( ~ ( less @ x0 @ y0 )
% 1.48/1.29 => ( is @ x0 @ y0 ) ) ).
% 1.48/1.29 ------------------------
% 1.64/1.31 % (18285)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_18090 for (2999ds/18Mi)
% 1.64/1.31 % (18280)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_18090 for (2999ds/4Mi)
% 1.64/1.31 % (18281)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_18090 for (2999ds/27Mi)
% 1.64/1.32 % (18284)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_18090 for (2999ds/275Mi)
% 1.64/1.32 % (18282)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_18090 for (2999ds/2Mi)
% 1.64/1.32 % (18283)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_18090 for (2999ds/2Mi)
% 1.64/1.32 % (18283)Instruction limit reached!
% 1.64/1.32 % (18283)------------------------------
% 1.64/1.32 % (18283)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.32 % (18283)Termination reason: Unknown
% 1.64/1.32 % (18283)Termination phase: Property scanning
% 1.64/1.32
% 1.64/1.32 % (18283)Memory used [KB]: 895
% 1.64/1.32 % (18283)Time elapsed: 0.003 s
% 1.64/1.32 % (18283)Instructions burned: 2 (million)
% 1.64/1.32 % (18283)------------------------------
% 1.64/1.32 % (18283)------------------------------
% 1.64/1.32 % (18282)Instruction limit reached!
% 1.64/1.32 % (18282)------------------------------
% 1.64/1.32 % (18282)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.32 % (18282)Termination reason: Unknown
% 1.64/1.32 % (18282)Termination phase: Saturation
% 1.64/1.32
% 1.64/1.32 % (18282)Memory used [KB]: 5500
% 1.64/1.32 % (18282)Time elapsed: 0.003 s
% 1.64/1.32 % (18282)Instructions burned: 2 (million)
% 1.64/1.32 % (18282)------------------------------
% 1.64/1.32 % (18282)------------------------------
% 1.64/1.32 % (18284)First to succeed.
% 1.64/1.32 % (18280)Instruction limit reached!
% 1.64/1.32 % (18280)------------------------------
% 1.64/1.32 % (18280)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.32 % (18280)Termination reason: Unknown
% 1.64/1.32 % (18280)Termination phase: Saturation
% 1.64/1.32
% 1.64/1.32 % (18280)Memory used [KB]: 5500
% 1.64/1.32 % (18280)Time elapsed: 0.005 s
% 1.64/1.32 % (18280)Instructions burned: 4 (million)
% 1.64/1.32 % (18280)------------------------------
% 1.64/1.32 % (18280)------------------------------
% 1.64/1.32 % (18285)Also succeeded, but the first one will report.
% 1.64/1.32 % (18281)Also succeeded, but the first one will report.
% 1.64/1.32 % (18284)Refutation found. Thanks to Tanya!
% 1.64/1.32 % SZS status Theorem for DTF2THF_18090
% 1.64/1.32 % SZS output start Proof for DTF2THF_18090
% 1.64/1.32 thf(type_def_5, type, rat: $tType).
% 1.64/1.32 thf(func_def_0, type, rat: $tType).
% 1.64/1.32 thf(func_def_1, type, x0: rat).
% 1.64/1.32 thf(func_def_2, type, y0: rat).
% 1.64/1.32 thf(func_def_3, type, more: rat > rat > $o).
% 1.64/1.32 thf(func_def_5, type, less: rat > rat > $o).
% 1.64/1.32 thf(func_def_6, type, is: rat > rat > $o).
% 1.64/1.32 thf(f49,plain,(
% 1.64/1.32 $false),
% 1.64/1.32 inference(avatar_sat_refutation,[status(thm)],[f38,f42,f48])).
% 1.64/1.32 thf(f48,plain,(
% 1.64/1.32 ~spl0_1),
% 1.64/1.32 inference(avatar_contradiction_clause,[status(thm)],[f47])).
% 1.64/1.32 thf(f47,plain,(
% 1.64/1.32 $false | ~spl0_1),
% 1.64/1.32 inference(subsumption_resolution,[status(thm)],[f46,f25])).
% 1.64/1.32 thf(f25,plain,(
% 1.64/1.32 ((more @ x0 @ y0) = $true)),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f12])).
% 1.64/1.32 thf(f12,plain,(
% 1.64/1.32 ((more @ x0 @ y0) = $true)),
% 1.64/1.32 inference(fool_elimination,[status(thm)],[f11])).
% 1.64/1.32 thf(f11,plain,(
% 1.64/1.32 (more @ x0 @ y0)),
% 1.64/1.32 inference(rectify,[status(thm)],[f1])).
% 1.64/1.32 thf(f1,axiom,(
% 1.64/1.32 (more @ x0 @ y0)),
% 1.64/1.32 file('/export/starexec/sandbox/tmp/tmp.g9HpFLH104/DTF2THF_18090.p',m)).
% 1.64/1.32 thf(f46,plain,(
% 1.64/1.32 ((more @ x0 @ y0) != $true) | ~spl0_1),
% 1.64/1.32 inference(trivial_inequality_removal,[status(thm)],[f43])).
% 1.64/1.32 thf(f43,plain,(
% 1.64/1.32 ((more @ x0 @ y0) != $true) | ($true != $true) | ~spl0_1),
% 1.64/1.32 inference(superposition,[status(thm)],[f26,f33])).
% 1.64/1.32 thf(f33,plain,(
% 1.64/1.32 ((is @ x0 @ y0) = $true) | ~spl0_1),
% 1.64/1.32 inference(avatar_component_clause,[status(thm)],[f31])).
% 1.64/1.32 thf(f31,definition,(
% 1.64/1.32 spl0_1 <=> ((is @ x0 @ y0) = $true)),
% 1.64/1.32 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.64/1.32 thf(f26,plain,(
% 1.64/1.32 ( ! [X0 : rat,X1 : rat] : (((is @ X1 @ X0) != $true) | ((more @ X1 @ X0) != $true)) )),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f22])).
% 1.64/1.32 thf(f22,plain,(
% 1.64/1.32 ! [X0 : rat,X1 : rat] : ((((less @ X1 @ X0) != $true) | ((is @ X1 @ X0) != $true)) & (((less @ X1 @ X0) != $true) | ((more @ X1 @ X0) != $true)) & (((is @ X1 @ X0) != $true) | ((more @ X1 @ X0) != $true)))),
% 1.64/1.32 inference(rectify,[status(thm)],[f21])).
% 1.64/1.32 thf(f21,plain,(
% 1.64/1.32 ! [X1 : rat,X0 : rat] : ((((less @ X0 @ X1) != $true) | ((is @ X0 @ X1) != $true)) & (((less @ X0 @ X1) != $true) | ((more @ X0 @ X1) != $true)) & (((is @ X0 @ X1) != $true) | ((more @ X0 @ X1) != $true)))),
% 1.64/1.32 inference(flattening,[status(thm)],[f20])).
% 1.64/1.32 thf(f20,plain,(
% 1.64/1.32 ! [X1 : rat,X0 : rat] : (((((less @ X0 @ X1) != $true) | ((is @ X0 @ X1) != $true)) & (((less @ X0 @ X1) != $true) | ((more @ X0 @ X1) != $true))) & (((is @ X0 @ X1) != $true) | ((more @ X0 @ X1) != $true)))),
% 1.64/1.32 inference(ennf_transformation,[status(thm)],[f17])).
% 1.64/1.32 thf(f17,plain,(
% 1.64/1.32 ! [X1 : rat,X0 : rat] : ~((((is @ X0 @ X1) = $true) => ((more @ X0 @ X1) != $true)) => ((((more @ X0 @ X1) = $true) => ((less @ X0 @ X1) != $true)) => ~(((less @ X0 @ X1) = $true) => ((is @ X0 @ X1) != $true))))),
% 1.64/1.32 inference(flattening,[status(thm)],[f14])).
% 1.64/1.32 thf(f14,plain,(
% 1.64/1.32 ! [X0 : rat,X1 : rat] : ~((((is @ X0 @ X1) = $true) => ~((more @ X0 @ X1) = $true)) => ~~((((more @ X0 @ X1) = $true) => ~((less @ X0 @ X1) = $true)) => ~(((less @ X0 @ X1) = $true) => ~((is @ X0 @ X1) = $true))))),
% 1.64/1.32 inference(fool_elimination,[status(thm)],[f13])).
% 1.64/1.32 thf(f13,plain,(
% 1.64/1.32 ! [X0 : rat,X1 : rat] : ~(((is @ X0 @ X1) => ~(more @ X0 @ X1)) => ~~(((more @ X0 @ X1) => ~(less @ X0 @ X1)) => ~((less @ X0 @ X1) => ~(is @ X0 @ X1))))),
% 1.64/1.32 inference(rectify,[status(thm)],[f3])).
% 1.64/1.32 thf(f3,axiom,(
% 1.64/1.32 ! [X1 : rat,X2 : rat] : ~(((is @ X1 @ X2) => ~(more @ X1 @ X2)) => ~~(((more @ X1 @ X2) => ~(less @ X1 @ X2)) => ~((less @ X1 @ X2) => ~(is @ X1 @ X2))))),
% 1.64/1.32 file('/export/starexec/sandbox/tmp/tmp.g9HpFLH104/DTF2THF_18090.p',satz81b)).
% 1.64/1.32 thf(f42,plain,(
% 1.64/1.32 ~spl0_2),
% 1.64/1.32 inference(avatar_contradiction_clause,[status(thm)],[f41])).
% 1.64/1.32 thf(f41,plain,(
% 1.64/1.32 $false | ~spl0_2),
% 1.64/1.32 inference(subsumption_resolution,[status(thm)],[f40,f25])).
% 1.64/1.32 thf(f40,plain,(
% 1.64/1.32 ((more @ x0 @ y0) != $true) | ~spl0_2),
% 1.64/1.32 inference(trivial_inequality_removal,[status(thm)],[f39])).
% 1.64/1.32 thf(f39,plain,(
% 1.64/1.32 ((more @ x0 @ y0) != $true) | ($true != $true) | ~spl0_2),
% 1.64/1.32 inference(superposition,[status(thm)],[f27,f37])).
% 1.64/1.32 thf(f37,plain,(
% 1.64/1.32 ((less @ x0 @ y0) = $true) | ~spl0_2),
% 1.64/1.32 inference(avatar_component_clause,[status(thm)],[f35])).
% 1.64/1.32 thf(f35,definition,(
% 1.64/1.32 spl0_2 <=> ((less @ x0 @ y0) = $true)),
% 1.64/1.32 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.64/1.32 thf(f27,plain,(
% 1.64/1.32 ( ! [X0 : rat,X1 : rat] : (((less @ X1 @ X0) != $true) | ((more @ X1 @ X0) != $true)) )),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f22])).
% 1.64/1.32 thf(f38,plain,(
% 1.64/1.32 spl0_1 | spl0_2),
% 1.64/1.32 inference(avatar_split_clause,[status(thm)],[f23,f35,f31])).
% 1.64/1.32 thf(f23,plain,(
% 1.64/1.32 ((is @ x0 @ y0) = $true) | ((less @ x0 @ y0) = $true)),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f18])).
% 1.64/1.32 thf(f18,plain,(
% 1.64/1.32 ((less @ x0 @ y0) = $true) | ((is @ x0 @ y0) = $true)),
% 1.64/1.32 inference(ennf_transformation,[status(thm)],[f15])).
% 1.64/1.32 thf(f15,plain,(
% 1.64/1.32 ((less @ x0 @ y0) != $true) => ((is @ x0 @ y0) = $true)),
% 1.64/1.32 inference(flattening,[status(thm)],[f10])).
% 1.64/1.32 thf(f10,plain,(
% 1.64/1.32 ~~(~((less @ x0 @ y0) = $true) => ((is @ x0 @ y0) = $true))),
% 1.64/1.32 inference(fool_elimination,[status(thm)],[f9])).
% 1.64/1.32 thf(f9,plain,(
% 1.64/1.32 ~~(~(less @ x0 @ y0) => (is @ x0 @ y0))),
% 1.64/1.32 inference(rectify,[status(thm)],[f5])).
% 1.64/1.32 thf(f5,negated_conjecture,(
% 1.64/1.32 ~~(~(less @ x0 @ y0) => (is @ x0 @ y0))),
% 1.64/1.32 inference(negated_conjecture,[status(cth)],[f4])).
% 1.64/1.32 thf(f4,conjecture,(
% 1.64/1.32 ~(~(less @ x0 @ y0) => (is @ x0 @ y0))),
% 1.64/1.32 file('/export/starexec/sandbox/tmp/tmp.g9HpFLH104/DTF2THF_18090.p',satz81g)).
% 1.64/1.32 % SZS output end Proof for DTF2THF_18090
% 1.64/1.32 % (18284)------------------------------
% 1.64/1.32 % (18284)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.32 % (18284)Termination reason: Refutation
% 1.64/1.32
% 1.64/1.32 % (18284)Memory used [KB]: 5500
% 1.64/1.32 % (18284)Time elapsed: 0.004 s
% 1.64/1.32 % (18284)Instructions burned: 2 (million)
% 1.64/1.32 % (18284)------------------------------
% 1.64/1.32 % (18284)------------------------------
% 1.64/1.32 % (18278)Success in time 0.019 s
%------------------------------------------------------------------------------