%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL977_1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:57:23 AM UTC 2026
% Result : Theorem 3.85s 1.52s
% Output : Refutation 5.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 124 ( 22 unt; 0 typ; 14 def)
% Number of atoms : 589 ( 121 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 279 ( 118 ~; 126 |; 15 &)
% ( 19 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 400 ( 308 fml; 92 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 23 ( 20 usr; 15 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 100 ( 0 sgn 97 !; 3 ?; 100 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_3,type,
bG0: $o > $o ).
tff(func_def_4,type,
bG1: $o > $o ).
tff(func_def_5,type,
bG2: ( $i * $i * $i ) > $o ).
tff(func_def_6,type,
bG3: ( $i * $i ) > $o ).
tff(pred_def_1,type,
imply: ( $o * $o ) > $o ).
tff(f1,axiom,
! [X0: $o,X1: $o] :
( ( imply((X0),(X1)) = ( ~ (X0) ) )
| (X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',imply_definition) ).
tff(f2,axiom,
! [X0: $i,X1: $i] :
( p(X0,X1)
=> ( f(X0) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',graph_impl) ).
tff(f3,conjecture,
! [X0: $i,X1: $i,X2: $i] :
imply(( p(X0,X1)
& p(X0,X2) ),X1 = X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',graph_conjecture) ).
tff(f4,negated_conjecture,
~ ! [X0: $i,X1: $i,X2: $i] :
imply(( p(X0,X1)
& p(X0,X2) ),X1 = X2),
inference(negated_conjecture,[status(cth)],[f3]) ).
tff(f5,plain,
! [X0: $o,X1: $o] :
( ( imply((X0),(X1)) = ( ~ (X0) ) )
| (X1) ),
inference(rectify,[],[f1]) ).
tff(f6,definition,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG0((X0)) ) ),
introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition]) ).
tff(f7,definition,
! [X1: $o] :
( ( $true = (X1) )
<=> ( $true = bG1((X1)) ) ),
introduced(definition,[new_symbols(definition,[bG1])],[fool_formula_definition]) ).
tff(f8,plain,
! [X0: $o,X1: $o] :
( imply(bG0((X0)),bG1((X1)))
<=> ( ( $true != (X0) )
| ( $true = (X1) ) ) ),
inference(fool_elimination,[],[f5,f7,f6]) ).
tff(f9,definition,
! [X1: $i,X0: $i,X2: $i] :
( ( p(X0,X1)
& p(X0,X2) )
<=> ( $true = bG2(X1,X0,X2) ) ),
introduced(definition,[new_symbols(definition,[bG2])],[fool_formula_definition]) ).
tff(f10,definition,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
<=> ( $true = bG3(X2,X1) ) ),
introduced(definition,[new_symbols(definition,[bG3])],[fool_formula_definition]) ).
tff(f11,plain,
~ ! [X0: $i,X1: $i,X2: $i] : imply(bG2(X1,X0,X2),bG3(X2,X1)),
inference(fool_elimination,[],[f4,f10,f9]) ).
tff(f12,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
<=> ( $true = bG3(X0,X1) ) ),
inference(rectify,[],[f10]) ).
tff(f13,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( p(X1,X0)
& p(X1,X2) )
<=> ( $true = bG2(X0,X1,X2) ) ),
inference(rectify,[],[f9]) ).
tff(f14,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG1((X0)) ) ),
inference(rectify,[],[f7]) ).
tff(f15,plain,
! [X0: $o,X1: $o] :
( imply(bG0((X0)),bG1((X1)))
<=> ( ( $true != (X0) )
| ( $true = (X1) ) ) ),
inference(flattening,[],[f8]) ).
tff(f16,plain,
! [X0: $i,X1: $i] :
( ( f(X0) = X1 )
| ~ p(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
tff(f17,plain,
? [X0: $i,X1: $i,X2: $i] : ~ imply(bG2(X1,X0,X2),bG3(X2,X1)),
inference(ennf_transformation,[],[f11]) ).
tff(f18,plain,
! [X0: $i,X1: $i] :
( ( ( X0 = X1 )
| ( $true != bG3(X0,X1) ) )
& ( ( $true = bG3(X0,X1) )
| ( X0 != X1 ) ) ),
inference(nnf_transformation,[],[f12]) ).
tff(f19,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( p(X1,X0)
& p(X1,X2) )
| ( $true != bG2(X0,X1,X2) ) )
& ( ( $true = bG2(X0,X1,X2) )
| ~ p(X1,X0)
| ~ p(X1,X2) ) ),
inference(nnf_transformation,[],[f13]) ).
tff(f20,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( p(X1,X0)
& p(X1,X2) )
| ( $true != bG2(X0,X1,X2) ) )
& ( ( $true = bG2(X0,X1,X2) )
| ~ p(X1,X0)
| ~ p(X1,X2) ) ),
inference(flattening,[],[f19]) ).
tff(f21,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG1((X0)) ) )
& ( ( $true = bG1((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f14]) ).
tff(f22,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG0((X0)) ) )
& ( ( $true = bG0((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f23,plain,
! [X0: $o,X1: $o] :
( ( imply(bG0((X0)),bG1((X1)))
| ( ( $true = (X0) )
& ( $true != (X1) ) ) )
& ( ( $true != (X0) )
| ( $true = (X1) )
| ~ imply(bG0((X0)),bG1((X1))) ) ),
inference(nnf_transformation,[],[f15]) ).
tff(f24,plain,
! [X0: $o,X1: $o] :
( ( imply(bG0((X0)),bG1((X1)))
| ( ( $true = (X0) )
& ( $true != (X1) ) ) )
& ( ( $true != (X0) )
| ( $true = (X1) )
| ~ imply(bG0((X0)),bG1((X1))) ) ),
inference(flattening,[],[f23]) ).
tff(f25,plain,
~ imply(bG2(sK5,sK4,sK6),bG3(sK6,sK5)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f17]) ).
tff(f26,plain,
! [X0: $i,X1: $i] :
( ( $true = bG3(X0,X1) )
| ( X0 != X1 ) ),
inference(cnf_transformation,[],[f18]) ).
tff(f27,plain,
! [X0: $i,X1: $i] :
( ( $true != bG3(X0,X1) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f18]) ).
tff(f29,plain,
! [X2: $i,X0: $i,X1: $i] :
( p(X1,X2)
| ( $true != bG2(X0,X1,X2) ) ),
inference(cnf_transformation,[],[f20]) ).
tff(f30,plain,
! [X2: $i,X0: $i,X1: $i] :
( p(X1,X0)
| ( $true != bG2(X0,X1,X2) ) ),
inference(cnf_transformation,[],[f20]) ).
tff(f31,plain,
! [X0: $o] :
( ( $true = bG1((X0)) )
| ( $true != (X0) ) ),
inference(cnf_transformation,[],[f21]) ).
tff(f32,plain,
! [X0: $o] :
( ( $true != bG1((X0)) )
| ( $true = (X0) ) ),
inference(cnf_transformation,[],[f21]) ).
tff(f33,plain,
! [X0: $o] :
( ( $true = bG0((X0)) )
| ( $true != (X0) ) ),
inference(cnf_transformation,[],[f22]) ).
tff(f34,plain,
! [X0: $o] :
( ( $true != bG0((X0)) )
| ( $true = (X0) ) ),
inference(cnf_transformation,[],[f22]) ).
tff(f36,plain,
! [X0: $o,X1: $o] :
( imply(bG0((X0)),bG1((X1)))
| ( $true != (X1) ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f37,plain,
! [X0: $o,X1: $o] :
( imply(bG0((X0)),bG1((X1)))
| ( $true = (X0) ) ),
inference(cnf_transformation,[],[f24]) ).
tff(f38,plain,
! [X0: $i,X1: $i] :
( ~ p(X0,X1)
| ( f(X0) = X1 ) ),
inference(cnf_transformation,[],[f16]) ).
tff(f39,plain,
~ imply(bG2(sK5,sK4,sK6),bG3(sK6,sK5)),
inference(cnf_transformation,[],[f25]) ).
tff(f41,plain,
! [X0: $o] :
( ( $false = (X0) )
| ( $true = (X0) ) ),
introduced(definition,[],[fool_exhaustiveness_axiom]) ).
tff(f42,plain,
! [X1: $i] : ( $true = bG3(X1,X1) ),
inference(equality_resolution,[],[f26]) ).
tff(f43,plain,
$true = bG1($true),
inference(equality_resolution,[],[f31]) ).
tff(f44,plain,
$true = bG0($true),
inference(equality_resolution,[],[f33]) ).
tff(f45,plain,
! [X0: $o] : imply(bG0((X0)),bG1($true)),
inference(equality_resolution,[],[f36]) ).
tff(f48,plain,
imply($true,bG1($true)),
inference(superposition,[],[f45,f44]) ).
tff(f49,plain,
imply($true,$true),
inference(forward_demodulation,[],[f48,f43]) ).
tff(f53,plain,
! [X0: $o,X1: $o] :
( ( $true = (X1) )
| ( (X0) = (X1) )
| ( $true = (X0) ) ),
inference(superposition,[],[f41,f41]) ).
tff(f55,plain,
! [X0: $o,X1: $o] :
( imply($false,bG1((X1)))
| ( $true = (X0) )
| ( $true = bG0((X0)) ) ),
inference(superposition,[],[f37,f41]) ).
tff(f62,plain,
( ~ imply($false,bG3(sK6,sK5))
| ( $true = bG2(sK5,sK4,sK6) ) ),
inference(superposition,[],[f39,f41]) ).
tff(f71,definition,
( spl7_1
<=> ( $true = bG3(sK6,sK5) ) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
tff(f72,plain,
( ( $true != bG3(sK6,sK5) )
| spl7_1 ),
inference(avatar_component_clause,[],[f71]) ).
tff(f73,plain,
( ( $true = bG3(sK6,sK5) )
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f71]) ).
tff(f80,definition,
( spl7_3
<=> ( $true = bG2(sK5,sK4,sK6) ) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
tff(f82,plain,
( ( $true = bG2(sK5,sK4,sK6) )
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f80]) ).
tff(f84,definition,
( spl7_4
<=> imply($false,bG3(sK6,sK5)) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
tff(f87,plain,
( spl7_3
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f62,f84,f80]) ).
tff(f89,definition,
( spl7_5
<=> ! [X1: $o] : ( $true = bG1((X1)) ) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
tff(f90,plain,
( ! [X1: $o] : ( $true = bG1((X1)) )
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f89]) ).
tff(f105,definition,
( spl7_9
<=> ! [X0: $o] :
( ( $true = (X0) )
| ( $true = bG0((X0)) ) ) ),
introduced(definition,[new_symbols(definition,[spl7_9])],[avatar_definition]) ).
tff(f106,plain,
( ! [X0: $o] :
( ( $true = (X0) )
| ( $true = bG0((X0)) ) )
| ~ spl7_9 ),
inference(avatar_component_clause,[],[f105]) ).
tff(f108,definition,
( spl7_10
<=> ! [X1: $o] : imply($false,bG1((X1))) ),
introduced(definition,[new_symbols(definition,[spl7_10])],[avatar_definition]) ).
tff(f109,plain,
( ! [X1: $o] : imply($false,bG1((X1)))
| ~ spl7_10 ),
inference(avatar_component_clause,[],[f108]) ).
tff(f110,plain,
( spl7_9
| spl7_10 ),
inference(avatar_split_clause,[],[f55,f108,f105]) ).
tff(f115,definition,
( spl7_12
<=> imply($false,$true) ),
introduced(definition,[new_symbols(definition,[spl7_12])],[avatar_definition]) ).
tff(f117,plain,
( imply($false,$true)
| ~ spl7_12 ),
inference(avatar_component_clause,[],[f115]) ).
tff(f141,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true != bG2(X1,X0,X2) )
| ( f(X0) = X1 ) ),
inference(resolution,[],[f38,f30]) ).
tff(f142,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true != bG2(X2,X0,X1) )
| ( f(X0) = X1 ) ),
inference(resolution,[],[f38,f29]) ).
tff(f147,plain,
( ( $true != $true )
| ( sK5 = sK6 )
| ~ spl7_1 ),
inference(superposition,[],[f27,f73]) ).
tff(f148,plain,
( ( sK5 = sK6 )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f147]) ).
tff(f171,definition,
( spl7_15
<=> ( $true = bG2(sK5,sK4,sK5) ) ),
introduced(definition,[new_symbols(definition,[spl7_15])],[avatar_definition]) ).
tff(f173,plain,
( ( $true = bG2(sK5,sK4,sK5) )
| ~ spl7_15 ),
inference(avatar_component_clause,[],[f171]) ).
tff(f194,plain,
( ! [X0: $o] :
( ( $true != $true )
| ( $true = (X0) ) )
| ~ spl7_5 ),
inference(superposition,[],[f32,f90]) ).
tff(f197,plain,
( ! [X0: $o] : ( $true = (X0) )
| ~ spl7_5 ),
inference(trivial_inequality_removal,[],[f194]) ).
tff(f215,plain,
( ! [X0: $o] : ( $true = (X0) )
| ~ spl7_9 ),
inference(forward_subsumption_resolution,[],[f106,f34]) ).
tff(f249,plain,
( ~ imply(bG2(sK5,sK4,sK6),$true)
| ~ spl7_9 ),
inference(superposition,[],[f39,f215]) ).
tff(f262,plain,
( ~ imply($true,$true)
| ~ spl7_9 ),
inference(forward_demodulation,[],[f249,f215]) ).
tff(f273,plain,
( $false
| ~ spl7_9 ),
inference(forward_subsumption_resolution,[],[f262,f49]) ).
tff(f274,plain,
~ spl7_9,
inference(avatar_contradiction_clause,[],[f273]) ).
tff(f282,definition,
( spl7_16
<=> ! [X0: $o] : ( $true = (X0) ) ),
introduced(definition,[new_symbols(definition,[spl7_16])],[avatar_definition]) ).
tff(f283,plain,
( ! [X0: $o] : ( $true = (X0) )
| ~ spl7_16 ),
inference(avatar_component_clause,[],[f282]) ).
tff(f294,plain,
( imply($false,$true)
| ~ spl7_10 ),
inference(superposition,[],[f109,f43]) ).
tff(f298,plain,
( spl7_16
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f197,f89,f282]) ).
tff(f303,plain,
( spl7_12
| ~ spl7_10 ),
inference(avatar_split_clause,[],[f294,f108,f115]) ).
tff(f309,plain,
( ~ imply(bG2(sK5,sK4,sK6),$true)
| ~ spl7_1 ),
inference(superposition,[],[f39,f73]) ).
tff(f324,plain,
( ~ imply(bG2(sK5,sK4,sK5),$true)
| ~ spl7_1 ),
inference(forward_demodulation,[],[f309,f148]) ).
tff(f335,plain,
( ~ imply($false,$true)
| ( $true = bG2(sK5,sK4,sK5) )
| ~ spl7_1 ),
inference(superposition,[],[f324,f41]) ).
tff(f336,plain,
( ( $true = bG2(sK5,sK4,sK5) )
| ~ spl7_1
| ~ spl7_12 ),
inference(forward_subsumption_resolution,[],[f335,f117]) ).
tff(f337,plain,
( spl7_15
| ~ spl7_1
| ~ spl7_12 ),
inference(avatar_split_clause,[],[f336,f115,f71,f171]) ).
tff(f404,plain,
( ~ imply($true,$true)
| ~ spl7_1
| ~ spl7_15 ),
inference(superposition,[],[f324,f173]) ).
tff(f414,plain,
( $false
| ~ spl7_1
| ~ spl7_15 ),
inference(forward_subsumption_resolution,[],[f404,f49]) ).
tff(f415,plain,
( ~ spl7_1
| ~ spl7_15 ),
inference(avatar_contradiction_clause,[],[f414]) ).
tff(f417,definition,
( spl7_18
<=> ! [X0: $o] :
( ( bG3(sK6,sK5) = (X0) )
| ( $true = (X0) ) ) ),
introduced(definition,[new_symbols(definition,[spl7_18])],[avatar_definition]) ).
tff(f418,plain,
( ! [X0: $o] :
( ( bG3(sK6,sK5) = (X0) )
| ( $true = (X0) ) )
| ~ spl7_18 ),
inference(avatar_component_clause,[],[f417]) ).
tff(f432,plain,
( ! [X0: $o] :
( ( $true != $true )
| ( bG3(sK6,sK5) = (X0) )
| ( $true = (X0) ) )
| spl7_1 ),
inference(superposition,[],[f72,f53]) ).
tff(f434,plain,
( ! [X0: $o] :
( ( bG3(sK6,sK5) = (X0) )
| ( $true = (X0) ) )
| spl7_1 ),
inference(trivial_inequality_removal,[],[f432]) ).
tff(f435,plain,
( spl7_18
| spl7_1 ),
inference(avatar_split_clause,[],[f434,f71,f417]) ).
tff(f443,plain,
( ( $true != $true )
| ( sK5 = f(sK4) )
| ~ spl7_3 ),
inference(superposition,[],[f141,f82]) ).
tff(f448,plain,
( ( sK5 = f(sK4) )
| ~ spl7_3 ),
inference(trivial_inequality_removal,[],[f443]) ).
tff(f518,plain,
( ! [X0: $o] :
( imply($false,bG3(sK6,sK5))
| ( $true = bG1((X0)) ) )
| ~ spl7_10
| ~ spl7_18 ),
inference(superposition,[],[f109,f418]) ).
tff(f647,plain,
( ( $true != $true )
| spl7_1
| ~ spl7_16 ),
inference(superposition,[],[f72,f283]) ).
tff(f657,plain,
( $false
| spl7_1
| ~ spl7_16 ),
inference(trivial_inequality_removal,[],[f647]) ).
tff(f658,plain,
( spl7_1
| ~ spl7_16 ),
inference(avatar_contradiction_clause,[],[f657]) ).
tff(f695,plain,
( spl7_5
| spl7_4
| ~ spl7_10
| ~ spl7_18 ),
inference(avatar_split_clause,[],[f518,f417,f108,f84,f89]) ).
tff(f764,plain,
( ( $true != $true )
| ( sK6 = f(sK4) )
| ~ spl7_3 ),
inference(superposition,[],[f142,f82]) ).
tff(f771,plain,
( ( sK6 = f(sK4) )
| ~ spl7_3 ),
inference(trivial_inequality_removal,[],[f764]) ).
tff(f773,plain,
( ( sK5 = sK6 )
| ~ spl7_3 ),
inference(forward_demodulation,[],[f771,f448]) ).
tff(f776,plain,
( ( $true != bG3(sK5,sK5) )
| spl7_1
| ~ spl7_3 ),
inference(superposition,[],[f72,f773]) ).
tff(f791,plain,
( $false
| spl7_1
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f776,f42]) ).
tff(f792,plain,
( spl7_1
| ~ spl7_3 ),
inference(avatar_contradiction_clause,[],[f791]) ).
cnf(s2,plain,
( spl7_3
| ~ spl7_4 ),
inference(sat_conversion,[],[f87]) ).
cnf(s5,plain,
( spl7_9
| spl7_10 ),
inference(sat_conversion,[],[f110]) ).
cnf(s17,plain,
~ spl7_9,
inference(sat_conversion,[],[f274]) ).
cnf(s23,plain,
( ~ spl7_5
| spl7_16 ),
inference(sat_conversion,[],[f298]) ).
cnf(s32,plain,
( ~ spl7_10
| spl7_12 ),
inference(sat_conversion,[],[f303]) ).
cnf(s39,plain,
( ~ spl7_1
| ~ spl7_12
| spl7_15 ),
inference(sat_conversion,[],[f337]) ).
cnf(s46,plain,
( ~ spl7_1
| ~ spl7_15 ),
inference(sat_conversion,[],[f415]) ).
cnf(s49,plain,
( spl7_1
| spl7_18 ),
inference(sat_conversion,[],[f435]) ).
cnf(s68,plain,
( spl7_1
| ~ spl7_16 ),
inference(sat_conversion,[],[f658]) ).
cnf(s77,plain,
( spl7_4
| spl7_5
| ~ spl7_10
| ~ spl7_18 ),
inference(sat_conversion,[],[f695]) ).
cnf(s96,plain,
( spl7_1
| ~ spl7_3 ),
inference(sat_conversion,[],[f792]) ).
cnf(s99,plain,
spl7_10,
inference(rat,[],[s5,s17]) ).
cnf(s100,plain,
spl7_12,
inference(rat,[],[s32,s99]) ).
cnf(s101,plain,
spl7_1,
inference(rat,[],[s77,s23,s2,s49,s68,s96,s99]) ).
cnf(s102,plain,
~ spl7_15,
inference(rat,[],[s46,s101]) ).
cnf(s103,plain,
$false,
inference(rat,[],[s39,s100,s102,s101]) ).
tff(f797,plain,
$false,
inference(avatar_sat_refutation,[],[s103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL977_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n008.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Sun Sep 27 17:10:25 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.49 Running first-order theorem proving
% 0.24/0.49 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.85/1.52 % (1465774)Detected formulas, will run a generic FOF schedule.
% 3.85/1.52 % (1465791)dis-21_1_sil=8000:lcm=predicate:random_seed=3617976242:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/129Mi)
% 3.85/1.52 % (1465791)Instruction limit reached!
% 3.85/1.52 % (1465791)------------------------------
% 3.85/1.52 % (1465791)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.52 % (1465791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.52 % (1465791)CaDiCaL version: 2.1.3
% 3.85/1.52 % (1465791)Termination reason: Instruction limit
% 3.85/1.52 % (1465791)Termination phase: Saturation
% 3.85/1.52 % (1465791)Time elapsed: 0.039 s
% 3.85/1.52 % (1465791)Peak memory usage: 90 MB
% 3.85/1.52 % (1465791)Instructions burned: 133 (million)
% 3.85/1.52 % (1465785)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1012698104:i=141193_3000 on theBenchmark for (3000ds/141193Mi)
% 3.85/1.52 % (1465786)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3133835714:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_3000 on theBenchmark for (3000ds/134677Mi)
% 3.85/1.52 % (1465789)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1172834396:i=119:av=off:ss=axioms_3000 on theBenchmark for (3000ds/119Mi)
% 3.85/1.52 % (1465788)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1354898678:i=109:sd=1:ins=1:gsp=on:ss=axioms_3000 on theBenchmark for (3000ds/109Mi)
% 3.85/1.52 % (1465790)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=140055152:s2a=on:i=139:gtg=position_3000 on theBenchmark for (3000ds/139Mi)
% 3.85/1.52 % (1465787)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1934721096:i=141695:sd=1:nm=32:gsp=on:ss=included_3000 on theBenchmark for (3000ds/141695Mi)
% 3.85/1.52 % (1465790)First to succeed.
% 3.85/1.52 % (1465790)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1465774"
% 3.85/1.52 % (1465793)lrs+10_1_sil=8000:sp=occurrence:random_seed=2389871698:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.85/1.52 % (1465793)Also succeeded, but the first one will report.
% 3.85/1.52 % (1465788)Instruction limit reached!
% 3.85/1.52 % (1465788)------------------------------
% 3.85/1.52 % (1465788)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.52 % (1465788)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.52 % (1465788)CaDiCaL version: 2.1.3
% 3.85/1.52 % (1465788)Termination reason: Instruction limit
% 3.85/1.52 % (1465788)Termination phase: Saturation
% 3.85/1.52 % (1465788)Time elapsed: 0.101 s
% 3.85/1.52 % (1465788)Peak memory usage: 89 MB
% 3.85/1.52 % (1465788)Instructions burned: 109 (million)
% 3.85/1.52 % (1465789)Instruction limit reached!
% 3.85/1.52 % (1465789)------------------------------
% 3.85/1.52 % (1465789)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.52 % (1465789)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.52 % (1465789)CaDiCaL version: 2.1.3
% 3.85/1.52 % (1465789)Termination reason: Instruction limit
% 3.85/1.52 % (1465789)Termination phase: Saturation
% 3.85/1.52 % (1465789)Time elapsed: 0.104 s
% 3.85/1.52 % (1465789)Peak memory usage: 88 MB
% 3.85/1.52 % (1465789)Instructions burned: 120 (million)
% 3.85/1.52 % (1465803)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2988886203:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 3.85/1.52 % (1465804)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2518997627:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 3.85/1.52 % (1465803)Instruction limit reached!
% 3.85/1.52 % (1465803)------------------------------
% 3.85/1.52 % (1465803)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.52 % (1465803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.52 % (1465803)CaDiCaL version: 2.1.3
% 3.85/1.52 % (1465803)Termination reason: Instruction limit
% 3.85/1.52 % (1465803)Termination phase: Saturation
% 3.85/1.52 % (1465803)Time elapsed: 0.109 s
% 3.85/1.52 % (1465803)Peak memory usage: 89 MB
% 3.85/1.52 % (1465803)Instructions burned: 157 (million)
% 3.85/1.52 % (1465790)Refutation found. Thanks to Tanya!
% 3.85/1.52 % SZS status Theorem for theBenchmark
% 3.85/1.52 % SZS output start Proof for theBenchmark
% See solution above
% 5.18/1.64 % (1465790)------------------------------
% 5.18/1.64 % (1465790)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.18/1.64 % (1465790)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.18/1.64 % (1465790)CaDiCaL version: 2.1.3
% 5.18/1.64 % (1465790)Termination reason: Refutation
% 5.18/1.64 % (1465790)Time elapsed: 0.027 s
% 5.18/1.64 % (1465790)Peak memory usage: 90 MB
% 5.18/1.64 % (1465790)Instructions burned: 22 (million)
% 5.18/1.64 % (1465790)------------------------------
% 5.18/1.64 % (1465790)------------------------------
% 5.18/1.64 % (1465774)Success in time 0.654 s
% 5.18/1.64 % Vampire exiting
%------------------------------------------------------------------------------