%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM676^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 : n016.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:13 AM UTC 2026
% Result : Theorem 1.67s 1.40s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 19 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 121 ( 12 ~; 4 |; 0 &; 102 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 ^; 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
z: nat ).
thf(func_def_4,type,
u: nat ).
thf(func_def_5,type,
more: nat > nat > $o ).
thf(func_def_7,type,
pl: nat > nat > nat ).
thf(f23,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f22,f16]) ).
thf(f16,plain,
( ( more @ z @ u )
= $true ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( more @ z @ u )
= $true ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
more @ z @ u,
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
more @ z @ u,
file('/export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2THF_2613.p',m) ).
thf(f22,plain,
( ( more @ z @ u )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f21]) ).
thf(f21,plain,
( ( ( more @ z @ u )
!= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f20,f18]) ).
thf(f18,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X1 @ X0 ) )
= $true )
| ( ( more @ X2 @ X0 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X1 @ X0 ) )
= $true )
| ( ( more @ X2 @ X0 )
!= $true ) ),
inference(rectify,[status(thm)],[f14]) ).
thf(f14,plain,
! [X1: nat,X2: nat,X0: nat] :
( ( ( more @ ( pl @ X2 @ X0 ) @ ( pl @ X2 @ X1 ) )
= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( more @ X0 @ X1 )
= $true )
=> ( ( more @ ( pl @ X2 @ X0 ) @ ( pl @ X2 @ X1 ) )
= $true ) ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( more @ X0 @ X1 )
=> ( more @ ( pl @ X2 @ X0 ) @ ( pl @ X2 @ X1 ) ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X0: nat,X1: nat,X2: nat] :
( ( more @ X0 @ X1 )
=> ( more @ ( pl @ X2 @ X0 ) @ ( pl @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2THF_2613.p',satz19d) ).
thf(f20,plain,
( ( more @ ( pl @ y @ z ) @ ( pl @ y @ u ) )
!= $true ),
inference(definition_unfolding,[status(thm)],[f17,f19]) ).
thf(f19,plain,
x = y,
inference(cnf_transformation,[status(thm)],[f1]) ).
thf(f1,axiom,
x = y,
file('/export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2THF_2613.p',i) ).
thf(f17,plain,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
!= $true ),
inference(flattening,[status(thm)],[f10]) ).
thf(f10,plain,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
!= $true ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
more @ ( pl @ x @ z ) @ ( pl @ y @ u ),
file('/export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2THF_2613.p',satz19g) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM676^1 : TPTP v9.2.1. Released v3.7.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.18/0.35 % Computer : n016.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Tue Feb 24 11:10:51 EST 2026
% 0.18/0.36 % CPUTime :
% 0.18/0.36 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.22/0.45 ---- Original DTF file ---
% 0.22/0.46 thf(spec,logic,$$dhol).
% 0.22/0.46 %------------------------------------------------------------------------------
% 0.22/0.46 % File : NUM676^1 : TPTP v9.2.1. Released v3.7.0.
% 0.22/0.46 % Domain : Number Theory
% 0.22/0.46 % Problem : Landau theorem 19g
% 0.22/0.46 % Version : Especial.
% 0.22/0.46 % English : more (pl x z) (pl y u)
% 0.22/0.46
% 0.22/0.46 % Refs : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.22/0.46 % : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.22/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.22/0.46 % Source : [Bro09]
% 0.22/0.46 % Names : satz19g [Lan30]
% 0.22/0.46 % : satz19j [Lan30]
% 0.22/0.46 % : satz32g [Lan30]
% 0.22/0.46
% 0.22/0.46 % Status : Theorem
% 0.22/0.46 % : Without extensionality : Theorem
% 0.22/0.46 % Rating : 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.0, 0.33 v3.7.0
% 0.22/0.46 % Syntax : Number of formulae : 11 ( 3 unt; 7 typ; 0 def)
% 0.22/0.46 % Number of atoms : 5 ( 1 equ; 0 cnn)
% 0.22/0.46 % Maximal formula atoms : 2 ( 1 avg)
% 0.22/0.46 % Number of connectives : 17 ( 0 ~; 0 |; 0 &; 16 @)
% 0.22/0.46 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.22/0.46 % Maximal formula depth : 9 ( 5 avg)
% 0.22/0.46 % Number of types : 2 ( 1 usr)
% 0.22/0.46 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.22/0.46 % Number of symbols : 7 ( 6 usr; 4 con; 0-2 aty)
% 0.22/0.46 % Number of variables : 3 ( 0 ^; 3 !; 0 ?; 3 :)
% 0.22/0.46 % SPC : TH0_THM_EQU_NAR
% 0.22/0.46
% 0.22/0.46 % Comments :
% 0.22/0.46 %------------------------------------------------------------------------------
% 0.22/0.46 thf(nat_type,type,
% 0.22/0.46 nat: $tType ).
% 0.22/0.46
% 0.22/0.46 thf(x,type,
% 0.22/0.46 x: nat ).
% 0.22/0.46
% 0.22/0.46 thf(y,type,
% 0.22/0.46 y: nat ).
% 0.22/0.46
% 0.22/0.46 thf(z,type,
% 0.22/0.46 z: nat ).
% 0.22/0.46
% 0.22/0.46 thf(u,type,
% 0.22/0.46 u: nat ).
% 0.22/0.46
% 0.22/0.46 thf(i,axiom,
% 0.22/0.46 x = y ).
% 0.22/0.46
% 0.22/0.46 thf(more,type,
% 0.22/0.46 more: nat > nat > $o ).
% 0.22/0.46
% 0.22/0.46 thf(m,axiom,
% 0.22/0.46 more @ z @ u ).
% 0.22/0.46
% 0.22/0.46 thf(pl,type,
% 0.22/0.46 pl: nat > nat > nat ).
% 0.22/0.46
% 0.22/0.46 thf(satz19d,axiom,
% 0.22/0.46 ! [Xx: nat,Xy: nat,Xz: nat] :
% 0.22/0.46 ( ( more @ Xx @ Xy )
% 0.22/0.46 => ( more @ ( pl @ Xz @ Xx ) @ ( pl @ Xz @ Xy ) ) ) ).
% 0.22/0.46
% 0.22/0.46 thf(satz19g,conjecture,
% 0.22/0.46 more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ).
% 0.22/0.46
% 0.22/0.46 %------------------------------------------------------------------------------
% 0.22/0.46 ------------------------
% 1.50/1.37 ---- Embedded in THF ---
% 1.50/1.37 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.50/1.37 %%% Generated on Tue Feb 24 11:10:52 EST 2026
% 1.50/1.37 %%% using '$$dhol' embedding, version 1.3.0.
% 1.50/1.37 %%% Logic specification used:
% 1.50/1.37 %%% thf(spec, logic, $$dhol).
% 1.50/1.37
% 1.50/1.37 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2DTF2613.p
% See solution above
% 1.50/1.37 ------------------------
% 1.50/1.38 ---- Cleaned THF ---
% 1.50/1.38 thf(nat_type,type,
% 1.50/1.38 nat: $tType ).
% 1.50/1.38
% 1.50/1.38 thf(x,type,
% 1.50/1.38 x: nat ).
% 1.50/1.38
% 1.50/1.38 thf(y,type,
% 1.50/1.38 y: nat ).
% 1.50/1.38
% 1.50/1.38 thf(z,type,
% 1.50/1.38 z: nat ).
% 1.50/1.38
% 1.50/1.38 thf(u,type,
% 1.50/1.38 u: nat ).
% 1.50/1.38
% 1.50/1.38 thf(i,axiom,
% 1.50/1.38 x = y ).
% 1.50/1.38
% 1.50/1.38 thf(more,type,
% 1.50/1.38 more: nat > nat > $o ).
% 1.50/1.38
% 1.50/1.38 thf(m,axiom,
% 1.50/1.38 more @ z @ u ).
% 1.50/1.38
% 1.50/1.38 thf(pl,type,
% 1.50/1.38 pl: nat > nat > nat ).
% 1.50/1.38
% 1.50/1.38 thf(satz19d,axiom,
% 1.50/1.38 ! [Xx: nat,Xy: nat,Xz: nat] :
% 1.50/1.38 ( ( more @ Xx @ Xy )
% 1.50/1.38 => ( more @ ( pl @ Xz @ Xx ) @ ( pl @ Xz @ Xy ) ) ) ).
% 1.50/1.38
% 1.50/1.38 thf(satz19g,conjecture,
% 1.50/1.38 more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ).
% 1.50/1.38 ------------------------
% 1.50/1.40 % (2715)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_2613 for (2999ds/2Mi)
% 1.50/1.40 % (2717)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_2613 for (2999ds/18Mi)
% 1.50/1.40 % (2713)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_2613 for (2999ds/27Mi)
% 1.50/1.40 % (2712)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_2613 for (2999ds/4Mi)
% 1.50/1.40 % (2716)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_2613 for (2999ds/275Mi)
% 1.50/1.40 % (2714)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_2613 for (2999ds/2Mi)
% 1.50/1.40 % (2711)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_2613 for (2999ds/183Mi)
% 1.67/1.40 % (2715)Instruction limit reached!
% 1.67/1.40 % (2715)------------------------------
% 1.67/1.40 % (2715)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.67/1.40 % (2715)Termination reason: Unknown
% 1.67/1.40 % (2715)Termination phase: Saturation
% 1.67/1.40
% 1.67/1.40 % (2715)Memory used [KB]: 895
% 1.67/1.40 % (2715)Time elapsed: 0.003 s
% 1.67/1.40 % (2715)Instructions burned: 2 (million)
% 1.67/1.40 % (2715)------------------------------
% 1.67/1.40 % (2715)------------------------------
% 1.67/1.40 % (2714)Instruction limit reached!
% 1.67/1.40 % (2714)------------------------------
% 1.67/1.40 % (2714)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.67/1.40 % (2714)Termination reason: Unknown
% 1.67/1.40 % (2714)Termination phase: Saturation
% 1.67/1.40
% 1.67/1.40 % (2716)First to succeed.
% 1.67/1.40 % (2714)Memory used [KB]: 5500
% 1.67/1.40 % (2714)Time elapsed: 0.004 s
% 1.67/1.40 % (2714)Instructions burned: 2 (million)
% 1.67/1.40 % (2714)------------------------------
% 1.67/1.40 % (2714)------------------------------
% 1.67/1.40 % (2711)Also succeeded, but the first one will report.
% 1.67/1.40 % (2712)Instruction limit reached!
% 1.67/1.40 % (2712)------------------------------
% 1.67/1.40 % (2712)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.67/1.40 % (2712)Termination reason: Unknown
% 1.67/1.40 % (2712)Termination phase: Saturation
% 1.67/1.40
% 1.67/1.40 % (2712)Memory used [KB]: 5500
% 1.67/1.40 % (2712)Time elapsed: 0.005 s
% 1.67/1.40 % (2712)Instructions burned: 4 (million)
% 1.67/1.40 % (2712)------------------------------
% 1.67/1.40 % (2712)------------------------------
% 1.67/1.40 % (2713)Also succeeded, but the first one will report.
% 1.67/1.40 % (2716)Refutation found. Thanks to Tanya!
% 1.67/1.40 % SZS status Theorem for DTF2THF_2613
% 1.67/1.40 % SZS output start Proof for DTF2THF_2613
% 1.67/1.40 thf(type_def_5, type, nat: $tType).
% 1.67/1.40 thf(func_def_0, type, nat: $tType).
% 1.67/1.40 thf(func_def_1, type, x: nat).
% 1.67/1.40 thf(func_def_2, type, y: nat).
% 1.67/1.40 thf(func_def_3, type, z: nat).
% 1.67/1.40 thf(func_def_4, type, u: nat).
% 1.67/1.40 thf(func_def_5, type, more: nat > nat > $o).
% 1.67/1.40 thf(func_def_7, type, pl: nat > nat > nat).
% 1.67/1.40 thf(f23,plain,(
% 1.67/1.40 $false),
% 1.67/1.40 inference(subsumption_resolution,[status(thm)],[f22,f16])).
% 1.67/1.40 thf(f16,plain,(
% 1.67/1.40 ((more @ z @ u) = $true)),
% 1.67/1.40 inference(cnf_transformation,[status(thm)],[f8])).
% 1.67/1.40 thf(f8,plain,(
% 1.67/1.40 ((more @ z @ u) = $true)),
% 1.67/1.40 inference(fool_elimination,[status(thm)],[f7])).
% 1.67/1.40 thf(f7,plain,(
% 1.67/1.40 (more @ z @ u)),
% 1.67/1.40 inference(rectify,[status(thm)],[f2])).
% 1.67/1.40 thf(f2,axiom,(
% 1.67/1.40 (more @ z @ u)),
% 1.67/1.40 file('/export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2THF_2613.p',m)).
% 1.67/1.40 thf(f22,plain,(
% 1.67/1.40 ((more @ z @ u) != $true)),
% 1.67/1.40 inference(trivial_inequality_removal,[status(thm)],[f21])).
% 1.67/1.40 thf(f21,plain,(
% 1.67/1.40 ((more @ z @ u) != $true) | ($true != $true)),
% 1.67/1.40 inference(superposition,[status(thm)],[f20,f18])).
% 1.67/1.40 thf(f18,plain,(
% 1.67/1.40 ( ! [X2 : nat,X0 : nat,X1 : nat] : (((more @ (pl @ X1 @ X2) @ (pl @ X1 @ X0)) = $true) | ((more @ X2 @ X0) != $true)) )),
% 1.67/1.40 inference(cnf_transformation,[status(thm)],[f15])).
% 1.67/1.40 thf(f15,plain,(
% 1.67/1.40 ! [X0 : nat,X1 : nat,X2 : nat] : (((more @ (pl @ X1 @ X2) @ (pl @ X1 @ X0)) = $true) | ((more @ X2 @ X0) != $true))),
% 1.67/1.40 inference(rectify,[status(thm)],[f14])).
% 1.67/1.40 thf(f14,plain,(
% 1.67/1.40 ! [X1 : nat,X2 : nat,X0 : nat] : (((more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1)) = $true) | ((more @ X0 @ X1) != $true))),
% 1.67/1.40 inference(ennf_transformation,[status(thm)],[f12])).
% 1.67/1.40 thf(f12,plain,(
% 1.67/1.40 ! [X0 : nat,X1 : nat,X2 : nat] : (((more @ X0 @ X1) = $true) => ((more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1)) = $true))),
% 1.67/1.40 inference(fool_elimination,[status(thm)],[f11])).
% 1.67/1.40 thf(f11,plain,(
% 1.67/1.40 ! [X0 : nat,X1 : nat,X2 : nat] : ((more @ X0 @ X1) => (more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1)))),
% 1.67/1.40 inference(rectify,[status(thm)],[f3])).
% 1.67/1.40 thf(f3,axiom,(
% 1.67/1.40 ! [X0 : nat,X1 : nat,X2 : nat] : ((more @ X0 @ X1) => (more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1)))),
% 1.67/1.40 file('/export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2THF_2613.p',satz19d)).
% 1.67/1.40 thf(f20,plain,(
% 1.67/1.40 ((more @ (pl @ y @ z) @ (pl @ y @ u)) != $true)),
% 1.67/1.40 inference(definition_unfolding,[status(thm)],[f17,f19])).
% 1.67/1.40 thf(f19,plain,(
% 1.67/1.40 (x = y)),
% 1.67/1.40 inference(cnf_transformation,[status(thm)],[f1])).
% 1.67/1.40 thf(f1,axiom,(
% 1.67/1.40 (x = y)),
% 1.67/1.40 file('/export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2THF_2613.p',i)).
% 1.67/1.40 thf(f17,plain,(
% 1.67/1.40 ((more @ (pl @ x @ z) @ (pl @ y @ u)) != $true)),
% 1.67/1.40 inference(cnf_transformation,[status(thm)],[f13])).
% 1.67/1.40 thf(f13,plain,(
% 1.67/1.40 ((more @ (pl @ x @ z) @ (pl @ y @ u)) != $true)),
% 1.67/1.40 inference(flattening,[status(thm)],[f10])).
% 1.67/1.40 thf(f10,plain,(
% 1.67/1.40 ~((more @ (pl @ x @ z) @ (pl @ y @ u)) = $true)),
% 1.67/1.40 inference(fool_elimination,[status(thm)],[f9])).
% 1.67/1.40 thf(f9,plain,(
% 1.67/1.40 ~(more @ (pl @ x @ z) @ (pl @ y @ u))),
% 1.67/1.40 inference(rectify,[status(thm)],[f5])).
% 1.67/1.40 thf(f5,negated_conjecture,(
% 1.67/1.40 ~(more @ (pl @ x @ z) @ (pl @ y @ u))),
% 1.67/1.40 inference(negated_conjecture,[status(cth)],[f4])).
% 1.67/1.40 thf(f4,conjecture,(
% 1.67/1.40 (more @ (pl @ x @ z) @ (pl @ y @ u))),
% 1.67/1.40 file('/export/starexec/sandbox2/tmp/tmp.8EGoSFPKmi/DTF2THF_2613.p',satz19g)).
% 1.67/1.40 % SZS output end Proof for DTF2THF_2613
% 1.67/1.40 % (2716)------------------------------
% 1.67/1.40 % (2716)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.67/1.40 % (2716)Termination reason: Refutation
% 1.67/1.40
% 1.67/1.40 % (2716)Memory used [KB]: 5500
% 1.67/1.40 % (2716)Time elapsed: 0.004 s
% 1.67/1.40 % (2716)Instructions burned: 2 (million)
% 1.67/1.40 % (2716)------------------------------
% 1.67/1.40 % (2716)------------------------------
% 1.67/1.40 % (2710)Success in time 0.018 s
%------------------------------------------------------------------------------