%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM656^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 : n005.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:07 AM UTC 2026
% Result : Theorem 1.56s 1.31s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 147 ( 54 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 205 ( 67 ~; 19 |; 4 &; 88 @)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 17 ( 0 ^; 17 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
more: nat > nat > $o ).
thf(func_def_5,type,
less: nat > nat > $o ).
thf(f47,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f39,f43,f46]) ).
thf(f46,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[status(thm)],[f45]) ).
thf(f45,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[status(thm)],[f44,f29]) ).
thf(f29,plain,
! [X1: nat] :
( $true
!= ( more @ X1 @ X1 ) ),
inference(equality_resolution,[status(thm)],[f24]) ).
thf(f24,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( more @ X1 @ X0 ) )
| ( X0 != X1 ) ),
inference(cnf_transformation,[status(thm)],[f21]) ).
thf(f21,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ( $true
!= ( less @ X1 @ X0 ) ) )
& ( ( $true
!= ( more @ X1 @ X0 ) )
| ( X0 != X1 ) )
& ( ( $true
!= ( less @ X1 @ X0 ) )
| ( $true
!= ( more @ X1 @ X0 ) ) ) ),
inference(flattening,[status(thm)],[f20]) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ( $true
!= ( less @ X1 @ X0 ) ) )
& ( ( $true
!= ( less @ X1 @ X0 ) )
| ( $true
!= ( more @ X1 @ X0 ) ) )
& ( ( $true
!= ( more @ X1 @ X0 ) )
| ( X0 != X1 ) ) ),
inference(ennf_transformation,[status(thm)],[f17]) ).
thf(f17,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( $true
!= ( more @ X1 @ X0 ) ) )
=> ( ( ( $true
= ( more @ X1 @ X0 ) )
=> ( $true
!= ( less @ X1 @ X0 ) ) )
=> ~ ( ( $true
= ( less @ X1 @ X0 ) )
=> ( X0 != X1 ) ) ) ),
inference(flattening,[status(thm)],[f12]) ).
thf(f12,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( $true
!= ( more @ X1 @ X0 ) ) )
=> ~ ~ ( ( ( $true
= ( more @ X1 @ X0 ) )
=> ( $true
!= ( less @ X1 @ X0 ) ) )
=> ~ ( ( $true
= ( less @ X1 @ X0 ) )
=> ( X0 != X1 ) ) ) ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ~ ( more @ X1 @ X0 ) )
=> ~ ~ ( ( ( more @ X1 @ X0 )
=> ~ ( less @ X1 @ X0 ) )
=> ~ ( ( less @ X1 @ X0 )
=> ( X0 != X1 ) ) ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X2: nat,X1: nat] :
~ ( ( ( X1 = X2 )
=> ~ ( more @ X1 @ X2 ) )
=> ~ ~ ( ( ( more @ X1 @ X2 )
=> ~ ( less @ X1 @ X2 ) )
=> ~ ( ( less @ X1 @ X2 )
=> ( X1 != X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.IO29Hb4SJi/DTF2THF_10283.p',satz10b) ).
thf(f44,plain,
( ( ( more @ x @ x )
= $true )
| ~ spl0_1 ),
inference(superposition,[status(thm)],[f27,f34]) ).
thf(f34,plain,
( ( x = y )
| ~ spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f32]) ).
thf(f32,definition,
( spl0_1
<=> ( x = y ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f27,plain,
( ( more @ x @ y )
= $true ),
inference(cnf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
( ( more @ x @ y )
= $true ),
inference(fool_elimination,[status(thm)],[f13]) ).
thf(f13,plain,
more @ x @ y,
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
more @ x @ y,
file('/export/starexec/sandbox/tmp/tmp.IO29Hb4SJi/DTF2THF_10283.p',m) ).
thf(f43,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[status(thm)],[f42]) ).
thf(f42,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[status(thm)],[f41,f27]) ).
thf(f41,plain,
( ( ( more @ x @ y )
!= $true )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f40]) ).
thf(f40,plain,
( ( $true != $true )
| ( ( more @ x @ y )
!= $true )
| ~ spl0_2 ),
inference(superposition,[status(thm)],[f23,f38]) ).
thf(f38,plain,
( ( ( less @ x @ y )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f36]) ).
thf(f36,definition,
( spl0_2
<=> ( ( less @ x @ y )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f23,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( less @ X1 @ X0 ) )
| ( $true
!= ( more @ X1 @ X0 ) ) ),
inference(cnf_transformation,[status(thm)],[f21]) ).
thf(f39,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[status(thm)],[f22,f36,f32]) ).
thf(f22,plain,
( ( ( less @ x @ y )
= $true )
| ( x = y ) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
thf(f18,plain,
( ( x = y )
| ( ( less @ x @ y )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ( less @ x @ y )
!= $true )
=> ( x = y ) ),
inference(flattening,[status(thm)],[f10]) ).
thf(f10,plain,
~ ~ ( ( ( less @ x @ y )
!= $true )
=> ( x = y ) ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
~ ~ ( ~ ( less @ x @ y )
=> ( x = y ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ~ ( ~ ( less @ x @ y )
=> ( x = y ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
~ ( ~ ( less @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox/tmp/tmp.IO29Hb4SJi/DTF2THF_10283.p',satz10g) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM656^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.16/0.34 % Computer : n005.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 11:09:29 EST 2026
% 0.19/0.35 % CPUTime :
% 0.19/0.35 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.30/0.50 ---- Original DTF file ---
% 0.30/0.50 thf(spec,logic,$$dhol).
% 0.30/0.50 %------------------------------------------------------------------------------
% 0.30/0.50 % File : NUM656^1 : TPTP v9.2.1. Released v3.7.0.
% 0.30/0.50 % Domain : Number Theory
% 0.30/0.50 % Problem : Landau theorem 10g
% 0.30/0.50 % Version : Especial.
% 0.30/0.50 % English : ~(~(less x y) -> x = y)
% 0.30/0.50
% 0.30/0.50 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.30/0.50 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.30/0.50 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.30/0.50 % Source : [Bro09]
% 0.30/0.50 % Names : satz10g [Lan30]
% 0.30/0.50
% 0.30/0.50 % Status : Theorem
% 0.30/0.50 % : Without extensionality : Theorem
% 0.30/0.50 % Rating : 0.11 v9.1.0, 0.12 v9.0.0, 0.20 v8.2.0, 0.15 v8.1.0, 0.00 v6.1.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v3.7.0
% 0.30/0.50 % Syntax : Number of formulae : 9 ( 1 unt; 5 typ; 0 def)
% 0.30/0.50 % Number of atoms : 9 ( 3 equ; 0 cnn)
% 0.30/0.50 % Maximal formula atoms : 6 ( 2 avg)
% 0.30/0.50 % Number of connectives : 30 ( 11 ~; 0 |; 0 &; 12 @)
% 0.30/0.50 % ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% 0.30/0.50 % Maximal formula depth : 12 ( 7 avg)
% 0.30/0.50 % Number of types : 2 ( 1 usr)
% 0.30/0.50 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.30/0.50 % Number of symbols : 5 ( 4 usr; 2 con; 0-2 aty)
% 0.30/0.50 % Number of variables : 3 ( 0 ^; 3 !; 0 ?; 3 :)
% 0.30/0.50 % SPC : TH0_THM_EQU_NAR
% 0.30/0.50
% 0.30/0.50 % Comments :
% 0.30/0.50 %------------------------------------------------------------------------------
% 0.30/0.50 thf(nat_type,type,
% 0.30/0.50 nat: $tType ).
% 0.30/0.50
% 0.30/0.50 thf(x,type,
% 0.30/0.50 x: nat ).
% 0.30/0.50
% 0.30/0.50 thf(y,type,
% 0.30/0.50 y: nat ).
% 0.30/0.50
% 0.30/0.50 thf(more,type,
% 0.30/0.50 more: nat > nat > $o ).
% 0.30/0.50
% 0.30/0.50 thf(m,axiom,
% 0.30/0.50 more @ x @ y ).
% 0.30/0.50
% 0.30/0.50 thf(less,type,
% 0.30/0.50 less: nat > nat > $o ).
% 0.30/0.50
% 0.30/0.50 thf(et,axiom,
% 0.30/0.50 ! [Xa: $o] :
% 0.30/0.50 ( ~ ~ Xa
% 0.30/0.50 => Xa ) ).
% 0.30/0.50
% 0.30/0.50 thf(satz10b,axiom,
% 0.30/0.50 ! [Xx: nat,Xy: nat] :
% 0.30/0.50 ~ ( ( ( Xx = Xy )
% 0.30/0.50 => ~ ( more @ Xx @ Xy ) )
% 0.30/0.50 => ~ ~ ( ( ( more @ Xx @ Xy )
% 0.30/0.50 => ~ ( less @ Xx @ Xy ) )
% 0.30/0.50 => ~ ( ( less @ Xx @ Xy )
% 0.30/0.50 => ( Xx != Xy ) ) ) ) ).
% 0.30/0.50
% 0.30/0.50 thf(satz10g,conjecture,
% 0.30/0.50 ~ ( ~ ( less @ x @ y )
% 0.30/0.50 => ( x = y ) ) ).
% 0.30/0.50
% 0.30/0.50 %------------------------------------------------------------------------------
% 0.30/0.50 ------------------------
% 1.39/1.28 ---- Embedded in THF ---
% 1.39/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.39/1.28 %%% Generated on Tue Feb 24 11:09:30 EST 2026
% 1.39/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.39/1.28 %%% Logic specification used:
% 1.39/1.28 %%% thf(spec, logic, $$dhol).
% 1.39/1.28
% 1.39/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.IO29Hb4SJi/DTF2DTF10283.p
% See solution above
% 1.39/1.28 ------------------------
% 1.39/1.29 ---- Cleaned THF ---
% 1.39/1.29 thf(nat_type,type,
% 1.39/1.29 nat: $tType ).
% 1.39/1.29
% 1.39/1.29 thf(x,type,
% 1.39/1.29 x: nat ).
% 1.39/1.29
% 1.39/1.29 thf(y,type,
% 1.39/1.29 y: nat ).
% 1.39/1.29
% 1.39/1.29 thf(more,type,
% 1.39/1.29 more: nat > nat > $o ).
% 1.39/1.29
% 1.39/1.29 thf(m,axiom,
% 1.39/1.29 more @ x @ y ).
% 1.39/1.29
% 1.39/1.29 thf(less,type,
% 1.39/1.29 less: nat > nat > $o ).
% 1.39/1.29
% 1.39/1.29 thf(et,axiom,
% 1.39/1.29 ! [Xa: $o] :
% 1.39/1.29 ( ~ ~ Xa
% 1.39/1.29 => Xa ) ).
% 1.39/1.29
% 1.39/1.29 thf(satz10b,axiom,
% 1.39/1.29 ! [Xx: nat,Xy: nat] :
% 1.39/1.29 ~ ( ( ( Xx = Xy )
% 1.39/1.29 => ~ ( more @ Xx @ Xy ) )
% 1.39/1.29 => ~ ~ ( ( ( more @ Xx @ Xy )
% 1.39/1.29 => ~ ( less @ Xx @ Xy ) )
% 1.39/1.29 => ~ ( ( less @ Xx @ Xy )
% 1.39/1.29 => ( Xx != Xy ) ) ) ) ).
% 1.39/1.29
% 1.39/1.29 thf(satz10g,conjecture,
% 1.39/1.29 ~ ( ~ ( less @ x @ y )
% 1.39/1.29 => ( x = y ) ) ).
% 1.39/1.29 ------------------------
% 1.56/1.31 % (10380)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_10283 for (2999ds/183Mi)
% 1.56/1.31 % (10380)First to succeed.
% 1.56/1.31 % (10380)Refutation found. Thanks to Tanya!
% 1.56/1.31 % SZS status Theorem for DTF2THF_10283
% 1.56/1.31 % SZS output start Proof for DTF2THF_10283
% 1.56/1.31 thf(type_def_5, type, nat: $tType).
% 1.56/1.31 thf(func_def_0, type, nat: $tType).
% 1.56/1.31 thf(func_def_1, type, x: nat).
% 1.56/1.31 thf(func_def_2, type, y: nat).
% 1.56/1.31 thf(func_def_3, type, more: nat > nat > $o).
% 1.56/1.31 thf(func_def_5, type, less: nat > nat > $o).
% 1.56/1.31 thf(f47,plain,(
% 1.56/1.31 $false),
% 1.56/1.31 inference(avatar_sat_refutation,[status(thm)],[f39,f43,f46])).
% 1.56/1.31 thf(f46,plain,(
% 1.56/1.31 ~spl0_1),
% 1.56/1.31 inference(avatar_contradiction_clause,[status(thm)],[f45])).
% 1.56/1.31 thf(f45,plain,(
% 1.56/1.31 $false | ~spl0_1),
% 1.56/1.31 inference(subsumption_resolution,[status(thm)],[f44,f29])).
% 1.56/1.31 thf(f29,plain,(
% 1.56/1.31 ( ! [X1 : nat] : (($true != (more @ X1 @ X1))) )),
% 1.56/1.31 inference(equality_resolution,[status(thm)],[f24])).
% 1.56/1.31 thf(f24,plain,(
% 1.56/1.31 ( ! [X0 : nat,X1 : nat] : (($true != (more @ X1 @ X0)) | (X0 != X1)) )),
% 1.56/1.31 inference(cnf_transformation,[status(thm)],[f21])).
% 1.56/1.31 thf(f21,plain,(
% 1.56/1.31 ! [X0 : nat,X1 : nat] : (((X0 != X1) | ($true != (less @ X1 @ X0))) & (($true != (more @ X1 @ X0)) | (X0 != X1)) & (($true != (less @ X1 @ X0)) | ($true != (more @ X1 @ X0))))),
% 1.56/1.31 inference(flattening,[status(thm)],[f20])).
% 1.56/1.31 thf(f20,plain,(
% 1.56/1.31 ! [X0 : nat,X1 : nat] : ((((X0 != X1) | ($true != (less @ X1 @ X0))) & (($true != (less @ X1 @ X0)) | ($true != (more @ X1 @ X0)))) & (($true != (more @ X1 @ X0)) | (X0 != X1)))),
% 1.56/1.31 inference(ennf_transformation,[status(thm)],[f17])).
% 1.56/1.31 thf(f17,plain,(
% 1.56/1.31 ! [X0 : nat,X1 : nat] : ~(((X0 = X1) => ($true != (more @ X1 @ X0))) => ((($true = (more @ X1 @ X0)) => ($true != (less @ X1 @ X0))) => ~(($true = (less @ X1 @ X0)) => (X0 != X1))))),
% 1.56/1.31 inference(flattening,[status(thm)],[f12])).
% 1.56/1.31 thf(f12,plain,(
% 1.56/1.31 ! [X0 : nat,X1 : nat] : ~(((X0 = X1) => ~($true = (more @ X1 @ X0))) => ~~((($true = (more @ X1 @ X0)) => ~($true = (less @ X1 @ X0))) => ~(($true = (less @ X1 @ X0)) => (X0 != X1))))),
% 1.56/1.31 inference(fool_elimination,[status(thm)],[f11])).
% 1.56/1.31 thf(f11,plain,(
% 1.56/1.31 ! [X0 : nat,X1 : nat] : ~(((X0 = X1) => ~(more @ X1 @ X0)) => ~~(((more @ X1 @ X0) => ~(less @ X1 @ X0)) => ~((less @ X1 @ X0) => (X0 != X1))))),
% 1.56/1.31 inference(rectify,[status(thm)],[f3])).
% 1.56/1.31 thf(f3,axiom,(
% 1.56/1.31 ! [X2 : nat,X1 : nat] : ~(((X1 = X2) => ~(more @ X1 @ X2)) => ~~(((more @ X1 @ X2) => ~(less @ X1 @ X2)) => ~((less @ X1 @ X2) => (X1 != X2))))),
% 1.56/1.31 file('/export/starexec/sandbox/tmp/tmp.IO29Hb4SJi/DTF2THF_10283.p',satz10b)).
% 1.56/1.31 thf(f44,plain,(
% 1.56/1.31 ((more @ x @ x) = $true) | ~spl0_1),
% 1.56/1.31 inference(superposition,[status(thm)],[f27,f34])).
% 1.56/1.31 thf(f34,plain,(
% 1.56/1.31 (x = y) | ~spl0_1),
% 1.56/1.31 inference(avatar_component_clause,[status(thm)],[f32])).
% 1.56/1.31 thf(f32,definition,(
% 1.56/1.31 spl0_1 <=> (x = y)),
% 1.56/1.31 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.56/1.31 thf(f27,plain,(
% 1.56/1.31 ((more @ x @ y) = $true)),
% 1.56/1.31 inference(cnf_transformation,[status(thm)],[f14])).
% 1.56/1.31 thf(f14,plain,(
% 1.56/1.31 ((more @ x @ y) = $true)),
% 1.56/1.31 inference(fool_elimination,[status(thm)],[f13])).
% 1.56/1.31 thf(f13,plain,(
% 1.56/1.31 (more @ x @ y)),
% 1.56/1.31 inference(rectify,[status(thm)],[f1])).
% 1.56/1.31 thf(f1,axiom,(
% 1.56/1.31 (more @ x @ y)),
% 1.56/1.31 file('/export/starexec/sandbox/tmp/tmp.IO29Hb4SJi/DTF2THF_10283.p',m)).
% 1.56/1.31 thf(f43,plain,(
% 1.56/1.31 ~spl0_2),
% 1.56/1.31 inference(avatar_contradiction_clause,[status(thm)],[f42])).
% 1.56/1.31 thf(f42,plain,(
% 1.56/1.31 $false | ~spl0_2),
% 1.56/1.31 inference(subsumption_resolution,[status(thm)],[f41,f27])).
% 1.56/1.31 thf(f41,plain,(
% 1.56/1.31 ((more @ x @ y) != $true) | ~spl0_2),
% 1.56/1.31 inference(trivial_inequality_removal,[status(thm)],[f40])).
% 1.56/1.31 thf(f40,plain,(
% 1.56/1.31 ($true != $true) | ((more @ x @ y) != $true) | ~spl0_2),
% 1.56/1.31 inference(superposition,[status(thm)],[f23,f38])).
% 1.56/1.31 thf(f38,plain,(
% 1.56/1.31 ((less @ x @ y) = $true) | ~spl0_2),
% 1.56/1.31 inference(avatar_component_clause,[status(thm)],[f36])).
% 1.56/1.31 thf(f36,definition,(
% 1.56/1.31 spl0_2 <=> ((less @ x @ y) = $true)),
% 1.56/1.31 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.56/1.31 thf(f23,plain,(
% 1.56/1.31 ( ! [X0 : nat,X1 : nat] : (($true != (less @ X1 @ X0)) | ($true != (more @ X1 @ X0))) )),
% 1.56/1.31 inference(cnf_transformation,[status(thm)],[f21])).
% 1.56/1.31 thf(f39,plain,(
% 1.56/1.31 spl0_1 | spl0_2),
% 1.56/1.31 inference(avatar_split_clause,[status(thm)],[f22,f36,f32])).
% 1.56/1.31 thf(f22,plain,(
% 1.56/1.31 ((less @ x @ y) = $true) | (x = y)),
% 1.56/1.31 inference(cnf_transformation,[status(thm)],[f18])).
% 1.56/1.31 thf(f18,plain,(
% 1.56/1.31 (x = y) | ((less @ x @ y) = $true)),
% 1.56/1.31 inference(ennf_transformation,[status(thm)],[f16])).
% 1.56/1.31 thf(f16,plain,(
% 1.56/1.31 ((less @ x @ y) != $true) => (x = y)),
% 1.56/1.31 inference(flattening,[status(thm)],[f10])).
% 1.56/1.31 thf(f10,plain,(
% 1.56/1.31 ~~(~((less @ x @ y) = $true) => (x = y))),
% 1.56/1.31 inference(fool_elimination,[status(thm)],[f9])).
% 1.56/1.31 thf(f9,plain,(
% 1.56/1.31 ~~(~(less @ x @ y) => (x = y))),
% 1.56/1.31 inference(rectify,[status(thm)],[f5])).
% 1.56/1.31 thf(f5,negated_conjecture,(
% 1.56/1.31 ~~(~(less @ x @ y) => (x = y))),
% 1.56/1.31 inference(negated_conjecture,[status(cth)],[f4])).
% 1.56/1.31 thf(f4,conjecture,(
% 1.56/1.31 ~(~(less @ x @ y) => (x = y))),
% 1.56/1.31 file('/export/starexec/sandbox/tmp/tmp.IO29Hb4SJi/DTF2THF_10283.p',satz10g)).
% 1.56/1.31 % SZS output end Proof for DTF2THF_10283
% 1.56/1.31 % (10380)------------------------------
% 1.56/1.31 % (10380)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.31 % (10380)Termination reason: Refutation
% 1.56/1.31
% 1.56/1.31 % (10380)Memory used [KB]: 5500
% 1.56/1.31 % (10380)Time elapsed: 0.003 s
% 1.56/1.31 % (10380)Instructions burned: 1 (million)
% 1.56/1.31 % (10380)------------------------------
% 1.56/1.31 % (10380)------------------------------
% 1.56/1.31 % (10379)Success in time 0.003 s
%------------------------------------------------------------------------------