%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM680^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 : n018.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:14 AM UTC 2026
% Result : Theorem 1.56s 1.32s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 41 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 210 ( 78 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 325 ( 68 ~; 24 |; 4 &; 198 @)
% ( 0 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 0 ^; 55 !; 0 ?; 55 :)
% 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,
z: nat ).
thf(func_def_4,type,
more: nat > nat > $o ).
thf(func_def_5,type,
pl: nat > nat > nat ).
thf(func_def_7,type,
less: nat > nat > $o ).
thf(f62,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f60,f45]) ).
thf(f45,plain,
! [X1: nat] :
( $true
!= ( more @ X1 @ X1 ) ),
inference(equality_resolution,[status(thm)],[f39]) ).
thf(f39,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f32]) ).
thf(f32,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ( ( more @ X1 @ X0 )
!= $true ) )
& ( ( ( more @ X1 @ X0 )
!= $true )
| ( ( less @ X1 @ X0 )
!= $true ) )
& ( ( X0 != X1 )
| ( ( less @ X1 @ X0 )
!= $true ) ) ),
inference(flattening,[status(thm)],[f31]) ).
thf(f31,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ( ( less @ X1 @ X0 )
!= $true ) )
& ( ( ( more @ X1 @ X0 )
!= $true )
| ( ( less @ X1 @ X0 )
!= $true ) )
& ( ( X0 != X1 )
| ( ( more @ X1 @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f24]) ).
thf(f24,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( ( more @ X1 @ X0 )
!= $true ) )
=> ( ( ( ( more @ X1 @ X0 )
= $true )
=> ( ( less @ X1 @ X0 )
!= $true ) )
=> ~ ( ( ( less @ X1 @ X0 )
= $true )
=> ( X0 != X1 ) ) ) ),
inference(flattening,[status(thm)],[f15]) ).
thf(f15,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( ( more @ X1 @ X0 )
!= $true ) )
=> ~ ~ ( ( ( ( more @ X1 @ X0 )
= $true )
=> ( ( less @ X1 @ X0 )
!= $true ) )
=> ~ ( ( ( less @ X1 @ X0 )
= $true )
=> ( X0 != X1 ) ) ) ),
inference(fool_elimination,[status(thm)],[f14]) ).
thf(f14,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.ePvsRzc2eq/DTF2THF_28852.p',satz10b) ).
thf(f60,plain,
( $true
= ( more @ ( pl @ x @ z ) @ ( pl @ x @ z ) ) ),
inference(superposition,[status(thm)],[f41,f58]) ).
thf(f58,plain,
x = y,
inference(subsumption_resolution,[status(thm)],[f57,f36]) ).
thf(f36,plain,
( ( more @ x @ y )
!= $true ),
inference(cnf_transformation,[status(thm)],[f26]) ).
thf(f26,plain,
( ( more @ x @ y )
!= $true ),
inference(flattening,[status(thm)],[f21]) ).
thf(f21,plain,
( ( more @ x @ y )
!= $true ),
inference(fool_elimination,[status(thm)],[f20]) ).
thf(f20,plain,
~ ( more @ x @ y ),
inference(rectify,[status(thm)],[f8]) ).
thf(f8,negated_conjecture,
~ ( more @ x @ y ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f7,conjecture,
more @ x @ y,
file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',satz20a) ).
thf(f57,plain,
( ( ( more @ x @ y )
= $true )
| ( x = y ) ),
inference(trivial_inequality_removal,[status(thm)],[f56]) ).
thf(f56,plain,
( ( x = y )
| ( $true != $true )
| ( ( more @ x @ y )
= $true ) ),
inference(superposition,[status(thm)],[f55,f43]) ).
thf(f43,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X1 @ X0 )
= $true )
| ( ( more @ X1 @ X0 )
= $true )
| ( X0 = X1 ) ),
inference(cnf_transformation,[status(thm)],[f29]) ).
thf(f29,plain,
! [X0: nat,X1: nat] :
( ( X0 = X1 )
| ( ( less @ X1 @ X0 )
= $true )
| ( ( more @ X1 @ X0 )
= $true ) ),
inference(flattening,[status(thm)],[f28]) ).
thf(f28,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X1 @ X0 )
= $true )
| ( ( more @ X1 @ X0 )
= $true )
| ( X0 = X1 ) ),
inference(ennf_transformation,[status(thm)],[f22]) ).
thf(f22,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ( ( more @ X1 @ X0 )
!= $true )
=> ( ( less @ X1 @ X0 )
= $true ) ) ),
inference(flattening,[status(thm)],[f11]) ).
thf(f11,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ( ( more @ X1 @ X0 )
!= $true )
=> ( ( less @ X1 @ X0 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ~ ( more @ X1 @ X0 )
=> ( less @ X1 @ X0 ) ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,axiom,
! [X2: nat,X1: nat] :
( ( X1 != X2 )
=> ( ~ ( more @ X1 @ X2 )
=> ( less @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',satz10a) ).
thf(f55,plain,
( ( less @ x @ y )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f54]) ).
thf(f54,plain,
( ( $true != $true )
| ( ( less @ x @ y )
!= $true ) ),
inference(superposition,[status(thm)],[f53,f41]) ).
thf(f53,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( more @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) )
!= $true )
| ( $true
!= ( less @ X0 @ X2 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f51]) ).
thf(f51,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( $true != $true )
| ( $true
!= ( less @ X0 @ X2 ) )
| ( ( more @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) )
!= $true ) ),
inference(superposition,[status(thm)],[f38,f40]) ).
thf(f40,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( $true
= ( less @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) ) )
| ( $true
!= ( less @ X0 @ X2 ) ) ),
inference(cnf_transformation,[status(thm)],[f34]) ).
thf(f34,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( $true
!= ( less @ X0 @ X2 ) )
| ( $true
= ( less @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) ) ) ),
inference(rectify,[status(thm)],[f27]) ).
thf(f27,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( less @ X2 @ X1 )
!= $true )
| ( ( less @ ( pl @ X2 @ X0 ) @ ( pl @ X1 @ X0 ) )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f17]) ).
thf(f17,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( less @ X2 @ X1 )
= $true )
=> ( ( less @ ( pl @ X2 @ X0 ) @ ( pl @ X1 @ X0 ) )
= $true ) ),
inference(fool_elimination,[status(thm)],[f16]) ).
thf(f16,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( less @ X2 @ X1 )
=> ( less @ ( pl @ X2 @ X0 ) @ ( pl @ X1 @ X0 ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,axiom,
! [X3: nat,X2: nat,X1: nat] :
( ( less @ X1 @ X2 )
=> ( less @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',satz19c) ).
thf(f38,plain,
! [X0: nat,X1: nat] :
( ( ( less @ X1 @ X0 )
!= $true )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f32]) ).
thf(f41,plain,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f19]) ).
thf(f19,plain,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
= $true ),
inference(fool_elimination,[status(thm)],[f18]) ).
thf(f18,plain,
more @ ( pl @ x @ z ) @ ( pl @ y @ z ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
more @ ( pl @ x @ z ) @ ( pl @ y @ z ),
file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',m) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM680^1 : TPTP v9.2.1. Released v3.7.0.
% 0.00/0.09 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.29 % Computer : n018.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue Feb 24 11:10:16 EST 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.29 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.38 ---- Original DTF file ---
% 0.17/0.38 thf(spec,logic,$$dhol).
% 0.17/0.38 %------------------------------------------------------------------------------
% 0.17/0.38 % File : NUM680^1 : TPTP v9.2.1. Released v3.7.0.
% 0.17/0.38 % Domain : Number Theory
% 0.17/0.38 % Problem : Landau theorem 20a
% 0.17/0.38 % Version : Especial.
% 0.17/0.38 % English : more x y
% 0.17/0.38
% 0.17/0.38 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.17/0.38 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.17/0.38 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.38 % Source : [Bro09]
% 0.17/0.38 % Names : satz20a [Lan30]
% 0.17/0.38 % : satz33a [Lan30]
% 0.17/0.38
% 0.17/0.38 % Status : Theorem
% 0.17/0.38 % : Without extensionality : Theorem
% 0.17/0.38 % Rating : 0.11 v9.1.0, 0.12 v9.0.0, 0.20 v8.2.0, 0.15 v8.1.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.00 v6.1.0, 0.14 v6.0.0, 0.29 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 v4.0.1, 0.33 v4.0.0, 0.00 v3.7.0
% 0.17/0.38 % Syntax : Number of formulae : 14 ( 2 unt; 7 typ; 0 def)
% 0.17/0.38 % Number of atoms : 15 ( 5 equ; 0 cnn)
% 0.17/0.38 % Maximal formula atoms : 6 ( 2 avg)
% 0.17/0.38 % Number of connectives : 53 ( 11 ~; 0 |; 0 &; 32 @)
% 0.17/0.38 % ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% 0.17/0.38 % Maximal formula depth : 12 ( 7 avg)
% 0.17/0.38 % Number of types : 2 ( 1 usr)
% 0.17/0.38 % Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% 0.17/0.38 % Number of symbols : 7 ( 6 usr; 3 con; 0-2 aty)
% 0.17/0.38 % Number of variables : 11 ( 0 ^; 11 !; 0 ?; 11 :)
% 0.17/0.38 % SPC : TH0_THM_EQU_NAR
% 0.17/0.38
% 0.17/0.38 % Comments :
% 0.17/0.38 %------------------------------------------------------------------------------
% 0.17/0.38 thf(nat_type,type,
% 0.17/0.38 nat: $tType ).
% 0.17/0.38
% 0.17/0.38 thf(x,type,
% 0.17/0.38 x: nat ).
% 0.17/0.38
% 0.17/0.38 thf(y,type,
% 0.17/0.38 y: nat ).
% 0.17/0.38
% 0.17/0.38 thf(z,type,
% 0.17/0.38 z: nat ).
% 0.17/0.38
% 0.17/0.38 thf(more,type,
% 0.17/0.38 more: nat > nat > $o ).
% 0.17/0.38
% 0.17/0.38 thf(pl,type,
% 0.17/0.38 pl: nat > nat > nat ).
% 0.17/0.38
% 0.17/0.38 thf(m,axiom,
% 0.17/0.38 more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ).
% 0.17/0.38
% 0.17/0.38 thf(et,axiom,
% 0.17/0.38 ! [Xa: $o] :
% 0.17/0.38 ( ~ ~ Xa
% 0.17/0.38 => Xa ) ).
% 0.17/0.38
% 0.17/0.38 thf(less,type,
% 0.17/0.38 less: nat > nat > $o ).
% 0.17/0.38
% 0.17/0.38 thf(satz10b,axiom,
% 0.17/0.38 ! [Xx: nat,Xy: nat] :
% 0.17/0.38 ~ ( ( ( Xx = Xy )
% 0.17/0.38 => ~ ( more @ Xx @ Xy ) )
% 0.17/0.38 => ~ ~ ( ( ( more @ Xx @ Xy )
% 0.17/0.38 => ~ ( less @ Xx @ Xy ) )
% 0.17/0.38 => ~ ( ( less @ Xx @ Xy )
% 0.17/0.38 => ( Xx != Xy ) ) ) ) ).
% 0.17/0.38
% 0.17/0.38 thf(satz19b,axiom,
% 0.17/0.38 ! [Xx: nat,Xy: nat,Xz: nat] :
% 0.17/0.38 ( ( Xx = Xy )
% 0.17/0.38 => ( ( pl @ Xx @ Xz )
% 0.17/0.38 = ( pl @ Xy @ Xz ) ) ) ).
% 0.17/0.38
% 0.17/0.38 thf(satz19c,axiom,
% 0.17/0.38 ! [Xx: nat,Xy: nat,Xz: nat] :
% 0.17/0.38 ( ( less @ Xx @ Xy )
% 0.17/0.38 => ( less @ ( pl @ Xx @ Xz ) @ ( pl @ Xy @ Xz ) ) ) ).
% 0.17/0.38
% 0.17/0.38 thf(satz10a,axiom,
% 0.17/0.38 ! [Xx: nat,Xy: nat] :
% 0.17/0.38 ( ( Xx != Xy )
% 0.17/0.38 => ( ~ ( more @ Xx @ Xy )
% 0.17/0.38 => ( less @ Xx @ Xy ) ) ) ).
% 0.17/0.38
% 0.17/0.38 thf(satz20a,conjecture,
% 0.17/0.38 more @ x @ y ).
% 0.17/0.38
% 0.17/0.38 %------------------------------------------------------------------------------
% 0.17/0.38 ------------------------
% 1.38/1.28 ---- Embedded in THF ---
% 1.38/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.38/1.28 %%% Generated on Tue Feb 24 11:10:16 EST 2026
% 1.38/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.38/1.28 %%% Logic specification used:
% 1.38/1.28 %%% thf(spec, logic, $$dhol).
% 1.38/1.28
% 1.38/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2DTF28852.p
% See solution above
% 1.38/1.28 ------------------------
% 1.38/1.29 ---- Cleaned THF ---
% 1.38/1.29 thf(nat_type,type,
% 1.38/1.29 nat: $tType ).
% 1.38/1.29
% 1.38/1.29 thf(x,type,
% 1.38/1.29 x: nat ).
% 1.38/1.29
% 1.38/1.29 thf(y,type,
% 1.38/1.29 y: nat ).
% 1.38/1.29
% 1.38/1.29 thf(z,type,
% 1.38/1.29 z: nat ).
% 1.38/1.29
% 1.38/1.29 thf(more,type,
% 1.38/1.29 more: nat > nat > $o ).
% 1.38/1.29
% 1.38/1.29 thf(pl,type,
% 1.38/1.29 pl: nat > nat > nat ).
% 1.38/1.29
% 1.38/1.29 thf(m,axiom,
% 1.38/1.29 more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ).
% 1.38/1.29
% 1.38/1.29 thf(et,axiom,
% 1.38/1.29 ! [Xa: $o] :
% 1.38/1.29 ( ~ ~ Xa
% 1.38/1.29 => Xa ) ).
% 1.38/1.29
% 1.38/1.29 thf(less,type,
% 1.38/1.29 less: nat > nat > $o ).
% 1.38/1.29
% 1.38/1.29 thf(satz10b,axiom,
% 1.38/1.29 ! [Xx: nat,Xy: nat] :
% 1.38/1.29 ~ ( ( ( Xx = Xy )
% 1.38/1.29 => ~ ( more @ Xx @ Xy ) )
% 1.38/1.29 => ~ ~ ( ( ( more @ Xx @ Xy )
% 1.38/1.29 => ~ ( less @ Xx @ Xy ) )
% 1.38/1.29 => ~ ( ( less @ Xx @ Xy )
% 1.38/1.29 => ( Xx != Xy ) ) ) ) ).
% 1.38/1.29
% 1.38/1.29 thf(satz19b,axiom,
% 1.38/1.29 ! [Xx: nat,Xy: nat,Xz: nat] :
% 1.38/1.29 ( ( Xx = Xy )
% 1.38/1.29 => ( ( pl @ Xx @ Xz )
% 1.38/1.29 = ( pl @ Xy @ Xz ) ) ) ).
% 1.38/1.29
% 1.38/1.29 thf(satz19c,axiom,
% 1.38/1.29 ! [Xx: nat,Xy: nat,Xz: nat] :
% 1.38/1.29 ( ( less @ Xx @ Xy )
% 1.38/1.29 => ( less @ ( pl @ Xx @ Xz ) @ ( pl @ Xy @ Xz ) ) ) ).
% 1.38/1.29
% 1.38/1.29 thf(satz10a,axiom,
% 1.38/1.29 ! [Xx: nat,Xy: nat] :
% 1.38/1.29 ( ( Xx != Xy )
% 1.38/1.29 => ( ~ ( more @ Xx @ Xy )
% 1.38/1.29 => ( less @ Xx @ Xy ) ) ) ).
% 1.38/1.29
% 1.38/1.29 thf(satz20a,conjecture,
% 1.38/1.29 more @ x @ y ).
% 1.38/1.29 ------------------------
% 1.56/1.31 % (28952)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_28852 for (2999ds/2Mi)
% 1.56/1.31 % (28955)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_28852 for (2999ds/18Mi)
% 1.56/1.31 % (28951)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_28852 for (2999ds/27Mi)
% 1.56/1.31 % (28954)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_28852 for (2999ds/275Mi)
% 1.56/1.31 % (28950)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_28852 for (2999ds/4Mi)
% 1.56/1.31 % (28949)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_28852 for (2999ds/183Mi)
% 1.56/1.31 % (28953)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_28852 for (2999ds/2Mi)
% 1.56/1.31 % (28953)Instruction limit reached!
% 1.56/1.31 % (28953)------------------------------
% 1.56/1.31 % (28953)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.31 % (28953)Termination reason: Unknown
% 1.56/1.31 % (28953)Termination phase: Property scanning
% 1.56/1.31
% 1.56/1.31 % (28953)Memory used [KB]: 895
% 1.56/1.31 % (28953)Time elapsed: 0.002 s
% 1.56/1.31 % (28953)Instructions burned: 2 (million)
% 1.56/1.31 % (28953)------------------------------
% 1.56/1.31 % (28953)------------------------------
% 1.56/1.31 % (28954)Refutation not found, incomplete strategy
% 1.56/1.31 % (28954)------------------------------
% 1.56/1.31 % (28954)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.31 % (28954)Termination reason: Refutation not found, incomplete strategy
% 1.56/1.31
% 1.56/1.31
% 1.56/1.31 % (28954)Memory used [KB]: 5373
% 1.56/1.31 % (28954)Time elapsed: 0.003 s
% 1.56/1.31 % (28954)Instructions burned: 1 (million)
% 1.56/1.31 % (28954)------------------------------
% 1.56/1.31 % (28954)------------------------------
% 1.56/1.31 % (28950)Instruction limit reached!
% 1.56/1.31 % (28950)------------------------------
% 1.56/1.31 % (28950)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.31 % (28950)Termination reason: Unknown
% 1.56/1.31 % (28952)Instruction limit reached!
% 1.56/1.31 % (28952)------------------------------
% 1.56/1.31 % (28952)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.31 % (28952)Termination reason: Unknown
% 1.56/1.31 % (28952)Termination phase: Saturation
% 1.56/1.31
% 1.56/1.31 % (28952)Memory used [KB]: 895
% 1.56/1.31 % (28952)Time elapsed: 0.003 s
% 1.56/1.31 % (28952)Instructions burned: 2 (million)
% 1.56/1.31 % (28952)------------------------------
% 1.56/1.31 % (28952)------------------------------
% 1.56/1.31 % (28950)Termination phase: Saturation
% 1.56/1.31
% 1.56/1.31 % (28950)Memory used [KB]: 5500
% 1.56/1.31 % (28950)Time elapsed: 0.004 s
% 1.56/1.31 % (28950)Instructions burned: 4 (million)
% 1.56/1.31 % (28950)------------------------------
% 1.56/1.31 % (28950)------------------------------
% 1.56/1.31 % (28949)First to succeed.
% 1.56/1.31 % (28951)Also succeeded, but the first one will report.
% 1.56/1.32 % (28949)Refutation found. Thanks to Tanya!
% 1.56/1.32 % SZS status Theorem for DTF2THF_28852
% 1.56/1.32 % SZS output start Proof for DTF2THF_28852
% 1.56/1.32 thf(type_def_5, type, nat: $tType).
% 1.56/1.32 thf(func_def_0, type, nat: $tType).
% 1.56/1.32 thf(func_def_1, type, x: nat).
% 1.56/1.32 thf(func_def_2, type, y: nat).
% 1.56/1.32 thf(func_def_3, type, z: nat).
% 1.56/1.32 thf(func_def_4, type, more: nat > nat > $o).
% 1.56/1.32 thf(func_def_5, type, pl: nat > nat > nat).
% 1.56/1.32 thf(func_def_7, type, less: nat > nat > $o).
% 1.56/1.32 thf(f62,plain,(
% 1.56/1.32 $false),
% 1.56/1.32 inference(subsumption_resolution,[status(thm)],[f60,f45])).
% 1.56/1.32 thf(f45,plain,(
% 1.56/1.32 ( ! [X1 : nat] : (($true != (more @ X1 @ X1))) )),
% 1.56/1.32 inference(equality_resolution,[status(thm)],[f39])).
% 1.56/1.32 thf(f39,plain,(
% 1.56/1.32 ( ! [X0 : nat,X1 : nat] : ((X0 != X1) | ((more @ X1 @ X0) != $true)) )),
% 1.56/1.32 inference(cnf_transformation,[status(thm)],[f32])).
% 1.56/1.32 thf(f32,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : (((X0 != X1) | ((more @ X1 @ X0) != $true)) & (((more @ X1 @ X0) != $true) | ((less @ X1 @ X0) != $true)) & ((X0 != X1) | ((less @ X1 @ X0) != $true)))),
% 1.56/1.32 inference(flattening,[status(thm)],[f31])).
% 1.56/1.32 thf(f31,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ((((X0 != X1) | ((less @ X1 @ X0) != $true)) & (((more @ X1 @ X0) != $true) | ((less @ X1 @ X0) != $true))) & ((X0 != X1) | ((more @ X1 @ X0) != $true)))),
% 1.56/1.32 inference(ennf_transformation,[status(thm)],[f24])).
% 1.56/1.32 thf(f24,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ~(((X0 = X1) => ((more @ X1 @ X0) != $true)) => ((((more @ X1 @ X0) = $true) => ((less @ X1 @ X0) != $true)) => ~(((less @ X1 @ X0) = $true) => (X0 != X1))))),
% 1.56/1.32 inference(flattening,[status(thm)],[f15])).
% 1.56/1.32 thf(f15,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ~(((X0 = X1) => ~((more @ X1 @ X0) = $true)) => ~~((((more @ X1 @ X0) = $true) => ~((less @ X1 @ X0) = $true)) => ~(((less @ X1 @ X0) = $true) => (X0 != X1))))),
% 1.56/1.32 inference(fool_elimination,[status(thm)],[f14])).
% 1.56/1.32 thf(f14,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ~(((X0 = X1) => ~(more @ X1 @ X0)) => ~~(((more @ X1 @ X0) => ~(less @ X1 @ X0)) => ~((less @ X1 @ X0) => (X0 != X1))))),
% 1.56/1.32 inference(rectify,[status(thm)],[f3])).
% 1.56/1.32 thf(f3,axiom,(
% 1.56/1.32 ! [X2 : nat,X1 : nat] : ~(((X1 = X2) => ~(more @ X1 @ X2)) => ~~(((more @ X1 @ X2) => ~(less @ X1 @ X2)) => ~((less @ X1 @ X2) => (X1 != X2))))),
% 1.56/1.32 file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',satz10b)).
% 1.56/1.32 thf(f60,plain,(
% 1.56/1.32 ($true = (more @ (pl @ x @ z) @ (pl @ x @ z)))),
% 1.56/1.32 inference(superposition,[status(thm)],[f41,f58])).
% 1.56/1.32 thf(f58,plain,(
% 1.56/1.32 (x = y)),
% 1.56/1.32 inference(subsumption_resolution,[status(thm)],[f57,f36])).
% 1.56/1.32 thf(f36,plain,(
% 1.56/1.32 ((more @ x @ y) != $true)),
% 1.56/1.32 inference(cnf_transformation,[status(thm)],[f26])).
% 1.56/1.32 thf(f26,plain,(
% 1.56/1.32 ((more @ x @ y) != $true)),
% 1.56/1.32 inference(flattening,[status(thm)],[f21])).
% 1.56/1.32 thf(f21,plain,(
% 1.56/1.32 ~((more @ x @ y) = $true)),
% 1.56/1.32 inference(fool_elimination,[status(thm)],[f20])).
% 1.56/1.32 thf(f20,plain,(
% 1.56/1.32 ~(more @ x @ y)),
% 1.56/1.32 inference(rectify,[status(thm)],[f8])).
% 1.56/1.32 thf(f8,negated_conjecture,(
% 1.56/1.32 ~(more @ x @ y)),
% 1.56/1.32 inference(negated_conjecture,[status(cth)],[f7])).
% 1.56/1.32 thf(f7,conjecture,(
% 1.56/1.32 (more @ x @ y)),
% 1.56/1.32 file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',satz20a)).
% 1.56/1.32 thf(f57,plain,(
% 1.56/1.32 ((more @ x @ y) = $true) | (x = y)),
% 1.56/1.32 inference(trivial_inequality_removal,[status(thm)],[f56])).
% 1.56/1.32 thf(f56,plain,(
% 1.56/1.32 (x = y) | ($true != $true) | ((more @ x @ y) = $true)),
% 1.56/1.32 inference(superposition,[status(thm)],[f55,f43])).
% 1.56/1.32 thf(f43,plain,(
% 1.56/1.32 ( ! [X0 : nat,X1 : nat] : (((less @ X1 @ X0) = $true) | ((more @ X1 @ X0) = $true) | (X0 = X1)) )),
% 1.56/1.32 inference(cnf_transformation,[status(thm)],[f29])).
% 1.56/1.32 thf(f29,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ((X0 = X1) | ((less @ X1 @ X0) = $true) | ((more @ X1 @ X0) = $true))),
% 1.56/1.32 inference(flattening,[status(thm)],[f28])).
% 1.56/1.32 thf(f28,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ((((less @ X1 @ X0) = $true) | ((more @ X1 @ X0) = $true)) | (X0 = X1))),
% 1.56/1.32 inference(ennf_transformation,[status(thm)],[f22])).
% 1.56/1.32 thf(f22,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ((X0 != X1) => (((more @ X1 @ X0) != $true) => ((less @ X1 @ X0) = $true)))),
% 1.56/1.32 inference(flattening,[status(thm)],[f11])).
% 1.56/1.32 thf(f11,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ((X0 != X1) => (~((more @ X1 @ X0) = $true) => ((less @ X1 @ X0) = $true)))),
% 1.56/1.32 inference(fool_elimination,[status(thm)],[f10])).
% 1.56/1.32 thf(f10,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat] : ((X0 != X1) => (~(more @ X1 @ X0) => (less @ X1 @ X0)))),
% 1.56/1.32 inference(rectify,[status(thm)],[f6])).
% 1.56/1.32 thf(f6,axiom,(
% 1.56/1.32 ! [X2 : nat,X1 : nat] : ((X1 != X2) => (~(more @ X1 @ X2) => (less @ X1 @ X2)))),
% 1.56/1.32 file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',satz10a)).
% 1.56/1.32 thf(f55,plain,(
% 1.56/1.32 ((less @ x @ y) != $true)),
% 1.56/1.32 inference(trivial_inequality_removal,[status(thm)],[f54])).
% 1.56/1.32 thf(f54,plain,(
% 1.56/1.32 ($true != $true) | ((less @ x @ y) != $true)),
% 1.56/1.32 inference(superposition,[status(thm)],[f53,f41])).
% 1.56/1.32 thf(f53,plain,(
% 1.56/1.32 ( ! [X2 : nat,X0 : nat,X1 : nat] : (((more @ (pl @ X0 @ X1) @ (pl @ X2 @ X1)) != $true) | ($true != (less @ X0 @ X2))) )),
% 1.56/1.32 inference(trivial_inequality_removal,[status(thm)],[f51])).
% 1.56/1.32 thf(f51,plain,(
% 1.56/1.32 ( ! [X2 : nat,X0 : nat,X1 : nat] : (($true != $true) | ($true != (less @ X0 @ X2)) | ((more @ (pl @ X0 @ X1) @ (pl @ X2 @ X1)) != $true)) )),
% 1.56/1.32 inference(superposition,[status(thm)],[f38,f40])).
% 1.56/1.32 thf(f40,plain,(
% 1.56/1.32 ( ! [X2 : nat,X0 : nat,X1 : nat] : (($true = (less @ (pl @ X0 @ X1) @ (pl @ X2 @ X1))) | ($true != (less @ X0 @ X2))) )),
% 1.56/1.32 inference(cnf_transformation,[status(thm)],[f34])).
% 1.56/1.32 thf(f34,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat,X2 : nat] : (($true != (less @ X0 @ X2)) | ($true = (less @ (pl @ X0 @ X1) @ (pl @ X2 @ X1))))),
% 1.56/1.32 inference(rectify,[status(thm)],[f27])).
% 1.56/1.32 thf(f27,plain,(
% 1.56/1.32 ! [X2 : nat,X0 : nat,X1 : nat] : (((less @ X2 @ X1) != $true) | ((less @ (pl @ X2 @ X0) @ (pl @ X1 @ X0)) = $true))),
% 1.56/1.32 inference(ennf_transformation,[status(thm)],[f17])).
% 1.56/1.32 thf(f17,plain,(
% 1.56/1.32 ! [X2 : nat,X0 : nat,X1 : nat] : (((less @ X2 @ X1) = $true) => ((less @ (pl @ X2 @ X0) @ (pl @ X1 @ X0)) = $true))),
% 1.56/1.32 inference(fool_elimination,[status(thm)],[f16])).
% 1.56/1.32 thf(f16,plain,(
% 1.56/1.32 ! [X0 : nat,X1 : nat,X2 : nat] : ((less @ X2 @ X1) => (less @ (pl @ X2 @ X0) @ (pl @ X1 @ X0)))),
% 1.56/1.32 inference(rectify,[status(thm)],[f5])).
% 1.56/1.32 thf(f5,axiom,(
% 1.56/1.32 ! [X3 : nat,X2 : nat,X1 : nat] : ((less @ X1 @ X2) => (less @ (pl @ X1 @ X3) @ (pl @ X2 @ X3)))),
% 1.56/1.32 file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',satz19c)).
% 1.56/1.32 thf(f38,plain,(
% 1.56/1.32 ( ! [X0 : nat,X1 : nat] : (((less @ X1 @ X0) != $true) | ((more @ X1 @ X0) != $true)) )),
% 1.56/1.32 inference(cnf_transformation,[status(thm)],[f32])).
% 1.56/1.32 thf(f41,plain,(
% 1.56/1.32 ((more @ (pl @ x @ z) @ (pl @ y @ z)) = $true)),
% 1.56/1.32 inference(cnf_transformation,[status(thm)],[f19])).
% 1.56/1.32 thf(f19,plain,(
% 1.56/1.32 ((more @ (pl @ x @ z) @ (pl @ y @ z)) = $true)),
% 1.56/1.32 inference(fool_elimination,[status(thm)],[f18])).
% 1.56/1.32 thf(f18,plain,(
% 1.56/1.32 (more @ (pl @ x @ z) @ (pl @ y @ z))),
% 1.56/1.32 inference(rectify,[status(thm)],[f1])).
% 1.56/1.32 thf(f1,axiom,(
% 1.56/1.32 (more @ (pl @ x @ z) @ (pl @ y @ z))),
% 1.56/1.32 file('/export/starexec/sandbox/tmp/tmp.ePvsRzc2eq/DTF2THF_28852.p',m)).
% 1.56/1.32 % SZS output end Proof for DTF2THF_28852
% 1.56/1.32 % (28949)------------------------------
% 1.56/1.32 % (28949)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.32 % (28949)Termination reason: Refutation
% 1.56/1.32
% 1.56/1.32 % (28949)Memory used [KB]: 5500
% 1.56/1.32 % (28949)Time elapsed: 0.005 s
% 1.56/1.32 % (28949)Instructions burned: 5 (million)
% 1.56/1.32 % (28949)------------------------------
% 1.56/1.32 % (28949)------------------------------
% 1.56/1.32 % (28948)Success in time 0.019 s
%------------------------------------------------------------------------------