%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU135+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 : n005.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:02 PM UTC 2026
% Result : Theorem 2.25s 0.91s
% Output : Refutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 80 ( 24 unt; 5 def)
% Number of atoms : 267 ( 59 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 299 ( 112 ~; 140 |; 41 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 124 ( 1 sgn 116 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f13,axiom,
! [X0,X1] : set_union2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
fof(f18,conjecture,
! [X0,X1] : set_union2(X0,set_difference(X1,X0)) = set_union2(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_xboole_1) ).
fof(f19,negated_conjecture,
~ ! [X0,X1] : set_union2(X0,set_difference(X1,X0)) = set_union2(X0,X1),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f25,plain,
! [X0] : set_union2(X0,X0) = X0,
inference(rectify,[],[f13]) ).
fof(f31,plain,
? [X0,X1] : set_union2(X0,X1) != set_union2(X0,set_difference(X1,X0)),
inference(ennf_transformation,[],[f19]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ( ( ( ~ in(sK0(X0,X1,X2),X0)
& ~ in(sK0(X0,X1,X2),X1) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( in(sK0(X0,X1,X2),X0)
| in(sK0(X0,X1,X2),X1)
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f39]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| in(X3,X1) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| in(X3,X1) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ( ( ~ in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( in(sK2(X0,X1,X2),X0)
& ~ in(sK2(X0,X1,X2),X1) )
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f46]) ).
fof(f50,plain,
set_union2(sK5,sK6) != set_union2(sK5,set_difference(sK6,sK5)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f31]) ).
fof(f52,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f56,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f57,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f58,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f59,plain,
! [X2,X0,X1] :
( in(sK0(X0,X1,X2),X2)
| in(sK0(X0,X1,X2),X1)
| in(sK0(X0,X1,X2),X0)
| set_union2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ in(sK0(X0,X1,X2),X2)
| ~ in(sK0(X0,X1,X2),X0)
| set_union2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f66,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f47]) ).
fof(f67,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f47]) ).
fof(f74,plain,
! [X0] : set_union2(X0,X0) = X0,
inference(cnf_transformation,[],[f25]) ).
fof(f79,plain,
set_union2(sK5,sK6) != set_union2(sK5,set_difference(sK6,sK5)),
inference(cnf_transformation,[],[f50]) ).
fof(f87,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f58]) ).
fof(f88,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f57]) ).
fof(f89,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X1)
| in(X4,X0) ),
inference(equality_resolution,[],[f56]) ).
fof(f90,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| ~ in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f67]) ).
fof(f91,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f66]) ).
fof(f93,definition,
sF7 = set_union2(sK5,sK6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f94,plain,
set_union2(sK5,sK6) = sF7,
inference(reorient_equations,[],[f93]) ).
fof(f95,definition,
sF8 = set_difference(sK6,sK5),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f96,plain,
set_difference(sK6,sK5) = sF8,
inference(reorient_equations,[],[f95]) ).
fof(f97,definition,
sF9 = set_union2(sK5,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f98,plain,
set_union2(sK5,sF8) = sF9,
inference(reorient_equations,[],[f97]) ).
fof(f99,plain,
sF7 != sF9,
inference(definition_folding,[],[f79,f98,f96,f94]) ).
fof(f100,plain,
sF9 = set_union2(sF8,sK5),
inference(forward_demodulation,[],[f98,f52]) ).
fof(f156,plain,
! [X0] :
( ~ in(X0,sF8)
| in(X0,sF9) ),
inference(superposition,[],[f87,f100]) ).
fof(f166,plain,
! [X0] :
( ~ in(X0,sK5)
| in(X0,sF9) ),
inference(superposition,[],[f88,f100]) ).
fof(f169,plain,
! [X0] :
( ~ in(X0,sF8)
| in(X0,sK6) ),
inference(superposition,[],[f91,f96]) ).
fof(f186,plain,
! [X0] :
( ~ in(X0,sF7)
| in(X0,sK6)
| in(X0,sK5) ),
inference(superposition,[],[f89,f94]) ).
fof(f187,plain,
! [X0] :
( ~ in(X0,sF9)
| in(X0,sK5)
| in(X0,sF8) ),
inference(superposition,[],[f89,f100]) ).
fof(f196,plain,
! [X0] :
( ~ in(X0,sK6)
| in(X0,sF8)
| in(X0,sK5) ),
inference(superposition,[],[f90,f96]) ).
fof(f207,plain,
! [X2,X3,X0,X1] :
( ~ in(sK0(X0,X1,set_union2(X2,X3)),X3)
| set_union2(X0,X1) = set_union2(X2,X3)
| ~ in(sK0(X0,X1,set_union2(X2,X3)),X0) ),
inference(resolution,[],[f61,f88]) ).
fof(f208,plain,
! [X2,X3,X0,X1] :
( ~ in(sK0(X0,X1,set_union2(X2,X3)),X2)
| set_union2(X0,X1) = set_union2(X2,X3)
| ~ in(sK0(X0,X1,set_union2(X2,X3)),X0) ),
inference(resolution,[],[f61,f87]) ).
fof(f309,plain,
! [X0,X1] :
( in(sK0(X0,X0,X1),X1)
| in(sK0(X0,X0,X1),X0)
| set_union2(X0,X0) = X1 ),
inference(factoring,[],[f59]) ).
fof(f312,plain,
! [X0,X1] :
( in(sK0(X0,X0,X1),X1)
| in(sK0(X0,X0,X1),X0)
| X0 = X1 ),
inference(forward_demodulation,[],[f309,f74]) ).
fof(f514,plain,
! [X0] :
( in(sK0(X0,X0,sF7),sK6)
| in(sK0(X0,X0,sF7),X0)
| sF7 = X0
| in(sK0(X0,X0,sF7),sK5) ),
inference(resolution,[],[f312,f186]) ).
fof(f823,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1,sF7),sK6)
| set_union2(X0,X1) = sF7
| ~ in(sK0(X0,X1,sF7),X0) ),
inference(superposition,[],[f207,f94]) ).
fof(f863,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1,sF7),sK5)
| set_union2(X0,X1) = sF7
| ~ in(sK0(X0,X1,sF7),X0) ),
inference(superposition,[],[f208,f94]) ).
fof(f9935,plain,
( in(sK0(sF9,sF9,sF7),sK6)
| sF7 = sF9
| in(sK0(sF9,sF9,sF7),sK5)
| in(sK0(sF9,sF9,sF7),sK5)
| in(sK0(sF9,sF9,sF7),sF8) ),
inference(resolution,[],[f514,f187]) ).
fof(f9937,plain,
( in(sK0(sF9,sF9,sF7),sK6)
| sF7 = sF9
| in(sK0(sF9,sF9,sF7),sK5)
| in(sK0(sF9,sF9,sF7),sF8) ),
inference(duplicate_literal_removal,[],[f9935]) ).
fof(f9941,plain,
( sF7 = sF9
| in(sK0(sF9,sF9,sF7),sK5)
| in(sK0(sF9,sF9,sF7),sF8) ),
inference(forward_subsumption_resolution,[],[f9937,f196]) ).
fof(f9951,plain,
( in(sK0(sF9,sF9,sF7),sK5)
| in(sK0(sF9,sF9,sF7),sF8) ),
inference(forward_subsumption_resolution,[],[f9941,f99]) ).
fof(f9953,definition,
( spl10_159
<=> in(sK0(sF9,sF9,sF7),sF8) ),
introduced(definition,[new_symbols(definition,[spl10_159])],[avatar_definition]) ).
fof(f9955,plain,
( in(sK0(sF9,sF9,sF7),sF8)
| ~ spl10_159 ),
inference(avatar_component_clause,[],[f9953]) ).
fof(f9957,definition,
( spl10_160
<=> in(sK0(sF9,sF9,sF7),sK5) ),
introduced(definition,[new_symbols(definition,[spl10_160])],[avatar_definition]) ).
fof(f9959,plain,
( in(sK0(sF9,sF9,sF7),sK5)
| ~ spl10_160 ),
inference(avatar_component_clause,[],[f9957]) ).
fof(f9960,plain,
( spl10_159
| spl10_160 ),
inference(avatar_split_clause,[],[f9951,f9957,f9953]) ).
fof(f9961,plain,
( sF7 = set_union2(sF9,sF9)
| ~ in(sK0(sF9,sF9,sF7),sF9)
| ~ spl10_160 ),
inference(resolution,[],[f9959,f863]) ).
fof(f9963,plain,
( in(sK0(sF9,sF9,sF7),sF9)
| ~ spl10_160 ),
inference(resolution,[],[f9959,f166]) ).
fof(f9972,plain,
( sF7 = set_union2(sF9,sF9)
| ~ spl10_160 ),
inference(forward_subsumption_resolution,[],[f9961,f9963]) ).
fof(f9974,plain,
( sF7 = sF9
| ~ spl10_160 ),
inference(forward_demodulation,[],[f9972,f74]) ).
fof(f9977,plain,
( $false
| ~ spl10_160 ),
inference(forward_subsumption_resolution,[],[f9974,f99]) ).
fof(f9978,plain,
~ spl10_160,
inference(avatar_contradiction_clause,[],[f9977]) ).
fof(f10025,plain,
( in(sK0(sF9,sF9,sF7),sK6)
| ~ spl10_159 ),
inference(resolution,[],[f9955,f169]) ).
fof(f10026,plain,
( in(sK0(sF9,sF9,sF7),sF9)
| ~ spl10_159 ),
inference(resolution,[],[f9955,f156]) ).
fof(f10303,plain,
( sF7 = set_union2(sF9,sF9)
| ~ in(sK0(sF9,sF9,sF7),sF9)
| ~ spl10_159 ),
inference(resolution,[],[f10025,f823]) ).
fof(f10314,plain,
( sF7 = set_union2(sF9,sF9)
| ~ spl10_159 ),
inference(forward_subsumption_resolution,[],[f10303,f10026]) ).
fof(f10316,plain,
( sF7 = sF9
| ~ spl10_159 ),
inference(forward_demodulation,[],[f10314,f74]) ).
fof(f10319,plain,
( $false
| ~ spl10_159 ),
inference(forward_subsumption_resolution,[],[f10316,f99]) ).
fof(f10320,plain,
~ spl10_159,
inference(avatar_contradiction_clause,[],[f10319]) ).
cnf(s156,plain,
( spl10_159
| spl10_160 ),
inference(sat_conversion,[],[f9960]) ).
cnf(s158,plain,
~ spl10_160,
inference(sat_conversion,[],[f9978]) ).
cnf(s164,plain,
~ spl10_159,
inference(sat_conversion,[],[f10320]) ).
cnf(s166,plain,
$false,
inference(rat,[],[s156,s158,s164]) ).
fof(f10321,plain,
$false,
inference(avatar_sat_refutation,[],[s166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU135+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.09/0.39 % Computer : n005.cluster.edu
% 0.09/0.39 % Model : x86_64 x86_64
% 0.09/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.39 % Memory : 8046.5625MB
% 0.09/0.39 % OS : Linux 6.8.0-71-generic
% 0.09/0.39 % CPULimit : 300
% 0.09/0.39 % WCLimit : 300
% 0.09/0.39 % DateTime : Mon Sep 28 03:40:17 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.42 Running first-order model finding
% 0.09/0.42 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.25/0.91 % (412904)Will run a generic schedule for satisfiability detection.
% 2.25/0.91 % (412915)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4078424749:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.25/0.91 % (412910)% WARNING: option uhcvi not known.
% 2.25/0.91 % (412912)dis+10_1_sil=32000:sp=arity:random_seed=2898142359:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.25/0.91 % (412911)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1302046092:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.25/0.91 % (412909)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4017420814_2999 on theBenchmark for (2999ds/0Mi)
% 2.25/0.91 % (412910)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3109840104:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.25/0.91 % (412913)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=709856892:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.25/0.91 % (412914)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=906461794:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.25/0.91 % TRYING [1]
% 2.25/0.91 % TRYING [2]
% 2.25/0.91 % TRYING [3]
% 2.25/0.91 % TRYING [4]
% 2.25/0.91 % TRYING [5]
% 2.25/0.91 % (412915)Instruction limit reached!
% 2.25/0.91 % (412915)------------------------------
% 2.25/0.91 % (412915)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.91 % (412915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.91 % (412915)CaDiCaL version: 2.1.3
% 2.25/0.91 % (412915)Termination reason: Instruction limit
% 2.25/0.91 % (412915)Termination phase: Saturation
% 2.25/0.91 % (412915)Time elapsed: 0.047 s
% 2.25/0.91 % (412915)Peak memory usage: 13 MB
% 2.25/0.91 % (412915)Instructions burned: 159 (million)
% 2.25/0.91 % (412923)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=359167135:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.25/0.91 % TRYING [1]
% 2.25/0.91 % TRYING [2]
% 2.25/0.91 % TRYING [3]
% 2.25/0.91 % TRYING [4]
% 2.25/0.91 % (412912)Instruction limit reached!
% 2.25/0.91 % (412912)------------------------------
% 2.25/0.91 % (412912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.91 % (412912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.91 % (412912)CaDiCaL version: 2.1.3
% 2.25/0.91 % (412912)Termination reason: Instruction limit
% 2.25/0.91 % (412912)Termination phase: Saturation
% 2.25/0.91 % (412912)Time elapsed: 0.063 s
% 2.25/0.91 % (412912)Peak memory usage: 12 MB
% 2.25/0.91 % (412912)Instructions burned: 109 (million)
% 2.25/0.91 % (412913)Instruction limit reached!
% 2.25/0.91 % (412913)------------------------------
% 2.25/0.91 % (412913)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.91 % (412913)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.91 % (412913)CaDiCaL version: 2.1.3
% 2.25/0.91 % (412913)Termination reason: Instruction limit
% 2.25/0.91 % (412913)Termination phase: Saturation
% 2.25/0.91 % (412913)Time elapsed: 0.066 s
% 2.25/0.91 % (412913)Peak memory usage: 12 MB
% 2.25/0.91 % (412913)Instructions burned: 116 (million)
% 2.25/0.91 % TRYING [5]
% 2.25/0.91 % TRYING [6]
% 2.25/0.91 % (412914)Instruction limit reached!
% 2.25/0.91 % (412914)------------------------------
% 2.25/0.91 % (412914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.91 % (412914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.91 % (412914)CaDiCaL version: 2.1.3
% 2.25/0.91 % (412914)Termination reason: Instruction limit
% 2.25/0.91 % (412914)Termination phase: Saturation
% 2.25/0.91 % (412914)Time elapsed: 0.072 s
% 2.25/0.91 % (412914)Peak memory usage: 12 MB
% 2.25/0.91 % (412914)Instructions burned: 132 (million)
% 2.25/0.91 % (412925)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1893687226:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.25/0.91 % (412926)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=3188255029:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.25/0.91 % (412927)ott-21_1_sil=16000:fs=off:random_seed=4267264447:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.25/0.91 % TRYING [6]
% 2.25/0.91 % (412925)Instruction limit reached!
% 2.25/0.91 % (412925)------------------------------
% 2.25/0.91 % (412925)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.91 % (412925)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.91 % (412925)CaDiCaL version: 2.1.3
% 2.25/0.91 % (412925)Termination reason: Instruction limit
% 2.25/0.91 % (412925)Termination phase: Saturation
% 2.25/0.91 % (412925)Time elapsed: 0.081 s
% 2.25/0.91 % (412925)Peak memory usage: 13 MB
% 2.25/0.91 % (412925)Instructions burned: 133 (million)
% 2.25/0.91 % (412931)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1660012647:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.25/0.91 % (412927)Instruction limit reached!
% 2.25/0.91 % (412927)------------------------------
% 2.25/0.91 % (412927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.91 % (412927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.91 % (412927)CaDiCaL version: 2.1.3
% 2.25/0.91 % (412927)Termination reason: Instruction limit
% 2.25/0.91 % (412927)Termination phase: Saturation
% 2.25/0.91 % (412927)Time elapsed: 0.093 s
% 2.25/0.91 % (412927)Peak memory usage: 13 MB
% 2.25/0.91 % (412927)Instructions burned: 181 (million)
% 2.25/0.91 % (412933)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2492192608:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.25/0.91 % TRYING [1]
% 2.25/0.91 % TRYING [2]
% 2.25/0.91 % TRYING [3]
% 2.25/0.91 % TRYING [4]
% 2.25/0.91 % TRYING [7]
% 2.25/0.91 % TRYING [5]
% 2.25/0.91 % (412923)Instruction limit reached!
% 2.25/0.91 % (412923)------------------------------
% 2.25/0.91 % (412923)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.91 % (412923)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.91 % (412923)CaDiCaL version: 2.1.3
% 2.25/0.91 % (412923)Termination reason: Instruction limit
% 2.25/0.91 % (412923)Termination phase: Finite model building SAT solving
% 2.25/0.91 % (412923)Time elapsed: 0.199 s
% 2.25/0.91 % (412923)Peak memory usage: 19 MB
% 2.25/0.91 % (412923)Instructions burned: 715 (million)
% 2.25/0.91 % (412935)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=484234117:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.25/0.91 % TRYING [6]
% 2.25/0.91 % TRYING [7]
% 2.25/0.91 % (412935) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-412904-412935"...
% 2.25/0.91 % (412935)...printing done.
% 2.25/0.91 % (412935)Refutation found. Thanks to Tanya!
% 2.25/0.91 % SZS status Theorem for theBenchmark
% 2.25/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 2.25/0.91 % (412935)------------------------------
% 2.25/0.91 % (412935)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.91 % (412935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.91 % (412935)CaDiCaL version: 2.1.3
% 2.25/0.91 % (412935)Termination reason: Refutation
% 2.25/0.91 % (412935)Time elapsed: 0.173 s
% 2.25/0.91 % (412935)Peak memory usage: 17 MB
% 2.25/0.91 % (412935)Instructions burned: 574 (million)
% 2.25/0.91 % (412904)Success in time 0.485 s
% 2.25/0.91 % Vampire exiting
%------------------------------------------------------------------------------