TSTP Solution File: SEV444^1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV444^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n018.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 : Mon Jun 24 16:03:54 EDT 2024
% Result : Theorem 0.12s 0.39s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 82 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 462 ( 116 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 449 ( 90 ~; 114 |; 5 &; 225 @)
% ( 12 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 56 ( 0 ^ 39 !; 17 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
sK1: sK0 > $o ).
thf(func_def_5,type,
sK2: sK0 > $o ).
thf(func_def_6,type,
sK3: sK0 ).
thf(func_def_8,type,
ph5:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
sK6: sK0 ).
thf(f182,plain,
$false,
inference(avatar_sat_refutation,[],[f28,f33,f43,f53,f73,f79,f92,f101,f109,f131,f134,f157,f181]) ).
thf(f181,plain,
( ~ spl4_2
| ~ spl4_4
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f180]) ).
thf(f180,plain,
( $false
| ~ spl4_2
| ~ spl4_4
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f179]) ).
thf(f179,plain,
( ( $true = $false )
| ~ spl4_2
| ~ spl4_4
| ~ spl4_7 ),
inference(forward_demodulation,[],[f175,f52]) ).
thf(f52,plain,
( ( ( sK1 @ sK3 )
= $false )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl4_7
<=> ( ( sK1 @ sK3 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
thf(f175,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ~ spl4_2
| ~ spl4_4 ),
inference(superposition,[],[f13,f156]) ).
thf(f156,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_2
| ~ spl4_4 ),
inference(forward_demodulation,[],[f38,f27]) ).
thf(f27,plain,
( ( sK2 = sK1 )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f25,plain,
( spl4_2
<=> ( sK2 = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f38,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f36,plain,
( spl4_4
<=> ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
thf(f13,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_') ).
thf(f157,plain,
( spl4_10
| ~ spl4_3
| ~ spl4_11 ),
inference(avatar_split_clause,[],[f149,f98,f31,f94]) ).
thf(f94,plain,
( spl4_10
<=> ( ( sK1 @ sK6 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_10])]) ).
thf(f31,plain,
( spl4_3
<=> ! [X4: sK0] :
( ( ( sK1 @ X4 )
= $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
thf(f98,plain,
( spl4_11
<=> ( $false
= ( sK2 @ sK6 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_11])]) ).
thf(f149,plain,
( ( ( sK1 @ sK6 )
= $false )
| ~ spl4_3
| ~ spl4_11 ),
inference(trivial_inequality_removal,[],[f147]) ).
thf(f147,plain,
( ( $true = $false )
| ( ( sK1 @ sK6 )
= $false )
| ~ spl4_3
| ~ spl4_11 ),
inference(superposition,[],[f100,f112]) ).
thf(f112,plain,
( ! [X0: sK0] :
( ( ( sK2 @ X0 )
= $true )
| ( ( sK1 @ X0 )
= $false ) )
| ~ spl4_3 ),
inference(superposition,[],[f32,f13]) ).
thf(f32,plain,
( ! [X4: sK0] :
( ( $true
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) )
| ( ( sK1 @ X4 )
= $false ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f100,plain,
( ( $false
= ( sK2 @ sK6 ) )
| ~ spl4_11 ),
inference(avatar_component_clause,[],[f98]) ).
thf(f134,plain,
( ~ spl4_9
| ~ spl4_10 ),
inference(avatar_contradiction_clause,[],[f133]) ).
thf(f133,plain,
( $false
| ~ spl4_9
| ~ spl4_10 ),
inference(trivial_inequality_removal,[],[f132]) ).
thf(f132,plain,
( ( $true = $false )
| ~ spl4_9
| ~ spl4_10 ),
inference(forward_demodulation,[],[f91,f96]) ).
thf(f96,plain,
( ( ( sK1 @ sK6 )
= $false )
| ~ spl4_10 ),
inference(avatar_component_clause,[],[f94]) ).
thf(f91,plain,
( ( ( sK1 @ sK6 )
= $true )
| ~ spl4_9 ),
inference(avatar_component_clause,[],[f89]) ).
thf(f89,plain,
( spl4_9
<=> ( ( sK1 @ sK6 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_9])]) ).
thf(f131,plain,
( ~ spl4_1
| ~ spl4_10
| spl4_11 ),
inference(avatar_contradiction_clause,[],[f130]) ).
thf(f130,plain,
( $false
| ~ spl4_1
| ~ spl4_10
| spl4_11 ),
inference(subsumption_resolution,[],[f124,f99]) ).
thf(f99,plain,
( ( $false
!= ( sK2 @ sK6 ) )
| spl4_11 ),
inference(avatar_component_clause,[],[f98]) ).
thf(f124,plain,
( ( $false
= ( sK2 @ sK6 ) )
| ~ spl4_1
| ~ spl4_10 ),
inference(trivial_inequality_removal,[],[f123]) ).
thf(f123,plain,
( ( $false
= ( sK2 @ sK6 ) )
| ( $true = $false )
| ~ spl4_1
| ~ spl4_10 ),
inference(superposition,[],[f96,f102]) ).
thf(f102,plain,
( ! [X0: sK0] :
( ( $true
= ( sK1 @ X0 ) )
| ( ( sK2 @ X0 )
= $false ) )
| ~ spl4_1 ),
inference(superposition,[],[f23,f13]) ).
thf(f23,plain,
( ! [X4: sK0] :
( ( $false
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) )
| ( $true
= ( sK1 @ X4 ) ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f22,plain,
( spl4_1
<=> ! [X4: sK0] :
( ( $true
= ( sK1 @ X4 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f109,plain,
( ~ spl4_8
| ~ spl4_11 ),
inference(avatar_contradiction_clause,[],[f108]) ).
thf(f108,plain,
( $false
| ~ spl4_8
| ~ spl4_11 ),
inference(trivial_inequality_removal,[],[f105]) ).
thf(f105,plain,
( ( $true = $false )
| ~ spl4_8
| ~ spl4_11 ),
inference(superposition,[],[f87,f100]) ).
thf(f87,plain,
( ( $true
= ( sK2 @ sK6 ) )
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f85,plain,
( spl4_8
<=> ( $true
= ( sK2 @ sK6 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_8])]) ).
thf(f101,plain,
( spl4_10
| spl4_11
| spl4_2 ),
inference(avatar_split_clause,[],[f83,f25,f98,f94]) ).
thf(f83,plain,
( ( $false
= ( sK2 @ sK6 ) )
| ( ( sK1 @ sK6 )
= $false )
| spl4_2 ),
inference(binary_proxy_clausification,[],[f81]) ).
thf(f81,plain,
( ( ( sK1 @ sK6 )
!= ( sK2 @ sK6 ) )
| spl4_2 ),
inference(negative_extensionality,[],[f26]) ).
thf(f26,plain,
( ( sK2 != sK1 )
| spl4_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f92,plain,
( spl4_8
| spl4_9
| spl4_2 ),
inference(avatar_split_clause,[],[f82,f25,f89,f85]) ).
thf(f82,plain,
( ( $true
= ( sK2 @ sK6 ) )
| ( ( sK1 @ sK6 )
= $true )
| spl4_2 ),
inference(binary_proxy_clausification,[],[f81]) ).
thf(f79,plain,
( ~ spl4_5
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f78]) ).
thf(f78,plain,
( $false
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f74,plain,
( ( $true = $false )
| ~ spl4_5
| ~ spl4_7 ),
inference(superposition,[],[f52,f42]) ).
thf(f42,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f40,plain,
( spl4_5
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
thf(f73,plain,
( spl4_7
| ~ spl4_2
| ~ spl4_6 ),
inference(avatar_split_clause,[],[f71,f46,f25,f50]) ).
thf(f46,plain,
( spl4_6
<=> ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
thf(f71,plain,
( ( ( sK1 @ sK3 )
= $false )
| ~ spl4_2
| ~ spl4_6 ),
inference(superposition,[],[f13,f60]) ).
thf(f60,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= $false )
| ~ spl4_2
| ~ spl4_6 ),
inference(superposition,[],[f48,f27]) ).
thf(f48,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f53,plain,
( spl4_6
| spl4_7
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f44,f25,f50,f46]) ).
thf(f44,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ( ( sK1 @ sK3 )
= $false )
| ( sK2 != sK1 ) ),
inference(forward_demodulation,[],[f17,f13]) ).
thf(f17,plain,
( ( sK2 != sK1 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ( sK2 != sK1 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( ( sK2 != sK1 )
| ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) )
& ( ( sK2 = sK1 )
| ! [X4: sK0] :
( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f11,f10]) ).
thf(f10,plain,
( ? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( X1 != X2 )
| ? [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
!= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) )
& ( ( X1 = X2 )
| ! [X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
= ( 'const/sets/IN' @ X0 @ X4 @ X1 ) ) ) )
=> ( ( ( sK2 != sK1 )
| ? [X3: sK0] :
( ( 'const/sets/IN' @ sK0 @ X3 @ sK1 )
!= ( 'const/sets/IN' @ sK0 @ X3 @ sK2 ) ) )
& ( ( sK2 = sK1 )
| ! [X4: sK0] :
( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X3: sK0] :
( ( 'const/sets/IN' @ sK0 @ X3 @ sK1 )
!= ( 'const/sets/IN' @ sK0 @ X3 @ sK2 ) )
=> ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( X1 != X2 )
| ? [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
!= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) )
& ( ( X1 = X2 )
| ! [X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
= ( 'const/sets/IN' @ X0 @ X4 @ X1 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( X1 != X2 )
| ? [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
!= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) )
& ( ( X1 = X2 )
| ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
inference(nnf_transformation,[],[f7]) ).
thf(f7,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
<~> ( X1 = X2 ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( X1 = X2 )
<=> ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( X1 = X2 )
= ( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ! [X0: $tType,X2: X0 > $o,X3: X0 > $o] :
( ( X2 = X3 )
= ( ! [X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
= ( 'const/sets/IN' @ X0 @ X4 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o] :
( ( X2 = X3 )
= ( ! [X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
= ( 'const/sets/IN' @ X0 @ X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/EXTENSION_') ).
thf(f43,plain,
( spl4_4
| ~ spl4_2
| spl4_5 ),
inference(avatar_split_clause,[],[f34,f40,f25,f36]) ).
thf(f34,plain,
( ( sK2 != sK1 )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(forward_demodulation,[],[f16,f13]) ).
thf(f16,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ( sK2 != sK1 )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f33,plain,
( spl4_3
| spl4_2 ),
inference(avatar_split_clause,[],[f29,f25,f31]) ).
thf(f29,plain,
! [X4: sK0] :
( ( sK2 = sK1 )
| ( ( sK1 @ X4 )
= $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ),
inference(forward_demodulation,[],[f19,f13]) ).
thf(f19,plain,
! [X4: sK0] :
( ( sK2 = sK1 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X4 @ sK1 ) )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
! [X4: sK0] :
( ( sK2 = sK1 )
| ( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f28,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f20,f25,f22]) ).
thf(f20,plain,
! [X4: sK0] :
( ( $true
= ( sK1 @ X4 ) )
| ( sK2 = sK1 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ),
inference(forward_demodulation,[],[f18,f13]) ).
thf(f18,plain,
! [X4: sK0] :
( ( $true
= ( 'const/sets/IN' @ sK0 @ X4 @ sK1 ) )
| ( sK2 = sK1 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEV444^1 : TPTP v8.2.0. Released v7.0.0.
% 0.12/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 19:02:24 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 This is a TH1_THM_EQU_NAR problem
% 0.12/0.36 Running higher-order theorem proving
% 0.12/0.36 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.12/0.38 % (1234)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.12/0.38 % (1233)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.12/0.38 % (1235)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.38 % (1232)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.12/0.38 % (1237)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.12/0.38 % (1238)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.38 % (1236)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.12/0.38 % Exception at run slice level
% 0.12/0.38 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.12/0.38 % (1235)Instruction limit reached!
% 0.12/0.38 % (1235)------------------------------
% 0.12/0.38 % (1235)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38 % (1235)Termination reason: Unknown
% 0.12/0.38 % (1235)Termination phase: Saturation
% 0.12/0.38
% 0.12/0.38 % (1235)Memory used [KB]: 5500
% 0.12/0.38 % (1235)Time elapsed: 0.004 s
% 0.12/0.38 % (1235)Instructions burned: 2 (million)
% 0.12/0.38 % (1235)------------------------------
% 0.12/0.38 % (1235)------------------------------
% 0.12/0.38 % (1233)Instruction limit reached!
% 0.12/0.38 % (1233)------------------------------
% 0.12/0.38 % (1233)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38 % (1233)Termination reason: Unknown
% 0.12/0.38 % (1233)Termination phase: Saturation
% 0.12/0.38
% 0.12/0.38 % (1233)Memory used [KB]: 5500
% 0.12/0.38 % (1233)Time elapsed: 0.006 s
% 0.12/0.38 % (1233)Instructions burned: 4 (million)
% 0.12/0.38 % (1233)------------------------------
% 0.12/0.38 % (1233)------------------------------
% 0.12/0.39 % (1237)First to succeed.
% 0.12/0.39 % (1234)Also succeeded, but the first one will report.
% 0.12/0.39 % (1237)Refutation found. Thanks to Tanya!
% 0.12/0.39 % SZS status Theorem for theBenchmark
% 0.12/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.39 % (1237)------------------------------
% 0.12/0.39 % (1237)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.39 % (1237)Termination reason: Refutation
% 0.12/0.39
% 0.12/0.39 % (1237)Memory used [KB]: 5628
% 0.12/0.39 % (1237)Time elapsed: 0.013 s
% 0.12/0.39 % (1237)Instructions burned: 10 (million)
% 0.12/0.39 % (1237)------------------------------
% 0.12/0.39 % (1237)------------------------------
% 0.12/0.39 % (1229)Success in time 0.027 s
%------------------------------------------------------------------------------