%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET889+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:15 PM UTC 2026
% Result : Theorem 3.25s 1.34s
% Output : Refutation 3.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 6
% Syntax : Number of formulae : 58 ( 16 unt; 0 def)
% Number of atoms : 219 ( 124 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 244 ( 83 ~; 123 |; 33 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 119 ( 113 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f6,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f9,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f11,conjecture,
! [X0] : powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t30_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0] : powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f9]) ).
fof(f16,plain,
? [X0] : powerset(singleton(X0)) != unordered_pair(empty_set,singleton(X0)),
inference(ennf_transformation,[],[f12]) ).
fof(f17,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f18,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK1(X0,X1,X2) != X0
& sK1(X0,X1,X2) != X1 )
| ~ in(sK1(X0,X1,X2),X2) )
& ( sK1(X0,X1,X2) = X0
| sK1(X0,X1,X2) = X1
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( empty_set != X0
& singleton(X1) != X0 ) )
& ( X0 = empty_set
| X0 = singleton(X1)
| ~ subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( empty_set != X0
& singleton(X1) != X0 ) )
& ( X0 = empty_set
| X0 = singleton(X1)
| ~ subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f24]) ).
fof(f30,plain,
powerset(singleton(sK5)) != unordered_pair(empty_set,singleton(sK5)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X0,sK5)],[f16]) ).
fof(f32,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f35,plain,
! [X0,X1] :
( subset(sK0(X0,X1),X0)
| powerset(X0) = X1
| in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| ~ subset(sK0(X0,X1),X0)
| powerset(X0) = X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0,X1,X4] :
( X0 = X4
| X1 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
! [X0,X1] :
( ~ subset(X0,singleton(X1))
| singleton(X1) = X0
| empty_set = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X0,X1] :
( subset(X0,singleton(X1))
| empty_set != X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f49,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f13]) ).
fof(f52,plain,
powerset(singleton(sK5)) != unordered_pair(empty_set,singleton(sK5)),
inference(cnf_transformation,[],[f30]) ).
fof(f55,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f39]) ).
fof(f56,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f55]) ).
fof(f57,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f38]) ).
fof(f58,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f57]) ).
fof(f59,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f37]) ).
fof(f60,plain,
! [X1] : subset(empty_set,singleton(X1)),
inference(equality_resolution,[],[f46]) ).
fof(f91,plain,
! [X0,X1] :
( singleton(X0) = sK0(singleton(X0),X1)
| in(sK0(singleton(X0),X1),X1)
| powerset(singleton(X0)) = X1
| empty_set = sK0(singleton(X0),X1) ),
inference(resolution,[],[f35,f44]) ).
fof(f117,plain,
! [X0,X1] :
( ~ in(singleton(X0),X1)
| ~ subset(singleton(X0),singleton(X0))
| powerset(singleton(X0)) = X1
| in(sK0(singleton(X0),X1),X1)
| powerset(singleton(X0)) = X1
| empty_set = sK0(singleton(X0),X1) ),
inference(superposition,[],[f36,f91]) ).
fof(f123,plain,
! [X0,X1] :
( ~ in(singleton(X0),X1)
| ~ subset(singleton(X0),singleton(X0))
| powerset(singleton(X0)) = X1
| in(sK0(singleton(X0),X1),X1)
| empty_set = sK0(singleton(X0),X1) ),
inference(duplicate_literal_removal,[],[f117]) ).
fof(f125,plain,
! [X0,X1] :
( ~ in(singleton(X0),X1)
| powerset(singleton(X0)) = X1
| in(sK0(singleton(X0),X1),X1)
| empty_set = sK0(singleton(X0),X1) ),
inference(forward_subsumption_resolution,[],[f123,f49]) ).
fof(f149,plain,
! [X0,X1] :
( empty_set = sK0(singleton(X0),unordered_pair(singleton(X0),X1))
| in(sK0(singleton(X0),unordered_pair(singleton(X0),X1)),unordered_pair(singleton(X0),X1))
| powerset(singleton(X0)) = unordered_pair(singleton(X0),X1) ),
inference(resolution,[],[f125,f56]) ).
fof(f150,plain,
! [X0,X1] :
( in(sK0(singleton(X0),unordered_pair(X1,singleton(X0))),unordered_pair(X1,singleton(X0)))
| powerset(singleton(X0)) = unordered_pair(X1,singleton(X0))
| empty_set = sK0(singleton(X0),unordered_pair(X1,singleton(X0))) ),
inference(resolution,[],[f125,f58]) ).
fof(f245,plain,
! [X0,X1] :
( ~ in(empty_set,unordered_pair(singleton(X0),X1))
| ~ subset(empty_set,singleton(X0))
| powerset(singleton(X0)) = unordered_pair(singleton(X0),X1)
| in(sK0(singleton(X0),unordered_pair(singleton(X0),X1)),unordered_pair(singleton(X0),X1))
| powerset(singleton(X0)) = unordered_pair(singleton(X0),X1) ),
inference(superposition,[],[f36,f149]) ).
fof(f248,plain,
! [X0,X1] :
( ~ in(empty_set,unordered_pair(singleton(X0),X1))
| ~ subset(empty_set,singleton(X0))
| powerset(singleton(X0)) = unordered_pair(singleton(X0),X1)
| in(sK0(singleton(X0),unordered_pair(singleton(X0),X1)),unordered_pair(singleton(X0),X1)) ),
inference(duplicate_literal_removal,[],[f245]) ).
fof(f250,plain,
! [X0,X1] :
( ~ in(empty_set,unordered_pair(singleton(X0),X1))
| powerset(singleton(X0)) = unordered_pair(singleton(X0),X1)
| in(sK0(singleton(X0),unordered_pair(singleton(X0),X1)),unordered_pair(singleton(X0),X1)) ),
inference(forward_subsumption_resolution,[],[f248,f60]) ).
fof(f252,plain,
! [X0,X1] :
( singleton(X0) = sK0(singleton(X0),unordered_pair(X1,singleton(X0)))
| empty_set = sK0(singleton(X0),unordered_pair(X1,singleton(X0)))
| powerset(singleton(X0)) = unordered_pair(X1,singleton(X0))
| sK0(singleton(X0),unordered_pair(X1,singleton(X0))) = X1 ),
inference(resolution,[],[f150,f59]) ).
fof(f266,plain,
! [X0] :
( powerset(singleton(X0)) = unordered_pair(singleton(X0),empty_set)
| in(sK0(singleton(X0),unordered_pair(singleton(X0),empty_set)),unordered_pair(singleton(X0),empty_set)) ),
inference(resolution,[],[f250,f58]) ).
fof(f269,plain,
! [X0] :
( powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0))
| in(sK0(singleton(X0),unordered_pair(singleton(X0),empty_set)),unordered_pair(singleton(X0),empty_set)) ),
inference(forward_demodulation,[],[f266,f32]) ).
fof(f270,plain,
! [X0] :
( in(sK0(singleton(X0),unordered_pair(empty_set,singleton(X0))),unordered_pair(empty_set,singleton(X0)))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)) ),
inference(forward_demodulation,[],[f269,f32]) ).
fof(f285,plain,
! [X0] :
( powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0))
| ~ subset(sK0(singleton(X0),unordered_pair(empty_set,singleton(X0))),singleton(X0))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)) ),
inference(resolution,[],[f270,f36]) ).
fof(f291,plain,
! [X0] :
( ~ subset(sK0(singleton(X0),unordered_pair(empty_set,singleton(X0))),singleton(X0))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)) ),
inference(duplicate_literal_removal,[],[f285]) ).
fof(f756,plain,
! [X0] :
( ~ subset(singleton(X0),singleton(X0))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0))
| empty_set = sK0(singleton(X0),unordered_pair(empty_set,singleton(X0)))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0))
| empty_set = sK0(singleton(X0),unordered_pair(empty_set,singleton(X0))) ),
inference(superposition,[],[f291,f252]) ).
fof(f765,plain,
! [X0] :
( ~ subset(singleton(X0),singleton(X0))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0))
| empty_set = sK0(singleton(X0),unordered_pair(empty_set,singleton(X0))) ),
inference(duplicate_literal_removal,[],[f756]) ).
fof(f773,plain,
! [X0] :
( empty_set = sK0(singleton(X0),unordered_pair(empty_set,singleton(X0)))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)) ),
inference(forward_subsumption_resolution,[],[f765,f49]) ).
fof(f888,plain,
! [X0] :
( ~ subset(empty_set,singleton(X0))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)) ),
inference(superposition,[],[f291,f773]) ).
fof(f897,plain,
! [X0] :
( ~ subset(empty_set,singleton(X0))
| powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)) ),
inference(duplicate_literal_removal,[],[f888]) ).
fof(f903,plain,
! [X0] : powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)),
inference(forward_subsumption_resolution,[],[f897,f60]) ).
fof(f943,plain,
powerset(singleton(sK5)) != powerset(singleton(sK5)),
inference(superposition,[],[f52,f903]) ).
fof(f981,plain,
$false,
inference(trivial_inequality_removal,[],[f943]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET889+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n015.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 03:10:01 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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
% 3.25/1.34 % (2222590)Detected formulas, will run a generic FOF schedule.
% 3.25/1.34 % (2222599)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1893806360:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.25/1.34 % (2222601)dis-21_1_sil=8000:lcm=predicate:random_seed=2200157866: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)
% 3.25/1.34 % (2222597)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=786903902:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.25/1.34 % (2222600)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1330699754:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.25/1.34 % (2222596)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=3551115020:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.25/1.34 % (2222598)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1084047119:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.25/1.34 % (2222595)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=2622584468:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.25/1.34 % (2222599)Instruction limit reached!
% 3.25/1.34 % (2222599)------------------------------
% 3.25/1.34 % (2222599)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.25/1.34 % (2222599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.25/1.34 % (2222599)CaDiCaL version: 2.1.3
% 3.25/1.34 % (2222599)Termination reason: Instruction limit
% 3.25/1.34 % (2222599)Termination phase: Saturation
% 3.25/1.34 % (2222599)Time elapsed: 0.031 s
% 3.25/1.34 % (2222599)Peak memory usage: 88 MB
% 3.25/1.34 % (2222599)Instructions burned: 119 (million)
% 3.25/1.34 % (2222598)Refutation not found, incomplete strategy
% 3.25/1.34 % (2222598)------------------------------
% 3.25/1.34 % (2222598)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.25/1.34 % (2222598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.25/1.34 % (2222598)CaDiCaL version: 2.1.3
% 3.25/1.34 % (2222598)Termination reason: Refutation not found, incomplete strategy
% 3.25/1.34 % (2222598)Time elapsed: 0.002 s
% 3.25/1.34 % (2222598)Peak memory usage: 88 MB
% 3.25/1.34 % (2222598)Instructions burned: 1 (million)
% 3.25/1.34 % (2222600)First to succeed.
% 3.25/1.34 % (2222600)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2222590"
% 3.25/1.34 % (2222601)Instruction limit reached!
% 3.25/1.34 % (2222601)------------------------------
% 3.25/1.34 % (2222601)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.25/1.34 % (2222601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.25/1.34 % (2222601)CaDiCaL version: 2.1.3
% 3.25/1.34 % (2222601)Termination reason: Instruction limit
% 3.25/1.34 % (2222601)Termination phase: Saturation
% 3.25/1.34 % (2222601)Time elapsed: 0.072 s
% 3.25/1.34 % (2222601)Peak memory usage: 89 MB
% 3.25/1.34 % (2222601)Instructions burned: 130 (million)
% 3.25/1.34 % (2222609)lrs+10_1_sil=8000:sp=occurrence:random_seed=392296687:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.25/1.34 % (2222609)Instruction limit reached!
% 3.25/1.34 % (2222609)------------------------------
% 3.25/1.34 % (2222609)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.25/1.34 % (2222609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.25/1.34 % (2222609)CaDiCaL version: 2.1.3
% 3.25/1.34 % (2222609)Termination reason: Instruction limit
% 3.25/1.34 % (2222609)Termination phase: Saturation
% 3.25/1.34 % (2222609)Time elapsed: 0.075 s
% 3.25/1.34 % (2222609)Peak memory usage: 89 MB
% 3.25/1.34 % (2222609)Instructions burned: 288 (million)
% 3.25/1.34 % (2222610)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1208532134:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.25/1.34 % (2222598)------------------------------
% 3.25/1.34 % (2222598)------------------------------
% 3.25/1.34 % (2222610)Refutation not found, incomplete strategy
% 3.25/1.34 % (2222610)------------------------------
% 3.25/1.34 % (2222610)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.25/1.34 % (2222610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.25/1.34 % (2222610)CaDiCaL version: 2.1.3
% 3.25/1.34 % (2222610)Termination reason: Refutation not found, incomplete strategy
% 3.25/1.34 % (2222610)Time elapsed: 0.003 s
% 3.25/1.34 % (2222610)Peak memory usage: 88 MB
% 3.25/1.34 % (2222610)Instructions burned: 2 (million)
% 3.25/1.34 % (2222600)Refutation found. Thanks to Tanya!
% 3.25/1.34 % SZS status Theorem for theBenchmark
% 3.25/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 3.88/1.44 % (2222600)------------------------------
% 3.88/1.44 % (2222600)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.88/1.44 % (2222600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.44 % (2222600)CaDiCaL version: 2.1.3
% 3.88/1.44 % (2222600)Termination reason: Refutation
% 3.88/1.44 % (2222600)Time elapsed: 0.048 s
% 3.88/1.44 % (2222600)Peak memory usage: 89 MB
% 3.88/1.44 % (2222600)Instructions burned: 75 (million)
% 3.88/1.44 % (2222600)------------------------------
% 3.88/1.44 % (2222600)------------------------------
% 3.88/1.44 % (2222590)Success in time 0.479 s
% 3.88/1.44 % Vampire exiting
%------------------------------------------------------------------------------