%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU211+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 : n020.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:23 PM UTC 2026
% Result : Theorem 2.50s 0.95s
% Output : Refutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 63 ( 20 unt; 3 def)
% Number of atoms : 195 ( 21 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 226 ( 94 ~; 90 |; 29 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 128 ( 0 sgn 112 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0] :
( relation(X0)
=> ! [X1,X2] :
( X2 = relation_inverse_image(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(ordered_pair(X3,X4),X0)
& in(X4,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d14_relat_1) ).
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] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f28,conjecture,
! [X0,X1,X2] :
( relation(X2)
=> ( subset(X0,X1)
=> subset(relation_inverse_image(X2,X0),relation_inverse_image(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t178_relat_1) ).
fof(f29,negated_conjecture,
~ ! [X0,X1,X2] :
( relation(X2)
=> ( subset(X0,X1)
=> subset(relation_inverse_image(X2,X0),relation_inverse_image(X2,X1)) ) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f41,plain,
! [X0] :
( ! [X1,X2] :
( X2 = relation_inverse_image(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(ordered_pair(X3,X4),X0)
& in(X4,X1) ) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f42,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f44,plain,
? [X0,X1,X2] :
( ~ subset(relation_inverse_image(X2,X0),relation_inverse_image(X2,X1))
& subset(X0,X1)
& relation(X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f45,plain,
? [X0,X1,X2] :
( ~ subset(relation_inverse_image(X2,X0),relation_inverse_image(X2,X1))
& subset(X0,X1)
& relation(X2) ),
inference(flattening,[],[f44]) ).
fof(f55,plain,
! [X0] :
( ! [X1,X2] :
( ( X2 = relation_inverse_image(X0,X1)
| ? [X3] :
( ( ! [X4] :
( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X4,X1) )
| ~ in(X3,X2) )
& ( ? [X4] :
( in(ordered_pair(X3,X4),X0)
& in(X4,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ! [X4] :
( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X4,X1) ) )
& ( ? [X4] :
( in(ordered_pair(X3,X4),X0)
& in(X4,X1) )
| ~ in(X3,X2) ) )
| relation_inverse_image(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f41]) ).
fof(f56,plain,
! [X0] :
( ! [X1,X2] :
( ( X2 = relation_inverse_image(X0,X1)
| ? [X3] :
( ( ! [X4] :
( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X4,X1) )
| ~ in(X3,X2) )
& ( ? [X5] :
( in(ordered_pair(X3,X5),X0)
& in(X5,X1) )
| in(X3,X2) ) ) )
& ( ! [X6] :
( ( in(X6,X2)
| ! [X7] :
( ~ in(ordered_pair(X6,X7),X0)
| ~ in(X7,X1) ) )
& ( ? [X8] :
( in(ordered_pair(X6,X8),X0)
& in(X8,X1) )
| ~ in(X6,X2) ) )
| relation_inverse_image(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(rectify,[],[f55]) ).
fof(f57,plain,
! [X0] :
( ! [X1,X2] :
( ( X2 = relation_inverse_image(X0,X1)
| ( ( ! [X4] :
( ~ in(ordered_pair(sK0(X0,X1,X2),X4),X0)
| ~ in(X4,X1) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X0)
& in(sK1(X0,X1,X2),X1) )
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X6] :
( ( in(X6,X2)
| ! [X7] :
( ~ in(ordered_pair(X6,X7),X0)
| ~ in(X7,X1) ) )
& ( ( in(ordered_pair(X6,sK2(X0,X1,X6)),X0)
& in(sK2(X0,X1,X6),X1) )
| ~ in(X6,X2) ) )
| relation_inverse_image(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0(X0,X1,X2)),skolemize(X5,sK1(X0,X1,X2)),skolemize(X8,sK2(X0,X1,X6))],[f56]) ).
fof(f58,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,[],[f42]) ).
fof(f59,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,[],[f58]) ).
fof(f60,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f59]) ).
fof(f68,plain,
( ~ subset(relation_inverse_image(sK13,sK11),relation_inverse_image(sK13,sK12))
& subset(sK11,sK12)
& relation(sK13) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12,sK13]),skolemize(X0,sK11),skolemize(X1,sK12),skolemize(X2,sK13)],[f45]) ).
fof(f72,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f73,plain,
! [X2,X0,X1,X6] :
( in(sK2(X0,X1,X6),X1)
| ~ in(X6,X2)
| relation_inverse_image(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f74,plain,
! [X2,X0,X1,X6] :
( in(ordered_pair(X6,sK2(X0,X1,X6)),X0)
| ~ in(X6,X2)
| relation_inverse_image(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f75,plain,
! [X2,X0,X1,X6,X7] :
( in(X6,X2)
| ~ in(ordered_pair(X6,X7),X0)
| ~ in(X7,X1)
| relation_inverse_image(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f79,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f80,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f81,plain,
! [X0,X1] :
( ~ in(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f82,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f102,plain,
relation(sK13),
inference(cnf_transformation,[],[f68]) ).
fof(f103,plain,
subset(sK11,sK12),
inference(cnf_transformation,[],[f68]) ).
fof(f104,plain,
~ subset(relation_inverse_image(sK13,sK11),relation_inverse_image(sK13,sK12)),
inference(cnf_transformation,[],[f68]) ).
fof(f116,plain,
! [X2,X0,X1,X6,X7] :
( in(X6,X2)
| ~ in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),X0)
| ~ in(X7,X1)
| relation_inverse_image(X0,X1) != X2
| ~ relation(X0) ),
inference(definition_unfolding,[],[f75,f82]) ).
fof(f117,plain,
! [X2,X0,X1,X6] :
( in(unordered_pair(unordered_pair(X6,sK2(X0,X1,X6)),singleton(X6)),X0)
| ~ in(X6,X2)
| relation_inverse_image(X0,X1) != X2
| ~ relation(X0) ),
inference(definition_unfolding,[],[f74,f82]) ).
fof(f119,plain,
! [X0,X1,X6,X7] :
( ~ in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),X0)
| in(X6,relation_inverse_image(X0,X1))
| ~ in(X7,X1)
| ~ relation(X0) ),
inference(equality_resolution,[],[f116]) ).
fof(f120,plain,
! [X0,X1,X6] :
( ~ in(X6,relation_inverse_image(X0,X1))
| in(unordered_pair(unordered_pair(X6,sK2(X0,X1,X6)),singleton(X6)),X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f117]) ).
fof(f121,plain,
! [X0,X1,X6] :
( ~ in(X6,relation_inverse_image(X0,X1))
| in(sK2(X0,X1,X6),X1)
| ~ relation(X0) ),
inference(equality_resolution,[],[f73]) ).
fof(f122,definition,
sF14 = relation_inverse_image(sK13,sK11),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f123,plain,
relation_inverse_image(sK13,sK11) = sF14,
inference(reorient_equations,[],[f122]) ).
fof(f124,definition,
sF15 = relation_inverse_image(sK13,sK12),
introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).
fof(f125,plain,
relation_inverse_image(sK13,sK12) = sF15,
inference(reorient_equations,[],[f124]) ).
fof(f126,plain,
~ subset(sF14,sF15),
inference(definition_folding,[],[f104,f125,f123]) ).
fof(f160,plain,
in(sK3(sF14,sF15),sF14),
inference(resolution,[],[f80,f126]) ).
fof(f178,plain,
! [X0] :
( ~ in(X0,sK11)
| in(X0,sK12) ),
inference(resolution,[],[f79,f103]) ).
fof(f212,plain,
! [X0] :
( ~ in(X0,sF14)
| in(sK2(sK13,sK11,X0),sK11)
| ~ relation(sK13) ),
inference(superposition,[],[f121,f123]) ).
fof(f215,plain,
! [X0] :
( in(sK2(sK13,sK11,X0),sK11)
| ~ in(X0,sF14) ),
inference(forward_subsumption_resolution,[],[f212,f102]) ).
fof(f219,plain,
! [X2,X3,X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2)
| in(X0,relation_inverse_image(X2,X3))
| ~ in(X1,X3)
| ~ relation(X2) ),
inference(superposition,[],[f119,f72]) ).
fof(f222,plain,
! [X0] :
( ~ in(X0,sF14)
| in(unordered_pair(unordered_pair(X0,sK2(sK13,sK11,X0)),singleton(X0)),sK13)
| ~ relation(sK13) ),
inference(superposition,[],[f120,f123]) ).
fof(f225,plain,
! [X0] :
( ~ in(X0,sF14)
| in(unordered_pair(unordered_pair(X0,sK2(sK13,sK11,X0)),singleton(X0)),sK13) ),
inference(forward_subsumption_resolution,[],[f222,f102]) ).
fof(f227,plain,
! [X0] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,sK2(sK13,sK11,X0))),sK13)
| ~ in(X0,sF14) ),
inference(forward_demodulation,[],[f225,f72]) ).
fof(f253,plain,
! [X0] :
( in(sK2(sK13,sK11,X0),sK12)
| ~ in(X0,sF14) ),
inference(resolution,[],[f215,f178]) ).
fof(f402,plain,
! [X0,X1] :
( in(X0,relation_inverse_image(sK13,X1))
| ~ in(sK2(sK13,sK11,X0),X1)
| ~ relation(sK13)
| ~ in(X0,sF14) ),
inference(resolution,[],[f219,f227]) ).
fof(f407,plain,
! [X0,X1] :
( ~ in(sK2(sK13,sK11,X0),X1)
| in(X0,relation_inverse_image(sK13,X1))
| ~ in(X0,sF14) ),
inference(forward_subsumption_resolution,[],[f402,f102]) ).
fof(f547,plain,
! [X0] :
( in(X0,relation_inverse_image(sK13,sK12))
| ~ in(X0,sF14)
| ~ in(X0,sF14) ),
inference(resolution,[],[f407,f253]) ).
fof(f552,plain,
! [X0] :
( in(X0,relation_inverse_image(sK13,sK12))
| ~ in(X0,sF14) ),
inference(duplicate_literal_removal,[],[f547]) ).
fof(f554,plain,
! [X0] :
( ~ in(X0,sF14)
| in(X0,sF15) ),
inference(forward_demodulation,[],[f552,f125]) ).
fof(f560,plain,
in(sK3(sF14,sF15),sF15),
inference(resolution,[],[f554,f160]) ).
fof(f578,definition,
( spl16_10
<=> in(sK3(sF14,sF15),sF15) ),
introduced(definition,[new_symbols(definition,[spl16_10])],[avatar_definition]) ).
fof(f580,plain,
( in(sK3(sF14,sF15),sF15)
| ~ spl16_10 ),
inference(avatar_component_clause,[],[f578]) ).
fof(f582,plain,
spl16_10,
inference(avatar_split_clause,[],[f560,f578]) ).
fof(f617,plain,
( subset(sF14,sF15)
| ~ spl16_10 ),
inference(resolution,[],[f580,f81]) ).
fof(f622,plain,
( $false
| ~ spl16_10 ),
inference(forward_subsumption_resolution,[],[f617,f126]) ).
fof(f623,plain,
~ spl16_10,
inference(avatar_contradiction_clause,[],[f622]) ).
cnf(s9,plain,
spl16_10,
inference(sat_conversion,[],[f582]) ).
cnf(s12,plain,
~ spl16_10,
inference(sat_conversion,[],[f623]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s9,s12]) ).
fof(f624,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU211+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.39 % Computer : n020.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 04:04:50 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 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.50/0.95 % (4012993)Will run a generic schedule for satisfiability detection.
% 2.50/0.95 % (4012998)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1680080349_2999 on theBenchmark for (2999ds/0Mi)
% 2.50/0.95 % TRYING [1]
% 2.50/0.95 % TRYING [2]
% 2.50/0.95 % (4012999)% WARNING: option uhcvi not known.
% 2.50/0.95 % TRYING [3]
% 2.50/0.95 % TRYING [4]
% 2.50/0.95 % (4012999)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3783904394:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.50/0.95 % (4013000)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=24756823:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.50/0.95 % (4013003)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=440553073:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.50/0.95 % (4013001)dis+10_1_sil=32000:sp=arity:random_seed=729214272:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.50/0.95 % (4013002)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3900340429:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.50/0.95 % (4013004)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2440866395:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.50/0.95 % TRYING [5]
% 2.50/0.95 % TRYING [6]
% 2.50/0.95 % (4013001)Instruction limit reached!
% 2.50/0.95 % (4013001)------------------------------
% 2.50/0.95 % (4013001)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013001)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013001)Termination reason: Instruction limit
% 2.50/0.95 % (4013001)Termination phase: Saturation
% 2.50/0.95 % (4013001)Time elapsed: 0.064 s
% 2.50/0.95 % (4013001)Peak memory usage: 12 MB
% 2.50/0.95 % (4013001)Instructions burned: 105 (million)
% 2.50/0.95 % (4013002)Instruction limit reached!
% 2.50/0.95 % (4013002)------------------------------
% 2.50/0.95 % (4013002)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013002)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013002)Termination reason: Instruction limit
% 2.50/0.95 % (4013002)Termination phase: Saturation
% 2.50/0.95 % (4013002)Time elapsed: 0.073 s
% 2.50/0.95 % (4013002)Peak memory usage: 13 MB
% 2.50/0.95 % (4013002)Instructions burned: 118 (million)
% 2.50/0.95 % (4013003)Instruction limit reached!
% 2.50/0.95 % (4013003)------------------------------
% 2.50/0.95 % (4013003)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013003)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013003)Termination reason: Instruction limit
% 2.50/0.95 % (4013003)Termination phase: Saturation
% 2.50/0.95 % (4013003)Time elapsed: 0.084 s
% 2.50/0.95 % (4013003)Peak memory usage: 13 MB
% 2.50/0.95 % (4013003)Instructions burned: 132 (million)
% 2.50/0.95 % (4013012)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2576967851:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.50/0.95 % TRYING [1]
% 2.50/0.95 % TRYING [2]
% 2.50/0.95 % TRYING [3]
% 2.50/0.95 % (4013013)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1536864919:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.50/0.95 % TRYING [4]
% 2.50/0.95 % (4013015)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=2355718267:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.50/0.95 % TRYING [5]
% 2.50/0.95 % (4013004)Instruction limit reached!
% 2.50/0.95 % (4013004)------------------------------
% 2.50/0.95 % (4013004)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013004)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013004)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013004)Termination reason: Instruction limit
% 2.50/0.95 % (4013004)Termination phase: Saturation
% 2.50/0.95 % (4013004)Time elapsed: 0.109 s
% 2.50/0.95 % (4013004)Peak memory usage: 14 MB
% 2.50/0.95 % (4013004)Instructions burned: 159 (million)
% 2.50/0.95 % (4013018)ott-21_1_sil=16000:fs=off:random_seed=2074223619:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.50/0.95 % TRYING [6]
% 2.50/0.95 % TRYING [7]
% 2.50/0.95 % (4013013)Instruction limit reached!
% 2.50/0.95 % (4013013)------------------------------
% 2.50/0.95 % (4013013)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013013)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013013)Termination reason: Instruction limit
% 2.50/0.95 % (4013013)Termination phase: Saturation
% 2.50/0.95 % (4013013)Time elapsed: 0.088 s
% 2.50/0.95 % (4013013)Peak memory usage: 13 MB
% 2.50/0.95 % (4013013)Instructions burned: 131 (million)
% 2.50/0.95 % (4013020)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=808835291:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.50/0.95 % (4013018)Instruction limit reached!
% 2.50/0.95 % (4013018)------------------------------
% 2.50/0.95 % (4013018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013018)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013018)Termination reason: Instruction limit
% 2.50/0.95 % (4013018)Termination phase: Saturation
% 2.50/0.95 % (4013018)Time elapsed: 0.097 s
% 2.50/0.95 % (4013018)Peak memory usage: 13 MB
% 2.50/0.95 % (4013018)Instructions burned: 180 (million)
% 2.50/0.95 % (4013022)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2614915310:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.50/0.95 % TRYING [7]
% 2.50/0.95 % TRYING [1]
% 2.50/0.95 % TRYING [2]
% 2.50/0.95 % TRYING [3]
% 2.50/0.95 % TRYING [4]
% 2.50/0.95 % TRYING [5]
% 2.50/0.95 % (4013012)Instruction limit reached!
% 2.50/0.95 % (4013012)------------------------------
% 2.50/0.95 % (4013012)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013012)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013012)Termination reason: Instruction limit
% 2.50/0.95 % (4013012)Termination phase: Finite model building SAT solving
% 2.50/0.95 % (4013012)Time elapsed: 0.340 s
% 2.50/0.95 % (4013012)Peak memory usage: 28 MB
% 2.50/0.95 % (4013012)Instructions burned: 715 (million)
% 2.50/0.95 % (4013024)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2392834233:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 2.50/0.95 % (4013015)Instruction limit reached!
% 2.50/0.95 % (4013015)------------------------------
% 2.50/0.95 % (4013015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013015)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013015)Termination reason: Instruction limit
% 2.50/0.95 % (4013015)Termination phase: Saturation
% 2.50/0.95 % (4013015)Time elapsed: 0.350 s
% 2.50/0.95 % (4013015)Peak memory usage: 18 MB
% 2.50/0.95 % (4013015)Instructions burned: 686 (million)
% 2.50/0.95 % (4013024) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4012993-4013024"...
% 2.50/0.95 % (4013024)...printing done.
% 2.50/0.95 % (4013024)Refutation found. Thanks to Tanya!
% 2.50/0.95 % SZS status Theorem for theBenchmark
% 2.50/0.95 % SZS output start Proof for theBenchmark
% See solution above
% 2.50/0.95 % (4013024)------------------------------
% 2.50/0.95 % (4013024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.95 % (4013024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.95 % (4013024)CaDiCaL version: 2.1.3
% 2.50/0.95 % (4013024)Termination reason: Refutation
% 2.50/0.95 % (4013024)Time elapsed: 0.017 s
% 2.50/0.95 % (4013024)Peak memory usage: 13 MB
% 2.50/0.95 % (4013024)Instructions burned: 24 (million)
% 2.50/0.95 % (4012993)Success in time 0.51 s
% 2.50/0.95 % Vampire exiting
%------------------------------------------------------------------------------