%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYN360^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 : n027.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:50:50 AM UTC 2026
% Result : Theorem 1.69s 1.43s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 117 ( 32 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 134 ( 19 ~; 6 |; 12 &; 87 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 ^; 43 !; 20 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cQ: $i > $i > $o ).
thf(func_def_1,type,
c_less_: $i > $i > $o ).
thf(func_def_5,type,
sK0: $i > $i ).
thf(f18,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f17]) ).
thf(f17,plain,
$true != $true,
inference(superposition,[status(thm)],[f16,f13]) ).
thf(f13,plain,
! [X3: $i] :
( ( c_less_ @ X3 @ ( sK0 @ X3 ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ! [X0: $i] :
( ! [X1: $i] :
( ( cQ @ X0 @ X1 )
= $true )
| ! [X2: $i] :
( $true
!= ( c_less_ @ X0 @ X2 ) ) )
& ! [X3: $i] :
( ( c_less_ @ X3 @ ( sK0 @ X3 ) )
= $true )
& ( $true
!= ( cQ @ sK2 @ sK1 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9]) ).
thf(f9,plain,
! [X3: $i] :
( ? [X4: $i] :
( $true
= ( c_less_ @ X3 @ X4 ) )
=> ( ( c_less_ @ X3 @ ( sK0 @ X3 ) )
= $true ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ? [X5: $i,X6: $i] :
( $true
!= ( cQ @ X6 @ X5 ) )
=> ( $true
!= ( cQ @ sK2 @ sK1 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
( ! [X0: $i] :
( ! [X1: $i] :
( ( cQ @ X0 @ X1 )
= $true )
| ! [X2: $i] :
( $true
!= ( c_less_ @ X0 @ X2 ) ) )
& ! [X3: $i] :
? [X4: $i] :
( $true
= ( c_less_ @ X3 @ X4 ) )
& ? [X5: $i,X6: $i] :
( $true
!= ( cQ @ X6 @ X5 ) ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
( ! [X2: $i] :
( ! [X4: $i] :
( ( cQ @ X2 @ X4 )
= $true )
| ! [X3: $i] :
( $true
!= ( c_less_ @ X2 @ X3 ) ) )
& ! [X0: $i] :
? [X1: $i] :
( ( c_less_ @ X0 @ X1 )
= $true )
& ? [X6: $i,X5: $i] :
( $true
!= ( cQ @ X5 @ X6 ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
( ? [X6: $i,X5: $i] :
( $true
!= ( cQ @ X5 @ X6 ) )
& ! [X2: $i] :
( ! [X4: $i] :
( ( cQ @ X2 @ X4 )
= $true )
| ! [X3: $i] :
( $true
!= ( c_less_ @ X2 @ X3 ) ) )
& ! [X0: $i] :
? [X1: $i] :
( ( c_less_ @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ! [X2: $i] :
( ? [X3: $i] :
( $true
= ( c_less_ @ X2 @ X3 ) )
=> ! [X4: $i] :
( ( cQ @ X2 @ X4 )
= $true ) )
& ! [X0: $i] :
? [X1: $i] :
( ( c_less_ @ X0 @ X1 )
= $true ) )
=> ! [X5: $i,X6: $i] :
( $true
= ( cQ @ X5 @ X6 ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: $i] :
? [X1: $i] : ( c_less_ @ X0 @ X1 )
& ! [X2: $i] :
( ? [X3: $i] : ( c_less_ @ X2 @ X3 )
=> ! [X4: $i] : ( cQ @ X2 @ X4 ) ) )
=> ! [X5: $i,X6: $i] : ( cQ @ X5 @ X6 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X2: $i] :
? [X1: $i] : ( c_less_ @ X2 @ X1 )
& ! [X0: $i] :
( ? [X1: $i] : ( c_less_ @ X0 @ X1 )
=> ! [X1: $i] : ( cQ @ X0 @ X1 ) ) )
=> ! [X0: $i,X1: $i] : ( cQ @ X0 @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ! [X2: $i] :
? [X1: $i] : ( c_less_ @ X2 @ X1 )
& ! [X0: $i] :
( ? [X1: $i] : ( c_less_ @ X0 @ X1 )
=> ! [X1: $i] : ( cQ @ X0 @ X1 ) ) )
=> ! [X0: $i,X1: $i] : ( cQ @ X0 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.OE9lWI2R1B/DTF2THF_28439.p',cX2111A_pme) ).
thf(f16,plain,
! [X0: $i] :
( ( c_less_ @ sK2 @ X0 )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f15]) ).
thf(f15,plain,
! [X0: $i] :
( ( $true != $true )
| ( ( c_less_ @ sK2 @ X0 )
!= $true ) ),
inference(superposition,[status(thm)],[f12,f14]) ).
thf(f14,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( cQ @ X0 @ X1 )
= $true )
| ( $true
!= ( c_less_ @ X0 @ X2 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f12,plain,
( $true
!= ( cQ @ sK2 @ sK1 ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN360^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.31 % Computer : n027.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Tue Feb 24 13:56:22 EST 2026
% 0.12/0.31 % CPUTime :
% 0.12/0.32 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.42 ---- Original DTF file ---
% 0.17/0.42 thf(spec,logic,$$dhol).
% 0.17/0.42 %------------------------------------------------------------------------------
% 0.17/0.42 % File : SYN360^5 : TPTP v9.2.1. Released v4.0.0.
% 0.17/0.42 % Domain : Syntactic
% 0.17/0.42 % Problem : TPS problem X2111A
% 0.17/0.42 % Version : Especial.
% 0.17/0.42 % English : Variant of X2111 for testing infix mechanism.
% 0.17/0.42
% 0.17/0.42 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.42 % Source : [Bro09]
% 0.17/0.42 % Names : tps_0142 [Bro09]
% 0.17/0.42 % : X2111A [TPS]
% 0.17/0.42
% 0.17/0.42 % Status : Theorem
% 0.17/0.42 % Rating : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.0
% 0.17/0.42 % Syntax : Number of formulae : 3 ( 0 unt; 2 typ; 0 def)
% 0.17/0.42 % Number of atoms : 4 ( 0 equ; 0 cnn)
% 0.17/0.42 % Maximal formula atoms : 4 ( 4 avg)
% 0.17/0.42 % Number of connectives : 11 ( 0 ~; 0 |; 1 &; 8 @)
% 0.17/0.42 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.17/0.42 % Maximal formula depth : 8 ( 8 avg)
% 0.17/0.42 % Number of types : 2 ( 0 usr)
% 0.17/0.42 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.17/0.42 % Number of symbols : 2 ( 2 usr; 0 con; 2-2 aty)
% 0.17/0.42 % Number of variables : 7 ( 0 ^; 5 !; 2 ?; 7 :)
% 0.17/0.42 % SPC : TH0_THM_NEQ_NAR
% 0.17/0.42
% 0.17/0.42 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.17/0.42 % project in the Department of Mathematical Sciences at Carnegie
% 0.17/0.42 % Mellon University. Distributed under the Creative Commons copyleft
% 0.17/0.42 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.17/0.42 % : Polymorphic definitions expanded.
% 0.17/0.42 % :
% 0.17/0.42 %------------------------------------------------------------------------------
% 0.17/0.42 thf(cQ,type,
% 0.17/0.42 cQ: $i > $i > $o ).
% 0.17/0.42
% 0.17/0.42 thf(c_less_,type,
% 0.17/0.42 c_less_: $i > $i > $o ).
% 0.17/0.42
% 0.17/0.42 thf(cX2111A_pme,conjecture,
% 0.17/0.42 ( ( ! [Xx: $i] :
% 0.17/0.42 ( ? [Xy: $i] : ( c_less_ @ Xx @ Xy )
% 0.17/0.42 => ! [Xy: $i] : ( cQ @ Xx @ Xy ) )
% 0.17/0.42 & ! [Xz: $i] :
% 0.17/0.42 ? [Xy: $i] : ( c_less_ @ Xz @ Xy ) )
% 0.17/0.42 => ! [Xy: $i,Xx: $i] : ( cQ @ Xx @ Xy ) ) ).
% 0.17/0.42
% 0.17/0.42 %------------------------------------------------------------------------------
% 0.17/0.42 ------------------------
% 1.48/1.39 ---- Embedded in THF ---
% 1.48/1.39 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.39 %%% Generated on Tue Feb 24 13:56:23 EST 2026
% 1.48/1.39 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.39 %%% Logic specification used:
% 1.48/1.39 %%% thf(spec, logic, $$dhol).
% 1.48/1.39
% 1.48/1.39 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.OE9lWI2R1B/DTF2DTF28439.p
% See solution above
% 1.48/1.39 ------------------------
% 1.69/1.40 ---- Cleaned THF ---
% 1.69/1.40 thf(cQ,type,
% 1.69/1.40 cQ: $i > $i > $o ).
% 1.69/1.40
% 1.69/1.40 thf(c_less_,type,
% 1.69/1.40 c_less_: $i > $i > $o ).
% 1.69/1.40
% 1.69/1.40 thf(cX2111A_pme,conjecture,
% 1.69/1.40 ( ( ! [Xx: $i] :
% 1.69/1.40 ( ? [Xy: $i] : ( c_less_ @ Xx @ Xy )
% 1.69/1.40 => ! [Xy: $i] : ( cQ @ Xx @ Xy ) )
% 1.69/1.40 & ! [Xz: $i] :
% 1.69/1.40 ? [Xy: $i] : ( c_less_ @ Xz @ Xy ) )
% 1.69/1.40 => ! [Xy: $i,Xx: $i] : ( cQ @ Xx @ Xy ) ) ).
% 1.69/1.40 ------------------------
% 1.69/1.43 % (28543)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_28439 for (3000ds/18Mi)
% 1.69/1.43 % (28539)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_28439 for (3000ds/27Mi)
% 1.69/1.43 % (28538)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_28439 for (3000ds/4Mi)
% 1.69/1.43 % (28541)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_28439 for (3000ds/2Mi)
% 1.69/1.43 % (28542)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_28439 for (3000ds/275Mi)
% 1.69/1.43 % (28537)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_28439 for (3000ds/183Mi)
% 1.69/1.43 % (28540)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_28439 for (3000ds/2Mi)
% 1.69/1.43 % (28541)Instruction limit reached!
% 1.69/1.43 % (28541)------------------------------
% 1.69/1.43 % (28541)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.43 % (28541)Termination reason: Unknown
% 1.69/1.43 % (28541)Termination phase: Saturation
% 1.69/1.43
% 1.69/1.43 % (28541)Memory used [KB]: 895
% 1.69/1.43 % (28541)Time elapsed: 0.003 s
% 1.69/1.43 % (28541)Instructions burned: 2 (million)
% 1.69/1.43 % (28541)------------------------------
% 1.69/1.43 % (28541)------------------------------
% 1.69/1.43 % (28540)Instruction limit reached!
% 1.69/1.43 % (28540)------------------------------
% 1.69/1.43 % (28540)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.43 % (28540)Termination reason: Unknown
% 1.69/1.43 % (28540)Termination phase: Saturation
% 1.69/1.43 % (28542)First to succeed.
% 1.69/1.43
% 1.69/1.43 % (28540)Memory used [KB]: 5500
% 1.69/1.43 % (28540)Time elapsed: 0.003 s
% 1.69/1.43 % (28540)Instructions burned: 2 (million)
% 1.69/1.43 % (28540)------------------------------
% 1.69/1.43 % (28540)------------------------------
% 1.69/1.43 % (28539)Also succeeded, but the first one will report.
% 1.69/1.43 % (28537)Also succeeded, but the first one will report.
% 1.69/1.43 % (28542)Refutation found. Thanks to Tanya!
% 1.69/1.43 % SZS status Theorem for DTF2THF_28439
% 1.69/1.43 % SZS output start Proof for DTF2THF_28439
% 1.69/1.43 thf(func_def_0, type, cQ: $i > $i > $o).
% 1.69/1.43 thf(func_def_1, type, c_less_: $i > $i > $o).
% 1.69/1.43 thf(func_def_5, type, sK0: $i > $i).
% 1.69/1.43 thf(f18,plain,(
% 1.69/1.43 $false),
% 1.69/1.43 inference(trivial_inequality_removal,[status(thm)],[f17])).
% 1.69/1.43 thf(f17,plain,(
% 1.69/1.43 ($true != $true)),
% 1.69/1.43 inference(superposition,[status(thm)],[f16,f13])).
% 1.69/1.43 thf(f13,plain,(
% 1.69/1.43 ( ! [X3 : $i] : (((c_less_ @ X3 @ (sK0 @ X3)) = $true)) )),
% 1.69/1.43 inference(cnf_transformation,[status(thm)],[f11])).
% 1.69/1.43 thf(f11,plain,(
% 1.69/1.43 ! [X0 : $i] : (! [X1 : $i] : ((cQ @ X0 @ X1) = $true) | ! [X2 : $i] : ($true != (c_less_ @ X0 @ X2))) & ! [X3 : $i] : ((c_less_ @ X3 @ (sK0 @ X3)) = $true) & ($true != (cQ @ sK2 @ sK1))),
% 1.69/1.43 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9])).
% 1.69/1.43 thf(f9,plain,(
% 1.69/1.43 ! [X3 : $i] : (? [X4 : $i] : ($true = (c_less_ @ X3 @ X4)) => ((c_less_ @ X3 @ (sK0 @ X3)) = $true))),
% 1.69/1.43 introduced(definition,[],[choice_axiom])).
% 1.69/1.43 thf(f10,plain,(
% 1.69/1.43 ? [X5 : $i,X6 : $i] : ($true != (cQ @ X6 @ X5)) => ($true != (cQ @ sK2 @ sK1))),
% 1.69/1.43 introduced(definition,[],[choice_axiom])).
% 1.69/1.43 thf(f8,plain,(
% 1.69/1.43 ! [X0 : $i] : (! [X1 : $i] : ((cQ @ X0 @ X1) = $true) | ! [X2 : $i] : ($true != (c_less_ @ X0 @ X2))) & ! [X3 : $i] : ? [X4 : $i] : ($true = (c_less_ @ X3 @ X4)) & ? [X5 : $i,X6 : $i] : ($true != (cQ @ X6 @ X5))),
% 1.69/1.43 inference(rectify,[status(thm)],[f7])).
% 1.69/1.43 thf(f7,plain,(
% 1.69/1.43 ! [X2 : $i] : (! [X4 : $i] : ((cQ @ X2 @ X4) = $true) | ! [X3 : $i] : ($true != (c_less_ @ X2 @ X3))) & ! [X0 : $i] : ? [X1 : $i] : ((c_less_ @ X0 @ X1) = $true) & ? [X6 : $i,X5 : $i] : ($true != (cQ @ X5 @ X6))),
% 1.69/1.43 inference(flattening,[status(thm)],[f6])).
% 1.69/1.43 thf(f6,plain,(
% 1.69/1.43 ? [X6 : $i,X5 : $i] : ($true != (cQ @ X5 @ X6)) & (! [X2 : $i] : (! [X4 : $i] : ((cQ @ X2 @ X4) = $true) | ! [X3 : $i] : ($true != (c_less_ @ X2 @ X3))) & ! [X0 : $i] : ? [X1 : $i] : ((c_less_ @ X0 @ X1) = $true))),
% 1.69/1.43 inference(ennf_transformation,[status(thm)],[f5])).
% 1.69/1.43 thf(f5,plain,(
% 1.69/1.43 ~((! [X2 : $i] : (? [X3 : $i] : ($true = (c_less_ @ X2 @ X3)) => ! [X4 : $i] : ((cQ @ X2 @ X4) = $true)) & ! [X0 : $i] : ? [X1 : $i] : ((c_less_ @ X0 @ X1) = $true)) => ! [X5 : $i,X6 : $i] : ($true = (cQ @ X5 @ X6)))),
% 1.69/1.43 inference(fool_elimination,[status(thm)],[f4])).
% 1.69/1.43 thf(f4,plain,(
% 1.69/1.43 ~((! [X0 : $i] : ? [X1 : $i] : (c_less_ @ X0 @ X1) & ! [X2 : $i] : (? [X3 : $i] : (c_less_ @ X2 @ X3) => ! [X4 : $i] : (cQ @ X2 @ X4))) => ! [X5 : $i,X6 : $i] : (cQ @ X5 @ X6))),
% 1.69/1.43 inference(rectify,[status(thm)],[f2])).
% 1.69/1.43 thf(f2,negated_conjecture,(
% 1.69/1.43 ~((! [X2 : $i] : ? [X1 : $i] : (c_less_ @ X2 @ X1) & ! [X0 : $i] : (? [X1 : $i] : (c_less_ @ X0 @ X1) => ! [X1 : $i] : (cQ @ X0 @ X1))) => ! [X0 : $i,X1 : $i] : (cQ @ X0 @ X1))),
% 1.69/1.43 inference(negated_conjecture,[status(cth)],[f1])).
% 1.69/1.43 thf(f1,conjecture,(
% 1.69/1.43 (! [X2 : $i] : ? [X1 : $i] : (c_less_ @ X2 @ X1) & ! [X0 : $i] : (? [X1 : $i] : (c_less_ @ X0 @ X1) => ! [X1 : $i] : (cQ @ X0 @ X1))) => ! [X0 : $i,X1 : $i] : (cQ @ X0 @ X1)),
% 1.69/1.43 file('/export/starexec/sandbox/tmp/tmp.OE9lWI2R1B/DTF2THF_28439.p',cX2111A_pme)).
% 1.69/1.43 thf(f16,plain,(
% 1.69/1.43 ( ! [X0 : $i] : (((c_less_ @ sK2 @ X0) != $true)) )),
% 1.69/1.43 inference(trivial_inequality_removal,[status(thm)],[f15])).
% 1.69/1.43 thf(f15,plain,(
% 1.69/1.43 ( ! [X0 : $i] : (($true != $true) | ((c_less_ @ sK2 @ X0) != $true)) )),
% 1.69/1.43 inference(superposition,[status(thm)],[f12,f14])).
% 1.69/1.43 thf(f14,plain,(
% 1.69/1.43 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cQ @ X0 @ X1) = $true) | ($true != (c_less_ @ X0 @ X2))) )),
% 1.69/1.43 inference(cnf_transformation,[status(thm)],[f11])).
% 1.69/1.43 thf(f12,plain,(
% 1.69/1.43 ($true != (cQ @ sK2 @ sK1))),
% 1.69/1.43 inference(cnf_transformation,[status(thm)],[f11])).
% 1.69/1.43 % SZS output end Proof for DTF2THF_28439
% 1.69/1.43 % (28542)------------------------------
% 1.69/1.43 % (28542)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.43 % (28542)Termination reason: Refutation
% 1.69/1.43
% 1.69/1.43 % (28542)Memory used [KB]: 5500
% 1.69/1.43 % (28542)Time elapsed: 0.004 s
% 1.69/1.43 % (28542)Instructions burned: 1 (million)
% 1.69/1.43 % (28542)------------------------------
% 1.69/1.43 % (28542)------------------------------
% 1.69/1.43 % (28536)Success in time 0.018 s
%------------------------------------------------------------------------------