%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM792^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 : n008.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:45 AM UTC 2026
% Result : Theorem 1.62s 1.30s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 215 ( 63 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 248 ( 41 ~; 26 |; 0 &; 166 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 0 ^; 59 !; 0 ?; 59 :)
% 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,
moreis: rat > rat > $o ).
thf(func_def_6,type,
more: rat > rat > $o ).
thf(func_def_7,type,
less: rat > rat > $o ).
thf(func_def_8,type,
lessis: rat > rat > $o ).
thf(f55,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f54,f38]) ).
thf(f38,plain,
( ( moreis @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
( ( moreis @ x0 @ y0 )
= $true ),
inference(fool_elimination,[status(thm)],[f14]) ).
thf(f14,plain,
moreis @ x0 @ y0,
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
moreis @ x0 @ y0,
file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',m) ).
thf(f54,plain,
( ( moreis @ x0 @ y0 )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f51]) ).
thf(f51,plain,
( ( $true != $true )
| ( ( moreis @ x0 @ y0 )
!= $true ) ),
inference(superposition,[status(thm)],[f49,f35]) ).
thf(f35,plain,
( ( more @ y0 @ z0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f21]) ).
thf(f21,plain,
( ( more @ y0 @ z0 )
= $true ),
inference(fool_elimination,[status(thm)],[f20]) ).
thf(f20,plain,
more @ y0 @ z0,
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
more @ y0 @ z0,
file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',n) ).
thf(f49,plain,
! [X0: rat] :
( ( ( more @ X0 @ z0 )
!= $true )
| ( ( moreis @ x0 @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f48]) ).
thf(f48,plain,
! [X0: rat] :
( ( ( moreis @ x0 @ X0 )
!= $true )
| ( $true != $true )
| ( ( more @ X0 @ z0 )
!= $true ) ),
inference(superposition,[status(thm)],[f46,f37]) ).
thf(f37,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X1 @ X0 )
= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f28]) ).
thf(f28,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X1 @ X0 )
= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f23]) ).
thf(f23,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f22]) ).
thf(f22,plain,
! [X0: rat,X1: rat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,axiom,
! [X0: rat,X1: rat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz82) ).
thf(f46,plain,
! [X0: rat] :
( ( ( less @ z0 @ X0 )
!= $true )
| ( ( moreis @ x0 @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f45]) ).
thf(f45,plain,
! [X0: rat] :
( ( ( moreis @ x0 @ X0 )
!= $true )
| ( ( less @ z0 @ X0 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f44,f33]) ).
thf(f33,plain,
! [X0: rat,X1: rat] :
( ( ( lessis @ X0 @ X1 )
= $true )
| ( ( moreis @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f29]) ).
thf(f29,plain,
! [X0: rat,X1: rat] :
( ( ( moreis @ X1 @ X0 )
!= $true )
| ( ( lessis @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f19]) ).
thf(f19,plain,
! [X0: rat,X1: rat] :
( ( ( moreis @ X1 @ X0 )
= $true )
=> ( ( lessis @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f18]) ).
thf(f18,plain,
! [X0: rat,X1: rat] :
( ( moreis @ X1 @ X0 )
=> ( lessis @ X0 @ X1 ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,axiom,
! [X1: rat,X0: rat] :
( ( moreis @ X0 @ X1 )
=> ( lessis @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz84) ).
thf(f44,plain,
! [X0: rat] :
( ( ( lessis @ X0 @ x0 )
!= $true )
| ( ( less @ z0 @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f43]) ).
thf(f43,plain,
! [X0: rat] :
( ( $true != $true )
| ( ( lessis @ X0 @ x0 )
!= $true )
| ( ( less @ z0 @ X0 )
!= $true ) ),
inference(superposition,[status(thm)],[f40,f34]) ).
thf(f34,plain,
! [X2: rat,X0: rat,X1: rat] :
( ( ( less @ X2 @ X0 )
= $true )
| ( ( less @ X2 @ X1 )
!= $true )
| ( ( lessis @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
thf(f31,plain,
! [X0: rat,X1: rat,X2: rat] :
( ( ( less @ X2 @ X1 )
!= $true )
| ( ( less @ X2 @ X0 )
= $true )
| ( ( lessis @ X1 @ X0 )
!= $true ) ),
inference(rectify,[status(thm)],[f26]) ).
thf(f26,plain,
! [X1: rat,X0: rat,X2: rat] :
( ( ( less @ X2 @ X0 )
!= $true )
| ( ( less @ X2 @ X1 )
= $true )
| ( ( lessis @ X0 @ X1 )
!= $true ) ),
inference(flattening,[status(thm)],[f25]) ).
thf(f25,plain,
! [X0: rat,X2: rat,X1: rat] :
( ( ( less @ X2 @ X1 )
= $true )
| ( ( lessis @ X0 @ X1 )
!= $true )
| ( ( less @ X2 @ X0 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f17]) ).
thf(f17,plain,
! [X0: rat,X2: rat,X1: rat] :
( ( ( less @ X2 @ X0 )
= $true )
=> ( ( ( lessis @ X0 @ X1 )
= $true )
=> ( ( less @ X2 @ X1 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f16]) ).
thf(f16,plain,
! [X0: rat,X1: rat,X2: rat] :
( ( less @ X2 @ X0 )
=> ( ( lessis @ X0 @ X1 )
=> ( less @ X2 @ X1 ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,axiom,
! [X1: rat,X2: rat,X0: rat] :
( ( less @ X0 @ X1 )
=> ( ( lessis @ X1 @ X2 )
=> ( less @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz87b) ).
thf(f40,plain,
( ( less @ z0 @ x0 )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f39]) ).
thf(f39,plain,
( ( $true != $true )
| ( ( less @ z0 @ x0 )
!= $true ) ),
inference(superposition,[status(thm)],[f36,f32]) ).
thf(f32,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
thf(f30,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(rectify,[status(thm)],[f27]) ).
thf(f27,plain,
! [X1: rat,X0: rat] :
( ( ( more @ X1 @ X0 )
= $true )
| ( ( less @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
! [X1: rat,X0: rat] :
( ( ( less @ X0 @ X1 )
= $true )
=> ( ( more @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f12]) ).
thf(f12,plain,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X0: rat,X1: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz83) ).
thf(f36,plain,
( ( more @ x0 @ z0 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f24]) ).
thf(f24,plain,
( ( more @ x0 @ z0 )
!= $true ),
inference(flattening,[status(thm)],[f11]) ).
thf(f11,plain,
( ( more @ x0 @ z0 )
!= $true ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
~ ( more @ x0 @ z0 ),
inference(rectify,[status(thm)],[f8]) ).
thf(f8,negated_conjecture,
~ ( more @ x0 @ z0 ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f7,conjecture,
more @ x0 @ z0,
file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz87c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM792^1 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.12 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/0.33 % Computer : n008.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Feb 24 11:14:24 EST 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.33 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.44 ---- Original DTF file ---
% 0.18/0.44 thf(spec,logic,$$dhol).
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 % File : NUM792^1 : TPTP v9.2.1. Released v3.7.0.
% 0.18/0.44 % Domain : Number Theory
% 0.18/0.44 % Problem : Landau theorem 87c
% 0.18/0.44 % Version : Especial.
% 0.18/0.44 % English : more x0 z0
% 0.18/0.44
% 0.18/0.44 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.18/0.44 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.18/0.44 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.18/0.44 % Source : [Bro09]
% 0.18/0.44 % Names : satz87c [Lan30]
% 0.18/0.44 % : satz51c [Lan30]
% 0.18/0.44
% 0.18/0.44 % Status : Theorem
% 0.18/0.44 % : Without extensionality : Theorem
% 0.18/0.44 % Rating : 0.00 v4.0.1, 0.33 v4.0.0, 0.00 v3.7.0
% 0.18/0.44 % Syntax : Number of formulae : 15 ( 3 unt; 8 typ; 0 def)
% 0.18/0.44 % Number of atoms : 12 ( 0 equ; 0 cnn)
% 0.18/0.44 % Maximal formula atoms : 3 ( 1 avg)
% 0.18/0.44 % Number of connectives : 29 ( 0 ~; 0 |; 0 &; 24 @)
% 0.18/0.44 % ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% 0.18/0.44 % Maximal formula depth : 8 ( 5 avg)
% 0.18/0.45 % Number of types : 2 ( 1 usr)
% 0.18/0.45 % Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% 0.18/0.45 % Number of symbols : 7 ( 7 usr; 3 con; 0-2 aty)
% 0.18/0.45 % Number of variables : 9 ( 0 ^; 9 !; 0 ?; 9 :)
% 0.18/0.45 % SPC : TH0_THM_NEQ_NAR
% 0.18/0.45
% 0.18/0.45 % Comments :
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 thf(rat_type,type,
% 0.18/0.45 rat: $tType ).
% 0.18/0.45
% 0.18/0.45 thf(x0,type,
% 0.18/0.45 x0: rat ).
% 0.18/0.45
% 0.18/0.45 thf(y0,type,
% 0.18/0.45 y0: rat ).
% 0.18/0.45
% 0.18/0.45 thf(z0,type,
% 0.18/0.45 z0: rat ).
% 0.18/0.45
% 0.18/0.45 thf(moreis,type,
% 0.18/0.45 moreis: rat > rat > $o ).
% 0.18/0.45
% 0.18/0.45 thf(m,axiom,
% 0.18/0.45 moreis @ x0 @ y0 ).
% 0.18/0.45
% 0.18/0.45 thf(more,type,
% 0.18/0.45 more: rat > rat > $o ).
% 0.18/0.45
% 0.18/0.45 thf(n,axiom,
% 0.18/0.45 more @ y0 @ z0 ).
% 0.18/0.45
% 0.18/0.45 thf(less,type,
% 0.18/0.45 less: rat > rat > $o ).
% 0.18/0.45
% 0.18/0.45 thf(satz83,axiom,
% 0.18/0.45 ! [Xx0: rat,Xy0: rat] :
% 0.18/0.45 ( ( less @ Xx0 @ Xy0 )
% 0.18/0.45 => ( more @ Xy0 @ Xx0 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(lessis,type,
% 0.18/0.45 lessis: rat > rat > $o ).
% 0.18/0.45
% 0.18/0.45 thf(satz87b,axiom,
% 0.18/0.45 ! [Xx0: rat,Xy0: rat,Xz0: rat] :
% 0.18/0.45 ( ( less @ Xx0 @ Xy0 )
% 0.18/0.45 => ( ( lessis @ Xy0 @ Xz0 )
% 0.18/0.45 => ( less @ Xx0 @ Xz0 ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(satz82,axiom,
% 0.18/0.45 ! [Xx0: rat,Xy0: rat] :
% 0.18/0.45 ( ( more @ Xx0 @ Xy0 )
% 0.18/0.45 => ( less @ Xy0 @ Xx0 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(satz84,axiom,
% 0.18/0.45 ! [Xx0: rat,Xy0: rat] :
% 0.18/0.45 ( ( moreis @ Xx0 @ Xy0 )
% 0.18/0.45 => ( lessis @ Xy0 @ Xx0 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(satz87c,conjecture,
% 0.18/0.45 more @ x0 @ z0 ).
% 0.18/0.45
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 ------------------------
% 1.46/1.26 ---- Embedded in THF ---
% 1.46/1.26 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.46/1.26 %%% Generated on Tue Feb 24 11:14:25 EST 2026
% 1.46/1.26 %%% using '$$dhol' embedding, version 1.3.0.
% 1.46/1.26 %%% Logic specification used:
% 1.46/1.26 %%% thf(spec, logic, $$dhol).
% 1.46/1.26
% 1.46/1.26 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2DTF26657.p
% See solution above
% 1.46/1.26 ------------------------
% 1.46/1.27 ---- Cleaned THF ---
% 1.46/1.27 thf(rat_type,type,
% 1.46/1.27 rat: $tType ).
% 1.46/1.27
% 1.46/1.27 thf(x0,type,
% 1.46/1.27 x0: rat ).
% 1.46/1.27
% 1.46/1.27 thf(y0,type,
% 1.46/1.27 y0: rat ).
% 1.46/1.27
% 1.46/1.27 thf(z0,type,
% 1.46/1.27 z0: rat ).
% 1.46/1.27
% 1.46/1.27 thf(moreis,type,
% 1.46/1.27 moreis: rat > rat > $o ).
% 1.46/1.27
% 1.46/1.27 thf(m,axiom,
% 1.46/1.27 moreis @ x0 @ y0 ).
% 1.46/1.27
% 1.46/1.27 thf(more,type,
% 1.46/1.27 more: rat > rat > $o ).
% 1.46/1.27
% 1.46/1.27 thf(n,axiom,
% 1.46/1.27 more @ y0 @ z0 ).
% 1.46/1.27
% 1.46/1.27 thf(less,type,
% 1.46/1.27 less: rat > rat > $o ).
% 1.46/1.27
% 1.46/1.27 thf(satz83,axiom,
% 1.46/1.27 ! [Xx0: rat,Xy0: rat] :
% 1.46/1.27 ( ( less @ Xx0 @ Xy0 )
% 1.46/1.27 => ( more @ Xy0 @ Xx0 ) ) ).
% 1.46/1.27
% 1.46/1.27 thf(lessis,type,
% 1.46/1.27 lessis: rat > rat > $o ).
% 1.46/1.27
% 1.46/1.27 thf(satz87b,axiom,
% 1.46/1.27 ! [Xx0: rat,Xy0: rat,Xz0: rat] :
% 1.46/1.27 ( ( less @ Xx0 @ Xy0 )
% 1.46/1.27 => ( ( lessis @ Xy0 @ Xz0 )
% 1.46/1.27 => ( less @ Xx0 @ Xz0 ) ) ) ).
% 1.46/1.27
% 1.46/1.27 thf(satz82,axiom,
% 1.46/1.27 ! [Xx0: rat,Xy0: rat] :
% 1.46/1.27 ( ( more @ Xx0 @ Xy0 )
% 1.46/1.27 => ( less @ Xy0 @ Xx0 ) ) ).
% 1.46/1.27
% 1.46/1.27 thf(satz84,axiom,
% 1.46/1.27 ! [Xx0: rat,Xy0: rat] :
% 1.46/1.27 ( ( moreis @ Xx0 @ Xy0 )
% 1.46/1.27 => ( lessis @ Xy0 @ Xx0 ) ) ).
% 1.46/1.27
% 1.46/1.27 thf(satz87c,conjecture,
% 1.46/1.27 more @ x0 @ z0 ).
% 1.46/1.27 ------------------------
% 1.46/1.29 % (26932)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_26657 for (2999ds/275Mi)
% 1.46/1.29 % (26930)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_26657 for (2999ds/2Mi)
% 1.46/1.29 % (26932)Refutation not found, incomplete strategy
% 1.46/1.29 % (26932)------------------------------
% 1.46/1.29 % (26932)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.29 % (26932)Termination reason: Refutation not found, incomplete strategy
% 1.46/1.29
% 1.46/1.29
% 1.46/1.29 % (26932)Memory used [KB]: 5500
% 1.46/1.29 % (26932)Time elapsed: 0.002 s
% 1.46/1.29 % (26932)Instructions burned: 2 (million)
% 1.46/1.29 % (26932)------------------------------
% 1.46/1.29 % (26932)------------------------------
% 1.46/1.29 % (26930)Instruction limit reached!
% 1.46/1.29 % (26930)------------------------------
% 1.46/1.29 % (26930)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.29 % (26930)Termination reason: Unknown
% 1.46/1.29 % (26930)Termination phase: Saturation
% 1.46/1.29
% 1.46/1.29 % (26930)Memory used [KB]: 5500
% 1.46/1.29 % (26930)Time elapsed: 0.002 s
% 1.46/1.29 % (26930)Instructions burned: 2 (million)
% 1.46/1.29 % (26930)------------------------------
% 1.46/1.29 % (26930)------------------------------
% 1.62/1.30 % (26927)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_26657 for (2999ds/183Mi)
% 1.62/1.30 % (26928)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_26657 for (2999ds/4Mi)
% 1.62/1.30 % (26929)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_26657 for (2999ds/27Mi)
% 1.62/1.30 % (26931)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_26657 for (2999ds/2Mi)
% 1.62/1.30 % (26933)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_26657 for (2999ds/18Mi)
% 1.62/1.30 % (26931)Instruction limit reached!
% 1.62/1.30 % (26931)------------------------------
% 1.62/1.30 % (26931)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.62/1.30 % (26931)Termination reason: Unknown
% 1.62/1.30 % (26931)Termination phase: Property scanning
% 1.62/1.30
% 1.62/1.30 % (26931)Memory used [KB]: 895
% 1.62/1.30 % (26931)Time elapsed: 0.003 s
% 1.62/1.30 % (26931)Instructions burned: 2 (million)
% 1.62/1.30 % (26931)------------------------------
% 1.62/1.30 % (26931)------------------------------
% 1.62/1.30 % (26928)Instruction limit reached!
% 1.62/1.30 % (26928)------------------------------
% 1.62/1.30 % (26928)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.62/1.30 % (26928)Termination reason: Unknown
% 1.62/1.30 % (26928)Termination phase: Saturation
% 1.62/1.30
% 1.62/1.30 % (26928)Memory used [KB]: 5500
% 1.62/1.30 % (26928)Time elapsed: 0.005 s
% 1.62/1.30 % (26928)Instructions burned: 5 (million)
% 1.62/1.30 % (26928)------------------------------
% 1.62/1.30 % (26928)------------------------------
% 1.62/1.30 % (26927)First to succeed.
% 1.62/1.30 % (26935)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_26657 for (2999ds/37Mi)
% 1.62/1.30 % (26929)Also succeeded, but the first one will report.
% 1.62/1.30 % (26927)Refutation found. Thanks to Tanya!
% 1.62/1.30 % SZS status Theorem for DTF2THF_26657
% 1.62/1.30 % SZS output start Proof for DTF2THF_26657
% 1.62/1.30 thf(type_def_5, type, rat: $tType).
% 1.62/1.30 thf(func_def_0, type, rat: $tType).
% 1.62/1.30 thf(func_def_1, type, x0: rat).
% 1.62/1.30 thf(func_def_2, type, y0: rat).
% 1.62/1.30 thf(func_def_3, type, z0: rat).
% 1.62/1.30 thf(func_def_4, type, moreis: rat > rat > $o).
% 1.62/1.30 thf(func_def_6, type, more: rat > rat > $o).
% 1.62/1.30 thf(func_def_7, type, less: rat > rat > $o).
% 1.62/1.30 thf(func_def_8, type, lessis: rat > rat > $o).
% 1.62/1.30 thf(f55,plain,(
% 1.62/1.30 $false),
% 1.62/1.30 inference(subsumption_resolution,[status(thm)],[f54,f38])).
% 1.62/1.30 thf(f38,plain,(
% 1.62/1.30 ((moreis @ x0 @ y0) = $true)),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f15])).
% 1.62/1.30 thf(f15,plain,(
% 1.62/1.30 ((moreis @ x0 @ y0) = $true)),
% 1.62/1.30 inference(fool_elimination,[status(thm)],[f14])).
% 1.62/1.30 thf(f14,plain,(
% 1.62/1.30 (moreis @ x0 @ y0)),
% 1.62/1.30 inference(rectify,[status(thm)],[f1])).
% 1.62/1.30 thf(f1,axiom,(
% 1.62/1.30 (moreis @ x0 @ y0)),
% 1.62/1.30 file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',m)).
% 1.62/1.30 thf(f54,plain,(
% 1.62/1.30 ((moreis @ x0 @ y0) != $true)),
% 1.62/1.30 inference(trivial_inequality_removal,[status(thm)],[f51])).
% 1.62/1.30 thf(f51,plain,(
% 1.62/1.30 ($true != $true) | ((moreis @ x0 @ y0) != $true)),
% 1.62/1.30 inference(superposition,[status(thm)],[f49,f35])).
% 1.62/1.30 thf(f35,plain,(
% 1.62/1.30 ((more @ y0 @ z0) = $true)),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f21])).
% 1.62/1.30 thf(f21,plain,(
% 1.62/1.30 ((more @ y0 @ z0) = $true)),
% 1.62/1.30 inference(fool_elimination,[status(thm)],[f20])).
% 1.62/1.30 thf(f20,plain,(
% 1.62/1.30 (more @ y0 @ z0)),
% 1.62/1.30 inference(rectify,[status(thm)],[f2])).
% 1.62/1.30 thf(f2,axiom,(
% 1.62/1.30 (more @ y0 @ z0)),
% 1.62/1.30 file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',n)).
% 1.62/1.30 thf(f49,plain,(
% 1.62/1.30 ( ! [X0 : rat] : (((more @ X0 @ z0) != $true) | ((moreis @ x0 @ X0) != $true)) )),
% 1.62/1.30 inference(trivial_inequality_removal,[status(thm)],[f48])).
% 1.62/1.30 thf(f48,plain,(
% 1.62/1.30 ( ! [X0 : rat] : (((moreis @ x0 @ X0) != $true) | ($true != $true) | ((more @ X0 @ z0) != $true)) )),
% 1.62/1.30 inference(superposition,[status(thm)],[f46,f37])).
% 1.62/1.30 thf(f37,plain,(
% 1.62/1.30 ( ! [X0 : rat,X1 : rat] : (((less @ X1 @ X0) = $true) | ((more @ X0 @ X1) != $true)) )),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f28])).
% 1.62/1.30 thf(f28,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : (((less @ X1 @ X0) = $true) | ((more @ X0 @ X1) != $true))),
% 1.62/1.30 inference(ennf_transformation,[status(thm)],[f23])).
% 1.62/1.30 thf(f23,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : (((more @ X0 @ X1) = $true) => ((less @ X1 @ X0) = $true))),
% 1.62/1.30 inference(fool_elimination,[status(thm)],[f22])).
% 1.62/1.30 thf(f22,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : ((more @ X0 @ X1) => (less @ X1 @ X0))),
% 1.62/1.30 inference(rectify,[status(thm)],[f5])).
% 1.62/1.30 thf(f5,axiom,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : ((more @ X0 @ X1) => (less @ X1 @ X0))),
% 1.62/1.30 file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz82)).
% 1.62/1.30 thf(f46,plain,(
% 1.62/1.30 ( ! [X0 : rat] : (((less @ z0 @ X0) != $true) | ((moreis @ x0 @ X0) != $true)) )),
% 1.62/1.30 inference(trivial_inequality_removal,[status(thm)],[f45])).
% 1.62/1.30 thf(f45,plain,(
% 1.62/1.30 ( ! [X0 : rat] : (((moreis @ x0 @ X0) != $true) | ((less @ z0 @ X0) != $true) | ($true != $true)) )),
% 1.62/1.30 inference(superposition,[status(thm)],[f44,f33])).
% 1.62/1.30 thf(f33,plain,(
% 1.62/1.30 ( ! [X0 : rat,X1 : rat] : (((lessis @ X0 @ X1) = $true) | ((moreis @ X1 @ X0) != $true)) )),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f29])).
% 1.62/1.30 thf(f29,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : (((moreis @ X1 @ X0) != $true) | ((lessis @ X0 @ X1) = $true))),
% 1.62/1.30 inference(ennf_transformation,[status(thm)],[f19])).
% 1.62/1.30 thf(f19,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : (((moreis @ X1 @ X0) = $true) => ((lessis @ X0 @ X1) = $true))),
% 1.62/1.30 inference(fool_elimination,[status(thm)],[f18])).
% 1.62/1.30 thf(f18,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : ((moreis @ X1 @ X0) => (lessis @ X0 @ X1))),
% 1.62/1.30 inference(rectify,[status(thm)],[f6])).
% 1.62/1.30 thf(f6,axiom,(
% 1.62/1.30 ! [X1 : rat,X0 : rat] : ((moreis @ X0 @ X1) => (lessis @ X1 @ X0))),
% 1.62/1.30 file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz84)).
% 1.62/1.30 thf(f44,plain,(
% 1.62/1.30 ( ! [X0 : rat] : (((lessis @ X0 @ x0) != $true) | ((less @ z0 @ X0) != $true)) )),
% 1.62/1.30 inference(trivial_inequality_removal,[status(thm)],[f43])).
% 1.62/1.30 thf(f43,plain,(
% 1.62/1.30 ( ! [X0 : rat] : (($true != $true) | ((lessis @ X0 @ x0) != $true) | ((less @ z0 @ X0) != $true)) )),
% 1.62/1.30 inference(superposition,[status(thm)],[f40,f34])).
% 1.62/1.30 thf(f34,plain,(
% 1.62/1.30 ( ! [X2 : rat,X0 : rat,X1 : rat] : (((less @ X2 @ X0) = $true) | ((less @ X2 @ X1) != $true) | ((lessis @ X1 @ X0) != $true)) )),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f31])).
% 1.62/1.30 thf(f31,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat,X2 : rat] : (((less @ X2 @ X1) != $true) | ((less @ X2 @ X0) = $true) | ((lessis @ X1 @ X0) != $true))),
% 1.62/1.30 inference(rectify,[status(thm)],[f26])).
% 1.62/1.30 thf(f26,plain,(
% 1.62/1.30 ! [X1 : rat,X0 : rat,X2 : rat] : (((less @ X2 @ X0) != $true) | ((less @ X2 @ X1) = $true) | ((lessis @ X0 @ X1) != $true))),
% 1.62/1.30 inference(flattening,[status(thm)],[f25])).
% 1.62/1.30 thf(f25,plain,(
% 1.62/1.30 ! [X0 : rat,X2 : rat,X1 : rat] : ((((less @ X2 @ X1) = $true) | ((lessis @ X0 @ X1) != $true)) | ((less @ X2 @ X0) != $true))),
% 1.62/1.30 inference(ennf_transformation,[status(thm)],[f17])).
% 1.62/1.30 thf(f17,plain,(
% 1.62/1.30 ! [X0 : rat,X2 : rat,X1 : rat] : (((less @ X2 @ X0) = $true) => (((lessis @ X0 @ X1) = $true) => ((less @ X2 @ X1) = $true)))),
% 1.62/1.30 inference(fool_elimination,[status(thm)],[f16])).
% 1.62/1.30 thf(f16,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat,X2 : rat] : ((less @ X2 @ X0) => ((lessis @ X0 @ X1) => (less @ X2 @ X1)))),
% 1.62/1.30 inference(rectify,[status(thm)],[f4])).
% 1.62/1.30 thf(f4,axiom,(
% 1.62/1.30 ! [X1 : rat,X2 : rat,X0 : rat] : ((less @ X0 @ X1) => ((lessis @ X1 @ X2) => (less @ X0 @ X2)))),
% 1.62/1.30 file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz87b)).
% 1.62/1.30 thf(f40,plain,(
% 1.62/1.30 ((less @ z0 @ x0) != $true)),
% 1.62/1.30 inference(trivial_inequality_removal,[status(thm)],[f39])).
% 1.62/1.30 thf(f39,plain,(
% 1.62/1.30 ($true != $true) | ((less @ z0 @ x0) != $true)),
% 1.62/1.30 inference(superposition,[status(thm)],[f36,f32])).
% 1.62/1.30 thf(f32,plain,(
% 1.62/1.30 ( ! [X0 : rat,X1 : rat] : (((more @ X0 @ X1) = $true) | ((less @ X1 @ X0) != $true)) )),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f30])).
% 1.62/1.30 thf(f30,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : (((more @ X0 @ X1) = $true) | ((less @ X1 @ X0) != $true))),
% 1.62/1.30 inference(rectify,[status(thm)],[f27])).
% 1.62/1.30 thf(f27,plain,(
% 1.62/1.30 ! [X1 : rat,X0 : rat] : (((more @ X1 @ X0) = $true) | ((less @ X0 @ X1) != $true))),
% 1.62/1.30 inference(ennf_transformation,[status(thm)],[f13])).
% 1.62/1.30 thf(f13,plain,(
% 1.62/1.30 ! [X1 : rat,X0 : rat] : (((less @ X0 @ X1) = $true) => ((more @ X1 @ X0) = $true))),
% 1.62/1.30 inference(fool_elimination,[status(thm)],[f12])).
% 1.62/1.30 thf(f12,plain,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : ((less @ X0 @ X1) => (more @ X1 @ X0))),
% 1.62/1.30 inference(rectify,[status(thm)],[f3])).
% 1.62/1.30 thf(f3,axiom,(
% 1.62/1.30 ! [X0 : rat,X1 : rat] : ((less @ X0 @ X1) => (more @ X1 @ X0))),
% 1.62/1.30 file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz83)).
% 1.62/1.30 thf(f36,plain,(
% 1.62/1.30 ((more @ x0 @ z0) != $true)),
% 1.62/1.30 inference(cnf_transformation,[status(thm)],[f24])).
% 1.62/1.30 thf(f24,plain,(
% 1.62/1.30 ((more @ x0 @ z0) != $true)),
% 1.62/1.30 inference(flattening,[status(thm)],[f11])).
% 1.62/1.30 thf(f11,plain,(
% 1.62/1.30 ~((more @ x0 @ z0) = $true)),
% 1.62/1.30 inference(fool_elimination,[status(thm)],[f10])).
% 1.62/1.30 thf(f10,plain,(
% 1.62/1.30 ~(more @ x0 @ z0)),
% 1.62/1.30 inference(rectify,[status(thm)],[f8])).
% 1.62/1.30 thf(f8,negated_conjecture,(
% 1.62/1.30 ~(more @ x0 @ z0)),
% 1.62/1.30 inference(negated_conjecture,[status(cth)],[f7])).
% 1.62/1.30 thf(f7,conjecture,(
% 1.62/1.30 (more @ x0 @ z0)),
% 1.62/1.30 file('/export/starexec/sandbox/tmp/tmp.umMeemqCkf/DTF2THF_26657.p',satz87c)).
% 1.62/1.30 % SZS output end Proof for DTF2THF_26657
% 1.62/1.30 % (26927)------------------------------
% 1.62/1.30 % (26927)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.62/1.30 % (26927)Termination reason: Refutation
% 1.62/1.30
% 1.62/1.30 % (26927)Memory used [KB]: 5500
% 1.62/1.30 % (26927)Time elapsed: 0.006 s
% 1.62/1.30 % (26927)Instructions burned: 4 (million)
% 1.62/1.30 % (26927)------------------------------
% 1.62/1.30 % (26927)------------------------------
% 1.62/1.30 % (26926)Success in time 0.021 s
%------------------------------------------------------------------------------