TSTP Solution File: SET171^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET171^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/sandbox2/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 03:09:25 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 27
% Syntax : Number of formulae : 84 ( 21 unt; 18 typ; 0 def)
% Number of atoms : 550 ( 98 equ; 0 cnn)
% Maximal formula atoms : 4 ( 8 avg)
% Number of connectives : 420 ( 31 ~; 105 |; 24 &; 254 @)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 95 ( 95 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 24 usr; 8 con; 0-3 aty)
% Number of variables : 59 ( 43 ^ 9 !; 6 ?; 59 :)
% ( 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(f143,plain,
$false,
inference(avatar_sat_refutation,[],[f116,f123,f132,f135,f139,f142]) ).
thf(f142,plain,
( ~ spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f141]) ).
thf(f141,plain,
( $false
| ~ spl3_3
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f140]) ).
thf(f140,plain,
( ( $true = $false )
| ~ spl3_3
| ~ spl3_5 ),
inference(backward_demodulation,[],[f120,f131]) ).
thf(f131,plain,
( ( ( sK2 @ sK5 )
= $false )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f129]) ).
thf(f129,plain,
( spl3_5
<=> ( ( sK2 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f120,plain,
( ( ( sK2 @ sK5 )
= $true )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f118]) ).
thf(f118,plain,
( spl3_3
<=> ( ( sK2 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f139,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f138]) ).
thf(f138,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f137]) ).
thf(f137,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_4 ),
inference(forward_demodulation,[],[f111,f127]) ).
thf(f127,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f125]) ).
thf(f125,plain,
( spl3_4
<=> ( ( sK0 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f111,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f109]) ).
thf(f109,plain,
( spl3_1
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f135,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f134]) ).
thf(f134,plain,
( $false
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f133]) ).
thf(f133,plain,
( ( $true = $false )
| ~ spl3_2 ),
inference(forward_demodulation,[],[f115,f92]) ).
thf(f92,plain,
( $false
= ( sK1 @ sK5 ) ),
inference(duplicate_literal_removal,[],[f90]) ).
thf(f90,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f89]) ).
thf(f89,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f84]) ).
thf(f84,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK1 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f83]) ).
thf(f83,plain,
( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( $false
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f69]) ).
thf(f69,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f68,plain,
( ( $false
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( sK1 @ sK5 ) ) )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f66,plain,
( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
!= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( sK1 @ sK5 ) ) ),
inference(beta_eta_normalization,[],[f65]) ).
thf(f65,plain,
( ( ^ [Y0: $i] :
( ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
| ( sK1 @ Y0 ) )
@ sK5 )
!= ( ^ [Y0: $i] :
( ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f64]) ).
thf(f64,plain,
( ( ^ [Y0: $i] :
( ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
| ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f63]) ).
thf(f63,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK1
@ sK0 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK1
@ sK2 ) )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK1
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK0
@ sK2 ) ) ),
inference(definition_unfolding,[],[f58,f53,f60,f60,f53,f53]) ).
thf(f60,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f26,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f25]) ).
thf(f25,plain,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,axiom,
( intersection
= ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
& ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).
thf(f53,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f27]) ).
thf(f27,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) )
= union ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
( ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
| ( X2 @ X3 ) ) )
= union ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union) ).
thf(f58,plain,
( ( union @ sK1 @ ( intersection @ sK0 @ sK2 ) )
!= ( intersection @ ( union @ sK1 @ sK0 ) @ ( union @ sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f46]) ).
thf(f46,plain,
( ( union @ sK1 @ ( intersection @ sK0 @ sK2 ) )
!= ( intersection @ ( union @ sK1 @ sK0 ) @ ( union @ 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] :
( ( union @ X1 @ ( intersection @ X0 @ X2 ) )
!= ( intersection @ ( union @ X1 @ X0 ) @ ( union @ X1 @ X2 ) ) )
=> ( ( union @ sK1 @ ( intersection @ sK0 @ sK2 ) )
!= ( intersection @ ( union @ sK1 @ sK0 ) @ ( union @ sK1 @ sK2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f44,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ X1 @ ( intersection @ X0 @ X2 ) )
!= ( intersection @ ( union @ X1 @ X0 ) @ ( union @ X1 @ X2 ) ) ),
inference(ennf_transformation,[],[f43]) ).
thf(f43,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ X1 @ ( intersection @ X0 @ X2 ) )
= ( intersection @ ( union @ X1 @ X0 ) @ ( union @ X1 @ X2 ) ) ),
inference(rectify,[],[f16]) ).
thf(f16,negated_conjecture,
~ ! [X5: $i > $o,X4: $i > $o,X6: $i > $o] :
( ( union @ X4 @ ( intersection @ X5 @ X6 ) )
= ( intersection @ ( union @ X4 @ X5 ) @ ( union @ X4 @ X6 ) ) ),
inference(negated_conjecture,[],[f15]) ).
thf(f15,conjecture,
! [X5: $i > $o,X4: $i > $o,X6: $i > $o] :
( ( union @ X4 @ ( intersection @ X5 @ X6 ) )
= ( intersection @ ( union @ X4 @ X5 ) @ ( union @ X4 @ X6 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_distributes_over_intersection) ).
thf(f115,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f113]) ).
thf(f113,plain,
( spl3_2
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f132,plain,
( spl3_4
| spl3_5 ),
inference(avatar_split_clause,[],[f78,f129,f125]) ).
thf(f78,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f77]) ).
thf(f77,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f75]) ).
thf(f75,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f74]) ).
thf(f74,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f72]) ).
thf(f72,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( sK2 @ sK5 )
= $false )
| ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f71]) ).
thf(f71,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $false )
| ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f70]) ).
thf(f70,plain,
( ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $false )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f123,plain,
( spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f99,f113,f118]) ).
thf(f99,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f98]) ).
thf(f98,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f97]) ).
thf(f97,plain,
( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
= $true )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f95]) ).
thf(f95,plain,
( ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true )
| ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f93]) ).
thf(f93,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f67,plain,
( ( $true
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( sK1 @ sK5 ) ) )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f116,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f107,f113,f109]) ).
thf(f107,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f106]) ).
thf(f106,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f102]) ).
thf(f102,plain,
( ( ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f94]) ).
thf(f94,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK1 @ sK5 ) ) )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET171^3 : TPTP v8.2.0. Released v3.6.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.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 13:13:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.37 % (6037)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.37 % (6039)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.37 % (6033)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.37 % (6034)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.37 % (6032)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.37 % (6035)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (6040)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.37 % (6037)Instruction limit reached!
% 0.14/0.37 % (6037)------------------------------
% 0.14/0.37 % (6037)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (6037)Termination reason: Unknown
% 0.14/0.37 % (6037)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (6037)Memory used [KB]: 1023
% 0.14/0.37 % (6037)Time elapsed: 0.003 s
% 0.14/0.37 % (6037)Instructions burned: 2 (million)
% 0.14/0.37 % (6037)------------------------------
% 0.14/0.37 % (6037)------------------------------
% 0.14/0.37 % (6038)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.37 % (6035)Instruction limit reached!
% 0.14/0.37 % (6035)------------------------------
% 0.14/0.37 % (6035)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6035)Termination reason: Unknown
% 0.14/0.38 % (6035)Termination phase: Preprocessing 3
% 0.14/0.38
% 0.14/0.38 % (6035)Memory used [KB]: 1023
% 0.14/0.38 % (6035)Time elapsed: 0.003 s
% 0.14/0.38 % (6035)Instructions burned: 2 (million)
% 0.14/0.38 % (6035)------------------------------
% 0.14/0.38 % (6035)------------------------------
% 0.14/0.38 % (6033)Instruction limit reached!
% 0.14/0.38 % (6033)------------------------------
% 0.14/0.38 % (6033)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6033)Termination reason: Unknown
% 0.14/0.38 % (6033)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (6033)Memory used [KB]: 5500
% 0.14/0.38 % (6033)Time elapsed: 0.005 s
% 0.14/0.38 % (6033)Instructions burned: 4 (million)
% 0.14/0.38 % (6033)------------------------------
% 0.14/0.38 % (6033)------------------------------
% 0.14/0.38 % (6040)Instruction limit reached!
% 0.14/0.38 % (6040)------------------------------
% 0.14/0.38 % (6040)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6040)Termination reason: Unknown
% 0.14/0.38 % (6040)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (6040)Memory used [KB]: 5500
% 0.14/0.38 % (6040)Time elapsed: 0.004 s
% 0.14/0.38 % (6040)Instructions burned: 4 (million)
% 0.14/0.38 % (6040)------------------------------
% 0.14/0.38 % (6040)------------------------------
% 0.14/0.38 % (6039)First to succeed.
% 0.14/0.38 % (6032)Also succeeded, but the first one will report.
% 0.14/0.38 % (6034)Also succeeded, but the first one will report.
% 0.14/0.38 % (6039)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (6039)------------------------------
% 0.14/0.38 % (6039)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (6039)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (6039)Memory used [KB]: 5500
% 0.14/0.38 % (6039)Time elapsed: 0.008 s
% 0.14/0.38 % (6039)Instructions burned: 5 (million)
% 0.14/0.38 % (6039)------------------------------
% 0.14/0.38 % (6039)------------------------------
% 0.14/0.38 % (6028)Success in time 0.021 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------