%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET071+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:42:57 PM UTC 2026
% Result : Theorem 0.17s 5.87s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 68 ( 20 unt; 3 def)
% Number of atoms : 184 ( 46 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 191 ( 75 ~; 66 |; 39 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 73 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(f2,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subclass(X0,X1)
& subclass(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(f31,axiom,
! [X0,X1] :
( member(X0,sum_class(X1))
<=> ? [X2] :
( member(X0,X2)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',sum_class_defn) ).
fof(f41,axiom,
! [X0] :
( X0 != null_class
=> ? [X1] :
( member(X1,universal_class)
& member(X1,X0)
& disjoint(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(f44,conjecture,
! [X0,X1] :
( ( ~ member(X0,universal_class)
& ~ member(X1,universal_class) )
=> unordered_pair(X0,X1) = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_unordered_pair) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( ( ~ member(X0,universal_class)
& ~ member(X1,universal_class) )
=> unordered_pair(X0,X1) = null_class ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f47,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f57,plain,
! [X0] :
( ? [X1] :
( member(X1,universal_class)
& member(X1,X0)
& disjoint(X1,X0) )
| null_class = X0 ),
inference(ennf_transformation,[],[f41]) ).
fof(f60,plain,
? [X0,X1] :
( unordered_pair(X0,X1) != null_class
& ~ member(X0,universal_class)
& ~ member(X1,universal_class) ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1] :
( unordered_pair(X0,X1) != null_class
& ~ member(X0,universal_class)
& ~ member(X1,universal_class) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subclass(X0,X1) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f63,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(rectify,[],[f62]) ).
fof(f64,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f63]) ).
fof(f65,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subclass(X0,X1)
| ~ subclass(X1,X0) )
& ( ( subclass(X0,X1)
& subclass(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f66,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subclass(X0,X1)
| ~ subclass(X1,X0) )
& ( ( subclass(X0,X1)
& subclass(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f67]) ).
fof(f90,plain,
! [X0,X1] :
( ( member(X0,sum_class(X1))
| ! [X2] :
( ~ member(X0,X2)
| ~ member(X2,X1) ) )
& ( ? [X2] :
( member(X0,X2)
& member(X2,X1) )
| ~ member(X0,sum_class(X1)) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f91,plain,
! [X0,X1] :
( ( member(X0,sum_class(X1))
| ! [X2] :
( ~ member(X0,X2)
| ~ member(X2,X1) ) )
& ( ? [X3] :
( member(X0,X3)
& member(X3,X1) )
| ~ member(X0,sum_class(X1)) ) ),
inference(rectify,[],[f90]) ).
fof(f92,plain,
! [X0,X1] :
( ( member(X0,sum_class(X1))
| ! [X2] :
( ~ member(X0,X2)
| ~ member(X2,X1) ) )
& ( ( member(X0,sK2(X0,X1))
& member(sK2(X0,X1),X1) )
| ~ member(X0,sum_class(X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1))],[f91]) ).
fof(f102,plain,
! [X0] :
( ( member(sK4(X0),universal_class)
& member(sK4(X0),X0)
& disjoint(sK4(X0),X0) )
| null_class = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f57]) ).
fof(f104,plain,
( null_class != unordered_pair(sK6,sK7)
& ~ member(sK6,universal_class)
& ~ member(sK7,universal_class) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f61]) ).
fof(f105,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| member(X3,X1)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f108,plain,
! [X0] : subclass(X0,universal_class),
inference(cnf_transformation,[],[f2]) ).
fof(f109,plain,
! [X0,X1] :
( subclass(X1,X0)
| X0 != X1 ),
inference(cnf_transformation,[],[f66]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f116,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f168,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X0,X2)
| member(X0,sum_class(X1)) ),
inference(cnf_transformation,[],[f92]) ).
fof(f187,plain,
! [X0] :
( member(sK4(X0),X0)
| null_class = X0 ),
inference(cnf_transformation,[],[f102]) ).
fof(f188,plain,
! [X0] :
( member(sK4(X0),universal_class)
| null_class = X0 ),
inference(cnf_transformation,[],[f102]) ).
fof(f192,plain,
~ member(sK7,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f193,plain,
~ member(sK6,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f194,plain,
null_class != unordered_pair(sK6,sK7),
inference(cnf_transformation,[],[f104]) ).
fof(f233,plain,
! [X1] : subclass(X1,X1),
inference(equality_resolution,[],[f109]) ).
fof(f238,definition,
sF8 = unordered_pair(sK6,sK7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f239,plain,
unordered_pair(sK6,sK7) = sF8,
inference(reorient_equations,[],[f238]) ).
fof(f240,plain,
null_class != sF8,
inference(definition_folding,[],[f194,f239]) ).
fof(f242,plain,
member(sF8,universal_class),
inference(superposition,[],[f116,f239]) ).
fof(f420,plain,
! [X0] :
( ~ member(X0,sF8)
| member(X0,sum_class(universal_class)) ),
inference(resolution,[],[f168,f242]) ).
fof(f446,plain,
! [X0] :
( ~ member(X0,sF8)
| sK7 = X0
| sK6 = X0 ),
inference(superposition,[],[f112,f239]) ).
fof(f567,plain,
( member(sK4(sF8),sum_class(universal_class))
| null_class = sF8 ),
inference(resolution,[],[f420,f187]) ).
fof(f570,plain,
member(sK4(sF8),sum_class(universal_class)),
inference(forward_subsumption_resolution,[],[f567,f240]) ).
fof(f578,plain,
! [X0] :
( ~ subclass(sum_class(universal_class),X0)
| member(sK4(sF8),X0) ),
inference(resolution,[],[f570,f105]) ).
fof(f609,plain,
member(sK4(sF8),universal_class),
inference(resolution,[],[f578,f108]) ).
fof(f631,plain,
! [X0] :
( member(sK4(sF8),X0)
| ~ subclass(universal_class,X0) ),
inference(resolution,[],[f609,f105]) ).
fof(f1219,plain,
( sK7 = sK4(sF8)
| sK6 = sK4(sF8)
| null_class = sF8 ),
inference(resolution,[],[f446,f187]) ).
fof(f1223,plain,
( sK7 = sK4(sF8)
| sK6 = sK4(sF8) ),
inference(forward_subsumption_resolution,[],[f1219,f240]) ).
fof(f1278,definition,
( spl9_81
<=> sK6 = sK4(sF8) ),
introduced(definition,[new_symbols(definition,[spl9_81])],[avatar_definition]) ).
fof(f1280,plain,
( sK6 = sK4(sF8)
| ~ spl9_81 ),
inference(avatar_component_clause,[],[f1278]) ).
fof(f1282,definition,
( spl9_82
<=> sK7 = sK4(sF8) ),
introduced(definition,[new_symbols(definition,[spl9_82])],[avatar_definition]) ).
fof(f1284,plain,
( sK7 = sK4(sF8)
| ~ spl9_82 ),
inference(avatar_component_clause,[],[f1282]) ).
fof(f1285,plain,
( spl9_81
| spl9_82 ),
inference(avatar_split_clause,[],[f1223,f1282,f1278]) ).
fof(f1300,plain,
( ! [X0] :
( ~ subclass(universal_class,X0)
| member(sK6,X0) )
| ~ spl9_81 ),
inference(superposition,[],[f631,f1280]) ).
fof(f1656,plain,
( member(sK6,universal_class)
| ~ spl9_81 ),
inference(resolution,[],[f1300,f233]) ).
fof(f3408,plain,
( member(sK7,universal_class)
| null_class = sF8
| ~ spl9_82 ),
inference(superposition,[],[f188,f1284]) ).
fof(f4650,plain,
( null_class = sF8
| ~ spl9_82 ),
inference(forward_subsumption_resolution,[],[f3408,f192]) ).
fof(f4767,plain,
( $false
| ~ spl9_82 ),
inference(forward_subsumption_resolution,[],[f4650,f240]) ).
fof(f4768,plain,
~ spl9_82,
inference(avatar_contradiction_clause,[],[f4767]) ).
fof(f4813,plain,
( $false
| ~ spl9_81 ),
inference(forward_subsumption_resolution,[],[f1656,f193]) ).
fof(f4814,plain,
~ spl9_81,
inference(avatar_contradiction_clause,[],[f4813]) ).
cnf(s64,plain,
( spl9_81
| spl9_82 ),
inference(sat_conversion,[],[f1285]) ).
cnf(s128,plain,
~ spl9_82,
inference(sat_conversion,[],[f4768]) ).
cnf(s140,plain,
~ spl9_81,
inference(sat_conversion,[],[f4814]) ).
cnf(s142,plain,
$false,
inference(rat,[],[s64,s128,s140]) ).
fof(f4937,plain,
$false,
inference(avatar_sat_refutation,[],[s142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET071+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/5.39 % Computer : n011.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Mon Sep 28 00:30:06 UTC 2026
% 0.17/5.40 % CPUTime :
% 0.17/5.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.17/5.43 Running first-order model finding
% 0.17/5.43 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.86 % (2909025)Will run a generic schedule for satisfiability detection.
% 0.17/5.86 % (2909034)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2840669487:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/5.86 % (2909031)% WARNING: option uhcvi not known.
% 0.17/5.86 % (2909030)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2419429602_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/5.86 % (2909031)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2070868012:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/5.86 % (2909036)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1893981113:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/5.86 % (2909032)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1788784899:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/5.86 % (2909033)dis+10_1_sil=32000:sp=arity:random_seed=1210403459:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/5.86 % (2909035)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1070593364:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/5.86 % TRYING [1]
% 0.17/5.86 % TRYING [2]
% 0.17/5.86 % (2909034)Instruction limit reached!
% 0.17/5.86 % (2909034)------------------------------
% 0.17/5.86 % (2909034)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.86 % (2909034)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.86 % (2909034)CaDiCaL version: 2.1.3
% 0.17/5.86 % (2909034)Termination reason: Instruction limit
% 0.17/5.86 % (2909034)Termination phase: Saturation
% 0.17/5.86 % (2909034)Time elapsed: 0.040 s
% 0.17/5.86 % (2909034)Peak memory usage: 13 MB
% 0.17/5.86 % (2909034)Instructions burned: 117 (million)
% 0.17/5.86 % TRYING [3]
% 0.17/5.86 % (2909044)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1029860233:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/5.86 % TRYING [1]
% 0.17/5.86 % TRYING [2]
% 0.17/5.86 % TRYING [3]
% 0.17/5.86 % (2909033)Instruction limit reached!
% 0.17/5.86 % (2909033)------------------------------
% 0.17/5.86 % (2909033)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.86 % (2909033)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.86 % (2909033)CaDiCaL version: 2.1.3
% 0.17/5.86 % (2909033)Termination reason: Instruction limit
% 0.17/5.86 % (2909033)Termination phase: Saturation
% 0.17/5.86 % (2909033)Time elapsed: 0.066 s
% 0.17/5.86 % (2909033)Peak memory usage: 13 MB
% 0.17/5.86 % (2909033)Instructions burned: 103 (million)
% 0.17/5.86 % (2909035)Instruction limit reached!
% 0.17/5.86 % (2909035)------------------------------
% 0.17/5.86 % (2909035)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.86 % (2909035)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.86 % (2909035)CaDiCaL version: 2.1.3
% 0.17/5.86 % (2909035)Termination reason: Instruction limit
% 0.17/5.86 % (2909035)Termination phase: Saturation
% 0.17/5.86 % (2909035)Time elapsed: 0.076 s
% 0.17/5.86 % (2909035)Peak memory usage: 13 MB
% 0.17/5.86 % (2909035)Instructions burned: 132 (million)
% 0.17/5.86 % (2909046)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=412935479:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/5.86 % TRYING [4]
% 0.17/5.86 % TRYING [4]
% 0.17/5.86 % (2909047)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=1592832658:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.17/5.86 % (2909036)Instruction limit reached!
% 0.17/5.86 % (2909036)------------------------------
% 0.17/5.86 % (2909036)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.86 % (2909036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.86 % (2909036)CaDiCaL version: 2.1.3
% 0.17/5.86 % (2909036)Termination reason: Instruction limit
% 0.17/5.86 % (2909036)Termination phase: Saturation
% 0.17/5.86 % (2909036)Time elapsed: 0.099 s
% 0.17/5.86 % (2909036)Peak memory usage: 13 MB
% 0.17/5.86 % (2909036)Instructions burned: 159 (million)
% 0.17/5.86 % (2909050)ott-21_1_sil=16000:fs=off:random_seed=1280047495:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.17/5.86 % (2909046)Instruction limit reached!
% 0.17/5.86 % (2909046)------------------------------
% 0.17/5.86 % (2909046)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.86 % (2909046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.86 % (2909046)CaDiCaL version: 2.1.3
% 0.17/5.86 % (2909046)Termination reason: Instruction limit
% 0.17/5.86 % (2909046)Termination phase: Saturation
% 0.17/5.86 % (2909046)Time elapsed: 0.075 s
% 0.17/5.86 % (2909046)Peak memory usage: 13 MB
% 0.17/5.86 % (2909046)Instructions burned: 133 (million)
% 0.17/5.86 % (2909052)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1827351696:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.17/5.86 % TRYING [5]
% 0.17/5.86 % (2909044)Instruction limit reached!
% 0.17/5.86 % (2909044)------------------------------
% 0.17/5.86 % (2909044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.86 % (2909044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.86 % (2909044)CaDiCaL version: 2.1.3
% 0.17/5.86 % (2909044)Termination reason: Instruction limit
% 0.17/5.86 % (2909044)Termination phase: Finite model building constraint generation
% 0.17/5.86 % (2909044)Time elapsed: 0.157 s
% 0.17/5.86 % (2909044)Peak memory usage: 40 MB
% 0.17/5.86 % (2909044)Instructions burned: 717 (million)
% 0.17/5.86 % (2909050)Instruction limit reached!
% 0.17/5.86 % (2909050)------------------------------
% 0.17/5.86 % (2909050)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.86 % (2909050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.86 % (2909050)CaDiCaL version: 2.1.3
% 0.17/5.86 % (2909050)Termination reason: Instruction limit
% 0.17/5.86 % (2909050)Termination phase: Saturation
% 0.17/5.86 % (2909050)Time elapsed: 0.095 s
% 0.17/5.86 % (2909050)Peak memory usage: 13 MB
% 0.17/5.86 % (2909050)Instructions burned: 180 (million)
% 0.17/5.86 % (2909054)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2478447466:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 0.17/5.86 % TRYING [1]
% 0.17/5.86 % TRYING [2]
% 0.17/5.86 % (2909056)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3535143132:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 0.17/5.86 % TRYING [3]
% 0.17/5.86 % TRYING [5]
% 0.17/5.86 % TRYING [4]
% 0.17/5.86 % (2909056) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2909025-2909056"...
% 0.17/5.86 % (2909056)...printing done.
% 0.17/5.86 % (2909056)Refutation found. Thanks to Tanya!
% 0.17/5.87 % SZS status Theorem for theBenchmark
% 0.17/5.87 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/5.87 % (2909056)------------------------------
% 0.17/5.87 % (2909056)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/5.87 % (2909056)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/5.87 % (2909056)CaDiCaL version: 2.1.3
% 0.17/5.87 % (2909056)Termination reason: Refutation
% 0.17/5.87 % (2909056)Time elapsed: 0.151 s
% 0.17/5.87 % (2909056)Peak memory usage: 15 MB
% 0.17/5.87 % (2909056)Instructions burned: 239 (million)
% 0.17/5.87 % (2909025)Success in time 0.426 s
% 0.17/5.87 % Vampire exiting
%------------------------------------------------------------------------------