TSTP Solution File: NUM765^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM765^1 : TPTP v8.2.0. Released v3.7.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 : n022.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 01:45:44 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 82 ( 3 unt; 9 typ; 0 def)
% Number of atoms : 433 ( 122 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 667 ( 95 ~; 62 |; 7 &; 456 @)
% ( 4 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 96 ( 0 ^ 96 !; 0 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
frac: $tType ).
thf(func_def_0,type,
frac: $tType ).
thf(func_def_1,type,
x: frac ).
thf(func_def_2,type,
y: frac ).
thf(func_def_3,type,
z: frac ).
thf(func_def_4,type,
u: frac ).
thf(func_def_5,type,
moref: frac > frac > $o ).
thf(func_def_6,type,
eq: frac > frac > $o ).
thf(func_def_8,type,
pf: frac > frac > frac ).
thf(f93,plain,
$false,
inference(avatar_sat_refutation,[],[f70,f79,f81,f84,f88,f92]) ).
thf(f92,plain,
( spl0_1
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f91]) ).
thf(f91,plain,
( $false
| spl0_1
| spl0_4 ),
inference(subsumption_resolution,[],[f90,f65]) ).
thf(f65,plain,
( ( ( moref @ x @ y )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f63,plain,
( spl0_1
<=> ( ( moref @ x @ y )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f90,plain,
( ( ( moref @ x @ y )
= $true )
| spl0_4 ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f89,plain,
( ( $true != $true )
| ( ( moref @ x @ y )
= $true )
| spl0_4 ),
inference(superposition,[],[f78,f52]) ).
thf(f52,plain,
( ( ( eq @ x @ y )
= $true )
| ( ( moref @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f32,plain,
( ( ( moref @ x @ y )
= $true )
| ( ( eq @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f26]) ).
thf(f26,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(flattening,[],[f23]) ).
thf(f23,plain,
( ( ( moref @ x @ y )
!= $true )
=> ( ( eq @ x @ y )
= $true ) ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f78,plain,
( ( ( eq @ x @ y )
!= $true )
| spl0_4 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f76,plain,
( spl0_4
<=> ( ( eq @ x @ y )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f88,plain,
( spl0_2
| spl0_3 ),
inference(avatar_contradiction_clause,[],[f87]) ).
thf(f87,plain,
( $false
| spl0_2
| spl0_3 ),
inference(subsumption_resolution,[],[f86,f74]) ).
thf(f74,plain,
( ( ( moref @ z @ u )
!= $true )
| spl0_3 ),
inference(avatar_component_clause,[],[f72]) ).
thf(f72,plain,
( spl0_3
<=> ( ( moref @ z @ u )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f86,plain,
( ( ( moref @ z @ u )
= $true )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f85,plain,
( ( ( moref @ z @ u )
= $true )
| ( $true != $true )
| spl0_2 ),
inference(superposition,[],[f69,f49]) ).
thf(f49,plain,
( ( ( eq @ z @ u )
= $true )
| ( ( moref @ z @ u )
= $true ) ),
inference(cnf_transformation,[],[f33]) ).
thf(f33,plain,
( ( ( eq @ z @ u )
= $true )
| ( ( moref @ z @ u )
= $true ) ),
inference(ennf_transformation,[],[f27]) ).
thf(f27,plain,
( ( ( moref @ z @ u )
!= $true )
=> ( ( eq @ z @ u )
= $true ) ),
inference(flattening,[],[f17]) ).
thf(f17,plain,
( ( ( moref @ z @ u )
!= $true )
=> ( ( eq @ z @ u )
= $true ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
( ~ ( moref @ z @ u )
=> ( eq @ z @ u ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( ~ ( moref @ z @ u )
=> ( eq @ z @ u ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(f69,plain,
( ( ( eq @ z @ u )
!= $true )
| spl0_2 ),
inference(avatar_component_clause,[],[f67]) ).
thf(f67,plain,
( spl0_2
<=> ( ( eq @ z @ u )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f84,plain,
( ~ spl0_4
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f83,f67,f76]) ).
thf(f83,plain,
( ( ( eq @ x @ y )
!= $true )
| ( ( eq @ z @ u )
!= $true ) ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f82,plain,
( ( ( eq @ x @ y )
!= $true )
| ( $true != $true )
| ( ( eq @ z @ u )
!= $true ) ),
inference(superposition,[],[f51,f48]) ).
thf(f48,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( eq @ ( pf @ X2 @ X0 ) @ ( pf @ X1 @ X3 ) ) )
| ( $true
!= ( eq @ X0 @ X3 ) )
| ( $true
!= ( eq @ X2 @ X1 ) ) ),
inference(cnf_transformation,[],[f42]) ).
thf(f42,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( $true
= ( eq @ ( pf @ X2 @ X0 ) @ ( pf @ X1 @ X3 ) ) )
| ( $true
!= ( eq @ X0 @ X3 ) )
| ( $true
!= ( eq @ X2 @ X1 ) ) ),
inference(rectify,[],[f36]) ).
thf(f36,plain,
! [X0: frac,X2: frac,X3: frac,X1: frac] :
( ( $true
= ( eq @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) )
| ( $true
!= ( eq @ X0 @ X1 ) )
| ( ( eq @ X3 @ X2 )
!= $true ) ),
inference(flattening,[],[f35]) ).
thf(f35,plain,
! [X3: frac,X0: frac,X2: frac,X1: frac] :
( ( $true
= ( eq @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) )
| ( $true
!= ( eq @ X0 @ X1 ) )
| ( ( eq @ X3 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f21]) ).
thf(f21,plain,
! [X3: frac,X0: frac,X2: frac,X1: frac] :
( ( ( eq @ X3 @ X2 )
= $true )
=> ( ( $true
= ( eq @ X0 @ X1 ) )
=> ( $true
= ( eq @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) ) ) ),
inference(fool_elimination,[],[f20]) ).
thf(f20,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( eq @ X3 @ X2 )
=> ( ( eq @ X0 @ X1 )
=> ( eq @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X3: frac,X4: frac,X2: frac,X1: frac] :
( ( eq @ X1 @ X2 )
=> ( ( eq @ X3 @ X4 )
=> ( eq @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz56) ).
thf(f51,plain,
( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(cnf_transformation,[],[f39]) ).
thf(f39,plain,
( ( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true )
& ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ) ),
inference(ennf_transformation,[],[f24]) ).
thf(f24,plain,
~ ( ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true )
=> ( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true ) ),
inference(flattening,[],[f13]) ).
thf(f13,plain,
~ ( ( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true )
=> ( ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $true ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
~ ( ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
=> ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,negated_conjecture,
~ ( ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
=> ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) ) ),
inference(negated_conjecture,[],[f7]) ).
thf(f7,conjecture,
( ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
=> ( eq @ ( pf @ x @ z ) @ ( pf @ y @ u ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz66) ).
thf(f81,plain,
( ~ spl0_3
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f58,f63,f72]) ).
thf(f58,plain,
( ( ( moref @ z @ u )
!= $true )
| ( ( moref @ x @ y )
!= $true ) ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
( ( $true != $true )
| ( ( moref @ z @ u )
!= $true )
| ( ( moref @ x @ y )
!= $true ) ),
inference(superposition,[],[f50,f46]) ).
thf(f46,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) )
| ( $true
!= ( moref @ X0 @ X1 ) )
| ( ( moref @ X2 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f41,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( $true
!= ( moref @ X0 @ X1 ) )
& ( $true
!= ( eq @ X0 @ X1 ) ) )
| ( $true
= ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) )
| ( ( moref @ X2 @ X3 )
!= $true ) ),
inference(rectify,[],[f31]) ).
thf(f31,plain,
! [X1: frac,X3: frac,X2: frac,X0: frac] :
( ( ( $true
!= ( moref @ X1 @ X3 ) )
& ( $true
!= ( eq @ X1 @ X3 ) ) )
| ( $true
= ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X0 ) ) )
| ( $true
!= ( moref @ X2 @ X0 ) ) ),
inference(flattening,[],[f30]) ).
thf(f30,plain,
! [X2: frac,X0: frac,X3: frac,X1: frac] :
( ( $true
= ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X0 ) ) )
| ( $true
!= ( moref @ X2 @ X0 ) )
| ( ( $true
!= ( moref @ X1 @ X3 ) )
& ( $true
!= ( eq @ X1 @ X3 ) ) ) ),
inference(ennf_transformation,[],[f29]) ).
thf(f29,plain,
! [X2: frac,X0: frac,X3: frac,X1: frac] :
( ( ( $true
!= ( moref @ X1 @ X3 ) )
=> ( $true
= ( eq @ X1 @ X3 ) ) )
=> ( ( $true
= ( moref @ X2 @ X0 ) )
=> ( $true
= ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X0 ) ) ) ) ),
inference(flattening,[],[f11]) ).
thf(f11,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( $true
!= ( moref @ X1 @ X3 ) )
=> ( $true
= ( eq @ X1 @ X3 ) ) )
=> ( ( $true
= ( moref @ X2 @ X0 ) )
=> ( $true
= ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X0 ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ~ ( moref @ X1 @ X3 )
=> ( eq @ X1 @ X3 ) )
=> ( ( moref @ X2 @ X0 )
=> ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X0 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
! [X4: frac,X1: frac,X3: frac,X2: frac] :
( ( ~ ( moref @ X1 @ X2 )
=> ( eq @ X1 @ X2 ) )
=> ( ( moref @ X3 @ X4 )
=> ( moref @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65a) ).
thf(f50,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
!= $true ),
inference(cnf_transformation,[],[f39]) ).
thf(f79,plain,
( ~ spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f60,f76,f72]) ).
thf(f60,plain,
( ( ( moref @ z @ u )
!= $true )
| ( ( eq @ x @ y )
!= $true ) ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f55,plain,
( ( ( eq @ x @ y )
!= $true )
| ( $true != $true )
| ( ( moref @ z @ u )
!= $true ) ),
inference(superposition,[],[f50,f45]) ).
thf(f45,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) )
| ( $true
!= ( eq @ X0 @ X1 ) )
| ( ( moref @ X2 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f70,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f61,f67,f63]) ).
thf(f61,plain,
( ( ( eq @ z @ u )
!= $true )
| ( ( moref @ x @ y )
!= $true ) ),
inference(trivial_inequality_removal,[],[f57]) ).
thf(f57,plain,
( ( ( eq @ z @ u )
!= $true )
| ( $true != $true )
| ( ( moref @ x @ y )
!= $true ) ),
inference(superposition,[],[f50,f44]) ).
thf(f44,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ ( pf @ X3 @ X2 ) @ ( pf @ X0 @ X1 ) )
= $true )
| ( $true
!= ( moref @ X3 @ X0 ) )
| ( $true
!= ( eq @ X2 @ X1 ) ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f40,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( moref @ ( pf @ X3 @ X2 ) @ ( pf @ X0 @ X1 ) )
= $true )
| ( $true
!= ( moref @ X3 @ X0 ) )
| ( ( $true
!= ( eq @ X2 @ X1 ) )
& ( $true
!= ( moref @ X2 @ X1 ) ) ) ),
inference(rectify,[],[f38]) ).
thf(f38,plain,
! [X2: frac,X1: frac,X0: frac,X3: frac] :
( ( $true
= ( moref @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) )
| ( $true
!= ( moref @ X3 @ X2 ) )
| ( ( $true
!= ( eq @ X0 @ X1 ) )
& ( $true
!= ( moref @ X0 @ X1 ) ) ) ),
inference(flattening,[],[f37]) ).
thf(f37,plain,
! [X0: frac,X3: frac,X1: frac,X2: frac] :
( ( $true
= ( moref @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) )
| ( ( $true
!= ( eq @ X0 @ X1 ) )
& ( $true
!= ( moref @ X0 @ X1 ) ) )
| ( $true
!= ( moref @ X3 @ X2 ) ) ),
inference(ennf_transformation,[],[f28]) ).
thf(f28,plain,
! [X0: frac,X3: frac,X1: frac,X2: frac] :
( ( $true
= ( moref @ X3 @ X2 ) )
=> ( ( ( $true
!= ( moref @ X0 @ X1 ) )
=> ( $true
= ( eq @ X0 @ X1 ) ) )
=> ( $true
= ( moref @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) ) ) ),
inference(flattening,[],[f19]) ).
thf(f19,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( $true
= ( moref @ X3 @ X2 ) )
=> ( ( ( $true
!= ( moref @ X0 @ X1 ) )
=> ( $true
= ( eq @ X0 @ X1 ) ) )
=> ( $true
= ( moref @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f18,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X3 @ X2 )
=> ( ( ~ ( moref @ X0 @ X1 )
=> ( eq @ X0 @ X1 ) )
=> ( moref @ ( pf @ X3 @ X0 ) @ ( pf @ X2 @ X1 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X3: frac,X4: frac,X2: frac,X1: frac] :
( ( moref @ X1 @ X2 )
=> ( ( ~ ( moref @ X3 @ X4 )
=> ( eq @ X3 @ X4 ) )
=> ( moref @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65b) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : NUM765^1 : TPTP v8.2.0. Released v3.7.0.
% 0.13/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.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 03:56:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 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.15/0.38 % (30574)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (30577)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38 % (30575)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.15/0.38 % (30576)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.15/0.38 % (30571)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.15/0.38 % (30573)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.15/0.38 % (30578)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.15/0.38 % (30572)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.15/0.38 % (30574)Instruction limit reached!
% 0.15/0.38 % (30574)------------------------------
% 0.15/0.38 % (30574)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (30574)Termination reason: Unknown
% 0.15/0.38 % (30575)Instruction limit reached!
% 0.15/0.38 % (30575)------------------------------
% 0.15/0.38 % (30575)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (30574)Termination phase: Clausification
% 0.15/0.38
% 0.15/0.38 % (30574)Memory used [KB]: 895
% 0.15/0.38 % (30574)Time elapsed: 0.003 s
% 0.15/0.38 % (30574)Instructions burned: 2 (million)
% 0.15/0.38 % (30574)------------------------------
% 0.15/0.38 % (30574)------------------------------
% 0.15/0.38 % (30575)Termination reason: Unknown
% 0.15/0.38 % (30575)Termination phase: shuffling
% 0.15/0.38
% 0.15/0.38 % (30575)Memory used [KB]: 895
% 0.15/0.38 % (30575)Time elapsed: 0.003 s
% 0.15/0.38 % (30575)Instructions burned: 3 (million)
% 0.15/0.38 % (30575)------------------------------
% 0.15/0.38 % (30575)------------------------------
% 0.15/0.38 % (30578)Instruction limit reached!
% 0.15/0.38 % (30578)------------------------------
% 0.15/0.38 % (30578)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (30578)Termination reason: Unknown
% 0.15/0.38 % (30578)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (30578)Memory used [KB]: 895
% 0.15/0.38 % (30578)Time elapsed: 0.004 s
% 0.15/0.38 % (30578)Instructions burned: 3 (million)
% 0.15/0.38 % (30578)------------------------------
% 0.15/0.38 % (30578)------------------------------
% 0.15/0.38 % (30572)Instruction limit reached!
% 0.15/0.38 % (30572)------------------------------
% 0.15/0.38 % (30572)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (30572)Termination reason: Unknown
% 0.15/0.38 % (30572)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (30572)Memory used [KB]: 5500
% 0.15/0.38 % (30572)Time elapsed: 0.005 s
% 0.15/0.38 % (30572)Instructions burned: 5 (million)
% 0.15/0.38 % (30572)------------------------------
% 0.15/0.38 % (30572)------------------------------
% 0.15/0.38 % (30576)First to succeed.
% 0.15/0.39 % (30571)Also succeeded, but the first one will report.
% 0.15/0.39 % (30576)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (30576)------------------------------
% 0.15/0.39 % (30576)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30576)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (30576)Memory used [KB]: 5500
% 0.15/0.39 % (30576)Time elapsed: 0.007 s
% 0.15/0.39 % (30576)Instructions burned: 5 (million)
% 0.15/0.39 % (30576)------------------------------
% 0.15/0.39 % (30576)------------------------------
% 0.15/0.39 % (30570)Success in time 0.012 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------