%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU709_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 12:50:28 PM UTC 2026
% Result : Theorem 3.38s 1.33s
% Output : Refutation 3.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of formulae : 82 ( 22 unt; 0 typ; 3 def)
% Number of atoms : 541 ( 101 equ)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 251 ( 79 ~; 78 |; 24 &)
% ( 11 <=>; 59 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 378 ( 291 fml; 87 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 18 ( 15 usr; 12 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 4-4 aty)
% Number of variables : 151 ( 143 !; 8 ?; 151 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_2,type,
if: ( $i * $o * $i * $i ) > $i ).
tff(func_def_5,type,
bG0: $o > $o ).
tff(func_def_6,type,
bG1: $o > $o ).
tff(func_def_7,type,
bG2: $o > $o ).
tff(func_def_9,type,
sK4: $o ).
tff(f1,axiom,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : in(X0,setadjoin(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
tff(f3,axiom,
( secondinupair
= ( ! [X0: $i,X1: $i] : in(X1,setadjoin(X0,setadjoin(X1,emptyset))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',secondinupair) ).
tff(f4,axiom,
( iftrue
= ( ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( (X1)
=> ( if(X0,(X1),X2,X3) = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iftrue) ).
tff(f5,axiom,
( iffalse
= ( ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( ~ (X1)
=> ( if(X0,(X1),X2,X3) = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iffalse) ).
tff(f6,conjecture,
( setadjoinIL
=> ( in__Cong
=> ( secondinupair
=> ( iftrue
=> ( iffalse
=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> in(if(X0,(X1),X2,X3),setadjoin(X2,setadjoin(X3,emptyset))) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iftrueorfalse) ).
tff(f7,negated_conjecture,
~ ( setadjoinIL
=> ( in__Cong
=> ( secondinupair
=> ( iftrue
=> ( iffalse
=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> in(if(X0,(X1),X2,X3),setadjoin(X2,setadjoin(X3,emptyset))) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
tff(f8,plain,
( setadjoinIL
<=> ! [X0: $i,X1: $i] : in(X0,setadjoin(X0,X1)) ),
inference(fool_elimination,[],[f1]) ).
tff(f10,plain,
( secondinupair
<=> ! [X0: $i,X1: $i] : in(X1,setadjoin(X0,setadjoin(X1,emptyset))) ),
inference(fool_elimination,[],[f3]) ).
tff(f11,plain,
( iftrue
= ( ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( (X1)
=> ( if(X0,(X1),X2,X3) = X2 ) ) ) ) ) ),
inference(rectify,[],[f4]) ).
tff(f12,definition,
! [X1: $o] :
( ( $true = (X1) )
<=> ( $true = bG0((X1)) ) ),
introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition]) ).
tff(f13,plain,
( iftrue
<=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( ( $true = (X1) )
=> ( if(X0,bG0((X1)),X2,X3) = X2 ) ) ) ) ),
inference(fool_elimination,[],[f11,f12]) ).
tff(f14,plain,
( iffalse
= ( ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( ~ (X1)
=> ( if(X0,(X1),X2,X3) = X3 ) ) ) ) ) ),
inference(rectify,[],[f5]) ).
tff(f15,definition,
! [X1: $o] :
( ( $true = (X1) )
<=> ( $true = bG1((X1)) ) ),
introduced(definition,[new_symbols(definition,[bG1])],[fool_formula_definition]) ).
tff(f16,plain,
( iffalse
<=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( ( $true != (X1) )
=> ( if(X0,bG1((X1)),X2,X3) = X3 ) ) ) ) ),
inference(fool_elimination,[],[f14,f15]) ).
tff(f17,plain,
~ ( setadjoinIL
=> ( in__Cong
=> ( secondinupair
=> ( iftrue
=> ( iffalse
=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> in(if(X0,(X1),X2,X3),setadjoin(X2,setadjoin(X3,emptyset))) ) ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
tff(f18,definition,
! [X1: $o] :
( ( $true = (X1) )
<=> ( $true = bG2((X1)) ) ),
introduced(definition,[new_symbols(definition,[bG2])],[fool_formula_definition]) ).
tff(f19,plain,
~ ( setadjoinIL
=> ( in__Cong
=> ( secondinupair
=> ( iftrue
=> ( iffalse
=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> in(if(X0,bG2((X1)),X2,X3),setadjoin(X2,setadjoin(X3,emptyset))) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f17,f18]) ).
tff(f20,plain,
( iffalse
<=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( ( $true != (X1) )
=> ( if(X0,bG1((X1)),X2,X3) = X3 ) ) ) ) ),
inference(flattening,[],[f16]) ).
tff(f21,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG2((X0)) ) ),
inference(rectify,[],[f18]) ).
tff(f22,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG0((X0)) ) ),
inference(rectify,[],[f12]) ).
tff(f23,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG1((X0)) ) ),
inference(rectify,[],[f15]) ).
tff(f24,plain,
( iffalse
=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( ( $true != (X1) )
=> ( if(X0,bG1((X1)),X2,X3) = X3 ) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
tff(f25,plain,
( iftrue
=> ! [X0: $i,X1: $o,X2: $i] :
( in(X2,X0)
=> ! [X3: $i] :
( in(X3,X0)
=> ( ( $true = (X1) )
=> ( if(X0,bG0((X1)),X2,X3) = X2 ) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
tff(f26,plain,
( secondinupair
=> ! [X0: $i,X1: $i] : in(X1,setadjoin(X0,setadjoin(X1,emptyset))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
tff(f28,plain,
( setadjoinIL
=> ! [X0: $i,X1: $i] : in(X0,setadjoin(X0,X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
tff(f29,plain,
( ? [X0: $i,X1: $o,X2: $i] :
( ? [X3: $i] :
( ~ in(if(X0,bG2((X1)),X2,X3),setadjoin(X2,setadjoin(X3,emptyset)))
& in(X3,X0) )
& in(X2,X0) )
& iffalse
& iftrue
& secondinupair
& in__Cong
& setadjoinIL ),
inference(ennf_transformation,[],[f19]) ).
tff(f30,plain,
( ? [X0: $i,X1: $o,X2: $i] :
( ? [X3: $i] :
( ~ in(if(X0,bG2((X1)),X2,X3),setadjoin(X2,setadjoin(X3,emptyset)))
& in(X3,X0) )
& in(X2,X0) )
& iffalse
& iftrue
& secondinupair
& in__Cong
& setadjoinIL ),
inference(flattening,[],[f29]) ).
tff(f31,plain,
( ! [X0: $i,X1: $i] : in(X1,setadjoin(X0,setadjoin(X1,emptyset)))
| ~ secondinupair ),
inference(ennf_transformation,[],[f26]) ).
tff(f32,plain,
( ! [X0: $i,X1: $i] : in(X0,setadjoin(X0,X1))
| ~ setadjoinIL ),
inference(ennf_transformation,[],[f28]) ).
tff(f34,plain,
( ! [X0: $i,X1: $o,X2: $i] :
( ! [X3: $i] :
( ( if(X0,bG0((X1)),X2,X3) = X2 )
| ( $true != (X1) )
| ~ in(X3,X0) )
| ~ in(X2,X0) )
| ~ iftrue ),
inference(ennf_transformation,[],[f25]) ).
tff(f35,plain,
( ! [X0: $i,X1: $o,X2: $i] :
( ! [X3: $i] :
( ( if(X0,bG0((X1)),X2,X3) = X2 )
| ( $true != (X1) )
| ~ in(X3,X0) )
| ~ in(X2,X0) )
| ~ iftrue ),
inference(flattening,[],[f34]) ).
tff(f36,plain,
( ! [X0: $i,X1: $o,X2: $i] :
( ! [X3: $i] :
( ( if(X0,bG1((X1)),X2,X3) = X3 )
| ( $true = (X1) )
| ~ in(X3,X0) )
| ~ in(X2,X0) )
| ~ iffalse ),
inference(ennf_transformation,[],[f24]) ).
tff(f37,plain,
( ! [X0: $i,X1: $o,X2: $i] :
( ! [X3: $i] :
( ( if(X0,bG1((X1)),X2,X3) = X3 )
| ( $true = (X1) )
| ~ in(X3,X0) )
| ~ in(X2,X0) )
| ~ iffalse ),
inference(flattening,[],[f36]) ).
tff(f38,plain,
( ~ in(if(sK3,bG2(sK4),sK5,sK6),setadjoin(sK5,setadjoin(sK6,emptyset)))
& in(sK6,sK3)
& in(sK5,sK3)
& iffalse
& iftrue
& secondinupair
& in__Cong
& setadjoinIL ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f30]) ).
tff(f40,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG2((X0)) ) )
& ( ( $true = bG2((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f21]) ).
tff(f41,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG0((X0)) ) )
& ( ( $true = bG0((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f22]) ).
tff(f42,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG1((X0)) ) )
& ( ( $true = bG1((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f23]) ).
tff(f43,plain,
setadjoinIL,
inference(cnf_transformation,[],[f38]) ).
tff(f45,plain,
secondinupair,
inference(cnf_transformation,[],[f38]) ).
tff(f46,plain,
iftrue,
inference(cnf_transformation,[],[f38]) ).
tff(f47,plain,
iffalse,
inference(cnf_transformation,[],[f38]) ).
tff(f48,plain,
in(sK5,sK3),
inference(cnf_transformation,[],[f38]) ).
tff(f49,plain,
in(sK6,sK3),
inference(cnf_transformation,[],[f38]) ).
tff(f50,plain,
~ in(if(sK3,bG2(sK4),sK5,sK6),setadjoin(sK5,setadjoin(sK6,emptyset))),
inference(cnf_transformation,[],[f38]) ).
tff(f51,plain,
! [X0: $i,X1: $i] :
( in(X1,setadjoin(X0,setadjoin(X1,emptyset)))
| ~ secondinupair ),
inference(cnf_transformation,[],[f31]) ).
tff(f52,plain,
! [X0: $i,X1: $i] :
( in(X0,setadjoin(X0,X1))
| ~ setadjoinIL ),
inference(cnf_transformation,[],[f32]) ).
tff(f55,plain,
! [X2: $i,X3: $i,X0: $i,X1: $o] :
( ( if(X0,bG0((X1)),X2,X3) = X2 )
| ( $true != (X1) )
| ~ in(X3,X0)
| ~ in(X2,X0)
| ~ iftrue ),
inference(cnf_transformation,[],[f35]) ).
tff(f56,plain,
! [X2: $i,X3: $i,X0: $i,X1: $o] :
( ( if(X0,bG1((X1)),X2,X3) = X3 )
| ( $true = (X1) )
| ~ in(X3,X0)
| ~ in(X2,X0)
| ~ iffalse ),
inference(cnf_transformation,[],[f37]) ).
tff(f57,plain,
! [X0: $o] :
( ( $true = bG2((X0)) )
| ( $true != (X0) ) ),
inference(cnf_transformation,[],[f40]) ).
tff(f58,plain,
! [X0: $o] :
( ( $true != bG2((X0)) )
| ( $true = (X0) ) ),
inference(cnf_transformation,[],[f40]) ).
tff(f59,plain,
! [X0: $o] :
( ( $true = bG0((X0)) )
| ( $true != (X0) ) ),
inference(cnf_transformation,[],[f41]) ).
tff(f62,plain,
! [X0: $o] :
( ( $true != bG1((X0)) )
| ( $true = (X0) ) ),
inference(cnf_transformation,[],[f42]) ).
tff(f64,plain,
! [X0: $o] :
( ( $true = (X0) )
| ( $false = (X0) ) ),
introduced(definition,[],[fool_exhaustiveness_axiom]) ).
tff(f69,plain,
! [X2: $i,X3: $i,X0: $i] :
( ( if(X0,bG0($true),X2,X3) = X2 )
| ~ in(X3,X0)
| ~ in(X2,X0)
| ~ iftrue ),
inference(equality_resolution,[],[f55]) ).
tff(f70,plain,
$true = bG2($true),
inference(equality_resolution,[],[f57]) ).
tff(f71,plain,
$true = bG0($true),
inference(equality_resolution,[],[f59]) ).
tff(f73,plain,
! [X0: $i,X1: $i] : in(X0,setadjoin(X0,X1)),
inference(forward_subsumption_resolution,[],[f52,f43]) ).
tff(f80,plain,
( ~ in(if(sK3,bG2($true),sK5,sK6),setadjoin(sK5,setadjoin(sK6,emptyset)))
| ( sK4 = $false ) ),
inference(superposition,[],[f50,f64]) ).
tff(f82,plain,
( ~ in(if(sK3,$true,sK5,sK6),setadjoin(sK5,setadjoin(sK6,emptyset)))
| ( sK4 = $false ) ),
inference(forward_demodulation,[],[f80,f70]) ).
tff(f84,plain,
! [X0: $o] :
( ( $true != $true )
| ( $true = (X0) )
| ( bG2((X0)) = $false ) ),
inference(superposition,[],[f58,f64]) ).
tff(f85,plain,
! [X0: $o] :
( ( bG2((X0)) = $false )
| ( $true = (X0) ) ),
inference(trivial_inequality_removal,[],[f84]) ).
tff(f89,plain,
! [X0: $o] :
( ( $true != $true )
| ( $true = (X0) )
| ( bG1((X0)) = $false ) ),
inference(superposition,[],[f62,f64]) ).
tff(f90,plain,
! [X0: $o] :
( ( bG1((X0)) = $false )
| ( $true = (X0) ) ),
inference(trivial_inequality_removal,[],[f89]) ).
tff(f93,plain,
! [X0: $i,X1: $i] : in(X1,setadjoin(X0,setadjoin(X1,emptyset))),
inference(forward_subsumption_resolution,[],[f51,f45]) ).
tff(f96,plain,
! [X2: $i,X3: $i,X0: $i] :
( ( if(X0,bG0($true),X2,X3) = X2 )
| ~ in(X3,X0)
| ~ in(X2,X0) ),
inference(forward_subsumption_resolution,[],[f69,f46]) ).
tff(f97,plain,
! [X2: $i,X3: $i,X0: $i] :
( ( if(X0,$true,X2,X3) = X2 )
| ~ in(X3,X0)
| ~ in(X2,X0) ),
inference(forward_demodulation,[],[f96,f71]) ).
tff(f100,plain,
( ~ in(sK5,setadjoin(sK5,setadjoin(sK6,emptyset)))
| ( sK4 = $false )
| ~ in(sK6,sK3)
| ~ in(sK5,sK3) ),
inference(superposition,[],[f82,f97]) ).
tff(f107,plain,
( ( sK4 = $false )
| ~ in(sK6,sK3)
| ~ in(sK5,sK3) ),
inference(forward_subsumption_resolution,[],[f100,f73]) ).
tff(f111,plain,
( ( sK4 = $false )
| ~ in(sK5,sK3) ),
inference(forward_subsumption_resolution,[],[f107,f49]) ).
tff(f115,plain,
sK4 = $false,
inference(forward_subsumption_resolution,[],[f111,f48]) ).
tff(f117,plain,
! [X2: $i,X3: $i,X0: $i,X1: $o] :
( ( if(X0,bG1((X1)),X2,X3) = X3 )
| ( $true = (X1) )
| ~ in(X3,X0)
| ~ in(X2,X0) ),
inference(forward_subsumption_resolution,[],[f56,f47]) ).
tff(f191,plain,
( ~ in(if(sK3,$false,sK5,sK6),setadjoin(sK5,setadjoin(sK6,emptyset)))
| ( $true = sK4 ) ),
inference(superposition,[],[f50,f85]) ).
tff(f196,plain,
( ( $true = $false )
| ~ in(if(sK3,$false,sK5,sK6),setadjoin(sK5,setadjoin(sK6,emptyset))) ),
inference(forward_demodulation,[],[f191,f115]) ).
tff(f197,plain,
~ in(if(sK3,$false,sK5,sK6),setadjoin(sK5,setadjoin(sK6,emptyset))),
inference(trivial_inequality_removal,[],[f196]) ).
tff(f209,plain,
! [X2: $i,X3: $i,X0: $i,X1: $o] :
( ( if(X0,$false,X2,X3) = X3 )
| ( $true = (X1) )
| ~ in(X3,X0)
| ~ in(X2,X0)
| ( $true = (X1) ) ),
inference(superposition,[],[f117,f90]) ).
tff(f214,plain,
! [X2: $i,X3: $i,X0: $i,X1: $o] :
( ( if(X0,$false,X2,X3) = X3 )
| ( $true = (X1) )
| ~ in(X3,X0)
| ~ in(X2,X0) ),
inference(duplicate_literal_removal,[],[f209]) ).
tff(f289,plain,
! [X0: $o] :
( ~ in(sK6,setadjoin(sK5,setadjoin(sK6,emptyset)))
| ( $true = (X0) )
| ~ in(sK6,sK3)
| ~ in(sK5,sK3) ),
inference(superposition,[],[f197,f214]) ).
tff(f290,plain,
! [X0: $o] :
( ( $true = (X0) )
| ~ in(sK6,sK3)
| ~ in(sK5,sK3) ),
inference(forward_subsumption_resolution,[],[f289,f93]) ).
tff(f291,plain,
! [X0: $o] :
( ( $true = (X0) )
| ~ in(sK5,sK3) ),
inference(forward_subsumption_resolution,[],[f290,f49]) ).
tff(f292,plain,
! [X0: $o] : ( $true = (X0) ),
inference(forward_subsumption_resolution,[],[f291,f48]) ).
tff(f320,plain,
$true = $false,
inference(superposition,[],[f115,f292]) ).
tff(f322,plain,
$false,
inference(trivial_inequality_removal,[],[f320]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU709_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n002.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 05:55:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.38/1.33 % (92742)Detected formulas, will run a generic FOF schedule.
% 3.38/1.33 % (92854)dis-21_1_sil=8000:lcm=predicate:random_seed=1703680149:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.38/1.33 % (92854)Refutation not found, incomplete strategy
% 3.38/1.33 % (92854)------------------------------
% 3.38/1.33 % (92854)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.38/1.33 % (92854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.38/1.33 % (92854)CaDiCaL version: 2.1.3
% 3.38/1.33 % (92854)Termination reason: Refutation not found, incomplete strategy
% 3.38/1.33 % (92854)Time elapsed: 0.001 s
% 3.38/1.33 % (92854)Peak memory usage: 88 MB
% 3.38/1.33 % (92854)Instructions burned: 1 (million)
% 3.38/1.33 % (92852)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1987207146:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.38/1.33 % (92850)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=4202050050:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.38/1.33 % (92849)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=1189695278:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.38/1.33 % (92848)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=1332868761:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.38/1.33 % (92853)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1787415620:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.38/1.33 % (92851)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2125372015:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.38/1.33 % (92852)First to succeed.
% 3.38/1.33 % (92851)Refutation not found, incomplete strategy
% 3.38/1.33 % (92851)------------------------------
% 3.38/1.33 % (92851)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.38/1.33 % (92851)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.38/1.33 % (92851)CaDiCaL version: 2.1.3
% 3.38/1.33 % (92851)Termination reason: Refutation not found, incomplete strategy
% 3.38/1.33 % (92851)Time elapsed: 0.008 s
% 3.38/1.33 % (92851)Peak memory usage: 89 MB
% 3.38/1.33 % (92851)Instructions burned: 9 (million)
% 3.38/1.33 % (92852)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-92742"
% 3.38/1.33 % (92853)Also succeeded, but the first one will report.
% 3.38/1.33 % (92854)------------------------------
% 3.38/1.33 % (92854)------------------------------
% 3.38/1.33 % (92883)lrs+10_1_sil=8000:sp=occurrence:random_seed=3582618535:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 3.38/1.33 % (92851)------------------------------
% 3.38/1.33 % (92851)------------------------------
% 3.38/1.33 % (92883)Also succeeded, but the first one will report.
% 3.38/1.33 % (92852)Refutation found. Thanks to Tanya!
% 3.38/1.33 % SZS status Theorem for theBenchmark
% 3.38/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 3.90/1.53 % (92852)------------------------------
% 3.90/1.53 % (92852)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.90/1.53 % (92852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.90/1.53 % (92852)CaDiCaL version: 2.1.3
% 3.90/1.53 % (92852)Termination reason: Refutation
% 3.90/1.53 % (92852)Time elapsed: 0.008 s
% 3.90/1.53 % (92852)Peak memory usage: 88 MB
% 3.90/1.53 % (92852)Instructions burned: 11 (million)
% 3.90/1.53 % (92852)------------------------------
% 3.90/1.53 % (92852)------------------------------
% 3.90/1.53 % (92742)Success in time 0.471 s
% 3.90/1.53 % Vampire exiting
%------------------------------------------------------------------------------