%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET930+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:45:02 PM UTC 2026
% Result : Theorem 0.06s 0.43s
% Output : Refutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 8
% Syntax : Number of formulae : 87 ( 15 unt; 2 def)
% Number of atoms : 224 ( 105 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 256 ( 119 ~; 102 |; 29 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 100 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<=> ( ~ in(X0,X2)
& ( in(X1,X2)
| X0 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l39_zfmisc_1) ).
fof(f7,axiom,
! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
<=> ( ~ in(X0,X2)
& ~ in(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t72_zfmisc_1) ).
fof(f8,axiom,
! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = empty_set
<=> ( in(X0,X2)
& in(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t73_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1,X2] :
~ ( set_difference(unordered_pair(X0,X1),X2) != empty_set
& set_difference(unordered_pair(X0,X1),X2) != singleton(X0)
& set_difference(unordered_pair(X0,X1),X2) != singleton(X1)
& set_difference(unordered_pair(X0,X1),X2) != unordered_pair(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t74_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( set_difference(unordered_pair(X0,X1),X2) != empty_set
& set_difference(unordered_pair(X0,X1),X2) != singleton(X0)
& set_difference(unordered_pair(X0,X1),X2) != singleton(X1)
& set_difference(unordered_pair(X0,X1),X2) != unordered_pair(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
? [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) != empty_set
& set_difference(unordered_pair(X0,X1),X2) != singleton(X0)
& set_difference(unordered_pair(X0,X1),X2) != singleton(X1)
& set_difference(unordered_pair(X0,X1),X2) != unordered_pair(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| in(X0,X2)
| ( ~ in(X1,X2)
& X0 != X1 ) )
& ( ( ~ in(X0,X2)
& ( in(X1,X2)
| X0 = X1 ) )
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| in(X0,X2)
| ( ~ in(X1,X2)
& X0 != X1 ) )
& ( ( ~ in(X0,X2)
& ( in(X1,X2)
| X0 = X1 ) )
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) ) ),
inference(flattening,[],[f13]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
| in(X0,X2)
| in(X1,X2) )
& ( ( ~ in(X0,X2)
& ~ in(X1,X2) )
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
| in(X0,X2)
| in(X1,X2) )
& ( ( ~ in(X0,X2)
& ~ in(X1,X2) )
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = empty_set
| ~ in(X0,X2)
| ~ in(X1,X2) )
& ( ( in(X0,X2)
& in(X1,X2) )
| empty_set != set_difference(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = empty_set
| ~ in(X0,X2)
| ~ in(X1,X2) )
& ( ( in(X0,X2)
& in(X1,X2) )
| empty_set != set_difference(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
( empty_set != set_difference(unordered_pair(sK2,sK3),sK4)
& set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2)
& set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK3)
& unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f26,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) != singleton(X0)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| in(X0,X2)
| X0 != X1 ),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ in(X1,X2)
| in(X0,X2)
| set_difference(unordered_pair(X0,X1),X2) = singleton(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f33,plain,
! [X2,X0,X1] :
( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ in(X1,X2)
| ~ in(X0,X2)
| empty_set = set_difference(unordered_pair(X0,X1),X2) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4),
inference(cnf_transformation,[],[f21]) ).
fof(f38,plain,
set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK3),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
set_difference(unordered_pair(sK2,sK3),sK4) != singleton(sK2),
inference(cnf_transformation,[],[f21]) ).
fof(f40,plain,
empty_set != set_difference(unordered_pair(sK2,sK3),sK4),
inference(cnf_transformation,[],[f21]) ).
fof(f41,plain,
! [X2,X1] :
( in(X1,X2)
| singleton(X1) = set_difference(unordered_pair(X1,X1),X2) ),
inference(equality_resolution,[],[f27]) ).
fof(f243,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) != singleton(X1)
| ~ in(X1,X2) ),
inference(superposition,[],[f26,f23]) ).
fof(f278,plain,
! [X0,X1] :
( ~ in(X1,X0)
| singleton(X0) = set_difference(unordered_pair(X0,X0),X1) ),
inference(resolution,[],[f41,f22]) ).
fof(f290,plain,
! [X0,X1] :
( singleton(X0) = set_difference(unordered_pair(X0,X0),X1)
| singleton(X1) = set_difference(unordered_pair(X1,X1),X0) ),
inference(resolution,[],[f278,f41]) ).
fof(f358,plain,
! [X0,X1] :
( in(X0,X1)
| unordered_pair(X0,X0) = set_difference(unordered_pair(X0,X0),X1) ),
inference(factoring,[],[f33]) ).
fof(f461,plain,
! [X2,X0,X1] :
( ~ in(X0,X1)
| empty_set = set_difference(unordered_pair(X0,X2),X1)
| singleton(X2) = set_difference(unordered_pair(X2,X2),X1) ),
inference(resolution,[],[f36,f41]) ).
fof(f487,plain,
! [X2,X0,X1] :
( in(X0,X1)
| singleton(X0) = set_difference(unordered_pair(X0,X2),X1)
| singleton(X2) = set_difference(unordered_pair(X2,X2),X1) ),
inference(resolution,[],[f28,f41]) ).
fof(f509,plain,
! [X0] :
( singleton(X0) != singleton(X0)
| singleton(X0) = set_difference(unordered_pair(X0,X0),X0) ),
inference(equality_factoring,[],[f290]) ).
fof(f510,plain,
! [X0] : singleton(X0) = set_difference(unordered_pair(X0,X0),X0),
inference(trivial_inequality_removal,[],[f509]) ).
fof(f525,plain,
! [X0] :
( singleton(X0) != singleton(X0)
| ~ in(X0,X0) ),
inference(superposition,[],[f243,f510]) ).
fof(f526,plain,
! [X0] : ~ in(X0,X0),
inference(trivial_inequality_removal,[],[f525]) ).
fof(f530,plain,
! [X0] : ~ in(X0,X0),
inference(global_subsumption,[],[f526]) ).
fof(f532,plain,
! [X0] : unordered_pair(X0,X0) = set_difference(unordered_pair(X0,X0),X0),
inference(resolution,[],[f530,f358]) ).
fof(f536,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(forward_demodulation,[],[f532,f510]) ).
fof(f537,plain,
! [X0,X1] :
( singleton(X0) != set_difference(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(superposition,[],[f26,f536]) ).
fof(f844,plain,
! [X2,X0,X1] :
( ~ in(X0,X1)
| singleton(X2) = set_difference(singleton(X2),X1)
| empty_set = set_difference(unordered_pair(X0,X2),X1) ),
inference(forward_demodulation,[],[f461,f536]) ).
fof(f850,plain,
! [X2,X0,X1] :
( singleton(X0) = set_difference(singleton(X0),X1)
| empty_set = set_difference(unordered_pair(X2,X0),X1)
| singleton(X2) = set_difference(unordered_pair(X2,X2),X1) ),
inference(resolution,[],[f844,f41]) ).
fof(f851,plain,
! [X2,X0,X1] :
( empty_set = set_difference(unordered_pair(X2,X0),X1)
| singleton(X0) = set_difference(singleton(X0),X1)
| singleton(X2) = set_difference(singleton(X2),X1) ),
inference(forward_demodulation,[],[f850,f536]) ).
fof(f913,plain,
! [X2,X0,X1] :
( in(X0,X1)
| singleton(X2) = set_difference(singleton(X2),X1)
| singleton(X0) = set_difference(unordered_pair(X0,X2),X1) ),
inference(forward_demodulation,[],[f487,f536]) ).
fof(f1706,plain,
( empty_set != empty_set
| singleton(sK3) = set_difference(singleton(sK3),sK4)
| singleton(sK2) = set_difference(singleton(sK2),sK4) ),
inference(superposition,[],[f40,f851]) ).
fof(f1741,plain,
( singleton(sK3) = set_difference(singleton(sK3),sK4)
| singleton(sK2) = set_difference(singleton(sK2),sK4) ),
inference(trivial_inequality_removal,[],[f1706]) ).
fof(f1758,definition,
( spl5_24
<=> singleton(sK2) = set_difference(singleton(sK2),sK4) ),
introduced(definition,[new_symbols(definition,[spl5_24])],[avatar_definition]) ).
fof(f1759,plain,
( singleton(sK2) != set_difference(singleton(sK2),sK4)
| spl5_24 ),
inference(avatar_component_clause,[],[f1758]) ).
fof(f1760,plain,
( singleton(sK2) = set_difference(singleton(sK2),sK4)
| ~ spl5_24 ),
inference(avatar_component_clause,[],[f1758]) ).
fof(f1762,definition,
( spl5_25
<=> singleton(sK3) = set_difference(singleton(sK3),sK4) ),
introduced(definition,[new_symbols(definition,[spl5_25])],[avatar_definition]) ).
fof(f1763,plain,
( singleton(sK3) != set_difference(singleton(sK3),sK4)
| spl5_25 ),
inference(avatar_component_clause,[],[f1762]) ).
fof(f1764,plain,
( singleton(sK3) = set_difference(singleton(sK3),sK4)
| ~ spl5_25 ),
inference(avatar_component_clause,[],[f1762]) ).
fof(f1765,plain,
( spl5_24
| spl5_25 ),
inference(avatar_split_clause,[],[f1741,f1762,f1758]) ).
fof(f1768,plain,
( singleton(sK2) != singleton(sK2)
| ~ in(sK2,sK4)
| ~ spl5_24 ),
inference(superposition,[],[f537,f1760]) ).
fof(f1769,plain,
( ~ in(sK2,sK4)
| ~ spl5_24 ),
inference(trivial_inequality_removal,[],[f1768]) ).
fof(f1779,plain,
( ! [X0] :
( singleton(sK2) = set_difference(unordered_pair(sK2,X0),sK4)
| singleton(X0) = set_difference(singleton(X0),sK4) )
| ~ spl5_24 ),
inference(resolution,[],[f1769,f913]) ).
fof(f2720,plain,
( singleton(sK2) != singleton(sK2)
| singleton(sK3) = set_difference(singleton(sK3),sK4)
| ~ spl5_24 ),
inference(superposition,[],[f39,f1779]) ).
fof(f2740,plain,
( singleton(sK3) = set_difference(singleton(sK3),sK4)
| ~ spl5_24 ),
inference(trivial_inequality_removal,[],[f2720]) ).
fof(f2746,plain,
( singleton(sK3) = set_difference(singleton(sK3),sK4)
| ~ spl5_24 ),
inference(global_subsumption,[],[f2740]) ).
fof(f2829,plain,
( singleton(sK3) != singleton(sK3)
| ~ in(sK3,sK4)
| ~ spl5_25 ),
inference(superposition,[],[f537,f1764]) ).
fof(f2830,plain,
( ~ in(sK3,sK4)
| ~ spl5_25 ),
inference(trivial_inequality_removal,[],[f2829]) ).
fof(f2833,plain,
( ! [X0] :
( in(X0,sK4)
| unordered_pair(X0,sK3) = set_difference(unordered_pair(X0,sK3),sK4) )
| ~ spl5_25 ),
inference(resolution,[],[f2830,f33]) ).
fof(f3057,plain,
( singleton(sK2) != singleton(sK2)
| ~ in(sK2,sK4)
| ~ spl5_24 ),
inference(superposition,[],[f537,f1760]) ).
fof(f3058,plain,
( ~ in(sK2,sK4)
| ~ spl5_24 ),
inference(trivial_inequality_removal,[],[f3057]) ).
fof(f3059,plain,
( unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4)
| ~ spl5_24
| ~ spl5_25 ),
inference(resolution,[],[f3058,f2833]) ).
fof(f3084,plain,
( $false
| ~ spl5_24
| ~ spl5_25 ),
inference(forward_subsumption_resolution,[],[f3059,f37]) ).
fof(f3085,plain,
( ~ spl5_24
| ~ spl5_25 ),
inference(avatar_contradiction_clause,[],[f3084]) ).
fof(f3253,plain,
( $false
| ~ spl5_24
| spl5_25 ),
inference(global_subsumption,[],[f1763,f2746]) ).
fof(f3254,plain,
( ~ spl5_24
| spl5_25 ),
inference(avatar_contradiction_clause,[],[f3253]) ).
fof(f3257,plain,
( singleton(sK3) != singleton(sK3)
| ~ in(sK3,sK4)
| ~ spl5_25 ),
inference(superposition,[],[f537,f1764]) ).
fof(f3258,plain,
( ~ in(sK3,sK4)
| ~ spl5_25 ),
inference(trivial_inequality_removal,[],[f3257]) ).
fof(f3268,plain,
( ! [X0] :
( singleton(sK3) = set_difference(unordered_pair(sK3,X0),sK4)
| singleton(X0) = set_difference(singleton(X0),sK4) )
| ~ spl5_25 ),
inference(resolution,[],[f3258,f913]) ).
fof(f3365,plain,
( ! [X0] :
( singleton(sK3) = set_difference(unordered_pair(X0,sK3),sK4)
| singleton(X0) = set_difference(singleton(X0),sK4) )
| ~ spl5_25 ),
inference(superposition,[],[f3268,f23]) ).
fof(f4264,plain,
( singleton(sK3) != singleton(sK3)
| singleton(sK2) = set_difference(singleton(sK2),sK4)
| ~ spl5_25 ),
inference(superposition,[],[f38,f3365]) ).
fof(f4266,plain,
( singleton(sK2) = set_difference(singleton(sK2),sK4)
| ~ spl5_25 ),
inference(trivial_inequality_removal,[],[f4264]) ).
fof(f4272,plain,
( $false
| spl5_24
| ~ spl5_25 ),
inference(forward_subsumption_resolution,[],[f4266,f1759]) ).
fof(f4273,plain,
( spl5_24
| ~ spl5_25 ),
inference(avatar_contradiction_clause,[],[f4272]) ).
cnf(s985,plain,
( spl5_24
| spl5_25 ),
inference(sat_conversion,[],[f1765]) ).
cnf(s1606,plain,
( ~ spl5_24
| ~ spl5_25 ),
inference(sat_conversion,[],[f3085]) ).
cnf(s1677,plain,
( ~ spl5_24
| spl5_25 ),
inference(sat_conversion,[],[f3254]) ).
cnf(s2070,plain,
( spl5_24
| ~ spl5_25 ),
inference(sat_conversion,[],[f4273]) ).
cnf(s2089,plain,
spl5_24,
inference(rat,[],[s985,s2070]) ).
cnf(s2090,plain,
spl5_25,
inference(rat,[],[s1677,s2089]) ).
cnf(s2091,plain,
$false,
inference(rat,[],[s1606,s2090,s2089]) ).
fof(f4277,plain,
$false,
inference(avatar_sat_refutation,[],[s2091]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET930+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.02/0.30 % Computer : n012.cluster.edu
% 0.02/0.30 % Model : x86_64 x86_64
% 0.02/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30 % Memory : 8046.5625MB
% 0.02/0.30 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Mon Sep 28 03:11:04 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.02/0.32 Running first-order model finding
% 0.02/0.32 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.06/0.43 % (2981232)Will run a generic schedule for satisfiability detection.
% 0.06/0.43 % (2981238)% WARNING: option uhcvi not known.
% 0.06/0.43 % (2981239)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3405700996:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.43 % (2981241)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4135809694:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.06/0.43 % (2981237)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=215249929_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.43 % (2981238)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1538573864:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.06/0.43 % (2981240)dis+10_1_sil=32000:sp=arity:random_seed=1404325879:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.06/0.43 % (2981243)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=790826929:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.06/0.43 % (2981242)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2378422204:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.06/0.43 % TRYING [1]
% 0.06/0.43 % TRYING [2]
% 0.06/0.43 % TRYING [3]
% 0.06/0.43 % TRYING [4]
% 0.06/0.43 % TRYING [5]
% 0.06/0.43 % TRYING [6]
% 0.06/0.43 % (2981240)Instruction limit reached!
% 0.06/0.43 % (2981240)------------------------------
% 0.06/0.43 % (2981240)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.43 % (2981240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.43 % (2981240)CaDiCaL version: 2.1.3
% 0.06/0.43 % (2981240)Termination reason: Instruction limit
% 0.06/0.43 % (2981240)Termination phase: Saturation
% 0.06/0.43 % (2981240)Time elapsed: 0.028 s
% 0.06/0.43 % (2981240)Peak memory usage: 11 MB
% 0.06/0.43 % (2981240)Instructions burned: 103 (million)
% 0.06/0.43 % (2981241)Instruction limit reached!
% 0.06/0.43 % (2981241)------------------------------
% 0.06/0.43 % (2981241)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.43 % (2981241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.43 % (2981241)CaDiCaL version: 2.1.3
% 0.06/0.43 % (2981241)Termination reason: Instruction limit
% 0.06/0.43 % (2981241)Termination phase: Saturation
% 0.06/0.43 % (2981241)Time elapsed: 0.032 s
% 0.06/0.43 % (2981241)Peak memory usage: 12 MB
% 0.06/0.43 % (2981241)Instructions burned: 118 (million)
% 0.06/0.43 % (2981242)Instruction limit reached!
% 0.06/0.43 % (2981242)------------------------------
% 0.06/0.43 % (2981242)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.43 % (2981242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.43 % (2981242)CaDiCaL version: 2.1.3
% 0.06/0.43 % (2981242)Termination reason: Instruction limit
% 0.06/0.43 % (2981242)Termination phase: Saturation
% 0.06/0.43 % (2981242)Time elapsed: 0.036 s
% 0.06/0.43 % (2981242)Peak memory usage: 11 MB
% 0.06/0.43 % (2981242)Instructions burned: 134 (million)
% 0.06/0.43 % (2981251)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3307289453:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.06/0.43 % TRYING [1]
% 0.06/0.43 % TRYING [2]
% 0.06/0.43 % TRYING [3]
% 0.06/0.43 % (2981252)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2153524515:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.06/0.43 % TRYING [4]
% 0.06/0.43 % TRYING [7]
% 0.06/0.43 % (2981243)Instruction limit reached!
% 0.06/0.43 % (2981243)------------------------------
% 0.06/0.43 % (2981243)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.43 % (2981243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.43 % (2981243)CaDiCaL version: 2.1.3
% 0.06/0.43 % (2981243)Termination reason: Instruction limit
% 0.06/0.43 % (2981243)Termination phase: Saturation
% 0.06/0.43 % (2981243)Time elapsed: 0.044 s
% 0.06/0.43 % (2981243)Peak memory usage: 12 MB
% 0.06/0.43 % (2981243)Instructions burned: 162 (million)
% 0.06/0.43 % (2981253)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=1838888797:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.06/0.43 % (2981256)ott-21_1_sil=16000:fs=off:random_seed=3275470919:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.06/0.43 % (2981239) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2981232-2981239"...
% 0.06/0.43 % (2981252)Instruction limit reached!
% 0.06/0.43 % (2981252)------------------------------
% 0.06/0.43 % (2981252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.43 % (2981252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.43 % (2981252)CaDiCaL version: 2.1.3
% 0.06/0.43 % (2981252)Termination reason: Instruction limit
% 0.06/0.43 % (2981252)Termination phase: Saturation
% 0.06/0.43 % (2981252)Time elapsed: 0.032 s
% 0.06/0.43 % (2981252)Peak memory usage: 11 MB
% 0.06/0.43 % (2981252)Instructions burned: 132 (million)
% 0.06/0.43 % TRYING [5]
% 0.06/0.43 % (2981239)...printing done.
% 0.06/0.43 % (2981239)Refutation found. Thanks to Tanya!
% 0.06/0.43 % SZS status Theorem for theBenchmark
% 0.06/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.43 % (2981239)------------------------------
% 0.06/0.43 % (2981239)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.43 % (2981239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.43 % (2981239)CaDiCaL version: 2.1.3
% 0.06/0.43 % (2981239)Termination reason: Refutation
% 0.06/0.43 % (2981239)Time elapsed: 0.076 s
% 0.06/0.43 % (2981239)Peak memory usage: 14 MB
% 0.06/0.43 % (2981239)Instructions burned: 242 (million)
% 0.06/0.43 % (2981232)Success in time 0.102 s
% 0.06/0.43 % Vampire exiting
%------------------------------------------------------------------------------