TSTP Solution File: SEV452^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV452^1 : TPTP v8.2.0. Released v7.0.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 : n014.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 04:13:50 EDT 2024
% Result : Theorem 0.17s 0.37s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 61 ( 12 unt; 8 typ; 0 def)
% Number of atoms : 276 ( 69 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 318 ( 34 ~; 49 |; 6 &; 224 @)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 48 ( 48 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 7 con; 0-4 aty)
% Number of variables : 75 ( 0 ^ 66 !; 4 ?; 75 :)
% ( 5 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/INTER':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_11,type,
sK1: sK0 > $o ).
thf(func_def_13,type,
sK3:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_14,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
sK5: sK0 ).
thf(f187,plain,
$false,
inference(avatar_sat_refutation,[],[f51,f60,f152,f158,f186]) ).
thf(f186,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f185]) ).
thf(f185,plain,
( $false
| ~ spl2_1
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f184]) ).
thf(f184,plain,
( ( $false = $true )
| ~ spl2_1
| ~ spl2_4 ),
inference(forward_demodulation,[],[f178,f59]) ).
thf(f59,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f57]) ).
thf(f57,plain,
( spl2_4
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f178,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f176]) ).
thf(f176,plain,
( ( $false = $true )
| ( ( sK1 @ sK5 )
= $true )
| ~ spl2_1 ),
inference(superposition,[],[f25,f165]) ).
thf(f165,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f163]) ).
thf(f163,plain,
( ( $false = $true )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl2_1 ),
inference(superposition,[],[f46,f96]) ).
thf(f96,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f93]) ).
thf(f93,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) )
| ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $false = $true ) ),
inference(superposition,[],[f24,f22]) ).
thf(f22,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f19,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) ) ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
& ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ X3 )
& ( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
= ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_INTER_') ).
thf(f24,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
| ( ( X1 @ X2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,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/sandbox/benchmark/theBenchmark.p','thm/sets/IN_') ).
thf(f46,plain,
( ( $true
= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 @ sK5 ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f44]) ).
thf(f44,plain,
( spl2_1
<=> ( $true
= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f25,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f158,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f157]) ).
thf(f157,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f153]) ).
thf(f153,plain,
( ( $false = $true )
| ~ spl2_2
| ~ spl2_4 ),
inference(backward_demodulation,[],[f50,f59]) ).
thf(f50,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f48]) ).
thf(f48,plain,
( spl2_2
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f152,plain,
( spl2_4
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f149,f53,f57]) ).
thf(f53,plain,
( spl2_3
<=> ( $false
= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f149,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f141]) ).
thf(f141,plain,
( ( $false = $true )
| ( ( sK1 @ sK5 )
= $false )
| ~ spl2_3 ),
inference(superposition,[],[f136,f24]) ).
thf(f136,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f135]) ).
thf(f135,plain,
( ( $false = $true )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl2_3 ),
inference(duplicate_literal_removal,[],[f130]) ).
thf(f130,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ( $false = $true )
| ~ spl2_3 ),
inference(superposition,[],[f65,f55]) ).
thf(f55,plain,
( ( $false
= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 @ sK5 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f53]) ).
thf(f65,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f61,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false = $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) )
| ( $true
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) ) ),
inference(superposition,[],[f25,f21]) ).
thf(f21,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( $true
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f20,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( $false
= ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) ) ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f60,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f42,f57,f53]) ).
thf(f42,plain,
( ( $false
= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f40]) ).
thf(f40,plain,
( ( sK1 @ sK5 )
!= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 @ sK5 ) ),
inference(negative_extensionality,[],[f15]) ).
thf(f15,plain,
( sK1
!= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( sK1
!= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f13]) ).
thf(f13,plain,
( ? [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ X1 )
!= X1 )
=> ( sK1
!= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
? [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ X1 )
!= X1 ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
~ ! [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ X1 )
= X1 ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X0: $tType,X2: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X2 @ X2 )
= X2 ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
! [X0: $tType,X2: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X2 @ X2 )
= X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/INTER_IDEMPOT_') ).
thf(f51,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f41,f48,f44]) ).
thf(f41,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( 'const/sets/INTER' @ sK0 @ sK1 @ sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV452^1 : TPTP v8.2.0. Released v7.0.0.
% 0.12/0.13 % 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.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 18:58:22 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.13/0.33 This is a TH1_THM_EQU_NAR problem
% 0.13/0.33 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.17/0.35 % (32564)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.17/0.35 % (32558)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.17/0.35 % (32563)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.17/0.35 % (32565)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.17/0.35 % (32565)Instruction limit reached!
% 0.17/0.35 % (32565)------------------------------
% 0.17/0.35 % (32565)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.35 % (32565)Termination reason: Unknown
% 0.17/0.35 % (32565)Termination phase: Saturation
% 0.17/0.35
% 0.17/0.35 % (32565)Memory used [KB]: 5500
% 0.17/0.35 % (32565)Time elapsed: 0.004 s
% 0.17/0.35 % (32565)Instructions burned: 3 (million)
% 0.17/0.35 % (32565)------------------------------
% 0.17/0.35 % (32565)------------------------------
% 0.17/0.35 % (32563)Refutation not found, incomplete strategy
% 0.17/0.35 % (32563)------------------------------
% 0.17/0.35 % (32563)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.35 % (32563)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.35
% 0.17/0.35
% 0.17/0.35 % (32563)Memory used [KB]: 5500
% 0.17/0.35 % (32563)Time elapsed: 0.003 s
% 0.17/0.35 % (32563)Instructions burned: 3 (million)
% 0.17/0.35 % (32563)------------------------------
% 0.17/0.35 % (32563)------------------------------
% 0.17/0.35 % (32559)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.17/0.36 % (32559)Instruction limit reached!
% 0.17/0.36 % (32559)------------------------------
% 0.17/0.36 % (32559)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (32559)Termination reason: Unknown
% 0.17/0.36 % (32559)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (32559)Memory used [KB]: 5500
% 0.17/0.36 % (32559)Time elapsed: 0.005 s
% 0.17/0.36 % (32559)Instructions burned: 4 (million)
% 0.17/0.36 % (32559)------------------------------
% 0.17/0.36 % (32559)------------------------------
% 0.17/0.36 % (32562)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.17/0.36 % Exception at run slice level
% 0.17/0.36 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.17/0.36 % (32564)Instruction limit reached!
% 0.17/0.36 % (32564)------------------------------
% 0.17/0.36 % (32564)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (32564)Termination reason: Unknown
% 0.17/0.36 % (32564)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (32564)Memory used [KB]: 5628
% 0.17/0.36 % (32564)Time elapsed: 0.012 s
% 0.17/0.36 % (32564)Instructions burned: 18 (million)
% 0.17/0.36 % (32564)------------------------------
% 0.17/0.36 % (32564)------------------------------
% 0.17/0.36 % (32560)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.17/0.36 % (32561)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.17/0.36 % (32561)Instruction limit reached!
% 0.17/0.36 % (32561)------------------------------
% 0.17/0.36 % (32561)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.36 % (32561)Termination reason: Unknown
% 0.17/0.36 % (32561)Termination phase: Saturation
% 0.17/0.36
% 0.17/0.36 % (32561)Memory used [KB]: 5500
% 0.17/0.36 % (32561)Time elapsed: 0.003 s
% 0.17/0.36 % (32561)Instructions burned: 3 (million)
% 0.17/0.36 % (32561)------------------------------
% 0.17/0.36 % (32561)------------------------------
% 0.17/0.37 % (32567)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.17/0.37 % (32566)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.17/0.37 % Exception at run slice level
% 0.17/0.37 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.17/0.37 % (32567)Refutation not found, incomplete strategy
% 0.17/0.37 % (32567)------------------------------
% 0.17/0.37 % (32567)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.37 % (32567)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.37
% 0.17/0.37
% 0.17/0.37 % (32567)Memory used [KB]: 5500
% 0.17/0.37 % (32567)Time elapsed: 0.004 s
% 0.17/0.37 % (32567)Instructions burned: 3 (million)
% 0.17/0.37 % (32567)------------------------------
% 0.17/0.37 % (32567)------------------------------
% 0.17/0.37 % (32568)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.17/0.37 % (32560)First to succeed.
% 0.17/0.37 % (32569)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.17/0.37 % Exception at run slice level
% 0.17/0.37 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.17/0.37 % (32568)Instruction limit reached!
% 0.17/0.37 % (32568)------------------------------
% 0.17/0.37 % (32568)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.37 % (32568)Termination reason: Unknown
% 0.17/0.37 % (32568)Termination phase: Saturation
% 0.17/0.37
% 0.17/0.37 % (32568)Memory used [KB]: 5500
% 0.17/0.37 % (32568)Time elapsed: 0.004 s
% 0.17/0.37 % (32568)Instructions burned: 3 (million)
% 0.17/0.37 % (32568)------------------------------
% 0.17/0.37 % (32568)------------------------------
% 0.17/0.37 % (32560)Refutation found. Thanks to Tanya!
% 0.17/0.37 % SZS status Theorem for theBenchmark
% 0.17/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.38 % (32560)------------------------------
% 0.17/0.38 % (32560)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.38 % (32560)Termination reason: Refutation
% 0.17/0.38
% 0.17/0.38 % (32560)Memory used [KB]: 5500
% 0.17/0.38 % (32560)Time elapsed: 0.014 s
% 0.17/0.38 % (32560)Instructions burned: 20 (million)
% 0.17/0.38 % (32560)------------------------------
% 0.17/0.38 % (32560)------------------------------
% 0.17/0.38 % (32557)Success in time 0.034 s
% 0.17/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------