TSTP Solution File: SEU474^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU474^1 : TPTP v8.2.0. Released v3.6.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 : n032.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 03:49:03 EDT 2024
% Result : Theorem 0.13s 0.32s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 39
% Syntax : Number of formulae : 96 ( 26 unt; 31 typ; 0 def)
% Number of atoms : 681 ( 164 equ; 0 cnn)
% Maximal formula atoms : 5 ( 10 avg)
% Number of connectives : 435 ( 31 ~; 137 |; 0 &; 262 @)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 150 ( 150 >; 0 *; 0 +; 0 <<)
% Number of symbols : 40 ( 37 usr; 8 con; 0-3 aty)
% Number of variables : 53 ( 48 ^ 2 !; 2 ?; 53 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_2,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_3,type,
idem: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_4,type,
infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_5,type,
mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_6,type,
refl: ( $i > $i > $o ) > $o ).
thf(func_def_7,type,
irrefl: ( $i > $i > $o ) > $o ).
thf(func_def_8,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_9,type,
symm: ( $i > $i > $o ) > $o ).
thf(func_def_10,type,
antisymm: ( $i > $i > $o ) > $o ).
thf(func_def_11,type,
asymm: ( $i > $i > $o ) > $o ).
thf(func_def_12,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_13,type,
trans: ( $i > $i > $o ) > $o ).
thf(func_def_14,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_15,type,
trc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
trsc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_17,type,
po: ( $i > $i > $o ) > $o ).
thf(func_def_18,type,
so: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
total: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
term: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
ind: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
innf: ( $i > $i > $o ) > $i > $o ).
thf(func_def_23,type,
nfof: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_24,type,
norm: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
join: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_26,type,
lconfl: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
sconfl: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
confl: ( $i > $i > $o ) > $o ).
thf(func_def_29,type,
cr: ( $i > $i > $o ) > $o ).
thf(func_def_44,type,
sK0: $i > $i > $o ).
thf(func_def_46,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f178,plain,
$false,
inference(avatar_sat_refutation,[],[f160,f166,f170,f173,f177]) ).
thf(f177,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f176]) ).
thf(f176,plain,
( $false
| ~ spl1_1 ),
inference(trivial_inequality_removal,[],[f175]) ).
thf(f175,plain,
( ( $true = $false )
| ~ spl1_1 ),
inference(forward_demodulation,[],[f151,f136]) ).
thf(f136,plain,
( ( sK0 @ sK4 @ sK3 )
= $false ),
inference(duplicate_literal_removal,[],[f134]) ).
thf(f134,plain,
( ( ( sK0 @ sK4 @ sK3 )
= $false )
| ( ( sK0 @ sK4 @ sK3 )
= $false ) ),
inference(binary_proxy_clausification,[],[f129]) ).
thf(f129,plain,
( ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $false )
| ( ( sK0 @ sK4 @ sK3 )
= $false ) ),
inference(binary_proxy_clausification,[],[f119]) ).
thf(f119,plain,
( ( ( ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) )
= $false )
| ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f106]) ).
thf(f106,plain,
( ( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) )
= $false )
| ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f105]) ).
thf(f105,plain,
( ( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $false )
| ( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f103]) ).
thf(f103,plain,
( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) )
!= ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) ) ),
inference(beta_eta_normalization,[],[f102]) ).
thf(f102,plain,
( ( ^ [Y0: $i] :
( ( sK3 = Y0 )
| ( sK0 @ sK3 @ Y0 )
| ( sK0 @ Y0 @ sK3 ) )
@ sK4 )
!= ( ^ [Y0: $i] :
( ( sK3 = Y0 )
| ( sK0 @ sK3 @ Y0 )
| ( Y0 = sK3 )
| ( sK0 @ Y0 @ sK3 ) )
@ sK4 ) ),
inference(negative_extensionality,[],[f101]) ).
thf(f101,plain,
( ( ^ [Y0: $i] :
( ( sK3 = Y0 )
| ( sK0 @ sK3 @ Y0 )
| ( sK0 @ Y0 @ sK3 ) ) )
!= ( ^ [Y0: $i] :
( ( sK3 = Y0 )
| ( sK0 @ sK3 @ Y0 )
| ( Y0 = sK3 )
| ( sK0 @ Y0 @ sK3 ) ) ) ),
inference(beta_eta_normalization,[],[f100]) ).
thf(f100,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( Y0 = Y1 )
| ( sK0 @ Y0 @ Y1 )
| ( Y1 = Y0 )
| ( sK0 @ Y1 @ Y0 ) )
@ sK3 )
!= ( ^ [Y0: $i,Y1: $i] :
( ( Y0 = Y1 )
| ( sK0 @ Y0 @ Y1 )
| ( sK0 @ Y1 @ Y0 ) )
@ sK3 ) ),
inference(negative_extensionality,[],[f99]) ).
thf(f99,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ( Y0 = Y1 )
| ( sK0 @ Y0 @ Y1 )
| ( sK0 @ Y1 @ Y0 ) ) )
!= ( ^ [Y0: $i,Y1: $i] :
( ( Y0 = Y1 )
| ( sK0 @ Y0 @ Y1 )
| ( Y1 = Y0 )
| ( sK0 @ Y1 @ Y0 ) ) ) ),
inference(beta_eta_normalization,[],[f98]) ).
thf(f98,plain,
( ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y1 = Y2 )
| ( Y0 @ Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) )
@ sK0 ) )
!= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y1 = Y2 )
| ( Y0 @ Y1 @ Y2 ) )
@ sK0 ) ) ),
inference(definition_unfolding,[],[f92,f95,f96,f96,f95]) ).
thf(f96,plain,
( rc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y1 = Y2 )
| ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f74]) ).
thf(f74,plain,
( rc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y1 = Y2 )
| ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f73]) ).
thf(f73,plain,
( ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X1 @ X2 )
| ( X1 = X2 ) ) )
= rc ),
inference(rectify,[],[f8]) ).
thf(f8,axiom,
( ( ^ [X0: $i > $i > $o,X2: $i,X3: $i] :
( ( X0 @ X2 @ X3 )
| ( X2 = X3 ) ) )
= rc ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexive_closure) ).
thf(f95,plain,
( sc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f68]) ).
thf(f68,plain,
( sc
= ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
| ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f67]) ).
thf(f67,plain,
( sc
= ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X2 @ X1 )
| ( X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f12]) ).
thf(f12,axiom,
( sc
= ( ^ [X0: $i > $i > $o,X2: $i,X3: $i] :
( ( X0 @ X3 @ X2 )
| ( X0 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetric_closure) ).
thf(f92,plain,
( ( sc @ ( rc @ sK0 ) )
!= ( rc @ ( sc @ sK0 ) ) ),
inference(cnf_transformation,[],[f91]) ).
thf(f91,plain,
( ( sc @ ( rc @ sK0 ) )
!= ( rc @ ( sc @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f89,f90]) ).
thf(f90,plain,
( ? [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
!= ( rc @ ( sc @ X0 ) ) )
=> ( ( sc @ ( rc @ sK0 ) )
!= ( rc @ ( sc @ sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f89,plain,
? [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
!= ( rc @ ( sc @ X0 ) ) ),
inference(ennf_transformation,[],[f31]) ).
thf(f31,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
= ( rc @ ( sc @ X0 ) ) ),
inference(negated_conjecture,[],[f30]) ).
thf(f30,conjecture,
! [X0: $i > $i > $o] :
( ( sc @ ( rc @ X0 ) )
= ( rc @ ( sc @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composing_symmetric_closure_and_reflexive_closure) ).
thf(f151,plain,
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f149]) ).
thf(f149,plain,
( spl1_1
<=> ( $true
= ( sK0 @ sK4 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
thf(f173,plain,
( ~ spl1_2
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f172]) ).
thf(f172,plain,
( $false
| ~ spl1_2
| ~ spl1_4 ),
inference(trivial_inequality_removal,[],[f171]) ).
thf(f171,plain,
( ( $true = $false )
| ~ spl1_2
| ~ spl1_4 ),
inference(forward_demodulation,[],[f155,f164]) ).
thf(f164,plain,
( ( ( sK0 @ sK3 @ sK4 )
= $false )
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f162]) ).
thf(f162,plain,
( spl1_4
<=> ( ( sK0 @ sK3 @ sK4 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
thf(f155,plain,
( ( ( sK0 @ sK3 @ sK4 )
= $true )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f153]) ).
thf(f153,plain,
( spl1_2
<=> ( ( sK0 @ sK3 @ sK4 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
thf(f170,plain,
~ spl1_3,
inference(avatar_split_clause,[],[f114,f157]) ).
thf(f157,plain,
( spl1_3
<=> ( sK3 = sK4 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
thf(f114,plain,
sK3 != sK4,
inference(duplicate_literal_removal,[],[f113]) ).
thf(f113,plain,
( ( sK3 != sK4 )
| ( sK3 != sK4 ) ),
inference(equality_proxy_clausification,[],[f112]) ).
thf(f112,plain,
( ( sK3 != sK4 )
| ( ( sK3 = sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f110]) ).
thf(f110,plain,
( ( sK3 != sK4 )
| ( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f108]) ).
thf(f108,plain,
( ( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) )
= $false )
| ( sK3 != sK4 ) ),
inference(equality_proxy_clausification,[],[f107]) ).
thf(f107,plain,
( ( ( sK3 = sK4 )
= $false )
| ( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f105]) ).
thf(f166,plain,
spl1_4,
inference(avatar_split_clause,[],[f128,f162]) ).
thf(f128,plain,
( ( sK0 @ sK3 @ sK4 )
= $false ),
inference(duplicate_literal_removal,[],[f127]) ).
thf(f127,plain,
( ( ( sK0 @ sK3 @ sK4 )
= $false )
| ( ( sK0 @ sK3 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f121]) ).
thf(f121,plain,
( ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $false )
| ( ( sK0 @ sK3 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f120]) ).
thf(f120,plain,
( ( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 ) )
= $false )
| ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f106]) ).
thf(f160,plain,
( spl1_1
| spl1_2
| spl1_3 ),
inference(avatar_split_clause,[],[f147,f157,f153,f149]) ).
thf(f147,plain,
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( ( sK0 @ sK3 @ sK4 )
= $true )
| ( sK3 = sK4 ) ),
inference(duplicate_literal_removal,[],[f146]) ).
thf(f146,plain,
( ( sK3 = sK4 )
| ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( sK3 = sK4 )
| ( ( sK0 @ sK3 @ sK4 )
= $true ) ),
inference(equality_proxy_clausification,[],[f145]) ).
thf(f145,plain,
( ( ( sK3 = sK4 )
= $true )
| ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( sK3 = sK4 )
| ( ( sK0 @ sK3 @ sK4 )
= $true ) ),
inference(equality_proxy_clausification,[],[f144]) ).
thf(f144,plain,
( ( $true
= ( sK4 = sK3 ) )
| ( ( sK0 @ sK3 @ sK4 )
= $true )
| ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( ( sK3 = sK4 )
= $true ) ),
inference(duplicate_literal_removal,[],[f143]) ).
thf(f143,plain,
( ( ( sK3 = sK4 )
= $true )
| ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( ( sK0 @ sK3 @ sK4 )
= $true )
| ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $true
= ( sK4 = sK3 ) ) ),
inference(binary_proxy_clausification,[],[f142]) ).
thf(f142,plain,
( ( $true
= ( ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) ) )
| ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( ( sK0 @ sK3 @ sK4 )
= $true )
| ( ( sK3 = sK4 )
= $true ) ),
inference(duplicate_literal_removal,[],[f141]) ).
thf(f141,plain,
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( ( sK0 @ sK3 @ sK4 )
= $true )
| ( $true
= ( ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) ) )
| ( ( sK3 = sK4 )
= $true )
| ( ( sK0 @ sK3 @ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f140]) ).
thf(f140,plain,
( ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $true )
| ( $true
= ( ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) ) )
| ( ( sK3 = sK4 )
= $true )
| ( ( sK0 @ sK3 @ sK4 )
= $true ) ),
inference(duplicate_literal_removal,[],[f139]) ).
thf(f139,plain,
( ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $true )
| ( ( sK0 @ sK3 @ sK4 )
= $true )
| ( ( sK3 = sK4 )
= $true )
| ( $true
= ( ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) ) )
| ( ( sK3 = sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f138]) ).
thf(f138,plain,
( ( ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 ) )
= $true )
| ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $true )
| ( $true
= ( ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) ) )
| ( ( sK3 = sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f137]) ).
thf(f137,plain,
( ( $true
= ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) ) )
| ( ( ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) )
= $true )
| ( ( sK3 = sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f104]) ).
thf(f104,plain,
( ( $true
= ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK0 @ sK4 @ sK3 ) ) )
| ( $true
= ( ( sK3 = sK4 )
| ( sK0 @ sK3 @ sK4 )
| ( sK4 = sK3 )
| ( sK0 @ sK4 @ sK3 ) ) ) ),
inference(binary_proxy_clausification,[],[f103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SEU474^1 : TPTP v8.2.0. Released v3.6.0.
% 0.04/0.10 % 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.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 16:58:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.09/0.29 This is a TH0_THM_EQU_NAR problem
% 0.09/0.29 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.13/0.31 % (22650)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.13/0.31 % (22654)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.31 % (22652)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.31 % (22651)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.31 % (22655)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.31 % (22653)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.31 % (22656)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.31 % (22657)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.31 % (22653)Instruction limit reached!
% 0.13/0.31 % (22653)------------------------------
% 0.13/0.31 % (22653)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.31 % (22653)Termination reason: Unknown
% 0.13/0.31 % (22653)Termination phase: shuffling
% 0.13/0.31
% 0.13/0.31 % (22654)Instruction limit reached!
% 0.13/0.31 % (22654)------------------------------
% 0.13/0.31 % (22654)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.31 % (22654)Termination reason: Unknown
% 0.13/0.31 % (22654)Termination phase: shuffling
% 0.13/0.31
% 0.13/0.31 % (22654)Memory used [KB]: 1023
% 0.13/0.31 % (22654)Time elapsed: 0.003 s
% 0.13/0.31 % (22654)Instructions burned: 3 (million)
% 0.13/0.31 % (22654)------------------------------
% 0.13/0.31 % (22654)------------------------------
% 0.13/0.31 % (22653)Memory used [KB]: 1023
% 0.13/0.31 % (22653)Time elapsed: 0.003 s
% 0.13/0.31 % (22653)Instructions burned: 3 (million)
% 0.13/0.31 % (22653)------------------------------
% 0.13/0.31 % (22653)------------------------------
% 0.13/0.31 % (22657)Instruction limit reached!
% 0.13/0.31 % (22657)------------------------------
% 0.13/0.31 % (22657)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.31 % (22657)Termination reason: Unknown
% 0.13/0.31 % (22657)Termination phase: shuffling
% 0.13/0.31
% 0.13/0.31 % (22657)Memory used [KB]: 1023
% 0.13/0.31 % (22657)Time elapsed: 0.003 s
% 0.13/0.31 % (22657)Instructions burned: 3 (million)
% 0.13/0.31 % (22657)------------------------------
% 0.13/0.31 % (22657)------------------------------
% 0.13/0.31 % (22651)Instruction limit reached!
% 0.13/0.31 % (22651)------------------------------
% 0.13/0.31 % (22651)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.31 % (22651)Termination reason: Unknown
% 0.13/0.31 % (22651)Termination phase: Property scanning
% 0.13/0.31
% 0.13/0.31 % (22651)Memory used [KB]: 1023
% 0.13/0.31 % (22651)Time elapsed: 0.004 s
% 0.13/0.31 % (22651)Instructions burned: 5 (million)
% 0.13/0.31 % (22651)------------------------------
% 0.13/0.31 % (22651)------------------------------
% 0.13/0.31 % (22655)First to succeed.
% 0.13/0.32 % (22652)Also succeeded, but the first one will report.
% 0.13/0.32 % (22656)Also succeeded, but the first one will report.
% 0.13/0.32 % (22655)Refutation found. Thanks to Tanya!
% 0.13/0.32 % SZS status Theorem for theBenchmark
% 0.13/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.32 % (22655)------------------------------
% 0.13/0.32 % (22655)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.32 % (22655)Termination reason: Refutation
% 0.13/0.32
% 0.13/0.32 % (22655)Memory used [KB]: 5628
% 0.13/0.32 % (22655)Time elapsed: 0.008 s
% 0.13/0.32 % (22655)Instructions burned: 9 (million)
% 0.13/0.32 % (22655)------------------------------
% 0.13/0.32 % (22655)------------------------------
% 0.13/0.32 % (22649)Success in time 0.021 s
% 0.13/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------