TSTP Solution File: SYO040^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO040^1 : TPTP v8.2.0. Released v4.0.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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:02:23 EDT 2024
% Result : Unsatisfiable 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 95 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 524 ( 81 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 446 ( 164 ~; 181 |; 0 &; 92 @)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 12 con; 0-2 aty)
% Number of variables : 1 ( 0 ^ 0 !; 0 ?; 1 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
f: $o > $o ).
thf(func_def_1,type,
h: $o > $i ).
thf(func_def_7,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f175,plain,
$false,
inference(avatar_sat_refutation,[],[f15,f24,f28,f57,f67,f69,f75,f78,f94,f103,f109,f127,f135,f163,f170,f174]) ).
thf(f174,plain,
( ~ spl0_2
| ~ spl0_4
| spl0_6
| spl0_7 ),
inference(avatar_contradiction_clause,[],[f173]) ).
thf(f173,plain,
( $false
| ~ spl0_2
| ~ spl0_4
| spl0_6
| spl0_7 ),
inference(trivial_inequality_removal,[],[f172]) ).
thf(f172,plain,
( ( $false = $true )
| ~ spl0_2
| ~ spl0_4
| spl0_6
| spl0_7 ),
inference(forward_demodulation,[],[f171,f164]) ).
thf(f164,plain,
( ( ( f @ $true )
= $false )
| ~ spl0_2
| ~ spl0_4
| spl0_6 ),
inference(subsumption_resolution,[],[f160,f51]) ).
thf(f51,plain,
( ( x != $false )
| spl0_6 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f49,plain,
( spl0_6
<=> ( x = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
thf(f160,plain,
( ( ( f @ $true )
= $false )
| ( x = $false )
| ~ spl0_2
| ~ spl0_4 ),
inference(binary_proxy_clausification,[],[f158]) ).
thf(f158,plain,
( ( x
!= ( f @ $true ) )
| ~ spl0_2
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f148]) ).
thf(f148,plain,
( ( $false = $true )
| ( x
!= ( f @ $true ) )
| ~ spl0_2
| ~ spl0_4 ),
inference(constrained_superposition,[],[f122,f14]) ).
thf(f14,plain,
( ( ( f @ x )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f12]) ).
thf(f12,plain,
( spl0_2
<=> ( ( f @ x )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f122,plain,
( ( ( f @ ( f @ $true ) )
= $false )
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_demodulation,[],[f23,f14]) ).
thf(f23,plain,
( ( ( f @ ( f @ ( f @ x ) ) )
= $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f21,plain,
( spl0_4
<=> ( ( f @ ( f @ ( f @ x ) ) )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f171,plain,
( ( ( f @ $true )
= $true )
| ~ spl0_2
| ~ spl0_4
| spl0_7 ),
inference(subsumption_resolution,[],[f153,f55]) ).
thf(f55,plain,
( ( x != $true )
| spl0_7 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl0_7
<=> ( x = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
thf(f153,plain,
( ( ( f @ $true )
= $true )
| ( x = $true )
| ~ spl0_2
| ~ spl0_4 ),
inference(binary_proxy_clausification,[],[f152]) ).
thf(f152,plain,
( ( x
!= ( f @ $true ) )
| ~ spl0_2
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f151]) ).
thf(f151,plain,
( ( x
!= ( f @ $true ) )
| ( $false = $true )
| ~ spl0_2
| ~ spl0_4 ),
inference(constrained_superposition,[],[f14,f122]) ).
thf(f170,plain,
( ~ spl0_2
| spl0_3
| ~ spl0_4
| spl0_6
| spl0_7 ),
inference(avatar_contradiction_clause,[],[f169]) ).
thf(f169,plain,
( $false
| ~ spl0_2
| spl0_3
| ~ spl0_4
| spl0_6
| spl0_7 ),
inference(trivial_inequality_removal,[],[f168]) ).
thf(f168,plain,
( ( $false = $true )
| ~ spl0_2
| spl0_3
| ~ spl0_4
| spl0_6
| spl0_7 ),
inference(forward_demodulation,[],[f167,f164]) ).
thf(f167,plain,
( ( ( f @ $true )
= $true )
| ~ spl0_2
| spl0_3
| ~ spl0_4
| spl0_7 ),
inference(subsumption_resolution,[],[f156,f55]) ).
thf(f156,plain,
( ( x = $true )
| ( ( f @ $true )
= $true )
| ~ spl0_2
| spl0_3
| ~ spl0_4 ),
inference(binary_proxy_clausification,[],[f155]) ).
thf(f155,plain,
( ( x
!= ( f @ $true ) )
| ~ spl0_2
| spl0_3
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f150]) ).
thf(f150,plain,
( ( $false != $false )
| ( x
!= ( f @ $true ) )
| ~ spl0_2
| spl0_3
| ~ spl0_4 ),
inference(constrained_superposition,[],[f18,f122]) ).
thf(f18,plain,
( ( ( f @ x )
!= $false )
| spl0_3 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f17,plain,
( spl0_3
<=> ( ( f @ x )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f163,plain,
( ~ spl0_2
| ~ spl0_4
| spl0_7
| spl0_9 ),
inference(avatar_contradiction_clause,[],[f162]) ).
thf(f162,plain,
( $false
| ~ spl0_2
| ~ spl0_4
| spl0_7
| spl0_9 ),
inference(subsumption_resolution,[],[f161,f65]) ).
thf(f65,plain,
( ( ( f @ $true )
!= $true )
| spl0_9 ),
inference(avatar_component_clause,[],[f64]) ).
thf(f64,plain,
( spl0_9
<=> ( ( f @ $true )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
thf(f161,plain,
( ( ( f @ $true )
= $true )
| ~ spl0_2
| ~ spl0_4
| spl0_7 ),
inference(subsumption_resolution,[],[f159,f55]) ).
thf(f159,plain,
( ( x = $true )
| ( ( f @ $true )
= $true )
| ~ spl0_2
| ~ spl0_4 ),
inference(binary_proxy_clausification,[],[f158]) ).
thf(f135,plain,
( ~ spl0_7
| ~ spl0_2
| spl0_9 ),
inference(avatar_split_clause,[],[f134,f64,f12,f54]) ).
thf(f134,plain,
( ( x != $true )
| ~ spl0_2
| spl0_9 ),
inference(trivial_inequality_removal,[],[f133]) ).
thf(f133,plain,
( ( x != $true )
| ( $true != $true )
| ~ spl0_2
| spl0_9 ),
inference(constrained_superposition,[],[f65,f14]) ).
thf(f127,plain,
( ~ spl0_2
| ~ spl0_4
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f126]) ).
thf(f126,plain,
( $false
| ~ spl0_2
| ~ spl0_4
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f125]) ).
thf(f125,plain,
( ( $false = $true )
| ~ spl0_2
| ~ spl0_4
| ~ spl0_9 ),
inference(backward_demodulation,[],[f66,f124]) ).
thf(f124,plain,
( ( ( f @ $true )
= $false )
| ~ spl0_2
| ~ spl0_4
| ~ spl0_9 ),
inference(backward_demodulation,[],[f122,f66]) ).
thf(f66,plain,
( ( ( f @ $true )
= $true )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f64]) ).
thf(f109,plain,
( ~ spl0_3
| ~ spl0_7
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f108]) ).
thf(f108,plain,
( $false
| ~ spl0_3
| ~ spl0_7
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f107]) ).
thf(f107,plain,
( ( $false = $true )
| ~ spl0_3
| ~ spl0_7
| ~ spl0_9 ),
inference(backward_demodulation,[],[f66,f106]) ).
thf(f106,plain,
( ( ( f @ $true )
= $false )
| ~ spl0_3
| ~ spl0_7 ),
inference(backward_demodulation,[],[f19,f56]) ).
thf(f56,plain,
( ( x = $true )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f19,plain,
( ( ( f @ x )
= $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f103,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f102]) ).
thf(f102,plain,
( $false
| ~ spl0_1
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f101]) ).
thf(f101,plain,
( ( $false = $true )
| ~ spl0_1
| ~ spl0_4 ),
inference(backward_demodulation,[],[f10,f23]) ).
thf(f10,plain,
( ( ( f @ ( f @ ( f @ x ) ) )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f8]) ).
thf(f8,plain,
( spl0_1
<=> ( ( f @ ( f @ ( f @ x ) ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f94,plain,
( ~ spl0_6
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f93]) ).
thf(f93,plain,
( $false
| ~ spl0_6
| ~ spl0_8 ),
inference(trivial_inequality_removal,[],[f92]) ).
thf(f92,plain,
( ( ( h @ $false )
!= ( h @ $false ) )
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_demodulation,[],[f91,f61]) ).
thf(f61,plain,
( ( $false
= ( f @ $false ) )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f59,plain,
( spl0_8
<=> ( $false
= ( f @ $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
thf(f91,plain,
( ( ( h @ $false )
!= ( h @ ( f @ $false ) ) )
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_demodulation,[],[f90,f61]) ).
thf(f90,plain,
( ( ( h @ $false )
!= ( h @ ( f @ ( f @ $false ) ) ) )
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_demodulation,[],[f89,f61]) ).
thf(f89,plain,
( ( ( h @ ( f @ $false ) )
!= ( h @ ( f @ ( f @ ( f @ $false ) ) ) ) )
| ~ spl0_6 ),
inference(forward_demodulation,[],[f3,f50]) ).
thf(f50,plain,
( ( x = $false )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f3,plain,
( ( h @ ( f @ ( f @ ( f @ x ) ) ) )
!= ( h @ ( f @ x ) ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
( ( h @ ( f @ ( f @ ( f @ x ) ) ) )
!= ( h @ ( f @ x ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',2) ).
thf(f78,plain,
( ~ spl0_5
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f77]) ).
thf(f77,plain,
( $false
| ~ spl0_5
| ~ spl0_8 ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ( $false = $true )
| ~ spl0_5
| ~ spl0_8 ),
inference(backward_demodulation,[],[f47,f61]) ).
thf(f47,plain,
( ( ( f @ $false )
= $true )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f45,plain,
( spl0_5
<=> ( ( f @ $false )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
thf(f75,plain,
( spl0_8
| ~ spl0_3
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f72,f49,f17,f59]) ).
thf(f72,plain,
( ( $false
= ( f @ $false ) )
| ~ spl0_3
| ~ spl0_6 ),
inference(backward_demodulation,[],[f19,f50]) ).
thf(f69,plain,
( spl0_8
| spl0_6
| ~ spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f40,f17,f8,f49,f59]) ).
thf(f40,plain,
( ( x = $false )
| ( $false
= ( f @ $false ) )
| ~ spl0_1
| ~ spl0_3 ),
inference(binary_proxy_clausification,[],[f38]) ).
thf(f38,plain,
( ( x
!= ( f @ $false ) )
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f37]) ).
thf(f37,plain,
( ( x
!= ( f @ $false ) )
| ( $false = $true )
| ~ spl0_1
| ~ spl0_3 ),
inference(constrained_superposition,[],[f19,f31]) ).
thf(f31,plain,
( ( $true
= ( f @ ( f @ $false ) ) )
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_demodulation,[],[f10,f19]) ).
thf(f67,plain,
( spl0_9
| ~ spl0_8
| ~ spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f34,f17,f8,f59,f64]) ).
thf(f34,plain,
( ( ( f @ $true )
= $true )
| ( $false
!= ( f @ $false ) )
| ~ spl0_1
| ~ spl0_3 ),
inference(constrained_superposition,[],[f31,f31]) ).
thf(f57,plain,
( spl0_5
| spl0_7
| ~ spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f42,f17,f8,f54,f45]) ).
thf(f42,plain,
( ( ( f @ $false )
= $true )
| ( x = $true )
| ~ spl0_1
| ~ spl0_3 ),
inference(binary_proxy_clausification,[],[f41]) ).
thf(f41,plain,
( ( x
!= ( f @ $false ) )
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f36,plain,
( ( $false = $true )
| ( x
!= ( f @ $false ) )
| ~ spl0_1
| ~ spl0_3 ),
inference(constrained_superposition,[],[f31,f19]) ).
thf(f28,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f27]) ).
thf(f27,plain,
( $false
| ~ spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f26]) ).
thf(f26,plain,
( ( $false = $true )
| ~ spl0_2
| ~ spl0_3 ),
inference(backward_demodulation,[],[f14,f19]) ).
thf(f24,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f6,f21,f17]) ).
thf(f6,plain,
( ( ( f @ ( f @ ( f @ x ) ) )
= $false )
| ( ( f @ x )
= $false ) ),
inference(binary_proxy_clausification,[],[f4]) ).
thf(f4,plain,
( ( f @ x )
!= ( f @ ( f @ ( f @ x ) ) ) ),
inference(equality_resolution,[],[f3]) ).
thf(f15,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f5,f12,f8]) ).
thf(f5,plain,
( ( ( f @ x )
= $true )
| ( ( f @ ( f @ ( f @ x ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO040^1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 11:33:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_UNS_EQU_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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.38 % (14088)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.15/0.38 % (14089)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 (3000ds/4Mi)
% 0.15/0.38 % (14090)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 (3000ds/27Mi)
% 0.15/0.38 % (14091)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38 % (14092)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 (3000ds/2Mi)
% 0.15/0.38 % (14094)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.38 % (14093)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 (3000ds/275Mi)
% 0.15/0.38 % (14095)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.15/0.38 % (14093)Refutation not found, incomplete strategy
% 0.15/0.38 % (14093)------------------------------
% 0.15/0.38 % (14093)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14092)Refutation not found, incomplete strategy
% 0.15/0.38 % (14092)------------------------------
% 0.15/0.38 % (14092)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14092)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (14092)Memory used [KB]: 5373
% 0.15/0.38 % (14092)Time elapsed: 0.003 s
% 0.15/0.38 % (14092)Instructions burned: 1 (million)
% 0.15/0.38 % (14092)------------------------------
% 0.15/0.38 % (14092)------------------------------
% 0.15/0.38 % (14091)Refutation not found, incomplete strategy
% 0.15/0.38 % (14091)------------------------------
% 0.15/0.38 % (14091)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14091)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (14091)Memory used [KB]: 5373
% 0.15/0.38 % (14091)Time elapsed: 0.003 s
% 0.15/0.38 % (14091)Instructions burned: 1 (million)
% 0.15/0.38 % (14091)------------------------------
% 0.15/0.38 % (14091)------------------------------
% 0.15/0.38 % (14090)Refutation not found, incomplete strategy
% 0.15/0.38 % (14090)------------------------------
% 0.15/0.38 % (14090)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14090)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (14090)Memory used [KB]: 5373
% 0.15/0.38 % (14090)Time elapsed: 0.003 s
% 0.15/0.38 % (14090)Instructions burned: 1 (million)
% 0.15/0.38 % (14090)------------------------------
% 0.15/0.38 % (14090)------------------------------
% 0.15/0.38 % (14093)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (14093)Memory used [KB]: 5373
% 0.15/0.38 % (14093)Time elapsed: 0.002 s
% 0.15/0.38 % (14093)Instructions burned: 1 (million)
% 0.15/0.38 % (14093)------------------------------
% 0.15/0.38 % (14093)------------------------------
% 0.15/0.38 % (14095)Refutation not found, incomplete strategy
% 0.15/0.38 % (14095)------------------------------
% 0.15/0.38 % (14095)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14095)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (14095)Memory used [KB]: 5373
% 0.15/0.38 % (14095)Time elapsed: 0.003 s
% 0.15/0.38 % (14095)Instructions burned: 1 (million)
% 0.15/0.38 % (14095)------------------------------
% 0.15/0.38 % (14095)------------------------------
% 0.15/0.38 % (14089)Instruction limit reached!
% 0.15/0.38 % (14089)------------------------------
% 0.15/0.38 % (14089)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14089)Termination reason: Unknown
% 0.15/0.38 % (14089)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (14089)Memory used [KB]: 5500
% 0.15/0.38 % (14089)Time elapsed: 0.006 s
% 0.15/0.38 % (14089)Instructions burned: 5 (million)
% 0.15/0.38 % (14089)------------------------------
% 0.15/0.38 % (14089)------------------------------
% 0.15/0.38 % (14094)First to succeed.
% 0.15/0.39 % (14094)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (14094)------------------------------
% 0.15/0.39 % (14094)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (14094)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (14094)Memory used [KB]: 5500
% 0.15/0.39 % (14094)Time elapsed: 0.009 s
% 0.15/0.39 % (14094)Instructions burned: 8 (million)
% 0.15/0.39 % (14094)------------------------------
% 0.15/0.39 % (14094)------------------------------
% 0.15/0.39 % (14087)Success in time 0.01 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------