TSTP Solution File: SYO376^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO376^5 : 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 : n021.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:04:13 EDT 2024
% Result : Theorem 0.23s 0.40s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of formulae : 119 ( 20 unt; 4 typ; 0 def)
% Number of atoms : 662 ( 130 equ; 0 cnn)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 466 ( 133 ~; 157 |; 10 &; 149 @)
% ( 13 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 20 usr; 18 con; 0-2 aty)
% Number of variables : 24 ( 23 ^ 0 !; 0 ?; 24 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cG: $o > $o ).
thf(func_def_1,type,
cF: $o > $o ).
thf(func_def_2,type,
cP: ( $o > $o ) > $o ).
thf(func_def_11,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f466,plain,
$false,
inference(avatar_sat_refutation,[],[f33,f39,f58,f68,f123,f135,f252,f274,f316,f390,f392,f394,f417,f426,f437,f463]) ).
thf(f463,plain,
( ~ spl0_18
| ~ spl0_19 ),
inference(avatar_contradiction_clause,[],[f462]) ).
thf(f462,plain,
( $false
| ~ spl0_18
| ~ spl0_19 ),
inference(trivial_inequality_removal,[],[f455]) ).
thf(f455,plain,
( ( $true = $false )
| ~ spl0_18
| ~ spl0_19 ),
inference(superposition,[],[f408,f386]) ).
thf(f386,plain,
( ( $true = sK5 )
| ~ spl0_18 ),
inference(avatar_component_clause,[],[f384]) ).
thf(f384,plain,
( spl0_18
<=> ( $true = sK5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_18])]) ).
thf(f408,plain,
( ( $false = sK5 )
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f406]) ).
thf(f406,plain,
( spl0_19
<=> ( $false = sK5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_19])]) ).
thf(f437,plain,
( spl0_19
| ~ spl0_1
| spl0_10
| ~ spl0_17 ),
inference(avatar_split_clause,[],[f436,f271,f99,f26,f406]) ).
thf(f26,plain,
( spl0_1
<=> ( $true
= ( cF @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f99,plain,
( spl0_10
<=> ( sK2 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).
thf(f271,plain,
( spl0_17
<=> ( $false
= ( cF @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_17])]) ).
thf(f436,plain,
( ( $false = sK5 )
| ~ spl0_1
| spl0_10
| ~ spl0_17 ),
inference(subsumption_resolution,[],[f354,f100]) ).
thf(f100,plain,
( ( sK2 != $false )
| spl0_10 ),
inference(avatar_component_clause,[],[f99]) ).
thf(f354,plain,
( ( $false = sK5 )
| ( sK2 = $false )
| ~ spl0_1
| ~ spl0_17 ),
inference(binary_proxy_clausification,[],[f352]) ).
thf(f352,plain,
( ( sK2 != sK5 )
| ~ spl0_1
| ~ spl0_17 ),
inference(trivial_inequality_removal,[],[f334]) ).
thf(f334,plain,
( ( $true = $false )
| ( sK2 != sK5 )
| ~ spl0_1
| ~ spl0_17 ),
inference(constrained_superposition,[],[f28,f273]) ).
thf(f273,plain,
( ( $false
= ( cF @ sK5 ) )
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f271]) ).
thf(f28,plain,
( ( $true
= ( cF @ sK2 ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f426,plain,
( ~ spl0_8
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f425]) ).
thf(f425,plain,
( $false
| ~ spl0_8
| ~ spl0_10 ),
inference(trivial_inequality_removal,[],[f418]) ).
thf(f418,plain,
( ( $true = $false )
| ~ spl0_8
| ~ spl0_10 ),
inference(superposition,[],[f92,f101]) ).
thf(f101,plain,
( ( sK2 = $false )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f99]) ).
thf(f92,plain,
( ( $true = sK2 )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f90]) ).
thf(f90,plain,
( spl0_8
<=> ( $true = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
thf(f417,plain,
( spl0_9
| spl0_19
| ~ spl0_4
| spl0_16 ),
inference(avatar_split_clause,[],[f328,f267,f55,f406,f95]) ).
thf(f95,plain,
( spl0_9
<=> ( $false = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
thf(f55,plain,
( spl0_4
<=> ( $true
= ( cG @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f267,plain,
( spl0_16
<=> ( $true
= ( cG @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_16])]) ).
thf(f328,plain,
( ( $false = sK3 )
| ( $false = sK5 )
| ~ spl0_4
| spl0_16 ),
inference(binary_proxy_clausification,[],[f326]) ).
thf(f326,plain,
( ( sK5 != sK3 )
| ~ spl0_4
| spl0_16 ),
inference(trivial_inequality_removal,[],[f322]) ).
thf(f322,plain,
( ( $true != $true )
| ( sK5 != sK3 )
| ~ spl0_4
| spl0_16 ),
inference(constrained_superposition,[],[f268,f57]) ).
thf(f57,plain,
( ( $true
= ( cG @ sK3 ) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f268,plain,
( ( $true
!= ( cG @ sK5 ) )
| spl0_16 ),
inference(avatar_component_clause,[],[f267]) ).
thf(f394,plain,
( spl0_8
| spl0_7
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f182,f55,f86,f90]) ).
thf(f86,plain,
( spl0_7
<=> ( $true = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
thf(f182,plain,
( ( $true = sK2 )
| ( $true = sK3 )
| ~ spl0_4 ),
inference(binary_proxy_clausification,[],[f181]) ).
thf(f181,plain,
( ( sK2 != sK3 )
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f177]) ).
thf(f177,plain,
( ( $true = $false )
| ( sK2 != sK3 )
| ~ spl0_4 ),
inference(constrained_superposition,[],[f22,f57]) ).
thf(f22,plain,
( $false
= ( cG @ sK2 ) ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f20,plain,
( ( $false
= ( cG @ sK2 ) )
| ( $false
= ( cG @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f19,plain,
( ( $false
= ( cG @ sK2 ) )
| ( ( ( cF @ sK2 )
| ( cG @ sK2 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
( ( ( cF @ sK2 )
| ( cG @ sK2 ) )
!= ( cG @ sK2 ) ),
inference(beta_eta_normalization,[],[f16]) ).
thf(f16,plain,
( ( cG @ sK2 )
!= ( ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f14]) ).
thf(f14,plain,
( cG
!= ( ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) ) ) ),
inference(trivial_inequality_removal,[],[f13]) ).
thf(f13,plain,
( ( cG
!= ( ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) ) ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f8,f9]) ).
thf(f9,plain,
( ( cP @ cG )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( ( ( cP @ cF )
= $true )
& ( ( cP
@ ^ [Y0: $o] :
( ~ ( cF @ Y0 )
| ( cG @ Y0 ) ) )
!= $true )
& ( ( cP @ cG )
= $true )
& ( $true
!= ( cP
@ ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ( $true
!= ( cP
@ ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) ) ) )
& ( ( cP
@ ^ [Y0: $o] :
( ~ ( cF @ Y0 )
| ( cG @ Y0 ) ) )
!= $true )
& ( ( cP @ cG )
= $true )
& ( ( cP @ cF )
= $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ( ( cP @ cG )
= $true )
& ( ( cP @ cF )
= $true ) )
=> ( ( $true
= ( cP
@ ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) ) ) )
| ( ( cP
@ ^ [Y0: $o] :
( ~ ( cF @ Y0 )
| ( cG @ Y0 ) ) )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ( cP @ cF )
& ( cP @ cG ) )
=> ( ( cP
@ ^ [X0: $o] :
( ( cG @ X0 )
| ~ ( cF @ X0 ) ) )
| ( cP
@ ^ [X1: $o] :
( ( cG @ X1 )
| ( cF @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ( cP @ cF )
& ( cP @ cG ) )
=> ( ( cP
@ ^ [X0: $o] :
( ( cG @ X0 )
| ~ ( cF @ X0 ) ) )
| ( cP
@ ^ [X0: $o] :
( ( cG @ X0 )
| ( cF @ X0 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ( cP @ cF )
& ( cP @ cG ) )
=> ( ( cP
@ ^ [X0: $o] :
( ( cG @ X0 )
| ~ ( cF @ X0 ) ) )
| ( cP
@ ^ [X0: $o] :
( ( cG @ X0 )
| ( cF @ X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM627) ).
thf(f8,plain,
( $true
!= ( cP
@ ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f392,plain,
( spl0_18
| spl0_8
| ~ spl0_1
| ~ spl0_17 ),
inference(avatar_split_clause,[],[f353,f271,f26,f90,f384]) ).
thf(f353,plain,
( ( $true = sK2 )
| ( $true = sK5 )
| ~ spl0_1
| ~ spl0_17 ),
inference(binary_proxy_clausification,[],[f352]) ).
thf(f390,plain,
( spl0_18
| spl0_7
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f306,f55,f86,f384]) ).
thf(f306,plain,
( ( $true = sK5 )
| ( $true = sK3 )
| ~ spl0_4 ),
inference(binary_proxy_clausification,[],[f305]) ).
thf(f305,plain,
( ( sK5 != sK3 )
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f301]) ).
thf(f301,plain,
( ( sK5 != sK3 )
| ( $true = $false )
| ~ spl0_4 ),
inference(constrained_superposition,[],[f262,f57]) ).
thf(f262,plain,
( $false
= ( cG @ sK5 ) ),
inference(duplicate_literal_removal,[],[f259]) ).
thf(f259,plain,
( ( $false
= ( cG @ sK5 ) )
| ( $false
= ( cG @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f258]) ).
thf(f258,plain,
( ( ( ~ ( cF @ sK5 )
| ( cG @ sK5 ) )
= $false )
| ( $false
= ( cG @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f256]) ).
thf(f256,plain,
( ( ~ ( cF @ sK5 )
| ( cG @ sK5 ) )
!= ( cG @ sK5 ) ),
inference(beta_eta_normalization,[],[f255]) ).
thf(f255,plain,
( ( cG @ sK5 )
!= ( ^ [Y0: $o] :
( ~ ( cF @ Y0 )
| ( cG @ Y0 ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f72]) ).
thf(f72,plain,
( cG
!= ( ^ [Y0: $o] :
( ~ ( cF @ Y0 )
| ( cG @ Y0 ) ) ) ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
( ( $true != $true )
| ( cG
!= ( ^ [Y0: $o] :
( ~ ( cF @ Y0 )
| ( cG @ Y0 ) ) ) ) ),
inference(constrained_superposition,[],[f10,f9]) ).
thf(f10,plain,
( ( cP
@ ^ [Y0: $o] :
( ~ ( cF @ Y0 )
| ( cG @ Y0 ) ) )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f316,plain,
~ spl0_16,
inference(avatar_contradiction_clause,[],[f315]) ).
thf(f315,plain,
( $false
| ~ spl0_16 ),
inference(trivial_inequality_removal,[],[f302]) ).
thf(f302,plain,
( ( $true = $false )
| ~ spl0_16 ),
inference(superposition,[],[f269,f262]) ).
thf(f269,plain,
( ( $true
= ( cG @ sK5 ) )
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f267]) ).
thf(f274,plain,
( spl0_16
| spl0_17 ),
inference(avatar_split_clause,[],[f265,f271,f267]) ).
thf(f265,plain,
( ( $true
= ( cG @ sK5 ) )
| ( $false
= ( cF @ sK5 ) ) ),
inference(not_proxy_clausification,[],[f264]) ).
thf(f264,plain,
( ( $true
= ( ~ ( cF @ sK5 ) ) )
| ( $true
= ( cG @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f263]) ).
thf(f263,plain,
( ( $true
= ( cG @ sK5 ) )
| ( $true
= ( ~ ( cF @ sK5 ) ) )
| ( $true
= ( cG @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f257]) ).
thf(f257,plain,
( ( $true
= ( cG @ sK5 ) )
| ( $true
= ( ~ ( cF @ sK5 )
| ( cG @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f256]) ).
thf(f252,plain,
( ~ spl0_8
| ~ spl0_1
| ~ spl0_5
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f247,f86,f60,f26,f90]) ).
thf(f60,plain,
( spl0_5
<=> ( ( cF @ sK3 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
thf(f247,plain,
( ( $true != sK2 )
| ~ spl0_1
| ~ spl0_5
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f244]) ).
thf(f244,plain,
( ( $true != sK2 )
| ( $true = $false )
| ~ spl0_1
| ~ spl0_5
| ~ spl0_7 ),
inference(constrained_superposition,[],[f28,f128]) ).
thf(f128,plain,
( ( ( cF @ $true )
= $false )
| ~ spl0_5
| ~ spl0_7 ),
inference(superposition,[],[f62,f88]) ).
thf(f88,plain,
( ( $true = sK3 )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f86]) ).
thf(f62,plain,
( ( ( cF @ sK3 )
= $false )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f135,plain,
( ~ spl0_7
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f134]) ).
thf(f134,plain,
( $false
| ~ spl0_7
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f129]) ).
thf(f129,plain,
( ( $true = $false )
| ~ spl0_7
| ~ spl0_9 ),
inference(superposition,[],[f97,f88]) ).
thf(f97,plain,
( ( $false = sK3 )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f95]) ).
thf(f123,plain,
( ~ spl0_3
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f122]) ).
thf(f122,plain,
( $false
| ~ spl0_3
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f110]) ).
thf(f110,plain,
( ( $true = $false )
| ~ spl0_3
| ~ spl0_5 ),
inference(superposition,[],[f62,f53]) ).
thf(f53,plain,
( ( $true
= ( cF @ sK3 ) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f51,plain,
( spl0_3
<=> ( $true
= ( cF @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f68,plain,
spl0_5,
inference(avatar_split_clause,[],[f47,f60]) ).
thf(f47,plain,
( ( cF @ sK3 )
= $false ),
inference(duplicate_literal_removal,[],[f46]) ).
thf(f46,plain,
( ( ( cF @ sK3 )
= $false )
| ( ( cF @ sK3 )
= $false ) ),
inference(binary_proxy_clausification,[],[f44]) ).
thf(f44,plain,
( ( ( cF @ sK3 )
= $false )
| ( ( ( cF @ sK3 )
| ( cG @ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f42]) ).
thf(f42,plain,
( ( ( cF @ sK3 )
| ( cG @ sK3 ) )
!= ( cF @ sK3 ) ),
inference(beta_eta_normalization,[],[f41]) ).
thf(f41,plain,
( ( ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) )
@ sK3 )
!= ( cF @ sK3 ) ),
inference(negative_extensionality,[],[f15]) ).
thf(f15,plain,
( cF
!= ( ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) ) ) ),
inference(trivial_inequality_removal,[],[f12]) ).
thf(f12,plain,
( ( $true != $true )
| ( cF
!= ( ^ [Y0: $o] :
( ( cF @ Y0 )
| ( cG @ Y0 ) ) ) ) ),
inference(constrained_superposition,[],[f8,f11]) ).
thf(f11,plain,
( ( cP @ cF )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f58,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f49,f55,f51]) ).
thf(f49,plain,
( ( $true
= ( cG @ sK3 ) )
| ( $true
= ( cF @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f48]) ).
thf(f48,plain,
( ( $true
= ( cG @ sK3 ) )
| ( $true
= ( cF @ sK3 ) )
| ( $true
= ( cF @ sK3 ) ) ),
inference(binary_proxy_clausification,[],[f43]) ).
thf(f43,plain,
( ( ( ( cF @ sK3 )
| ( cG @ sK3 ) )
= $true )
| ( $true
= ( cF @ sK3 ) ) ),
inference(binary_proxy_clausification,[],[f42]) ).
thf(f39,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f38]) ).
thf(f38,plain,
( $false
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f34]) ).
thf(f34,plain,
( ( $true = $false )
| ~ spl0_2 ),
inference(superposition,[],[f22,f32]) ).
thf(f32,plain,
( ( $true
= ( cG @ sK2 ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f30,plain,
( spl0_2
<=> ( $true
= ( cG @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f33,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f24,f30,f26]) ).
thf(f24,plain,
( ( $true
= ( cF @ sK2 ) )
| ( $true
= ( cG @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f23]) ).
thf(f23,plain,
( ( $true
= ( cF @ sK2 ) )
| ( $true
= ( cG @ sK2 ) )
| ( $true
= ( cG @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( $true
= ( cG @ sK2 ) )
| ( $true
= ( ( cF @ sK2 )
| ( cG @ sK2 ) ) ) ),
inference(binary_proxy_clausification,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO376^5 : 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.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 09:30:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.37 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.39 % (30512)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.39 % (30514)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.39 % (30515)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.39 % (30516)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.39 % (30517)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.39 % (30513)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.39 % (30518)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.39 % (30519)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.39 % (30517)Refutation not found, incomplete strategy
% 0.15/0.39 % (30517)------------------------------
% 0.15/0.39 % (30517)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30517)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39 % (30515)Refutation not found, incomplete strategy
% 0.15/0.39 % (30515)------------------------------
% 0.15/0.39 % (30515)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30515)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (30515)Memory used [KB]: 5500
% 0.15/0.39 % (30515)Time elapsed: 0.003 s
% 0.15/0.39 % (30515)Instructions burned: 1 (million)
% 0.15/0.39 % (30515)------------------------------
% 0.15/0.39 % (30515)------------------------------
% 0.15/0.39
% 0.15/0.39 % (30517)Memory used [KB]: 5500
% 0.15/0.39 % (30514)Refutation not found, incomplete strategy
% 0.15/0.39 % (30514)------------------------------
% 0.15/0.39 % (30514)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30514)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (30514)Memory used [KB]: 5500
% 0.15/0.39 % (30514)Time elapsed: 0.002 s
% 0.15/0.39 % (30514)Instructions burned: 1 (million)
% 0.15/0.39 % (30514)------------------------------
% 0.15/0.39 % (30514)------------------------------
% 0.15/0.39 % (30517)Time elapsed: 0.003 s
% 0.15/0.39 % (30517)Instructions burned: 1 (million)
% 0.15/0.39 % (30517)------------------------------
% 0.15/0.39 % (30517)------------------------------
% 0.15/0.39 % (30516)Instruction limit reached!
% 0.15/0.39 % (30516)------------------------------
% 0.15/0.39 % (30516)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30516)Termination reason: Unknown
% 0.15/0.39 % (30516)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (30516)Memory used [KB]: 5500
% 0.15/0.39 % (30516)Time elapsed: 0.004 s
% 0.15/0.39 % (30516)Instructions burned: 3 (million)
% 0.15/0.39 % (30516)------------------------------
% 0.15/0.39 % (30516)------------------------------
% 0.15/0.39 % (30513)Refutation not found, incomplete strategy
% 0.15/0.39 % (30513)------------------------------
% 0.15/0.39 % (30513)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30513)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39 % (30519)Instruction limit reached!
% 0.15/0.39 % (30519)------------------------------
% 0.15/0.39 % (30519)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30519)Termination reason: Unknown
% 0.15/0.39 % (30519)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (30519)Memory used [KB]: 5500
% 0.15/0.39 % (30519)Time elapsed: 0.004 s
% 0.15/0.39 % (30519)Instructions burned: 3 (million)
% 0.15/0.39 % (30519)------------------------------
% 0.15/0.39 % (30519)------------------------------
% 0.15/0.39
% 0.15/0.39 % (30513)Memory used [KB]: 5500
% 0.15/0.39 % (30513)Time elapsed: 0.003 s
% 0.15/0.39 % (30513)Instructions burned: 2 (million)
% 0.15/0.39 % (30513)------------------------------
% 0.15/0.39 % (30513)------------------------------
% 0.15/0.40 % (30518)Refutation not found, incomplete strategy
% 0.15/0.40 % (30518)------------------------------
% 0.15/0.40 % (30518)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (30518)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.40
% 0.15/0.40
% 0.15/0.40 % (30518)Memory used [KB]: 5500
% 0.15/0.40 % (30518)Time elapsed: 0.007 s
% 0.15/0.40 % (30518)Instructions burned: 7 (million)
% 0.15/0.40 % (30518)------------------------------
% 0.15/0.40 % (30518)------------------------------
% 0.23/0.40 % (30512)First to succeed.
% 0.23/0.40 % (30512)Refutation found. Thanks to Tanya!
% 0.23/0.40 % SZS status Theorem for theBenchmark
% 0.23/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.41 % (30512)------------------------------
% 0.23/0.41 % (30512)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41 % (30512)Termination reason: Refutation
% 0.23/0.41
% 0.23/0.41 % (30512)Memory used [KB]: 5628
% 0.23/0.41 % (30512)Time elapsed: 0.013 s
% 0.23/0.41 % (30512)Instructions burned: 14 (million)
% 0.23/0.41 % (30512)------------------------------
% 0.23/0.41 % (30512)------------------------------
% 0.23/0.41 % (30511)Success in time 0.036 s
% 0.23/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------