TSTP Solution File: SYO041^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO041^2 : TPTP v8.2.0. Released v4.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 : n018.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:24 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 44
% Syntax : Number of formulae : 118 ( 19 unt; 2 typ; 0 def)
% Number of atoms : 711 ( 176 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 277 ( 34 ~; 119 |; 9 &; 92 @)
% ( 23 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 36 ( 33 usr; 33 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
f: $o > $o ).
thf(func_def_2,type,
g: $o > $o ).
thf(f198,plain,
$false,
inference(avatar_sat_refutation,[],[f75,f84,f93,f98,f107,f112,f117,f118,f127,f141,f151,f156,f157,f158,f163,f168,f169,f170,f171,f172,f177,f179,f181,f183,f184,f186,f187,f188,f189,f190,f191,f192,f193,f194,f195,f197]) ).
thf(f197,plain,
( ( ( g @ $true )
!= $false )
| ( $false
!= ( f @ $true ) )
| ( $true
!= ( f @ $true ) )
| ( ( g @ $true )
= $true ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f195,plain,
( ( ( g @ $true )
!= $false )
| ( ( g @ $true )
!= $true )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f194,plain,
( ( sF1 != $true )
| ( sF1 != $false )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f193,plain,
( ( y != $true )
| ( y != $false )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f192,plain,
( ( $true
!= ( g @ $false ) )
| ( ( g @ $false )
!= $false )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f191,plain,
( ( $true != sF5 )
| ( sF5 != $false )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f190,plain,
( ( ( f @ $false )
!= $true )
| ( ( f @ $false )
!= $false )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f189,plain,
( ( $true != sF3 )
| ( sF3 != $false )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f188,plain,
( ( $true != sF4 )
| ( sF4 != $false )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f187,plain,
( ( $true != sF0 )
| ( $false != sF0 )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f186,plain,
( ( $true != sF2 )
| ( $false != sF2 )
| ( $true = $false ) ),
introduced(theory_tautology_sat_conflict,[]) ).
thf(f184,plain,
( spl6_19
| spl6_18
| spl6_3 ),
inference(avatar_split_clause,[],[f23,f72,f143,f148]) ).
thf(f148,plain,
( spl6_19
<=> ( y = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_19])]) ).
thf(f143,plain,
( spl6_18
<=> ( $true
= ( g @ $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_18])]) ).
thf(f72,plain,
( spl6_3
<=> ( $false = sF0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
thf(f23,plain,
( ( y = $true )
| ( $false = sF0 )
| ( $true
= ( g @ $false ) ) ),
inference(binary_proxy_clausification,[],[f22]) ).
thf(f22,plain,
( ( y = $true )
| ( ( g @ $false )
= sF0 ) ),
inference(cases_simplifying,[],[f12]) ).
thf(f12,plain,
( ( g @ y )
= sF0 ),
introduced(function_definition,[]) ).
thf(f183,plain,
( spl6_15
| spl6_6
| spl6_20 ),
inference(avatar_split_clause,[],[f26,f153,f86,f129]) ).
thf(f129,plain,
( spl6_15
<=> ( ( g @ $true )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_15])]) ).
thf(f86,plain,
( spl6_6
<=> ( $true = sF0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
thf(f153,plain,
( spl6_20
<=> ( y = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_20])]) ).
thf(f26,plain,
( ( $true = sF0 )
| ( y = $false )
| ( ( g @ $true )
= $false ) ),
inference(binary_proxy_clausification,[],[f21]) ).
thf(f21,plain,
( ( y = $false )
| ( ( g @ $true )
= sF0 ) ),
inference(cases_simplifying,[],[f12]) ).
thf(f181,plain,
( spl6_18
| spl6_6
| spl6_21 ),
inference(avatar_split_clause,[],[f30,f160,f86,f143]) ).
thf(f160,plain,
( spl6_21
<=> ( sF1 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_21])]) ).
thf(f30,plain,
( ( $true
= ( g @ $false ) )
| ( sF1 = $false )
| ( $true = sF0 ) ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f28,plain,
( ( $true = sF0 )
| ( sF1
= ( g @ $false ) ) ),
inference(cases_simplifying,[],[f13]) ).
thf(f13,plain,
( ( g @ sF0 )
= sF1 ),
introduced(function_definition,[]) ).
thf(f179,plain,
( spl6_15
| spl6_22
| spl6_3 ),
inference(avatar_split_clause,[],[f32,f72,f165,f129]) ).
thf(f165,plain,
( spl6_22
<=> ( sF1 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_22])]) ).
thf(f32,plain,
( ( $false = sF0 )
| ( ( g @ $true )
= $false )
| ( sF1 = $true ) ),
inference(binary_proxy_clausification,[],[f27]) ).
thf(f27,plain,
( ( ( g @ $true )
= sF1 )
| ( $false = sF0 ) ),
inference(cases_simplifying,[],[f13]) ).
thf(f177,plain,
~ spl6_23,
inference(avatar_split_clause,[],[f3,f174]) ).
thf(f174,plain,
( spl6_23
<=> ( $true = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_23])]) ).
thf(f3,plain,
$true != $false,
introduced(fool_axiom,[]) ).
thf(f172,plain,
( spl6_2
| spl6_8
| spl6_12 ),
inference(avatar_split_clause,[],[f36,f114,f95,f68]) ).
thf(f68,plain,
( spl6_2
<=> ( $true = sF2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
thf(f95,plain,
( spl6_8
<=> ( ( f @ $false )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).
thf(f114,plain,
( spl6_12
<=> ( $true = sF3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_12])]) ).
thf(f36,plain,
( ( ( f @ $false )
= $false )
| ( $true = sF2 )
| ( $true = sF3 ) ),
inference(binary_proxy_clausification,[],[f34]) ).
thf(f34,plain,
( ( $true = sF2 )
| ( ( f @ $false )
= sF3 ) ),
inference(cases_simplifying,[],[f16]) ).
thf(f16,plain,
( ( f @ sF2 )
= sF3 ),
introduced(function_definition,[]) ).
thf(f171,plain,
( spl6_7
| spl6_2
| spl6_9 ),
inference(avatar_split_clause,[],[f35,f100,f68,f90]) ).
thf(f90,plain,
( spl6_7
<=> ( ( f @ $false )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
thf(f100,plain,
( spl6_9
<=> ( sF3 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_9])]) ).
thf(f35,plain,
( ( sF3 = $false )
| ( ( f @ $false )
= $true )
| ( $true = sF2 ) ),
inference(binary_proxy_clausification,[],[f34]) ).
thf(f170,plain,
( spl6_4
| spl6_9
| spl6_5 ),
inference(avatar_split_clause,[],[f38,f81,f100,f77]) ).
thf(f77,plain,
( spl6_4
<=> ( $true
= ( f @ $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
thf(f81,plain,
( spl6_5
<=> ( $false = sF2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
thf(f38,plain,
( ( sF3 = $false )
| ( $true
= ( f @ $true ) )
| ( $false = sF2 ) ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f33,plain,
( ( $false = sF2 )
| ( sF3
= ( f @ $true ) ) ),
inference(cases_simplifying,[],[f16]) ).
thf(f169,plain,
( spl6_1
| spl6_5
| spl6_12 ),
inference(avatar_split_clause,[],[f37,f114,f81,f64]) ).
thf(f64,plain,
( spl6_1
<=> ( $false
= ( f @ $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
thf(f37,plain,
( ( $false
= ( f @ $true ) )
| ( $true = sF3 )
| ( $false = sF2 ) ),
inference(binary_proxy_clausification,[],[f33]) ).
thf(f168,plain,
( spl6_22
| spl6_20 ),
inference(avatar_split_clause,[],[f40,f153,f165]) ).
thf(f40,plain,
( ( y = $false )
| ( sF1 = $true ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
y = sF1,
inference(definition_folding,[],[f9,f13,f12]) ).
thf(f9,plain,
( y
= ( g @ ( g @ y ) ) ),
inference(definition_unfolding,[],[f6,f5]) ).
thf(f5,plain,
( x
= ( g @ y ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f4,plain,
( ( ( f @ ( f @ ( f @ x ) ) )
= ( g @ ( f @ x ) ) )
& ( x != y )
& ( y
= ( g @ x ) )
& ( x
= ( g @ y ) ) ),
inference(flattening,[],[f2]) ).
thf(f2,negated_conjecture,
~ ~ ( ( ( f @ ( f @ ( f @ x ) ) )
= ( g @ ( f @ x ) ) )
& ( x != y )
& ( y
= ( g @ x ) )
& ( x
= ( g @ y ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
~ ( ( ( f @ ( f @ ( f @ x ) ) )
= ( g @ ( f @ x ) ) )
& ( x != y )
& ( y
= ( g @ x ) )
& ( x
= ( g @ y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',3) ).
thf(f6,plain,
( y
= ( g @ x ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f163,plain,
( spl6_21
| spl6_19 ),
inference(avatar_split_clause,[],[f39,f148,f160]) ).
thf(f39,plain,
( ( y = $true )
| ( sF1 = $false ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f158,plain,
( spl6_13
| spl6_10 ),
inference(avatar_split_clause,[],[f42,f104,f120]) ).
thf(f120,plain,
( spl6_13
<=> ( sF5 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_13])]) ).
thf(f104,plain,
( spl6_10
<=> ( $true = sF4 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_10])]) ).
thf(f42,plain,
( ( $true = sF4 )
| ( sF5 = $false ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f19,plain,
sF5 = sF4,
inference(definition_folding,[],[f10,f18,f15,f12,f17,f16,f15,f12]) ).
thf(f17,plain,
( ( f @ sF3 )
= sF4 ),
introduced(function_definition,[]) ).
thf(f15,plain,
( ( f @ sF0 )
= sF2 ),
introduced(function_definition,[]) ).
thf(f18,plain,
( sF5
= ( g @ sF2 ) ),
introduced(function_definition,[]) ).
thf(f10,plain,
( ( f @ ( f @ ( f @ ( g @ y ) ) ) )
= ( g @ ( f @ ( g @ y ) ) ) ),
inference(definition_unfolding,[],[f8,f5,f5]) ).
thf(f8,plain,
( ( f @ ( f @ ( f @ x ) ) )
= ( g @ ( f @ x ) ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f157,plain,
( spl6_16
| spl6_11 ),
inference(avatar_split_clause,[],[f41,f109,f133]) ).
thf(f133,plain,
( spl6_16
<=> ( $true = sF5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_16])]) ).
thf(f109,plain,
( spl6_11
<=> ( sF4 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_11])]) ).
thf(f41,plain,
( ( $true = sF5 )
| ( sF4 = $false ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f156,plain,
( spl6_3
| spl6_20 ),
inference(avatar_split_clause,[],[f44,f153,f72]) ).
thf(f44,plain,
( ( y = $false )
| ( $false = sF0 ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f20,plain,
y != sF0,
inference(definition_folding,[],[f11,f12]) ).
thf(f11,plain,
( y
!= ( g @ y ) ),
inference(definition_unfolding,[],[f7,f5]) ).
thf(f7,plain,
x != y,
inference(cnf_transformation,[],[f4]) ).
thf(f151,plain,
( spl6_19
| spl6_6 ),
inference(avatar_split_clause,[],[f43,f86,f148]) ).
thf(f43,plain,
( ( $true = sF0 )
| ( y = $true ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f141,plain,
( spl6_17
| spl6_16
| spl6_2 ),
inference(avatar_split_clause,[],[f47,f68,f133,f138]) ).
thf(f138,plain,
( spl6_17
<=> ( ( g @ $false )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_17])]) ).
thf(f47,plain,
( ( ( g @ $false )
= $false )
| ( $true = sF2 )
| ( $true = sF5 ) ),
inference(binary_proxy_clausification,[],[f46]) ).
thf(f46,plain,
( ( $true = sF2 )
| ( sF5
= ( g @ $false ) ) ),
inference(cases_simplifying,[],[f18]) ).
thf(f127,plain,
( spl6_5
| spl6_13
| spl6_14 ),
inference(avatar_split_clause,[],[f49,f124,f120,f81]) ).
thf(f124,plain,
( spl6_14
<=> ( ( g @ $true )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_14])]) ).
thf(f49,plain,
( ( $false = sF2 )
| ( sF5 = $false )
| ( ( g @ $true )
= $true ) ),
inference(binary_proxy_clausification,[],[f45]) ).
thf(f45,plain,
( ( $false = sF2 )
| ( ( g @ $true )
= sF5 ) ),
inference(cases_simplifying,[],[f18]) ).
thf(f118,plain,
( spl6_10
| spl6_8
| spl6_12 ),
inference(avatar_split_clause,[],[f54,f114,f95,f104]) ).
thf(f54,plain,
( ( $true = sF3 )
| ( $true = sF4 )
| ( ( f @ $false )
= $false ) ),
inference(binary_proxy_clausification,[],[f52]) ).
thf(f52,plain,
( ( ( f @ $false )
= sF4 )
| ( $true = sF3 ) ),
inference(cases_simplifying,[],[f17]) ).
thf(f117,plain,
( spl6_7
| spl6_11
| spl6_12 ),
inference(avatar_split_clause,[],[f53,f114,f109,f90]) ).
thf(f53,plain,
( ( $true = sF3 )
| ( sF4 = $false )
| ( ( f @ $false )
= $true ) ),
inference(binary_proxy_clausification,[],[f52]) ).
thf(f112,plain,
( spl6_11
| spl6_9
| spl6_4 ),
inference(avatar_split_clause,[],[f56,f77,f100,f109]) ).
thf(f56,plain,
( ( $true
= ( f @ $true ) )
| ( sF3 = $false )
| ( sF4 = $false ) ),
inference(binary_proxy_clausification,[],[f51]) ).
thf(f51,plain,
( ( sF3 = $false )
| ( sF4
= ( f @ $true ) ) ),
inference(cases_simplifying,[],[f17]) ).
thf(f107,plain,
( spl6_9
| spl6_1
| spl6_10 ),
inference(avatar_split_clause,[],[f55,f104,f64,f100]) ).
thf(f55,plain,
( ( sF3 = $false )
| ( $false
= ( f @ $true ) )
| ( $true = sF4 ) ),
inference(binary_proxy_clausification,[],[f51]) ).
thf(f98,plain,
( spl6_8
| spl6_2
| spl6_6 ),
inference(avatar_split_clause,[],[f60,f86,f68,f95]) ).
thf(f60,plain,
( ( $true = sF0 )
| ( $true = sF2 )
| ( ( f @ $false )
= $false ) ),
inference(binary_proxy_clausification,[],[f58]) ).
thf(f58,plain,
( ( $true = sF0 )
| ( ( f @ $false )
= sF2 ) ),
inference(cases_simplifying,[],[f15]) ).
thf(f93,plain,
( spl6_5
| spl6_6
| spl6_7 ),
inference(avatar_split_clause,[],[f59,f90,f86,f81]) ).
thf(f59,plain,
( ( ( f @ $false )
= $true )
| ( $true = sF0 )
| ( $false = sF2 ) ),
inference(binary_proxy_clausification,[],[f58]) ).
thf(f84,plain,
( spl6_4
| spl6_3
| spl6_5 ),
inference(avatar_split_clause,[],[f62,f81,f72,f77]) ).
thf(f62,plain,
( ( $false = sF2 )
| ( $false = sF0 )
| ( $true
= ( f @ $true ) ) ),
inference(binary_proxy_clausification,[],[f57]) ).
thf(f57,plain,
( ( $false = sF0 )
| ( sF2
= ( f @ $true ) ) ),
inference(cases_simplifying,[],[f15]) ).
thf(f75,plain,
( spl6_1
| spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f61,f72,f68,f64]) ).
thf(f61,plain,
( ( $true = sF2 )
| ( $false = sF0 )
| ( $false
= ( f @ $true ) ) ),
inference(binary_proxy_clausification,[],[f57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO041^2 : TPTP v8.2.0. Released v4.1.0.
% 0.07/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.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:45:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.38 % (22149)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.14/0.38 % (22147)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.14/0.38 % (22150)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (22151)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.14/0.38 % (22154)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.14/0.38 % (22148)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.14/0.38 % (22153)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.38 % (22152)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.14/0.38 % (22151)Instruction limit reached!
% 0.14/0.38 % (22151)------------------------------
% 0.14/0.38 % (22151)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (22151)Termination reason: Unknown
% 0.14/0.38 % (22151)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (22151)Memory used [KB]: 5373
% 0.14/0.38 % (22151)Time elapsed: 0.003 s
% 0.14/0.38 % (22151)Instructions burned: 2 (million)
% 0.14/0.38 % (22151)------------------------------
% 0.14/0.38 % (22151)------------------------------
% 0.14/0.38 % (22150)Instruction limit reached!
% 0.14/0.38 % (22150)------------------------------
% 0.14/0.38 % (22150)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (22150)Termination reason: Unknown
% 0.14/0.38 % (22150)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (22150)Memory used [KB]: 5500
% 0.14/0.38 % (22150)Time elapsed: 0.004 s
% 0.14/0.38 % (22150)Instructions burned: 3 (million)
% 0.14/0.38 % (22150)------------------------------
% 0.14/0.38 % (22150)------------------------------
% 0.14/0.38 % (22154)Refutation not found, incomplete strategy
% 0.14/0.38 % (22154)------------------------------
% 0.14/0.38 % (22154)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (22149)Refutation not found, incomplete strategy
% 0.14/0.38 % (22149)------------------------------
% 0.14/0.38 % (22149)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (22149)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (22149)Memory used [KB]: 5500
% 0.14/0.38 % (22149)Time elapsed: 0.004 s
% 0.14/0.38 % (22149)Instructions burned: 2 (million)
% 0.14/0.38 % (22149)------------------------------
% 0.14/0.38 % (22149)------------------------------
% 0.14/0.38 % (22154)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (22154)Memory used [KB]: 5500
% 0.14/0.38 % (22154)Time elapsed: 0.004 s
% 0.14/0.38 % (22152)Refutation not found, incomplete strategy
% 0.14/0.38 % (22152)------------------------------
% 0.14/0.38 % (22152)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (22154)Instructions burned: 2 (million)
% 0.14/0.38 % (22154)------------------------------
% 0.14/0.38 % (22154)------------------------------
% 0.14/0.38 % (22152)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (22152)Memory used [KB]: 5500
% 0.14/0.38 % (22152)Time elapsed: 0.004 s
% 0.14/0.38 % (22152)Instructions burned: 3 (million)
% 0.14/0.38 % (22152)------------------------------
% 0.14/0.38 % (22152)------------------------------
% 0.14/0.38 % (22148)Instruction limit reached!
% 0.14/0.38 % (22148)------------------------------
% 0.14/0.38 % (22148)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (22148)Termination reason: Unknown
% 0.14/0.38 % (22148)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (22148)Memory used [KB]: 5500
% 0.14/0.38 % (22148)Time elapsed: 0.005 s
% 0.14/0.38 % (22148)Instructions burned: 4 (million)
% 0.14/0.38 % (22148)------------------------------
% 0.14/0.38 % (22148)------------------------------
% 0.14/0.38 % (22153)Refutation not found, incomplete strategy
% 0.14/0.38 % (22153)------------------------------
% 0.14/0.38 % (22153)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (22153)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (22153)Memory used [KB]: 5500
% 0.14/0.38 % (22153)Time elapsed: 0.008 s
% 0.14/0.38 % (22153)Instructions burned: 9 (million)
% 0.14/0.38 % (22153)------------------------------
% 0.14/0.38 % (22153)------------------------------
% 0.14/0.39 % (22155)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.39 % (22156)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.14/0.39 % (22157)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.40 % (22158)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.14/0.40 % (22159)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.14/0.40 % (22160)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.14/0.40 % (22157)Refutation not found, incomplete strategy
% 0.14/0.40 % (22157)------------------------------
% 0.14/0.40 % (22157)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (22157)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 % (22157)Memory used [KB]: 5500
% 0.14/0.40 % (22157)Time elapsed: 0.024 s
% 0.14/0.40 % (22157)Instructions burned: 2 (million)
% 0.14/0.40 % (22157)------------------------------
% 0.14/0.40 % (22157)------------------------------
% 0.14/0.40 % (22160)First to succeed.
% 0.14/0.40 % (22159)Instruction limit reached!
% 0.14/0.40 % (22159)------------------------------
% 0.14/0.40 % (22159)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (22159)Termination reason: Unknown
% 0.14/0.40 % (22159)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (22159)Memory used [KB]: 1023
% 0.14/0.40 % (22159)Time elapsed: 0.007 s
% 0.14/0.40 % (22159)Instructions burned: 8 (million)
% 0.14/0.40 % (22159)------------------------------
% 0.14/0.40 % (22159)------------------------------
% 0.14/0.40 % (22160)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (22160)------------------------------
% 0.14/0.40 % (22160)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (22160)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (22160)Memory used [KB]: 5500
% 0.14/0.40 % (22160)Time elapsed: 0.005 s
% 0.14/0.40 % (22160)Instructions burned: 3 (million)
% 0.14/0.40 % (22160)------------------------------
% 0.14/0.40 % (22160)------------------------------
% 0.14/0.40 % (22146)Success in time 0.045 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------