TSTP Solution File: NUM638^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM638^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.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 : Tue May 21 01:43:59 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 19
% Syntax : Number of formulae : 69 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 237 ( 150 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 295 ( 66 ~; 78 |; 10 &; 117 @)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 66 ( 24 ^ 35 !; 6 ?; 66 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% 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,
n_1: nat ).
thf(func_def_3,type,
suc: nat > nat ).
thf(func_def_4,type,
some: ( nat > $o ) > $o ).
thf(func_def_11,type,
sK0: nat ).
thf(func_def_12,type,
sK1: nat ).
thf(func_def_14,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
sK4: nat > nat ).
thf(f78,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f37,f42,f68,f77]) ).
thf(f77,plain,
( ~ spl2_1
| ~ spl2_3
| spl2_4 ),
inference(avatar_contradiction_clause,[],[f76]) ).
thf(f76,plain,
( $false
| ~ spl2_1
| ~ spl2_3
| spl2_4 ),
inference(subsumption_resolution,[],[f75,f41]) ).
thf(f41,plain,
( ( sK1 != sK0 )
| spl2_4 ),
inference(avatar_component_clause,[],[f39]) ).
thf(f39,plain,
( spl2_4
<=> ( sK1 = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f75,plain,
( ( sK1 = sK0 )
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f74,plain,
( ( sK1 = sK0 )
| ( x != x )
| ~ spl2_1
| ~ spl2_3 ),
inference(superposition,[],[f70,f36]) ).
thf(f36,plain,
( ( x
= ( suc @ sK1 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f34,plain,
( spl2_3
<=> ( x
= ( suc @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f70,plain,
( ! [X0: nat] :
( ( x
!= ( suc @ X0 ) )
| ( sK0 = X0 ) )
| ~ spl2_1 ),
inference(superposition,[],[f19,f27]) ).
thf(f27,plain,
( ( x
= ( suc @ sK0 ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f25,plain,
( spl2_1
<=> ( x
= ( suc @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f19,plain,
! [X0: nat,X1: nat] :
( ( ( suc @ X0 )
!= ( suc @ X1 ) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
! [X0: nat,X1: nat] :
( ( X0 = X1 )
| ( ( suc @ X0 )
!= ( suc @ X1 ) ) ),
inference(ennf_transformation,[],[f2]) ).
thf(f2,axiom,
! [X0: nat,X1: nat] :
( ( ( suc @ X0 )
= ( suc @ X1 ) )
=> ( X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
thf(f68,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f67]) ).
thf(f67,plain,
( $false
| spl2_2 ),
inference(subsumption_resolution,[],[f66,f18]) ).
thf(f18,plain,
x != n_1,
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
x != n_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
thf(f66,plain,
( ( x = n_1 )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f65,plain,
( ( x != x )
| ( x = n_1 )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f62]) ).
thf(f62,plain,
( ( x != x )
| ( x = n_1 )
| ( x != x )
| spl2_2 ),
inference(superposition,[],[f51,f61]) ).
thf(f61,plain,
( ( x
= ( suc @ ( sK4 @ x ) ) )
| spl2_2 ),
inference(subsumption_resolution,[],[f60,f18]) ).
thf(f60,plain,
( ( x
= ( suc @ ( sK4 @ x ) ) )
| ( x = n_1 )
| spl2_2 ),
inference(equality_resolution,[],[f59]) ).
thf(f59,plain,
( ! [X0: nat] :
( ( x != X0 )
| ( ( suc @ ( sK4 @ X0 ) )
= X0 )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ! [X0: nat] :
( ( n_1 = X0 )
| ( x != X0 )
| ( ( suc @ ( sK4 @ X0 ) )
= X0 )
| ( x != x ) )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f54]) ).
thf(f54,plain,
( ! [X0: nat] :
( ( ( suc @ ( sK4 @ X0 ) )
= X0 )
| ( n_1 = X0 )
| ( x != X0 )
| ( x != x )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(superposition,[],[f51,f53]) ).
thf(f53,plain,
( ! [X0: nat] :
( ( x
= ( suc @ ( sK4 @ X0 ) ) )
| ( ( suc @ ( sK4 @ X0 ) )
= X0 )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(equality_proxy_clausification,[],[f52]) ).
thf(f52,plain,
( ! [X0: nat] :
( ( n_1 = X0 )
| ( ( suc @ ( sK4 @ X0 ) )
= X0 )
| ( $true
= ( x
= ( suc @ ( sK4 @ X0 ) ) ) ) )
| spl2_2 ),
inference(equality_proxy_clausification,[],[f48]) ).
thf(f48,plain,
( ! [X0: nat] :
( ( n_1 = X0 )
| ( $true
= ( ( suc @ ( sK4 @ X0 ) )
= X0 ) )
| ( $true
= ( x
= ( suc @ ( sK4 @ X0 ) ) ) ) )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f47]) ).
thf(f47,plain,
( ! [X0: nat] :
( ( ( x
= ( suc @ ( sK4 @ X0 ) ) )
!= ( ( suc @ ( sK4 @ X0 ) )
= X0 ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(beta_eta_normalization,[],[f46]) ).
thf(f46,plain,
( ! [X0: nat] :
( ( ( ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 )
@ ( sK4 @ X0 ) )
!= ( ^ [Y0: nat] :
( x
= ( suc @ Y0 ) )
@ ( sK4 @ X0 ) ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f45]) ).
thf(f45,plain,
( ! [X0: nat] :
( ( ( ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= ( ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f44,plain,
( ! [X0: nat] :
( ( $true != $true )
| ( n_1 = X0 )
| ( ( ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= ( ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) ) ) )
| spl2_2 ),
inference(constrained_superposition,[],[f31,f23]) ).
thf(f23,plain,
! [X0: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) ) )
| ( n_1 = X0 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
! [X0: nat] :
( ( n_1 = X0 )
| ( $true
= ( some
@ ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: nat] :
( ( n_1 != X0 )
=> ( $true
= ( some
@ ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
! [X0: nat] :
( ( n_1 != X0 )
=> ( some
@ ^ [X1: nat] :
( ( suc @ X1 )
= X0 ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X0: nat] :
( ( n_1 != X0 )
=> ( some
@ ^ [X2: nat] :
( ( suc @ X2 )
= X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz3) ).
thf(f31,plain,
( ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) )
| spl2_2 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl2_2
<=> ( $true
= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f51,plain,
( ! [X0: nat] :
( ( x
!= ( suc @ ( sK4 @ X0 ) ) )
| ( n_1 = X0 )
| ( ( suc @ ( sK4 @ X0 ) )
!= X0 ) )
| spl2_2 ),
inference(equality_proxy_clausification,[],[f50]) ).
thf(f50,plain,
( ! [X0: nat] :
( ( ( ( suc @ ( sK4 @ X0 ) )
= X0 )
= $false )
| ( n_1 = X0 )
| ( x
!= ( suc @ ( sK4 @ X0 ) ) ) )
| spl2_2 ),
inference(equality_proxy_clausification,[],[f49]) ).
thf(f49,plain,
( ! [X0: nat] :
( ( ( x
= ( suc @ ( sK4 @ X0 ) ) )
= $false )
| ( n_1 = X0 )
| ( ( ( suc @ ( sK4 @ X0 ) )
= X0 )
= $false ) )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f47]) ).
thf(f42,plain,
( ~ spl2_4
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f20,f29,f39]) ).
thf(f20,plain,
( ( sK1 != sK0 )
| ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) )
| ( ( x
= ( suc @ sK0 ) )
& ( x
= ( suc @ sK1 ) )
& ( sK1 != sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f16]) ).
thf(f16,plain,
( ? [X0: nat,X1: nat] :
( ( x
= ( suc @ X0 ) )
& ( x
= ( suc @ X1 ) )
& ( X0 != X1 ) )
=> ( ( x
= ( suc @ sK0 ) )
& ( x
= ( suc @ sK1 ) )
& ( sK1 != sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
( ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) )
| ? [X0: nat,X1: nat] :
( ( x
= ( suc @ X0 ) )
& ( x
= ( suc @ X1 ) )
& ( X0 != X1 ) ) ),
inference(flattening,[],[f13]) ).
thf(f13,plain,
( ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) )
| ? [X0: nat,X1: nat] :
( ( X0 != X1 )
& ( x
= ( suc @ X0 ) )
& ( x
= ( suc @ X1 ) ) ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
( ! [X0: nat,X1: nat] :
( ( x
= ( suc @ X1 ) )
=> ( ( x
= ( suc @ X0 ) )
=> ( X0 = X1 ) ) )
=> ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) ) ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
~ ~ ( ! [X0: nat,X1: nat] :
( ( x
= ( suc @ X1 ) )
=> ( ( x
= ( suc @ X0 ) )
=> ( X0 = X1 ) ) )
=> ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ~ ( ! [X0: nat,X1: nat] :
( ( x
= ( suc @ X1 ) )
=> ( ( x
= ( suc @ X0 ) )
=> ( X0 = X1 ) ) )
=> ~ ( some
@ ^ [X2: nat] :
( x
= ( suc @ X2 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ~ ( ! [X1: nat,X3: nat] :
( ( x
= ( suc @ X3 ) )
=> ( ( x
= ( suc @ X1 ) )
=> ( X1 = X3 ) ) )
=> ~ ( some
@ ^ [X2: nat] :
( x
= ( suc @ X2 ) ) ) ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
~ ( ! [X1: nat,X3: nat] :
( ( x
= ( suc @ X3 ) )
=> ( ( x
= ( suc @ X1 ) )
=> ( X1 = X3 ) ) )
=> ~ ( some
@ ^ [X2: nat] :
( x
= ( suc @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz3a) ).
thf(f37,plain,
( ~ spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f21,f34,f29]) ).
thf(f21,plain,
( ( x
= ( suc @ sK1 ) )
| ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f32,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f22,f29,f25]) ).
thf(f22,plain,
( ( x
= ( suc @ sK0 ) )
| ( $true
!= ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM638^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 07:29:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36 % (10221)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.36 % (10221)Instruction limit reached!
% 0.14/0.36 % (10221)------------------------------
% 0.14/0.36 % (10221)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (10221)Termination reason: Unknown
% 0.14/0.36 % (10221)Termination phase: Saturation
% 0.14/0.36
% 0.14/0.36 % (10221)Memory used [KB]: 5500
% 0.14/0.36 % (10221)Time elapsed: 0.002 s
% 0.14/0.36 % (10221)Instructions burned: 2 (million)
% 0.14/0.36 % (10221)------------------------------
% 0.14/0.36 % (10221)------------------------------
% 0.14/0.37 % (10217)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.14/0.37 % (10218)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 theBenchmark for (3000ds/4Mi)
% 0.14/0.37 % (10219)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 theBenchmark for (3000ds/27Mi)
% 0.14/0.37 % (10220)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (10222)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.14/0.37 % (10223)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.37 % (10220)Instruction limit reached!
% 0.14/0.37 % (10220)------------------------------
% 0.14/0.37 % (10220)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (10220)Termination reason: Unknown
% 0.14/0.37 % (10220)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (10220)Memory used [KB]: 5500
% 0.14/0.37 % (10220)Time elapsed: 0.003 s
% 0.14/0.37 % (10220)Instructions burned: 2 (million)
% 0.14/0.37 % (10220)------------------------------
% 0.14/0.37 % (10220)------------------------------
% 0.14/0.37 % (10224)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.14/0.37 % (10222)Refutation not found, incomplete strategy
% 0.14/0.37 % (10222)------------------------------
% 0.14/0.37 % (10222)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (10222)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (10222)Memory used [KB]: 5500
% 0.14/0.37 % (10222)Time elapsed: 0.004 s
% 0.14/0.37 % (10222)Instructions burned: 2 (million)
% 0.14/0.37 % (10222)------------------------------
% 0.14/0.37 % (10222)------------------------------
% 0.14/0.37 % (10219)Refutation not found, incomplete strategy
% 0.14/0.37 % (10219)------------------------------
% 0.14/0.37 % (10219)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (10219)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (10219)Memory used [KB]: 5500
% 0.14/0.37 % (10219)Time elapsed: 0.003 s
% 0.14/0.37 % (10219)Instructions burned: 2 (million)
% 0.14/0.37 % (10219)------------------------------
% 0.14/0.37 % (10219)------------------------------
% 0.14/0.37 % (10218)Refutation not found, incomplete strategy
% 0.14/0.37 % (10218)------------------------------
% 0.14/0.37 % (10218)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (10218)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (10218)Memory used [KB]: 5500
% 0.14/0.37 % (10218)Time elapsed: 0.005 s
% 0.14/0.37 % (10218)Instructions burned: 3 (million)
% 0.14/0.37 % (10218)------------------------------
% 0.14/0.37 % (10218)------------------------------
% 0.14/0.37 % (10225)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.37 % (10224)Instruction limit reached!
% 0.14/0.37 % (10224)------------------------------
% 0.14/0.37 % (10224)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (10224)Termination reason: Unknown
% 0.14/0.37 % (10224)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (10224)Memory used [KB]: 5500
% 0.14/0.37 % (10224)Time elapsed: 0.005 s
% 0.14/0.37 % (10224)Instructions burned: 3 (million)
% 0.14/0.37 % (10224)------------------------------
% 0.14/0.37 % (10224)------------------------------
% 0.14/0.37 % (10223)First to succeed.
% 0.14/0.37 % (10223)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (10223)------------------------------
% 0.14/0.38 % (10223)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (10223)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (10223)Memory used [KB]: 5500
% 0.14/0.38 % (10223)Time elapsed: 0.008 s
% 0.14/0.38 % (10223)Instructions burned: 6 (million)
% 0.14/0.38 % (10223)------------------------------
% 0.14/0.38 % (10223)------------------------------
% 0.14/0.38 % (10214)Success in time 0.013 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------