TSTP Solution File: SEV398^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV398^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n021.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:42 EDT 2024
% Result : Theorem 0.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 473 ( 106 equ; 0 cnn)
% Maximal formula atoms : 10 ( 9 avg)
% Number of connectives : 547 ( 86 ~; 82 |; 26 &; 320 @)
% ( 7 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 92 ( 0 ^ 80 !; 12 ?; 92 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cF: ( a > $o ) > a > $o ).
thf(func_def_2,type,
cG: ( a > $o ) > a > $o ).
thf(func_def_4,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK0: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_9,type,
sK2: a ).
thf(func_def_11,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f148,plain,
$false,
inference(avatar_sat_refutation,[],[f27,f36,f42,f51,f144,f147]) ).
thf(f147,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f146]) ).
thf(f146,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f145]) ).
thf(f145,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_4 ),
inference(forward_demodulation,[],[f22,f35]) ).
thf(f35,plain,
( ( ( cF @ sK1 @ sK2 )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f33,plain,
( spl3_4
<=> ( ( cF @ sK1 @ sK2 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f22,plain,
( ( $true
= ( cF @ sK1 @ sK2 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f20]) ).
thf(f20,plain,
( spl3_1
<=> ( $true
= ( cF @ sK1 @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f144,plain,
( ~ spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f143]) ).
thf(f143,plain,
( $false
| ~ spl3_2
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f142]) ).
thf(f142,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_4 ),
inference(forward_demodulation,[],[f124,f35]) ).
thf(f124,plain,
( ( $true
= ( cF @ sK1 @ sK2 ) )
| ~ spl3_2
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f120]) ).
thf(f120,plain,
( ( $true != $true )
| ( $true
= ( cF @ sK1 @ sK2 ) )
| ~ spl3_2
| ~ spl3_4 ),
inference(superposition,[],[f119,f26]) ).
thf(f26,plain,
( ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f24,plain,
( spl3_2
<=> ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f119,plain,
( ! [X0: a] :
( ( $true
!= ( cF @ ( cG @ ( cF @ sK1 ) ) @ X0 ) )
| ( $true
= ( cF @ sK1 @ X0 ) ) )
| ~ spl3_2
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f118]) ).
thf(f118,plain,
( ! [X0: a] :
( ( $true
!= ( cF @ ( cG @ ( cF @ sK1 ) ) @ X0 ) )
| ( $true
= ( cF @ sK1 @ X0 ) )
| ( $true = $false ) )
| ~ spl3_2
| ~ spl3_4 ),
inference(forward_demodulation,[],[f116,f35]) ).
thf(f116,plain,
( ! [X0: a] :
( ( $true
!= ( cF @ ( cG @ ( cF @ sK1 ) ) @ X0 ) )
| ( $true
= ( cF @ sK1 @ X0 ) )
| ( $true
= ( cF @ sK1 @ sK2 ) ) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f112]) ).
thf(f112,plain,
( ! [X0: a] :
( ( $true
= ( cF @ sK1 @ X0 ) )
| ( $true != $true )
| ( $true
!= ( cF @ ( cG @ ( cF @ sK1 ) ) @ X0 ) )
| ( $true
= ( cF @ sK1 @ sK2 ) ) )
| ~ spl3_2 ),
inference(superposition,[],[f16,f81]) ).
thf(f81,plain,
( ! [X0: a > $o] :
( ( $true
= ( cG @ ( cF @ X0 ) @ ( sK0 @ ( cG @ ( cF @ sK1 ) ) @ X0 ) ) )
| ( $true
= ( cF @ X0 @ sK2 ) ) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f77]) ).
thf(f77,plain,
( ! [X0: a > $o] :
( ( $true != $true )
| ( $true
= ( cG @ ( cF @ X0 ) @ ( sK0 @ ( cG @ ( cF @ sK1 ) ) @ X0 ) ) )
| ( $true
= ( cF @ X0 @ sK2 ) ) )
| ~ spl3_2 ),
inference(superposition,[],[f14,f60]) ).
thf(f60,plain,
( ! [X0: a > $o] :
( ( $true
= ( X0 @ ( sK0 @ ( cG @ ( cF @ sK1 ) ) @ X0 ) ) )
| ( $true
= ( cF @ X0 @ sK2 ) ) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ! [X0: a > $o] :
( ( $true
= ( cF @ X0 @ sK2 ) )
| ( $true
= ( X0 @ ( sK0 @ ( cG @ ( cF @ sK1 ) ) @ X0 ) ) )
| ( $true != $true ) )
| ~ spl3_2 ),
inference(superposition,[],[f15,f26]) ).
thf(f15,plain,
! [X3: a,X0: a > $o,X1: a > $o] :
( ( $true
!= ( cF @ X1 @ X3 ) )
| ( $true
= ( X0 @ ( sK0 @ X1 @ X0 ) ) )
| ( $true
= ( cF @ X0 @ X3 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ! [X0: a > $o,X1: a > $o] :
( ( ( $true
!= ( X1 @ ( sK0 @ X1 @ X0 ) ) )
& ( $true
= ( X0 @ ( sK0 @ X1 @ X0 ) ) ) )
| ! [X3: a] :
( ( $true
!= ( cF @ X1 @ X3 ) )
| ( $true
= ( cF @ X0 @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X5: a] :
( ( $true
!= ( X4 @ X5 ) )
| ( $true
= ( cG @ ( cF @ X4 ) @ X5 ) ) )
& ! [X6: a] :
( ( $true
!= ( X4 @ X6 ) )
| ( $true
= ( cF @ ( cG @ X4 ) @ X6 ) ) ) )
& ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 )
!= ( cF @ sK1 @ sK2 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9]) ).
thf(f9,plain,
! [X0: a > $o,X1: a > $o] :
( ? [X2: a] :
( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
=> ( ( $true
!= ( X1 @ ( sK0 @ X1 @ X0 ) ) )
& ( $true
= ( X0 @ ( sK0 @ X1 @ X0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X7: a > $o,X8: a] :
( ( cF @ X7 @ X8 )
!= ( cF @ ( cG @ ( cF @ X7 ) ) @ X8 ) )
=> ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 )
!= ( cF @ sK1 @ sK2 ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: a > $o,X1: a > $o] :
( ? [X2: a] :
( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ! [X3: a] :
( ( $true
!= ( cF @ X1 @ X3 ) )
| ( $true
= ( cF @ X0 @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X5: a] :
( ( $true
!= ( X4 @ X5 ) )
| ( $true
= ( cG @ ( cF @ X4 ) @ X5 ) ) )
& ! [X6: a] :
( ( $true
!= ( X4 @ X6 ) )
| ( $true
= ( cF @ ( cG @ X4 ) @ X6 ) ) ) )
& ? [X7: a > $o,X8: a] :
( ( cF @ X7 @ X8 )
!= ( cF @ ( cG @ ( cF @ X7 ) ) @ X8 ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ! [X0: a > $o,X1: a > $o] :
( ? [X2: a] :
( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ! [X3: a] :
( ( $true
!= ( cF @ X1 @ X3 ) )
| ( $true
= ( cF @ X0 @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X5: a] :
( ( $true
!= ( X4 @ X5 ) )
| ( $true
= ( cG @ ( cF @ X4 ) @ X5 ) ) )
& ! [X6: a] :
( ( $true
!= ( X4 @ X6 ) )
| ( $true
= ( cF @ ( cG @ X4 ) @ X6 ) ) ) )
& ? [X8: a > $o,X7: a] :
( ( cF @ X8 @ X7 )
!= ( cF @ ( cG @ ( cF @ X8 ) ) @ X7 ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ? [X8: a > $o,X7: a] :
( ( cF @ X8 @ X7 )
!= ( cF @ ( cG @ ( cF @ X8 ) ) @ X7 ) )
& ! [X4: a > $o] :
( ! [X5: a] :
( ( $true
!= ( X4 @ X5 ) )
| ( $true
= ( cG @ ( cF @ X4 ) @ X5 ) ) )
& ! [X6: a] :
( ( $true
!= ( X4 @ X6 ) )
| ( $true
= ( cF @ ( cG @ X4 ) @ X6 ) ) ) )
& ! [X0: a > $o,X1: a > $o] :
( ? [X2: a] :
( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ! [X3: a] :
( ( $true
!= ( cF @ X1 @ X3 ) )
| ( $true
= ( cF @ X0 @ X3 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X4: a > $o] :
( ! [X6: a] :
( ( $true
= ( X4 @ X6 ) )
=> ( $true
= ( cF @ ( cG @ X4 ) @ X6 ) ) )
& ! [X5: a] :
( ( $true
= ( X4 @ X5 ) )
=> ( $true
= ( cG @ ( cF @ X4 ) @ X5 ) ) ) )
& ! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
=> ( ( X1 @ X2 )
= $true ) )
=> ! [X3: a] :
( ( $true
= ( cF @ X1 @ X3 ) )
=> ( $true
= ( cF @ X0 @ X3 ) ) ) ) )
=> ! [X8: a > $o,X7: a] :
( ( cF @ X8 @ X7 )
= ( cF @ ( cG @ ( cF @ X8 ) ) @ X7 ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ! [X3: a] :
( ( cF @ X1 @ X3 )
=> ( cF @ X0 @ X3 ) ) )
& ! [X4: a > $o] :
( ! [X5: a] :
( ( X4 @ X5 )
=> ( cG @ ( cF @ X4 ) @ X5 ) )
& ! [X6: a] :
( ( X4 @ X6 )
=> ( cF @ ( cG @ X4 ) @ X6 ) ) ) )
=> ! [X7: a,X8: a > $o] :
( ( cF @ X8 @ X7 )
<=> ( cF @ ( cG @ ( cF @ X8 ) ) @ X7 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ! [X2: a] :
( ( cF @ X1 @ X2 )
=> ( cF @ X0 @ X2 ) ) )
& ! [X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( cG @ ( cF @ X0 ) @ X2 ) )
& ! [X2: a] :
( ( X0 @ X2 )
=> ( cF @ ( cG @ X0 ) @ X2 ) ) ) )
=> ! [X2: a,X0: a > $o] :
( ( cF @ X0 @ X2 )
<=> ( cF @ ( cG @ ( cF @ X0 ) ) @ X2 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ! [X2: a] :
( ( cF @ X1 @ X2 )
=> ( cF @ X0 @ X2 ) ) )
& ! [X0: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( cG @ ( cF @ X0 ) @ X2 ) )
& ! [X2: a] :
( ( X0 @ X2 )
=> ( cF @ ( cG @ X0 ) @ X2 ) ) ) )
=> ! [X2: a,X0: a > $o] :
( ( cF @ X0 @ X2 )
<=> ( cF @ ( cG @ ( cF @ X0 ) ) @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM67A_pme) ).
thf(f14,plain,
! [X4: a > $o,X5: a] :
( ( $true
!= ( X4 @ X5 ) )
| ( $true
= ( cG @ ( cF @ X4 ) @ X5 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f16,plain,
! [X3: a,X0: a > $o,X1: a > $o] :
( ( $true
!= ( X1 @ ( sK0 @ X1 @ X0 ) ) )
| ( $true
!= ( cF @ X1 @ X3 ) )
| ( $true
= ( cF @ X0 @ X3 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f51,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f50]) ).
thf(f50,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f49,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_demodulation,[],[f48,f31]) ).
thf(f31,plain,
( ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 )
= $false )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl3_3
<=> ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f48,plain,
( ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 ) )
| ~ spl3_1 ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f46,plain,
( ( $true != $true )
| ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 ) )
| ~ spl3_1 ),
inference(superposition,[],[f13,f22]) ).
thf(f13,plain,
! [X6: a,X4: a > $o] :
( ( $true
!= ( X4 @ X6 ) )
| ( $true
= ( cF @ ( cG @ X4 ) @ X6 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f42,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f41]) ).
thf(f41,plain,
( $false
| ~ spl3_2
| ~ spl3_3 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_3 ),
inference(backward_demodulation,[],[f26,f31]) ).
thf(f36,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f18,f33,f29]) ).
thf(f18,plain,
( ( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 )
= $false )
| ( ( cF @ sK1 @ sK2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 )
!= ( cF @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f27,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f17,f24,f20]) ).
thf(f17,plain,
( ( $true
= ( cF @ ( cG @ ( cF @ sK1 ) ) @ sK2 ) )
| ( $true
= ( cF @ sK1 @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEV398^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.11 % Command : run_vampire %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri Jun 21 19:41:39 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.19/0.34 Running higher-order theorem proving
% 0.19/0.34 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.19/0.36 % (506)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.19/0.36 % (509)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.19/0.36 % (510)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.19/0.36 % (514)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.19/0.36 % (508)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.36 % (507)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.19/0.36 % (495)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.19/0.36 % (508)Instruction limit reached!
% 0.19/0.36 % (508)------------------------------
% 0.19/0.36 % (508)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.36 % (508)Termination reason: Unknown
% 0.19/0.36 % (508)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (508)Memory used [KB]: 5500
% 0.19/0.36 % (508)Time elapsed: 0.003 s
% 0.19/0.36 % (508)Instructions burned: 2 (million)
% 0.19/0.36 % (508)------------------------------
% 0.19/0.36 % (508)------------------------------
% 0.19/0.36 % (509)Instruction limit reached!
% 0.19/0.36 % (509)------------------------------
% 0.19/0.36 % (509)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.36 % (509)Termination reason: Unknown
% 0.19/0.36 % (509)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (509)Memory used [KB]: 5500
% 0.19/0.36 % (509)Time elapsed: 0.003 s
% 0.19/0.36 % (509)Instructions burned: 2 (million)
% 0.19/0.36 % (509)------------------------------
% 0.19/0.36 % (509)------------------------------
% 0.19/0.36 % (506)Instruction limit reached!
% 0.19/0.36 % (506)------------------------------
% 0.19/0.36 % (506)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.36 % (506)Termination reason: Unknown
% 0.19/0.36 % (506)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (506)Memory used [KB]: 5500
% 0.19/0.36 % (506)Time elapsed: 0.005 s
% 0.19/0.36 % (506)Instructions burned: 4 (million)
% 0.19/0.36 % (506)------------------------------
% 0.19/0.36 % (506)------------------------------
% 0.19/0.37 % (514)Instruction limit reached!
% 0.19/0.37 % (514)------------------------------
% 0.19/0.37 % (514)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (514)Termination reason: Unknown
% 0.19/0.37 % (514)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (514)Memory used [KB]: 5628
% 0.19/0.37 % (514)Time elapsed: 0.012 s
% 0.19/0.37 % (514)Instructions burned: 18 (million)
% 0.19/0.37 % (514)------------------------------
% 0.19/0.37 % (514)------------------------------
% 0.19/0.37 % (507)First to succeed.
% 0.19/0.37 % (507)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.37 % (507)------------------------------
% 0.19/0.37 % (507)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (507)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (507)Memory used [KB]: 5628
% 0.19/0.37 % (507)Time elapsed: 0.014 s
% 0.19/0.37 % (507)Instructions burned: 18 (million)
% 0.19/0.37 % (507)------------------------------
% 0.19/0.37 % (507)------------------------------
% 0.19/0.37 % (492)Success in time 0.025 s
%------------------------------------------------------------------------------