TSTP Solution File: SYO902^8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO902^8 : TPTP v8.2.0. Released v8.1.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 : n024.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 09:09:38 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 21
% Syntax : Number of formulae : 71 ( 39 unt; 15 typ; 0 def)
% Number of atoms : 315 ( 66 equ; 0 cnn)
% Maximal formula atoms : 9 ( 5 avg)
% Number of connectives : 421 ( 7 ~; 16 |; 33 &; 316 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 62 ( 62 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 13 usr; 6 con; 0-3 aty)
% ( 8 !!; 23 ??; 0 @@+; 0 @@-)
% Number of variables : 107 ( 81 ^ 24 !; 2 ?; 107 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mworld: $tType ).
thf(func_def_0,type,
mworld: $tType ).
thf(func_def_1,type,
mrel: mworld > mworld > $o ).
thf(func_def_2,type,
mactual: mworld ).
thf(func_def_3,type,
mlocal: ( mworld > $o ) > $o ).
thf(func_def_5,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(func_def_6,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_7,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_8,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_9,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_10,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(func_def_11,type,
mdia: ( mworld > $o ) > mworld > $o ).
thf(func_def_12,type,
p: mworld > $o ).
thf(func_def_27,type,
sK1: mworld ).
thf(func_def_28,type,
sK2: mworld > mworld ).
thf(f107,plain,
$false,
inference(trivial_inequality_removal,[],[f106]) ).
thf(f106,plain,
$true = $false,
inference(backward_demodulation,[],[f67,f104]) ).
thf(f104,plain,
( ( p @ ( sK2 @ sK1 ) )
= $false ),
inference(trivial_inequality_removal,[],[f98]) ).
thf(f98,plain,
( ( ( p @ ( sK2 @ sK1 ) )
= $false )
| ( $true = $false ) ),
inference(superposition,[],[f88,f71]) ).
thf(f71,plain,
( ( mrel @ sK1 @ ( sK2 @ sK1 ) )
= $true ),
inference(trivial_inequality_removal,[],[f68]) ).
thf(f68,plain,
( ( ( mrel @ sK1 @ ( sK2 @ sK1 ) )
= $true )
| ( $true = $false ) ),
inference(superposition,[],[f56,f42]) ).
thf(f42,plain,
! [X0: mworld] :
( $true
= ( mrel @ X0 @ X0 ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f19,plain,
! [X0: mworld] :
( $true
= ( mrel @ X0 @ X0 ) ),
inference(fool_elimination,[],[f18]) ).
thf(f18,plain,
! [X0: mworld] : ( mrel @ X0 @ X0 ),
inference(rectify,[],[f9]) ).
thf(f9,axiom,
! [X2: mworld] : ( mrel @ X2 @ X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
thf(f56,plain,
! [X1: mworld] :
( ( ( mrel @ sK1 @ X1 )
= $false )
| ( ( mrel @ X1 @ ( sK2 @ X1 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f55]) ).
thf(f55,plain,
! [X1: mworld] :
( ( $true
= ( ( p @ ( sK2 @ X1 ) )
& ( mrel @ X1 @ ( sK2 @ X1 ) ) ) )
| ( ( mrel @ sK1 @ X1 )
= $false ) ),
inference(beta_eta_normalization,[],[f54]) ).
thf(f54,plain,
! [X1: mworld] :
( ( $true
= ( ^ [Y0: mworld] :
( ( p @ Y0 )
& ( mrel @ X1 @ Y0 ) )
@ ( sK2 @ X1 ) ) )
| ( ( mrel @ sK1 @ X1 )
= $false ) ),
inference(sigma_clausification,[],[f53]) ).
thf(f53,plain,
! [X1: mworld] :
( ( ( ?? @ mworld
@ ^ [Y0: mworld] :
( ( p @ Y0 )
& ( mrel @ X1 @ Y0 ) ) )
= $true )
| ( ( mrel @ sK1 @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f52]) ).
thf(f52,plain,
! [X1: mworld] :
( $true
= ( ( mrel @ sK1 @ X1 )
=> ( ?? @ mworld
@ ^ [Y0: mworld] :
( ( p @ Y0 )
& ( mrel @ X1 @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f51]) ).
thf(f51,plain,
! [X1: mworld] :
( $true
= ( ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( ?? @ mworld
@ ^ [Y1: mworld] :
( ( p @ Y1 )
& ( mrel @ Y0 @ Y1 ) ) ) )
@ X1 ) ),
inference(pi_clausification,[],[f50]) ).
thf(f50,plain,
( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( ?? @ mworld
@ ^ [Y1: mworld] :
( ( p @ Y1 )
& ( mrel @ Y0 @ Y1 ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f48]) ).
thf(f48,plain,
( ( ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ sK1 @ Y0 )
=> ( ?? @ mworld
@ ^ [Y1: mworld] :
( ( p @ Y1 )
& ( mrel @ Y0 @ Y1 ) ) ) ) )
& ( mrel @ mactual @ sK1 ) )
= $true ),
inference(beta_eta_normalization,[],[f47]) ).
thf(f47,plain,
( $true
= ( ^ [Y0: mworld] :
( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( ?? @ mworld
@ ^ [Y2: mworld] :
( ( p @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) ) ) )
& ( mrel @ mactual @ Y0 ) )
@ sK1 ) ),
inference(sigma_clausification,[],[f46]) ).
thf(f46,plain,
( $true
= ( ?? @ mworld
@ ^ [Y0: mworld] :
( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( ?? @ mworld
@ ^ [Y2: mworld] :
( ( p @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) ) ) )
& ( mrel @ mactual @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f44]) ).
thf(f44,plain,
( ( ( ?? @ mworld
@ ^ [Y0: mworld] :
( ( !! @ mworld
@ ^ [Y1: mworld] :
( ( mrel @ Y0 @ Y1 )
=> ( ?? @ mworld
@ ^ [Y2: mworld] :
( ( p @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) ) ) )
& ( mrel @ mactual @ Y0 ) ) )
=> ( ?? @ mworld
@ ^ [Y0: mworld] :
( ( ?? @ mworld
@ ^ [Y1: mworld] :
( ( p @ Y1 )
& ( mrel @ Y0 @ Y1 ) ) )
& ( mrel @ mactual @ Y0 ) ) ) )
!= $true ),
inference(beta_eta_normalization,[],[f43]) ).
thf(f43,plain,
( ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( ?? @ mworld
@ ^ [Y2: mworld] :
( ( Y0 @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( ?? @ mworld
@ ^ [Y2: mworld] :
( ( Y0 @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) )
@ p ) ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( ?? @ mworld
@ ^ [Y2: mworld] :
( ( Y0 @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( ?? @ mworld
@ ^ [Y2: mworld] :
( ( Y0 @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) )
@ p ) ) ) )
!= $true ),
inference(definition_unfolding,[],[f37,f39,f36,f35,f33,f35,f35,f35]) ).
thf(f33,plain,
( mbox
= ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f29,plain,
( mbox
= ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f28]) ).
thf(f28,plain,
( ( ^ [X0: mworld > $o,X1: mworld] :
! [X2: mworld] :
( ( mrel @ X1 @ X2 )
=> ( X0 @ X2 ) ) )
= mbox ),
inference(rectify,[],[f7]) ).
thf(f7,axiom,
( ( ^ [X0: mworld > $o,X2: mworld] :
! [X4: mworld] :
( ( mrel @ X2 @ X4 )
=> ( X0 @ X4 ) ) )
= mbox ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_def) ).
thf(f35,plain,
( mdia
= ( ^ [Y0: mworld > $o,Y1: mworld] :
( ?? @ mworld
@ ^ [Y2: mworld] :
( ( Y0 @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
( mdia
= ( ^ [Y0: mworld > $o,Y1: mworld] :
( ?? @ mworld
@ ^ [Y2: mworld] :
( ( Y0 @ Y2 )
& ( mrel @ Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
( ( ^ [X0: mworld > $o,X1: mworld] :
? [X2: mworld] :
( ( mrel @ X1 @ X2 )
& ( X0 @ X2 ) ) )
= mdia ),
inference(rectify,[],[f8]) ).
thf(f8,axiom,
( ( ^ [X0: mworld > $o,X2: mworld] :
? [X4: mworld] :
( ( mrel @ X2 @ X4 )
& ( X0 @ X4 ) ) )
= mdia ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mdia_def) ).
thf(f36,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f15,plain,
( ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= mimplies ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
( ( ^ [X1: mworld > $o,X3: mworld > $o,X2: mworld] :
( ( X1 @ X2 )
=> ( X3 @ X2 ) ) )
= mimplies ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies_def) ).
thf(f39,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: mworld > $o] : ( X0 @ mactual ) )
= mlocal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def) ).
thf(f37,plain,
( ( mlocal @ ( mimplies @ ( mdia @ ( mbox @ ( mdia @ p ) ) ) @ ( mdia @ ( mdia @ p ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f32]) ).
thf(f32,plain,
( ( mlocal @ ( mimplies @ ( mdia @ ( mbox @ ( mdia @ p ) ) ) @ ( mdia @ ( mdia @ p ) ) ) )
!= $true ),
inference(flattening,[],[f27]) ).
thf(f27,plain,
( ( mlocal @ ( mimplies @ ( mdia @ ( mbox @ ( mdia @ p ) ) ) @ ( mdia @ ( mdia @ p ) ) ) )
!= $true ),
inference(fool_elimination,[],[f26]) ).
thf(f26,plain,
~ ( mlocal @ ( mimplies @ ( mdia @ ( mbox @ ( mdia @ p ) ) ) @ ( mdia @ ( mdia @ p ) ) ) ),
inference(rectify,[],[f11]) ).
thf(f11,negated_conjecture,
~ ( mlocal @ ( mimplies @ ( mdia @ ( mbox @ ( mdia @ p ) ) ) @ ( mdia @ ( mdia @ p ) ) ) ),
inference(negated_conjecture,[],[f10]) ).
thf(f10,conjecture,
mlocal @ ( mimplies @ ( mdia @ ( mbox @ ( mdia @ p ) ) ) @ ( mdia @ ( mdia @ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f88,plain,
! [X0: mworld] :
( ( $false
= ( mrel @ sK1 @ X0 ) )
| ( ( p @ X0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f80,plain,
! [X0: mworld] :
( ( ( p @ X0 )
= $false )
| ( $false
= ( mrel @ sK1 @ X0 ) )
| ( $true = $false ) ),
inference(superposition,[],[f63,f49]) ).
thf(f49,plain,
( $true
= ( mrel @ mactual @ sK1 ) ),
inference(binary_proxy_clausification,[],[f48]) ).
thf(f63,plain,
! [X2: mworld,X1: mworld] :
( ( $false
= ( mrel @ mactual @ X1 ) )
| ( ( p @ X2 )
= $false )
| ( ( mrel @ X1 @ X2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f62]) ).
thf(f62,plain,
! [X2: mworld,X1: mworld] :
( ( $false
= ( mrel @ mactual @ X1 ) )
| ( ( ( p @ X2 )
& ( mrel @ X1 @ X2 ) )
= $false ) ),
inference(beta_eta_normalization,[],[f61]) ).
thf(f61,plain,
! [X2: mworld,X1: mworld] :
( ( ( ^ [Y0: mworld] :
( ( p @ Y0 )
& ( mrel @ X1 @ Y0 ) )
@ X2 )
= $false )
| ( $false
= ( mrel @ mactual @ X1 ) ) ),
inference(pi_clausification,[],[f60]) ).
thf(f60,plain,
! [X1: mworld] :
( ( ( ?? @ mworld
@ ^ [Y0: mworld] :
( ( p @ Y0 )
& ( mrel @ X1 @ Y0 ) ) )
= $false )
| ( $false
= ( mrel @ mactual @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f59]) ).
thf(f59,plain,
! [X1: mworld] :
( ( ( ?? @ mworld
@ ^ [Y0: mworld] :
( ( p @ Y0 )
& ( mrel @ X1 @ Y0 ) ) )
& ( mrel @ mactual @ X1 ) )
= $false ),
inference(beta_eta_normalization,[],[f58]) ).
thf(f58,plain,
! [X1: mworld] :
( ( ^ [Y0: mworld] :
( ( ?? @ mworld
@ ^ [Y1: mworld] :
( ( p @ Y1 )
& ( mrel @ Y0 @ Y1 ) ) )
& ( mrel @ mactual @ Y0 ) )
@ X1 )
= $false ),
inference(pi_clausification,[],[f45]) ).
thf(f45,plain,
( ( ?? @ mworld
@ ^ [Y0: mworld] :
( ( ?? @ mworld
@ ^ [Y1: mworld] :
( ( p @ Y1 )
& ( mrel @ Y0 @ Y1 ) ) )
& ( mrel @ mactual @ Y0 ) ) )
= $false ),
inference(binary_proxy_clausification,[],[f44]) ).
thf(f67,plain,
( ( p @ ( sK2 @ sK1 ) )
= $true ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f64,plain,
( ( $true = $false )
| ( ( p @ ( sK2 @ sK1 ) )
= $true ) ),
inference(superposition,[],[f57,f42]) ).
thf(f57,plain,
! [X1: mworld] :
( ( ( mrel @ sK1 @ X1 )
= $false )
| ( $true
= ( p @ ( sK2 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[],[f55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO902^8 : TPTP v8.2.0. Released v8.1.0.
% 0.06/0.13 % 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.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:18:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_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/sandbox/benchmark/theBenchmark.p
% 0.13/0.36 % (29915)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.36 % (29914)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.36 % (29917)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.36 % (29916)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 % (29915)Instruction limit reached!
% 0.13/0.37 % (29915)------------------------------
% 0.13/0.37 % (29915)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29915)Termination reason: Unknown
% 0.13/0.37 % (29915)Termination phase: Preprocessing 3
% 0.13/0.37 % (29916)Instruction limit reached!
% 0.13/0.37 % (29916)------------------------------
% 0.13/0.37 % (29916)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29916)Termination reason: Unknown
% 0.13/0.37 % (29916)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (29916)Memory used [KB]: 895
% 0.13/0.37 % (29916)Time elapsed: 0.003 s
% 0.13/0.37 % (29916)Instructions burned: 2 (million)
% 0.13/0.37 % (29916)------------------------------
% 0.13/0.37 % (29916)------------------------------
% 0.13/0.37
% 0.13/0.37 % (29915)Memory used [KB]: 895
% 0.13/0.37 % (29915)Time elapsed: 0.003 s
% 0.13/0.37 % (29915)Instructions burned: 2 (million)
% 0.13/0.37 % (29915)------------------------------
% 0.13/0.37 % (29915)------------------------------
% 0.13/0.37 % (29919)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 % (29918)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 % (29917)Refutation not found, incomplete strategy
% 0.13/0.37 % (29917)------------------------------
% 0.13/0.37 % (29917)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29917)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (29917)Memory used [KB]: 5500
% 0.13/0.37 % (29913)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 % (29917)Time elapsed: 0.004 s
% 0.13/0.37 % (29917)Instructions burned: 3 (million)
% 0.13/0.37 % (29917)------------------------------
% 0.13/0.37 % (29917)------------------------------
% 0.13/0.37 % (29919)Instruction limit reached!
% 0.13/0.37 % (29919)------------------------------
% 0.13/0.37 % (29919)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29919)Termination reason: Unknown
% 0.13/0.37 % (29919)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (29919)Memory used [KB]: 5500
% 0.13/0.37 % (29919)Time elapsed: 0.004 s
% 0.13/0.37 % (29919)Instructions burned: 3 (million)
% 0.13/0.37 % (29919)------------------------------
% 0.13/0.37 % (29919)------------------------------
% 0.13/0.37 % (29918)First to succeed.
% 0.13/0.37 % (29914)Also succeeded, but the first one will report.
% 0.13/0.38 % (29913)Instruction limit reached!
% 0.13/0.38 % (29913)------------------------------
% 0.13/0.38 % (29913)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (29918)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38 % (29918)------------------------------
% 0.13/0.38 % (29918)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (29918)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (29918)Memory used [KB]: 5628
% 0.13/0.38 % (29918)Time elapsed: 0.009 s
% 0.13/0.38 % (29918)Instructions burned: 8 (million)
% 0.13/0.38 % (29918)------------------------------
% 0.13/0.38 % (29918)------------------------------
% 0.13/0.38 % (29911)Success in time 0.011 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------