%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU154+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:52:08 PM UTC 2026
% Result : Theorem 6.93s 1.40s
% Output : Refutation 6.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 91 ( 14 unt; 3 def)
% Number of atoms : 224 ( 82 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 205 ( 72 ~; 118 |; 2 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 153 ( 0 sgn 151 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f13,conjecture,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f19,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f24,plain,
? [X0,X1] :
( ~ disjoint(singleton(X0),X1)
& ~ in(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f31,plain,
! [X2,X0,X1] :
( X0 != X2
| in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f4]) ).
fof(f32,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f4]) ).
fof(f33,plain,
! [X0,X1] :
( in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0
| singleton(X0) = X1 ),
inference(cnf_transformation,[],[f4]) ).
fof(f34,plain,
! [X0,X1] :
( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1)
| singleton(X0) = X1 ),
inference(cnf_transformation,[],[f4]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f37,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ in(sK2(X0,X1,X2),X2)
| ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X1)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f39,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,X2),X1)
| in(sK2(X0,X1,X2),X2)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f40,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X2)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f41,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f44,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f7]) ).
fof(f48,plain,
~ in(sK3,sK4),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
~ disjoint(singleton(sK3),sK4),
inference(cnf_transformation,[],[f24]) ).
fof(f54,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f19]) ).
fof(f57,plain,
! [X2,X0] :
( ~ in(X2,singleton(X0))
| X0 = X2 ),
inference(equality_resolution,[],[f32]) ).
fof(f58,plain,
! [X2,X1] :
( in(X2,X1)
| singleton(X2) != X1 ),
inference(equality_resolution,[],[f31]) ).
fof(f59,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f58]) ).
fof(f60,plain,
! [X3,X0,X1] :
( ~ in(X3,X0)
| ~ in(X3,X1)
| in(X3,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f43]) ).
fof(f61,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X0) ),
inference(equality_resolution,[],[f42]) ).
fof(f62,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X1) ),
inference(equality_resolution,[],[f41]) ).
fof(f69,plain,
empty_set != set_intersection2(singleton(sK3),sK4),
inference(resolution,[],[f44,f49]) ).
fof(f74,plain,
! [X2,X0,X1] :
( in(sK1(set_intersection2(X0,X1),X2),X0)
| subset(set_intersection2(X0,X1),X2) ),
inference(resolution,[],[f61,f36]) ).
fof(f87,plain,
! [X0,X1] :
( ~ in(X0,empty_set)
| in(X0,X1) ),
inference(resolution,[],[f35,f54]) ).
fof(f93,plain,
! [X2,X0,X1] :
( in(sK0(X0,set_intersection2(X1,X2)),X2)
| singleton(X0) = set_intersection2(X1,X2)
| sK0(X0,set_intersection2(X1,X2)) = X0 ),
inference(resolution,[],[f33,f62]) ).
fof(f94,plain,
! [X2,X0,X1] :
( in(sK0(X0,set_intersection2(X1,X2)),X1)
| singleton(X0) = set_intersection2(X1,X2)
| sK0(X0,set_intersection2(X1,X2)) = X0 ),
inference(resolution,[],[f33,f61]) ).
fof(f97,plain,
! [X2,X3,X0,X1] :
( ~ in(sK2(X0,X1,X2),X3)
| set_intersection2(X0,X1) = X2
| in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),set_intersection2(X1,X3)) ),
inference(resolution,[],[f39,f60]) ).
fof(f108,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,empty_set),X1)
| in(sK2(X0,X1,empty_set),X2)
| set_intersection2(X0,X1) = empty_set ),
inference(resolution,[],[f39,f87]) ).
fof(f114,plain,
! [X2,X0,X1] :
( in(sK2(singleton(X0),X1,X2),X2)
| set_intersection2(singleton(X0),X1) = X2
| sK2(singleton(X0),X1,X2) = X0 ),
inference(resolution,[],[f40,f57]) ).
fof(f121,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,empty_set),X0)
| in(sK2(X0,X1,empty_set),X2)
| set_intersection2(X0,X1) = empty_set ),
inference(resolution,[],[f40,f87]) ).
fof(f161,plain,
! [X0,X1] :
( subset(set_intersection2(X0,X1),X0)
| subset(set_intersection2(X0,X1),X0) ),
inference(resolution,[],[f74,f37]) ).
fof(f171,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(duplicate_literal_removal,[],[f161]) ).
fof(f238,plain,
! [X2,X0,X1] :
( sK0(X0,set_intersection2(X1,singleton(X2))) = X0
| sK0(X0,set_intersection2(X1,singleton(X2))) = X2
| singleton(X0) = set_intersection2(X1,singleton(X2)) ),
inference(resolution,[],[f93,f57]) ).
fof(f280,plain,
! [X2,X0,X1] :
( in(sK2(singleton(X0),X1,empty_set),X2)
| sK2(singleton(X0),X1,empty_set) = X0
| empty_set = set_intersection2(singleton(X0),X1) ),
inference(resolution,[],[f114,f87]) ).
fof(f2026,plain,
! [X0,X1] :
( in(sK2(X0,X1,empty_set),X1)
| set_intersection2(X0,X1) = empty_set ),
inference(factoring,[],[f108]) ).
fof(f2094,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,empty_set),X2)
| set_intersection2(X0,X1) = empty_set
| set_intersection2(X0,X1) = empty_set
| in(sK2(X0,X1,empty_set),empty_set)
| in(sK2(X0,X1,empty_set),set_intersection2(X1,X0)) ),
inference(resolution,[],[f121,f97]) ).
fof(f2131,plain,
! [X0,X1] :
( in(sK2(X0,X1,empty_set),X0)
| set_intersection2(X0,X1) = empty_set ),
inference(factoring,[],[f121]) ).
fof(f2140,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,empty_set),X2)
| set_intersection2(X0,X1) = empty_set
| in(sK2(X0,X1,empty_set),empty_set)
| in(sK2(X0,X1,empty_set),set_intersection2(X1,X0)) ),
inference(duplicate_literal_removal,[],[f2094]) ).
fof(f2147,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,empty_set),X2)
| in(sK2(X0,X1,empty_set),set_intersection2(X1,X0))
| set_intersection2(X0,X1) = empty_set ),
inference(forward_subsumption_resolution,[],[f2140,f87]) ).
fof(f2501,definition,
( spl7_1
<=> subset(singleton(sK3),sK4) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f2503,plain,
( subset(singleton(sK3),sK4)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f2501]) ).
fof(f2698,plain,
! [X0,X1] :
( sK2(singleton(X0),X1,empty_set) = X0
| empty_set = set_intersection2(singleton(X0),X1)
| ~ in(sK2(singleton(X0),X1,empty_set),singleton(X0))
| ~ in(sK2(singleton(X0),X1,empty_set),X1)
| empty_set = set_intersection2(singleton(X0),X1) ),
inference(resolution,[],[f280,f38]) ).
fof(f2733,plain,
! [X0,X1] :
( sK2(singleton(X0),X1,empty_set) = X0
| empty_set = set_intersection2(singleton(X0),X1)
| ~ in(sK2(singleton(X0),X1,empty_set),singleton(X0))
| ~ in(sK2(singleton(X0),X1,empty_set),X1) ),
inference(duplicate_literal_removal,[],[f2698]) ).
fof(f2734,plain,
! [X0,X1] :
( sK2(singleton(X0),X1,empty_set) = X0
| empty_set = set_intersection2(singleton(X0),X1)
| ~ in(sK2(singleton(X0),X1,empty_set),X1) ),
inference(forward_subsumption_resolution,[],[f2733,f280]) ).
fof(f2735,plain,
! [X0,X1] :
( sK2(singleton(X0),X1,empty_set) = X0
| empty_set = set_intersection2(singleton(X0),X1) ),
inference(forward_subsumption_resolution,[],[f2734,f280]) ).
fof(f3121,plain,
! [X2,X0,X1] :
( in(X0,X2)
| singleton(X1) = set_intersection2(X2,singleton(X0))
| X0 = X1
| sK0(X1,set_intersection2(X2,singleton(X0))) = X1
| singleton(X1) = set_intersection2(X2,singleton(X0)) ),
inference(superposition,[],[f94,f238]) ).
fof(f3129,plain,
! [X2,X0,X1] :
( X0 != X2
| sK0(X0,set_intersection2(X1,singleton(X2))) = X0
| singleton(X0) = set_intersection2(X1,singleton(X2)) ),
inference(equality_factoring,[],[f238]) ).
fof(f3136,plain,
! [X2,X0,X1] :
( in(X0,X2)
| singleton(X1) = set_intersection2(X2,singleton(X0))
| X0 = X1
| sK0(X1,set_intersection2(X2,singleton(X0))) = X1 ),
inference(duplicate_literal_removal,[],[f3121]) ).
fof(f29268,plain,
! [X2,X0,X1] :
( in(X0,X2)
| singleton(X1) = set_intersection2(X2,singleton(X0))
| sK0(X1,set_intersection2(X2,singleton(X0))) = X1 ),
inference(forward_subsumption_resolution,[],[f3136,f3129]) ).
fof(f29425,plain,
! [X0] :
( sK0(X0,set_intersection2(sK4,singleton(sK3))) = X0
| singleton(X0) = set_intersection2(sK4,singleton(sK3)) ),
inference(resolution,[],[f29268,f48]) ).
fof(f29574,plain,
! [X0] :
( X0 != X0
| ~ in(X0,set_intersection2(sK4,singleton(sK3)))
| singleton(X0) = set_intersection2(sK4,singleton(sK3))
| singleton(X0) = set_intersection2(sK4,singleton(sK3)) ),
inference(superposition,[],[f34,f29425]) ).
fof(f29575,plain,
! [X0] :
( X0 != X0
| ~ in(X0,set_intersection2(sK4,singleton(sK3)))
| singleton(X0) = set_intersection2(sK4,singleton(sK3)) ),
inference(duplicate_literal_removal,[],[f29574]) ).
fof(f29576,plain,
! [X0] :
( ~ in(X0,set_intersection2(sK4,singleton(sK3)))
| singleton(X0) = set_intersection2(sK4,singleton(sK3)) ),
inference(trivial_inequality_removal,[],[f29575]) ).
fof(f30372,plain,
! [X0] :
( set_intersection2(sK4,singleton(sK3)) = singleton(sK2(singleton(sK3),sK4,empty_set))
| in(sK2(singleton(sK3),sK4,empty_set),X0)
| empty_set = set_intersection2(singleton(sK3),sK4) ),
inference(resolution,[],[f29576,f2147]) ).
fof(f30503,plain,
! [X0] :
( set_intersection2(sK4,singleton(sK3)) = singleton(sK2(singleton(sK3),sK4,empty_set))
| in(sK2(singleton(sK3),sK4,empty_set),X0) ),
inference(forward_subsumption_resolution,[],[f30372,f69]) ).
fof(f30510,definition,
( spl7_78
<=> ! [X0] : in(sK2(singleton(sK3),sK4,empty_set),X0) ),
introduced(definition,[new_symbols(definition,[spl7_78])],[avatar_definition]) ).
fof(f30511,plain,
( ! [X0] : in(sK2(singleton(sK3),sK4,empty_set),X0)
| ~ spl7_78 ),
inference(avatar_component_clause,[],[f30510]) ).
fof(f30513,definition,
( spl7_79
<=> set_intersection2(sK4,singleton(sK3)) = singleton(sK2(singleton(sK3),sK4,empty_set)) ),
introduced(definition,[new_symbols(definition,[spl7_79])],[avatar_definition]) ).
fof(f30515,plain,
( set_intersection2(sK4,singleton(sK3)) = singleton(sK2(singleton(sK3),sK4,empty_set))
| ~ spl7_79 ),
inference(avatar_component_clause,[],[f30513]) ).
fof(f30516,plain,
( spl7_78
| spl7_79 ),
inference(avatar_split_clause,[],[f30503,f30513,f30510]) ).
fof(f31100,plain,
( singleton(sK3) = set_intersection2(sK4,singleton(sK3))
| empty_set = set_intersection2(singleton(sK3),sK4)
| ~ spl7_79 ),
inference(superposition,[],[f30515,f2735]) ).
fof(f31227,plain,
( singleton(sK3) = set_intersection2(sK4,singleton(sK3))
| ~ spl7_79 ),
inference(forward_subsumption_resolution,[],[f31100,f69]) ).
fof(f31298,plain,
( subset(singleton(sK3),sK4)
| ~ spl7_79 ),
inference(superposition,[],[f171,f31227]) ).
fof(f31627,plain,
( spl7_1
| ~ spl7_79 ),
inference(avatar_split_clause,[],[f31298,f30513,f2501]) ).
fof(f32282,plain,
( ~ in(sK2(singleton(sK3),sK4,empty_set),singleton(sK3))
| ~ in(sK2(singleton(sK3),sK4,empty_set),sK4)
| empty_set = set_intersection2(singleton(sK3),sK4)
| ~ spl7_78 ),
inference(resolution,[],[f30511,f38]) ).
fof(f32369,plain,
( ~ in(sK2(singleton(sK3),sK4,empty_set),sK4)
| empty_set = set_intersection2(singleton(sK3),sK4)
| ~ spl7_78 ),
inference(forward_subsumption_resolution,[],[f32282,f2131]) ).
fof(f32370,plain,
( empty_set = set_intersection2(singleton(sK3),sK4)
| ~ spl7_78 ),
inference(forward_subsumption_resolution,[],[f32369,f2026]) ).
fof(f32371,plain,
( $false
| ~ spl7_78 ),
inference(forward_subsumption_resolution,[],[f32370,f69]) ).
fof(f32372,plain,
~ spl7_78,
inference(avatar_contradiction_clause,[],[f32371]) ).
fof(f32391,plain,
( ! [X0] :
( ~ in(X0,singleton(sK3))
| in(X0,sK4) )
| ~ spl7_1 ),
inference(resolution,[],[f2503,f35]) ).
fof(f33086,plain,
( in(sK3,sK4)
| ~ spl7_1 ),
inference(resolution,[],[f32391,f59]) ).
fof(f33282,plain,
( $false
| ~ spl7_1 ),
inference(forward_subsumption_resolution,[],[f33086,f48]) ).
fof(f33283,plain,
~ spl7_1,
inference(avatar_contradiction_clause,[],[f33282]) ).
cnf(s171,plain,
( spl7_78
| spl7_79 ),
inference(sat_conversion,[],[f30516]) ).
cnf(s183,plain,
( spl7_1
| ~ spl7_79 ),
inference(sat_conversion,[],[f31627]) ).
cnf(s192,plain,
~ spl7_78,
inference(sat_conversion,[],[f32372]) ).
cnf(s200,plain,
~ spl7_1,
inference(sat_conversion,[],[f33283]) ).
cnf(s201,plain,
~ spl7_79,
inference(rat,[],[s183,s200]) ).
cnf(s203,plain,
$false,
inference(rat,[],[s171,s201,s192]) ).
fof(f33284,plain,
$false,
inference(avatar_sat_refutation,[],[s203]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU154+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:49:46 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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
% 5.98/1.40 % (2240553)Will run a generic schedule for satisfiability detection.
% 5.98/1.40 % (2240562)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=786514639:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.98/1.40 % (2240559)% WARNING: option uhcvi not known.
% 5.98/1.40 % (2240558)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1291631186_2999 on theBenchmark for (2999ds/0Mi)
% 5.98/1.40 % (2240559)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1240746792:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.98/1.40 % (2240560)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2854229851:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.98/1.40 % (2240561)dis+10_1_sil=32000:sp=arity:random_seed=281698249:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.98/1.40 % (2240564)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4160274507:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.98/1.40 % (2240563)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3902867234:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.98/1.40 % TRYING [1]
% 5.98/1.40 % TRYING [2]
% 5.98/1.40 % TRYING [3]
% 5.98/1.40 % TRYING [4]
% 5.98/1.40 % TRYING [5]
% 5.98/1.40 % TRYING [6]
% 5.98/1.40 % (2240562)Instruction limit reached!
% 5.98/1.40 % (2240562)------------------------------
% 5.98/1.40 % (2240562)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.98/1.40 % (2240562)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.98/1.40 % (2240562)CaDiCaL version: 2.1.3
% 5.98/1.40 % (2240562)Termination reason: Instruction limit
% 5.98/1.40 % (2240562)Termination phase: Saturation
% 5.98/1.40 % (2240562)Time elapsed: 0.036 s
% 5.98/1.40 % (2240562)Peak memory usage: 12 MB
% 5.98/1.40 % (2240562)Instructions burned: 120 (million)
% 5.98/1.40 % (2240572)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1355024817:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.98/1.40 % TRYING [1]
% 5.98/1.40 % TRYING [2]
% 5.98/1.40 % TRYING [3]
% 5.98/1.40 % TRYING [4]
% 5.98/1.40 % TRYING [7]
% 5.98/1.40 % TRYING [5]
% 5.98/1.40 % TRYING [6]
% 5.98/1.40 % (2240561)Instruction limit reached!
% 5.98/1.40 % (2240561)------------------------------
% 5.98/1.40 % (2240561)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.98/1.40 % (2240561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.98/1.40 % (2240561)CaDiCaL version: 2.1.3
% 5.98/1.40 % (2240561)Termination reason: Instruction limit
% 5.98/1.40 % (2240561)Termination phase: Saturation
% 5.98/1.40 % (2240561)Time elapsed: 0.062 s
% 5.98/1.40 % (2240561)Peak memory usage: 12 MB
% 5.98/1.40 % (2240561)Instructions burned: 104 (million)
% 5.98/1.40 % TRYING [7]
% 5.98/1.40 % (2240563)Instruction limit reached!
% 5.98/1.40 % (2240563)------------------------------
% 5.98/1.40 % (2240563)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.98/1.40 % (2240563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.98/1.40 % (2240563)CaDiCaL version: 2.1.3
% 5.98/1.40 % (2240563)Termination reason: Instruction limit
% 5.98/1.40 % (2240563)Termination phase: Saturation
% 5.98/1.40 % (2240563)Time elapsed: 0.073 s
% 5.98/1.40 % (2240563)Peak memory usage: 12 MB
% 5.98/1.40 % (2240563)Instructions burned: 133 (million)
% 5.98/1.40 % (2240574)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3419490639:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.93/1.40 % (2240575)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=493654870:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.93/1.40 % TRYING [8]
% 6.93/1.40 % (2240564)Instruction limit reached!
% 6.93/1.40 % (2240564)------------------------------
% 6.93/1.40 % (2240564)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240564)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240564)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240564)Termination reason: Instruction limit
% 6.93/1.40 % (2240564)Termination phase: Saturation
% 6.93/1.40 % (2240564)Time elapsed: 0.109 s
% 6.93/1.40 % (2240564)Peak memory usage: 13 MB
% 6.93/1.40 % (2240564)Instructions burned: 160 (million)
% 6.93/1.40 % TRYING [8]
% 6.93/1.40 % (2240578)ott-21_1_sil=16000:fs=off:random_seed=727791399:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.93/1.40 % (2240574)Instruction limit reached!
% 6.93/1.40 % (2240574)------------------------------
% 6.93/1.40 % (2240574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240574)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240574)Termination reason: Instruction limit
% 6.93/1.40 % (2240574)Termination phase: Saturation
% 6.93/1.40 % (2240574)Time elapsed: 0.075 s
% 6.93/1.40 % (2240574)Peak memory usage: 12 MB
% 6.93/1.40 % (2240574)Instructions burned: 131 (million)
% 6.93/1.40 % (2240580)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2771837723:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 6.93/1.40 % (2240572)Instruction limit reached!
% 6.93/1.40 % (2240572)------------------------------
% 6.93/1.40 % (2240572)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240572)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240572)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240572)Termination reason: Instruction limit
% 6.93/1.40 % (2240572)Termination phase: Finite model building SAT solving
% 6.93/1.40 % (2240572)Time elapsed: 0.171 s
% 6.93/1.40 % (2240572)Peak memory usage: 23 MB
% 6.93/1.40 % (2240572)Instructions burned: 715 (million)
% 6.93/1.40 % (2240582)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2124801542:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.93/1.40 % TRYING [1]
% 6.93/1.40 % TRYING [2]
% 6.93/1.40 % TRYING [3]
% 6.93/1.40 % TRYING [4]
% 6.93/1.40 % (2240578)Instruction limit reached!
% 6.93/1.40 % (2240578)------------------------------
% 6.93/1.40 % (2240578)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240578)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240578)Termination reason: Instruction limit
% 6.93/1.40 % (2240578)Termination phase: Saturation
% 6.93/1.40 % (2240578)Time elapsed: 0.091 s
% 6.93/1.40 % (2240578)Peak memory usage: 12 MB
% 6.93/1.40 % (2240578)Instructions burned: 182 (million)
% 6.93/1.40 % TRYING [5]
% 6.93/1.40 % TRYING [6]
% 6.93/1.40 % (2240584)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3762481728:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 6.93/1.40 % TRYING [7]
% 6.93/1.40 % TRYING [8]
% 6.93/1.40 % TRYING [9]
% 6.93/1.40 % (2240582)Instruction limit reached!
% 6.93/1.40 % (2240582)------------------------------
% 6.93/1.40 % (2240582)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240582)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240582)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240582)Termination reason: Instruction limit
% 6.93/1.40 % (2240582)Termination phase: Finite model building SAT solving
% 6.93/1.40 % (2240582)Time elapsed: 0.182 s
% 6.93/1.40 % (2240582)Peak memory usage: 21 MB
% 6.93/1.40 % (2240582)Instructions burned: 865 (million)
% 6.93/1.40 % (2240586)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3624061521:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 6.93/1.40 % TRYING [14]
% 6.93/1.40 % (2240580)Instruction limit reached!
% 6.93/1.40 % (2240580)------------------------------
% 6.93/1.40 % (2240580)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240580)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240580)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240580)Termination reason: Instruction limit
% 6.93/1.40 % (2240580)Termination phase: Saturation
% 6.93/1.40 % (2240580)Time elapsed: 0.320 s
% 6.93/1.40 % (2240580)Peak memory usage: 13 MB
% 6.93/1.40 % (2240580)Instructions burned: 478 (million)
% 6.93/1.40 % (2240575)Instruction limit reached!
% 6.93/1.40 % (2240575)------------------------------
% 6.93/1.40 % (2240575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240575)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240575)Termination reason: Instruction limit
% 6.93/1.40 % (2240575)Termination phase: Saturation
% 6.93/1.40 % (2240575)Time elapsed: 0.405 s
% 6.93/1.40 % (2240575)Peak memory usage: 16 MB
% 6.93/1.40 % (2240575)Instructions burned: 685 (million)
% 6.93/1.40 % (2240588)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1814116103:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 6.93/1.40 % (2240589)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3607370054:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 6.93/1.40 % (2240586)Instruction limit reached!
% 6.93/1.40 % (2240586)------------------------------
% 6.93/1.40 % (2240586)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240586)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240586)Termination reason: Instruction limit
% 6.93/1.40 % (2240586)Termination phase: Finite model building constraint generation
% 6.93/1.40 % (2240586)Time elapsed: 0.230 s
% 6.93/1.40 % (2240586)Peak memory usage: 69 MB
% 6.93/1.40 % (2240586)Instructions burned: 890 (million)
% 6.93/1.40 % (2240592)fmb+10_1_sil=64000:random_seed=2012087819:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 6.93/1.40 % TRYING [1]
% 6.93/1.40 % TRYING [2]
% 6.93/1.40 % TRYING [3]
% 6.93/1.40 % TRYING [4]
% 6.93/1.40 % TRYING [5]
% 6.93/1.40 % TRYING [6]
% 6.93/1.40 % TRYING [7]
% 6.93/1.40 % TRYING [8]
% 6.93/1.40 % TRYING [9]
% 6.93/1.40 % (2240584)Instruction limit reached!
% 6.93/1.40 % (2240584)------------------------------
% 6.93/1.40 % (2240584)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240584)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240584)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240584)Termination reason: Instruction limit
% 6.93/1.40 % (2240584)Termination phase: Saturation
% 6.93/1.40 % (2240584)Time elapsed: 0.644 s
% 6.93/1.40 % (2240584)Peak memory usage: 18 MB
% 6.93/1.40 % (2240584)Instructions burned: 1180 (million)
% 6.93/1.40 % (2240589)Instruction limit reached!
% 6.93/1.40 % (2240589)------------------------------
% 6.93/1.40 % (2240589)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240589)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240589)Termination reason: Instruction limit
% 6.93/1.40 % (2240589)Termination phase: Saturation
% 6.93/1.40 % (2240589)Time elapsed: 0.384 s
% 6.93/1.40 % (2240589)Peak memory usage: 15 MB
% 6.93/1.40 % (2240589)Instructions burned: 879 (million)
% 6.93/1.40 % (2240594)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1346971080:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 6.93/1.40 % TRYING [20]
% 6.93/1.40 % (2240595)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2362506638:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 6.93/1.40 % TRYING [8]
% 6.93/1.40 % (2240559) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2240553-2240559"...
% 6.93/1.40 % (2240559)...printing done.
% 6.93/1.40 % (2240559)Refutation found. Thanks to Tanya!
% 6.93/1.40 % SZS status Theorem for theBenchmark
% 6.93/1.40 % SZS output start Proof for theBenchmark
% See solution above
% 6.93/1.40 % (2240559)------------------------------
% 6.93/1.40 % (2240559)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.93/1.40 % (2240559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.40 % (2240559)CaDiCaL version: 2.1.3
% 6.93/1.40 % (2240559)Termination reason: Refutation
% 6.93/1.40 % (2240559)Time elapsed: 0.931 s
% 6.93/1.40 % (2240559)Peak memory usage: 20 MB
% 6.93/1.40 % (2240559)Instructions burned: 1735 (million)
% 6.93/1.40 % (2240553)Success in time 0.976 s
% 6.93/1.40 % Vampire exiting
%------------------------------------------------------------------------------