%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU474^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:32:09 AM UTC 2026
% Result : Theorem 0.26s 0.34s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of formulae : 50 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 622 ( 157 equ; 0 cnn)
% Maximal formula atoms : 7 ( 12 avg)
% Number of connectives : 400 ( 14 ~; 130 |; 0 &; 256 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 48 ( 45 usr; 4 con; 0-4 aty)
% Number of variables : 55 ( 52 ^; 2 !; 1 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_2,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_3,type,
idem: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_4,type,
infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_5,type,
mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_6,type,
refl: ( $i > $i > $o ) > $o ).
thf(func_def_7,type,
irrefl: ( $i > $i > $o ) > $o ).
thf(func_def_8,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_9,type,
symm: ( $i > $i > $o ) > $o ).
thf(func_def_10,type,
antisymm: ( $i > $i > $o ) > $o ).
thf(func_def_11,type,
asymm: ( $i > $i > $o ) > $o ).
thf(func_def_12,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_13,type,
trans: ( $i > $i > $o ) > $o ).
thf(func_def_14,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_15,type,
trc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
trsc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_17,type,
po: ( $i > $i > $o ) > $o ).
thf(func_def_18,type,
so: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
total: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
term: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
ind: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
innf: ( $i > $i > $o ) > $i > $o ).
thf(func_def_23,type,
nfof: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_24,type,
norm: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
join: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_26,type,
lconfl: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
sconfl: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
confl: ( $i > $i > $o ) > $o ).
thf(func_def_29,type,
cr: ( $i > $i > $o ) > $o ).
thf(func_def_30,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_31,type,
vIMP: $o > $o > $o ).
thf(func_def_32,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_35,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_37,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_38,type,
vNOT: $o > $o ).
thf(func_def_39,type,
vOR: $o > $o > $o ).
thf(func_def_40,type,
vAND: $o > $o > $o ).
thf(func_def_41,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_42,type,
sK0: $i > $i > $o ).
thf(f8,axiom,
( rc
= ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X1 @ X2 )
| ( X1 = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',reflexive_closure) ).
thf(f12,axiom,
( sc
= ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X1 @ X2 )
| ( X0 @ X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',symmetric_closure) ).
thf(f30,conjecture,
! [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
= ( rc @ ( sc @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composing_symmetric_closure_and_reflexive_closure) ).
thf(f31,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
= ( rc @ ( sc @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
thf(f44,plain,
( rc
= ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X1 @ X2 )
| ( X1 = X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f45,plain,
( rc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y1 = Y2 )
| ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f44]) ).
thf(f52,plain,
( sc
= ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X1 @ X2 )
| ( X0 @ X2 @ X1 ) ) ) ),
inference(rectify,[],[f12]) ).
thf(f53,plain,
( sc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
| ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f52]) ).
thf(f86,plain,
? [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
!= ( rc @ ( sc @ X0 ) ) ),
inference(ennf_transformation,[],[f31]) ).
thf(f87,plain,
( ( sc @ ( rc @ sK0 ) )
!= ( rc @ ( sc @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f86]) ).
thf(f95,plain,
( rc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y1 = Y2 )
| ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f45]) ).
thf(f99,plain,
( sc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
| ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f53]) ).
thf(f117,plain,
( ( sc @ ( rc @ sK0 ) )
!= ( rc @ ( sc @ sK0 ) ) ),
inference(cnf_transformation,[],[f87]) ).
thf(f135,plain,
( ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
| ( Y0 @ Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y1 = Y2 )
| ( Y0 @ Y1 @ Y2 ) )
@ sK0 ) )
!= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y1 = Y2 )
| ( Y0 @ Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
| ( Y0 @ Y1 @ Y2 ) )
@ sK0 ) ) ),
inference(definition_unfolding,[],[f117,f99,f95,f95,f99]) ).
thf(f136,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( Y1 = Y0 )
| ( sK0 @ Y1 @ Y0 )
| ( Y0 = Y1 )
| ( sK0 @ Y0 @ Y1 ) ) )
!= ( ^ [Y0: $i,Y1: $i] :
( ( Y0 = Y1 )
| ( sK0 @ Y1 @ Y0 )
| ( sK0 @ Y0 @ Y1 ) ) ) ),
inference(beta-eta_normalization,[],[f135]) ).
thf(f144,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( Y1 = Y0 )
| ( sK0 @ Y1 @ Y0 )
| ( Y0 = Y1 )
| ( sK0 @ Y0 @ Y1 ) )
@ sK1 )
!= ( ^ [Y0: $i,Y1: $i] :
( ( Y0 = Y1 )
| ( sK0 @ Y1 @ Y0 )
| ( sK0 @ Y0 @ Y1 ) )
@ sK1 ) ),
inference(negative_extensionality,[],[f136]) ).
thf(f145,plain,
( ( ^ [Y0: $i] :
( ( Y0 = sK1 )
| ( sK0 @ Y0 @ sK1 )
| ( sK1 = Y0 )
| ( sK0 @ sK1 @ Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( sK1 = Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( sK0 @ sK1 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f144]) ).
thf(f146,plain,
( ( ^ [Y0: $i] :
( ( Y0 = sK1 )
| ( sK0 @ Y0 @ sK1 )
| ( sK1 = Y0 )
| ( sK0 @ sK1 @ Y0 ) )
@ sK2 )
!= ( ^ [Y0: $i] :
( ( sK1 = Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( sK0 @ sK1 @ Y0 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f145]) ).
thf(f147,plain,
( ( $true
= ( ^ [Y0: $i] :
( ( Y0 = sK1 )
| ( sK0 @ Y0 @ sK1 )
| ( sK1 = Y0 )
| ( sK0 @ sK1 @ Y0 ) )
@ sK2 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK1 = Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( sK0 @ sK1 @ Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f146]) ).
thf(f148,plain,
( ( $false
= ( ^ [Y0: $i] :
( ( Y0 = sK1 )
| ( sK0 @ Y0 @ sK1 )
| ( sK1 = Y0 )
| ( sK0 @ sK1 @ Y0 ) )
@ sK2 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( sK1 = Y0 )
| ( sK0 @ Y0 @ sK1 )
| ( sK0 @ sK1 @ Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f146]) ).
thf(f149,plain,
( ( $false
= ( ( sK2 = sK1 )
| ( sK0 @ sK2 @ sK1 )
| ( sK1 = sK2 )
| ( sK0 @ sK1 @ sK2 ) ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f150,plain,
( ( $false
= ( ( sK1 = sK2 )
| ( sK0 @ sK1 @ sK2 ) ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f149]) ).
thf(f151,plain,
( ( $false
= ( ( sK2 = sK1 )
| ( sK0 @ sK2 @ sK1 ) ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f149]) ).
thf(f152,plain,
( ( $false
= ( sK0 @ sK2 @ sK1 ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f151]) ).
thf(f153,plain,
( ( $false
= ( sK2 = sK1 ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f151]) ).
thf(f154,plain,
( ( sK1 != sK2 )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(equality_proxy_clausification,[],[f153]) ).
thf(f156,plain,
( ( sK1 != sK2 )
| ( $false
= ( sK1 = sK2 ) ) ),
inference(or_proxy_clausification,[],[f154]) ).
thf(f157,plain,
( ( sK1 != sK2 )
| ( sK1 != sK2 ) ),
inference(equality_proxy_clausification,[],[f156]) ).
thf(f158,plain,
sK1 != sK2,
inference(duplicate_literal_removal,[],[f157]) ).
thf(f161,plain,
( ( $false
= ( sK0 @ sK2 @ sK1 ) )
| ( $false
= ( ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f152]) ).
thf(f165,plain,
( ( $false
= ( sK0 @ sK2 @ sK1 ) )
| ( $false
= ( sK0 @ sK2 @ sK1 ) ) ),
inference(or_proxy_clausification,[],[f161]) ).
thf(f166,plain,
( $false
= ( sK0 @ sK2 @ sK1 ) ),
inference(duplicate_literal_removal,[],[f165]) ).
thf(f167,plain,
( ( $false
= ( sK0 @ sK1 @ sK2 ) )
| ( $false
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f150]) ).
thf(f176,plain,
( ( $false
= ( sK0 @ sK1 @ sK2 ) )
| ( $false
= ( ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f167]) ).
thf(f179,plain,
( ( $false
= ( sK0 @ sK1 @ sK2 ) )
| ( $false
= ( sK0 @ sK1 @ sK2 ) ) ),
inference(or_proxy_clausification,[],[f176]) ).
thf(f181,plain,
( $false
= ( sK0 @ sK1 @ sK2 ) ),
inference(duplicate_literal_removal,[],[f179]) ).
thf(f182,plain,
( ( $true
= ( ( sK2 = sK1 )
| ( sK0 @ sK2 @ sK1 )
| ( sK1 = sK2 )
| ( sK0 @ sK1 @ sK2 ) ) )
| ( $true
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f147]) ).
thf(f183,plain,
( ( $true
= ( ( sK1 = sK2 )
| ( sK0 @ sK1 @ sK2 ) ) )
| ( $true
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) )
| ( $true
= ( ( sK2 = sK1 )
| ( sK0 @ sK2 @ sK1 ) ) ) ),
inference(or_proxy_clausification,[],[f182]) ).
thf(f184,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( ( sK1 = sK2 )
| ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) )
| ( $true
= ( ( sK2 = sK1 )
| ( sK0 @ sK2 @ sK1 ) ) )
| ( $true
= ( sK1 = sK2 ) ) ),
inference(or_proxy_clausification,[],[f183]) ).
thf(f185,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( ( sK0 @ sK2 @ sK1 )
| ( sK0 @ sK1 @ sK2 ) ) )
| ( $true
= ( ( sK2 = sK1 )
| ( sK0 @ sK2 @ sK1 ) ) )
| ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( sK1 = sK2 ) ) ),
inference(or_proxy_clausification,[],[f184]) ).
thf(f186,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( ( sK2 = sK1 )
| ( sK0 @ sK2 @ sK1 ) ) )
| ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( sK0 @ sK2 @ sK1 ) ) ),
inference(or_proxy_clausification,[],[f185]) ).
thf(f187,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 @ sK1 ) )
| ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( sK1 = sK2 ) )
| ( $true
= ( sK0 @ sK2 @ sK1 ) )
| ( $true
= ( sK2 = sK1 ) ) ),
inference(or_proxy_clausification,[],[f186]) ).
thf(f188,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 @ sK1 ) )
| ( sK1 = sK2 )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK2 @ sK1 ) )
| ( $true
= ( sK2 = sK1 ) ) ),
inference(equality_proxy_clausification,[],[f187]) ).
thf(f189,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 @ sK1 ) )
| ( sK1 = sK2 )
| ( sK1 = sK2 )
| ( $true
= ( sK0 @ sK2 @ sK1 ) )
| ( sK1 = sK2 ) ),
inference(equality_proxy_clausification,[],[f188]) ).
thf(f190,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 @ sK1 ) )
| ( sK1 = sK2 ) ),
inference(duplicate_literal_removal,[],[f189]) ).
thf(f191,plain,
( ( $true
= ( sK0 @ sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 @ sK1 ) ) ),
inference(forward_subsumption_resolution,[],[f190,f158]) ).
thf(f192,plain,
( ( $true = $false )
| ( $true
= ( sK0 @ sK2 @ sK1 ) ) ),
inference(forward_demodulation,[],[f191,f181]) ).
thf(f193,plain,
( $true
= ( sK0 @ sK2 @ sK1 ) ),
inference(trivial_inequality_removal,[],[f192]) ).
thf(f194,plain,
$true = $false,
inference(forward_demodulation,[],[f193,f166]) ).
thf(f195,plain,
$false,
inference(trivial_inequality_removal,[],[f194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU474^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.25 % Computer : n017.cluster.edu
% 0.13/0.25 % Model : x86_64 x86_64
% 0.13/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.25 % Memory : 8046.5625MB
% 0.13/0.25 % OS : Linux 6.8.0-71-generic
% 0.13/0.25 % CPULimit : 300
% 0.13/0.25 % WCLimit : 300
% 0.13/0.25 % DateTime : Tue Sep 29 13:37:38 UTC 2026
% 0.13/0.25 % CPUTime :
% 0.13/0.25 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.29 Running first-order model finding
% 0.13/0.29 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.26/0.34 % (351141)Will run a generic schedule for satisfiability detection.
% 0.26/0.34 % (351151)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=631110440:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.26/0.34 % (351151) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-351141-351151"...
% 0.26/0.34 % (351147)% WARNING: option uhcvi not known.
% 0.26/0.34 % (351151)...printing done.
% 0.26/0.34 % (351151)Refutation found. Thanks to Tanya!
% 0.26/0.34 % SZS status Theorem for theBenchmark
% 0.26/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.34 % (351151)------------------------------
% 0.26/0.34 % (351151)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.34 % (351151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.34 % (351151)CaDiCaL version: 2.1.3
% 0.26/0.34 % (351151)Termination reason: Refutation
% 0.26/0.34 % (351151)Time elapsed: 0.007 s
% 0.26/0.34 % (351151)Peak memory usage: 12 MB
% 0.26/0.34 % (351151)Instructions burned: 14 (million)
% 0.26/0.34 % (351141)Success in time 0.033 s
% 0.26/0.34 % Vampire exiting
%------------------------------------------------------------------------------