%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU103+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 : n011.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:51:56 PM UTC 2026
% Result : Theorem 2.22s 0.85s
% Output : Refutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 74 ( 17 unt; 2 def)
% Number of atoms : 241 ( 22 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 296 ( 129 ~; 129 |; 28 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 73 ( 0 sgn 67 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_xboole_0) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( ~ empty(X0)
& preboolean(X0)
& element(X1,X0)
& element(X2,X0) )
=> element(prebool_union2(X0,X1,X2),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_finsub_1) ).
fof(f11,axiom,
! [X0,X1,X2] :
( ( ~ empty(X0)
& preboolean(X0)
& element(X1,X0)
& element(X2,X0) )
=> element(prebool_difference(X0,X1,X2),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_finsub_1) ).
fof(f31,axiom,
! [X0,X1,X2] :
( ( ~ empty(X0)
& preboolean(X0)
& element(X1,X0)
& element(X2,X0) )
=> prebool_union2(X0,X1,X2) = set_union2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k1_finsub_1) ).
fof(f32,axiom,
! [X0,X1,X2] :
( ( ~ empty(X0)
& preboolean(X0)
& element(X1,X0)
& element(X2,X0) )
=> prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(f34,conjecture,
! [X0,X1,X2] :
( ( ~ empty(X2)
& preboolean(X2) )
=> ( ( element(X0,X2)
& element(X1,X2) )
=> element(symmetric_difference(X0,X1),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_finsub_1) ).
fof(f35,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ empty(X2)
& preboolean(X2) )
=> ( ( element(X0,X2)
& element(X1,X2) )
=> element(symmetric_difference(X0,X1),X2) ) ),
inference(negated_conjecture,[status(cth)],[f34]) ).
fof(f67,plain,
! [X0,X1,X2] :
( element(prebool_union2(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f68,plain,
! [X0,X1,X2] :
( element(prebool_union2(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f70,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(flattening,[],[f69]) ).
fof(f83,plain,
! [X0,X1,X2] :
( prebool_union2(X0,X1,X2) = set_union2(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f84,plain,
! [X0,X1,X2] :
( prebool_union2(X0,X1,X2) = set_union2(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f86,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(flattening,[],[f85]) ).
fof(f87,plain,
? [X0,X1,X2] :
( ~ element(symmetric_difference(X0,X1),X2)
& element(X0,X2)
& element(X1,X2)
& ~ empty(X2)
& preboolean(X2) ),
inference(ennf_transformation,[],[f35]) ).
fof(f88,plain,
? [X0,X1,X2] :
( ~ element(symmetric_difference(X0,X1),X2)
& element(X0,X2)
& element(X1,X2)
& ~ empty(X2)
& preboolean(X2) ),
inference(flattening,[],[f87]) ).
fof(f109,plain,
( ~ element(symmetric_difference(sK10,sK11),sK12)
& element(sK10,sK12)
& element(sK11,sK12)
& ~ empty(sK12)
& preboolean(sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12)],[f88]) ).
fof(f119,plain,
! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f120,plain,
! [X2,X0,X1] :
( element(prebool_union2(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f121,plain,
! [X2,X0,X1] :
( element(prebool_difference(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f153,plain,
! [X2,X0,X1] :
( ~ element(X2,X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| prebool_union2(X0,X1,X2) = set_union2(X1,X2) ),
inference(cnf_transformation,[],[f84]) ).
fof(f154,plain,
! [X2,X0,X1] :
( ~ element(X2,X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(cnf_transformation,[],[f86]) ).
fof(f156,plain,
preboolean(sK12),
inference(cnf_transformation,[],[f109]) ).
fof(f157,plain,
~ empty(sK12),
inference(cnf_transformation,[],[f109]) ).
fof(f158,plain,
element(sK11,sK12),
inference(cnf_transformation,[],[f109]) ).
fof(f159,plain,
element(sK10,sK12),
inference(cnf_transformation,[],[f109]) ).
fof(f160,plain,
~ element(symmetric_difference(sK10,sK11),sK12),
inference(cnf_transformation,[],[f109]) ).
fof(f175,plain,
~ element(set_union2(set_difference(sK10,sK11),set_difference(sK11,sK10)),sK12),
inference(definition_unfolding,[],[f160,f119]) ).
fof(f1577,definition,
( spl13_48
<=> element(set_difference(sK11,sK10),sK12) ),
introduced(definition,[new_symbols(definition,[spl13_48])],[avatar_definition]) ).
fof(f1578,plain,
( element(set_difference(sK11,sK10),sK12)
| ~ spl13_48 ),
inference(avatar_component_clause,[],[f1577]) ).
fof(f1579,plain,
( ~ element(set_difference(sK11,sK10),sK12)
| spl13_48 ),
inference(avatar_component_clause,[],[f1577]) ).
fof(f1581,definition,
( spl13_49
<=> element(set_difference(sK10,sK11),sK12) ),
introduced(definition,[new_symbols(definition,[spl13_49])],[avatar_definition]) ).
fof(f1582,plain,
( element(set_difference(sK10,sK11),sK12)
| ~ spl13_49 ),
inference(avatar_component_clause,[],[f1581]) ).
fof(f1583,plain,
( ~ element(set_difference(sK10,sK11),sK12)
| spl13_49 ),
inference(avatar_component_clause,[],[f1581]) ).
fof(f3217,plain,
! [X0] :
( empty(sK12)
| ~ preboolean(sK12)
| ~ element(X0,sK12)
| set_difference(X0,sK10) = prebool_difference(sK12,X0,sK10) ),
inference(resolution,[],[f154,f159]) ).
fof(f3218,plain,
! [X0] :
( empty(sK12)
| ~ preboolean(sK12)
| ~ element(X0,sK12)
| set_difference(X0,sK11) = prebool_difference(sK12,X0,sK11) ),
inference(resolution,[],[f154,f158]) ).
fof(f3258,plain,
! [X0] :
( ~ preboolean(sK12)
| ~ element(X0,sK12)
| set_difference(X0,sK11) = prebool_difference(sK12,X0,sK11) ),
inference(forward_subsumption_resolution,[],[f3218,f157]) ).
fof(f3259,plain,
! [X0] :
( ~ element(X0,sK12)
| set_difference(X0,sK11) = prebool_difference(sK12,X0,sK11) ),
inference(forward_subsumption_resolution,[],[f3258,f156]) ).
fof(f3395,plain,
set_difference(sK10,sK11) = prebool_difference(sK12,sK10,sK11),
inference(resolution,[],[f3259,f159]) ).
fof(f3414,plain,
( element(set_difference(sK10,sK11),sK12)
| empty(sK12)
| ~ preboolean(sK12)
| ~ element(sK10,sK12)
| ~ element(sK11,sK12) ),
inference(superposition,[],[f121,f3395]) ).
fof(f3415,plain,
( empty(sK12)
| ~ preboolean(sK12)
| ~ element(sK10,sK12)
| ~ element(sK11,sK12)
| spl13_49 ),
inference(forward_subsumption_resolution,[],[f3414,f1583]) ).
fof(f3416,plain,
( ~ preboolean(sK12)
| ~ element(sK10,sK12)
| ~ element(sK11,sK12)
| spl13_49 ),
inference(forward_subsumption_resolution,[],[f3415,f157]) ).
fof(f3417,plain,
( ~ element(sK10,sK12)
| ~ element(sK11,sK12)
| spl13_49 ),
inference(forward_subsumption_resolution,[],[f3416,f156]) ).
fof(f3418,plain,
( ~ element(sK11,sK12)
| spl13_49 ),
inference(forward_subsumption_resolution,[],[f3417,f159]) ).
fof(f3419,plain,
( $false
| spl13_49 ),
inference(forward_subsumption_resolution,[],[f3418,f158]) ).
fof(f3420,plain,
spl13_49,
inference(avatar_contradiction_clause,[],[f3419]) ).
fof(f3682,plain,
! [X0] :
( ~ preboolean(sK12)
| ~ element(X0,sK12)
| set_difference(X0,sK10) = prebool_difference(sK12,X0,sK10) ),
inference(forward_subsumption_resolution,[],[f3217,f157]) ).
fof(f3684,plain,
! [X0] :
( ~ element(X0,sK12)
| set_difference(X0,sK10) = prebool_difference(sK12,X0,sK10) ),
inference(forward_subsumption_resolution,[],[f3682,f156]) ).
fof(f3760,plain,
set_difference(sK11,sK10) = prebool_difference(sK12,sK11,sK10),
inference(resolution,[],[f3684,f158]) ).
fof(f3787,plain,
( element(set_difference(sK11,sK10),sK12)
| empty(sK12)
| ~ preboolean(sK12)
| ~ element(sK11,sK12)
| ~ element(sK10,sK12) ),
inference(superposition,[],[f121,f3760]) ).
fof(f3788,plain,
( empty(sK12)
| ~ preboolean(sK12)
| ~ element(sK11,sK12)
| ~ element(sK10,sK12)
| spl13_48 ),
inference(forward_subsumption_resolution,[],[f3787,f1579]) ).
fof(f3789,plain,
( ~ preboolean(sK12)
| ~ element(sK11,sK12)
| ~ element(sK10,sK12)
| spl13_48 ),
inference(forward_subsumption_resolution,[],[f3788,f157]) ).
fof(f3790,plain,
( ~ element(sK11,sK12)
| ~ element(sK10,sK12)
| spl13_48 ),
inference(forward_subsumption_resolution,[],[f3789,f156]) ).
fof(f3791,plain,
( ~ element(sK10,sK12)
| spl13_48 ),
inference(forward_subsumption_resolution,[],[f3790,f158]) ).
fof(f3792,plain,
( $false
| spl13_48 ),
inference(forward_subsumption_resolution,[],[f3791,f159]) ).
fof(f3793,plain,
spl13_48,
inference(avatar_contradiction_clause,[],[f3792]) ).
fof(f3802,plain,
( ! [X0] :
( empty(sK12)
| ~ preboolean(sK12)
| ~ element(X0,sK12)
| set_union2(X0,set_difference(sK11,sK10)) = prebool_union2(sK12,X0,set_difference(sK11,sK10)) )
| ~ spl13_48 ),
inference(resolution,[],[f1578,f153]) ).
fof(f3805,plain,
( ! [X0] :
( ~ preboolean(sK12)
| ~ element(X0,sK12)
| set_union2(X0,set_difference(sK11,sK10)) = prebool_union2(sK12,X0,set_difference(sK11,sK10)) )
| ~ spl13_48 ),
inference(forward_subsumption_resolution,[],[f3802,f157]) ).
fof(f3807,plain,
( ! [X0] :
( ~ element(X0,sK12)
| set_union2(X0,set_difference(sK11,sK10)) = prebool_union2(sK12,X0,set_difference(sK11,sK10)) )
| ~ spl13_48 ),
inference(forward_subsumption_resolution,[],[f3805,f156]) ).
fof(f3972,plain,
( set_union2(set_difference(sK10,sK11),set_difference(sK11,sK10)) = prebool_union2(sK12,set_difference(sK10,sK11),set_difference(sK11,sK10))
| ~ spl13_48
| ~ spl13_49 ),
inference(resolution,[],[f3807,f1582]) ).
fof(f10295,plain,
( element(set_union2(set_difference(sK10,sK11),set_difference(sK11,sK10)),sK12)
| empty(sK12)
| ~ preboolean(sK12)
| ~ element(set_difference(sK10,sK11),sK12)
| ~ element(set_difference(sK11,sK10),sK12)
| ~ spl13_48
| ~ spl13_49 ),
inference(superposition,[],[f120,f3972]) ).
fof(f10296,plain,
( empty(sK12)
| ~ preboolean(sK12)
| ~ element(set_difference(sK10,sK11),sK12)
| ~ element(set_difference(sK11,sK10),sK12)
| ~ spl13_48
| ~ spl13_49 ),
inference(forward_subsumption_resolution,[],[f10295,f175]) ).
fof(f10298,plain,
( ~ preboolean(sK12)
| ~ element(set_difference(sK10,sK11),sK12)
| ~ element(set_difference(sK11,sK10),sK12)
| ~ spl13_48
| ~ spl13_49 ),
inference(forward_subsumption_resolution,[],[f10296,f157]) ).
fof(f10300,plain,
( ~ element(set_difference(sK10,sK11),sK12)
| ~ element(set_difference(sK11,sK10),sK12)
| ~ spl13_48
| ~ spl13_49 ),
inference(forward_subsumption_resolution,[],[f10298,f156]) ).
fof(f10302,plain,
( ~ element(set_difference(sK11,sK10),sK12)
| ~ spl13_48
| ~ spl13_49 ),
inference(forward_subsumption_resolution,[],[f10300,f1582]) ).
fof(f10304,plain,
( $false
| ~ spl13_48
| ~ spl13_49 ),
inference(forward_subsumption_resolution,[],[f10302,f1578]) ).
fof(f10305,plain,
( ~ spl13_48
| ~ spl13_49 ),
inference(avatar_contradiction_clause,[],[f10304]) ).
cnf(s149,plain,
spl13_49,
inference(sat_conversion,[],[f3420]) ).
cnf(s155,plain,
spl13_48,
inference(sat_conversion,[],[f3793]) ).
cnf(s204,plain,
( ~ spl13_48
| ~ spl13_49 ),
inference(sat_conversion,[],[f10305]) ).
cnf(s206,plain,
~ spl13_49,
inference(rat,[],[s204,s155]) ).
cnf(s208,plain,
$false,
inference(rat,[],[s149,s206]) ).
fof(f10306,plain,
$false,
inference(avatar_sat_refutation,[],[s208]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU103+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 03:34:15 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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
% 2.22/0.85 % (2989226)Will run a generic schedule for satisfiability detection.
% 2.22/0.85 % (2989237)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=384848893:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.22/0.85 % (2989232)% WARNING: option uhcvi not known.
% 2.22/0.85 % (2989231)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2952123491_2999 on theBenchmark for (2999ds/0Mi)
% 2.22/0.85 % (2989233)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=370161658:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.22/0.85 % (2989234)dis+10_1_sil=32000:sp=arity:random_seed=2212402783:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.22/0.85 % (2989235)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=154501454:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.22/0.85 % (2989236)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=832639088:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.22/0.85 % (2989232)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=619751318:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.22/0.85 % TRYING [1]
% 2.22/0.85 % TRYING [2]
% 2.22/0.85 % TRYING [3]
% 2.22/0.85 % TRYING [4]
% 2.22/0.85 % TRYING [5]
% 2.22/0.85 % (2989237)Instruction limit reached!
% 2.22/0.85 % (2989237)------------------------------
% 2.22/0.85 % (2989237)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.85 % (2989237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.85 % (2989237)CaDiCaL version: 2.1.3
% 2.22/0.85 % (2989237)Termination reason: Instruction limit
% 2.22/0.85 % (2989237)Termination phase: Saturation
% 2.22/0.85 % (2989237)Time elapsed: 0.057 s
% 2.22/0.85 % (2989237)Peak memory usage: 14 MB
% 2.22/0.85 % (2989237)Instructions burned: 161 (million)
% 2.22/0.85 % (2989234)Instruction limit reached!
% 2.22/0.85 % (2989234)------------------------------
% 2.22/0.85 % (2989234)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.85 % (2989234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.85 % (2989234)CaDiCaL version: 2.1.3
% 2.22/0.85 % (2989234)Termination reason: Instruction limit
% 2.22/0.85 % (2989234)Termination phase: Saturation
% 2.22/0.85 % (2989234)Time elapsed: 0.058 s
% 2.22/0.85 % (2989234)Peak memory usage: 12 MB
% 2.22/0.85 % (2989234)Instructions burned: 104 (million)
% 2.22/0.85 % (2989245)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=501100211:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.22/0.85 % TRYING [6]
% 2.22/0.85 % TRYING [1]
% 2.22/0.85 % TRYING [2]
% 2.22/0.85 % TRYING [3]
% 2.22/0.85 % (2989235)Instruction limit reached!
% 2.22/0.85 % (2989235)------------------------------
% 2.22/0.85 % (2989235)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.85 % (2989235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.85 % (2989235)CaDiCaL version: 2.1.3
% 2.22/0.85 % (2989235)Termination reason: Instruction limit
% 2.22/0.85 % (2989235)Termination phase: Saturation
% 2.22/0.85 % (2989235)Time elapsed: 0.067 s
% 2.22/0.85 % (2989235)Peak memory usage: 12 MB
% 2.22/0.85 % (2989235)Instructions burned: 116 (million)
% 2.22/0.85 % TRYING [4]
% 2.22/0.85 % TRYING [5]
% 2.22/0.85 % (2989246)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2728466322:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.22/0.85 % (2989236)Instruction limit reached!
% 2.22/0.85 % (2989236)------------------------------
% 2.22/0.85 % (2989236)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.85 % (2989236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.85 % (2989236)CaDiCaL version: 2.1.3
% 2.22/0.85 % (2989236)Termination reason: Instruction limit
% 2.22/0.85 % (2989236)Termination phase: Saturation
% 2.22/0.85 % (2989236)Time elapsed: 0.081 s
% 2.22/0.85 % (2989236)Peak memory usage: 13 MB
% 2.22/0.85 % (2989236)Instructions burned: 132 (million)
% 2.22/0.85 % (2989248)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=777080092:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.22/0.85 % TRYING [6]
% 2.22/0.85 % (2989250)ott-21_1_sil=16000:fs=off:random_seed=1695475719:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.22/0.85 % (2989246)Instruction limit reached!
% 2.22/0.85 % (2989246)------------------------------
% 2.22/0.85 % (2989246)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.85 % (2989246)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.85 % (2989246)CaDiCaL version: 2.1.3
% 2.22/0.85 % (2989246)Termination reason: Instruction limit
% 2.22/0.85 % (2989246)Termination phase: Saturation
% 2.22/0.85 % (2989246)Time elapsed: 0.069 s
% 2.22/0.85 % (2989246)Peak memory usage: 12 MB
% 2.22/0.85 % (2989246)Instructions burned: 133 (million)
% 2.22/0.85 % (2989253)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3380438137:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.22/0.85 % TRYING [7]
% 2.22/0.85 % TRYING [7]
% 2.22/0.85 % (2989250)Instruction limit reached!
% 2.22/0.85 % (2989250)------------------------------
% 2.22/0.85 % (2989250)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.85 % (2989250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.85 % (2989250)CaDiCaL version: 2.1.3
% 2.22/0.85 % (2989250)Termination reason: Instruction limit
% 2.22/0.85 % (2989250)Termination phase: Saturation
% 2.22/0.85 % (2989250)Time elapsed: 0.095 s
% 2.22/0.85 % (2989250)Peak memory usage: 13 MB
% 2.22/0.85 % (2989250)Instructions burned: 182 (million)
% 2.22/0.85 % (2989245)Instruction limit reached!
% 2.22/0.85 % (2989245)------------------------------
% 2.22/0.85 % (2989245)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.85 % (2989245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.85 % (2989245)CaDiCaL version: 2.1.3
% 2.22/0.85 % (2989245)Termination reason: Instruction limit
% 2.22/0.85 % (2989245)Termination phase: Finite model building constraint generation
% 2.22/0.85 % (2989245)Time elapsed: 0.139 s
% 2.22/0.85 % (2989245)Peak memory usage: 27 MB
% 2.22/0.85 % (2989245)Instructions burned: 716 (million)
% 2.22/0.85 % (2989256)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1556402237:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.22/0.85 % (2989255)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=857202855:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.22/0.85 % TRYING [1]
% 2.22/0.85 % TRYING [2]
% 2.22/0.85 % TRYING [3]
% 2.22/0.85 % TRYING [4]
% 2.22/0.85 % TRYING [5]
% 2.22/0.85 % TRYING [6]
% 2.22/0.85 % (2989253) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2989226-2989253"...
% 2.22/0.85 % (2989253)...printing done.
% 2.22/0.85 % (2989253)Refutation found. Thanks to Tanya!
% 2.22/0.85 % SZS status Theorem for theBenchmark
% 2.22/0.85 % SZS output start Proof for theBenchmark
% See solution above
% 2.22/0.85 % (2989253)------------------------------
% 2.22/0.85 % (2989253)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.85 % (2989253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.85 % (2989253)CaDiCaL version: 2.1.3
% 2.22/0.85 % (2989253)Termination reason: Refutation
% 2.22/0.85 % (2989253)Time elapsed: 0.234 s
% 2.22/0.85 % (2989253)Peak memory usage: 15 MB
% 2.22/0.85 % (2989253)Instructions burned: 363 (million)
% 2.22/0.85 % (2989226)Success in time 0.443 s
% 2.22/0.85 % Vampire exiting
%------------------------------------------------------------------------------