%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM795^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n019.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:46 AM UTC 2026
% Result : Theorem 1.61s 1.33s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 18 unt; 0 typ; 2 def)
% Number of atoms : 228 ( 62 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 313 ( 39 ~; 31 |; 0 &; 226 @)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 62 ( 0 ^; 62 !; 0 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
rat: $tType ).
thf(func_def_0,type,
rat: $tType ).
thf(func_def_1,type,
x0: rat ).
thf(func_def_2,type,
y0: rat ).
thf(func_def_3,type,
z0: rat ).
thf(func_def_4,type,
u0: rat ).
thf(func_def_5,type,
lessis: rat > rat > $o ).
thf(func_def_7,type,
less: rat > rat > $o ).
thf(func_def_8,type,
pl: rat > rat > rat ).
thf(func_def_9,type,
more: rat > rat > $o ).
thf(func_def_10,type,
moreis: rat > rat > $o ).
thf(f63,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f54,f58,f62]) ).
thf(f62,plain,
spl0_2,
inference(avatar_contradiction_clause,[status(thm)],[f61]) ).
thf(f61,plain,
( $false
| spl0_2 ),
inference(subsumption_resolution,[status(thm)],[f60,f33]) ).
thf(f33,plain,
( ( lessis @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( lessis @ x0 @ y0 )
= $true ),
inference(fool_elimination,[status(thm)],[f12]) ).
thf(f12,plain,
lessis @ x0 @ y0,
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
lessis @ x0 @ y0,
file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',l) ).
thf(f60,plain,
( ( ( lessis @ x0 @ y0 )
!= $true )
| spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f59]) ).
thf(f59,plain,
( ( ( lessis @ x0 @ y0 )
!= $true )
| ( $true != $true )
| spl0_2 ),
inference(superposition,[status(thm)],[f53,f37]) ).
thf(f37,plain,
! [X0: rat,X1: rat] :
( ( ( moreis @ X1 @ X0 )
= $true )
| ( ( lessis @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
thf(f30,plain,
! [X0: rat,X1: rat] :
( ( ( lessis @ X0 @ X1 )
!= $true )
| ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(rectify,[status(thm)],[f25]) ).
thf(f25,plain,
! [X1: rat,X0: rat] :
( ( ( lessis @ X1 @ X0 )
!= $true )
| ( ( moreis @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f19]) ).
thf(f19,plain,
! [X1: rat,X0: rat] :
( ( ( lessis @ X1 @ X0 )
= $true )
=> ( ( moreis @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f18]) ).
thf(f18,plain,
! [X0: rat,X1: rat] :
( ( lessis @ X1 @ X0 )
=> ( moreis @ X0 @ X1 ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,axiom,
! [X1: rat,X0: rat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz85) ).
thf(f53,plain,
( ( $true
!= ( moreis @ y0 @ x0 ) )
| spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f51]) ).
thf(f51,definition,
( spl0_2
<=> ( $true
= ( moreis @ y0 @ x0 ) ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f58,plain,
spl0_1,
inference(avatar_contradiction_clause,[status(thm)],[f57]) ).
thf(f57,plain,
( $false
| spl0_1 ),
inference(subsumption_resolution,[status(thm)],[f56,f35]) ).
thf(f35,plain,
( ( less @ z0 @ u0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
( ( less @ z0 @ u0 )
= $true ),
inference(fool_elimination,[status(thm)],[f14]) ).
thf(f14,plain,
less @ z0 @ u0,
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
less @ z0 @ u0,
file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',k) ).
thf(f56,plain,
( ( ( less @ z0 @ u0 )
!= $true )
| spl0_1 ),
inference(trivial_inequality_removal,[status(thm)],[f55]) ).
thf(f55,plain,
( ( $true != $true )
| ( ( less @ z0 @ u0 )
!= $true )
| spl0_1 ),
inference(superposition,[status(thm)],[f49,f38]) ).
thf(f38,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
thf(f31,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X1 @ X0 )
!= $true )
| ( ( more @ X0 @ X1 )
= $true ) ),
inference(rectify,[status(thm)],[f27]) ).
thf(f27,plain,
! [X1: rat,X0: rat] :
( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X1 @ X0 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f21]) ).
thf(f21,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
=> ( ( more @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f20]) ).
thf(f20,plain,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,axiom,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz83) ).
thf(f49,plain,
( ( ( more @ u0 @ z0 )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f47]) ).
thf(f47,definition,
( spl0_1
<=> ( ( more @ u0 @ z0 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f54,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[status(thm)],[f45,f51,f47]) ).
thf(f45,plain,
( ( $true
!= ( moreis @ y0 @ x0 ) )
| ( ( more @ u0 @ z0 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f42]) ).
thf(f42,plain,
( ( $true
!= ( moreis @ y0 @ x0 ) )
| ( ( more @ u0 @ z0 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f41,f39]) ).
thf(f39,plain,
! [X2: rat,X3: rat,X0: rat,X1: rat] :
( ( ( more @ ( pl @ X2 @ X1 ) @ ( pl @ X3 @ X0 ) )
= $true )
| ( $true
!= ( moreis @ X2 @ X3 ) )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f32]) ).
thf(f32,plain,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ( ( more @ ( pl @ X2 @ X1 ) @ ( pl @ X3 @ X0 ) )
= $true )
| ( $true
!= ( moreis @ X2 @ X3 ) )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(rectify,[status(thm)],[f29]) ).
thf(f29,plain,
! [X0: rat,X2: rat,X1: rat,X3: rat] :
( ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) )
= $true )
| ( ( moreis @ X1 @ X3 )
!= $true )
| ( $true
!= ( more @ X2 @ X0 ) ) ),
inference(flattening,[status(thm)],[f28]) ).
thf(f28,plain,
! [X2: rat,X3: rat,X1: rat,X0: rat] :
( ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) )
= $true )
| ( $true
!= ( more @ X2 @ X0 ) )
| ( ( moreis @ X1 @ X3 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
! [X2: rat,X3: rat,X1: rat,X0: rat] :
( ( ( moreis @ X1 @ X3 )
= $true )
=> ( ( $true
= ( more @ X2 @ X0 ) )
=> ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ( moreis @ X1 @ X3 )
=> ( ( more @ X2 @ X0 )
=> ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,axiom,
! [X3: rat,X0: rat,X2: rat,X1: rat] :
( ( moreis @ X0 @ X1 )
=> ( ( more @ X2 @ X3 )
=> ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz99a) ).
thf(f41,plain,
( $true
!= ( more @ ( pl @ y0 @ u0 ) @ ( pl @ x0 @ z0 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f40]) ).
thf(f40,plain,
( ( $true != $true )
| ( $true
!= ( more @ ( pl @ y0 @ u0 ) @ ( pl @ x0 @ z0 ) ) ) ),
inference(superposition,[status(thm)],[f34,f36]) ).
thf(f36,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f26]) ).
thf(f26,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X1 @ X0 )
!= $true )
| ( ( less @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f17]) ).
thf(f17,plain,
! [X1: rat,X0: rat] :
( ( ( more @ X1 @ X0 )
= $true )
=> ( ( less @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f16]) ).
thf(f16,plain,
! [X0: rat,X1: rat] :
( ( more @ X1 @ X0 )
=> ( less @ X0 @ X1 ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X1: rat,X0: rat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz82) ).
thf(f34,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f24]) ).
thf(f24,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(flattening,[status(thm)],[f23]) ).
thf(f23,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(fool_elimination,[status(thm)],[f22]) ).
thf(f22,plain,
~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ),
inference(rectify,[status(thm)],[f8]) ).
thf(f8,negated_conjecture,
~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f7,conjecture,
less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ),
file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz99c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM795^1 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n019.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 11:14:24 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.29/0.46 ---- Original DTF file ---
% 0.29/0.46 thf(spec,logic,$$dhol).
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 % File : NUM795^1 : TPTP v9.2.1. Released v3.7.0.
% 0.29/0.46 % Domain : Number Theory
% 0.29/0.46 % Problem : Landau theorem 99c
% 0.29/0.46 % Version : Especial.
% 0.29/0.46 % English : less (pl x0 z0) (pl y0 u0)
% 0.29/0.46
% 0.29/0.46 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.29/0.46 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.29/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.29/0.46 % Source : [Bro09]
% 0.29/0.46 % Names : satz99c [Lan30]
% 0.29/0.46 % : satz75c [Lan30]
% 0.29/0.46 % : satz65c [Lan30]
% 0.29/0.46
% 0.29/0.46 % Status : Theorem
% 0.29/0.46 % : Without extensionality : Theorem
% 0.29/0.46 % Rating : 0.00 v3.7.0
% 0.29/0.46 % Syntax : Number of formulae : 17 ( 3 unt; 10 typ; 0 def)
% 0.29/0.46 % Number of atoms : 12 ( 0 equ; 0 cnn)
% 0.29/0.46 % Maximal formula atoms : 3 ( 1 avg)
% 0.29/0.46 % Number of connectives : 37 ( 0 ~; 0 |; 0 &; 32 @)
% 0.29/0.46 % ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% 0.29/0.46 % Maximal formula depth : 11 ( 6 avg)
% 0.29/0.46 % Number of types : 2 ( 1 usr)
% 0.29/0.46 % Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% 0.29/0.46 % Number of symbols : 9 ( 9 usr; 4 con; 0-2 aty)
% 0.29/0.46 % Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% 0.29/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.29/0.46
% 0.29/0.46 % Comments :
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 thf(rat_type,type,
% 0.29/0.46 rat: $tType ).
% 0.29/0.46
% 0.29/0.46 thf(x0,type,
% 0.29/0.46 x0: rat ).
% 0.29/0.46
% 0.29/0.46 thf(y0,type,
% 0.29/0.46 y0: rat ).
% 0.29/0.46
% 0.29/0.46 thf(z0,type,
% 0.29/0.46 z0: rat ).
% 0.29/0.46
% 0.29/0.46 thf(u0,type,
% 0.29/0.46 u0: rat ).
% 0.29/0.46
% 0.29/0.46 thf(lessis,type,
% 0.29/0.46 lessis: rat > rat > $o ).
% 0.29/0.46
% 0.29/0.46 thf(l,axiom,
% 0.29/0.46 lessis @ x0 @ y0 ).
% 0.29/0.46
% 0.29/0.46 thf(less,type,
% 0.29/0.46 less: rat > rat > $o ).
% 0.29/0.46
% 0.29/0.46 thf(k,axiom,
% 0.29/0.46 less @ z0 @ u0 ).
% 0.29/0.46
% 0.29/0.46 thf(pl,type,
% 0.29/0.46 pl: rat > rat > rat ).
% 0.29/0.46
% 0.29/0.46 thf(more,type,
% 0.29/0.46 more: rat > rat > $o ).
% 0.29/0.46
% 0.29/0.46 thf(satz82,axiom,
% 0.29/0.46 ! [Xx0: rat,Xy0: rat] :
% 0.29/0.46 ( ( more @ Xx0 @ Xy0 )
% 0.29/0.46 => ( less @ Xy0 @ Xx0 ) ) ).
% 0.29/0.46
% 0.29/0.46 thf(moreis,type,
% 0.29/0.46 moreis: rat > rat > $o ).
% 0.29/0.46
% 0.29/0.46 thf(satz99a,axiom,
% 0.29/0.46 ! [Xx0: rat,Xy0: rat,Xz0: rat,Xu0: rat] :
% 0.29/0.46 ( ( moreis @ Xx0 @ Xy0 )
% 0.29/0.46 => ( ( more @ Xz0 @ Xu0 )
% 0.29/0.46 => ( more @ ( pl @ Xx0 @ Xz0 ) @ ( pl @ Xy0 @ Xu0 ) ) ) ) ).
% 0.29/0.46
% 0.29/0.46 thf(satz85,axiom,
% 0.29/0.46 ! [Xx0: rat,Xy0: rat] :
% 0.29/0.46 ( ( lessis @ Xx0 @ Xy0 )
% 0.29/0.46 => ( moreis @ Xy0 @ Xx0 ) ) ).
% 0.29/0.46
% 0.29/0.46 thf(satz83,axiom,
% 0.29/0.46 ! [Xx0: rat,Xy0: rat] :
% 0.29/0.46 ( ( less @ Xx0 @ Xy0 )
% 0.29/0.46 => ( more @ Xy0 @ Xx0 ) ) ).
% 0.29/0.46
% 0.29/0.46 thf(satz99c,conjecture,
% 0.29/0.46 less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ).
% 0.29/0.46
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 ------------------------
% 1.45/1.29 ---- Embedded in THF ---
% 1.45/1.29 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.45/1.29 %%% Generated on Tue Feb 24 11:14:25 EST 2026
% 1.45/1.29 %%% using '$$dhol' embedding, version 1.3.0.
% 1.45/1.29 %%% Logic specification used:
% 1.45/1.29 %%% thf(spec, logic, $$dhol).
% 1.45/1.29
% 1.45/1.29 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2DTF20059.p
% See solution above
% 1.45/1.30 ------------------------
% 1.61/1.31 ---- Cleaned THF ---
% 1.61/1.31 thf(rat_type,type,
% 1.61/1.31 rat: $tType ).
% 1.61/1.31
% 1.61/1.31 thf(x0,type,
% 1.61/1.31 x0: rat ).
% 1.61/1.31
% 1.61/1.31 thf(y0,type,
% 1.61/1.31 y0: rat ).
% 1.61/1.31
% 1.61/1.31 thf(z0,type,
% 1.61/1.31 z0: rat ).
% 1.61/1.31
% 1.61/1.31 thf(u0,type,
% 1.61/1.31 u0: rat ).
% 1.61/1.31
% 1.61/1.31 thf(lessis,type,
% 1.61/1.31 lessis: rat > rat > $o ).
% 1.61/1.31
% 1.61/1.31 thf(l,axiom,
% 1.61/1.31 lessis @ x0 @ y0 ).
% 1.61/1.31
% 1.61/1.31 thf(less,type,
% 1.61/1.31 less: rat > rat > $o ).
% 1.61/1.31
% 1.61/1.31 thf(k,axiom,
% 1.61/1.31 less @ z0 @ u0 ).
% 1.61/1.31
% 1.61/1.31 thf(pl,type,
% 1.61/1.31 pl: rat > rat > rat ).
% 1.61/1.31
% 1.61/1.31 thf(more,type,
% 1.61/1.31 more: rat > rat > $o ).
% 1.61/1.31
% 1.61/1.31 thf(satz82,axiom,
% 1.61/1.31 ! [Xx0: rat,Xy0: rat] :
% 1.61/1.31 ( ( more @ Xx0 @ Xy0 )
% 1.61/1.31 => ( less @ Xy0 @ Xx0 ) ) ).
% 1.61/1.31
% 1.61/1.31 thf(moreis,type,
% 1.61/1.31 moreis: rat > rat > $o ).
% 1.61/1.31
% 1.61/1.31 thf(satz99a,axiom,
% 1.61/1.31 ! [Xx0: rat,Xy0: rat,Xz0: rat,Xu0: rat] :
% 1.61/1.31 ( ( moreis @ Xx0 @ Xy0 )
% 1.61/1.31 => ( ( more @ Xz0 @ Xu0 )
% 1.61/1.31 => ( more @ ( pl @ Xx0 @ Xz0 ) @ ( pl @ Xy0 @ Xu0 ) ) ) ) ).
% 1.61/1.31
% 1.61/1.31 thf(satz85,axiom,
% 1.61/1.31 ! [Xx0: rat,Xy0: rat] :
% 1.61/1.31 ( ( lessis @ Xx0 @ Xy0 )
% 1.61/1.31 => ( moreis @ Xy0 @ Xx0 ) ) ).
% 1.61/1.31
% 1.61/1.31 thf(satz83,axiom,
% 1.61/1.31 ! [Xx0: rat,Xy0: rat] :
% 1.61/1.31 ( ( less @ Xx0 @ Xy0 )
% 1.61/1.31 => ( more @ Xy0 @ Xx0 ) ) ).
% 1.61/1.31
% 1.61/1.31 thf(satz99c,conjecture,
% 1.61/1.31 less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ).
% 1.61/1.31 ------------------------
% 1.61/1.32 % (20344)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_20059 for (2999ds/2Mi)
% 1.61/1.32 % (20344)Instruction limit reached!
% 1.61/1.32 % (20344)------------------------------
% 1.61/1.32 % (20344)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.32 % (20344)Termination reason: Unknown
% 1.61/1.32 % (20344)Termination phase: Saturation
% 1.61/1.32
% 1.61/1.32 % (20344)Memory used [KB]: 5500
% 1.61/1.32 % (20344)Time elapsed: 0.002 s
% 1.61/1.32 % (20344)Instructions burned: 2 (million)
% 1.61/1.32 % (20344)------------------------------
% 1.61/1.32 % (20344)------------------------------
% 1.61/1.33 % (20342)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_20059 for (2999ds/4Mi)
% 1.61/1.33 % (20341)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_20059 for (2999ds/183Mi)
% 1.61/1.33 % (20343)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_20059 for (2999ds/27Mi)
% 1.61/1.33 % (20345)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_20059 for (2999ds/2Mi)
% 1.61/1.33 % (20346)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_20059 for (2999ds/275Mi)
% 1.61/1.33 % (20347)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_20059 for (2999ds/18Mi)
% 1.61/1.33 % (20345)Instruction limit reached!
% 1.61/1.33 % (20345)------------------------------
% 1.61/1.33 % (20345)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.33 % (20345)Termination reason: Unknown
% 1.61/1.33 % (20345)Termination phase: shuffling
% 1.61/1.33
% 1.61/1.33 % (20345)Memory used [KB]: 895
% 1.61/1.33 % (20345)Time elapsed: 0.003 s
% 1.61/1.33 % (20345)Instructions burned: 2 (million)
% 1.61/1.33 % (20345)------------------------------
% 1.61/1.33 % (20345)------------------------------
% 1.61/1.33 % (20348)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_20059 for (2999ds/3Mi)
% 1.61/1.33 % (20342)Instruction limit reached!
% 1.61/1.33 % (20342)------------------------------
% 1.61/1.33 % (20342)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.33 % (20342)Termination reason: Unknown
% 1.61/1.33 % (20342)Termination phase: Saturation
% 1.61/1.33
% 1.61/1.33 % (20342)Memory used [KB]: 5500
% 1.61/1.33 % (20342)Time elapsed: 0.005 s
% 1.61/1.33 % (20342)Instructions burned: 5 (million)
% 1.61/1.33 % (20342)------------------------------
% 1.61/1.33 % (20342)------------------------------
% 1.61/1.33 % (20346)First to succeed.
% 1.61/1.33 % (20348)Instruction limit reached!
% 1.61/1.33 % (20348)------------------------------
% 1.61/1.33 % (20348)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.33 % (20348)Termination reason: Unknown
% 1.61/1.33 % (20348)Termination phase: Saturation
% 1.61/1.33
% 1.61/1.33 % (20348)Memory used [KB]: 5500
% 1.61/1.33 % (20348)Time elapsed: 0.002 s
% 1.61/1.33 % (20348)Instructions burned: 3 (million)
% 1.61/1.33 % (20348)------------------------------
% 1.61/1.33 % (20348)------------------------------
% 1.61/1.33 % (20341)Also succeeded, but the first one will report.
% 1.61/1.33 % (20346)Refutation found. Thanks to Tanya!
% 1.61/1.33 % SZS status Theorem for DTF2THF_20059
% 1.61/1.33 % SZS output start Proof for DTF2THF_20059
% 1.61/1.33 thf(type_def_5, type, rat: $tType).
% 1.61/1.33 thf(func_def_0, type, rat: $tType).
% 1.61/1.33 thf(func_def_1, type, x0: rat).
% 1.61/1.33 thf(func_def_2, type, y0: rat).
% 1.61/1.33 thf(func_def_3, type, z0: rat).
% 1.61/1.33 thf(func_def_4, type, u0: rat).
% 1.61/1.33 thf(func_def_5, type, lessis: rat > rat > $o).
% 1.61/1.33 thf(func_def_7, type, less: rat > rat > $o).
% 1.61/1.33 thf(func_def_8, type, pl: rat > rat > rat).
% 1.61/1.33 thf(func_def_9, type, more: rat > rat > $o).
% 1.61/1.33 thf(func_def_10, type, moreis: rat > rat > $o).
% 1.61/1.33 thf(f63,plain,(
% 1.61/1.33 $false),
% 1.61/1.33 inference(avatar_sat_refutation,[status(thm)],[f54,f58,f62])).
% 1.61/1.33 thf(f62,plain,(
% 1.61/1.33 spl0_2),
% 1.61/1.33 inference(avatar_contradiction_clause,[status(thm)],[f61])).
% 1.61/1.33 thf(f61,plain,(
% 1.61/1.33 $false | spl0_2),
% 1.61/1.33 inference(subsumption_resolution,[status(thm)],[f60,f33])).
% 1.61/1.33 thf(f33,plain,(
% 1.61/1.33 ((lessis @ x0 @ y0) = $true)),
% 1.61/1.33 inference(cnf_transformation,[status(thm)],[f13])).
% 1.61/1.33 thf(f13,plain,(
% 1.61/1.33 ((lessis @ x0 @ y0) = $true)),
% 1.61/1.33 inference(fool_elimination,[status(thm)],[f12])).
% 1.61/1.34 thf(f12,plain,(
% 1.61/1.34 (lessis @ x0 @ y0)),
% 1.61/1.34 inference(rectify,[status(thm)],[f1])).
% 1.61/1.34 thf(f1,axiom,(
% 1.61/1.34 (lessis @ x0 @ y0)),
% 1.61/1.34 file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',l)).
% 1.61/1.34 thf(f60,plain,(
% 1.61/1.34 ((lessis @ x0 @ y0) != $true) | spl0_2),
% 1.61/1.34 inference(trivial_inequality_removal,[status(thm)],[f59])).
% 1.61/1.34 thf(f59,plain,(
% 1.61/1.34 ((lessis @ x0 @ y0) != $true) | ($true != $true) | spl0_2),
% 1.61/1.34 inference(superposition,[status(thm)],[f53,f37])).
% 1.61/1.34 thf(f37,plain,(
% 1.61/1.34 ( ! [X0 : rat,X1 : rat] : (((moreis @ X1 @ X0) = $true) | ((lessis @ X0 @ X1) != $true)) )),
% 1.61/1.34 inference(cnf_transformation,[status(thm)],[f30])).
% 1.61/1.34 thf(f30,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat] : (((lessis @ X0 @ X1) != $true) | ((moreis @ X1 @ X0) = $true))),
% 1.61/1.34 inference(rectify,[status(thm)],[f25])).
% 1.61/1.34 thf(f25,plain,(
% 1.61/1.34 ! [X1 : rat,X0 : rat] : (((lessis @ X1 @ X0) != $true) | ((moreis @ X0 @ X1) = $true))),
% 1.61/1.34 inference(ennf_transformation,[status(thm)],[f19])).
% 1.61/1.34 thf(f19,plain,(
% 1.61/1.34 ! [X1 : rat,X0 : rat] : (((lessis @ X1 @ X0) = $true) => ((moreis @ X0 @ X1) = $true))),
% 1.61/1.34 inference(fool_elimination,[status(thm)],[f18])).
% 1.61/1.34 thf(f18,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat] : ((lessis @ X1 @ X0) => (moreis @ X0 @ X1))),
% 1.61/1.34 inference(rectify,[status(thm)],[f5])).
% 1.61/1.34 thf(f5,axiom,(
% 1.61/1.34 ! [X1 : rat,X0 : rat] : ((lessis @ X0 @ X1) => (moreis @ X1 @ X0))),
% 1.61/1.34 file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz85)).
% 1.61/1.34 thf(f53,plain,(
% 1.61/1.34 ($true != (moreis @ y0 @ x0)) | spl0_2),
% 1.61/1.34 inference(avatar_component_clause,[status(thm)],[f51])).
% 1.61/1.34 thf(f51,definition,(
% 1.61/1.34 spl0_2 <=> ($true = (moreis @ y0 @ x0))),
% 1.61/1.34 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.61/1.34 thf(f58,plain,(
% 1.61/1.34 spl0_1),
% 1.61/1.34 inference(avatar_contradiction_clause,[status(thm)],[f57])).
% 1.61/1.34 thf(f57,plain,(
% 1.61/1.34 $false | spl0_1),
% 1.61/1.34 inference(subsumption_resolution,[status(thm)],[f56,f35])).
% 1.61/1.34 thf(f35,plain,(
% 1.61/1.34 ((less @ z0 @ u0) = $true)),
% 1.61/1.34 inference(cnf_transformation,[status(thm)],[f15])).
% 1.61/1.34 thf(f15,plain,(
% 1.61/1.34 ((less @ z0 @ u0) = $true)),
% 1.61/1.34 inference(fool_elimination,[status(thm)],[f14])).
% 1.61/1.34 thf(f14,plain,(
% 1.61/1.34 (less @ z0 @ u0)),
% 1.61/1.34 inference(rectify,[status(thm)],[f2])).
% 1.61/1.34 thf(f2,axiom,(
% 1.61/1.34 (less @ z0 @ u0)),
% 1.61/1.34 file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',k)).
% 1.61/1.34 thf(f56,plain,(
% 1.61/1.34 ((less @ z0 @ u0) != $true) | spl0_1),
% 1.61/1.34 inference(trivial_inequality_removal,[status(thm)],[f55])).
% 1.61/1.34 thf(f55,plain,(
% 1.61/1.34 ($true != $true) | ((less @ z0 @ u0) != $true) | spl0_1),
% 1.61/1.34 inference(superposition,[status(thm)],[f49,f38])).
% 1.61/1.34 thf(f38,plain,(
% 1.61/1.34 ( ! [X0 : rat,X1 : rat] : (((more @ X0 @ X1) = $true) | ((less @ X1 @ X0) != $true)) )),
% 1.61/1.34 inference(cnf_transformation,[status(thm)],[f31])).
% 1.61/1.34 thf(f31,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat] : (((less @ X1 @ X0) != $true) | ((more @ X0 @ X1) = $true))),
% 1.61/1.34 inference(rectify,[status(thm)],[f27])).
% 1.61/1.34 thf(f27,plain,(
% 1.61/1.34 ! [X1 : rat,X0 : rat] : (((less @ X0 @ X1) != $true) | ((more @ X1 @ X0) = $true))),
% 1.61/1.34 inference(ennf_transformation,[status(thm)],[f21])).
% 1.61/1.34 thf(f21,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat] : (((less @ X0 @ X1) = $true) => ((more @ X1 @ X0) = $true))),
% 1.61/1.34 inference(fool_elimination,[status(thm)],[f20])).
% 1.61/1.34 thf(f20,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat] : ((less @ X0 @ X1) => (more @ X1 @ X0))),
% 1.61/1.34 inference(rectify,[status(thm)],[f6])).
% 1.61/1.34 thf(f6,axiom,(
% 1.61/1.34 ! [X0 : rat,X1 : rat] : ((less @ X0 @ X1) => (more @ X1 @ X0))),
% 1.61/1.34 file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz83)).
% 1.61/1.34 thf(f49,plain,(
% 1.61/1.34 ((more @ u0 @ z0) != $true) | spl0_1),
% 1.61/1.34 inference(avatar_component_clause,[status(thm)],[f47])).
% 1.61/1.34 thf(f47,definition,(
% 1.61/1.34 spl0_1 <=> ((more @ u0 @ z0) = $true)),
% 1.61/1.34 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.61/1.34 thf(f54,plain,(
% 1.61/1.34 ~spl0_1 | ~spl0_2),
% 1.61/1.34 inference(avatar_split_clause,[status(thm)],[f45,f51,f47])).
% 1.61/1.34 thf(f45,plain,(
% 1.61/1.34 ($true != (moreis @ y0 @ x0)) | ((more @ u0 @ z0) != $true)),
% 1.61/1.34 inference(trivial_inequality_removal,[status(thm)],[f42])).
% 1.61/1.34 thf(f42,plain,(
% 1.61/1.34 ($true != (moreis @ y0 @ x0)) | ((more @ u0 @ z0) != $true) | ($true != $true)),
% 1.61/1.34 inference(superposition,[status(thm)],[f41,f39])).
% 1.61/1.34 thf(f39,plain,(
% 1.61/1.34 ( ! [X2 : rat,X3 : rat,X0 : rat,X1 : rat] : (((more @ (pl @ X2 @ X1) @ (pl @ X3 @ X0)) = $true) | ($true != (moreis @ X2 @ X3)) | ((more @ X1 @ X0) != $true)) )),
% 1.61/1.34 inference(cnf_transformation,[status(thm)],[f32])).
% 1.61/1.34 thf(f32,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat,X2 : rat,X3 : rat] : (((more @ (pl @ X2 @ X1) @ (pl @ X3 @ X0)) = $true) | ($true != (moreis @ X2 @ X3)) | ((more @ X1 @ X0) != $true))),
% 1.61/1.34 inference(rectify,[status(thm)],[f29])).
% 1.61/1.34 thf(f29,plain,(
% 1.61/1.34 ! [X0 : rat,X2 : rat,X1 : rat,X3 : rat] : (((more @ (pl @ X1 @ X2) @ (pl @ X3 @ X0)) = $true) | ((moreis @ X1 @ X3) != $true) | ($true != (more @ X2 @ X0)))),
% 1.61/1.34 inference(flattening,[status(thm)],[f28])).
% 1.61/1.34 thf(f28,plain,(
% 1.61/1.34 ! [X2 : rat,X3 : rat,X1 : rat,X0 : rat] : ((((more @ (pl @ X1 @ X2) @ (pl @ X3 @ X0)) = $true) | ($true != (more @ X2 @ X0))) | ((moreis @ X1 @ X3) != $true))),
% 1.61/1.34 inference(ennf_transformation,[status(thm)],[f11])).
% 1.61/1.34 thf(f11,plain,(
% 1.61/1.34 ! [X2 : rat,X3 : rat,X1 : rat,X0 : rat] : (((moreis @ X1 @ X3) = $true) => (($true = (more @ X2 @ X0)) => ((more @ (pl @ X1 @ X2) @ (pl @ X3 @ X0)) = $true)))),
% 1.61/1.34 inference(fool_elimination,[status(thm)],[f10])).
% 1.61/1.34 thf(f10,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat,X2 : rat,X3 : rat] : ((moreis @ X1 @ X3) => ((more @ X2 @ X0) => (more @ (pl @ X1 @ X2) @ (pl @ X3 @ X0))))),
% 1.61/1.34 inference(rectify,[status(thm)],[f4])).
% 1.61/1.34 thf(f4,axiom,(
% 1.61/1.34 ! [X3 : rat,X0 : rat,X2 : rat,X1 : rat] : ((moreis @ X0 @ X1) => ((more @ X2 @ X3) => (more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))))),
% 1.61/1.34 file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz99a)).
% 1.61/1.34 thf(f41,plain,(
% 1.61/1.34 ($true != (more @ (pl @ y0 @ u0) @ (pl @ x0 @ z0)))),
% 1.61/1.34 inference(trivial_inequality_removal,[status(thm)],[f40])).
% 1.61/1.34 thf(f40,plain,(
% 1.61/1.34 ($true != $true) | ($true != (more @ (pl @ y0 @ u0) @ (pl @ x0 @ z0)))),
% 1.61/1.34 inference(superposition,[status(thm)],[f34,f36])).
% 1.61/1.34 thf(f36,plain,(
% 1.61/1.34 ( ! [X0 : rat,X1 : rat] : (((less @ X0 @ X1) = $true) | ((more @ X1 @ X0) != $true)) )),
% 1.61/1.34 inference(cnf_transformation,[status(thm)],[f26])).
% 1.61/1.34 thf(f26,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat] : (((more @ X1 @ X0) != $true) | ((less @ X0 @ X1) = $true))),
% 1.61/1.34 inference(ennf_transformation,[status(thm)],[f17])).
% 1.61/1.34 thf(f17,plain,(
% 1.61/1.34 ! [X1 : rat,X0 : rat] : (((more @ X1 @ X0) = $true) => ((less @ X0 @ X1) = $true))),
% 1.61/1.34 inference(fool_elimination,[status(thm)],[f16])).
% 1.61/1.34 thf(f16,plain,(
% 1.61/1.34 ! [X0 : rat,X1 : rat] : ((more @ X1 @ X0) => (less @ X0 @ X1))),
% 1.61/1.34 inference(rectify,[status(thm)],[f3])).
% 1.61/1.34 thf(f3,axiom,(
% 1.61/1.34 ! [X1 : rat,X0 : rat] : ((more @ X0 @ X1) => (less @ X1 @ X0))),
% 1.61/1.34 file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz82)).
% 1.61/1.34 thf(f34,plain,(
% 1.61/1.34 ((less @ (pl @ x0 @ z0) @ (pl @ y0 @ u0)) != $true)),
% 1.61/1.34 inference(cnf_transformation,[status(thm)],[f24])).
% 1.61/1.34 thf(f24,plain,(
% 1.61/1.34 ((less @ (pl @ x0 @ z0) @ (pl @ y0 @ u0)) != $true)),
% 1.61/1.34 inference(flattening,[status(thm)],[f23])).
% 1.61/1.34 thf(f23,plain,(
% 1.61/1.34 ~((less @ (pl @ x0 @ z0) @ (pl @ y0 @ u0)) = $true)),
% 1.61/1.34 inference(fool_elimination,[status(thm)],[f22])).
% 1.61/1.34 thf(f22,plain,(
% 1.61/1.34 ~(less @ (pl @ x0 @ z0) @ (pl @ y0 @ u0))),
% 1.61/1.34 inference(rectify,[status(thm)],[f8])).
% 1.61/1.34 thf(f8,negated_conjecture,(
% 1.61/1.34 ~(less @ (pl @ x0 @ z0) @ (pl @ y0 @ u0))),
% 1.61/1.34 inference(negated_conjecture,[status(cth)],[f7])).
% 1.61/1.34 thf(f7,conjecture,(
% 1.61/1.34 (less @ (pl @ x0 @ z0) @ (pl @ y0 @ u0))),
% 1.61/1.34 file('/export/starexec/sandbox2/tmp/tmp.dHEDKg7Iuc/DTF2THF_20059.p',satz99c)).
% 1.61/1.34 % SZS output end Proof for DTF2THF_20059
% 1.61/1.34 % (20346)------------------------------
% 1.61/1.34 % (20346)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.61/1.34 % (20346)Termination reason: Refutation
% 1.61/1.34
% 1.61/1.34 % (20346)Memory used [KB]: 5500
% 1.61/1.34 % (20346)Time elapsed: 0.006 s
% 1.61/1.34 % (20346)Instructions burned: 4 (million)
% 1.61/1.34 % (20346)------------------------------
% 1.61/1.34 % (20346)------------------------------
% 1.61/1.34 % (20340)Success in time 0.022 s
%------------------------------------------------------------------------------