%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU935^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n009.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:47 AM UTC 2026
% Result : Theorem 1.63s 1.30s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 38 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 90 ( 13 ~; 0 |; 15 &; 55 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 77 ( 0 ^; 42 !; 35 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(type_def_8,type,
c: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
b: $tType ).
thf(func_def_2,type,
c: $tType ).
thf(func_def_6,type,
sK0: b > c ).
thf(func_def_7,type,
sK1: a > b ).
thf(func_def_8,type,
sK2: b > a ).
thf(func_def_9,type,
sK3: c > b ).
thf(func_def_10,type,
sK4: c ).
thf(f18,plain,
$false,
inference(equality_resolution,[status(thm)],[f17]) ).
thf(f17,plain,
! [X0: c] : ( sK4 != X0 ),
inference(superposition,[status(thm)],[f16,f14]) ).
thf(f14,plain,
! [X4: c] :
( ( sK0 @ ( sK3 @ X4 ) )
= X4 ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( ! [X2: b] :
( ( sK1 @ ( sK2 @ X2 ) )
= X2 )
& ! [X4: c] :
( ( sK0 @ ( sK3 @ X4 ) )
= X4 )
& ! [X7: a] :
( ( sK0 @ ( sK1 @ X7 ) )
!= sK4 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f7,f11,f10,f9,f8]) ).
thf(f8,plain,
( ? [X0: b > c,X1: a > b] :
( ! [X2: b] :
? [X3: a] :
( ( X1 @ X3 )
= X2 )
& ! [X4: c] :
? [X5: b] :
( ( X0 @ X5 )
= X4 )
& ? [X6: c] :
! [X7: a] :
( ( X0 @ ( X1 @ X7 ) )
!= X6 ) )
=> ( ! [X2: b] :
? [X3: a] :
( ( sK1 @ X3 )
= X2 )
& ! [X4: c] :
? [X5: b] :
( ( sK0 @ X5 )
= X4 )
& ? [X6: c] :
! [X7: a] :
( ( sK0 @ ( sK1 @ X7 ) )
!= X6 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
! [X2: b] :
( ? [X3: a] :
( ( sK1 @ X3 )
= X2 )
=> ( ( sK1 @ ( sK2 @ X2 ) )
= X2 ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
! [X4: c] :
( ? [X5: b] :
( ( sK0 @ X5 )
= X4 )
=> ( ( sK0 @ ( sK3 @ X4 ) )
= X4 ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f11,plain,
( ? [X6: c] :
! [X7: a] :
( ( sK0 @ ( sK1 @ X7 ) )
!= X6 )
=> ! [X7: a] :
( ( sK0 @ ( sK1 @ X7 ) )
!= sK4 ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
? [X0: b > c,X1: a > b] :
( ! [X2: b] :
? [X3: a] :
( ( X1 @ X3 )
= X2 )
& ! [X4: c] :
? [X5: b] :
( ( X0 @ X5 )
= X4 )
& ? [X6: c] :
! [X7: a] :
( ( X0 @ ( X1 @ X7 ) )
!= X6 ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,plain,
? [X1: b > c,X0: a > b] :
( ! [X2: b] :
? [X3: a] :
( ( X0 @ X3 )
= X2 )
& ! [X4: c] :
? [X5: b] :
( ( X1 @ X5 )
= X4 )
& ? [X6: c] :
! [X7: a] :
( ( X1 @ ( X0 @ X7 ) )
!= X6 ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
? [X1: b > c,X0: a > b] :
( ? [X6: c] :
! [X7: a] :
( ( X1 @ ( X0 @ X7 ) )
!= X6 )
& ! [X2: b] :
? [X3: a] :
( ( X0 @ X3 )
= X2 )
& ! [X4: c] :
? [X5: b] :
( ( X1 @ X5 )
= X4 ) ),
inference(ennf_transformation,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X1: b > c,X0: a > b] :
( ( ! [X2: b] :
? [X3: a] :
( ( X0 @ X3 )
= X2 )
& ! [X4: c] :
? [X5: b] :
( ( X1 @ X5 )
= X4 ) )
=> ! [X6: c] :
? [X7: a] :
( ( X1 @ ( X0 @ X7 ) )
= X6 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > b,X1: b > c] :
( ( ! [X2: b] :
? [X3: a] :
( ( X0 @ X3 )
= X2 )
& ! [X2: c] :
? [X3: b] :
( ( X1 @ X3 )
= X2 ) )
=> ! [X2: c] :
? [X3: a] :
( ( X1 @ ( X0 @ X3 ) )
= X2 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > b,X1: b > c] :
( ( ! [X2: b] :
? [X3: a] :
( ( X0 @ X3 )
= X2 )
& ! [X2: c] :
? [X3: b] :
( ( X1 @ X3 )
= X2 ) )
=> ! [X2: c] :
? [X3: a] :
( ( X1 @ ( X0 @ X3 ) )
= X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.8NjhUfMm92/DTF2THF_9707.p',cFN_THM_2_pme) ).
thf(f16,plain,
! [X0: b] :
( sK4
!= ( sK0 @ X0 ) ),
inference(superposition,[status(thm)],[f13,f15]) ).
thf(f15,plain,
! [X2: b] :
( ( sK1 @ ( sK2 @ X2 ) )
= X2 ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f13,plain,
! [X7: a] :
( ( sK0 @ ( sK1 @ X7 ) )
!= sK4 ),
inference(cnf_transformation,[status(thm)],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU935^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.33 % Computer : n009.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Tue Feb 24 12:36:25 EST 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.45 ---- Original DTF file ---
% 0.19/0.45 thf(spec,logic,$$dhol).
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 % File : SEU935^5 : TPTP v9.2.1. Released v4.0.0.
% 0.19/0.45 % Domain : Set Theory (Functions)
% 0.19/0.45 % Problem : TPS problem FN-THM-2
% 0.19/0.45 % Version : Especial.
% 0.19/0.45 % English :
% 0.19/0.45
% 0.19/0.45 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.19/0.45 % Source : [Bro09]
% 0.19/0.45 % Names : tps_0305 [Bro09]
% 0.19/0.45 % : FN-THM-2 [TPS]
% 0.19/0.45
% 0.19/0.45 % Status : Theorem
% 0.19/0.45 % Rating : 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.19/0.45 % Syntax : Number of formulae : 4 ( 0 unt; 3 typ; 0 def)
% 0.19/0.45 % Number of atoms : 3 ( 3 equ; 0 cnn)
% 0.19/0.45 % Maximal formula atoms : 3 ( 3 avg)
% 0.19/0.45 % Number of connectives : 6 ( 0 ~; 0 |; 1 &; 4 @)
% 0.19/0.45 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.19/0.45 % Maximal formula depth : 7 ( 7 avg)
% 0.19/0.45 % Number of types : 3 ( 3 usr)
% 0.19/0.45 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.19/0.45 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.19/0.45 % Number of variables : 8 ( 0 ^; 5 !; 3 ?; 8 :)
% 0.19/0.45 % SPC : TH0_THM_EQU_NAR
% 0.19/0.45
% 0.19/0.45 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.19/0.45 % project in the Department of Mathematical Sciences at Carnegie
% 0.19/0.45 % Mellon University. Distributed under the Creative Commons copyleft
% 0.19/0.45 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.19/0.45 % : Polymorphic definitions expanded.
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 thf(a_type,type,
% 0.19/0.45 a: $tType ).
% 0.19/0.45
% 0.19/0.45 thf(b_type,type,
% 0.19/0.45 b: $tType ).
% 0.19/0.45
% 0.19/0.45 thf(c_type,type,
% 0.19/0.45 c: $tType ).
% 0.19/0.45
% 0.19/0.45 thf(cFN_THM_2_pme,conjecture,
% 0.19/0.45 ! [F: a > b,G: b > c] :
% 0.19/0.45 ( ( ! [Y: b] :
% 0.19/0.45 ? [X: a] :
% 0.19/0.45 ( ( F @ X )
% 0.19/0.45 = Y )
% 0.19/0.45 & ! [Y: c] :
% 0.19/0.45 ? [X: b] :
% 0.19/0.45 ( ( G @ X )
% 0.19/0.45 = Y ) )
% 0.19/0.45 => ! [Y: c] :
% 0.19/0.45 ? [X: a] :
% 0.19/0.45 ( ( G @ ( F @ X ) )
% 0.19/0.45 = Y ) ) ).
% 0.19/0.45
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 ------------------------
% 1.48/1.27 ---- Embedded in THF ---
% 1.48/1.27 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.27 %%% Generated on Tue Feb 24 12:36:26 EST 2026
% 1.48/1.27 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.27 %%% Logic specification used:
% 1.48/1.27 %%% thf(spec, logic, $$dhol).
% 1.48/1.27
% 1.48/1.27 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.8NjhUfMm92/DTF2DTF9707.p
% See solution above
% 1.48/1.27 ------------------------
% 1.48/1.28 ---- Cleaned THF ---
% 1.48/1.28 thf(a_type,type,
% 1.48/1.28 a: $tType ).
% 1.48/1.28
% 1.48/1.28 thf(b_type,type,
% 1.48/1.28 b: $tType ).
% 1.48/1.28
% 1.48/1.28 thf(c_type,type,
% 1.48/1.28 c: $tType ).
% 1.48/1.28
% 1.48/1.28 thf(cFN_THM_2_pme,conjecture,
% 1.48/1.28 ! [F: a > b,G: b > c] :
% 1.48/1.28 ( ( ! [Y: b] :
% 1.48/1.28 ? [X: a] :
% 1.48/1.28 ( ( F @ X )
% 1.48/1.28 = Y )
% 1.48/1.28 & ! [Y: c] :
% 1.48/1.28 ? [X: b] :
% 1.48/1.28 ( ( G @ X )
% 1.48/1.28 = Y ) )
% 1.48/1.28 => ! [Y: c] :
% 1.48/1.28 ? [X: a] :
% 1.48/1.28 ( ( G @ ( F @ X ) )
% 1.48/1.28 = Y ) ) ).
% 1.48/1.28 ------------------------
% 1.63/1.30 % (9888)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_9707 for (2999ds/183Mi)
% 1.63/1.30 % (9893)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_9707 for (2999ds/2Mi)
% 1.63/1.30 % (9893)Instruction limit reached!
% 1.63/1.30 % (9893)------------------------------
% 1.63/1.30 % (9893)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.63/1.30 % (9888)First to succeed.
% 1.63/1.30 % (9894)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_9707 for (2999ds/275Mi)
% 1.63/1.30 % (9893)Termination reason: Unknown
% 1.63/1.30 % (9893)Termination phase: Saturation
% 1.63/1.30
% 1.63/1.30 % (9893)Memory used [KB]: 5500
% 1.63/1.30 % (9893)Time elapsed: 0.003 s
% 1.63/1.30 % (9893)Instructions burned: 3 (million)
% 1.63/1.30 % (9893)------------------------------
% 1.63/1.30 % (9893)------------------------------
% 1.63/1.30 % (9895)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_9707 for (2999ds/18Mi)
% 1.63/1.30 % (9890)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_9707 for (2999ds/4Mi)
% 1.63/1.30 % (9894)Also succeeded, but the first one will report.
% 1.63/1.30 % (9888)Refutation found. Thanks to Tanya!
% 1.63/1.30 % SZS status Theorem for DTF2THF_9707
% 1.63/1.30 % SZS output start Proof for DTF2THF_9707
% 1.63/1.30 thf(type_def_5, type, a: $tType).
% 1.63/1.30 thf(type_def_6, type, b: $tType).
% 1.63/1.30 thf(type_def_8, type, c: $tType).
% 1.63/1.30 thf(func_def_0, type, a: $tType).
% 1.63/1.30 thf(func_def_1, type, b: $tType).
% 1.63/1.30 thf(func_def_2, type, c: $tType).
% 1.63/1.30 thf(func_def_6, type, sK0: b > c).
% 1.63/1.30 thf(func_def_7, type, sK1: a > b).
% 1.63/1.30 thf(func_def_8, type, sK2: b > a).
% 1.63/1.30 thf(func_def_9, type, sK3: c > b).
% 1.63/1.30 thf(func_def_10, type, sK4: c).
% 1.63/1.30 thf(f18,plain,(
% 1.63/1.30 $false),
% 1.63/1.30 inference(equality_resolution,[status(thm)],[f17])).
% 1.63/1.30 thf(f17,plain,(
% 1.63/1.30 ( ! [X0 : c] : ((sK4 != X0)) )),
% 1.63/1.30 inference(superposition,[status(thm)],[f16,f14])).
% 1.63/1.30 thf(f14,plain,(
% 1.63/1.30 ( ! [X4 : c] : (((sK0 @ (sK3 @ X4)) = X4)) )),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f12])).
% 1.63/1.30 thf(f12,plain,(
% 1.63/1.30 ! [X2 : b] : ((sK1 @ (sK2 @ X2)) = X2) & ! [X4 : c] : ((sK0 @ (sK3 @ X4)) = X4) & ! [X7 : a] : ((sK0 @ (sK1 @ X7)) != sK4)),
% 1.63/1.30 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f7,f11,f10,f9,f8])).
% 1.63/1.30 thf(f8,plain,(
% 1.63/1.30 ? [X0 : b > c,X1 : a > b] : (! [X2 : b] : ? [X3 : a] : ((X1 @ X3) = X2) & ! [X4 : c] : ? [X5 : b] : ((X0 @ X5) = X4) & ? [X6 : c] : ! [X7 : a] : ((X0 @ (X1 @ X7)) != X6)) => (! [X2 : b] : ? [X3 : a] : ((sK1 @ X3) = X2) & ! [X4 : c] : ? [X5 : b] : ((sK0 @ X5) = X4) & ? [X6 : c] : ! [X7 : a] : ((sK0 @ (sK1 @ X7)) != X6))),
% 1.63/1.30 introduced(definition,[],[choice_axiom])).
% 1.63/1.30 thf(f9,plain,(
% 1.63/1.30 ! [X2 : b] : (? [X3 : a] : ((sK1 @ X3) = X2) => ((sK1 @ (sK2 @ X2)) = X2))),
% 1.63/1.30 introduced(definition,[],[choice_axiom])).
% 1.63/1.30 thf(f10,plain,(
% 1.63/1.30 ! [X4 : c] : (? [X5 : b] : ((sK0 @ X5) = X4) => ((sK0 @ (sK3 @ X4)) = X4))),
% 1.63/1.30 introduced(definition,[],[choice_axiom])).
% 1.63/1.30 thf(f11,plain,(
% 1.63/1.30 ? [X6 : c] : ! [X7 : a] : ((sK0 @ (sK1 @ X7)) != X6) => ! [X7 : a] : ((sK0 @ (sK1 @ X7)) != sK4)),
% 1.63/1.30 introduced(definition,[],[choice_axiom])).
% 1.63/1.30 thf(f7,plain,(
% 1.63/1.30 ? [X0 : b > c,X1 : a > b] : (! [X2 : b] : ? [X3 : a] : ((X1 @ X3) = X2) & ! [X4 : c] : ? [X5 : b] : ((X0 @ X5) = X4) & ? [X6 : c] : ! [X7 : a] : ((X0 @ (X1 @ X7)) != X6))),
% 1.63/1.30 inference(rectify,[status(thm)],[f6])).
% 1.63/1.30 thf(f6,plain,(
% 1.63/1.30 ? [X1 : b > c,X0 : a > b] : (! [X2 : b] : ? [X3 : a] : ((X0 @ X3) = X2) & ! [X4 : c] : ? [X5 : b] : ((X1 @ X5) = X4) & ? [X6 : c] : ! [X7 : a] : ((X1 @ (X0 @ X7)) != X6))),
% 1.63/1.30 inference(flattening,[status(thm)],[f5])).
% 1.63/1.30 thf(f5,plain,(
% 1.63/1.30 ? [X1 : b > c,X0 : a > b] : (? [X6 : c] : ! [X7 : a] : ((X1 @ (X0 @ X7)) != X6) & (! [X2 : b] : ? [X3 : a] : ((X0 @ X3) = X2) & ! [X4 : c] : ? [X5 : b] : ((X1 @ X5) = X4)))),
% 1.63/1.30 inference(ennf_transformation,[status(thm)],[f4])).
% 1.63/1.30 thf(f4,plain,(
% 1.63/1.30 ~! [X1 : b > c,X0 : a > b] : ((! [X2 : b] : ? [X3 : a] : ((X0 @ X3) = X2) & ! [X4 : c] : ? [X5 : b] : ((X1 @ X5) = X4)) => ! [X6 : c] : ? [X7 : a] : ((X1 @ (X0 @ X7)) = X6))),
% 1.63/1.30 inference(rectify,[status(thm)],[f2])).
% 1.63/1.30 thf(f2,negated_conjecture,(
% 1.63/1.30 ~! [X0 : a > b,X1 : b > c] : ((! [X2 : b] : ? [X3 : a] : ((X0 @ X3) = X2) & ! [X2 : c] : ? [X3 : b] : ((X1 @ X3) = X2)) => ! [X2 : c] : ? [X3 : a] : ((X1 @ (X0 @ X3)) = X2))),
% 1.63/1.30 inference(negated_conjecture,[status(cth)],[f1])).
% 1.63/1.30 thf(f1,conjecture,(
% 1.63/1.30 ! [X0 : a > b,X1 : b > c] : ((! [X2 : b] : ? [X3 : a] : ((X0 @ X3) = X2) & ! [X2 : c] : ? [X3 : b] : ((X1 @ X3) = X2)) => ! [X2 : c] : ? [X3 : a] : ((X1 @ (X0 @ X3)) = X2))),
% 1.63/1.30 file('/export/starexec/sandbox2/tmp/tmp.8NjhUfMm92/DTF2THF_9707.p',cFN_THM_2_pme)).
% 1.63/1.30 thf(f16,plain,(
% 1.63/1.30 ( ! [X0 : b] : ((sK4 != (sK0 @ X0))) )),
% 1.63/1.30 inference(superposition,[status(thm)],[f13,f15])).
% 1.63/1.30 thf(f15,plain,(
% 1.63/1.30 ( ! [X2 : b] : (((sK1 @ (sK2 @ X2)) = X2)) )),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f12])).
% 1.63/1.30 thf(f13,plain,(
% 1.63/1.30 ( ! [X7 : a] : (((sK0 @ (sK1 @ X7)) != sK4)) )),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f12])).
% 1.63/1.30 % SZS output end Proof for DTF2THF_9707
% 1.63/1.30 % (9888)------------------------------
% 1.63/1.30 % (9888)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.63/1.30 % (9888)Termination reason: Refutation
% 1.63/1.30
% 1.63/1.30 % (9888)Memory used [KB]: 5500
% 1.63/1.30 % (9888)Time elapsed: 0.004 s
% 1.63/1.30 % (9888)Instructions burned: 2 (million)
% 1.63/1.30 % (9888)------------------------------
% 1.63/1.30 % (9888)------------------------------
% 1.63/1.30 % (9886)Success in time 0.019 s
%------------------------------------------------------------------------------