%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU908^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n026.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:37:43 AM UTC 2026
% Result : Theorem 1.47s 1.28s
% Output : Refutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 119 ( 53 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 188 ( 24 ~; 15 |; 19 &; 107 @)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 3 ^; 34 !; 13 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
f: a > a ).
thf(func_def_5,type,
sK0: a ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_7,type,
sK2: ( a > $o ) > a ).
thf(func_def_10,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f23,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f22]) ).
thf(f22,plain,
$true = $false,
inference(duplicate_literal_removal,[status(thm)],[f21]) ).
thf(f21,plain,
( ( $true = $false )
| ( $true = $false ) ),
inference(beta_eta_normalization,[status(thm)],[f19]) ).
thf(f19,plain,
( ( $true
= ( ^ [Y0: a] : $false
@ ( sK2
@ ^ [Y0: a] : $false ) ) )
| ( $true
= ( ^ [Y0: a] : $false
@ sK0 ) ) ),
inference(primitive_instantiation,[status(thm)],[f12]) ).
thf(f12,plain,
! [X3: a > $o] :
( ( $true
= ( X3 @ ( sK2 @ X3 ) ) )
| ( $true
= ( X3 @ sK0 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ! [X2: a] :
( ( $true
!= ( sK1 @ X2 ) )
| ( $true
= ( sK1 @ ( f @ X2 ) ) ) )
& ( $true
!= ( sK1 @ ( f @ sK0 ) ) )
& ! [X3: a > $o] :
( ( ( $true
!= ( X3 @ ( f @ ( sK2 @ X3 ) ) ) )
& ( $true
= ( X3 @ ( sK2 @ X3 ) ) ) )
| ( $true
= ( X3 @ sK0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).
thf(f8,plain,
( ? [X0: a] :
( ? [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( f @ X2 ) )
= $true ) )
& ( ( X1 @ ( f @ X0 ) )
!= $true ) )
& ! [X3: a > $o] :
( ? [X4: a] :
( ( $true
!= ( X3 @ ( f @ X4 ) ) )
& ( $true
= ( X3 @ X4 ) ) )
| ( $true
= ( X3 @ X0 ) ) ) )
=> ( ? [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( f @ X2 ) )
= $true ) )
& ( $true
!= ( X1 @ ( f @ sK0 ) ) ) )
& ! [X3: a > $o] :
( ? [X4: a] :
( ( $true
!= ( X3 @ ( f @ X4 ) ) )
& ( $true
= ( X3 @ X4 ) ) )
| ( $true
= ( X3 @ sK0 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
( ? [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( f @ X2 ) )
= $true ) )
& ( $true
!= ( X1 @ ( f @ sK0 ) ) ) )
=> ( ! [X2: a] :
( ( $true
!= ( sK1 @ X2 ) )
| ( $true
= ( sK1 @ ( f @ X2 ) ) ) )
& ( $true
!= ( sK1 @ ( f @ sK0 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
! [X3: a > $o] :
( ? [X4: a] :
( ( $true
!= ( X3 @ ( f @ X4 ) ) )
& ( $true
= ( X3 @ X4 ) ) )
=> ( ( $true
!= ( X3 @ ( f @ ( sK2 @ X3 ) ) ) )
& ( $true
= ( X3 @ ( sK2 @ X3 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
? [X0: a] :
( ? [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( f @ X2 ) )
= $true ) )
& ( ( X1 @ ( f @ X0 ) )
!= $true ) )
& ! [X3: a > $o] :
( ? [X4: a] :
( ( $true
!= ( X3 @ ( f @ X4 ) ) )
& ( $true
= ( X3 @ X4 ) ) )
| ( $true
= ( X3 @ X0 ) ) ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: a] :
( ? [X3: a > $o] :
( ! [X4: a] :
( ( $true
!= ( X3 @ X4 ) )
| ( $true
= ( X3 @ ( f @ X4 ) ) ) )
& ( $true
!= ( X3 @ ( f @ X0 ) ) ) )
& ! [X1: a > $o] :
( ? [X2: a] :
( ( ( X1 @ ( f @ X2 ) )
!= $true )
& ( ( X1 @ X2 )
= $true ) )
| ( ( X1 @ X0 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ! [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
= $true )
=> ( ( X1 @ ( f @ X2 ) )
= $true ) )
=> ( ( X1 @ X0 )
= $true ) )
=> ! [X3: a > $o] :
( ! [X4: a] :
( ( $true
= ( X3 @ X4 ) )
=> ( $true
= ( X3 @ ( f @ X4 ) ) ) )
=> ( $true
= ( X3 @ ( f @ X0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ! [X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ( X1 @ ( f @ X2 ) ) )
=> ( X1 @ X0 ) )
=> ! [X3: a > $o] :
( ! [X4: a] :
( ( X3 @ X4 )
=> ( X3 @ ( f @ X4 ) ) )
=> ( X3 @ ( f @ X0 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ! [X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ( X1 @ ( f @ X2 ) ) )
=> ( X1 @ X0 ) )
=> ! [X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ( X1 @ ( f @ X2 ) ) )
=> ( X1 @ ( f @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ! [X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ( X1 @ ( f @ X2 ) ) )
=> ( X1 @ X0 ) )
=> ! [X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ( X1 @ ( f @ X2 ) ) )
=> ( X1 @ ( f @ X0 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hiPfTd7VAZ/DTF2THF_5841.p',cTHM527_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU908^5 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.34 % Computer : n026.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 12:37:10 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.30/0.46 ---- Original DTF file ---
% 0.30/0.46 thf(spec,logic,$$dhol).
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 % File : SEU908^5 : TPTP v9.2.1. Released v4.0.0.
% 0.30/0.46 % Domain : Set Theory
% 0.30/0.46 % Problem : TPS problem from MISTAKEN-LEASTCLOSEDUNDER
% 0.30/0.46 % Version : Especial.
% 0.30/0.46 % English :
% 0.30/0.46
% 0.30/0.46 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.30/0.46 % Source : [Bro09]
% 0.30/0.46 % Names : tps_0849 [Bro09]
% 0.30/0.46
% 0.30/0.46 % Status : Theorem
% 0.30/0.46 % Rating : 0.00 v8.1.0, 0.08 v7.4.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.1.0, 0.33 v4.0.0
% 0.30/0.46 % Syntax : Number of formulae : 3 ( 0 unt; 2 typ; 0 def)
% 0.30/0.46 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.30/0.46 % Maximal formula atoms : 0 ( 0 avg)
% 0.30/0.46 % Number of connectives : 14 ( 0 ~; 0 |; 0 &; 9 @)
% 0.30/0.46 % ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% 0.30/0.46 % Maximal formula depth : 9 ( 9 avg)
% 0.30/0.46 % Number of types : 2 ( 1 usr)
% 0.30/0.46 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.30/0.46 % Number of symbols : 1 ( 1 usr; 0 con; 1-1 aty)
% 0.30/0.46 % Number of variables : 5 ( 0 ^; 5 !; 0 ?; 5 :)
% 0.30/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.30/0.46
% 0.30/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.30/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.30/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.30/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 thf(a_type,type,
% 0.30/0.46 a: $tType ).
% 0.30/0.46
% 0.30/0.46 thf(f,type,
% 0.30/0.46 f: a > a ).
% 0.30/0.46
% 0.30/0.46 thf(cTHM527_pme,conjecture,
% 0.30/0.46 ! [Xx: a] :
% 0.30/0.46 ( ! [Xp: a > $o] :
% 0.30/0.46 ( ! [Xx0: a] :
% 0.30/0.46 ( ( Xp @ Xx0 )
% 0.30/0.46 => ( Xp @ ( f @ Xx0 ) ) )
% 0.30/0.46 => ( Xp @ Xx ) )
% 0.30/0.46 => ! [Xp: a > $o] :
% 0.30/0.46 ( ! [Xx0: a] :
% 0.30/0.46 ( ( Xp @ Xx0 )
% 0.30/0.46 => ( Xp @ ( f @ Xx0 ) ) )
% 0.30/0.46 => ( Xp @ ( f @ Xx ) ) ) ) ).
% 0.30/0.46
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 ------------------------
% 1.47/1.25 ---- Embedded in THF ---
% 1.47/1.25 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.47/1.25 %%% Generated on Tue Feb 24 12:37:11 EST 2026
% 1.47/1.25 %%% using '$$dhol' embedding, version 1.3.0.
% 1.47/1.25 %%% Logic specification used:
% 1.47/1.25 %%% thf(spec, logic, $$dhol).
% 1.47/1.25
% 1.47/1.25 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.hiPfTd7VAZ/DTF2DTF5841.p
% See solution above
% 1.47/1.25 ------------------------
% 1.47/1.26 ---- Cleaned THF ---
% 1.47/1.26 thf(a_type,type,
% 1.47/1.26 a: $tType ).
% 1.47/1.26
% 1.47/1.26 thf(f,type,
% 1.47/1.26 f: a > a ).
% 1.47/1.26
% 1.47/1.26 thf(cTHM527_pme,conjecture,
% 1.47/1.26 ! [Xx: a] :
% 1.47/1.26 ( ! [Xp: a > $o] :
% 1.47/1.26 ( ! [Xx0: a] :
% 1.47/1.26 ( ( Xp @ Xx0 )
% 1.47/1.26 => ( Xp @ ( f @ Xx0 ) ) )
% 1.47/1.26 => ( Xp @ Xx ) )
% 1.47/1.26 => ! [Xp: a > $o] :
% 1.47/1.26 ( ! [Xx0: a] :
% 1.47/1.26 ( ( Xp @ Xx0 )
% 1.47/1.26 => ( Xp @ ( f @ Xx0 ) ) )
% 1.47/1.26 => ( Xp @ ( f @ Xx ) ) ) ) ).
% 1.47/1.26 ------------------------
% 1.47/1.28 % (6126)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_5841 for (2999ds/275Mi)
% 1.47/1.28 % (6124)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_5841 for (2999ds/2Mi)
% 1.47/1.28 % (6126)First to succeed.
% 1.47/1.28 % (6124)Instruction limit reached!
% 1.47/1.28 % (6124)------------------------------
% 1.47/1.28 % (6124)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.47/1.28 % (6124)Termination reason: Unknown
% 1.47/1.28 % (6124)Termination phase: Saturation
% 1.47/1.28
% 1.47/1.28 % (6124)Memory used [KB]: 5500
% 1.47/1.28 % (6124)Time elapsed: 0.002 s
% 1.47/1.28 % (6124)Instructions burned: 2 (million)
% 1.47/1.28 % (6124)------------------------------
% 1.47/1.28 % (6124)------------------------------
% 1.47/1.28 % (6126)Refutation found. Thanks to Tanya!
% 1.47/1.28 % SZS status Theorem for DTF2THF_5841
% 1.47/1.28 % SZS output start Proof for DTF2THF_5841
% 1.47/1.28 thf(type_def_5, type, a: $tType).
% 1.47/1.28 thf(func_def_0, type, a: $tType).
% 1.47/1.28 thf(func_def_1, type, f: a > a).
% 1.47/1.28 thf(func_def_5, type, sK0: a).
% 1.47/1.28 thf(func_def_6, type, sK1: a > $o).
% 1.47/1.28 thf(func_def_7, type, sK2: (a > $o) > a).
% 1.47/1.28 thf(func_def_10, type, ph4: !>[X0: $tType]:(X0)).
% 1.47/1.28 thf(f23,plain,(
% 1.47/1.28 $false),
% 1.47/1.28 inference(trivial_inequality_removal,[status(thm)],[f22])).
% 1.47/1.28 thf(f22,plain,(
% 1.47/1.28 ($true = $false)),
% 1.47/1.28 inference(duplicate_literal_removal,[status(thm)],[f21])).
% 1.47/1.28 thf(f21,plain,(
% 1.47/1.28 ($true = $false) | ($true = $false)),
% 1.47/1.28 inference(beta_eta_normalization,[status(thm)],[f19])).
% 1.47/1.28 thf(f19,plain,(
% 1.47/1.28 ($true = ((^[Y0 : a]: ($false)) @ (sK2 @ (^[Y0 : a]: ($false))))) | ($true = ((^[Y0 : a]: ($false)) @ sK0))),
% 1.47/1.28 inference(primitive_instantiation,[status(thm)],[f12])).
% 1.47/1.28 thf(f12,plain,(
% 1.47/1.28 ( ! [X3 : a > $o] : (($true = (X3 @ (sK2 @ X3))) | ($true = (X3 @ sK0))) )),
% 1.47/1.28 inference(cnf_transformation,[status(thm)],[f11])).
% 1.47/1.28 thf(f11,plain,(
% 1.47/1.28 (! [X2 : a] : (($true != (sK1 @ X2)) | ($true = (sK1 @ (f @ X2)))) & ($true != (sK1 @ (f @ sK0)))) & ! [X3 : a > $o] : ((($true != (X3 @ (f @ (sK2 @ X3)))) & ($true = (X3 @ (sK2 @ X3)))) | ($true = (X3 @ sK0)))),
% 1.47/1.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8])).
% 1.47/1.28 thf(f8,plain,(
% 1.47/1.28 ? [X0 : a] : (? [X1 : a > $o] : (! [X2 : a] : (((X1 @ X2) != $true) | ((X1 @ (f @ X2)) = $true)) & ((X1 @ (f @ X0)) != $true)) & ! [X3 : a > $o] : (? [X4 : a] : (($true != (X3 @ (f @ X4))) & ($true = (X3 @ X4))) | ($true = (X3 @ X0)))) => (? [X1 : a > $o] : (! [X2 : a] : (((X1 @ X2) != $true) | ((X1 @ (f @ X2)) = $true)) & ($true != (X1 @ (f @ sK0)))) & ! [X3 : a > $o] : (? [X4 : a] : (($true != (X3 @ (f @ X4))) & ($true = (X3 @ X4))) | ($true = (X3 @ sK0))))),
% 1.47/1.28 introduced(definition,[],[choice_axiom])).
% 1.47/1.28 thf(f9,plain,(
% 1.47/1.28 ? [X1 : a > $o] : (! [X2 : a] : (((X1 @ X2) != $true) | ((X1 @ (f @ X2)) = $true)) & ($true != (X1 @ (f @ sK0)))) => (! [X2 : a] : (($true != (sK1 @ X2)) | ($true = (sK1 @ (f @ X2)))) & ($true != (sK1 @ (f @ sK0))))),
% 1.47/1.28 introduced(definition,[],[choice_axiom])).
% 1.47/1.28 thf(f10,plain,(
% 1.47/1.28 ! [X3 : a > $o] : (? [X4 : a] : (($true != (X3 @ (f @ X4))) & ($true = (X3 @ X4))) => (($true != (X3 @ (f @ (sK2 @ X3)))) & ($true = (X3 @ (sK2 @ X3)))))),
% 1.47/1.28 introduced(definition,[],[choice_axiom])).
% 1.47/1.28 thf(f7,plain,(
% 1.47/1.28 ? [X0 : a] : (? [X1 : a > $o] : (! [X2 : a] : (((X1 @ X2) != $true) | ((X1 @ (f @ X2)) = $true)) & ((X1 @ (f @ X0)) != $true)) & ! [X3 : a > $o] : (? [X4 : a] : (($true != (X3 @ (f @ X4))) & ($true = (X3 @ X4))) | ($true = (X3 @ X0))))),
% 1.47/1.28 inference(rectify,[status(thm)],[f6])).
% 1.47/1.28 thf(f6,plain,(
% 1.47/1.28 ? [X0 : a] : (? [X3 : a > $o] : (! [X4 : a] : (($true != (X3 @ X4)) | ($true = (X3 @ (f @ X4)))) & ($true != (X3 @ (f @ X0)))) & ! [X1 : a > $o] : (? [X2 : a] : (((X1 @ (f @ X2)) != $true) & ((X1 @ X2) = $true)) | ((X1 @ X0) = $true)))),
% 1.47/1.28 inference(ennf_transformation,[status(thm)],[f5])).
% 1.47/1.28 thf(f5,plain,(
% 1.47/1.28 ~! [X0 : a] : (! [X1 : a > $o] : (! [X2 : a] : (((X1 @ X2) = $true) => ((X1 @ (f @ X2)) = $true)) => ((X1 @ X0) = $true)) => ! [X3 : a > $o] : (! [X4 : a] : (($true = (X3 @ X4)) => ($true = (X3 @ (f @ X4)))) => ($true = (X3 @ (f @ X0)))))),
% 1.47/1.28 inference(fool_elimination,[status(thm)],[f4])).
% 1.47/1.28 thf(f4,plain,(
% 1.47/1.28 ~! [X0 : a] : (! [X1 : a > $o] : (! [X2 : a] : ((X1 @ X2) => (X1 @ (f @ X2))) => (X1 @ X0)) => ! [X3 : a > $o] : (! [X4 : a] : ((X3 @ X4) => (X3 @ (f @ X4))) => (X3 @ (f @ X0))))),
% 1.47/1.28 inference(rectify,[status(thm)],[f2])).
% 1.47/1.28 thf(f2,negated_conjecture,(
% 1.47/1.28 ~! [X0 : a] : (! [X1 : a > $o] : (! [X2 : a] : ((X1 @ X2) => (X1 @ (f @ X2))) => (X1 @ X0)) => ! [X1 : a > $o] : (! [X2 : a] : ((X1 @ X2) => (X1 @ (f @ X2))) => (X1 @ (f @ X0))))),
% 1.47/1.28 inference(negated_conjecture,[status(cth)],[f1])).
% 1.47/1.28 thf(f1,conjecture,(
% 1.47/1.28 ! [X0 : a] : (! [X1 : a > $o] : (! [X2 : a] : ((X1 @ X2) => (X1 @ (f @ X2))) => (X1 @ X0)) => ! [X1 : a > $o] : (! [X2 : a] : ((X1 @ X2) => (X1 @ (f @ X2))) => (X1 @ (f @ X0))))),
% 1.47/1.28 file('/export/starexec/sandbox/tmp/tmp.hiPfTd7VAZ/DTF2THF_5841.p',cTHM527_pme)).
% 1.47/1.28 % SZS output end Proof for DTF2THF_5841
% 1.47/1.28 % (6126)------------------------------
% 1.47/1.28 % (6126)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.47/1.28 % (6126)Termination reason: Refutation
% 1.47/1.28
% 1.47/1.28 % (6126)Memory used [KB]: 5500
% 1.47/1.28 % (6126)Time elapsed: 0.003 s
% 1.47/1.28 % (6126)Instructions burned: 1 (million)
% 1.47/1.28 % (6126)------------------------------
% 1.47/1.28 % (6126)------------------------------
% 1.47/1.28 % (6120)Success in time 0.012 s
%------------------------------------------------------------------------------