%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM761^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 : n010.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:37 AM UTC 2026
% Result : Theorem 1.79s 1.50s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 196 ( 58 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 311 ( 38 ~; 25 |; 0 &; 232 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 56 ( 0 ^; 56 !; 0 ?; 56 :)
% 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,
moref: frac > frac > $o ).
thf(func_def_6,type,
eq: frac > frac > $o ).
thf(func_def_8,type,
pf: frac > frac > frac ).
thf(f47,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f46,f43]) ).
thf(f43,plain,
( ( moref @ x @ y )
!= $true ),
inference(subsumption_resolution,[status(thm)],[f42,f37]) ).
thf(f37,plain,
( ( moref @ z @ u )
= $true ),
inference(cnf_transformation,[status(thm)],[f16]) ).
thf(f16,plain,
( ( moref @ z @ u )
= $true ),
inference(fool_elimination,[status(thm)],[f15]) ).
thf(f15,plain,
moref @ z @ u,
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
moref @ z @ u,
file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',n) ).
thf(f42,plain,
( ( ( moref @ x @ y )
!= $true )
| ( ( moref @ z @ u )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f40]) ).
thf(f40,plain,
( ( ( moref @ z @ u )
!= $true )
| ( ( moref @ x @ y )
!= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f35,f34]) ).
thf(f34,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X3 ) )
= $true )
| ( ( moref @ X0 @ X2 )
!= $true )
| ( $true
!= ( moref @ X1 @ X3 ) ) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
thf(f31,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( $true
!= ( moref @ X1 @ X3 ) )
| ( ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X3 ) )
= $true )
| ( ( moref @ X0 @ X2 )
!= $true ) ),
inference(rectify,[status(thm)],[f27]) ).
thf(f27,plain,
! [X0: frac,X3: frac,X1: frac,X2: frac] :
( ( $true
!= ( moref @ X3 @ X2 ) )
| ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) )
= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(flattening,[status(thm)],[f26]) ).
thf(f26,plain,
! [X3: frac,X2: frac,X1: frac,X0: frac] :
( ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) )
= $true )
| ( $true
!= ( moref @ X3 @ X2 ) )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f20]) ).
thf(f20,plain,
! [X3: frac,X2: frac,X1: frac,X0: frac] :
( ( ( moref @ X0 @ X1 )
= $true )
=> ( ( $true
= ( moref @ X3 @ X2 ) )
=> ( ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f19]) ).
thf(f19,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X0 @ X1 )
=> ( ( moref @ X3 @ X2 )
=> ( moref @ ( pf @ X0 @ X3 ) @ ( pf @ X1 @ X2 ) ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,axiom,
! [X1: frac,X2: frac,X4: frac,X3: frac] :
( ( moref @ X1 @ X2 )
=> ( ( moref @ X3 @ X4 )
=> ( moref @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',satz64) ).
thf(f35,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f21]) ).
thf(f21,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(flattening,[status(thm)],[f18]) ).
thf(f18,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(fool_elimination,[status(thm)],[f17]) ).
thf(f17,plain,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
thf(f6,conjecture,
moref @ ( pf @ x @ z ) @ ( pf @ y @ u ),
file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',satz65a) ).
thf(f46,plain,
( ( moref @ x @ y )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f45]) ).
thf(f45,plain,
( ( $true != $true )
| ( ( moref @ x @ y )
= $true ) ),
inference(superposition,[status(thm)],[f44,f36]) ).
thf(f36,plain,
( ( ( eq @ x @ y )
= $true )
| ( ( moref @ x @ y )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f29]) ).
thf(f29,plain,
( ( ( moref @ x @ y )
= $true )
| ( ( eq @ x @ y )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f23]) ).
thf(f23,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(flattening,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',m) ).
thf(f44,plain,
( ( eq @ x @ y )
!= $true ),
inference(subsumption_resolution,[status(thm)],[f41,f37]) ).
thf(f41,plain,
( ( ( eq @ x @ y )
!= $true )
| ( ( moref @ z @ u )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f39]) ).
thf(f39,plain,
( ( ( moref @ z @ u )
!= $true )
| ( $true != $true )
| ( ( eq @ x @ y )
!= $true ) ),
inference(superposition,[status(thm)],[f35,f33]) ).
thf(f33,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) )
= $true )
| ( ( eq @ X1 @ X2 )
!= $true )
| ( $true
!= ( moref @ X0 @ X3 ) ) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
thf(f30,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X3 ) )
= $true )
| ( ( eq @ X1 @ X2 )
!= $true )
| ( $true
!= ( moref @ X0 @ X3 ) ) ),
inference(rectify,[status(thm)],[f25]) ).
thf(f25,plain,
! [X0: frac,X1: frac,X3: frac,X2: frac] :
( ( $true
= ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X3 @ X2 ) ) )
| ( $true
!= ( eq @ X1 @ X3 ) )
| ( ( moref @ X0 @ X2 )
!= $true ) ),
inference(flattening,[status(thm)],[f24]) ).
thf(f24,plain,
! [X1: frac,X2: frac,X0: frac,X3: frac] :
( ( $true
= ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X3 @ X2 ) ) )
| ( ( moref @ X0 @ X2 )
!= $true )
| ( $true
!= ( eq @ X1 @ X3 ) ) ),
inference(ennf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
! [X1: frac,X2: frac,X0: frac,X3: frac] :
( ( $true
= ( eq @ X1 @ X3 ) )
=> ( ( ( moref @ X0 @ X2 )
= $true )
=> ( $true
= ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X3 @ X2 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( eq @ X1 @ X3 )
=> ( ( moref @ X0 @ X2 )
=> ( moref @ ( pf @ X1 @ X0 ) @ ( pf @ X3 @ X2 ) ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,axiom,
! [X3: frac,X1: frac,X4: frac,X2: frac] :
( ( eq @ X1 @ X2 )
=> ( ( moref @ X3 @ X4 )
=> ( moref @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',satz62g) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM761^1 : TPTP v9.2.1. Released v3.7.0.
% 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n010.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Feb 24 11:13:03 EST 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.28/0.49 ---- Original DTF file ---
% 0.28/0.49 thf(spec,logic,$$dhol).
% 0.28/0.49 %------------------------------------------------------------------------------
% 0.28/0.49 % File : NUM761^1 : TPTP v9.2.1. Released v3.7.0.
% 0.28/0.49 % Domain : Number Theory
% 0.28/0.49 % Problem : Landau theorem 65a
% 0.28/0.49 % Version : Especial.
% 0.28/0.49 % English : moref (pf x z) (pf y u)
% 0.28/0.49
% 0.28/0.49 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.28/0.49 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.28/0.49 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.28/0.49 % Source : [Bro09]
% 0.28/0.49 % Names : satz65a [Lan30]
% 0.28/0.49 % : satz75a [Lan30]
% 0.28/0.49
% 0.28/0.49 % Status : Theorem
% 0.28/0.49 % : Without extensionality : Theorem
% 0.28/0.49 % Rating : 0.17 v9.1.0, 0.12 v9.0.0, 0.17 v8.2.0, 0.18 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.1.0, 0.17 v6.0.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v5.1.0, 0.25 v5.0.0, 0.00 v3.7.0
% 0.28/0.49 % Syntax : Number of formulae : 14 ( 2 unt; 8 typ; 0 def)
% 0.28/0.49 % Number of atoms : 10 ( 0 equ; 0 cnn)
% 0.28/0.49 % Maximal formula atoms : 3 ( 1 avg)
% 0.28/0.49 % Number of connectives : 41 ( 3 ~; 0 |; 0 &; 32 @)
% 0.28/0.49 % ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% 0.28/0.49 % Maximal formula depth : 11 ( 7 avg)
% 0.28/0.49 % Number of types : 2 ( 1 usr)
% 0.28/0.49 % Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% 0.28/0.49 % Number of symbols : 7 ( 7 usr; 4 con; 0-2 aty)
% 0.28/0.49 % Number of variables : 9 ( 0 ^; 9 !; 0 ?; 9 :)
% 0.28/0.49 % SPC : TH0_THM_NEQ_NAR
% 0.28/0.49
% 0.28/0.49 % Comments :
% 0.28/0.49 %------------------------------------------------------------------------------
% 0.28/0.49 thf(frac_type,type,
% 0.28/0.49 frac: $tType ).
% 0.28/0.49
% 0.28/0.49 thf(x,type,
% 0.28/0.49 x: frac ).
% 0.28/0.49
% 0.28/0.49 thf(y,type,
% 0.28/0.49 y: frac ).
% 0.28/0.49
% 0.28/0.49 thf(z,type,
% 0.28/0.49 z: frac ).
% 0.28/0.49
% 0.28/0.49 thf(u,type,
% 0.28/0.49 u: frac ).
% 0.28/0.49
% 0.28/0.49 thf(moref,type,
% 0.28/0.49 moref: frac > frac > $o ).
% 0.28/0.49
% 0.28/0.49 thf(eq,type,
% 0.28/0.49 eq: frac > frac > $o ).
% 0.28/0.49
% 0.28/0.49 thf(m,axiom,
% 0.28/0.49 ( ~ ( moref @ x @ y )
% 0.28/0.49 => ( eq @ x @ y ) ) ).
% 0.28/0.49
% 0.28/0.49 thf(n,axiom,
% 0.28/0.49 moref @ z @ u ).
% 0.28/0.49
% 0.28/0.49 thf(pf,type,
% 0.28/0.49 pf: frac > frac > frac ).
% 0.28/0.49
% 0.28/0.49 thf(et,axiom,
% 0.28/0.49 ! [Xa: $o] :
% 0.28/0.49 ( ~ ~ Xa
% 0.28/0.49 => Xa ) ).
% 0.28/0.49
% 0.28/0.49 thf(satz62g,axiom,
% 0.28/0.49 ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
% 0.28/0.49 ( ( eq @ Xx @ Xy )
% 0.28/0.49 => ( ( moref @ Xz @ Xu )
% 0.28/0.49 => ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ) ).
% 0.28/0.49
% 0.28/0.49 thf(satz64,axiom,
% 0.28/0.49 ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
% 0.28/0.49 ( ( moref @ Xx @ Xy )
% 0.28/0.49 => ( ( moref @ Xz @ Xu )
% 0.28/0.49 => ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ) ).
% 0.28/0.49
% 0.28/0.49 thf(satz65a,conjecture,
% 0.28/0.49 moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ).
% 0.28/0.49
% 0.28/0.49 %------------------------------------------------------------------------------
% 0.28/0.49 ------------------------
% 1.63/1.47 ---- Embedded in THF ---
% 1.63/1.47 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.63/1.47 %%% Generated on Tue Feb 24 11:13:04 EST 2026
% 1.63/1.47 %%% using '$$dhol' embedding, version 1.3.0.
% 1.63/1.47 %%% Logic specification used:
% 1.63/1.47 %%% thf(spec, logic, $$dhol).
% 1.63/1.47
% 1.63/1.47 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2DTF30125.p
% See solution above
% 1.63/1.47 ------------------------
% 1.63/1.48 ---- Cleaned THF ---
% 1.63/1.48 thf(frac_type,type,
% 1.63/1.48 frac: $tType ).
% 1.63/1.48
% 1.63/1.48 thf(x,type,
% 1.63/1.48 x: frac ).
% 1.63/1.48
% 1.63/1.48 thf(y,type,
% 1.63/1.48 y: frac ).
% 1.63/1.48
% 1.63/1.48 thf(z,type,
% 1.63/1.48 z: frac ).
% 1.63/1.48
% 1.63/1.48 thf(u,type,
% 1.63/1.48 u: frac ).
% 1.63/1.48
% 1.63/1.48 thf(moref,type,
% 1.63/1.48 moref: frac > frac > $o ).
% 1.63/1.48
% 1.63/1.48 thf(eq,type,
% 1.63/1.48 eq: frac > frac > $o ).
% 1.63/1.48
% 1.63/1.48 thf(m,axiom,
% 1.63/1.48 ( ~ ( moref @ x @ y )
% 1.63/1.48 => ( eq @ x @ y ) ) ).
% 1.63/1.48
% 1.63/1.48 thf(n,axiom,
% 1.63/1.48 moref @ z @ u ).
% 1.63/1.48
% 1.63/1.48 thf(pf,type,
% 1.63/1.48 pf: frac > frac > frac ).
% 1.63/1.48
% 1.63/1.48 thf(et,axiom,
% 1.63/1.48 ! [Xa: $o] :
% 1.63/1.48 ( ~ ~ Xa
% 1.63/1.48 => Xa ) ).
% 1.63/1.48
% 1.63/1.48 thf(satz62g,axiom,
% 1.63/1.48 ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
% 1.63/1.48 ( ( eq @ Xx @ Xy )
% 1.63/1.48 => ( ( moref @ Xz @ Xu )
% 1.63/1.48 => ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ) ).
% 1.63/1.48
% 1.63/1.48 thf(satz64,axiom,
% 1.63/1.48 ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
% 1.63/1.48 ( ( moref @ Xx @ Xy )
% 1.63/1.48 => ( ( moref @ Xz @ Xu )
% 1.63/1.48 => ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ) ).
% 1.63/1.48
% 1.63/1.48 thf(satz65a,conjecture,
% 1.63/1.48 moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ).
% 1.63/1.48 ------------------------
% 1.79/1.50 % (30240)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_30125 for (2999ds/2Mi)
% 1.79/1.50 % (30237)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_30125 for (2999ds/4Mi)
% 1.79/1.50 % (30241)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_30125 for (2999ds/275Mi)
% 1.79/1.50 % (30239)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_30125 for (2999ds/2Mi)
% 1.79/1.50 % (30238)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_30125 for (2999ds/27Mi)
% 1.79/1.50 % (30236)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_30125 for (2999ds/183Mi)
% 1.79/1.50 % (30242)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_30125 for (2999ds/18Mi)
% 1.79/1.50 % (30239)Instruction limit reached!
% 1.79/1.50 % (30239)------------------------------
% 1.79/1.50 % (30239)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.79/1.50 % (30239)Termination reason: Unknown
% 1.79/1.50 % (30239)Termination phase: Saturation
% 1.79/1.50 % (30240)Instruction limit reached!
% 1.79/1.50 % (30240)------------------------------
% 1.79/1.50 % (30240)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.79/1.50 % (30240)Termination reason: Unknown
% 1.79/1.50 % (30240)Termination phase: Saturation
% 1.79/1.50
% 1.79/1.50 % (30240)Memory used [KB]: 1023
% 1.79/1.50 % (30240)Time elapsed: 0.003 s
% 1.79/1.50 % (30240)Instructions burned: 2 (million)
% 1.79/1.50 % (30240)------------------------------
% 1.79/1.50 % (30240)------------------------------
% 1.79/1.50
% 1.79/1.50 % (30239)Memory used [KB]: 5373
% 1.79/1.50 % (30239)Time elapsed: 0.003 s
% 1.79/1.50 % (30239)Instructions burned: 2 (million)
% 1.79/1.50 % (30239)------------------------------
% 1.79/1.50 % (30239)------------------------------
% 1.79/1.50 % (30237)Instruction limit reached!
% 1.79/1.50 % (30237)------------------------------
% 1.79/1.50 % (30237)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.79/1.50 % (30241)First to succeed.
% 1.79/1.50 % (30237)Termination reason: Unknown
% 1.79/1.50 % (30237)Termination phase: Saturation
% 1.79/1.50
% 1.79/1.50 % (30237)Memory used [KB]: 5500
% 1.79/1.50 % (30237)Time elapsed: 0.004 s
% 1.79/1.50 % (30237)Instructions burned: 4 (million)
% 1.79/1.50 % (30237)------------------------------
% 1.79/1.50 % (30237)------------------------------
% 1.79/1.50 % (30236)Also succeeded, but the first one will report.
% 1.79/1.50 % (30241)Refutation found. Thanks to Tanya!
% 1.79/1.50 % SZS status Theorem for DTF2THF_30125
% 1.79/1.50 % SZS output start Proof for DTF2THF_30125
% 1.79/1.50 thf(type_def_5, type, frac: $tType).
% 1.79/1.50 thf(func_def_0, type, frac: $tType).
% 1.79/1.50 thf(func_def_1, type, x: frac).
% 1.79/1.50 thf(func_def_2, type, y: frac).
% 1.79/1.50 thf(func_def_3, type, z: frac).
% 1.79/1.50 thf(func_def_4, type, u: frac).
% 1.79/1.50 thf(func_def_5, type, moref: frac > frac > $o).
% 1.79/1.50 thf(func_def_6, type, eq: frac > frac > $o).
% 1.79/1.50 thf(func_def_8, type, pf: frac > frac > frac).
% 1.79/1.50 thf(f47,plain,(
% 1.79/1.50 $false),
% 1.79/1.50 inference(subsumption_resolution,[status(thm)],[f46,f43])).
% 1.79/1.50 thf(f43,plain,(
% 1.79/1.50 ((moref @ x @ y) != $true)),
% 1.79/1.50 inference(subsumption_resolution,[status(thm)],[f42,f37])).
% 1.79/1.50 thf(f37,plain,(
% 1.79/1.50 ((moref @ z @ u) = $true)),
% 1.79/1.50 inference(cnf_transformation,[status(thm)],[f16])).
% 1.79/1.50 thf(f16,plain,(
% 1.79/1.50 ((moref @ z @ u) = $true)),
% 1.79/1.50 inference(fool_elimination,[status(thm)],[f15])).
% 1.79/1.50 thf(f15,plain,(
% 1.79/1.50 (moref @ z @ u)),
% 1.79/1.50 inference(rectify,[status(thm)],[f2])).
% 1.79/1.50 thf(f2,axiom,(
% 1.79/1.50 (moref @ z @ u)),
% 1.79/1.50 file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',n)).
% 1.79/1.50 thf(f42,plain,(
% 1.79/1.50 ((moref @ x @ y) != $true) | ((moref @ z @ u) != $true)),
% 1.79/1.50 inference(trivial_inequality_removal,[status(thm)],[f40])).
% 1.79/1.50 thf(f40,plain,(
% 1.79/1.50 ((moref @ z @ u) != $true) | ((moref @ x @ y) != $true) | ($true != $true)),
% 1.79/1.50 inference(superposition,[status(thm)],[f35,f34])).
% 1.79/1.50 thf(f34,plain,(
% 1.79/1.50 ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : (((moref @ (pf @ X0 @ X1) @ (pf @ X2 @ X3)) = $true) | ((moref @ X0 @ X2) != $true) | ($true != (moref @ X1 @ X3))) )),
% 1.79/1.50 inference(cnf_transformation,[status(thm)],[f31])).
% 1.79/1.50 thf(f31,plain,(
% 1.79/1.50 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : (($true != (moref @ X1 @ X3)) | ((moref @ (pf @ X0 @ X1) @ (pf @ X2 @ X3)) = $true) | ((moref @ X0 @ X2) != $true))),
% 1.79/1.50 inference(rectify,[status(thm)],[f27])).
% 1.79/1.50 thf(f27,plain,(
% 1.79/1.50 ! [X0 : frac,X3 : frac,X1 : frac,X2 : frac] : (($true != (moref @ X3 @ X2)) | ((moref @ (pf @ X0 @ X3) @ (pf @ X1 @ X2)) = $true) | ((moref @ X0 @ X1) != $true))),
% 1.79/1.50 inference(flattening,[status(thm)],[f26])).
% 1.79/1.50 thf(f26,plain,(
% 1.79/1.50 ! [X3 : frac,X2 : frac,X1 : frac,X0 : frac] : ((((moref @ (pf @ X0 @ X3) @ (pf @ X1 @ X2)) = $true) | ($true != (moref @ X3 @ X2))) | ((moref @ X0 @ X1) != $true))),
% 1.79/1.50 inference(ennf_transformation,[status(thm)],[f20])).
% 1.79/1.50 thf(f20,plain,(
% 1.79/1.50 ! [X3 : frac,X2 : frac,X1 : frac,X0 : frac] : (((moref @ X0 @ X1) = $true) => (($true = (moref @ X3 @ X2)) => ((moref @ (pf @ X0 @ X3) @ (pf @ X1 @ X2)) = $true)))),
% 1.79/1.50 inference(fool_elimination,[status(thm)],[f19])).
% 1.79/1.50 thf(f19,plain,(
% 1.79/1.50 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((moref @ X0 @ X1) => ((moref @ X3 @ X2) => (moref @ (pf @ X0 @ X3) @ (pf @ X1 @ X2))))),
% 1.79/1.50 inference(rectify,[status(thm)],[f5])).
% 1.79/1.50 thf(f5,axiom,(
% 1.79/1.50 ! [X1 : frac,X2 : frac,X4 : frac,X3 : frac] : ((moref @ X1 @ X2) => ((moref @ X3 @ X4) => (moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))))),
% 1.79/1.50 file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',satz64)).
% 1.79/1.50 thf(f35,plain,(
% 1.79/1.50 ((moref @ (pf @ x @ z) @ (pf @ y @ u)) != $true)),
% 1.79/1.50 inference(cnf_transformation,[status(thm)],[f21])).
% 1.79/1.50 thf(f21,plain,(
% 1.79/1.50 ((moref @ (pf @ x @ z) @ (pf @ y @ u)) != $true)),
% 1.79/1.50 inference(flattening,[status(thm)],[f18])).
% 1.79/1.50 thf(f18,plain,(
% 1.79/1.50 ~((moref @ (pf @ x @ z) @ (pf @ y @ u)) = $true)),
% 1.79/1.50 inference(fool_elimination,[status(thm)],[f17])).
% 1.79/1.50 thf(f17,plain,(
% 1.79/1.50 ~(moref @ (pf @ x @ z) @ (pf @ y @ u))),
% 1.79/1.50 inference(rectify,[status(thm)],[f7])).
% 1.79/1.50 thf(f7,negated_conjecture,(
% 1.79/1.50 ~(moref @ (pf @ x @ z) @ (pf @ y @ u))),
% 1.79/1.50 inference(negated_conjecture,[status(cth)],[f6])).
% 1.79/1.50 thf(f6,conjecture,(
% 1.79/1.50 (moref @ (pf @ x @ z) @ (pf @ y @ u))),
% 1.79/1.50 file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',satz65a)).
% 1.79/1.50 thf(f46,plain,(
% 1.79/1.50 ((moref @ x @ y) = $true)),
% 1.79/1.50 inference(trivial_inequality_removal,[status(thm)],[f45])).
% 1.79/1.50 thf(f45,plain,(
% 1.79/1.50 ($true != $true) | ((moref @ x @ y) = $true)),
% 1.79/1.50 inference(superposition,[status(thm)],[f44,f36])).
% 1.79/1.50 thf(f36,plain,(
% 1.79/1.50 ((eq @ x @ y) = $true) | ((moref @ x @ y) = $true)),
% 1.79/1.50 inference(cnf_transformation,[status(thm)],[f29])).
% 1.79/1.50 thf(f29,plain,(
% 1.79/1.50 ((moref @ x @ y) = $true) | ((eq @ x @ y) = $true)),
% 1.79/1.50 inference(ennf_transformation,[status(thm)],[f23])).
% 1.79/1.50 thf(f23,plain,(
% 1.79/1.50 ((moref @ x @ y) != $true) => ((eq @ x @ y) = $true)),
% 1.79/1.50 inference(flattening,[status(thm)],[f10])).
% 1.79/1.50 thf(f10,plain,(
% 1.79/1.50 ~((moref @ x @ y) = $true) => ((eq @ x @ y) = $true)),
% 1.79/1.50 inference(fool_elimination,[status(thm)],[f9])).
% 1.79/1.50 thf(f9,plain,(
% 1.79/1.50 ~(moref @ x @ y) => (eq @ x @ y)),
% 1.79/1.50 inference(rectify,[status(thm)],[f1])).
% 1.79/1.50 thf(f1,axiom,(
% 1.79/1.50 ~(moref @ x @ y) => (eq @ x @ y)),
% 1.79/1.50 file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',m)).
% 1.79/1.50 thf(f44,plain,(
% 1.79/1.50 ((eq @ x @ y) != $true)),
% 1.79/1.50 inference(subsumption_resolution,[status(thm)],[f41,f37])).
% 1.79/1.50 thf(f41,plain,(
% 1.79/1.50 ((eq @ x @ y) != $true) | ((moref @ z @ u) != $true)),
% 1.79/1.50 inference(trivial_inequality_removal,[status(thm)],[f39])).
% 1.79/1.50 thf(f39,plain,(
% 1.79/1.50 ((moref @ z @ u) != $true) | ($true != $true) | ((eq @ x @ y) != $true)),
% 1.79/1.50 inference(superposition,[status(thm)],[f35,f33])).
% 1.79/1.50 thf(f33,plain,(
% 1.79/1.50 ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : (((moref @ (pf @ X1 @ X0) @ (pf @ X2 @ X3)) = $true) | ((eq @ X1 @ X2) != $true) | ($true != (moref @ X0 @ X3))) )),
% 1.79/1.50 inference(cnf_transformation,[status(thm)],[f30])).
% 1.79/1.50 thf(f30,plain,(
% 1.79/1.50 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : (((moref @ (pf @ X1 @ X0) @ (pf @ X2 @ X3)) = $true) | ((eq @ X1 @ X2) != $true) | ($true != (moref @ X0 @ X3)))),
% 1.79/1.50 inference(rectify,[status(thm)],[f25])).
% 1.79/1.50 thf(f25,plain,(
% 1.79/1.50 ! [X0 : frac,X1 : frac,X3 : frac,X2 : frac] : (($true = (moref @ (pf @ X1 @ X0) @ (pf @ X3 @ X2))) | ($true != (eq @ X1 @ X3)) | ((moref @ X0 @ X2) != $true))),
% 1.79/1.50 inference(flattening,[status(thm)],[f24])).
% 1.79/1.50 thf(f24,plain,(
% 1.79/1.50 ! [X1 : frac,X2 : frac,X0 : frac,X3 : frac] : ((($true = (moref @ (pf @ X1 @ X0) @ (pf @ X3 @ X2))) | ((moref @ X0 @ X2) != $true)) | ($true != (eq @ X1 @ X3)))),
% 1.79/1.50 inference(ennf_transformation,[status(thm)],[f12])).
% 1.79/1.50 thf(f12,plain,(
% 1.79/1.50 ! [X1 : frac,X2 : frac,X0 : frac,X3 : frac] : (($true = (eq @ X1 @ X3)) => (((moref @ X0 @ X2) = $true) => ($true = (moref @ (pf @ X1 @ X0) @ (pf @ X3 @ X2)))))),
% 1.79/1.50 inference(fool_elimination,[status(thm)],[f11])).
% 1.79/1.50 thf(f11,plain,(
% 1.79/1.50 ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((eq @ X1 @ X3) => ((moref @ X0 @ X2) => (moref @ (pf @ X1 @ X0) @ (pf @ X3 @ X2))))),
% 1.79/1.50 inference(rectify,[status(thm)],[f4])).
% 1.79/1.50 thf(f4,axiom,(
% 1.79/1.50 ! [X3 : frac,X1 : frac,X4 : frac,X2 : frac] : ((eq @ X1 @ X2) => ((moref @ X3 @ X4) => (moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))))),
% 1.79/1.50 file('/export/starexec/sandbox/tmp/tmp.e0bkE1tT9p/DTF2THF_30125.p',satz62g)).
% 1.79/1.50 % SZS output end Proof for DTF2THF_30125
% 1.79/1.50 % (30241)------------------------------
% 1.79/1.50 % (30241)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.79/1.50 % (30241)Termination reason: Refutation
% 1.79/1.50
% 1.79/1.50 % (30241)Memory used [KB]: 5500
% 1.79/1.50 % (30241)Time elapsed: 0.005 s
% 1.79/1.50 % (30241)Instructions burned: 2 (million)
% 1.79/1.50 % (30241)------------------------------
% 1.79/1.50 % (30241)------------------------------
% 1.79/1.50 % (30235)Success in time 0.019 s
%------------------------------------------------------------------------------