TSTP Solution File: SET614^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET614^3 : TPTP v8.2.0. Released v3.6.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.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 03:12:26 EDT 2024
% Result : Theorem 0.22s 0.39s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 22
% Syntax : Number of formulae : 70 ( 24 unt; 18 typ; 0 def)
% Number of atoms : 490 ( 97 equ; 0 cnn)
% Maximal formula atoms : 5 ( 9 avg)
% Number of connectives : 389 ( 55 ~; 72 |; 34 &; 227 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 93 ( 93 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 3 con; 0-3 aty)
% Number of variables : 56 ( 40 ^ 9 !; 6 ?; 56 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_28,type,
sK0: $i > $o ).
thf(func_def_29,type,
sK1: $i > $o ).
thf(func_def_30,type,
sK2: $i > $o ).
thf(func_def_32,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f96,plain,
$false,
inference(trivial_inequality_removal,[],[f94]) ).
thf(f94,plain,
$true = $false,
inference(superposition,[],[f71,f93]) ).
thf(f93,plain,
( $false
= ( sK0 @ sK5 ) ),
inference(trivial_inequality_removal,[],[f92]) ).
thf(f92,plain,
( ( $true = $false )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(forward_demodulation,[],[f91,f82]) ).
thf(f82,plain,
( ( sK1 @ sK5 )
= $false ),
inference(duplicate_literal_removal,[],[f81]) ).
thf(f81,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f79]) ).
thf(f79,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f78]) ).
thf(f78,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $true
= ( ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ) ),
inference(not_proxy_clausification,[],[f75]) ).
thf(f75,plain,
( ( ( ~ ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f67,plain,
( ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true )
| ( ( ~ ( sK1 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f66,plain,
( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f54]) ).
thf(f54,plain,
( ( $true
= ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 ) ) )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f53]) ).
thf(f53,plain,
( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
!= ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 ) ) ),
inference(beta_eta_normalization,[],[f52]) ).
thf(f52,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK5 )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f51]) ).
thf(f51,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 )
& ~ ( sK2 @ Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ~ ( ( sK1 @ Y0 )
| ( sK2 @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f50]) ).
thf(f50,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ sK0
@ sK1 )
@ sK2 )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ sK0
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) )
@ sK1
@ sK2 ) ) ),
inference(definition_unfolding,[],[f47,f49,f48,f49,f49]) ).
thf(f48,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f26]) ).
thf(f26,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= union ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
( ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X2 @ X3 )
| ( X0 @ X3 ) ) )
= union ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
thf(f49,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f36,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f35]) ).
thf(f35,plain,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f9,axiom,
( setminus
= ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ~ ( X2 @ X3 )
& ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminus) ).
thf(f47,plain,
( ( setminus @ sK0 @ ( union @ sK1 @ sK2 ) )
!= ( setminus @ ( setminus @ sK0 @ sK1 ) @ sK2 ) ),
inference(cnf_transformation,[],[f46]) ).
thf(f46,plain,
( ( setminus @ sK0 @ ( union @ sK1 @ sK2 ) )
!= ( setminus @ ( setminus @ sK0 @ sK1 ) @ sK2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f44,f45]) ).
thf(f45,plain,
( ? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X1 ) @ X2 )
!= ( setminus @ X0 @ ( union @ X1 @ X2 ) ) )
=> ( ( setminus @ sK0 @ ( union @ sK1 @ sK2 ) )
!= ( setminus @ ( setminus @ sK0 @ sK1 ) @ sK2 ) ) ),
introduced(choice_axiom,[]) ).
thf(f44,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X1 ) @ X2 )
!= ( setminus @ X0 @ ( union @ X1 @ X2 ) ) ),
inference(ennf_transformation,[],[f43]) ).
thf(f43,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X1 ) @ X2 )
= ( setminus @ X0 @ ( union @ X1 @ X2 ) ) ),
inference(rectify,[],[f16]) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X2: $i > $o,X4: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X2 ) @ X4 )
= ( setminus @ X0 @ ( union @ X2 @ X4 ) ) ),
inference(negated_conjecture,[],[f15]) ).
thf(f15,conjecture,
! [X0: $i > $o,X2: $i > $o,X4: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X2 ) @ X4 )
= ( setminus @ X0 @ ( union @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f91,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(trivial_inequality_removal,[],[f90]) ).
thf(f90,plain,
( ( $true = $false )
| ( ( sK1 @ sK5 )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(forward_demodulation,[],[f64,f89]) ).
thf(f89,plain,
( $false
= ( sK2 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f87]) ).
thf(f87,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f86]) ).
thf(f86,plain,
( ( $false
= ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f84]) ).
thf(f84,plain,
( ( $true
= ( ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f83]) ).
thf(f83,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true ) ),
inference(not_proxy_clausification,[],[f65]) ).
thf(f65,plain,
( ( ( ~ ( sK2 @ sK5 ) )
= $true )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f54]) ).
thf(f64,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f63]) ).
thf(f63,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f62]) ).
thf(f62,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $true
= ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f61]) ).
thf(f61,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $false
= ( ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f60]) ).
thf(f60,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f59]) ).
thf(f59,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(not_proxy_clausification,[],[f58]) ).
thf(f58,plain,
( ( ( ~ ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f57]) ).
thf(f57,plain,
( ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(not_proxy_clausification,[],[f56]) ).
thf(f56,plain,
( ( ( ~ ( sK2 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f55]) ).
thf(f55,plain,
( ( $false
= ( ( sK0 @ sK5 )
& ~ ( sK1 @ sK5 )
& ~ ( sK2 @ sK5 ) ) )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f53]) ).
thf(f71,plain,
( $true
= ( sK0 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f70]) ).
thf(f70,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f68,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
& ~ ( ( sK1 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET614^3 : TPTP v8.2.0. Released v3.6.0.
% 0.14/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 13:17:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.36 This is a TH0_THM_EQU_NAR problem
% 0.22/0.36 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/sandbox/benchmark/theBenchmark.p
% 0.22/0.38 % (6125)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 (2999ds/4Mi)
% 0.22/0.38 % (6124)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.22/0.38 % (6127)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.38 % (6128)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 (2999ds/2Mi)
% 0.22/0.38 % (6129)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 (2999ds/275Mi)
% 0.22/0.38 % (6130)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.38 % (6131)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.38 % (6127)Instruction limit reached!
% 0.22/0.38 % (6127)------------------------------
% 0.22/0.38 % (6127)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (6127)Termination reason: Unknown
% 0.22/0.38 % (6127)Termination phase: shuffling
% 0.22/0.38 % (6128)Instruction limit reached!
% 0.22/0.38 % (6128)------------------------------
% 0.22/0.38 % (6128)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (6128)Termination reason: Unknown
% 0.22/0.38 % (6128)Termination phase: shuffling
% 0.22/0.38
% 0.22/0.38 % (6128)Memory used [KB]: 895
% 0.22/0.38 % (6128)Time elapsed: 0.003 s
% 0.22/0.38 % (6128)Instructions burned: 2 (million)
% 0.22/0.38 % (6128)------------------------------
% 0.22/0.38 % (6128)------------------------------
% 0.22/0.38
% 0.22/0.38 % (6127)Memory used [KB]: 895
% 0.22/0.38 % (6127)Time elapsed: 0.003 s
% 0.22/0.38 % (6127)Instructions burned: 2 (million)
% 0.22/0.38 % (6127)------------------------------
% 0.22/0.38 % (6127)------------------------------
% 0.22/0.38 % (6131)Instruction limit reached!
% 0.22/0.38 % (6131)------------------------------
% 0.22/0.38 % (6131)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (6131)Termination reason: Unknown
% 0.22/0.38 % (6131)Termination phase: Property scanning
% 0.22/0.38
% 0.22/0.38 % (6131)Memory used [KB]: 1023
% 0.22/0.38 % (6131)Time elapsed: 0.004 s
% 0.22/0.38 % (6131)Instructions burned: 3 (million)
% 0.22/0.38 % (6131)------------------------------
% 0.22/0.38 % (6131)------------------------------
% 0.22/0.38 % (6125)Instruction limit reached!
% 0.22/0.38 % (6125)------------------------------
% 0.22/0.38 % (6125)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (6125)Termination reason: Unknown
% 0.22/0.38 % (6125)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (6125)Memory used [KB]: 5500
% 0.22/0.38 % (6125)Time elapsed: 0.005 s
% 0.22/0.38 % (6125)Instructions burned: 4 (million)
% 0.22/0.38 % (6125)------------------------------
% 0.22/0.38 % (6125)------------------------------
% 0.22/0.38 % (6129)First to succeed.
% 0.22/0.39 % (6124)Also succeeded, but the first one will report.
% 0.22/0.39 % (6129)Refutation found. Thanks to Tanya!
% 0.22/0.39 % SZS status Theorem for theBenchmark
% 0.22/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.39 % (6129)------------------------------
% 0.22/0.39 % (6129)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (6129)Termination reason: Refutation
% 0.22/0.39
% 0.22/0.39 % (6129)Memory used [KB]: 5500
% 0.22/0.39 % (6129)Time elapsed: 0.007 s
% 0.22/0.39 % (6129)Instructions burned: 4 (million)
% 0.22/0.39 % (6129)------------------------------
% 0.22/0.39 % (6129)------------------------------
% 0.22/0.39 % (6123)Success in time 0.018 s
% 0.22/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------