%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU194+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 : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:52:19 PM UTC 2026
% Result : Theorem 2.34s 0.82s
% Output : Refutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 81 ( 20 unt; 6 def)
% Number of atoms : 245 ( 39 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 275 ( 111 ~; 121 |; 31 &)
% ( 7 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 104 ( 0 sgn 97 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,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(f24,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f27,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<=> ( in(X0,X1)
& in(X0,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t86_relat_1) ).
fof(f29,conjecture,
! [X0,X1] :
( relation(X1)
=> relation_dom(relation_dom_restriction(X1,X0)) = set_intersection2(relation_dom(X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t90_relat_1) ).
fof(f30,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> relation_dom(relation_dom_restriction(X1,X0)) = set_intersection2(relation_dom(X1),X0) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f43,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<=> ( in(X0,X1)
& in(X0,relation_dom(X2)) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f27]) ).
fof(f48,plain,
? [X0,X1] :
( relation_dom(relation_dom_restriction(X1,X0)) != set_intersection2(relation_dom(X1),X0)
& relation(X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f49]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f51]) ).
fof(f58,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f59,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) )
& ( in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X2,sK6(X0,X1))],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| ~ in(X0,X1)
| ~ in(X0,relation_dom(X2)) )
& ( ( in(X0,X1)
& in(X0,relation_dom(X2)) )
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f46]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| ~ in(X0,X1)
| ~ in(X0,relation_dom(X2)) )
& ( ( in(X0,X1)
& in(X0,relation_dom(X2)) )
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) ) )
| ~ relation(X2) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
( relation_dom(relation_dom_restriction(sK8,sK7)) != set_intersection2(relation_dom(sK8),sK7)
& relation(sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f48]) ).
fof(f66,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f67,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f68,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f91,plain,
! [X0,X1] :
( in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f59]) ).
fof(f92,plain,
! [X0,X1] :
( ~ in(sK6(X0,X1),X1)
| X0 = X1
| ~ in(sK6(X0,X1),X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f95,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| in(X0,relation_dom(X2))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f96,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| in(X0,X1)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_dom(X2))
| ~ in(X0,X1)
| in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f99,plain,
relation(sK8),
inference(cnf_transformation,[],[f62]) ).
fof(f100,plain,
relation_dom(relation_dom_restriction(sK8,sK7)) != set_intersection2(relation_dom(sK8),sK7),
inference(cnf_transformation,[],[f62]) ).
fof(f101,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f68]) ).
fof(f102,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f67]) ).
fof(f103,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f66]) ).
fof(f104,definition,
sF9 = relation_dom_restriction(sK8,sK7),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f105,plain,
relation_dom_restriction(sK8,sK7) = sF9,
inference(reorient_equations,[],[f104]) ).
fof(f106,definition,
sF10 = relation_dom(sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f107,plain,
relation_dom(sF9) = sF10,
inference(reorient_equations,[],[f106]) ).
fof(f108,definition,
sF11 = relation_dom(sK8),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f109,plain,
relation_dom(sK8) = sF11,
inference(reorient_equations,[],[f108]) ).
fof(f110,definition,
sF12 = set_intersection2(sF11,sK7),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f111,plain,
set_intersection2(sF11,sK7) = sF12,
inference(reorient_equations,[],[f110]) ).
fof(f112,plain,
sF10 != sF12,
inference(definition_folding,[],[f100,f111,f109,f107,f105]) ).
fof(f197,plain,
! [X0] :
( ~ in(X0,sF12)
| in(X0,sF11) ),
inference(superposition,[],[f102,f111]) ).
fof(f206,plain,
! [X0] :
( ~ in(X0,sF12)
| in(X0,sK7) ),
inference(superposition,[],[f103,f111]) ).
fof(f219,plain,
! [X0] :
( ~ in(X0,relation_dom(sF9))
| in(X0,sK7)
| ~ relation(sK8) ),
inference(superposition,[],[f96,f105]) ).
fof(f220,plain,
! [X0] :
( ~ in(X0,relation_dom(sF9))
| in(X0,sK7) ),
inference(forward_subsumption_resolution,[],[f219,f99]) ).
fof(f221,plain,
! [X0] :
( ~ in(X0,sF10)
| in(X0,sK7) ),
inference(forward_demodulation,[],[f220,f107]) ).
fof(f234,plain,
! [X0] :
( ~ in(X0,sF11)
| in(X0,sF12)
| ~ in(X0,sK7) ),
inference(superposition,[],[f101,f111]) ).
fof(f240,plain,
! [X0] :
( ~ in(X0,relation_dom(sF9))
| in(X0,relation_dom(sK8))
| ~ relation(sK8) ),
inference(superposition,[],[f95,f105]) ).
fof(f241,plain,
! [X0] :
( ~ in(X0,relation_dom(sF9))
| in(X0,relation_dom(sK8)) ),
inference(forward_subsumption_resolution,[],[f240,f99]) ).
fof(f242,plain,
! [X0] :
( ~ in(X0,sF10)
| in(X0,relation_dom(sK8)) ),
inference(forward_demodulation,[],[f241,f107]) ).
fof(f243,plain,
! [X0] :
( ~ in(X0,sF10)
| in(X0,sF11) ),
inference(forward_demodulation,[],[f242,f109]) ).
fof(f263,plain,
! [X0] :
( in(sK6(X0,sF10),sK7)
| in(sK6(X0,sF10),X0)
| sF10 = X0 ),
inference(resolution,[],[f221,f91]) ).
fof(f268,plain,
! [X0,X1] :
( ~ in(X0,sF11)
| ~ in(X0,X1)
| in(X0,relation_dom(relation_dom_restriction(sK8,X1)))
| ~ relation(sK8) ),
inference(superposition,[],[f97,f109]) ).
fof(f270,plain,
! [X0,X1] :
( in(X0,relation_dom(relation_dom_restriction(sK8,X1)))
| ~ in(X0,X1)
| ~ in(X0,sF11) ),
inference(forward_subsumption_resolution,[],[f268,f99]) ).
fof(f325,plain,
! [X0] :
( in(sK6(X0,sF10),sF11)
| in(sK6(X0,sF10),X0)
| sF10 = X0 ),
inference(resolution,[],[f243,f91]) ).
fof(f338,plain,
! [X0] :
( in(X0,relation_dom(sF9))
| ~ in(X0,sK7)
| ~ in(X0,sF11) ),
inference(superposition,[],[f270,f105]) ).
fof(f339,plain,
! [X0] :
( ~ in(X0,sF11)
| ~ in(X0,sK7)
| in(X0,sF10) ),
inference(forward_demodulation,[],[f338,f107]) ).
fof(f1497,plain,
( in(sK6(sF12,sF10),sK7)
| sF10 = sF12
| in(sK6(sF12,sF10),sK7) ),
inference(resolution,[],[f263,f206]) ).
fof(f1500,plain,
( in(sK6(sF12,sF10),sK7)
| sF10 = sF12 ),
inference(duplicate_literal_removal,[],[f1497]) ).
fof(f1514,plain,
in(sK6(sF12,sF10),sK7),
inference(forward_subsumption_resolution,[],[f1500,f112]) ).
fof(f1517,definition,
( spl13_15
<=> in(sK6(sF12,sF10),sF11) ),
introduced(definition,[new_symbols(definition,[spl13_15])],[avatar_definition]) ).
fof(f1519,plain,
( in(sK6(sF12,sF10),sF11)
| ~ spl13_15 ),
inference(avatar_component_clause,[],[f1517]) ).
fof(f1521,definition,
( spl13_16
<=> in(sK6(sF12,sF10),sK7) ),
introduced(definition,[new_symbols(definition,[spl13_16])],[avatar_definition]) ).
fof(f1523,plain,
( in(sK6(sF12,sF10),sK7)
| ~ spl13_16 ),
inference(avatar_component_clause,[],[f1521]) ).
fof(f1525,plain,
spl13_16,
inference(avatar_split_clause,[],[f1514,f1521]) ).
fof(f2021,plain,
( in(sK6(sF12,sF10),sF11)
| sF10 = sF12
| in(sK6(sF12,sF10),sF11) ),
inference(resolution,[],[f325,f197]) ).
fof(f2025,plain,
( in(sK6(sF12,sF10),sF11)
| sF10 = sF12 ),
inference(duplicate_literal_removal,[],[f2021]) ).
fof(f2030,plain,
in(sK6(sF12,sF10),sF11),
inference(forward_subsumption_resolution,[],[f2025,f112]) ).
fof(f2088,plain,
spl13_15,
inference(avatar_split_clause,[],[f2030,f1517]) ).
fof(f5129,plain,
( in(sK6(sF12,sF10),sF12)
| ~ in(sK6(sF12,sF10),sK7)
| ~ spl13_15 ),
inference(resolution,[],[f1519,f234]) ).
fof(f5130,plain,
( ~ in(sK6(sF12,sF10),sK7)
| in(sK6(sF12,sF10),sF10)
| ~ spl13_15 ),
inference(resolution,[],[f1519,f339]) ).
fof(f5134,plain,
( in(sK6(sF12,sF10),sF10)
| ~ spl13_15
| ~ spl13_16 ),
inference(forward_subsumption_resolution,[],[f5130,f1523]) ).
fof(f5135,plain,
( in(sK6(sF12,sF10),sF12)
| ~ spl13_15
| ~ spl13_16 ),
inference(forward_subsumption_resolution,[],[f5129,f1523]) ).
fof(f6059,plain,
( sF10 = sF12
| ~ in(sK6(sF12,sF10),sF12)
| ~ spl13_15
| ~ spl13_16 ),
inference(resolution,[],[f5134,f92]) ).
fof(f6065,plain,
( ~ in(sK6(sF12,sF10),sF12)
| ~ spl13_15
| ~ spl13_16 ),
inference(forward_subsumption_resolution,[],[f6059,f112]) ).
fof(f6066,plain,
( $false
| ~ spl13_15
| ~ spl13_16 ),
inference(forward_subsumption_resolution,[],[f6065,f5135]) ).
fof(f6067,plain,
( ~ spl13_15
| ~ spl13_16 ),
inference(avatar_contradiction_clause,[],[f6066]) ).
cnf(s9,plain,
spl13_16,
inference(sat_conversion,[],[f1525]) ).
cnf(s13,plain,
spl13_15,
inference(sat_conversion,[],[f2088]) ).
cnf(s78,plain,
( ~ spl13_15
| ~ spl13_16 ),
inference(sat_conversion,[],[f6067]) ).
cnf(s79,plain,
~ spl13_16,
inference(rat,[],[s78,s13]) ).
cnf(s80,plain,
$false,
inference(rat,[],[s9,s79]) ).
fof(f6068,plain,
$false,
inference(avatar_sat_refutation,[],[s80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU194+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.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:58:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.34/0.82 % (3007170)Will run a generic schedule for satisfiability detection.
% 2.34/0.82 % (3007180)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=406319235:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.34/0.82 % (3007178)dis+10_1_sil=32000:sp=arity:random_seed=3717890244:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.34/0.82 % (3007175)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3447190899_2999 on theBenchmark for (2999ds/0Mi)
% 2.34/0.82 % (3007177)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3092959341:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.34/0.82 % (3007179)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2495624725:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.34/0.82 % (3007181)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=549623843:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.34/0.82 % (3007176)% WARNING: option uhcvi not known.
% 2.34/0.82 % TRYING [1]
% 2.34/0.82 % TRYING [2]
% 2.34/0.82 % TRYING [3]
% 2.34/0.82 % (3007176)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1895225176:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.34/0.82 % TRYING [4]
% 2.34/0.82 % (3007180)Instruction limit reached!
% 2.34/0.82 % (3007180)------------------------------
% 2.34/0.82 % (3007180)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.82 % (3007180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.82 % (3007180)CaDiCaL version: 2.1.3
% 2.34/0.82 % (3007180)Termination reason: Instruction limit
% 2.34/0.82 % (3007180)Termination phase: Saturation
% 2.34/0.82 % (3007180)Time elapsed: 0.041 s
% 2.34/0.82 % (3007180)Peak memory usage: 13 MB
% 2.34/0.82 % (3007180)Instructions burned: 131 (million)
% 2.34/0.82 % (3007189)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3977261532:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.34/0.82 % TRYING [1]
% 2.34/0.82 % TRYING [2]
% 2.34/0.82 % TRYING [3]
% 2.34/0.82 % TRYING [4]
% 2.34/0.82 % (3007178)Instruction limit reached!
% 2.34/0.82 % (3007178)------------------------------
% 2.34/0.82 % (3007178)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.82 % (3007178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.82 % (3007178)CaDiCaL version: 2.1.3
% 2.34/0.82 % (3007178)Termination reason: Instruction limit
% 2.34/0.82 % (3007178)Termination phase: Saturation
% 2.34/0.82 % (3007178)Time elapsed: 0.061 s
% 2.34/0.82 % (3007178)Peak memory usage: 12 MB
% 2.34/0.82 % (3007178)Instructions burned: 104 (million)
% 2.34/0.82 % (3007179)Instruction limit reached!
% 2.34/0.82 % (3007179)------------------------------
% 2.34/0.82 % (3007179)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.82 % (3007179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.82 % (3007179)CaDiCaL version: 2.1.3
% 2.34/0.82 % (3007179)Termination reason: Instruction limit
% 2.34/0.82 % (3007179)Termination phase: Saturation
% 2.34/0.82 % (3007179)Time elapsed: 0.066 s
% 2.34/0.82 % (3007179)Peak memory usage: 12 MB
% 2.34/0.82 % (3007179)Instructions burned: 116 (million)
% 2.34/0.82 % (3007191)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=167643513:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.34/0.82 % (3007192)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=3417432227:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.34/0.82 % (3007181)Instruction limit reached!
% 2.34/0.82 % (3007181)------------------------------
% 2.34/0.82 % (3007181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.82 % (3007181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.82 % (3007181)CaDiCaL version: 2.1.3
% 2.34/0.82 % (3007181)Termination reason: Instruction limit
% 2.34/0.82 % (3007181)Termination phase: Saturation
% 2.34/0.82 % (3007181)Time elapsed: 0.095 s
% 2.34/0.82 % (3007181)Peak memory usage: 13 MB
% 2.34/0.82 % (3007181)Instructions burned: 160 (million)
% 2.34/0.82 % TRYING [5]
% 2.34/0.82 % (3007195)ott-21_1_sil=16000:fs=off:random_seed=3664877571:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.34/0.82 % TRYING [5]
% 2.34/0.82 % (3007191)Instruction limit reached!
% 2.34/0.82 % (3007191)------------------------------
% 2.34/0.82 % (3007191)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.82 % (3007191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.82 % (3007191)CaDiCaL version: 2.1.3
% 2.34/0.82 % (3007191)Termination reason: Instruction limit
% 2.34/0.82 % (3007191)Termination phase: Saturation
% 2.34/0.82 % (3007191)Time elapsed: 0.084 s
% 2.34/0.82 % (3007191)Peak memory usage: 13 MB
% 2.34/0.82 % (3007191)Instructions burned: 132 (million)
% 2.34/0.82 % (3007197)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2048856681:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.34/0.82 % (3007195)Instruction limit reached!
% 2.34/0.82 % (3007195)------------------------------
% 2.34/0.82 % (3007195)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.82 % (3007195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.82 % (3007195)CaDiCaL version: 2.1.3
% 2.34/0.82 % (3007195)Termination reason: Instruction limit
% 2.34/0.82 % (3007195)Termination phase: Saturation
% 2.34/0.82 % (3007195)Time elapsed: 0.082 s
% 2.34/0.82 % (3007195)Peak memory usage: 12 MB
% 2.34/0.82 % (3007195)Instructions burned: 182 (million)
% 2.34/0.82 % (3007199)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3533708989:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.34/0.82 % TRYING [1]
% 2.34/0.82 % TRYING [2]
% 2.34/0.82 % TRYING [3]
% 2.34/0.82 % TRYING [4]
% 2.34/0.82 % (3007189)Instruction limit reached!
% 2.34/0.82 % (3007189)------------------------------
% 2.34/0.82 % (3007189)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.82 % (3007189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.82 % (3007189)CaDiCaL version: 2.1.3
% 2.34/0.82 % (3007189)Termination reason: Instruction limit
% 2.34/0.82 % (3007189)Termination phase: Finite model building SAT solving
% 2.34/0.82 % (3007189)Time elapsed: 0.222 s
% 2.34/0.82 % (3007189)Peak memory usage: 15 MB
% 2.34/0.82 % (3007189)Instructions burned: 714 (million)
% 2.34/0.82 % (3007201)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2643782901:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.34/0.82 % TRYING [5]
% 2.34/0.82 % (3007201) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3007170-3007201"...
% 2.34/0.82 % (3007201)...printing done.
% 2.34/0.82 % (3007201)Refutation found. Thanks to Tanya!
% 2.34/0.82 % SZS status Theorem for theBenchmark
% 2.34/0.82 % SZS output start Proof for theBenchmark
% See solution above
% 2.34/0.82 % (3007201)------------------------------
% 2.34/0.82 % (3007201)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.34/0.82 % (3007201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.34/0.82 % (3007201)CaDiCaL version: 2.1.3
% 2.34/0.82 % (3007201)Termination reason: Refutation
% 2.34/0.82 % (3007201)Time elapsed: 0.101 s
% 2.34/0.82 % (3007201)Peak memory usage: 15 MB
% 2.34/0.82 % (3007201)Instructions burned: 324 (million)
% 2.34/0.82 % (3007170)Success in time 0.416 s
% 2.34/0.82 % Vampire exiting
%------------------------------------------------------------------------------