%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU174+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:47:34 PM UTC 2026
% Result : Theorem 2.92s 1.32s
% Output : Refutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 76 ( 18 unt; 2 def)
% Number of atoms : 221 ( 33 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 255 ( 110 ~; 99 |; 29 &)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 120 ( 0 sgn 111 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f3,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ! [X2] :
( element(X2,powerset(powerset(X0)))
=> ( X2 = complements_of_subsets(X0,X1)
<=> ! [X3] :
( element(X3,powerset(X0))
=> ( in(X3,X2)
<=> in(subset_complement(X0,X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_setfam_1) ).
fof(f7,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> element(complements_of_subsets(X0,X1),powerset(powerset(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_setfam_1) ).
fof(f9,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f13,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k7_setfam_1) ).
fof(f16,axiom,
! [X0] :
? [X1] :
( element(X1,powerset(X0))
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(f20,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f22,conjecture,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ~ ( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_setfam_1) ).
fof(f23,negated_conjecture,
~ ! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ~ ( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set ) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f24,axiom,
! [X0,X1,X2] :
( ( in(X0,X1)
& element(X1,powerset(X2)) )
=> element(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(f25,axiom,
! [X0,X1,X2] :
~ ( in(X0,X1)
& element(X1,powerset(X2))
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
fof(f26,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f30,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f32,plain,
! [X0,X1] :
( ! [X2] :
( ( X2 = complements_of_subsets(X0,X1)
<=> ! [X3] :
( ( in(X3,X2)
<=> in(subset_complement(X0,X3),X1) )
| ~ element(X3,powerset(X0)) ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f3]) ).
fof(f34,plain,
! [X0,X1] :
( element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f7]) ).
fof(f36,plain,
! [X0,X1] :
( complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f13]) ).
fof(f39,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f40,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f39]) ).
fof(f41,plain,
? [X0,X1] :
( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set
& element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f23]) ).
fof(f42,plain,
? [X0,X1] :
( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set
& element(X1,powerset(powerset(X0))) ),
inference(flattening,[],[f41]) ).
fof(f43,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(ennf_transformation,[],[f24]) ).
fof(f44,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(flattening,[],[f43]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ~ in(X0,X1)
| ~ element(X1,powerset(X2))
| ~ empty(X2) ),
inference(ennf_transformation,[],[f25]) ).
fof(f46,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f52,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ? [X3] :
( ( ~ in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) )
& ( in(subset_complement(X0,X3),X1)
| in(X3,X2) )
& element(X3,powerset(X0)) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
| ~ in(subset_complement(X0,X3),X1) )
& ( in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) ) )
| ~ element(X3,powerset(X0)) )
| complements_of_subsets(X0,X1) != X2 ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(nnf_transformation,[],[f32]) ).
fof(f53,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ? [X3] :
( ( ~ in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) )
& ( in(subset_complement(X0,X3),X1)
| in(X3,X2) )
& element(X3,powerset(X0)) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
| ~ in(subset_complement(X0,X3),X1) )
& ( in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) ) )
| ~ element(X3,powerset(X0)) )
| complements_of_subsets(X0,X1) != X2 ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ? [X3] :
( ( ~ in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) )
& ( in(subset_complement(X0,X3),X1)
| in(X3,X2) )
& element(X3,powerset(X0)) ) )
& ( ! [X4] :
( ( ( in(X4,X2)
| ~ in(subset_complement(X0,X4),X1) )
& ( in(subset_complement(X0,X4),X1)
| ~ in(X4,X2) ) )
| ~ element(X4,powerset(X0)) )
| complements_of_subsets(X0,X1) != X2 ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(rectify,[],[f53]) ).
fof(f55,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ( ( ~ in(subset_complement(X0,sK1(X0,X1,X2)),X1)
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(subset_complement(X0,sK1(X0,X1,X2)),X1)
| in(sK1(X0,X1,X2),X2) )
& element(sK1(X0,X1,X2),powerset(X0)) ) )
& ( ! [X4] :
( ( ( in(X4,X2)
| ~ in(subset_complement(X0,X4),X1) )
& ( in(subset_complement(X0,X4),X1)
| ~ in(X4,X2) ) )
| ~ element(X4,powerset(X0)) )
| complements_of_subsets(X0,X1) != X2 ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f54]) ).
fof(f56,plain,
! [X0] : element(sK2(X0),X0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2(X0))],[f9]) ).
fof(f59,plain,
! [X0] :
( element(sK5(X0),powerset(X0))
& empty(sK5(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f16]) ).
fof(f62,plain,
( empty_set != sK8
& empty_set = complements_of_subsets(sK7,sK8)
& element(sK8,powerset(powerset(sK7))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f42]) ).
fof(f63,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f67,plain,
! [X2,X0,X1,X4] :
( in(subset_complement(X0,X4),X1)
| ~ in(X4,X2)
| ~ element(X4,powerset(X0))
| complements_of_subsets(X0,X1) != X2
| ~ element(X2,powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f55]) ).
fof(f73,plain,
! [X0,X1] :
( element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f34]) ).
fof(f74,plain,
! [X0] : element(sK2(X0),X0),
inference(cnf_transformation,[],[f56]) ).
fof(f78,plain,
! [X0,X1] :
( complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f36]) ).
fof(f82,plain,
! [X0] : empty(sK5(X0)),
inference(cnf_transformation,[],[f59]) ).
fof(f83,plain,
! [X0] : element(sK5(X0),powerset(X0)),
inference(cnf_transformation,[],[f59]) ).
fof(f87,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f90,plain,
element(sK8,powerset(powerset(sK7))),
inference(cnf_transformation,[],[f62]) ).
fof(f91,plain,
empty_set = complements_of_subsets(sK7,sK8),
inference(cnf_transformation,[],[f62]) ).
fof(f92,plain,
empty_set != sK8,
inference(cnf_transformation,[],[f62]) ).
fof(f93,plain,
! [X2,X0,X1] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(cnf_transformation,[],[f44]) ).
fof(f94,plain,
! [X2,X0,X1] :
( ~ in(X0,X1)
| ~ element(X1,powerset(X2))
| ~ empty(X2) ),
inference(cnf_transformation,[],[f45]) ).
fof(f95,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f46]) ).
fof(f99,plain,
! [X0,X1,X4] :
( in(subset_complement(X0,X4),X1)
| ~ in(X4,complements_of_subsets(X0,X1))
| ~ element(X4,powerset(X0))
| ~ element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(equality_resolution,[],[f67]) ).
fof(f102,plain,
! [X0] : empty_set = sK5(X0),
inference(resolution,[],[f95,f82]) ).
fof(f104,plain,
! [X0] : element(empty_set,powerset(X0)),
inference(superposition,[],[f83,f102]) ).
fof(f112,plain,
! [X0] : ~ in(X0,X0),
inference(factoring,[],[f63]) ).
fof(f115,plain,
! [X0] :
( ~ element(X0,X0)
| empty(X0) ),
inference(resolution,[],[f112,f87]) ).
fof(f121,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ element(X1,powerset(X0))
| empty(X0) ),
inference(resolution,[],[f93,f115]) ).
fof(f122,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(forward_subsumption_resolution,[],[f121,f94]) ).
fof(f130,plain,
( sK8 = complements_of_subsets(sK7,empty_set)
| ~ element(sK8,powerset(powerset(sK7))) ),
inference(superposition,[],[f78,f91]) ).
fof(f132,plain,
sK8 = complements_of_subsets(sK7,empty_set),
inference(forward_subsumption_resolution,[],[f130,f90]) ).
fof(f151,plain,
! [X0,X1,X4] :
( in(subset_complement(X0,X4),X1)
| ~ in(X4,complements_of_subsets(X0,X1))
| ~ element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(forward_subsumption_resolution,[],[f99,f93]) ).
fof(f152,plain,
! [X0,X1,X4] :
( ~ in(X4,complements_of_subsets(X0,X1))
| in(subset_complement(X0,X4),X1)
| ~ element(X1,powerset(powerset(X0))) ),
inference(forward_subsumption_resolution,[],[f151,f73]) ).
fof(f157,plain,
! [X0] :
( ~ in(X0,sK8)
| in(subset_complement(sK7,X0),empty_set)
| ~ element(empty_set,powerset(powerset(sK7))) ),
inference(superposition,[],[f152,f132]) ).
fof(f160,plain,
! [X0] :
( ~ in(X0,sK8)
| in(subset_complement(sK7,X0),empty_set) ),
inference(forward_subsumption_resolution,[],[f157,f104]) ).
fof(f170,plain,
! [X0] :
( in(subset_complement(sK7,X0),empty_set)
| empty(sK8)
| ~ element(X0,sK8) ),
inference(resolution,[],[f160,f87]) ).
fof(f173,definition,
( spl9_1
<=> empty(sK8) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f175,plain,
( empty(sK8)
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f177,definition,
( spl9_2
<=> ! [X0] :
( in(subset_complement(sK7,X0),empty_set)
| ~ element(X0,sK8) ) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f178,plain,
( ! [X0] :
( ~ element(X0,sK8)
| in(subset_complement(sK7,X0),empty_set) )
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f177]) ).
fof(f179,plain,
( spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f170,f177,f173]) ).
fof(f183,plain,
( in(subset_complement(sK7,sK2(sK8)),empty_set)
| ~ spl9_2 ),
inference(resolution,[],[f178,f74]) ).
fof(f187,plain,
( ~ element(empty_set,powerset(subset_complement(sK7,sK2(sK8))))
| ~ spl9_2 ),
inference(resolution,[],[f183,f122]) ).
fof(f194,plain,
( $false
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f187,f104]) ).
fof(f195,plain,
~ spl9_2,
inference(avatar_contradiction_clause,[],[f194]) ).
fof(f212,plain,
( empty_set = sK8
| ~ spl9_1 ),
inference(resolution,[],[f175,f95]) ).
fof(f213,plain,
( $false
| ~ spl9_1 ),
inference(forward_subsumption_resolution,[],[f212,f92]) ).
fof(f214,plain,
~ spl9_1,
inference(avatar_contradiction_clause,[],[f213]) ).
cnf(s1,plain,
( spl9_1
| spl9_2 ),
inference(sat_conversion,[],[f179]) ).
cnf(s3,plain,
~ spl9_2,
inference(sat_conversion,[],[f195]) ).
cnf(s5,plain,
~ spl9_1,
inference(sat_conversion,[],[f214]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s3,s5]) ).
fof(f215,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU174+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:53:00 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.92/1.32 % (3003613)Detected formulas, will run a generic FOF schedule.
% 2.92/1.32 % (3003720)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4078236791:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.92/1.32 % (3003726)dis-21_1_sil=8000:lcm=predicate:random_seed=3985440830:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.92/1.32 % (3003724)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2569625241:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.92/1.32 % (3003722)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=4284354992:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.92/1.32 % (3003721)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2155128505:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.92/1.32 % (3003725)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=805034176:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.92/1.32 % (3003724)Refutation not found, incomplete strategy
% 2.92/1.32 % (3003724)------------------------------
% 2.92/1.32 % (3003724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.32 % (3003724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.32 % (3003724)CaDiCaL version: 2.1.3
% 2.92/1.32 % (3003724)Termination reason: Refutation not found, incomplete strategy
% 2.92/1.32 % (3003724)Time elapsed: 0.003 s
% 2.92/1.32 % (3003724)Peak memory usage: 88 MB
% 2.92/1.32 % (3003724)Instructions burned: 3 (million)
% 2.92/1.32 % (3003725)First to succeed.
% 2.92/1.32 % (3003725)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3003613"
% 2.92/1.32 % (3003723)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2375491950:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.92/1.32 % (3003723)Refutation not found, incomplete strategy
% 2.92/1.32 % (3003723)------------------------------
% 2.92/1.32 % (3003723)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.32 % (3003723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.32 % (3003723)CaDiCaL version: 2.1.3
% 2.92/1.32 % (3003723)Termination reason: Refutation not found, incomplete strategy
% 2.92/1.32 % (3003723)Time elapsed: 0.002 s
% 2.92/1.32 % (3003723)Peak memory usage: 88 MB
% 2.92/1.32 % (3003723)Instructions burned: 1 (million)
% 2.92/1.32 % (3003726)Instruction limit reached!
% 2.92/1.32 % (3003726)------------------------------
% 2.92/1.32 % (3003726)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.32 % (3003726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.32 % (3003726)CaDiCaL version: 2.1.3
% 2.92/1.32 % (3003726)Termination reason: Instruction limit
% 2.92/1.32 % (3003726)Termination phase: Saturation
% 2.92/1.32 % (3003726)Time elapsed: 0.092 s
% 2.92/1.32 % (3003726)Peak memory usage: 89 MB
% 2.92/1.32 % (3003726)Instructions burned: 129 (million)
% 2.92/1.32 % (3003724)------------------------------
% 2.92/1.32 % (3003724)------------------------------
% 2.92/1.32 % (3003754)lrs+10_1_sil=8000:sp=occurrence:random_seed=1437704571:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.92/1.32 % (3003725)Refutation found. Thanks to Tanya!
% 2.92/1.32 % SZS status Theorem for theBenchmark
% 2.92/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.69/1.41 % (3003725)------------------------------
% 3.69/1.41 % (3003725)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.41 % (3003725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.41 % (3003725)CaDiCaL version: 2.1.3
% 3.69/1.41 % (3003725)Termination reason: Refutation
% 3.69/1.41 % (3003725)Time elapsed: 0.008 s
% 3.69/1.41 % (3003725)Peak memory usage: 89 MB
% 3.69/1.41 % (3003725)Instructions burned: 8 (million)
% 3.69/1.41 % (3003725)------------------------------
% 3.69/1.41 % (3003725)------------------------------
% 3.69/1.41 % (3003613)Success in time 0.444 s
% 3.69/1.41 % Vampire exiting
%------------------------------------------------------------------------------