%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM701^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n007.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:21 AM UTC 2026
% Result : Theorem 1.64s 1.32s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 104 ( 32 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 154 ( 6 ~; 4 |; 0 &; 128 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 6 con; 0-2 aty)
% ( 8 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 29 ( 11 ^; 18 !; 0 ?; 29 :)
% 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,
less: nat > nat > $o ).
thf(func_def_4,type,
suc: nat > nat ).
thf(func_def_6,type,
lessis: nat > nat > $o ).
thf(func_def_7,type,
pl: nat > nat > nat ).
thf(func_def_8,type,
n_1: nat ).
thf(f43,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f41]) ).
thf(f41,plain,
$false = $true,
inference(superposition,[status(thm)],[f39,f29]) ).
thf(f29,plain,
( ( lessis @ y @ x )
= $false ),
inference(trivial_inequality_removal,[status(thm)],[f28]) ).
thf(f28,plain,
( ( $true != $true )
| ( ( lessis @ y @ x )
= $false ) ),
inference(fool_paramodulation,[status(thm)],[f17]) ).
thf(f17,plain,
( ( lessis @ y @ x )
!= $true ),
inference(cnf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
( ( lessis @ y @ x )
!= $true ),
inference(flattening,[status(thm)],[f11]) ).
thf(f11,plain,
( ( lessis @ y @ x )
!= $true ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
~ ( lessis @ y @ x ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ( lessis @ y @ x ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
lessis @ y @ x,
file('/export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2THF_4080.p',satz26a) ).
thf(f39,plain,
( ( lessis @ y @ x )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f35]) ).
thf(f35,plain,
( ( ( lessis @ y @ x )
= $true )
| ( $false = $true ) ),
inference(superposition,[status(thm)],[f27,f16]) ).
thf(f16,plain,
( ( less @ y @ ( suc @ x ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( less @ y @ ( suc @ x ) )
= $true ),
inference(fool_elimination,[status(thm)],[f12]) ).
thf(f12,plain,
less @ y @ ( suc @ x ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
less @ y @ ( suc @ x ),
file('/export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2THF_4080.p',l) ).
thf(f27,plain,
! [X2: nat,X1: nat] :
( ( $false
= ( less @ X2 @ ( suc @ X1 ) ) )
| ( $true
= ( lessis @ X2 @ X1 ) ) ),
inference(backward_demodulation,[status(thm)],[f23,f26]) ).
thf(f26,plain,
! [X1: nat] :
( ( pl @ X1 @ n_1 )
= ( suc @ X1 ) ),
inference(equality_proxy_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
! [X1: nat] :
( $true
= ( ( pl @ X1 @ n_1 )
= ( suc @ X1 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f24]) ).
thf(f24,plain,
! [X1: nat] :
( $true
= ( ^ [Y0: nat] :
( ( pl @ Y0 @ n_1 )
= ( suc @ Y0 ) )
@ X1 ) ),
inference(pi_clausification,[status(thm)],[f15]) ).
thf(f15,plain,
( ( !! @ nat
@ ^ [Y0: nat] :
( ( pl @ Y0 @ n_1 )
= ( suc @ Y0 ) ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
( ( !! @ nat
@ ^ [Y0: nat] :
( ( pl @ Y0 @ n_1 )
= ( suc @ Y0 ) ) )
= $true ),
inference(fool_elimination,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2THF_4080.p',satz4e) ).
thf(f23,plain,
! [X2: nat,X1: nat] :
( ( $true
= ( lessis @ X2 @ X1 ) )
| ( $false
= ( less @ X2 @ ( pl @ X1 @ n_1 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f22]) ).
thf(f22,plain,
! [X2: nat,X1: nat] :
( ( ( less @ X2 @ ( pl @ X1 @ n_1 ) )
=> ( lessis @ X2 @ X1 ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f21]) ).
thf(f21,plain,
! [X2: nat,X1: nat] :
( $true
= ( ^ [Y0: nat] :
( ( less @ Y0 @ ( pl @ X1 @ n_1 ) )
=> ( lessis @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_clausification,[status(thm)],[f20]) ).
thf(f20,plain,
! [X1: nat] :
( $true
= ( !! @ nat
@ ^ [Y0: nat] :
( ( less @ Y0 @ ( pl @ X1 @ n_1 ) )
=> ( lessis @ Y0 @ X1 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f19]) ).
thf(f19,plain,
! [X1: nat] :
( ( ^ [Y0: nat] :
( !! @ nat
@ ^ [Y1: nat] :
( ( less @ Y1 @ ( pl @ Y0 @ n_1 ) )
=> ( lessis @ Y1 @ Y0 ) ) )
@ X1 )
= $true ),
inference(pi_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
( $true
= ( !! @ nat
@ ^ [Y0: nat] :
( !! @ nat
@ ^ [Y1: nat] :
( ( less @ Y1 @ ( pl @ Y0 @ n_1 ) )
=> ( lessis @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( $true
= ( !! @ nat
@ ^ [Y0: nat] :
( !! @ nat
@ ^ [Y1: nat] :
( ( less @ Y1 @ ( pl @ Y0 @ n_1 ) )
=> ( lessis @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f8]) ).
thf(f8,plain,
! [X0: nat,X1: nat] :
( ( less @ X0 @ ( pl @ X1 @ n_1 ) )
=> ( lessis @ X0 @ X1 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X1: nat,X0: nat] :
( ( less @ X1 @ ( pl @ X0 @ n_1 ) )
=> ( lessis @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2THF_4080.p',satz26) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM701^1 : TPTP v9.2.1. Released v3.7.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.34 % Computer : n007.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:10:53 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.46 ---- Original DTF file ---
% 0.19/0.46 thf(spec,logic,$$dhol).
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 % File : NUM701^1 : TPTP v9.2.1. Released v3.7.0.
% 0.19/0.46 % Domain : Number Theory
% 0.19/0.46 % Problem : Landau theorem 26a
% 0.19/0.46 % Version : Especial.
% 0.19/0.46 % English : lessis y x
% 0.19/0.46
% 0.19/0.46 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.19/0.46 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.19/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.19/0.46 % Source : [Bro09]
% 0.19/0.46 % Names : satz26a [Lan30]
% 0.19/0.46
% 0.19/0.46 % Status : Theorem
% 0.19/0.46 % : Without extensionality : Theorem
% 0.19/0.46 % Rating : 0.00 v7.1.0, 0.12 v7.0.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v3.7.0
% 0.19/0.46 % Syntax : Number of formulae : 12 ( 3 unt; 8 typ; 0 def)
% 0.19/0.46 % Number of atoms : 5 ( 1 equ; 0 cnn)
% 0.19/0.46 % Maximal formula atoms : 2 ( 1 avg)
% 0.19/0.46 % Number of connectives : 15 ( 0 ~; 0 |; 0 &; 14 @)
% 0.19/0.46 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.19/0.46 % Maximal formula depth : 7 ( 4 avg)
% 0.19/0.46 % Number of types : 2 ( 1 usr)
% 0.19/0.46 % Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% 0.19/0.46 % Number of symbols : 8 ( 7 usr; 3 con; 0-2 aty)
% 0.19/0.46 % Number of variables : 3 ( 0 ^; 3 !; 0 ?; 3 :)
% 0.19/0.46 % SPC : TH0_THM_EQU_NAR
% 0.19/0.46
% 0.19/0.46 % Comments :
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 thf(nat_type,type,
% 0.19/0.46 nat: $tType ).
% 0.19/0.46
% 0.19/0.46 thf(x,type,
% 0.19/0.46 x: nat ).
% 0.19/0.46
% 0.19/0.46 thf(y,type,
% 0.19/0.46 y: nat ).
% 0.19/0.46
% 0.19/0.46 thf(less,type,
% 0.19/0.46 less: nat > nat > $o ).
% 0.19/0.46
% 0.19/0.46 thf(suc,type,
% 0.19/0.46 suc: nat > nat ).
% 0.19/0.46
% 0.19/0.46 thf(l,axiom,
% 0.19/0.46 less @ y @ ( suc @ x ) ).
% 0.19/0.46
% 0.19/0.46 thf(lessis,type,
% 0.19/0.46 lessis: nat > nat > $o ).
% 0.19/0.46
% 0.19/0.46 thf(pl,type,
% 0.19/0.46 pl: nat > nat > nat ).
% 0.19/0.46
% 0.19/0.46 thf(n_1,type,
% 0.19/0.46 n_1: nat ).
% 0.19/0.46
% 0.19/0.46 thf(satz26,axiom,
% 0.19/0.46 ! [Xx: nat,Xy: nat] :
% 0.19/0.46 ( ( less @ Xy @ ( pl @ Xx @ n_1 ) )
% 0.19/0.46 => ( lessis @ Xy @ Xx ) ) ).
% 0.19/0.46
% 0.19/0.46 thf(satz4e,axiom,
% 0.19/0.46 ! [Xx: nat] :
% 0.19/0.46 ( ( suc @ Xx )
% 0.19/0.46 = ( pl @ Xx @ n_1 ) ) ).
% 0.19/0.46
% 0.19/0.46 thf(satz26a,conjecture,
% 0.19/0.46 lessis @ y @ x ).
% 0.19/0.46
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 ------------------------
% 1.45/1.29 ---- Embedded in THF ---
% 1.45/1.29 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.45/1.29 %%% Generated on Tue Feb 24 11:10:54 EST 2026
% 1.45/1.29 %%% using '$$dhol' embedding, version 1.3.0.
% 1.45/1.29 %%% Logic specification used:
% 1.45/1.29 %%% thf(spec, logic, $$dhol).
% 1.45/1.29
% 1.45/1.29 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2DTF4080.p
% See solution above
% 1.45/1.29 ------------------------
% 1.64/1.30 ---- Cleaned THF ---
% 1.64/1.30 thf(nat_type,type,
% 1.64/1.30 nat: $tType ).
% 1.64/1.30
% 1.64/1.30 thf(x,type,
% 1.64/1.30 x: nat ).
% 1.64/1.30
% 1.64/1.30 thf(y,type,
% 1.64/1.30 y: nat ).
% 1.64/1.30
% 1.64/1.30 thf(less,type,
% 1.64/1.30 less: nat > nat > $o ).
% 1.64/1.30
% 1.64/1.30 thf(suc,type,
% 1.64/1.30 suc: nat > nat ).
% 1.64/1.30
% 1.64/1.30 thf(l,axiom,
% 1.64/1.30 less @ y @ ( suc @ x ) ).
% 1.64/1.30
% 1.64/1.30 thf(lessis,type,
% 1.64/1.30 lessis: nat > nat > $o ).
% 1.64/1.30
% 1.64/1.30 thf(pl,type,
% 1.64/1.30 pl: nat > nat > nat ).
% 1.64/1.30
% 1.64/1.30 thf(n_1,type,
% 1.64/1.30 n_1: nat ).
% 1.64/1.30
% 1.64/1.30 thf(satz26,axiom,
% 1.64/1.30 ! [Xx: nat,Xy: nat] :
% 1.64/1.30 ( ( less @ Xy @ ( pl @ Xx @ n_1 ) )
% 1.64/1.30 => ( lessis @ Xy @ Xx ) ) ).
% 1.64/1.30
% 1.64/1.30 thf(satz4e,axiom,
% 1.64/1.30 ! [Xx: nat] :
% 1.64/1.30 ( ( suc @ Xx )
% 1.64/1.30 = ( pl @ Xx @ n_1 ) ) ).
% 1.64/1.30
% 1.64/1.30 thf(satz26a,conjecture,
% 1.64/1.30 lessis @ y @ x ).
% 1.64/1.30 ------------------------
% 1.64/1.32 % (4192)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_4080 for (2999ds/4Mi)
% 1.64/1.32 % (4192)First to succeed.
% 1.64/1.32 % (4192)Refutation found. Thanks to Tanya!
% 1.64/1.32 % SZS status Theorem for DTF2THF_4080
% 1.64/1.32 % SZS output start Proof for DTF2THF_4080
% 1.64/1.32 thf(type_def_5, type, nat: $tType).
% 1.64/1.32 thf(func_def_0, type, nat: $tType).
% 1.64/1.32 thf(func_def_1, type, x: nat).
% 1.64/1.32 thf(func_def_2, type, y: nat).
% 1.64/1.32 thf(func_def_3, type, less: nat > nat > $o).
% 1.64/1.32 thf(func_def_4, type, suc: nat > nat).
% 1.64/1.32 thf(func_def_6, type, lessis: nat > nat > $o).
% 1.64/1.32 thf(func_def_7, type, pl: nat > nat > nat).
% 1.64/1.32 thf(func_def_8, type, n_1: nat).
% 1.64/1.32 thf(f43,plain,(
% 1.64/1.32 $false),
% 1.64/1.32 inference(trivial_inequality_removal,[status(thm)],[f41])).
% 1.64/1.32 thf(f41,plain,(
% 1.64/1.32 ($false = $true)),
% 1.64/1.32 inference(superposition,[status(thm)],[f39,f29])).
% 1.64/1.32 thf(f29,plain,(
% 1.64/1.32 ((lessis @ y @ x) = $false)),
% 1.64/1.32 inference(trivial_inequality_removal,[status(thm)],[f28])).
% 1.64/1.32 thf(f28,plain,(
% 1.64/1.32 ($true != $true) | ((lessis @ y @ x) = $false)),
% 1.64/1.32 inference(fool_paramodulation,[status(thm)],[f17])).
% 1.64/1.32 thf(f17,plain,(
% 1.64/1.32 ((lessis @ y @ x) != $true)),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f14])).
% 1.64/1.32 thf(f14,plain,(
% 1.64/1.32 ((lessis @ y @ x) != $true)),
% 1.64/1.32 inference(flattening,[status(thm)],[f11])).
% 1.64/1.32 thf(f11,plain,(
% 1.64/1.32 ~((lessis @ y @ x) = $true)),
% 1.64/1.32 inference(fool_elimination,[status(thm)],[f10])).
% 1.64/1.32 thf(f10,plain,(
% 1.64/1.32 ~(lessis @ y @ x)),
% 1.64/1.32 inference(rectify,[status(thm)],[f5])).
% 1.64/1.32 thf(f5,negated_conjecture,(
% 1.64/1.32 ~(lessis @ y @ x)),
% 1.64/1.32 inference(negated_conjecture,[status(cth)],[f4])).
% 1.64/1.32 thf(f4,conjecture,(
% 1.64/1.32 (lessis @ y @ x)),
% 1.64/1.32 file('/export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2THF_4080.p',satz26a)).
% 1.64/1.32 thf(f39,plain,(
% 1.64/1.32 ((lessis @ y @ x) = $true)),
% 1.64/1.32 inference(trivial_inequality_removal,[status(thm)],[f35])).
% 1.64/1.32 thf(f35,plain,(
% 1.64/1.32 ((lessis @ y @ x) = $true) | ($false = $true)),
% 1.64/1.32 inference(superposition,[status(thm)],[f27,f16])).
% 1.64/1.32 thf(f16,plain,(
% 1.64/1.32 ((less @ y @ (suc @ x)) = $true)),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f13])).
% 1.64/1.32 thf(f13,plain,(
% 1.64/1.32 ((less @ y @ (suc @ x)) = $true)),
% 1.64/1.32 inference(fool_elimination,[status(thm)],[f12])).
% 1.64/1.32 thf(f12,plain,(
% 1.64/1.32 (less @ y @ (suc @ x))),
% 1.64/1.32 inference(rectify,[status(thm)],[f1])).
% 1.64/1.32 thf(f1,axiom,(
% 1.64/1.32 (less @ y @ (suc @ x))),
% 1.64/1.32 file('/export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2THF_4080.p',l)).
% 1.64/1.32 thf(f27,plain,(
% 1.64/1.32 ( ! [X2 : nat,X1 : nat] : (($false = (less @ X2 @ (suc @ X1))) | ($true = (lessis @ X2 @ X1))) )),
% 1.64/1.32 inference(backward_demodulation,[status(thm)],[f23,f26])).
% 1.64/1.32 thf(f26,plain,(
% 1.64/1.32 ( ! [X1 : nat] : (((pl @ X1 @ n_1) = (suc @ X1))) )),
% 1.64/1.32 inference(equality_proxy_clausification,[status(thm)],[f25])).
% 1.64/1.32 thf(f25,plain,(
% 1.64/1.32 ( ! [X1 : nat] : (($true = ((pl @ X1 @ n_1) = (suc @ X1)))) )),
% 1.64/1.32 inference(beta_eta_normalization,[status(thm)],[f24])).
% 1.64/1.32 thf(f24,plain,(
% 1.64/1.32 ( ! [X1 : nat] : (($true = ((^[Y0 : nat]: ((pl @ Y0 @ n_1) = (suc @ Y0))) @ X1))) )),
% 1.64/1.32 inference(pi_clausification,[status(thm)],[f15])).
% 1.64/1.32 thf(f15,plain,(
% 1.64/1.32 ((!! @ nat @ (^[Y0 : nat]: ((pl @ Y0 @ n_1) = (suc @ Y0)))) = $true)),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f7])).
% 1.64/1.32 thf(f7,plain,(
% 1.64/1.32 ((!! @ nat @ (^[Y0 : nat]: ((pl @ Y0 @ n_1) = (suc @ Y0)))) = $true)),
% 1.64/1.32 inference(fool_elimination,[status(thm)],[f3])).
% 1.64/1.32 thf(f3,axiom,(
% 1.64/1.32 ! [X0 : nat] : ((pl @ X0 @ n_1) = (suc @ X0))),
% 1.64/1.32 file('/export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2THF_4080.p',satz4e)).
% 1.64/1.32 thf(f23,plain,(
% 1.64/1.32 ( ! [X2 : nat,X1 : nat] : (($true = (lessis @ X2 @ X1)) | ($false = (less @ X2 @ (pl @ X1 @ n_1)))) )),
% 1.64/1.32 inference(binary_proxy_clausification,[status(thm)],[f22])).
% 1.64/1.32 thf(f22,plain,(
% 1.64/1.32 ( ! [X2 : nat,X1 : nat] : ((((less @ X2 @ (pl @ X1 @ n_1)) => (lessis @ X2 @ X1)) = $true)) )),
% 1.64/1.32 inference(beta_eta_normalization,[status(thm)],[f21])).
% 1.64/1.32 thf(f21,plain,(
% 1.64/1.32 ( ! [X2 : nat,X1 : nat] : (($true = ((^[Y0 : nat]: ((less @ Y0 @ (pl @ X1 @ n_1)) => (lessis @ Y0 @ X1))) @ X2))) )),
% 1.64/1.32 inference(pi_clausification,[status(thm)],[f20])).
% 1.64/1.32 thf(f20,plain,(
% 1.64/1.32 ( ! [X1 : nat] : (($true = (!! @ nat @ (^[Y0 : nat]: ((less @ Y0 @ (pl @ X1 @ n_1)) => (lessis @ Y0 @ X1)))))) )),
% 1.64/1.32 inference(beta_eta_normalization,[status(thm)],[f19])).
% 1.64/1.32 thf(f19,plain,(
% 1.64/1.32 ( ! [X1 : nat] : ((((^[Y0 : nat]: (!! @ nat @ (^[Y1 : nat]: ((less @ Y1 @ (pl @ Y0 @ n_1)) => (lessis @ Y1 @ Y0))))) @ X1) = $true)) )),
% 1.64/1.32 inference(pi_clausification,[status(thm)],[f18])).
% 1.64/1.32 thf(f18,plain,(
% 1.64/1.32 ($true = (!! @ nat @ (^[Y0 : nat]: (!! @ nat @ (^[Y1 : nat]: ((less @ Y1 @ (pl @ Y0 @ n_1)) => (lessis @ Y1 @ Y0)))))))),
% 1.64/1.32 inference(cnf_transformation,[status(thm)],[f9])).
% 1.64/1.32 thf(f9,plain,(
% 1.64/1.32 ($true = (!! @ nat @ (^[Y0 : nat]: (!! @ nat @ (^[Y1 : nat]: ((less @ Y1 @ (pl @ Y0 @ n_1)) => (lessis @ Y1 @ Y0)))))))),
% 1.64/1.32 inference(fool_elimination,[status(thm)],[f8])).
% 1.64/1.32 thf(f8,plain,(
% 1.64/1.32 ! [X0 : nat,X1 : nat] : ((less @ X0 @ (pl @ X1 @ n_1)) => (lessis @ X0 @ X1))),
% 1.64/1.32 inference(rectify,[status(thm)],[f2])).
% 1.64/1.32 thf(f2,axiom,(
% 1.64/1.32 ! [X1 : nat,X0 : nat] : ((less @ X1 @ (pl @ X0 @ n_1)) => (lessis @ X1 @ X0))),
% 1.64/1.32 file('/export/starexec/sandbox2/tmp/tmp.Gtx2Xsgjky/DTF2THF_4080.p',satz26)).
% 1.64/1.32 % SZS output end Proof for DTF2THF_4080
% 1.64/1.32 % (4192)------------------------------
% 1.64/1.32 % (4192)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.32 % (4192)Termination reason: Refutation
% 1.64/1.32
% 1.64/1.32 % (4192)Memory used [KB]: 5500
% 1.64/1.32 % (4192)Time elapsed: 0.003 s
% 1.64/1.32 % (4192)Instructions burned: 2 (million)
% 1.64/1.32 % (4192)------------------------------
% 1.64/1.32 % (4192)------------------------------
% 1.64/1.32 % (4190)Success in time 0.011 s
%------------------------------------------------------------------------------