%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM697^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 : n022.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:20 AM UTC 2026
% Result : Theorem 1.65s 1.48s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 66 ( 20 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 97 ( 10 ~; 5 |; 0 &; 79 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% 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,
moreis: nat > nat > $o ).
thf(func_def_6,type,
suc: nat > nat ).
thf(func_def_7,type,
pl: nat > nat > nat ).
thf(func_def_8,type,
n_1: nat ).
thf(f23,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f22,f17]) ).
thf(f17,plain,
( ( moreis @ y @ ( suc @ x ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( moreis @ y @ ( suc @ x ) )
!= $true ),
inference(flattening,[status(thm)],[f8]) ).
thf(f8,plain,
( ( moreis @ y @ ( suc @ x ) )
!= $true ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
~ ( moreis @ y @ ( suc @ x ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ( moreis @ y @ ( suc @ x ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
moreis @ y @ ( suc @ x ),
file('/export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2THF_19663.p',satz25a) ).
thf(f22,plain,
( ( moreis @ y @ ( suc @ x ) )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f21]) ).
thf(f21,plain,
( ( $true != $true )
| ( ( moreis @ y @ ( suc @ x ) )
= $true ) ),
inference(superposition,[status(thm)],[f20,f18]) ).
thf(f18,plain,
( ( more @ y @ x )
= $true ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ( more @ y @ x )
= $true ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
more @ y @ x,
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
more @ y @ x,
file('/export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2THF_19663.p',m) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( ( more @ X1 @ X0 )
!= $true )
| ( $true
= ( moreis @ X1 @ ( suc @ X0 ) ) ) ),
inference(backward_demodulation,[status(thm)],[f19,f16]) ).
thf(f16,plain,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2THF_19663.p',satz4a) ).
thf(f19,plain,
! [X0: nat,X1: nat] :
( ( ( more @ X1 @ X0 )
!= $true )
| ( ( moreis @ X1 @ ( pl @ X0 @ n_1 ) )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
! [X0: nat,X1: nat] :
( ( ( more @ X1 @ X0 )
!= $true )
| ( ( moreis @ X1 @ ( pl @ X0 @ n_1 ) )
= $true ) ),
inference(rectify,[status(thm)],[f14]) ).
thf(f14,plain,
! [X1: nat,X0: nat] :
( ( $true
!= ( more @ X0 @ X1 ) )
| ( $true
= ( moreis @ X0 @ ( pl @ X1 @ n_1 ) ) ) ),
inference(ennf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( more @ X0 @ X1 ) )
=> ( $true
= ( moreis @ X0 @ ( pl @ X1 @ n_1 ) ) ) ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
! [X0: nat,X1: nat] :
( ( more @ X0 @ X1 )
=> ( moreis @ X0 @ ( pl @ X1 @ n_1 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X1: nat,X0: nat] :
( ( more @ X1 @ X0 )
=> ( moreis @ X1 @ ( pl @ X0 @ n_1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2THF_19663.p',satz25) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM697^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 : n022.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:15:51 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.20/0.47 ---- Original DTF file ---
% 0.20/0.47 thf(spec,logic,$$dhol).
% 0.20/0.47 %------------------------------------------------------------------------------
% 0.20/0.47 % File : NUM697^1 : TPTP v9.2.1. Released v3.7.0.
% 0.20/0.47 % Domain : Number Theory
% 0.20/0.47 % Problem : Landau theorem 25a
% 0.20/0.47 % Version : Especial.
% 0.20/0.47 % English : moreis y (suc x)
% 0.20/0.47
% 0.20/0.47 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.20/0.47 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.20/0.47 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.47 % Source : [Bro09]
% 0.20/0.47 % Names : satz25a [Lan30]
% 0.20/0.47
% 0.20/0.47 % Status : Theorem
% 0.20/0.47 % : Without extensionality : Theorem
% 0.20/0.47 % 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.20/0.47 % Syntax : Number of formulae : 12 ( 3 unt; 8 typ; 0 def)
% 0.20/0.47 % Number of atoms : 5 ( 1 equ; 0 cnn)
% 0.20/0.47 % Maximal formula atoms : 2 ( 1 avg)
% 0.20/0.47 % Number of connectives : 15 ( 0 ~; 0 |; 0 &; 14 @)
% 0.20/0.47 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.20/0.47 % Maximal formula depth : 7 ( 4 avg)
% 0.20/0.47 % Number of types : 2 ( 1 usr)
% 0.20/0.47 % Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% 0.20/0.47 % Number of symbols : 8 ( 7 usr; 3 con; 0-2 aty)
% 0.20/0.47 % Number of variables : 3 ( 0 ^; 3 !; 0 ?; 3 :)
% 0.20/0.47 % SPC : TH0_THM_EQU_NAR
% 0.20/0.47
% 0.20/0.47 % Comments :
% 0.20/0.47 %------------------------------------------------------------------------------
% 0.20/0.47 thf(nat_type,type,
% 0.20/0.47 nat: $tType ).
% 0.20/0.47
% 0.20/0.47 thf(x,type,
% 0.20/0.47 x: nat ).
% 0.20/0.47
% 0.20/0.47 thf(y,type,
% 0.20/0.47 y: nat ).
% 0.20/0.47
% 0.20/0.47 thf(more,type,
% 0.20/0.47 more: nat > nat > $o ).
% 0.20/0.47
% 0.20/0.47 thf(m,axiom,
% 0.20/0.47 more @ y @ x ).
% 0.20/0.47
% 0.20/0.47 thf(moreis,type,
% 0.20/0.47 moreis: nat > nat > $o ).
% 0.20/0.47
% 0.20/0.47 thf(suc,type,
% 0.20/0.47 suc: nat > nat ).
% 0.20/0.47
% 0.20/0.47 thf(pl,type,
% 0.20/0.47 pl: nat > nat > nat ).
% 0.20/0.47
% 0.20/0.47 thf(n_1,type,
% 0.20/0.47 n_1: nat ).
% 0.20/0.47
% 0.20/0.47 thf(satz25,axiom,
% 0.20/0.47 ! [Xx: nat,Xy: nat] :
% 0.20/0.47 ( ( more @ Xy @ Xx )
% 0.20/0.47 => ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ) ).
% 0.20/0.47
% 0.20/0.47 thf(satz4a,axiom,
% 0.20/0.47 ! [Xx: nat] :
% 0.20/0.47 ( ( pl @ Xx @ n_1 )
% 0.20/0.47 = ( suc @ Xx ) ) ).
% 0.20/0.47
% 0.20/0.47 thf(satz25a,conjecture,
% 0.20/0.47 moreis @ y @ ( suc @ x ) ).
% 0.20/0.47
% 0.20/0.47 %------------------------------------------------------------------------------
% 0.20/0.47 ------------------------
% 1.65/1.45 ---- Embedded in THF ---
% 1.65/1.45 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.65/1.45 %%% Generated on Tue Feb 24 11:15:52 EST 2026
% 1.65/1.45 %%% using '$$dhol' embedding, version 1.3.0.
% 1.65/1.45 %%% Logic specification used:
% 1.65/1.45 %%% thf(spec, logic, $$dhol).
% 1.65/1.45
% 1.65/1.45 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2DTF19663.p
% See solution above
% 1.65/1.45 ------------------------
% 1.65/1.46 ---- Cleaned THF ---
% 1.65/1.46 thf(nat_type,type,
% 1.65/1.46 nat: $tType ).
% 1.65/1.46
% 1.65/1.46 thf(x,type,
% 1.65/1.46 x: nat ).
% 1.65/1.46
% 1.65/1.46 thf(y,type,
% 1.65/1.46 y: nat ).
% 1.65/1.46
% 1.65/1.46 thf(more,type,
% 1.65/1.46 more: nat > nat > $o ).
% 1.65/1.46
% 1.65/1.46 thf(m,axiom,
% 1.65/1.46 more @ y @ x ).
% 1.65/1.46
% 1.65/1.46 thf(moreis,type,
% 1.65/1.46 moreis: nat > nat > $o ).
% 1.65/1.46
% 1.65/1.46 thf(suc,type,
% 1.65/1.46 suc: nat > nat ).
% 1.65/1.46
% 1.65/1.46 thf(pl,type,
% 1.65/1.46 pl: nat > nat > nat ).
% 1.65/1.46
% 1.65/1.46 thf(n_1,type,
% 1.65/1.46 n_1: nat ).
% 1.65/1.46
% 1.65/1.46 thf(satz25,axiom,
% 1.65/1.46 ! [Xx: nat,Xy: nat] :
% 1.65/1.46 ( ( more @ Xy @ Xx )
% 1.65/1.46 => ( moreis @ Xy @ ( pl @ Xx @ n_1 ) ) ) ).
% 1.65/1.46
% 1.65/1.46 thf(satz4a,axiom,
% 1.65/1.46 ! [Xx: nat] :
% 1.65/1.46 ( ( pl @ Xx @ n_1 )
% 1.65/1.46 = ( suc @ Xx ) ) ).
% 1.65/1.46
% 1.65/1.46 thf(satz25a,conjecture,
% 1.65/1.46 moreis @ y @ ( suc @ x ) ).
% 1.65/1.46 ------------------------
% 1.65/1.48 % (19762)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_19663 for (2999ds/27Mi)
% 1.65/1.48 % (19764)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_19663 for (2999ds/2Mi)
% 1.65/1.48 % (19763)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_19663 for (2999ds/2Mi)
% 1.65/1.48 % (19765)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_19663 for (2999ds/275Mi)
% 1.65/1.48 % (19761)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_19663 for (2999ds/4Mi)
% 1.65/1.48 % (19760)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_19663 for (2999ds/183Mi)
% 1.65/1.48 % (19766)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_19663 for (2999ds/18Mi)
% 1.65/1.48 % (19763)Instruction limit reached!
% 1.65/1.48 % (19763)------------------------------
% 1.65/1.48 % (19763)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.48 % (19763)Termination reason: Unknown
% 1.65/1.48 % (19763)Termination phase: Saturation
% 1.65/1.48 % (19764)Instruction limit reached!
% 1.65/1.48 % (19764)------------------------------
% 1.65/1.48 % (19764)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.48 % (19764)Termination reason: Unknown
% 1.65/1.48 % (19764)Termination phase: Saturation
% 1.65/1.48
% 1.65/1.48 % (19764)Memory used [KB]: 5500
% 1.65/1.48 % (19764)Time elapsed: 0.003 s
% 1.65/1.48 % (19764)Instructions burned: 2 (million)
% 1.65/1.48 % (19764)------------------------------
% 1.65/1.48 % (19764)------------------------------
% 1.65/1.48
% 1.65/1.48 % (19763)Memory used [KB]: 5373
% 1.65/1.48 % (19763)Time elapsed: 0.003 s
% 1.65/1.48 % (19763)Instructions burned: 2 (million)
% 1.65/1.48 % (19763)------------------------------
% 1.65/1.48 % (19763)------------------------------
% 1.65/1.48 % (19765)Refutation not found, incomplete strategy
% 1.65/1.48 % (19765)------------------------------
% 1.65/1.48 % (19765)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.48 % (19765)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.48
% 1.65/1.48
% 1.65/1.48 % (19765)Memory used [KB]: 5500
% 1.65/1.48 % (19765)Time elapsed: 0.003 s
% 1.65/1.48 % (19765)Instructions burned: 2 (million)
% 1.65/1.48 % (19765)------------------------------
% 1.65/1.48 % (19765)------------------------------
% 1.65/1.48 % (19766)First to succeed.
% 1.65/1.48 % (19760)Also succeeded, but the first one will report.
% 1.65/1.48 % (19761)Also succeeded, but the first one will report.
% 1.65/1.48 % (19766)Refutation found. Thanks to Tanya!
% 1.65/1.48 % SZS status Theorem for DTF2THF_19663
% 1.65/1.48 % SZS output start Proof for DTF2THF_19663
% 1.65/1.48 thf(type_def_5, type, nat: $tType).
% 1.65/1.48 thf(func_def_0, type, nat: $tType).
% 1.65/1.48 thf(func_def_1, type, x: nat).
% 1.65/1.48 thf(func_def_2, type, y: nat).
% 1.65/1.48 thf(func_def_3, type, more: nat > nat > $o).
% 1.65/1.48 thf(func_def_5, type, moreis: nat > nat > $o).
% 1.65/1.48 thf(func_def_6, type, suc: nat > nat).
% 1.65/1.48 thf(func_def_7, type, pl: nat > nat > nat).
% 1.65/1.48 thf(func_def_8, type, n_1: nat).
% 1.65/1.48 thf(f23,plain,(
% 1.65/1.48 $false),
% 1.65/1.48 inference(subsumption_resolution,[status(thm)],[f22,f17])).
% 1.65/1.48 thf(f17,plain,(
% 1.65/1.48 ((moreis @ y @ (suc @ x)) != $true)),
% 1.65/1.48 inference(cnf_transformation,[status(thm)],[f13])).
% 1.65/1.48 thf(f13,plain,(
% 1.65/1.48 ((moreis @ y @ (suc @ x)) != $true)),
% 1.65/1.48 inference(flattening,[status(thm)],[f8])).
% 1.65/1.48 thf(f8,plain,(
% 1.65/1.48 ~((moreis @ y @ (suc @ x)) = $true)),
% 1.65/1.48 inference(fool_elimination,[status(thm)],[f7])).
% 1.65/1.48 thf(f7,plain,(
% 1.65/1.48 ~(moreis @ y @ (suc @ x))),
% 1.65/1.48 inference(rectify,[status(thm)],[f5])).
% 1.65/1.48 thf(f5,negated_conjecture,(
% 1.65/1.48 ~(moreis @ y @ (suc @ x))),
% 1.65/1.48 inference(negated_conjecture,[status(cth)],[f4])).
% 1.65/1.48 thf(f4,conjecture,(
% 1.65/1.48 (moreis @ y @ (suc @ x))),
% 1.65/1.48 file('/export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2THF_19663.p',satz25a)).
% 1.65/1.48 thf(f22,plain,(
% 1.65/1.48 ((moreis @ y @ (suc @ x)) = $true)),
% 1.65/1.48 inference(trivial_inequality_removal,[status(thm)],[f21])).
% 1.65/1.48 thf(f21,plain,(
% 1.65/1.48 ($true != $true) | ((moreis @ y @ (suc @ x)) = $true)),
% 1.65/1.48 inference(superposition,[status(thm)],[f20,f18])).
% 1.65/1.48 thf(f18,plain,(
% 1.65/1.48 ((more @ y @ x) = $true)),
% 1.65/1.48 inference(cnf_transformation,[status(thm)],[f10])).
% 1.65/1.48 thf(f10,plain,(
% 1.65/1.48 ((more @ y @ x) = $true)),
% 1.65/1.48 inference(fool_elimination,[status(thm)],[f9])).
% 1.65/1.48 thf(f9,plain,(
% 1.65/1.48 (more @ y @ x)),
% 1.65/1.48 inference(rectify,[status(thm)],[f1])).
% 1.65/1.48 thf(f1,axiom,(
% 1.65/1.48 (more @ y @ x)),
% 1.65/1.48 file('/export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2THF_19663.p',m)).
% 1.65/1.48 thf(f20,plain,(
% 1.65/1.48 ( ! [X0 : nat,X1 : nat] : (((more @ X1 @ X0) != $true) | ($true = (moreis @ X1 @ (suc @ X0)))) )),
% 1.65/1.48 inference(backward_demodulation,[status(thm)],[f19,f16])).
% 1.65/1.48 thf(f16,plain,(
% 1.65/1.48 ( ! [X0 : nat] : (((pl @ X0 @ n_1) = (suc @ X0))) )),
% 1.65/1.48 inference(cnf_transformation,[status(thm)],[f3])).
% 1.65/1.48 thf(f3,axiom,(
% 1.65/1.48 ! [X0 : nat] : ((pl @ X0 @ n_1) = (suc @ X0))),
% 1.65/1.48 file('/export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2THF_19663.p',satz4a)).
% 1.65/1.48 thf(f19,plain,(
% 1.65/1.48 ( ! [X0 : nat,X1 : nat] : (((more @ X1 @ X0) != $true) | ((moreis @ X1 @ (pl @ X0 @ n_1)) = $true)) )),
% 1.65/1.48 inference(cnf_transformation,[status(thm)],[f15])).
% 1.65/1.48 thf(f15,plain,(
% 1.65/1.48 ! [X0 : nat,X1 : nat] : (((more @ X1 @ X0) != $true) | ((moreis @ X1 @ (pl @ X0 @ n_1)) = $true))),
% 1.65/1.48 inference(rectify,[status(thm)],[f14])).
% 1.65/1.48 thf(f14,plain,(
% 1.65/1.48 ! [X1 : nat,X0 : nat] : (($true != (more @ X0 @ X1)) | ($true = (moreis @ X0 @ (pl @ X1 @ n_1))))),
% 1.65/1.48 inference(ennf_transformation,[status(thm)],[f12])).
% 1.65/1.48 thf(f12,plain,(
% 1.65/1.48 ! [X0 : nat,X1 : nat] : (($true = (more @ X0 @ X1)) => ($true = (moreis @ X0 @ (pl @ X1 @ n_1))))),
% 1.65/1.48 inference(fool_elimination,[status(thm)],[f11])).
% 1.65/1.48 thf(f11,plain,(
% 1.65/1.48 ! [X0 : nat,X1 : nat] : ((more @ X0 @ X1) => (moreis @ X0 @ (pl @ X1 @ n_1)))),
% 1.65/1.48 inference(rectify,[status(thm)],[f2])).
% 1.65/1.48 thf(f2,axiom,(
% 1.65/1.48 ! [X1 : nat,X0 : nat] : ((more @ X1 @ X0) => (moreis @ X1 @ (pl @ X0 @ n_1)))),
% 1.65/1.48 file('/export/starexec/sandbox/tmp/tmp.jz4zyBjdUw/DTF2THF_19663.p',satz25)).
% 1.65/1.48 % SZS output end Proof for DTF2THF_19663
% 1.65/1.48 % (19766)------------------------------
% 1.65/1.48 % (19766)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.48 % (19766)Termination reason: Refutation
% 1.65/1.48
% 1.65/1.48 % (19766)Memory used [KB]: 5500
% 1.65/1.48 % (19766)Time elapsed: 0.004 s
% 1.65/1.48 % (19766)Instructions burned: 2 (million)
% 1.65/1.48 % (19766)------------------------------
% 1.65/1.48 % (19766)------------------------------
% 1.65/1.48 % (19759)Success in time 0.019 s
%------------------------------------------------------------------------------