TSTP Solution File: SET611^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET611^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 : n004.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:24 EDT 2024
% Result : Theorem 0.14s 0.32s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 29
% Syntax : Number of formulae : 96 ( 12 unt; 18 typ; 0 def)
% Number of atoms : 455 ( 102 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 389 ( 82 ~; 86 |; 37 &; 173 @)
% ( 9 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 91 ( 91 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 26 usr; 10 con; 0-3 aty)
% Number of variables : 84 ( 62 ^ 14 !; 6 ?; 84 :)
% ( 2 !>; 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_15,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_29,type,
sK0: $i > $o ).
thf(func_def_30,type,
sK1: $i > $o ).
thf(func_def_32,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f149,plain,
$false,
inference(avatar_sat_refutation,[],[f77,f78,f102,f123,f132,f141,f144,f148]) ).
thf(f148,plain,
( ~ spl2_3
| ~ spl2_6 ),
inference(avatar_contradiction_clause,[],[f147]) ).
thf(f147,plain,
( $false
| ~ spl2_3
| ~ spl2_6 ),
inference(trivial_inequality_removal,[],[f146]) ).
thf(f146,plain,
( ( $true = $false )
| ~ spl2_3
| ~ spl2_6 ),
inference(backward_demodulation,[],[f117,f131]) ).
thf(f131,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f129]) ).
thf(f129,plain,
( spl2_6
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).
thf(f117,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f115]) ).
thf(f115,plain,
( spl2_3
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f144,plain,
( ~ spl2_4
| ~ spl2_5 ),
inference(avatar_contradiction_clause,[],[f143]) ).
thf(f143,plain,
( $false
| ~ spl2_4
| ~ spl2_5 ),
inference(trivial_inequality_removal,[],[f142]) ).
thf(f142,plain,
( ( $true = $false )
| ~ spl2_4
| ~ spl2_5 ),
inference(backward_demodulation,[],[f127,f121]) ).
thf(f121,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f119]) ).
thf(f119,plain,
( spl2_4
<=> ( ( sK0 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f127,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f125]) ).
thf(f125,plain,
( spl2_5
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).
thf(f141,plain,
( spl2_4
| ~ spl2_1
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f138,f115,f70,f119]) ).
thf(f70,plain,
( spl2_1
<=> ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: $i] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f138,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f136]) ).
thf(f136,plain,
( ( $true = $false )
| ( ( sK0 @ sK5 )
= $false )
| ~ spl2_1
| ~ spl2_3 ),
inference(superposition,[],[f135,f117]) ).
thf(f135,plain,
( ! [X1: $i] :
( ( ( sK1 @ X1 )
= $false )
| ( ( sK0 @ X1 )
= $false ) )
| ~ spl2_1 ),
inference(binary_proxy_clausification,[],[f134]) ).
thf(f134,plain,
( ! [X1: $i] :
( ( ( sK1 @ X1 )
& ( sK0 @ X1 ) )
= $false )
| ~ spl2_1 ),
inference(beta_eta_normalization,[],[f133]) ).
thf(f133,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ X1 )
= ( ^ [Y0: $i] : $false
@ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f71]) ).
thf(f71,plain,
( ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: $i] : $false ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f70]) ).
thf(f132,plain,
( spl2_5
| spl2_6
| spl2_2 ),
inference(avatar_split_clause,[],[f109,f74,f129,f125]) ).
thf(f74,plain,
( spl2_2
<=> ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
= sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f109,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $true )
| spl2_2 ),
inference(not_proxy_clausification,[],[f108]) ).
thf(f108,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( ~ ( sK0 @ sK5 ) )
= $false )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f107]) ).
thf(f107,plain,
( ( ( ~ ( sK0 @ sK5 ) )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f106]) ).
thf(f106,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) )
= $false )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f104]) ).
thf(f104,plain,
( ( ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) )
!= ( sK1 @ sK5 ) )
| spl2_2 ),
inference(beta_eta_normalization,[],[f103]) ).
thf(f103,plain,
( ( ( sK1 @ sK5 )
!= ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
@ sK5 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f76]) ).
thf(f76,plain,
( ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
!= sK1 )
| spl2_2 ),
inference(avatar_component_clause,[],[f74]) ).
thf(f123,plain,
( spl2_3
| spl2_2 ),
inference(avatar_split_clause,[],[f112,f74,f115]) ).
thf(f112,plain,
( ( ( sK1 @ sK5 )
= $true )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f111]) ).
thf(f111,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f105]) ).
thf(f105,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( ( sK1 @ sK5 )
& ~ ( sK0 @ sK5 ) )
= $true )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f104]) ).
thf(f102,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f101]) ).
thf(f101,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f100]) ).
thf(f100,plain,
( ( $true = $false )
| spl2_1
| ~ spl2_2 ),
inference(backward_demodulation,[],[f91,f98]) ).
thf(f98,plain,
( ( $false
= ( sK0 @ sK4 ) )
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f96]) ).
thf(f96,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $true = $false )
| spl2_1
| ~ spl2_2 ),
inference(superposition,[],[f92,f85]) ).
thf(f85,plain,
( ! [X1: $i] :
( ( ( sK1 @ X1 )
= $false )
| ( ( sK0 @ X1 )
= $false ) )
| ~ spl2_2 ),
inference(not_proxy_clausification,[],[f83]) ).
thf(f83,plain,
( ! [X1: $i] :
( ( ( sK1 @ X1 )
= $false )
| ( $true
= ( ~ ( sK0 @ X1 ) ) ) )
| ~ spl2_2 ),
inference(binary_proxy_clausification,[],[f82]) ).
thf(f82,plain,
( ! [X1: $i] :
( ( ( sK1 @ X1 )
= $false )
| ( $true
= ( ( sK1 @ X1 )
& ~ ( sK0 @ X1 ) ) ) )
| ~ spl2_2 ),
inference(binary_proxy_clausification,[],[f80]) ).
thf(f80,plain,
( ! [X1: $i] :
( ( sK1 @ X1 )
= ( ( sK1 @ X1 )
& ~ ( sK0 @ X1 ) ) )
| ~ spl2_2 ),
inference(beta_eta_normalization,[],[f79]) ).
thf(f79,plain,
( ! [X1: $i] :
( ( sK1 @ X1 )
= ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
@ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f75]) ).
thf(f75,plain,
( ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
= sK1 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f74]) ).
thf(f92,plain,
( ( ( sK1 @ sK4 )
= $true )
| spl2_1 ),
inference(binary_proxy_clausification,[],[f90]) ).
thf(f90,plain,
( ( $false
!= ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) ) )
| spl2_1 ),
inference(beta_eta_normalization,[],[f89]) ).
thf(f89,plain,
( ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK4 )
!= ( ^ [Y0: $i] : $false
@ sK4 ) )
| spl2_1 ),
inference(negative_extensionality,[],[f72]) ).
thf(f72,plain,
( ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: $i] : $false ) )
| spl2_1 ),
inference(avatar_component_clause,[],[f70]) ).
thf(f91,plain,
( ( $true
= ( sK0 @ sK4 ) )
| spl2_1 ),
inference(binary_proxy_clausification,[],[f90]) ).
thf(f78,plain,
( spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f67,f70,f74]) ).
thf(f67,plain,
( ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
= sK1 )
| ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= ( ^ [Y0: $i] : $false ) ) ),
inference(beta_eta_normalization,[],[f66]) ).
thf(f66,plain,
( ( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK1
@ sK0 )
= ( ^ [Y0: $i] : $false ) )
| ( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ sK1
@ sK0 )
= sK1 ) ),
inference(definition_unfolding,[],[f60,f57,f54,f62]) ).
thf(f62,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,axiom,
( intersection
= ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X2 @ X3 )
& ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
thf(f54,plain,
( emptyset
= ( ^ [Y0: $i] : $false ) ),
inference(cnf_transformation,[],[f33]) ).
thf(f33,plain,
( emptyset
= ( ^ [Y0: $i] : $false ) ),
inference(fool_elimination,[],[f3]) ).
thf(f3,axiom,
( ( ^ [X0: $i] : $false )
= emptyset ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyset) ).
thf(f57,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f26]) ).
thf(f26,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(f60,plain,
( ( ( setminus @ sK1 @ sK0 )
= sK1 )
| ( emptyset
= ( intersection @ sK1 @ sK0 ) ) ),
inference(cnf_transformation,[],[f47]) ).
thf(f47,plain,
( ( ( ( setminus @ sK1 @ sK0 )
!= sK1 )
| ( emptyset
!= ( intersection @ sK1 @ sK0 ) ) )
& ( ( ( setminus @ sK1 @ sK0 )
= sK1 )
| ( emptyset
= ( intersection @ sK1 @ sK0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f45,f46]) ).
thf(f46,plain,
( ? [X0: $i > $o,X1: $i > $o] :
( ( ( ( setminus @ X1 @ X0 )
!= X1 )
| ( emptyset
!= ( intersection @ X1 @ X0 ) ) )
& ( ( ( setminus @ X1 @ X0 )
= X1 )
| ( emptyset
= ( intersection @ X1 @ X0 ) ) ) )
=> ( ( ( ( setminus @ sK1 @ sK0 )
!= sK1 )
| ( emptyset
!= ( intersection @ sK1 @ sK0 ) ) )
& ( ( ( setminus @ sK1 @ sK0 )
= sK1 )
| ( emptyset
= ( intersection @ sK1 @ sK0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f45,plain,
? [X0: $i > $o,X1: $i > $o] :
( ( ( ( setminus @ X1 @ X0 )
!= X1 )
| ( emptyset
!= ( intersection @ X1 @ X0 ) ) )
& ( ( ( setminus @ X1 @ X0 )
= X1 )
| ( emptyset
= ( intersection @ X1 @ X0 ) ) ) ),
inference(nnf_transformation,[],[f44]) ).
thf(f44,plain,
? [X0: $i > $o,X1: $i > $o] :
( ( emptyset
= ( intersection @ X1 @ X0 ) )
<~> ( ( setminus @ X1 @ X0 )
= X1 ) ),
inference(ennf_transformation,[],[f43]) ).
thf(f43,plain,
~ ! [X0: $i > $o,X1: $i > $o] :
( ( emptyset
= ( intersection @ X1 @ X0 ) )
<=> ( ( setminus @ X1 @ X0 )
= X1 ) ),
inference(rectify,[],[f16]) ).
thf(f16,negated_conjecture,
~ ! [X5: $i > $o,X4: $i > $o] :
( ( emptyset
= ( intersection @ X4 @ X5 ) )
<=> ( ( setminus @ X4 @ X5 )
= X4 ) ),
inference(negated_conjecture,[],[f15]) ).
thf(f15,conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( emptyset
= ( intersection @ X4 @ X5 ) )
<=> ( ( setminus @ X4 @ X5 )
= X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f77,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f68,f74,f70]) ).
thf(f68,plain,
( ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: $i] : $false ) )
| ( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) ) )
!= sK1 ) ),
inference(beta_eta_normalization,[],[f65]) ).
thf(f65,plain,
( ( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ~ ( Y1 @ Y2 ) )
@ sK1
@ sK0 )
!= sK1 )
| ( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK1
@ sK0 )
!= ( ^ [Y0: $i] : $false ) ) ),
inference(definition_unfolding,[],[f61,f57,f54,f62]) ).
thf(f61,plain,
( ( ( setminus @ sK1 @ sK0 )
!= sK1 )
| ( emptyset
!= ( intersection @ sK1 @ sK0 ) ) ),
inference(cnf_transformation,[],[f47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SET611^3 : TPTP v8.2.0. Released v3.6.0.
% 0.04/0.10 % 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.09/0.29 % Computer : n004.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 11:17:07 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.09/0.29 This is a TH0_THM_EQU_NAR problem
% 0.09/0.30 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.14/0.31 % (23344)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.14/0.31 % (23343)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.14/0.31 % (23346)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.31 % (23347)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.14/0.31 % (23345)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 (2999ds/27Mi)
% 0.14/0.31 % (23348)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.14/0.31 % (23349)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.31 % (23350)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.14/0.31 % (23346)Instruction limit reached!
% 0.14/0.31 % (23346)------------------------------
% 0.14/0.31 % (23346)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.31 % (23346)Termination reason: Unknown
% 0.14/0.31 % (23347)Instruction limit reached!
% 0.14/0.31 % (23347)------------------------------
% 0.14/0.31 % (23347)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.31 % (23346)Termination phase: Function definition elimination
% 0.14/0.31
% 0.14/0.31 % (23346)Memory used [KB]: 1023
% 0.14/0.31 % (23346)Time elapsed: 0.003 s
% 0.14/0.31 % (23346)Instructions burned: 3 (million)
% 0.14/0.31 % (23346)------------------------------
% 0.14/0.31 % (23346)------------------------------
% 0.14/0.31 % (23347)Termination reason: Unknown
% 0.14/0.31 % (23347)Termination phase: Property scanning
% 0.14/0.31
% 0.14/0.31 % (23347)Memory used [KB]: 1023
% 0.14/0.31 % (23347)Time elapsed: 0.003 s
% 0.14/0.31 % (23347)Instructions burned: 3 (million)
% 0.14/0.31 % (23347)------------------------------
% 0.14/0.31 % (23347)------------------------------
% 0.14/0.31 % (23350)Instruction limit reached!
% 0.14/0.31 % (23350)------------------------------
% 0.14/0.31 % (23350)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.31 % (23350)Termination reason: Unknown
% 0.14/0.31 % (23350)Termination phase: Property scanning
% 0.14/0.31
% 0.14/0.31 % (23350)Memory used [KB]: 1023
% 0.14/0.31 % (23350)Time elapsed: 0.003 s
% 0.14/0.31 % (23350)Instructions burned: 3 (million)
% 0.14/0.31 % (23350)------------------------------
% 0.14/0.31 % (23350)------------------------------
% 0.14/0.31 % (23344)Instruction limit reached!
% 0.14/0.31 % (23344)------------------------------
% 0.14/0.31 % (23344)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.31 % (23344)Termination reason: Unknown
% 0.14/0.31 % (23344)Termination phase: Saturation
% 0.14/0.31
% 0.14/0.31 % (23344)Memory used [KB]: 5500
% 0.14/0.31 % (23344)Time elapsed: 0.004 s
% 0.14/0.31 % (23344)Instructions burned: 4 (million)
% 0.14/0.31 % (23344)------------------------------
% 0.14/0.31 % (23344)------------------------------
% 0.14/0.32 % (23348)Refutation not found, incomplete strategy
% 0.14/0.32 % (23348)------------------------------
% 0.14/0.32 % (23348)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (23348)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.32
% 0.14/0.32
% 0.14/0.32 % (23348)Memory used [KB]: 5500
% 0.14/0.32 % (23348)Time elapsed: 0.004 s
% 0.14/0.32 % (23348)Instructions burned: 4 (million)
% 0.14/0.32 % (23348)------------------------------
% 0.14/0.32 % (23348)------------------------------
% 0.14/0.32 % (23345)First to succeed.
% 0.14/0.32 % (23349)Also succeeded, but the first one will report.
% 0.14/0.32 % (23345)Refutation found. Thanks to Tanya!
% 0.14/0.32 % SZS status Theorem for theBenchmark
% 0.14/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.32 % (23345)------------------------------
% 0.14/0.32 % (23345)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (23345)Termination reason: Refutation
% 0.14/0.32
% 0.14/0.32 % (23345)Memory used [KB]: 5500
% 0.14/0.32 % (23345)Time elapsed: 0.007 s
% 0.14/0.32 % (23345)Instructions burned: 7 (million)
% 0.14/0.32 % (23345)------------------------------
% 0.14/0.32 % (23345)------------------------------
% 0.14/0.32 % (23342)Success in time 0.007 s
% 0.14/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------