%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU408+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:53:10 PM UTC 2026
% Result : Theorem 0.98s 0.61s
% Output : Refutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 18 unt; 0 def)
% Number of atoms : 191 ( 24 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 209 ( 72 ~; 48 |; 59 &)
% ( 6 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-6 aty)
% Number of variables : 103 ( 97 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( ( ~ v3_struct_0(X0)
& v2_orders_2(X0)
& v3_orders_2(X0)
& v4_orders_2(X0)
& v1_lattice3(X0)
& l1_orders_2(X0) )
=> ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( r2_hidden(X2,u1_struct_0(X1))
=> m1_subset_1(X2,u1_struct_0(k1_latsum_1(X0,X1))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_latsum_1) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ( ~ v3_struct_0(X0)
& v2_orders_2(X0)
& v3_orders_2(X0)
& v4_orders_2(X0)
& v1_lattice3(X0)
& l1_orders_2(X0) )
=> ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( r2_hidden(X2,u1_struct_0(X1))
=> m1_subset_1(X2,u1_struct_0(k1_latsum_1(X0,X1))) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f6,axiom,
! [X0,X1] : k2_xboole_0(X0,X1) = k2_xboole_0(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f7,axiom,
! [X0] :
( l1_orders_2(X0)
=> ! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( ( v1_orders_2(X2)
& l1_orders_2(X2) )
=> ( X2 = k1_latsum_1(X0,X1)
<=> ( u1_struct_0(X2) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(X1))
& u1_orders_2(X2) = k2_xboole_0(k2_xboole_0(u1_orders_2(X0),u1_orders_2(X1)),k7_relset_1(u1_struct_0(X0),u1_struct_0(X0),u1_struct_0(X1),u1_struct_0(X1),u1_orders_2(X0),u1_orders_2(X1))) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_latsum_1) ).
fof(f8,axiom,
! [X0,X1,X2] :
( X2 = k2_xboole_0(X0,X1)
<=> ! [X3] :
( r2_hidden(X3,X2)
<=> ( r2_hidden(X3,X0)
| r2_hidden(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f10,axiom,
! [X0,X1] :
( ( l1_orders_2(X0)
& l1_orders_2(X1) )
=> ( v1_orders_2(k1_latsum_1(X0,X1))
& l1_orders_2(k1_latsum_1(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_latsum_1) ).
fof(f43,axiom,
! [X0,X1] : r1_tarski(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f47,axiom,
! [X0,X1] :
( m1_subset_1(X0,k1_zfmisc_1(X1))
<=> r1_tarski(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f48,axiom,
! [X0,X1,X2] :
( ( r2_hidden(X0,X1)
& m1_subset_1(X1,k1_zfmisc_1(X2)) )
=> m1_subset_1(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(f54,plain,
! [X0] : r1_tarski(X0,X0),
inference(rectify,[],[f43]) ).
fof(f55,plain,
! [X0,X1] :
( r1_tarski(X0,X1)
=> m1_subset_1(X0,k1_zfmisc_1(X1)) ),
inference(unused_predicate_definition_removal,[],[f47]) ).
fof(f56,plain,
~ ! [X0] :
( ( ~ v3_struct_0(X0)
& v2_orders_2(X0)
& v3_orders_2(X0)
& v4_orders_2(X0)
& l1_orders_2(X0) )
=> ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( r2_hidden(X2,u1_struct_0(X1))
=> m1_subset_1(X2,u1_struct_0(k1_latsum_1(X0,X1))) ) ) ),
inference(pure_predicate_removal,[],[f2]) ).
fof(f57,plain,
~ ! [X0] :
( ( ~ v3_struct_0(X0)
& v2_orders_2(X0)
& v3_orders_2(X0)
& l1_orders_2(X0) )
=> ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( r2_hidden(X2,u1_struct_0(X1))
=> m1_subset_1(X2,u1_struct_0(k1_latsum_1(X0,X1))) ) ) ),
inference(pure_predicate_removal,[],[f56]) ).
fof(f58,plain,
~ ! [X0] :
( ( ~ v3_struct_0(X0)
& v2_orders_2(X0)
& l1_orders_2(X0) )
=> ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( r2_hidden(X2,u1_struct_0(X1))
=> m1_subset_1(X2,u1_struct_0(k1_latsum_1(X0,X1))) ) ) ),
inference(pure_predicate_removal,[],[f57]) ).
fof(f59,plain,
~ ! [X0] :
( ( ~ v3_struct_0(X0)
& l1_orders_2(X0) )
=> ! [X1] :
( ( ~ v3_struct_0(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( r2_hidden(X2,u1_struct_0(X1))
=> m1_subset_1(X2,u1_struct_0(k1_latsum_1(X0,X1))) ) ) ),
inference(pure_predicate_removal,[],[f58]) ).
fof(f60,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ m1_subset_1(X2,u1_struct_0(k1_latsum_1(X0,X1)))
& r2_hidden(X2,u1_struct_0(X1)) )
& ~ v3_struct_0(X1)
& l1_orders_2(X1) )
& ~ v3_struct_0(X0)
& l1_orders_2(X0) ),
inference(ennf_transformation,[],[f59]) ).
fof(f61,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ m1_subset_1(X2,u1_struct_0(k1_latsum_1(X0,X1)))
& r2_hidden(X2,u1_struct_0(X1)) )
& ~ v3_struct_0(X1)
& l1_orders_2(X1) )
& ~ v3_struct_0(X0)
& l1_orders_2(X0) ),
inference(flattening,[],[f60]) ).
fof(f66,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( X2 = k1_latsum_1(X0,X1)
<=> ( u1_struct_0(X2) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(X1))
& u1_orders_2(X2) = k2_xboole_0(k2_xboole_0(u1_orders_2(X0),u1_orders_2(X1)),k7_relset_1(u1_struct_0(X0),u1_struct_0(X0),u1_struct_0(X1),u1_struct_0(X1),u1_orders_2(X0),u1_orders_2(X1))) ) )
| ~ v1_orders_2(X2)
| ~ l1_orders_2(X2) )
| ~ l1_orders_2(X1) )
| ~ l1_orders_2(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f67,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( X2 = k1_latsum_1(X0,X1)
<=> ( u1_struct_0(X2) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(X1))
& u1_orders_2(X2) = k2_xboole_0(k2_xboole_0(u1_orders_2(X0),u1_orders_2(X1)),k7_relset_1(u1_struct_0(X0),u1_struct_0(X0),u1_struct_0(X1),u1_struct_0(X1),u1_orders_2(X0),u1_orders_2(X1))) ) )
| ~ v1_orders_2(X2)
| ~ l1_orders_2(X2) )
| ~ l1_orders_2(X1) )
| ~ l1_orders_2(X0) ),
inference(flattening,[],[f66]) ).
fof(f69,plain,
! [X0,X1] :
( ( v1_orders_2(k1_latsum_1(X0,X1))
& l1_orders_2(k1_latsum_1(X0,X1)) )
| ~ l1_orders_2(X0)
| ~ l1_orders_2(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f70,plain,
! [X0,X1] :
( ( v1_orders_2(k1_latsum_1(X0,X1))
& l1_orders_2(k1_latsum_1(X0,X1)) )
| ~ l1_orders_2(X0)
| ~ l1_orders_2(X1) ),
inference(flattening,[],[f69]) ).
fof(f94,plain,
! [X0,X1] :
( m1_subset_1(X0,k1_zfmisc_1(X1))
| ~ r1_tarski(X0,X1) ),
inference(ennf_transformation,[],[f55]) ).
fof(f95,plain,
! [X0,X1,X2] :
( m1_subset_1(X0,X2)
| ~ r2_hidden(X0,X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(ennf_transformation,[],[f48]) ).
fof(f96,plain,
! [X0,X1,X2] :
( m1_subset_1(X0,X2)
| ~ r2_hidden(X0,X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(flattening,[],[f95]) ).
fof(f101,plain,
r2_hidden(sK2,u1_struct_0(sK1)),
inference(cnf_transformation,[],[f61]) ).
fof(f102,plain,
~ m1_subset_1(sK2,u1_struct_0(k1_latsum_1(sK0,sK1))),
inference(cnf_transformation,[],[f61]) ).
fof(f103,plain,
l1_orders_2(sK1),
inference(cnf_transformation,[],[f61]) ).
fof(f105,plain,
l1_orders_2(sK0),
inference(cnf_transformation,[],[f61]) ).
fof(f110,plain,
! [X0,X1] : k2_xboole_0(X0,X1) = k2_xboole_0(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ l1_orders_2(X0)
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| ~ v1_orders_2(X2)
| u1_struct_0(X2) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(X1))
| k1_latsum_1(X0,X1) != X2 ),
inference(cnf_transformation,[],[f67]) ).
fof(f118,plain,
! [X2,X3,X0,X1] :
( ~ r2_hidden(X3,X1)
| r2_hidden(X3,X2)
| k2_xboole_0(X0,X1) != X2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f122,plain,
! [X0,X1] :
( l1_orders_2(k1_latsum_1(X0,X1))
| ~ l1_orders_2(X0)
| ~ l1_orders_2(X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f123,plain,
! [X0,X1] :
( v1_orders_2(k1_latsum_1(X0,X1))
| ~ l1_orders_2(X0)
| ~ l1_orders_2(X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f154,plain,
! [X0] : r1_tarski(X0,X0),
inference(cnf_transformation,[],[f54]) ).
fof(f158,plain,
! [X0,X1] :
( m1_subset_1(X0,k1_zfmisc_1(X1))
| ~ r1_tarski(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f159,plain,
! [X2,X0,X1] :
( ~ r2_hidden(X0,X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| m1_subset_1(X0,X2) ),
inference(cnf_transformation,[],[f96]) ).
fof(f164,plain,
! [X0,X1] :
( ~ l1_orders_2(X0)
| ~ l1_orders_2(X1)
| ~ l1_orders_2(k1_latsum_1(X0,X1))
| ~ v1_orders_2(k1_latsum_1(X0,X1))
| u1_struct_0(k1_latsum_1(X0,X1)) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(X1)) ),
inference(equality_resolution,[],[f112]) ).
fof(f167,plain,
! [X3,X0,X1] :
( r2_hidden(X3,k2_xboole_0(X0,X1))
| ~ r2_hidden(X3,X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f384,plain,
! [X2,X3,X0,X1] :
( ~ r2_hidden(X3,X1)
| m1_subset_1(X3,X2)
| ~ m1_subset_1(k2_xboole_0(X0,X1),k1_zfmisc_1(X2)) ),
inference(resolution,[],[f159,f167]) ).
fof(f631,plain,
! [X0,X1] :
( ~ m1_subset_1(k2_xboole_0(X1,u1_struct_0(sK1)),k1_zfmisc_1(X0))
| m1_subset_1(sK2,X0) ),
inference(resolution,[],[f384,f101]) ).
fof(f1129,plain,
! [X0,X1] :
( ~ l1_orders_2(X0)
| ~ l1_orders_2(X1)
| ~ v1_orders_2(k1_latsum_1(X0,X1))
| u1_struct_0(k1_latsum_1(X0,X1)) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(X1)) ),
inference(forward_subsumption_resolution,[],[f164,f122]) ).
fof(f1130,plain,
! [X0,X1] :
( ~ l1_orders_2(X1)
| ~ l1_orders_2(X0)
| u1_struct_0(k1_latsum_1(X0,X1)) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(X1)) ),
inference(forward_subsumption_resolution,[],[f1129,f123]) ).
fof(f1182,plain,
! [X0] :
( ~ l1_orders_2(X0)
| u1_struct_0(k1_latsum_1(X0,sK0)) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(sK0)) ),
inference(resolution,[],[f1130,f105]) ).
fof(f1183,plain,
! [X0] :
( ~ l1_orders_2(X0)
| u1_struct_0(k1_latsum_1(X0,sK1)) = k2_xboole_0(u1_struct_0(X0),u1_struct_0(sK1)) ),
inference(resolution,[],[f1130,f103]) ).
fof(f1198,plain,
u1_struct_0(k1_latsum_1(sK1,sK0)) = k2_xboole_0(u1_struct_0(sK1),u1_struct_0(sK0)),
inference(resolution,[],[f1182,f103]) ).
fof(f1792,plain,
! [X0,X1] :
( ~ r1_tarski(k2_xboole_0(X1,u1_struct_0(sK1)),X0)
| m1_subset_1(sK2,X0) ),
inference(resolution,[],[f631,f158]) ).
fof(f1799,plain,
! [X0] : m1_subset_1(sK2,k2_xboole_0(X0,u1_struct_0(sK1))),
inference(resolution,[],[f1792,f154]) ).
fof(f1806,plain,
! [X0] : m1_subset_1(sK2,k2_xboole_0(u1_struct_0(sK1),X0)),
inference(superposition,[],[f1799,f110]) ).
fof(f1810,plain,
m1_subset_1(sK2,u1_struct_0(k1_latsum_1(sK1,sK0))),
inference(superposition,[],[f1806,f1198]) ).
fof(f2242,plain,
u1_struct_0(k1_latsum_1(sK0,sK1)) = k2_xboole_0(u1_struct_0(sK0),u1_struct_0(sK1)),
inference(resolution,[],[f1183,f105]) ).
fof(f2247,plain,
u1_struct_0(k1_latsum_1(sK0,sK1)) = k2_xboole_0(u1_struct_0(sK1),u1_struct_0(sK0)),
inference(forward_demodulation,[],[f2242,f110]) ).
fof(f2269,plain,
u1_struct_0(k1_latsum_1(sK0,sK1)) = u1_struct_0(k1_latsum_1(sK1,sK0)),
inference(forward_demodulation,[],[f2247,f1198]) ).
fof(f2390,plain,
~ m1_subset_1(sK2,u1_struct_0(k1_latsum_1(sK1,sK0))),
inference(superposition,[],[f102,f2269]) ).
fof(f2450,plain,
$false,
inference(forward_subsumption_resolution,[],[f2390,f1810]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU408+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n018.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 05:13:24 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.98/0.61 % (3011164)Will run a generic schedule for satisfiability detection.
% 0.98/0.61 % (3011175)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4032559686:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.98/0.61 % (3011170)% WARNING: option uhcvi not known.
% 0.98/0.61 % (3011169)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2084266312_2999 on theBenchmark for (2999ds/0Mi)
% 0.98/0.61 % (3011171)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=676474323:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.98/0.61 % (3011170)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=153793299:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.98/0.61 % (3011172)dis+10_1_sil=32000:sp=arity:random_seed=1965466725:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.98/0.61 % (3011173)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3039455439:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.98/0.61 % (3011174)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3575721810:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.61 % TRYING [1]
% 0.98/0.61 % TRYING [2]
% 0.98/0.61 % TRYING [3]
% 0.98/0.61 % (3011175)Instruction limit reached!
% 0.98/0.61 % (3011175)------------------------------
% 0.98/0.61 % (3011175)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.61 % (3011175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.61 % (3011175)CaDiCaL version: 2.1.3
% 0.98/0.61 % (3011175)Termination reason: Instruction limit
% 0.98/0.61 % (3011175)Termination phase: Saturation
% 0.98/0.61 % (3011175)Time elapsed: 0.055 s
% 0.98/0.61 % (3011175)Peak memory usage: 14 MB
% 0.98/0.61 % (3011175)Instructions burned: 159 (million)
% 0.98/0.61 % TRYING [4]
% 0.98/0.61 % (3011172)Instruction limit reached!
% 0.98/0.61 % (3011172)------------------------------
% 0.98/0.61 % (3011172)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.61 % (3011172)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.61 % (3011172)CaDiCaL version: 2.1.3
% 0.98/0.61 % (3011172)Termination reason: Instruction limit
% 0.98/0.61 % (3011172)Termination phase: Saturation
% 0.98/0.61 % (3011172)Time elapsed: 0.062 s
% 0.98/0.61 % (3011172)Peak memory usage: 12 MB
% 0.98/0.61 % (3011172)Instructions burned: 104 (million)
% 0.98/0.61 % (3011183)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1313147798:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.98/0.61 % (3011173)Instruction limit reached!
% 0.98/0.61 % (3011173)------------------------------
% 0.98/0.61 % (3011173)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.61 % (3011173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.61 % (3011173)CaDiCaL version: 2.1.3
% 0.98/0.61 % (3011173)Termination reason: Instruction limit
% 0.98/0.61 % (3011173)Termination phase: Saturation
% 0.98/0.61 % (3011173)Time elapsed: 0.069 s
% 0.98/0.61 % (3011173)Peak memory usage: 13 MB
% 0.98/0.61 % (3011173)Instructions burned: 117 (million)
% 0.98/0.61 % TRYING [1]
% 0.98/0.61 % (3011184)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2611026275:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.61 % TRYING [2]
% 0.98/0.61 % TRYING [3]
% 0.98/0.61 % (3011174)Instruction limit reached!
% 0.98/0.61 % (3011174)------------------------------
% 0.98/0.61 % (3011174)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.61 % (3011174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.61 % (3011174)CaDiCaL version: 2.1.3
% 0.98/0.61 % (3011174)Termination reason: Instruction limit
% 0.98/0.61 % (3011174)Termination phase: Saturation
% 0.98/0.61 % (3011174)Time elapsed: 0.082 s
% 0.98/0.61 % (3011174)Peak memory usage: 13 MB
% 0.98/0.61 % (3011174)Instructions burned: 132 (million)
% 0.98/0.61 % (3011186)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1660521513:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.98/0.61 % (3011188)ott-21_1_sil=16000:fs=off:random_seed=2569013350:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.98/0.61 % (3011184)Instruction limit reached!
% 0.98/0.61 % (3011184)------------------------------
% 0.98/0.61 % (3011184)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.61 % (3011184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.61 % (3011184)CaDiCaL version: 2.1.3
% 0.98/0.61 % (3011184)Termination reason: Instruction limit
% 0.98/0.61 % (3011184)Termination phase: Saturation
% 0.98/0.61 % (3011184)Time elapsed: 0.040 s
% 0.98/0.61 % (3011184)Peak memory usage: 13 MB
% 0.98/0.61 % (3011184)Instructions burned: 134 (million)
% 0.98/0.61 % (3011191)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2387537082:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.98/0.61 % TRYING [4]
% 0.98/0.61 % (3011186) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3011164-3011186"...
% 0.98/0.61 % (3011186)...printing done.
% 0.98/0.61 % (3011186)Refutation found. Thanks to Tanya!
% 0.98/0.61 % SZS status Theorem for theBenchmark
% 0.98/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 0.98/0.61 % (3011186)------------------------------
% 0.98/0.61 % (3011186)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.61 % (3011186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.61 % (3011186)CaDiCaL version: 2.1.3
% 0.98/0.61 % (3011186)Termination reason: Refutation
% 0.98/0.61 % (3011186)Time elapsed: 0.063 s
% 0.98/0.61 % (3011186)Peak memory usage: 14 MB
% 0.98/0.61 % (3011186)Instructions burned: 91 (million)
% 0.98/0.61 % (3011164)Success in time 0.194 s
% 0.98/0.61 % Vampire exiting
%------------------------------------------------------------------------------