TSTP Solution File: SEV459^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV459^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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:51 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 50 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 315 ( 76 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 479 ( 45 ~; 36 |; 15 &; 372 @)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 48 ( 48 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 87 ( 0 ^ 73 !; 9 ?; 87 :)
% ( 5 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK1: $tType ).
thf(func_def_0,type,
'const/sets/SUBSET':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/DELETE':
!>[X0: $tType] : ( ( X0 > $o ) > X0 > X0 > $o ) ).
thf(func_def_6,type,
sK0:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK2: sK1 ).
thf(func_def_8,type,
sK3: sK1 > $o ).
thf(func_def_10,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f104,plain,
$false,
inference(avatar_sat_refutation,[],[f36,f47,f57,f102]) ).
thf(f102,plain,
( spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f101]) ).
thf(f101,plain,
( $false
| spl4_2
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f95,f46]) ).
thf(f46,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| spl4_2 ),
inference(avatar_component_clause,[],[f44]) ).
thf(f44,plain,
( spl4_2
<=> ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f95,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ sK3 )
= $true )
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f89,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ sK3 )
= $true )
| ( $true != $true )
| ~ spl4_4 ),
inference(superposition,[],[f23,f56]) ).
thf(f56,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) )
= $true )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl4_4
<=> ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
thf(f23,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
!= $true )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
| ( X2 = X3 )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
!= $true ) )
& ( ( ( X2 != X3 )
& ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true ) )
| ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
!= $true ) ) ),
inference(flattening,[],[f15]) ).
thf(f15,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
| ( X2 = X3 )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
!= $true ) )
& ( ( ( X2 != X3 )
& ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true ) )
| ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
!= $true ) ) ),
inference(nnf_transformation,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
<=> ( ( X2 != X3 )
& ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( X2 != X3 ) )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X2: X0 > $o,X3: X0,X4: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X4 ) )
= ( X3 != X4 ) )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_DELETE_') ).
thf(f57,plain,
( spl4_4
| spl4_1 ),
inference(avatar_split_clause,[],[f40,f33,f54]) ).
thf(f33,plain,
( spl4_1
<=> ( ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f40,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) )
= $true )
| spl4_1 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) )
= $true )
| ( $true != $true )
| spl4_1 ),
inference(superposition,[],[f35,f27]) ).
thf(f27,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X2 @ X1 ) @ X1 ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f20,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ( ( ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X2 @ X1 ) @ X2 )
!= $true )
& ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X2 @ X1 ) @ X1 ) ) ) )
& ( ! [X4: X0] :
( ( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X4 @ X1 )
!= $true ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f18,f19]) ).
thf(f19,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ? [X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
!= $true )
& ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true ) )
=> ( ( ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X2 @ X1 ) @ X2 )
!= $true )
& ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X2 @ X1 ) @ X1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f18,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ? [X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
!= $true )
& ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true ) ) )
& ( ! [X4: X0] :
( ( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X4 @ X1 )
!= $true ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true ) ) ),
inference(rectify,[],[f17]) ).
thf(f17,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ? [X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
!= $true )
& ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true ) ) )
& ( ! [X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
!= $true ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true ) ) ),
inference(nnf_transformation,[],[f14]) ).
thf(f14,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
<=> ! [X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ! [X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true )
=> ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true ) )
<=> ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,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/SUBSET' @ X0 @ X1 @ X2 ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X4: X0] :
( ( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
=> ( 'const/sets/IN' @ X0 @ X4 @ X3 ) )
= ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/SUBSET_') ).
thf(f35,plain,
( ( ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) @ sK3 )
!= $true )
| spl4_1 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f47,plain,
( ~ spl4_2
| spl4_1 ),
inference(avatar_split_clause,[],[f42,f33,f44]) ).
thf(f42,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| spl4_1 ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ sK3 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| ( $true != $true )
| spl4_1 ),
inference(superposition,[],[f35,f28]) ).
thf(f28,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X2 @ X1 ) @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f36,plain,
~ spl4_1,
inference(avatar_split_clause,[],[f30,f33]) ).
thf(f30,plain,
( ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) @ sK3 )
!= $true ),
inference(cnf_transformation,[],[f22]) ).
thf(f22,plain,
( ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) @ sK3 )
!= $true ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f13,f21]) ).
thf(f21,plain,
( ? [X0: $tType,X1: X0,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 )
!= $true )
=> ( ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DELETE' @ sK1 @ sK3 @ sK2 ) @ sK3 )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
? [X0: $tType,X1: X0,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 )
!= $true ),
inference(ennf_transformation,[],[f12]) ).
thf(f12,plain,
~ ! [X0: $tType,X1: X0,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
~ ! [X0: $tType,X1: X0,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X1 ) @ X2 ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X0: $tType,X2: X0,X3: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X3 @ X2 ) @ X3 ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
! [X0: $tType,X2: X0,X3: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X3 @ X2 ) @ X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/DELETE_SUBSET_') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV459^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/0.14 % 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.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 18:48:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH1_THM_EQU_NAR problem
% 0.13/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.13/0.37 % (21803)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (21800)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.13/0.37 % (21804)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.13/0.37 % (21801)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.13/0.37 % (21802)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.13/0.37 % (21806)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (21807)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.13/0.37 % (21805)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.13/0.37 % (21803)Instruction limit reached!
% 0.13/0.37 % (21803)------------------------------
% 0.13/0.37 % (21803)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21803)Termination reason: Unknown
% 0.13/0.37 % (21803)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (21803)Memory used [KB]: 895
% 0.13/0.37 % (21803)Time elapsed: 0.003 s
% 0.13/0.37 % (21803)Instructions burned: 2 (million)
% 0.13/0.37 % (21803)------------------------------
% 0.13/0.37 % (21803)------------------------------
% 0.13/0.37 % (21804)Instruction limit reached!
% 0.13/0.37 % (21804)------------------------------
% 0.13/0.37 % (21804)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21804)Termination reason: Unknown
% 0.13/0.37 % (21804)Termination phase: shuffling
% 0.13/0.37
% 0.13/0.37 % (21804)Memory used [KB]: 895
% 0.13/0.37 % (21804)Time elapsed: 0.003 s
% 0.13/0.37 % (21804)Instructions burned: 2 (million)
% 0.13/0.37 % (21804)------------------------------
% 0.13/0.37 % (21804)------------------------------
% 0.13/0.37 % (21807)Instruction limit reached!
% 0.13/0.37 % (21807)------------------------------
% 0.13/0.37 % (21807)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21807)Termination reason: Unknown
% 0.13/0.37 % (21807)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (21807)Memory used [KB]: 5500
% 0.13/0.37 % (21807)Time elapsed: 0.004 s
% 0.13/0.37 % (21807)Instructions burned: 3 (million)
% 0.13/0.37 % (21807)------------------------------
% 0.13/0.37 % (21807)------------------------------
% 0.13/0.37 % (21801)Instruction limit reached!
% 0.13/0.37 % (21801)------------------------------
% 0.13/0.37 % (21801)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21801)Termination reason: Unknown
% 0.13/0.37 % (21801)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (21801)Memory used [KB]: 5500
% 0.13/0.37 % (21801)Time elapsed: 0.005 s
% 0.13/0.37 % (21801)Instructions burned: 4 (million)
% 0.13/0.37 % (21801)------------------------------
% 0.13/0.37 % (21801)------------------------------
% 0.13/0.37 % (21805)Refutation not found, incomplete strategy
% 0.13/0.37 % (21805)------------------------------
% 0.13/0.37 % (21805)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21805)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (21805)Memory used [KB]: 5500
% 0.13/0.37 % (21805)Time elapsed: 0.004 s
% 0.13/0.37 % (21805)Instructions burned: 3 (million)
% 0.13/0.37 % (21805)------------------------------
% 0.13/0.37 % (21805)------------------------------
% 0.21/0.38 % (21806)Instruction limit reached!
% 0.21/0.38 % (21806)------------------------------
% 0.21/0.38 % (21806)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (21806)Termination reason: Unknown
% 0.21/0.38 % (21806)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (21806)Memory used [KB]: 5628
% 0.21/0.38 % (21806)Time elapsed: 0.013 s
% 0.21/0.38 % (21806)Instructions burned: 18 (million)
% 0.21/0.38 % (21806)------------------------------
% 0.21/0.38 % (21806)------------------------------
% 0.21/0.39 % (21808)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.21/0.39 % (21809)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.21/0.39 % (21810)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.21/0.39 % (21812)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.39 % Exception at run slice level
% 0.21/0.39 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.21/0.39 % (21802)Instruction limit reached!
% 0.21/0.39 % (21802)------------------------------
% 0.21/0.39 % (21802)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (21802)Termination reason: Unknown
% 0.21/0.39 % (21802)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (21802)Memory used [KB]: 5628
% 0.21/0.39 % (21802)Time elapsed: 0.021 s
% 0.21/0.39 % (21802)Instructions burned: 28 (million)
% 0.21/0.39 % (21802)------------------------------
% 0.21/0.39 % (21802)------------------------------
% 0.21/0.39 % (21810)Instruction limit reached!
% 0.21/0.39 % (21810)------------------------------
% 0.21/0.39 % (21810)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (21810)Termination reason: Unknown
% 0.21/0.39 % (21810)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (21810)Memory used [KB]: 5500
% 0.21/0.39 % (21810)Time elapsed: 0.025 s
% 0.21/0.39 % (21810)Instructions burned: 3 (million)
% 0.21/0.39 % (21810)------------------------------
% 0.21/0.39 % (21810)------------------------------
% 0.21/0.40 % (21812)Instruction limit reached!
% 0.21/0.40 % (21812)------------------------------
% 0.21/0.40 % (21812)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (21812)Termination reason: Unknown
% 0.21/0.40 % (21812)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (21812)Memory used [KB]: 1023
% 0.21/0.40 % (21812)Time elapsed: 0.006 s
% 0.21/0.40 % (21812)Instructions burned: 8 (million)
% 0.21/0.40 % (21812)------------------------------
% 0.21/0.40 % (21812)------------------------------
% 0.21/0.40 % (21811)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.21/0.40 % Exception at run slice level
% 0.21/0.40 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.21/0.40 % (21809)First to succeed.
% 0.21/0.40 % (21809)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.40 % (21809)------------------------------
% 0.21/0.40 % (21809)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (21809)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (21809)Memory used [KB]: 5628
% 0.21/0.40 % (21809)Time elapsed: 0.011 s
% 0.21/0.40 % (21809)Instructions burned: 10 (million)
% 0.21/0.40 % (21809)------------------------------
% 0.21/0.40 % (21809)------------------------------
% 0.21/0.40 % (21799)Success in time 0.047 s
% 0.21/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------