%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU147+2 : 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 : n014.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:06 PM UTC 2026
% Result : Theorem 1.88s 0.77s
% Output : Refutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 91 ( 35 unt; 2 def)
% Number of atoms : 256 ( 99 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 271 ( 106 ~; 107 |; 44 &)
% ( 9 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 143 ( 135 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f9,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f10,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f12,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f16,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( subset(X0,X1)
& X0 != X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f31,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f35,axiom,
? [X0] : empty(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(f37,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f39,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f44,conjecture,
powerset(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_zfmisc_1) ).
fof(f45,negated_conjecture,
powerset(empty_set) != singleton(empty_set),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f57,axiom,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f63,axiom,
! [X0,X1] :
~ ( subset(X0,X1)
& proper_subset(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f65,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f66,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f68,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f75,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f37]) ).
fof(f76,plain,
powerset(empty_set) != singleton(empty_set),
inference(flattening,[],[f45]) ).
fof(f79,plain,
! [X0,X1] :
( ( subset(X0,X1)
& X0 != X1 )
=> proper_subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f82,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f83,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f79]) ).
fof(f84,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f83]) ).
fof(f90,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f100,plain,
! [X0] :
( X0 = empty_set
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f57]) ).
fof(f103,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ proper_subset(X1,X0) ),
inference(ennf_transformation,[],[f63]) ).
fof(f106,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f66]) ).
fof(f111,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f112,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f111]) ).
fof(f119,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f120,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f119]) ).
fof(f121,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f120]) ).
fof(f122,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f123,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f122]) ).
fof(f124,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f123]) ).
fof(f125,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK3(X0,X1,X2) != X0
& sK3(X0,X1,X2) != X1 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X0
| sK3(X0,X1,X2) = X1
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f124]) ).
fof(f130,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f82]) ).
fof(f131,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f130]) ).
fof(f132,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK5(X0,X1),X1)
& in(sK5(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f131]) ).
fof(f142,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f146,plain,
empty(sK8),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X0,sK8)],[f35]) ).
fof(f161,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f112]) ).
fof(f168,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f121]) ).
fof(f169,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f121]) ).
fof(f173,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f125]) ).
fof(f185,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK5(X0,X1),X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f186,plain,
! [X0,X1] :
( ~ in(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f132]) ).
fof(f201,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| proper_subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f84]) ).
fof(f210,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
fof(f217,plain,
empty(sK8),
inference(cnf_transformation,[],[f146]) ).
fof(f219,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f75]) ).
fof(f221,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f90]) ).
fof(f226,plain,
powerset(empty_set) != singleton(empty_set),
inference(cnf_transformation,[],[f76]) ).
fof(f242,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f100]) ).
fof(f249,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ proper_subset(X1,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f251,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f65]) ).
fof(f252,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f106]) ).
fof(f254,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f68]) ).
fof(f274,plain,
! [X0,X1] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f210,f251]) ).
fof(f282,plain,
powerset(empty_set) != unordered_pair(empty_set,empty_set),
inference(definition_unfolding,[],[f226,f251]) ).
fof(f294,plain,
! [X3,X0] :
( ~ subset(X3,X0)
| in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f169]) ).
fof(f295,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f168]) ).
fof(f298,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f173]) ).
fof(f299,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f298]) ).
fof(f312,definition,
sF13 = powerset(empty_set),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f313,plain,
powerset(empty_set) = sF13,
inference(reorient_equations,[],[f312]) ).
fof(f314,definition,
sF14 = unordered_pair(empty_set,empty_set),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f315,plain,
unordered_pair(empty_set,empty_set) = sF14,
inference(reorient_equations,[],[f314]) ).
fof(f316,plain,
sF13 != sF14,
inference(definition_folding,[],[f282,f315,f313]) ).
fof(f336,plain,
empty_set = sK8,
inference(resolution,[],[f252,f217]) ).
fof(f346,plain,
sF13 = powerset(sK8),
inference(superposition,[],[f313,f336]) ).
fof(f350,plain,
unordered_pair(empty_set,empty_set) != sF13,
inference(superposition,[],[f316,f315]) ).
fof(f351,plain,
sF13 != unordered_pair(sK8,sK8),
inference(forward_demodulation,[],[f350,f336]) ).
fof(f356,plain,
! [X0] :
( ~ subset(X0,sK8)
| sK8 = X0 ),
inference(superposition,[],[f242,f336]) ).
fof(f447,plain,
! [X0] : in(X0,powerset(X0)),
inference(resolution,[],[f294,f219]) ).
fof(f459,plain,
in(sK8,sF13),
inference(superposition,[],[f447,f346]) ).
fof(f464,plain,
! [X0] :
( ~ in(X0,sF13)
| subset(X0,sK8) ),
inference(superposition,[],[f295,f346]) ).
fof(f552,plain,
! [X0,X1] :
( ~ in(X0,X1)
| set_union2(unordered_pair(X0,X0),X1) = X1 ),
inference(resolution,[],[f274,f221]) ).
fof(f589,plain,
! [X0,X1] :
( ~ proper_subset(X1,X0)
| in(sK5(X0,X1),X0) ),
inference(resolution,[],[f185,f249]) ).
fof(f785,plain,
! [X0,X1] :
( ~ subset(set_union2(X0,X1),X0)
| set_union2(X0,X1) = X0 ),
inference(resolution,[],[f161,f254]) ).
fof(f830,plain,
! [X0,X1] :
( proper_subset(X0,set_union2(X0,X1))
| set_union2(X0,X1) = X0 ),
inference(resolution,[],[f201,f254]) ).
fof(f3962,plain,
sF13 = set_union2(unordered_pair(sK8,sK8),sF13),
inference(resolution,[],[f552,f459]) ).
fof(f4495,plain,
( ~ subset(sF13,unordered_pair(sK8,sK8))
| sF13 = unordered_pair(sK8,sK8) ),
inference(superposition,[],[f785,f3962]) ).
fof(f4496,plain,
( proper_subset(unordered_pair(sK8,sK8),sF13)
| sF13 = unordered_pair(sK8,sK8) ),
inference(superposition,[],[f830,f3962]) ).
fof(f4499,plain,
proper_subset(unordered_pair(sK8,sK8),sF13),
inference(forward_subsumption_resolution,[],[f4496,f351]) ).
fof(f4500,plain,
~ subset(sF13,unordered_pair(sK8,sK8)),
inference(forward_subsumption_resolution,[],[f4495,f351]) ).
fof(f4567,plain,
in(sK5(sF13,unordered_pair(sK8,sK8)),sF13),
inference(resolution,[],[f4499,f589]) ).
fof(f4648,plain,
subset(sK5(sF13,unordered_pair(sK8,sK8)),sK8),
inference(resolution,[],[f4567,f464]) ).
fof(f4725,plain,
sK8 = sK5(sF13,unordered_pair(sK8,sK8)),
inference(resolution,[],[f4648,f356]) ).
fof(f4842,plain,
( ~ in(sK8,unordered_pair(sK8,sK8))
| subset(sF13,unordered_pair(sK8,sK8)) ),
inference(superposition,[],[f186,f4725]) ).
fof(f4843,plain,
subset(sF13,unordered_pair(sK8,sK8)),
inference(forward_subsumption_resolution,[],[f4842,f299]) ).
fof(f4844,plain,
$false,
inference(forward_subsumption_resolution,[],[f4843,f4500]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU147+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36 % Computer : n014.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:44:31 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
% 1.88/0.77 % (1413718)Will run a generic schedule for satisfiability detection.
% 1.88/0.77 % (1413728)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=165828110:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.88/0.77 % (1413723)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3005241562_2999 on theBenchmark for (2999ds/0Mi)
% 1.88/0.77 % (1413726)dis+10_1_sil=32000:sp=arity:random_seed=115223300:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.88/0.77 % (1413725)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3884810270:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.88/0.77 % (1413727)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1955040914:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.88/0.77 % (1413729)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2863608196:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.88/0.77 % (1413724)% WARNING: option uhcvi not known.
% 1.88/0.77 % (1413724)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2153464121:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.88/0.77 % TRYING [1]
% 1.88/0.77 % TRYING [2]
% 1.88/0.77 % TRYING [3]
% 1.88/0.77 % TRYING [4]
% 1.88/0.77 % (1413728)Instruction limit reached!
% 1.88/0.77 % (1413728)------------------------------
% 1.88/0.77 % (1413728)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.77 % (1413728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.77 % (1413728)CaDiCaL version: 2.1.3
% 1.88/0.77 % (1413728)Termination reason: Instruction limit
% 1.88/0.77 % (1413728)Termination phase: Saturation
% 1.88/0.77 % (1413728)Time elapsed: 0.041 s
% 1.88/0.77 % (1413728)Peak memory usage: 12 MB
% 1.88/0.77 % (1413728)Instructions burned: 133 (million)
% 1.88/0.77 % TRYING [5]
% 1.88/0.77 % (1413737)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=464990158:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.88/0.77 % TRYING [1]
% 1.88/0.77 % TRYING [2]
% 1.88/0.77 % TRYING [3]
% 1.88/0.77 % TRYING [4]
% 1.88/0.77 % (1413726)Instruction limit reached!
% 1.88/0.77 % (1413726)------------------------------
% 1.88/0.77 % (1413726)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.77 % (1413726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.77 % (1413726)CaDiCaL version: 2.1.3
% 1.88/0.77 % (1413726)Termination reason: Instruction limit
% 1.88/0.77 % (1413726)Termination phase: Saturation
% 1.88/0.77 % (1413726)Time elapsed: 0.066 s
% 1.88/0.77 % (1413726)Peak memory usage: 12 MB
% 1.88/0.77 % (1413726)Instructions burned: 104 (million)
% 1.88/0.77 % TRYING [5]
% 1.88/0.77 % (1413727)Instruction limit reached!
% 1.88/0.77 % (1413727)------------------------------
% 1.88/0.77 % (1413727)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.77 % (1413727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.77 % (1413727)CaDiCaL version: 2.1.3
% 1.88/0.77 % (1413727)Termination reason: Instruction limit
% 1.88/0.77 % (1413727)Termination phase: Saturation
% 1.88/0.77 % (1413727)Time elapsed: 0.076 s
% 1.88/0.77 % (1413727)Peak memory usage: 12 MB
% 1.88/0.77 % (1413727)Instructions burned: 116 (million)
% 1.88/0.77 % (1413739)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2438418163:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.88/0.77 % (1413740)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=1497627564:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.88/0.77 % TRYING [6]
% 1.88/0.77 % (1413729)Instruction limit reached!
% 1.88/0.77 % (1413729)------------------------------
% 1.88/0.77 % (1413729)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.77 % (1413729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.77 % (1413729)CaDiCaL version: 2.1.3
% 1.88/0.77 % (1413729)Termination reason: Instruction limit
% 1.88/0.77 % (1413729)Termination phase: Saturation
% 1.88/0.77 % (1413729)Time elapsed: 0.103 s
% 1.88/0.77 % (1413729)Peak memory usage: 13 MB
% 1.88/0.77 % (1413729)Instructions burned: 159 (million)
% 1.88/0.77 % TRYING [6]
% 1.88/0.77 % (1413743)ott-21_1_sil=16000:fs=off:random_seed=1363457404:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.88/0.77 % (1413739)Instruction limit reached!
% 1.88/0.77 % (1413739)------------------------------
% 1.88/0.77 % (1413739)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.77 % (1413739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.77 % (1413739)CaDiCaL version: 2.1.3
% 1.88/0.77 % (1413739)Termination reason: Instruction limit
% 1.88/0.77 % (1413739)Termination phase: Saturation
% 1.88/0.77 % (1413739)Time elapsed: 0.090 s
% 1.88/0.77 % (1413739)Peak memory usage: 13 MB
% 1.88/0.77 % (1413739)Instructions burned: 131 (million)
% 1.88/0.77 % TRYING [7]
% 1.88/0.77 % (1413737)Instruction limit reached!
% 1.88/0.77 % (1413737)------------------------------
% 1.88/0.77 % (1413737)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.77 % (1413737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.77 % (1413737)CaDiCaL version: 2.1.3
% 1.88/0.77 % (1413737)Termination reason: Instruction limit
% 1.88/0.77 % (1413737)Termination phase: Finite model building constraint generation
% 1.88/0.77 % (1413737)Time elapsed: 0.146 s
% 1.88/0.77 % (1413737)Peak memory usage: 29 MB
% 1.88/0.77 % (1413737)Instructions burned: 716 (million)
% 1.88/0.77 % (1413745)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2411082974:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.88/0.77 % (1413746)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1852166080:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.88/0.77 % (1413743)Instruction limit reached!
% 1.88/0.77 % (1413743)------------------------------
% 1.88/0.77 % (1413743)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.77 % (1413743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.77 % (1413743)CaDiCaL version: 2.1.3
% 1.88/0.77 % (1413743)Termination reason: Instruction limit
% 1.88/0.77 % (1413743)Termination phase: Saturation
% 1.88/0.77 % (1413743)Time elapsed: 0.085 s
% 1.88/0.77 % (1413743)Peak memory usage: 12 MB
% 1.88/0.77 % (1413743)Instructions burned: 182 (million)
% 1.88/0.77 % TRYING [1]
% 1.88/0.77 % TRYING [2]
% 1.88/0.77 % TRYING [7]
% 1.88/0.77 % TRYING [3]
% 1.88/0.77 % TRYING [4]
% 1.88/0.77 % (1413749)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4136938404:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.88/0.77 % TRYING [5]
% 1.88/0.77 % (1413749) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1413718-1413749"...
% 1.88/0.77 % (1413749)...printing done.
% 1.88/0.77 % TRYING [6]
% 1.88/0.77 % (1413749)Refutation found. Thanks to Tanya!
% 1.88/0.77 % SZS status Theorem for theBenchmark
% 1.88/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 1.88/0.77 % (1413749)------------------------------
% 1.88/0.77 % (1413749)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.88/0.77 % (1413749)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.88/0.77 % (1413749)CaDiCaL version: 2.1.3
% 1.88/0.77 % (1413749)Termination reason: Refutation
% 1.88/0.77 % (1413749)Time elapsed: 0.094 s
% 1.88/0.77 % (1413749)Peak memory usage: 13 MB
% 1.88/0.77 % (1413749)Instructions burned: 148 (million)
% 1.88/0.77 % (1413718)Success in time 0.362 s
% 1.88/0.77 % Vampire exiting
%------------------------------------------------------------------------------