%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM738^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 : n014.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:28 AM UTC 2026
% Result : Theorem 1.61s 1.32s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 224 ( 66 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 262 ( 45 ~; 30 |; 0 &; 172 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 58 ( 0 ^; 58 !; 0 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
frac: $tType ).
thf(func_def_0,type,
frac: $tType ).
thf(func_def_1,type,
x: frac ).
thf(func_def_2,type,
y: frac ).
thf(func_def_3,type,
z: frac ).
thf(func_def_4,type,
u: frac ).
thf(func_def_5,type,
lessf: frac > frac > $o ).
thf(func_def_7,type,
eq: frac > frac > $o ).
thf(func_def_8,type,
moref: frac > frac > $o ).
thf(f52,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f51,f36]) ).
thf(f36,plain,
( ( lessf @ x @ y )
= $true ),
inference(cnf_transformation,[status(thm)],[f21]) ).
thf(f21,plain,
( ( lessf @ x @ y )
= $true ),
inference(fool_elimination,[status(thm)],[f20]) ).
thf(f20,plain,
lessf @ x @ y,
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
lessf @ x @ y,
file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',l) ).
thf(f51,plain,
( ( lessf @ x @ y )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f50]) ).
thf(f50,plain,
( ( ( lessf @ x @ y )
!= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f48,f37]) ).
thf(f37,plain,
( ( eq @ x @ z )
= $true ),
inference(cnf_transformation,[status(thm)],[f19]) ).
thf(f19,plain,
( ( eq @ x @ z )
= $true ),
inference(fool_elimination,[status(thm)],[f18]) ).
thf(f18,plain,
eq @ x @ z,
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
eq @ x @ z,
file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',e) ).
thf(f48,plain,
! [X0: frac] :
( ( $true
!= ( eq @ X0 @ z ) )
| ( ( lessf @ X0 @ y )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f47]) ).
thf(f47,plain,
! [X0: frac] :
( ( $true
!= ( eq @ X0 @ z ) )
| ( $true != $true )
| ( ( lessf @ X0 @ y )
!= $true ) ),
inference(superposition,[status(thm)],[f45,f32]) ).
thf(f32,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X1 @ X0 )
= $true )
| ( ( lessf @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
thf(f30,plain,
! [X0: frac,X1: frac] :
( ( ( lessf @ X0 @ X1 )
!= $true )
| ( ( moref @ X1 @ X0 )
= $true ) ),
inference(rectify,[status(thm)],[f25]) ).
thf(f25,plain,
! [X1: frac,X0: frac] :
( ( ( lessf @ X1 @ X0 )
!= $true )
| ( ( moref @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
! [X1: frac,X0: frac] :
( ( ( lessf @ X1 @ X0 )
= $true )
=> ( ( moref @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f14]) ).
thf(f14,plain,
! [X0: frac,X1: frac] :
( ( lessf @ X1 @ X0 )
=> ( moref @ X0 @ X1 ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,axiom,
! [X1: frac,X0: frac] :
( ( lessf @ X0 @ X1 )
=> ( moref @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',satz43) ).
thf(f45,plain,
! [X0: frac] :
( ( $true
!= ( moref @ y @ X0 ) )
| ( $true
!= ( eq @ X0 @ z ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f44]) ).
thf(f44,plain,
! [X0: frac] :
( ( $true
!= ( eq @ X0 @ z ) )
| ( $true
!= ( moref @ y @ X0 ) )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f43,f35]) ).
thf(f35,plain,
( ( eq @ y @ u )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ( eq @ y @ u )
= $true ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
eq @ y @ u,
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
eq @ y @ u,
file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',f) ).
thf(f43,plain,
! [X0: frac,X1: frac] :
( ( $true
!= ( eq @ X1 @ u ) )
| ( ( moref @ X1 @ X0 )
!= $true )
| ( $true
!= ( eq @ X0 @ z ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f42]) ).
thf(f42,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X1 @ X0 )
!= $true )
| ( $true
!= ( eq @ X0 @ z ) )
| ( $true
!= ( eq @ X1 @ u ) )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f39,f31]) ).
thf(f31,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ X1 @ X3 )
= $true )
| ( $true
!= ( eq @ X2 @ X3 ) )
| ( ( eq @ X0 @ X1 )
!= $true )
| ( ( moref @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f29]) ).
thf(f29,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( moref @ X1 @ X3 )
= $true )
| ( ( eq @ X0 @ X1 )
!= $true )
| ( ( moref @ X0 @ X2 )
!= $true )
| ( $true
!= ( eq @ X2 @ X3 ) ) ),
inference(rectify,[status(thm)],[f27]) ).
thf(f27,plain,
! [X0: frac,X1: frac,X3: frac,X2: frac] :
( ( $true
= ( moref @ X1 @ X2 ) )
| ( ( eq @ X0 @ X1 )
!= $true )
| ( $true
!= ( moref @ X0 @ X3 ) )
| ( ( eq @ X3 @ X2 )
!= $true ) ),
inference(flattening,[status(thm)],[f26]) ).
thf(f26,plain,
! [X3: frac,X1: frac,X0: frac,X2: frac] :
( ( $true
= ( moref @ X1 @ X2 ) )
| ( ( eq @ X3 @ X2 )
!= $true )
| ( ( eq @ X0 @ X1 )
!= $true )
| ( $true
!= ( moref @ X0 @ X3 ) ) ),
inference(ennf_transformation,[status(thm)],[f23]) ).
thf(f23,plain,
! [X3: frac,X1: frac,X0: frac,X2: frac] :
( ( $true
= ( moref @ X0 @ X3 ) )
=> ( ( ( eq @ X0 @ X1 )
= $true )
=> ( ( ( eq @ X3 @ X2 )
= $true )
=> ( $true
= ( moref @ X1 @ X2 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f22]) ).
thf(f22,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X0 @ X3 )
=> ( ( eq @ X0 @ X1 )
=> ( ( eq @ X3 @ X2 )
=> ( moref @ X1 @ X2 ) ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,axiom,
! [X0: frac,X2: frac,X3: frac,X1: frac] :
( ( moref @ X0 @ X1 )
=> ( ( eq @ X0 @ X2 )
=> ( ( eq @ X1 @ X3 )
=> ( moref @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',satz44) ).
thf(f39,plain,
( $true
!= ( moref @ u @ z ) ),
inference(trivial_inequality_removal,[status(thm)],[f38]) ).
thf(f38,plain,
( ( $true != $true )
| ( $true
!= ( moref @ u @ z ) ) ),
inference(superposition,[status(thm)],[f33,f34]) ).
thf(f34,plain,
! [X0: frac,X1: frac] :
( ( ( lessf @ X1 @ X0 )
= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f28]) ).
thf(f28,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
!= $true )
| ( ( lessf @ X1 @ X0 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
! [X0: frac,X1: frac] :
( ( ( moref @ X0 @ X1 )
= $true )
=> ( ( lessf @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f12]) ).
thf(f12,plain,
! [X0: frac,X1: frac] :
( ( moref @ X0 @ X1 )
=> ( lessf @ X1 @ X0 ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,axiom,
! [X0: frac,X1: frac] :
( ( moref @ X0 @ X1 )
=> ( lessf @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',satz42) ).
thf(f33,plain,
( ( lessf @ z @ u )
!= $true ),
inference(cnf_transformation,[status(thm)],[f24]) ).
thf(f24,plain,
( ( lessf @ z @ u )
!= $true ),
inference(flattening,[status(thm)],[f17]) ).
thf(f17,plain,
( ( lessf @ z @ u )
!= $true ),
inference(fool_elimination,[status(thm)],[f16]) ).
thf(f16,plain,
~ ( lessf @ z @ u ),
inference(rectify,[status(thm)],[f8]) ).
thf(f8,negated_conjecture,
~ ( lessf @ z @ u ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f7,conjecture,
lessf @ z @ u,
file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',satz45) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM738^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 : n014.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:12:27 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.19/0.46 ---- Original DTF file ---
% 0.19/0.46 thf(spec,logic,$$dhol).
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 % File : NUM738^1 : TPTP v9.2.1. Released v3.7.0.
% 0.19/0.46 % Domain : Number Theory
% 0.19/0.46 % Problem : Landau theorem 45
% 0.19/0.46 % Version : Especial.
% 0.19/0.46 % English : lessf z u
% 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 : satz45 [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 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.1, 0.33 v4.0.0, 0.00 v3.7.0
% 0.19/0.46 % Syntax : Number of formulae : 15 ( 4 unt; 8 typ; 0 def)
% 0.19/0.46 % Number of atoms : 12 ( 0 equ; 0 cnn)
% 0.19/0.46 % Maximal formula atoms : 4 ( 1 avg)
% 0.19/0.46 % Number of connectives : 29 ( 0 ~; 0 |; 0 &; 24 @)
% 0.19/0.46 % ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% 0.19/0.46 % Maximal formula depth : 10 ( 5 avg)
% 0.19/0.46 % Number of types : 2 ( 1 usr)
% 0.19/0.46 % Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% 0.19/0.46 % Number of symbols : 7 ( 7 usr; 4 con; 0-2 aty)
% 0.19/0.46 % Number of variables : 8 ( 0 ^; 8 !; 0 ?; 8 :)
% 0.19/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.19/0.46
% 0.19/0.46 % Comments :
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 thf(frac_type,type,
% 0.19/0.46 frac: $tType ).
% 0.19/0.46
% 0.19/0.46 thf(x,type,
% 0.19/0.46 x: frac ).
% 0.19/0.46
% 0.19/0.46 thf(y,type,
% 0.19/0.46 y: frac ).
% 0.19/0.46
% 0.19/0.46 thf(z,type,
% 0.19/0.46 z: frac ).
% 0.19/0.46
% 0.19/0.46 thf(u,type,
% 0.19/0.46 u: frac ).
% 0.19/0.46
% 0.19/0.46 thf(lessf,type,
% 0.19/0.46 lessf: frac > frac > $o ).
% 0.19/0.46
% 0.19/0.46 thf(l,axiom,
% 0.19/0.46 lessf @ x @ y ).
% 0.19/0.46
% 0.19/0.46 thf(eq,type,
% 0.19/0.46 eq: frac > frac > $o ).
% 0.19/0.46
% 0.19/0.46 thf(e,axiom,
% 0.19/0.46 eq @ x @ z ).
% 0.19/0.46
% 0.19/0.46 thf(f,axiom,
% 0.19/0.46 eq @ y @ u ).
% 0.19/0.46
% 0.19/0.46 thf(moref,type,
% 0.19/0.46 moref: frac > frac > $o ).
% 0.19/0.46
% 0.19/0.46 thf(satz42,axiom,
% 0.19/0.46 ! [Xx: frac,Xy: frac] :
% 0.19/0.46 ( ( moref @ Xx @ Xy )
% 0.19/0.46 => ( lessf @ Xy @ Xx ) ) ).
% 0.19/0.46
% 0.19/0.46 thf(satz44,axiom,
% 0.19/0.46 ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
% 0.19/0.46 ( ( moref @ Xx @ Xy )
% 0.19/0.46 => ( ( eq @ Xx @ Xz )
% 0.19/0.46 => ( ( eq @ Xy @ Xu )
% 0.19/0.46 => ( moref @ Xz @ Xu ) ) ) ) ).
% 0.19/0.46
% 0.19/0.46 thf(satz43,axiom,
% 0.19/0.46 ! [Xx: frac,Xy: frac] :
% 0.19/0.46 ( ( lessf @ Xx @ Xy )
% 0.19/0.46 => ( moref @ Xy @ Xx ) ) ).
% 0.19/0.46
% 0.19/0.46 thf(satz45,conjecture,
% 0.19/0.46 lessf @ z @ u ).
% 0.19/0.46
% 0.19/0.46 %------------------------------------------------------------------------------
% 0.19/0.46 ------------------------
% 1.46/1.27 ---- Embedded in THF ---
% 1.46/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.46/1.28 %%% Generated on Tue Feb 24 11:12:28 EST 2026
% 1.46/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.46/1.28 %%% Logic specification used:
% 1.46/1.28 %%% thf(spec, logic, $$dhol).
% 1.46/1.28
% 1.46/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2DTF20831.p
% See solution above
% 1.46/1.28 ------------------------
% 1.46/1.29 ---- Cleaned THF ---
% 1.46/1.29 thf(frac_type,type,
% 1.46/1.29 frac: $tType ).
% 1.46/1.29
% 1.46/1.29 thf(x,type,
% 1.46/1.29 x: frac ).
% 1.46/1.29
% 1.46/1.29 thf(y,type,
% 1.46/1.29 y: frac ).
% 1.46/1.29
% 1.46/1.29 thf(z,type,
% 1.46/1.29 z: frac ).
% 1.46/1.29
% 1.46/1.29 thf(u,type,
% 1.46/1.29 u: frac ).
% 1.46/1.29
% 1.46/1.29 thf(lessf,type,
% 1.46/1.29 lessf: frac > frac > $o ).
% 1.46/1.29
% 1.46/1.29 thf(l,axiom,
% 1.46/1.29 lessf @ x @ y ).
% 1.46/1.29
% 1.46/1.29 thf(eq,type,
% 1.46/1.29 eq: frac > frac > $o ).
% 1.46/1.29
% 1.46/1.29 thf(e,axiom,
% 1.46/1.29 eq @ x @ z ).
% 1.46/1.29
% 1.46/1.29 thf(f,axiom,
% 1.46/1.29 eq @ y @ u ).
% 1.46/1.29
% 1.46/1.29 thf(moref,type,
% 1.46/1.29 moref: frac > frac > $o ).
% 1.46/1.29
% 1.46/1.29 thf(satz42,axiom,
% 1.46/1.29 ! [Xx: frac,Xy: frac] :
% 1.46/1.29 ( ( moref @ Xx @ Xy )
% 1.46/1.29 => ( lessf @ Xy @ Xx ) ) ).
% 1.46/1.29
% 1.46/1.29 thf(satz44,axiom,
% 1.46/1.29 ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
% 1.46/1.29 ( ( moref @ Xx @ Xy )
% 1.46/1.29 => ( ( eq @ Xx @ Xz )
% 1.46/1.29 => ( ( eq @ Xy @ Xu )
% 1.46/1.29 => ( moref @ Xz @ Xu ) ) ) ) ).
% 1.46/1.29
% 1.46/1.29 thf(satz43,axiom,
% 1.46/1.29 ! [Xx: frac,Xy: frac] :
% 1.46/1.29 ( ( lessf @ Xx @ Xy )
% 1.46/1.29 => ( moref @ Xy @ Xx ) ) ).
% 1.46/1.29
% 1.46/1.29 thf(satz45,conjecture,
% 1.46/1.29 lessf @ z @ u ).
% 1.46/1.29 ------------------------
% 1.61/1.30 % (21024)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_20831 for (2999ds/2Mi)
% 1.61/1.30 % (21021)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_20831 for (2999ds/4Mi)
% 1.61/1.30 % (21024)Instruction limit reached!
% 1.61/1.30 % (21024)------------------------------
% 1.61/1.30 % (21024)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.30 % (21024)Termination reason: Unknown
% 1.61/1.30 % (21024)Termination phase: Saturation
% 1.61/1.30
% 1.61/1.30 % (21024)Memory used [KB]: 5500
% 1.61/1.30 % (21024)Time elapsed: 0.002 s
% 1.61/1.30 % (21024)Instructions burned: 3 (million)
% 1.61/1.30 % (21024)------------------------------
% 1.61/1.30 % (21024)------------------------------
% 1.61/1.30 % (21021)Instruction limit reached!
% 1.61/1.30 % (21021)------------------------------
% 1.61/1.30 % (21021)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.30 % (21021)Termination reason: Unknown
% 1.61/1.30 % (21021)Termination phase: Saturation
% 1.61/1.30
% 1.61/1.30 % (21021)Memory used [KB]: 5500
% 1.61/1.30 % (21021)Time elapsed: 0.003 s
% 1.61/1.30 % (21021)Instructions burned: 4 (million)
% 1.61/1.30 % (21021)------------------------------
% 1.61/1.30 % (21021)------------------------------
% 1.61/1.31 % (21020)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_20831 for (2999ds/183Mi)
% 1.61/1.31 % (21022)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_20831 for (2999ds/27Mi)
% 1.61/1.31 % (21023)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_20831 for (2999ds/2Mi)
% 1.61/1.31 % (21023)Instruction limit reached!
% 1.61/1.31 % (21023)------------------------------
% 1.61/1.31 % (21023)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.31 % (21023)Termination reason: Unknown
% 1.61/1.31 % (21023)Termination phase: Saturation
% 1.61/1.31
% 1.61/1.31 % (21023)Memory used [KB]: 5373
% 1.61/1.31 % (21023)Time elapsed: 0.002 s
% 1.61/1.31 % (21023)Instructions burned: 2 (million)
% 1.61/1.31 % (21023)------------------------------
% 1.61/1.31 % (21023)------------------------------
% 1.61/1.31 % (21020)First to succeed.
% 1.61/1.31 % (21022)Also succeeded, but the first one will report.
% 1.61/1.31 % (21029)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on DTF2THF_20831 for (2999ds/37Mi)
% 1.61/1.32 % (21025)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_20831 for (2999ds/275Mi)
% 1.61/1.32 % (21020)Refutation found. Thanks to Tanya!
% 1.61/1.32 % SZS status Theorem for DTF2THF_20831
% 1.61/1.32 % SZS output start Proof for DTF2THF_20831
% 1.61/1.32 thf(type_def_5, type, frac: $tType).
% 1.61/1.32 thf(func_def_0, type, frac: $tType).
% 1.61/1.32 thf(func_def_1, type, x: frac).
% 1.61/1.32 thf(func_def_2, type, y: frac).
% 1.61/1.32 thf(func_def_3, type, z: frac).
% 1.61/1.32 thf(func_def_4, type, u: frac).
% 1.61/1.32 thf(func_def_5, type, lessf: frac > frac > $o).
% 1.61/1.32 thf(func_def_7, type, eq: frac > frac > $o).
% 1.61/1.32 thf(func_def_8, type, moref: frac > frac > $o).
% 1.61/1.32 thf(f52,plain,(
% 1.61/1.32 $false),
% 1.61/1.32 inference(subsumption_resolution,[status(thm)],[f51,f36])).
% 1.61/1.32 thf(f36,plain,(
% 1.61/1.32 ((lessf @ x @ y) = $true)),
% 1.61/1.32 inference(cnf_transformation,[status(thm)],[f21])).
% 1.61/1.32 thf(f21,plain,(
% 1.61/1.32 ((lessf @ x @ y) = $true)),
% 1.61/1.32 inference(fool_elimination,[status(thm)],[f20])).
% 1.61/1.32 thf(f20,plain,(
% 1.61/1.32 (lessf @ x @ y)),
% 1.61/1.32 inference(rectify,[status(thm)],[f1])).
% 1.61/1.32 thf(f1,axiom,(
% 1.61/1.32 (lessf @ x @ y)),
% 1.61/1.32 file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',l)).
% 1.61/1.32 thf(f51,plain,(
% 1.61/1.32 ((lessf @ x @ y) != $true)),
% 1.61/1.32 inference(trivial_inequality_removal,[status(thm)],[f50])).
% 1.61/1.32 thf(f50,plain,(
% 1.61/1.32 ((lessf @ x @ y) != $true) | ($true != $true)),
% 1.61/1.32 inference(superposition,[status(thm)],[f48,f37])).
% 1.61/1.32 thf(f37,plain,(
% 1.61/1.32 ((eq @ x @ z) = $true)),
% 1.61/1.32 inference(cnf_transformation,[status(thm)],[f19])).
% 1.61/1.32 thf(f19,plain,(
% 1.61/1.32 ((eq @ x @ z) = $true)),
% 1.61/1.32 inference(fool_elimination,[status(thm)],[f18])).
% 1.61/1.32 thf(f18,plain,(
% 1.61/1.32 (eq @ x @ z)),
% 1.61/1.32 inference(rectify,[status(thm)],[f2])).
% 1.61/1.32 thf(f2,axiom,(
% 1.61/1.32 (eq @ x @ z)),
% 1.61/1.32 file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',e)).
% 1.61/1.32 thf(f48,plain,(
% 1.61/1.32 ( ! [X0 : frac] : (($true != (eq @ X0 @ z)) | ((lessf @ X0 @ y) != $true)) )),
% 1.61/1.32 inference(trivial_inequality_removal,[status(thm)],[f47])).
% 1.61/1.32 thf(f47,plain,(
% 1.61/1.32 ( ! [X0 : frac] : (($true != (eq @ X0 @ z)) | ($true != $true) | ((lessf @ X0 @ y) != $true)) )),
% 1.61/1.32 inference(superposition,[status(thm)],[f45,f32])).
% 1.61/1.32 thf(f32,plain,(
% 1.61/1.32 ( ! [X0 : frac,X1 : frac] : (((moref @ X1 @ X0) = $true) | ((lessf @ X0 @ X1) != $true)) )),
% 1.61/1.32 inference(cnf_transformation,[status(thm)],[f30])).
% 1.61/1.32 thf(f30,plain,(
% 1.61/1.32 ! [X0 : frac,X1 : frac] : (((lessf @ X0 @ X1) != $true) | ((moref @ X1 @ X0) = $true))),
% 1.61/1.32 inference(rectify,[status(thm)],[f25])).
% 1.61/1.32 thf(f25,plain,(
% 1.61/1.32 ! [X1 : frac,X0 : frac] : (((lessf @ X1 @ X0) != $true) | ((moref @ X0 @ X1) = $true))),
% 1.61/1.32 inference(ennf_transformation,[status(thm)],[f15])).
% 1.61/1.32 thf(f15,plain,(
% 1.61/1.32 ! [X1 : frac,X0 : frac] : (((lessf @ X1 @ X0) = $true) => ((moref @ X0 @ X1) = $true))),
% 1.61/1.32 inference(fool_elimination,[status(thm)],[f14])).
% 1.61/1.32 thf(f14,plain,(
% 1.61/1.32 ! [X0 : frac,X1 : frac] : ((lessf @ X1 @ X0) => (moref @ X0 @ X1))),
% 1.61/1.32 inference(rectify,[status(thm)],[f6])).
% 1.61/1.32 thf(f6,axiom,(
% 1.61/1.32 ! [X1 : frac,X0 : frac] : ((lessf @ X0 @ X1) => (moref @ X1 @ X0))),
% 1.61/1.32 file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',satz43)).
% 1.61/1.32 thf(f45,plain,(
% 1.61/1.32 ( ! [X0 : frac] : (($true != (moref @ y @ X0)) | ($true != (eq @ X0 @ z))) )),
% 1.61/1.32 inference(trivial_inequality_removal,[status(thm)],[f44])).
% 1.61/1.32 thf(f44,plain,(
% 1.61/1.32 ( ! [X0 : frac] : (($true != (eq @ X0 @ z)) | ($true != (moref @ y @ X0)) | ($true != $true)) )),
% 1.61/1.32 inference(superposition,[status(thm)],[f43,f35])).
% 1.61/1.32 thf(f35,plain,(
% 1.61/1.32 ((eq @ y @ u) = $true)),
% 1.61/1.32 inference(cnf_transformation,[status(thm)],[f11])).
% 1.61/1.32 thf(f11,plain,(
% 1.61/1.32 ((eq @ y @ u) = $true)),
% 1.61/1.32 inference(fool_elimination,[status(thm)],[f10])).
% 1.61/1.32 thf(f10,plain,(
% 1.61/1.32 (eq @ y @ u)),
% 1.61/1.32 inference(rectify,[status(thm)],[f3])).
% 1.61/1.32 thf(f3,axiom,(
% 1.61/1.32 (eq @ y @ u)),
% 1.61/1.32 file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',f)).
% 1.61/1.32 thf(f43,plain,(
% 1.61/1.32 ( ! [X0 : frac,X1 : frac] : (($true != (eq @ X1 @ u)) | ((moref @ X1 @ X0) != $true) | ($true != (eq @ X0 @ z))) )),
% 1.61/1.32 inference(trivial_inequality_removal,[status(thm)],[f42])).
% 1.61/1.32 thf(f42,plain,(
% 1.61/1.32 ( ! [X0 : frac,X1 : frac] : (((moref @ X1 @ X0) != $true) | ($true != (eq @ X0 @ z)) | ($true != (eq @ X1 @ u)) | ($true != $true)) )),
% 1.61/1.32 inference(superposition,[status(thm)],[f39,f31])).
% 1.61/1.32 thf(f31,plain,(
% 1.61/1.32 ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : (((moref @ X1 @ X3) = $true) | ($true != (eq @ X2 @ X3)) | ((eq @ X0 @ X1) != $true) | ((moref @ X0 @ X2) != $true)) )),
% 1.61/1.32 inference(cnf_transformation,[status(thm)],[f29])).
% 1.61/1.32 thf(f29,plain,(
% 1.61/1.32 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : (((moref @ X1 @ X3) = $true) | ((eq @ X0 @ X1) != $true) | ((moref @ X0 @ X2) != $true) | ($true != (eq @ X2 @ X3)))),
% 1.61/1.32 inference(rectify,[status(thm)],[f27])).
% 1.61/1.32 thf(f27,plain,(
% 1.61/1.32 ! [X0 : frac,X1 : frac,X3 : frac,X2 : frac] : (($true = (moref @ X1 @ X2)) | ((eq @ X0 @ X1) != $true) | ($true != (moref @ X0 @ X3)) | ((eq @ X3 @ X2) != $true))),
% 1.61/1.32 inference(flattening,[status(thm)],[f26])).
% 1.61/1.32 thf(f26,plain,(
% 1.61/1.32 ! [X3 : frac,X1 : frac,X0 : frac,X2 : frac] : (((($true = (moref @ X1 @ X2)) | ((eq @ X3 @ X2) != $true)) | ((eq @ X0 @ X1) != $true)) | ($true != (moref @ X0 @ X3)))),
% 1.61/1.32 inference(ennf_transformation,[status(thm)],[f23])).
% 1.61/1.32 thf(f23,plain,(
% 1.61/1.32 ! [X3 : frac,X1 : frac,X0 : frac,X2 : frac] : (($true = (moref @ X0 @ X3)) => (((eq @ X0 @ X1) = $true) => (((eq @ X3 @ X2) = $true) => ($true = (moref @ X1 @ X2)))))),
% 1.61/1.32 inference(fool_elimination,[status(thm)],[f22])).
% 1.61/1.32 thf(f22,plain,(
% 1.61/1.32 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((moref @ X0 @ X3) => ((eq @ X0 @ X1) => ((eq @ X3 @ X2) => (moref @ X1 @ X2))))),
% 1.61/1.32 inference(rectify,[status(thm)],[f5])).
% 1.61/1.32 thf(f5,axiom,(
% 1.61/1.32 ! [X0 : frac,X2 : frac,X3 : frac,X1 : frac] : ((moref @ X0 @ X1) => ((eq @ X0 @ X2) => ((eq @ X1 @ X3) => (moref @ X2 @ X3))))),
% 1.61/1.32 file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',satz44)).
% 1.61/1.32 thf(f39,plain,(
% 1.61/1.32 ($true != (moref @ u @ z))),
% 1.61/1.32 inference(trivial_inequality_removal,[status(thm)],[f38])).
% 1.61/1.32 thf(f38,plain,(
% 1.61/1.32 ($true != $true) | ($true != (moref @ u @ z))),
% 1.61/1.32 inference(superposition,[status(thm)],[f33,f34])).
% 1.61/1.32 thf(f34,plain,(
% 1.61/1.32 ( ! [X0 : frac,X1 : frac] : (((lessf @ X1 @ X0) = $true) | ((moref @ X0 @ X1) != $true)) )),
% 1.61/1.32 inference(cnf_transformation,[status(thm)],[f28])).
% 1.61/1.32 thf(f28,plain,(
% 1.61/1.32 ! [X0 : frac,X1 : frac] : (((moref @ X0 @ X1) != $true) | ((lessf @ X1 @ X0) = $true))),
% 1.61/1.32 inference(ennf_transformation,[status(thm)],[f13])).
% 1.61/1.32 thf(f13,plain,(
% 1.61/1.32 ! [X0 : frac,X1 : frac] : (((moref @ X0 @ X1) = $true) => ((lessf @ X1 @ X0) = $true))),
% 1.61/1.32 inference(fool_elimination,[status(thm)],[f12])).
% 1.61/1.32 thf(f12,plain,(
% 1.61/1.32 ! [X0 : frac,X1 : frac] : ((moref @ X0 @ X1) => (lessf @ X1 @ X0))),
% 1.61/1.32 inference(rectify,[status(thm)],[f4])).
% 1.61/1.32 thf(f4,axiom,(
% 1.61/1.32 ! [X0 : frac,X1 : frac] : ((moref @ X0 @ X1) => (lessf @ X1 @ X0))),
% 1.61/1.32 file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',satz42)).
% 1.61/1.32 thf(f33,plain,(
% 1.61/1.32 ((lessf @ z @ u) != $true)),
% 1.61/1.32 inference(cnf_transformation,[status(thm)],[f24])).
% 1.61/1.32 thf(f24,plain,(
% 1.61/1.32 ((lessf @ z @ u) != $true)),
% 1.61/1.32 inference(flattening,[status(thm)],[f17])).
% 1.61/1.32 thf(f17,plain,(
% 1.61/1.32 ~((lessf @ z @ u) = $true)),
% 1.61/1.32 inference(fool_elimination,[status(thm)],[f16])).
% 1.61/1.32 thf(f16,plain,(
% 1.61/1.32 ~(lessf @ z @ u)),
% 1.61/1.32 inference(rectify,[status(thm)],[f8])).
% 1.61/1.32 thf(f8,negated_conjecture,(
% 1.61/1.32 ~(lessf @ z @ u)),
% 1.61/1.32 inference(negated_conjecture,[status(cth)],[f7])).
% 1.61/1.32 thf(f7,conjecture,(
% 1.61/1.32 (lessf @ z @ u)),
% 1.61/1.32 file('/export/starexec/sandbox/tmp/tmp.SJlNybxacG/DTF2THF_20831.p',satz45)).
% 1.61/1.32 % SZS output end Proof for DTF2THF_20831
% 1.61/1.32 % (21020)------------------------------
% 1.61/1.32 % (21020)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.32 % (21020)Termination reason: Refutation
% 1.61/1.32
% 1.61/1.32 % (21020)Memory used [KB]: 5500
% 1.61/1.32 % (21020)Time elapsed: 0.007 s
% 1.61/1.32 % (21020)Instructions burned: 4 (million)
% 1.61/1.32 % (21020)------------------------------
% 1.61/1.32 % (21020)------------------------------
% 1.61/1.32 % (21019)Success in time 0.022 s
%------------------------------------------------------------------------------