%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PHI009+1 : TPTP v9.3.1. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:27:19 PM UTC 2026
% Result : Theorem 2.83s 1.29s
% Output : Refutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 4
% Syntax : Number of formulae : 64 ( 5 unt; 2 def)
% Number of atoms : 368 ( 43 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 530 ( 226 ~; 224 |; 64 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 177 ( 159 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( ( property(X0)
& property(X1)
& object(X2) )
=> ( ( is_the(X2,X0)
& exemplifies_property(X1,X2) )
<=> ? [X3] :
( object(X3)
& exemplifies_property(X0,X3)
& ! [X4] :
( object(X4)
=> ( exemplifies_property(X0,X4)
=> X4 = X3 ) )
& exemplifies_property(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_schema_instance) ).
fof(f2,conjecture,
! [X0] :
( property(X0)
=> ( ? [X1] :
( object(X1)
& exemplifies_property(X0,X1)
& ! [X2] :
( object(X2)
=> ( exemplifies_property(X0,X2)
=> X2 = X1 ) ) )
=> ? [X3] :
( object(X3)
& is_the(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_1) ).
fof(f3,negated_conjecture,
~ ! [X0] :
( property(X0)
=> ( ? [X1] :
( object(X1)
& exemplifies_property(X0,X1)
& ! [X2] :
( object(X2)
=> ( exemplifies_property(X0,X2)
=> X2 = X1 ) ) )
=> ? [X3] :
( object(X3)
& is_the(X3,X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
? [X0] :
( ! [X3] :
( ~ object(X3)
| ~ is_the(X3,X0) )
& ? [X1] :
( object(X1)
& exemplifies_property(X0,X1)
& ! [X2] :
( X2 = X1
| ~ exemplifies_property(X0,X2)
| ~ object(X2) ) )
& property(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0] :
( ! [X3] :
( ~ object(X3)
| ~ is_the(X3,X0) )
& ? [X1] :
( object(X1)
& exemplifies_property(X0,X1)
& ! [X2] :
( X2 = X1
| ~ exemplifies_property(X0,X2)
| ~ object(X2) ) )
& property(X0) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
! [X0,X1,X2] :
( ( ( is_the(X2,X0)
& exemplifies_property(X1,X2) )
<=> ? [X3] :
( object(X3)
& exemplifies_property(X0,X3)
& ! [X4] :
( X4 = X3
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X1,X3) ) )
| ~ property(X0)
| ~ property(X1)
| ~ object(X2) ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ( ( is_the(X2,X0)
& exemplifies_property(X1,X2) )
<=> ? [X3] :
( object(X3)
& exemplifies_property(X0,X3)
& ! [X4] :
( X4 = X3
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X1,X3) ) )
| ~ property(X0)
| ~ property(X1)
| ~ object(X2) ),
inference(flattening,[],[f6]) ).
fof(f8,definition,
! [X0,X1] :
( sP0(X0,X1)
<=> ? [X3] :
( object(X3)
& exemplifies_property(X0,X3)
& ! [X4] :
( X4 = X3
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X1,X3) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f9,definition,
! [X1,X0,X2] :
( ( ( is_the(X2,X0)
& exemplifies_property(X1,X2) )
<=> sP0(X0,X1) )
| ~ sP1(X1,X0,X2) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f10,plain,
! [X0,X1,X2] :
( sP1(X1,X0,X2)
| ~ property(X0)
| ~ property(X1)
| ~ object(X2) ),
inference(definition_folding,[],[f7,f9,f8]) ).
fof(f11,plain,
? [X0] :
( ! [X1] :
( ~ object(X1)
| ~ is_the(X1,X0) )
& ? [X2] :
( object(X2)
& exemplifies_property(X0,X2)
& ! [X3] :
( X2 = X3
| ~ exemplifies_property(X0,X3)
| ~ object(X3) ) )
& property(X0) ),
inference(rectify,[],[f5]) ).
fof(f12,plain,
( ! [X1] :
( ~ object(X1)
| ~ is_the(X1,sK2) )
& object(sK3)
& exemplifies_property(sK2,sK3)
& ! [X3] :
( sK3 = X3
| ~ exemplifies_property(sK2,X3)
| ~ object(X3) )
& property(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X2,sK3)],[f11]) ).
fof(f13,plain,
! [X1,X0,X2] :
( ( ( ( is_the(X2,X0)
& exemplifies_property(X1,X2) )
| ~ sP0(X0,X1) )
& ( sP0(X0,X1)
| ~ is_the(X2,X0)
| ~ exemplifies_property(X1,X2) ) )
| ~ sP1(X1,X0,X2) ),
inference(nnf_transformation,[],[f9]) ).
fof(f14,plain,
! [X1,X0,X2] :
( ( ( ( is_the(X2,X0)
& exemplifies_property(X1,X2) )
| ~ sP0(X0,X1) )
& ( sP0(X0,X1)
| ~ is_the(X2,X0)
| ~ exemplifies_property(X1,X2) ) )
| ~ sP1(X1,X0,X2) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( ( ( is_the(X2,X1)
& exemplifies_property(X0,X2) )
| ~ sP0(X1,X0) )
& ( sP0(X1,X0)
| ~ is_the(X2,X1)
| ~ exemplifies_property(X0,X2) ) )
| ~ sP1(X0,X1,X2) ),
inference(rectify,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ! [X3] :
( ~ object(X3)
| ~ exemplifies_property(X0,X3)
| ? [X4] :
( X3 != X4
& exemplifies_property(X0,X4)
& object(X4) )
| ~ exemplifies_property(X1,X3) ) )
& ( ? [X3] :
( object(X3)
& exemplifies_property(X0,X3)
& ! [X4] :
( X4 = X3
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X1,X3) )
| ~ sP0(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f17,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ! [X2] :
( ~ object(X2)
| ~ exemplifies_property(X0,X2)
| ? [X3] :
( X2 != X3
& exemplifies_property(X0,X3)
& object(X3) )
| ~ exemplifies_property(X1,X2) ) )
& ( ? [X4] :
( object(X4)
& exemplifies_property(X0,X4)
& ! [X5] :
( X4 = X5
| ~ exemplifies_property(X0,X5)
| ~ object(X5) )
& exemplifies_property(X1,X4) )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ! [X2] :
( ~ object(X2)
| ~ exemplifies_property(X0,X2)
| ( sK4(X0,X2) != X2
& exemplifies_property(X0,sK4(X0,X2))
& object(sK4(X0,X2)) )
| ~ exemplifies_property(X1,X2) ) )
& ( ( object(sK5(X0,X1))
& exemplifies_property(X0,sK5(X0,X1))
& ! [X5] :
( sK5(X0,X1) = X5
| ~ exemplifies_property(X0,X5)
| ~ object(X5) )
& exemplifies_property(X1,sK5(X0,X1)) )
| ~ sP0(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X3,sK4(X0,X2)),skolemize(X4,sK5(X0,X1))],[f17]) ).
fof(f19,plain,
property(sK2),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
! [X3] :
( ~ exemplifies_property(sK2,X3)
| sK3 = X3
| ~ object(X3) ),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
exemplifies_property(sK2,sK3),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
object(sK3),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
! [X1] :
( ~ is_the(X1,sK2)
| ~ object(X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ sP1(X0,X1,X2)
| ~ sP0(X1,X0)
| exemplifies_property(X0,X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ sP1(X0,X1,X2)
| ~ sP0(X1,X0)
| is_the(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
! [X2,X0,X1] :
( object(sK4(X0,X2))
| ~ object(X2)
| ~ exemplifies_property(X0,X2)
| sP0(X0,X1)
| ~ exemplifies_property(X1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X2,X0,X1] :
( exemplifies_property(X0,sK4(X0,X2))
| ~ object(X2)
| ~ exemplifies_property(X0,X2)
| sP0(X0,X1)
| ~ exemplifies_property(X1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
! [X2,X0,X1] :
( sK4(X0,X2) != X2
| ~ object(X2)
| ~ exemplifies_property(X0,X2)
| sP0(X0,X1)
| ~ exemplifies_property(X1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
! [X2,X0,X1] :
( sP1(X1,X0,X2)
| ~ property(X0)
| ~ property(X1)
| ~ object(X2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f54,plain,
! [X2,X0,X1] :
( is_the(X2,X0)
| ~ property(X1)
| ~ object(X2)
| ~ sP0(X0,X1)
| ~ property(X0) ),
inference(resolution,[],[f34,f26]) ).
fof(f55,plain,
! [X2,X0,X1] :
( exemplifies_property(X1,X2)
| ~ property(X1)
| ~ object(X2)
| ~ sP0(X0,X1)
| ~ property(X0) ),
inference(resolution,[],[f34,f25]) ).
fof(f56,plain,
! [X0,X1] :
( ~ property(X0)
| ~ object(X1)
| ~ sP0(sK2,X0)
| ~ property(sK2)
| ~ object(X1) ),
inference(resolution,[],[f54,f23]) ).
fof(f57,plain,
! [X0,X1] :
( ~ property(X0)
| ~ object(X1)
| ~ sP0(sK2,X0)
| ~ property(sK2) ),
inference(duplicate_literal_removal,[],[f56]) ).
fof(f58,plain,
! [X0,X1] :
( ~ sP0(sK2,X0)
| ~ object(X1)
| ~ property(X0) ),
inference(forward_subsumption_resolution,[],[f57,f19]) ).
fof(f78,plain,
! [X0,X1] :
( ~ object(X0)
| ~ exemplifies_property(sK2,X0)
| sP0(sK2,X1)
| ~ exemplifies_property(X1,X0)
| sK3 = sK4(sK2,X0)
| ~ object(sK4(sK2,X0)) ),
inference(resolution,[],[f32,f20]) ).
fof(f79,plain,
! [X0,X1] :
( sK3 = sK4(sK2,X0)
| ~ exemplifies_property(sK2,X0)
| sP0(sK2,X1)
| ~ exemplifies_property(X1,X0)
| ~ object(X0) ),
inference(forward_subsumption_resolution,[],[f78,f31]) ).
fof(f84,plain,
! [X0,X1] :
( ~ property(sK2)
| ~ object(X0)
| ~ sP0(X1,sK2)
| ~ property(X1)
| sK3 = X0
| ~ object(X0) ),
inference(resolution,[],[f55,f20]) ).
fof(f85,plain,
! [X0,X1] :
( ~ property(sK2)
| ~ object(X0)
| ~ sP0(X1,sK2)
| ~ property(X1)
| sK3 = X0 ),
inference(duplicate_literal_removal,[],[f84]) ).
fof(f86,plain,
! [X0,X1] :
( ~ sP0(X1,sK2)
| ~ object(X0)
| ~ property(X1)
| sK3 = X0 ),
inference(forward_subsumption_resolution,[],[f85,f19]) ).
fof(f87,plain,
! [X2,X0,X1] :
( sK3 != X0
| ~ object(X0)
| ~ exemplifies_property(sK2,X0)
| sP0(sK2,X1)
| ~ exemplifies_property(X1,X0)
| ~ exemplifies_property(sK2,X0)
| sP0(sK2,X2)
| ~ exemplifies_property(X2,X0)
| ~ object(X0) ),
inference(superposition,[],[f33,f79]) ).
fof(f88,plain,
! [X2,X0,X1] :
( sK3 != X0
| ~ object(X0)
| ~ exemplifies_property(sK2,X0)
| sP0(sK2,X1)
| ~ exemplifies_property(X1,X0)
| sP0(sK2,X2)
| ~ exemplifies_property(X2,X0) ),
inference(duplicate_literal_removal,[],[f87]) ).
fof(f89,plain,
! [X2,X0,X1] :
( sP0(sK2,X2)
| ~ exemplifies_property(sK2,X0)
| sP0(sK2,X1)
| ~ exemplifies_property(X1,X0)
| ~ object(X0)
| ~ exemplifies_property(X2,X0) ),
inference(forward_subsumption_resolution,[],[f88,f20]) ).
fof(f119,plain,
! [X2,X3,X0,X1] :
( sP0(sK2,X1)
| ~ exemplifies_property(sK2,X0)
| ~ exemplifies_property(X1,X0)
| ~ object(X0)
| ~ exemplifies_property(X2,X0)
| ~ object(X3)
| ~ property(X2) ),
inference(resolution,[],[f89,f58]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ exemplifies_property(sK2,X0)
| sP0(sK2,X1)
| ~ exemplifies_property(X1,X0)
| ~ object(X0)
| ~ exemplifies_property(sK2,X0)
| ~ object(X2)
| ~ property(sK2)
| sK3 = X2 ),
inference(resolution,[],[f89,f86]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ exemplifies_property(sK2,X0)
| sP0(sK2,X1)
| ~ exemplifies_property(X1,X0)
| ~ object(X0)
| ~ object(X2)
| ~ property(sK2)
| sK3 = X2 ),
inference(duplicate_literal_removal,[],[f120]) ).
fof(f128,plain,
! [X2,X0,X1] :
( sP0(sK2,X1)
| ~ exemplifies_property(sK2,X0)
| ~ exemplifies_property(X1,X0)
| ~ object(X0)
| ~ object(X2)
| sK3 = X2 ),
inference(forward_subsumption_resolution,[],[f125,f19]) ).
fof(f158,plain,
! [X2,X0,X1] :
( ~ exemplifies_property(sK2,X0)
| ~ exemplifies_property(sK2,X0)
| ~ object(X0)
| ~ object(X1)
| sK3 = X1
| ~ object(X2)
| ~ property(sK2)
| sK3 = X2 ),
inference(resolution,[],[f128,f86]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ exemplifies_property(sK2,X0)
| ~ object(X0)
| ~ object(X1)
| sK3 = X1
| ~ object(X2)
| ~ property(sK2)
| sK3 = X2 ),
inference(duplicate_literal_removal,[],[f158]) ).
fof(f165,plain,
! [X2,X0,X1] :
( ~ exemplifies_property(sK2,X0)
| ~ object(X0)
| ~ object(X1)
| sK3 = X1
| ~ object(X2)
| sK3 = X2 ),
inference(forward_subsumption_resolution,[],[f163,f19]) ).
fof(f174,plain,
! [X0,X1] :
( ~ object(sK3)
| ~ object(X0)
| sK3 = X0
| ~ object(X1)
| sK3 = X1 ),
inference(resolution,[],[f165,f21]) ).
fof(f188,plain,
! [X0,X1] :
( sK3 = X1
| sK3 = X0
| ~ object(X1)
| ~ object(X0) ),
inference(forward_subsumption_resolution,[],[f174,f22]) ).
fof(f196,plain,
! [X0] :
( sK3 != sK3
| sK3 = X0
| ~ object(X0)
| ~ object(X0) ),
inference(equality_factoring,[],[f188]) ).
fof(f197,plain,
! [X0] :
( sK3 != sK3
| sK3 = X0
| ~ object(X0) ),
inference(duplicate_literal_removal,[],[f196]) ).
fof(f198,plain,
! [X0] :
( sK3 = X0
| ~ object(X0) ),
inference(trivial_inequality_removal,[],[f197]) ).
fof(f199,plain,
! [X2,X3,X0,X1,X4] :
( ~ exemplifies_property(sK2,X0)
| ~ exemplifies_property(X1,X0)
| ~ object(X0)
| ~ exemplifies_property(X2,X0)
| ~ object(X3)
| ~ property(X2)
| ~ object(X4)
| ~ property(X1) ),
inference(resolution,[],[f119,f58]) ).
fof(f210,plain,
! [X0] :
( exemplifies_property(sK2,X0)
| ~ object(X0) ),
inference(superposition,[],[f21,f198]) ).
fof(f298,plain,
! [X2,X3,X0,X1,X4] :
( ~ exemplifies_property(X2,X0)
| ~ object(X0)
| ~ exemplifies_property(X1,X0)
| ~ object(X3)
| ~ property(X2)
| ~ object(X4)
| ~ property(X1) ),
inference(forward_subsumption_resolution,[],[f199,f210]) ).
fof(f299,plain,
! [X2,X0,X1] :
( ~ object(sK3)
| ~ exemplifies_property(X0,sK3)
| ~ object(X1)
| ~ property(sK2)
| ~ object(X2)
| ~ property(X0) ),
inference(resolution,[],[f298,f21]) ).
fof(f324,plain,
! [X2,X0,X1] :
( ~ exemplifies_property(X0,sK3)
| ~ object(X1)
| ~ property(sK2)
| ~ object(X2)
| ~ property(X0) ),
inference(forward_subsumption_resolution,[],[f299,f22]) ).
fof(f325,plain,
! [X2,X0,X1] :
( ~ exemplifies_property(X0,sK3)
| ~ object(X1)
| ~ object(X2)
| ~ property(X0) ),
inference(forward_subsumption_resolution,[],[f324,f19]) ).
fof(f326,plain,
! [X0,X1] :
( ~ object(X0)
| ~ object(X1)
| ~ property(sK2) ),
inference(resolution,[],[f325,f21]) ).
fof(f342,plain,
! [X0,X1] :
( ~ object(X1)
| ~ object(X0) ),
inference(forward_subsumption_resolution,[],[f326,f19]) ).
fof(f344,plain,
! [X0] : ~ object(X0),
inference(resolution,[],[f342,f22]) ).
fof(f348,plain,
$false,
inference(resolution,[],[f344,f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI009+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n026.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 : Sun Sep 27 22:09:41 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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.83/1.29 % (3262293)Detected formulas, will run a generic FOF schedule.
% 2.83/1.29 % (3262301)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1549870631:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.83/1.29 % (3262301)Refutation not found, incomplete strategy
% 2.83/1.29 % (3262301)------------------------------
% 2.83/1.29 % (3262301)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.83/1.29 % (3262301)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.83/1.29 % (3262301)CaDiCaL version: 2.1.3
% 2.83/1.29 % (3262301)Termination reason: Refutation not found, incomplete strategy
% 2.83/1.29 % (3262301)Time elapsed: 0.009 s
% 2.83/1.29 % (3262301)Peak memory usage: 88 MB
% 2.83/1.29 % (3262301)Instructions burned: 24 (million)
% 2.83/1.29 % (3262298)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=2364998617:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.83/1.29 % (3262300)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=3741501598:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.83/1.29 % (3262299)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=1217016765:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.83/1.29 % (3262304)dis-21_1_sil=8000:lcm=predicate:random_seed=156058801: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.83/1.29 % (3262302)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4086563077:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.83/1.29 % (3262302)First to succeed.
% 2.83/1.29 % (3262302)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3262293"
% 2.83/1.29 % (3262303)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1009776096:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.83/1.29 % (3262304)Also succeeded, but the first one will report.
% 2.83/1.29 % (3262303)Also succeeded, but the first one will report.
% 2.83/1.29 % (3262301)------------------------------
% 2.83/1.29 % (3262301)------------------------------
% 2.83/1.29 % (3262312)lrs+10_1_sil=8000:sp=occurrence:random_seed=1811037226:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.83/1.29 % (3262312)Also succeeded, but the first one will report.
% 2.83/1.29 % (3262302)Refutation found. Thanks to Tanya!
% 2.83/1.29 % SZS status Theorem for theBenchmark
% 2.83/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.48 % (3262302)------------------------------
% 3.65/1.48 % (3262302)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.48 % (3262302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.48 % (3262302)CaDiCaL version: 2.1.3
% 3.65/1.48 % (3262302)Termination reason: Refutation
% 3.65/1.48 % (3262302)Time elapsed: 0.009 s
% 3.65/1.48 % (3262302)Peak memory usage: 88 MB
% 3.65/1.48 % (3262302)Instructions burned: 12 (million)
% 3.65/1.48 % (3262302)------------------------------
% 3.65/1.48 % (3262302)------------------------------
% 3.65/1.48 % (3262293)Success in time 0.432 s
% 3.65/1.48 % Vampire exiting
%------------------------------------------------------------------------------