TSTP Solution File: SEV185^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV185^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n029.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:02:10 EDT 2024
% Result : Theorem 0.11s 0.39s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 418 ( 151 equ; 0 cnn)
% Maximal formula atoms : 22 ( 9 avg)
% Number of connectives : 485 ( 89 ~; 77 |; 48 &; 233 @)
% ( 2 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 103 ( 103 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 130 ( 0 ^ 96 !; 34 ?; 130 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: ( b > $o ) > $o ).
thf(func_def_6,type,
sK1: ( b > $o ) > b > $o ).
thf(func_def_7,type,
sK2: ( b > $o ) > ( b > $o ) > b ).
thf(func_def_8,type,
sK3: b ).
thf(func_def_9,type,
sK4: b > $o ).
thf(func_def_10,type,
sK5: b > $o ).
thf(func_def_12,type,
ph7:
!>[X0: $tType] : X0 ).
thf(f47,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f37,f46]) ).
thf(f46,plain,
( spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f45,f27,f31]) ).
thf(f31,plain,
( spl6_2
<=> ( $true
= ( sK5 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
thf(f27,plain,
( spl6_1
<=> ( $true
= ( sK4 @ ( sK2 @ sK4 @ sK5 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
thf(f45,plain,
( ( $true
= ( sK5 @ sK3 ) )
| ~ spl6_1 ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f44,plain,
( ( $true != $true )
| ( $true
= ( sK5 @ sK3 ) )
| ~ spl6_1 ),
inference(superposition,[],[f43,f15]) ).
thf(f15,plain,
( $true
= ( sK1 @ sK4 @ sK3 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ( ( $true
= ( X3 @ ( sK2 @ X3 @ X2 ) ) )
& ( ( X2 @ ( sK2 @ X3 @ X2 ) )
!= $true ) )
| ( $true
!= ( sK1 @ X3 @ X4 ) ) )
| ( $true
!= ( sK0 @ X2 ) ) )
& ( ( sK0 @ sK5 )
= $true )
& ( $true
!= ( sK5 @ sK3 ) )
& ( $true
= ( sK1 @ sK4 @ sK3 ) )
& ! [X9: b] :
( ( $true
!= ( sK4 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: ( b > $o ) > $o,X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X3 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ( $true
!= ( X1 @ X3 @ X4 ) ) )
| ( $true
!= ( X0 @ X2 ) ) )
& ? [X6: b,X7: b > $o] :
( ? [X8: b > $o] :
( ( $true
= ( X0 @ X8 ) )
& ( $true
!= ( X8 @ X6 ) ) )
& ( $true
= ( X1 @ X7 @ X6 ) )
& ! [X9: b] :
( ( $true
!= ( X7 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
!= ( X0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) ) ) ) )
=> ( ! [X2: b > $o] :
( ! [X4: b,X3: b > $o] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X3 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ( $true
!= ( sK1 @ X3 @ X4 ) ) )
| ( $true
!= ( sK0 @ X2 ) ) )
& ? [X7: b > $o,X6: b] :
( ? [X8: b > $o] :
( ( $true
= ( sK0 @ X8 ) )
& ( $true
!= ( X8 @ X6 ) ) )
& ( $true
= ( sK1 @ X7 @ X6 ) )
& ! [X9: b] :
( ( $true
!= ( X7 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X2: b > $o,X3: b > $o] :
( ? [X5: b] :
( ( ( X3 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
=> ( ( $true
= ( X3 @ ( sK2 @ X3 @ X2 ) ) )
& ( ( X2 @ ( sK2 @ X3 @ X2 ) )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X7: b > $o,X6: b] :
( ? [X8: b > $o] :
( ( $true
= ( sK0 @ X8 ) )
& ( $true
!= ( X8 @ X6 ) ) )
& ( $true
= ( sK1 @ X7 @ X6 ) )
& ! [X9: b] :
( ( $true
!= ( X7 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) ) ) )
=> ( ? [X8: b > $o] :
( ( $true
= ( sK0 @ X8 ) )
& ( $true
!= ( X8 @ sK3 ) ) )
& ( $true
= ( sK1 @ sK4 @ sK3 ) )
& ! [X9: b] :
( ( $true
!= ( sK4 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X8: b > $o] :
( ( $true
= ( sK0 @ X8 ) )
& ( $true
!= ( X8 @ sK3 ) ) )
=> ( ( ( sK0 @ sK5 )
= $true )
& ( $true
!= ( sK5 @ sK3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: ( b > $o ) > $o,X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X3 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ( $true
!= ( X1 @ X3 @ X4 ) ) )
| ( $true
!= ( X0 @ X2 ) ) )
& ? [X6: b,X7: b > $o] :
( ? [X8: b > $o] :
( ( $true
= ( X0 @ X8 ) )
& ( $true
!= ( X8 @ X6 ) ) )
& ( $true
= ( X1 @ X7 @ X6 ) )
& ! [X9: b] :
( ( $true
!= ( X7 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
!= ( X0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: ( b > $o ) > $o,X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X3 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ( $true
!= ( X1 @ X3 @ X4 ) ) )
| ( $true
!= ( X0 @ X2 ) ) )
& ? [X7: b,X6: b > $o] :
( ? [X10: b > $o] :
( ( $true
= ( X0 @ X10 ) )
& ( $true
!= ( X10 @ X7 ) ) )
& ( $true
= ( X1 @ X6 @ X7 ) )
& ! [X8: b] :
( ( $true
!= ( X6 @ X8 ) )
| ! [X9: b > $o] :
( ( $true
!= ( X0 @ X9 ) )
| ( $true
= ( X9 @ X8 ) ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X0: ( b > $o ) > $o,X1: ( b > $o ) > b > $o] :
( ? [X7: b,X6: b > $o] :
( ? [X10: b > $o] :
( ( $true
= ( X0 @ X10 ) )
& ( $true
!= ( X10 @ X7 ) ) )
& ( $true
= ( X1 @ X6 @ X7 ) )
& ! [X8: b] :
( ( $true
!= ( X6 @ X8 ) )
| ! [X9: b > $o] :
( ( $true
!= ( X0 @ X9 ) )
| ( $true
= ( X9 @ X8 ) ) ) ) )
& ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X3 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ( $true
!= ( X1 @ X3 @ X4 ) ) )
| ( $true
!= ( X0 @ X2 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: ( b > $o ) > $o,X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ( $true
= ( X0 @ X2 ) )
=> ! [X3: b > $o,X4: b] :
( ( ! [X5: b] :
( ( ( X3 @ X5 )
= $true )
=> ( ( X2 @ X5 )
= $true ) )
& ( $true
= ( X1 @ X3 @ X4 ) ) )
=> ( ( X2 @ X4 )
= $true ) ) )
=> ! [X7: b,X6: b > $o] :
( ( ( $true
= ( X1 @ X6 @ X7 ) )
& ! [X8: b] :
( ( $true
= ( X6 @ X8 ) )
=> ! [X9: b > $o] :
( ( $true
= ( X0 @ X9 ) )
=> ( $true
= ( X9 @ X8 ) ) ) ) )
=> ! [X10: b > $o] :
( ( $true
= ( X0 @ X10 ) )
=> ( $true
= ( X10 @ X7 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( b > $o ) > $o,X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ( X0 @ X2 )
=> ! [X3: b > $o,X4: b] :
( ( ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) )
& ( X1 @ X3 @ X4 ) )
=> ( X2 @ X4 ) ) )
=> ! [X6: b > $o,X7: b] :
( ( ! [X8: b] :
( ( X6 @ X8 )
=> ! [X9: b > $o] :
( ( X0 @ X9 )
=> ( X9 @ X8 ) ) )
& ( X1 @ X6 @ X7 ) )
=> ! [X10: b > $o] :
( ( X0 @ X10 )
=> ( X10 @ X7 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: ( b > $o ) > $o,X0: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X3: b > $o,X4: b] :
( ( ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) )
& ( X0 @ X3 @ X4 ) )
=> ( X2 @ X4 ) ) )
=> ! [X3: b > $o,X4: b] :
( ( ! [X2: b] :
( ( X3 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) )
& ( X0 @ X3 @ X4 ) )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X4 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: ( b > $o ) > $o,X0: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X3: b > $o,X4: b] :
( ( ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) )
& ( X0 @ X3 @ X4 ) )
=> ( X2 @ X4 ) ) )
=> ! [X3: b > $o,X4: b] :
( ( ! [X2: b] :
( ( X3 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) )
& ( X0 @ X3 @ X4 ) )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM564_pme) ).
thf(f43,plain,
( ! [X0: b] :
( ( $true
!= ( sK1 @ sK4 @ X0 ) )
| ( $true
= ( sK5 @ X0 ) ) )
| ~ spl6_1 ),
inference(trivial_inequality_removal,[],[f42]) ).
thf(f42,plain,
( ! [X0: b] :
( ( $true
= ( sK5 @ X0 ) )
| ( $true != $true )
| ( $true
!= ( sK1 @ sK4 @ X0 ) ) )
| ~ spl6_1 ),
inference(forward_demodulation,[],[f41,f17]) ).
thf(f17,plain,
( ( sK0 @ sK5 )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f41,plain,
( ! [X0: b] :
( ( $true
= ( sK5 @ X0 ) )
| ( $true
!= ( sK1 @ sK4 @ X0 ) )
| ( ( sK0 @ sK5 )
!= $true ) )
| ~ spl6_1 ),
inference(trivial_inequality_removal,[],[f40]) ).
thf(f40,plain,
( ! [X0: b] :
( ( $true != $true )
| ( $true
= ( sK5 @ X0 ) )
| ( ( sK0 @ sK5 )
!= $true )
| ( $true
!= ( sK1 @ sK4 @ X0 ) ) )
| ~ spl6_1 ),
inference(superposition,[],[f18,f39]) ).
thf(f39,plain,
( ( $true
= ( sK5 @ ( sK2 @ sK4 @ sK5 ) ) )
| ~ spl6_1 ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
( ( $true != $true )
| ( $true
= ( sK5 @ ( sK2 @ sK4 @ sK5 ) ) )
| ~ spl6_1 ),
inference(superposition,[],[f21,f29]) ).
thf(f29,plain,
( ( $true
= ( sK4 @ ( sK2 @ sK4 @ sK5 ) ) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f21,plain,
! [X0: b] :
( ( $true
!= ( sK4 @ X0 ) )
| ( $true
= ( sK5 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
! [X0: b] :
( ( $true
= ( sK5 @ X0 ) )
| ( $true != $true )
| ( $true
!= ( sK4 @ X0 ) ) ),
inference(superposition,[],[f14,f17]) ).
thf(f14,plain,
! [X10: b > $o,X9: b] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) )
| ( $true
!= ( sK4 @ X9 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
! [X2: b > $o,X3: b > $o,X4: b] :
( ( ( X2 @ ( sK2 @ X3 @ X2 ) )
!= $true )
| ( ( X2 @ X4 )
= $true )
| ( $true
!= ( sK0 @ X2 ) )
| ( $true
!= ( sK1 @ X3 @ X4 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f37,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f36]) ).
thf(f36,plain,
( $false
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( $true != $true )
| ~ spl6_2 ),
inference(superposition,[],[f16,f33]) ).
thf(f33,plain,
( ( $true
= ( sK5 @ sK3 ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f16,plain,
( $true
!= ( sK5 @ sK3 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f34,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f25,f31,f27]) ).
thf(f25,plain,
( ( $true
= ( sK4 @ ( sK2 @ sK4 @ sK5 ) ) )
| ( $true
= ( sK5 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
( ( $true
= ( sK4 @ ( sK2 @ sK4 @ sK5 ) ) )
| ( $true != $true )
| ( $true
= ( sK5 @ sK3 ) ) ),
inference(superposition,[],[f23,f17]) ).
thf(f23,plain,
! [X0: b > $o] :
( ( $true
!= ( sK0 @ X0 ) )
| ( $true
= ( sK4 @ ( sK2 @ sK4 @ X0 ) ) )
| ( $true
= ( X0 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f22,plain,
! [X0: b > $o] :
( ( $true
= ( sK4 @ ( sK2 @ sK4 @ X0 ) ) )
| ( $true
= ( X0 @ sK3 ) )
| ( $true
!= ( sK0 @ X0 ) )
| ( $true != $true ) ),
inference(superposition,[],[f19,f15]) ).
thf(f19,plain,
! [X2: b > $o,X3: b > $o,X4: b] :
( ( $true
!= ( sK1 @ X3 @ X4 ) )
| ( $true
!= ( sK0 @ X2 ) )
| ( ( X2 @ X4 )
= $true )
| ( $true
= ( X3 @ ( sK2 @ X3 @ X2 ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV185^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_vampire %s %d THM
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 21 19:00:54 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.11/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.36 Running higher-order theorem proving
% 0.11/0.36 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.11/0.38 % (29394)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.11/0.38 % (29396)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.11/0.38 % (29398)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.11/0.38 % (29399)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.11/0.38 % (29393)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.11/0.38 % (29397)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.11/0.38 % (29396)Instruction limit reached!
% 0.11/0.38 % (29396)------------------------------
% 0.11/0.38 % (29396)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.38 % (29396)Termination reason: Unknown
% 0.11/0.38 % (29396)Termination phase: Saturation
% 0.11/0.38
% 0.11/0.38 % (29396)Memory used [KB]: 5500
% 0.11/0.38 % (29396)Time elapsed: 0.005 s
% 0.11/0.38 % (29396)Instructions burned: 2 (million)
% 0.11/0.38 % (29396)------------------------------
% 0.11/0.38 % (29396)------------------------------
% 0.11/0.38 % (29397)Instruction limit reached!
% 0.11/0.38 % (29397)------------------------------
% 0.11/0.38 % (29397)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.38 % (29397)Termination reason: Unknown
% 0.11/0.38 % (29397)Termination phase: Saturation
% 0.11/0.38
% 0.11/0.38 % (29397)Memory used [KB]: 895
% 0.11/0.38 % (29397)Time elapsed: 0.004 s
% 0.11/0.38 % (29397)Instructions burned: 2 (million)
% 0.11/0.38 % (29397)------------------------------
% 0.11/0.38 % (29397)------------------------------
% 0.11/0.38 % (29392)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.11/0.38 % (29393)Instruction limit reached!
% 0.11/0.38 % (29393)------------------------------
% 0.11/0.38 % (29393)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.38 % (29393)Termination reason: Unknown
% 0.11/0.38 % (29393)Termination phase: Saturation
% 0.11/0.38
% 0.11/0.38 % (29393)Memory used [KB]: 5500
% 0.11/0.38 % (29393)Time elapsed: 0.006 s
% 0.11/0.38 % (29393)Instructions burned: 4 (million)
% 0.11/0.38 % (29393)------------------------------
% 0.11/0.38 % (29393)------------------------------
% 0.11/0.38 % (29394)First to succeed.
% 0.11/0.39 % (29399)Also succeeded, but the first one will report.
% 0.11/0.39 % (29394)Refutation found. Thanks to Tanya!
% 0.11/0.39 % SZS status Theorem for theBenchmark
% 0.11/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.39 % (29394)------------------------------
% 0.11/0.39 % (29394)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.39 % (29394)Termination reason: Refutation
% 0.11/0.39
% 0.11/0.39 % (29394)Memory used [KB]: 5500
% 0.11/0.39 % (29394)Time elapsed: 0.009 s
% 0.11/0.39 % (29394)Instructions burned: 5 (million)
% 0.11/0.39 % (29394)------------------------------
% 0.11/0.39 % (29394)------------------------------
% 0.11/0.39 % (29389)Success in time 0.023 s
%------------------------------------------------------------------------------