TSTP Solution File: SEU458^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU458^1 : 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 : n012.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:48:59 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 38
% Syntax : Number of formulae : 88 ( 25 unt; 31 typ; 0 def)
% Number of atoms : 461 ( 77 equ; 0 cnn)
% Maximal formula atoms : 5 ( 8 avg)
% Number of connectives : 425 ( 28 ~; 98 |; 0 &; 291 @)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 175 ( 175 >; 0 *; 0 +; 0 <<)
% Number of symbols : 41 ( 37 usr; 9 con; 0-3 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 52 ( 49 ^ 2 !; 0 ?; 52 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_2,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_3,type,
idem: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_4,type,
infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_5,type,
mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_6,type,
refl: ( $i > $i > $o ) > $o ).
thf(func_def_7,type,
irrefl: ( $i > $i > $o ) > $o ).
thf(func_def_8,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_9,type,
symm: ( $i > $i > $o ) > $o ).
thf(func_def_10,type,
antisymm: ( $i > $i > $o ) > $o ).
thf(func_def_11,type,
asymm: ( $i > $i > $o ) > $o ).
thf(func_def_12,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_13,type,
trans: ( $i > $i > $o ) > $o ).
thf(func_def_14,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_15,type,
trc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
trsc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_17,type,
po: ( $i > $i > $o ) > $o ).
thf(func_def_18,type,
so: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
total: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
term: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
ind: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
innf: ( $i > $i > $o ) > $i > $o ).
thf(func_def_23,type,
nfof: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_24,type,
norm: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
join: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_26,type,
lconfl: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
sconfl: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
confl: ( $i > $i > $o ) > $o ).
thf(func_def_29,type,
cr: ( $i > $i > $o ) > $o ).
thf(func_def_46,type,
sK1: $i > $i > $o ).
thf(func_def_47,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f166,plain,
$false,
inference(avatar_sat_refutation,[],[f139,f150,f155,f161,f165]) ).
thf(f165,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f164]) ).
thf(f164,plain,
( $false
| ~ spl0_1
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f163]) ).
thf(f163,plain,
( ( $true = $false )
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_demodulation,[],[f134,f147]) ).
thf(f147,plain,
( ( $false
= ( sK1 @ sK4 @ sK3 ) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f145]) ).
thf(f145,plain,
( spl0_4
<=> ( $false
= ( sK1 @ sK4 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f134,plain,
( ( $true
= ( sK1 @ sK4 @ sK3 ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f132]) ).
thf(f132,plain,
( spl0_1
<=> ( $true
= ( sK1 @ sK4 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f161,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f160]) ).
thf(f160,plain,
( $false
| ~ spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f156]) ).
thf(f156,plain,
( ( $true = $false )
| ~ spl0_2
| ~ spl0_3 ),
inference(superposition,[],[f143,f138]) ).
thf(f138,plain,
( ( $true
= ( sK1 @ sK3 @ sK4 ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f136]) ).
thf(f136,plain,
( spl0_2
<=> ( $true
= ( sK1 @ sK3 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f143,plain,
( ( ( sK1 @ sK3 @ sK4 )
= $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f141]) ).
thf(f141,plain,
( spl0_3
<=> ( ( sK1 @ sK3 @ sK4 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f155,plain,
spl0_3,
inference(avatar_split_clause,[],[f113,f141]) ).
thf(f113,plain,
( ( sK1 @ sK3 @ sK4 )
= $false ),
inference(duplicate_literal_removal,[],[f112]) ).
thf(f112,plain,
( ( ( sK1 @ sK3 @ sK4 )
= $false )
| ( ( sK1 @ sK3 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f110]) ).
thf(f110,plain,
( ( $false
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 ) ) )
| ( ( sK1 @ sK3 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f108]) ).
thf(f108,plain,
( ( $false
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) ) )
| ( ( sK1 @ sK3 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f106]) ).
thf(f106,plain,
( ( $false
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 ) ) )
| ( $false
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f104]) ).
thf(f104,plain,
( ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) )
!= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 ) ) ),
inference(beta_eta_normalization,[],[f103]) ).
thf(f103,plain,
( ( ^ [Y0: $i] :
( ( sK1 @ sK3 @ Y0 )
| ( sK1 @ Y0 @ sK3 )
| ( sK1 @ Y0 @ sK3 )
| ( sK1 @ sK3 @ Y0 ) )
@ sK4 )
!= ( ^ [Y0: $i] :
( ( sK1 @ sK3 @ Y0 )
| ( sK1 @ Y0 @ sK3 ) )
@ sK4 ) ),
inference(negative_extensionality,[],[f102]) ).
thf(f102,plain,
( ( ^ [Y0: $i] :
( ( sK1 @ sK3 @ Y0 )
| ( sK1 @ Y0 @ sK3 )
| ( sK1 @ Y0 @ sK3 )
| ( sK1 @ sK3 @ Y0 ) ) )
!= ( ^ [Y0: $i] :
( ( sK1 @ sK3 @ Y0 )
| ( sK1 @ Y0 @ sK3 ) ) ) ),
inference(beta_eta_normalization,[],[f101]) ).
thf(f101,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( sK1 @ Y0 @ Y1 )
| ( sK1 @ Y1 @ Y0 ) )
@ sK3 )
!= ( ^ [Y0: $i,Y1: $i] :
( ( sK1 @ Y0 @ Y1 )
| ( sK1 @ Y1 @ Y0 )
| ( sK1 @ Y1 @ Y0 )
| ( sK1 @ Y0 @ Y1 ) )
@ sK3 ) ),
inference(negative_extensionality,[],[f100]) ).
thf(f100,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( sK1 @ Y0 @ Y1 )
| ( sK1 @ Y1 @ Y0 ) ) )
!= ( ^ [Y0: $i,Y1: $i] :
( ( sK1 @ Y0 @ Y1 )
| ( sK1 @ Y1 @ Y0 )
| ( sK1 @ Y1 @ Y0 )
| ( sK1 @ Y0 @ Y1 ) ) ) ),
inference(equality_proxy_clausification,[],[f99]) ).
thf(f99,plain,
( ( ( ^ [Y0: $i,Y1: $i] :
( ( sK1 @ Y0 @ Y1 )
| ( sK1 @ Y1 @ Y0 )
| ( sK1 @ Y1 @ Y0 )
| ( sK1 @ Y0 @ Y1 ) ) )
= ( ^ [Y0: $i,Y1: $i] :
( ( sK1 @ Y0 @ Y1 )
| ( sK1 @ Y1 @ Y0 ) ) ) )
= $false ),
inference(beta_eta_normalization,[],[f98]) ).
thf(f98,plain,
( $false
= ( ^ [Y0: $i > $i > $o] :
( ( ^ [Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 )
| ( Y0 @ Y2 @ Y1 )
| ( Y0 @ Y1 @ Y2 ) ) )
= ( ^ [Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) )
@ sK1 ) ),
inference(sigma_clausification,[],[f97]) ).
thf(f97,plain,
( ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] :
( ( ^ [Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 )
| ( Y0 @ Y2 @ Y1 )
| ( Y0 @ Y1 @ Y2 ) ) )
= ( ^ [Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) ) )
!= $true ),
inference(beta_eta_normalization,[],[f96]) ).
thf(f96,plain,
( $true
!= ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ( Y0 @ ( Y0 @ Y1 ) )
= ( Y0 @ Y1 ) ) )
@ ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(definition_unfolding,[],[f92,f93,f95]) ).
thf(f95,plain,
( sc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f40,plain,
( sc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f39]) ).
thf(f39,plain,
( ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X2 @ X1 )
| ( X0 @ X1 @ X2 ) ) )
= sc ),
inference(rectify,[],[f12]) ).
thf(f12,axiom,
( ( ^ [X0: $i > $i > $o,X2: $i,X3: $i] :
( ( X0 @ X3 @ X2 )
| ( X0 @ X2 @ X3 ) ) )
= sc ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_closure) ).
thf(f93,plain,
( idem
= ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ( Y0 @ ( Y0 @ Y1 ) )
= ( Y0 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f58]) ).
thf(f58,plain,
( idem
= ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ( Y0 @ ( Y0 @ Y1 ) )
= ( Y0 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f57]) ).
thf(f57,plain,
( ( ^ [X0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o] :
( ( X0 @ ( X0 @ X1 ) )
= ( X0 @ X1 ) ) )
= idem ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
( ( ^ [X4: ( $i > $i > $o ) > $i > $i > $o] :
! [X0: $i > $i > $o] :
( ( X4 @ X0 )
= ( X4 @ ( X4 @ X0 ) ) ) )
= idem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotent) ).
thf(f92,plain,
( ( idem @ sc )
!= $true ),
inference(cnf_transformation,[],[f91]) ).
thf(f91,plain,
( ( idem @ sc )
!= $true ),
inference(flattening,[],[f72]) ).
thf(f72,plain,
( ( idem @ sc )
!= $true ),
inference(fool_elimination,[],[f71]) ).
thf(f71,plain,
~ ( idem @ sc ),
inference(rectify,[],[f31]) ).
thf(f31,negated_conjecture,
~ ( idem @ sc ),
inference(negated_conjecture,[],[f30]) ).
thf(f30,conjecture,
idem @ sc,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_closure_op_is_idempotent) ).
thf(f150,plain,
spl0_4,
inference(avatar_split_clause,[],[f121,f145]) ).
thf(f121,plain,
( $false
= ( sK1 @ sK4 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f119]) ).
thf(f119,plain,
( ( $false
= ( sK1 @ sK4 @ sK3 ) )
| ( $false
= ( sK1 @ sK4 @ sK3 ) ) ),
inference(binary_proxy_clausification,[],[f118]) ).
thf(f118,plain,
( ( $false
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 ) ) )
| ( $false
= ( sK1 @ sK4 @ sK3 ) ) ),
inference(binary_proxy_clausification,[],[f107]) ).
thf(f107,plain,
( ( $false
= ( sK1 @ sK4 @ sK3 ) )
| ( $false
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f106]) ).
thf(f139,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f130,f136,f132]) ).
thf(f130,plain,
( ( $true
= ( sK1 @ sK3 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f129]) ).
thf(f129,plain,
( ( $true
= ( sK1 @ sK3 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 @ sK3 ) ) ),
inference(binary_proxy_clausification,[],[f128]) ).
thf(f128,plain,
( ( $true
= ( sK1 @ sK3 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 @ sK3 ) )
| ( $true
= ( ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) ) ) ),
inference(duplicate_literal_removal,[],[f127]) ).
thf(f127,plain,
( ( $true
= ( sK1 @ sK4 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 @ sK4 ) )
| ( $true
= ( sK1 @ sK3 @ sK4 ) )
| ( $true
= ( sK1 @ sK4 @ sK3 ) )
| ( $true
= ( ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f126]) ).
thf(f126,plain,
( ( $true
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 ) ) )
| ( $true
= ( ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) ) )
| ( $true
= ( sK1 @ sK4 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f125]) ).
thf(f125,plain,
( ( $true
= ( sK1 @ sK3 @ sK4 ) )
| ( $true
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) ) )
| ( $true
= ( sK1 @ sK4 @ sK3 ) ) ),
inference(binary_proxy_clausification,[],[f105]) ).
thf(f105,plain,
( ( $true
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 ) ) )
| ( $true
= ( ( sK1 @ sK3 @ sK4 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK4 @ sK3 )
| ( sK1 @ sK3 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU458^1 : TPTP v8.2.0. Released v3.6.0.
% 0.12/0.14 % 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.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 17:02:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 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/sandbox/benchmark/theBenchmark.p
% 0.14/0.36 % (28276)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.36 % (28276)Instruction limit reached!
% 0.14/0.36 % (28276)------------------------------
% 0.14/0.36 % (28276)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (28276)Termination reason: Unknown
% 0.14/0.36 % (28276)Termination phase: shuffling
% 0.14/0.36
% 0.14/0.36 % (28276)Memory used [KB]: 1023
% 0.14/0.36 % (28276)Time elapsed: 0.003 s
% 0.14/0.36 % (28276)Instructions burned: 3 (million)
% 0.14/0.36 % (28276)------------------------------
% 0.14/0.36 % (28276)------------------------------
% 0.14/0.37 % (28277)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 % (28273)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 % (28275)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 % (28274)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 % (28278)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 % (28277)Instruction limit reached!
% 0.14/0.37 % (28277)------------------------------
% 0.14/0.37 % (28277)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (28279)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 % (28280)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 % (28277)Termination reason: Unknown
% 0.14/0.37 % (28277)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (28277)Memory used [KB]: 1023
% 0.14/0.37 % (28277)Time elapsed: 0.003 s
% 0.14/0.37 % (28277)Instructions burned: 3 (million)
% 0.14/0.37 % (28277)------------------------------
% 0.14/0.37 % (28277)------------------------------
% 0.14/0.37 % (28280)Instruction limit reached!
% 0.14/0.37 % (28280)------------------------------
% 0.14/0.37 % (28280)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (28280)Termination reason: Unknown
% 0.14/0.37 % (28280)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (28280)Memory used [KB]: 1023
% 0.14/0.37 % (28280)Time elapsed: 0.003 s
% 0.14/0.37 % (28280)Instructions burned: 3 (million)
% 0.14/0.37 % (28280)------------------------------
% 0.14/0.37 % (28280)------------------------------
% 0.14/0.37 % (28274)Instruction limit reached!
% 0.14/0.37 % (28274)------------------------------
% 0.14/0.37 % (28274)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (28274)Termination reason: Unknown
% 0.14/0.37 % (28274)Termination phase: Property scanning
% 0.14/0.37
% 0.14/0.37 % (28274)Memory used [KB]: 1023
% 0.14/0.37 % (28274)Time elapsed: 0.004 s
% 0.14/0.37 % (28274)Instructions burned: 5 (million)
% 0.14/0.37 % (28274)------------------------------
% 0.14/0.37 % (28274)------------------------------
% 0.14/0.37 % (28278)First to succeed.
% 0.14/0.38 % (28273)Also succeeded, but the first one will report.
% 0.14/0.38 % (28281)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.14/0.38 % (28275)Also succeeded, but the first one will report.
% 0.14/0.38 % (28278)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 % (28278)------------------------------
% 0.14/0.38 % (28278)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (28278)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (28278)Memory used [KB]: 5628
% 0.14/0.38 % (28278)Time elapsed: 0.009 s
% 0.14/0.38 % (28278)Instructions burned: 9 (million)
% 0.14/0.38 % (28278)------------------------------
% 0.14/0.38 % (28278)------------------------------
% 0.14/0.38 % (28272)Success in time 0.016 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------