%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU234+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:55 PM UTC 2026
% Result : Theorem 3.56s 1.46s
% Output : Refutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 59 ( 7 unt; 2 def)
% Number of atoms : 194 ( 14 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 216 ( 81 ~; 87 |; 34 &)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 62 ( 0 sgn 55 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ( epsilon_transitive(X0)
& epsilon_connected(X0) )
=> ordinal(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_ordinal1) ).
fof(f8,axiom,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( in(X1,X0)
=> subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(f9,axiom,
! [X0] :
( epsilon_connected(X0)
<=> ! [X1,X2] :
~ ( in(X1,X0)
& in(X2,X0)
& ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_ordinal1) ).
fof(f31,axiom,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ~ ( ~ in(X0,X1)
& X0 != X1
& ~ in(X1,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_ordinal1) ).
fof(f33,conjecture,
! [X0] :
( ! [X1] :
( in(X1,X0)
=> ( ordinal(X1)
& subset(X1,X0) ) )
=> ordinal(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t31_ordinal1) ).
fof(f34,negated_conjecture,
~ ! [X0] :
( ! [X1] :
( in(X1,X0)
=> ( ordinal(X1)
& subset(X1,X0) ) )
=> ordinal(X0) ),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f57,plain,
! [X0] :
( ordinal(X0)
| ~ epsilon_transitive(X0)
| ~ epsilon_connected(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f58,plain,
! [X0] :
( ordinal(X0)
| ~ epsilon_transitive(X0)
| ~ epsilon_connected(X0) ),
inference(flattening,[],[f57]) ).
fof(f60,plain,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( subset(X1,X0)
| ~ in(X1,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f61,plain,
! [X0] :
( epsilon_connected(X0)
<=> ! [X1,X2] :
( ~ in(X1,X0)
| ~ in(X2,X0)
| in(X1,X2)
| X1 = X2
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f63,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| X0 = X1
| in(X1,X0)
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f64,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| X0 = X1
| in(X1,X0)
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(flattening,[],[f63]) ).
fof(f67,plain,
? [X0] :
( ~ ordinal(X0)
& ! [X1] :
( ( ordinal(X1)
& subset(X1,X0) )
| ~ in(X1,X0) ) ),
inference(ennf_transformation,[],[f34]) ).
fof(f74,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) ) )
& ( ! [X1] :
( subset(X1,X0)
| ~ in(X1,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(nnf_transformation,[],[f60]) ).
fof(f75,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) ) )
& ( ! [X2] :
( subset(X2,X0)
| ~ in(X2,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(rectify,[],[f74]) ).
fof(f76,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ( ~ subset(sK0(X0),X0)
& in(sK0(X0),X0) ) )
& ( ! [X2] :
( subset(X2,X0)
| ~ in(X2,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f75]) ).
fof(f77,plain,
! [X0] :
( ( epsilon_connected(X0)
| ? [X1,X2] :
( in(X1,X0)
& in(X2,X0)
& ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) )
& ( ! [X1,X2] :
( ~ in(X1,X0)
| ~ in(X2,X0)
| in(X1,X2)
| X1 = X2
| in(X2,X1) )
| ~ epsilon_connected(X0) ) ),
inference(nnf_transformation,[],[f61]) ).
fof(f78,plain,
! [X0] :
( ( epsilon_connected(X0)
| ? [X1,X2] :
( in(X1,X0)
& in(X2,X0)
& ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) )
& ( ! [X3,X4] :
( ~ in(X3,X0)
| ~ in(X4,X0)
| in(X3,X4)
| X3 = X4
| in(X4,X3) )
| ~ epsilon_connected(X0) ) ),
inference(rectify,[],[f77]) ).
fof(f79,plain,
! [X0] :
( ( epsilon_connected(X0)
| ( in(sK1(X0),X0)
& in(sK2(X0),X0)
& ~ in(sK1(X0),sK2(X0))
& sK1(X0) != sK2(X0)
& ~ in(sK2(X0),sK1(X0)) ) )
& ( ! [X3,X4] :
( ~ in(X3,X0)
| ~ in(X4,X0)
| in(X3,X4)
| X3 = X4
| in(X4,X3) )
| ~ epsilon_connected(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X1,sK1(X0)),skolemize(X2,sK2(X0))],[f78]) ).
fof(f96,plain,
( ~ ordinal(sK17)
& ! [X1] :
( ( ordinal(X1)
& subset(X1,sK17) )
| ~ in(X1,sK17) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17]),skolemize(X0,sK17)],[f67]) ).
fof(f105,plain,
! [X0] :
( ordinal(X0)
| ~ epsilon_transitive(X0)
| ~ epsilon_connected(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f110,plain,
! [X0] :
( epsilon_transitive(X0)
| in(sK0(X0),X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f111,plain,
! [X0] :
( epsilon_transitive(X0)
| ~ subset(sK0(X0),X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f113,plain,
! [X0] :
( ~ in(sK2(X0),sK1(X0))
| epsilon_connected(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f114,plain,
! [X0] :
( sK1(X0) != sK2(X0)
| epsilon_connected(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f115,plain,
! [X0] :
( ~ in(sK1(X0),sK2(X0))
| epsilon_connected(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f116,plain,
! [X0] :
( epsilon_connected(X0)
| in(sK2(X0),X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f117,plain,
! [X0] :
( epsilon_connected(X0)
| in(sK1(X0),X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f166,plain,
! [X0,X1] :
( in(X0,X1)
| X0 = X1
| in(X1,X0)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f168,plain,
! [X1] :
( subset(X1,sK17)
| ~ in(X1,sK17) ),
inference(cnf_transformation,[],[f96]) ).
fof(f169,plain,
! [X1] :
( ~ in(X1,sK17)
| ordinal(X1) ),
inference(cnf_transformation,[],[f96]) ).
fof(f170,plain,
~ ordinal(sK17),
inference(cnf_transformation,[],[f96]) ).
fof(f180,plain,
( ~ epsilon_transitive(sK17)
| ~ epsilon_connected(sK17) ),
inference(resolution,[],[f105,f170]) ).
fof(f182,definition,
( spl18_1
<=> epsilon_connected(sK17) ),
introduced(definition,[new_symbols(definition,[spl18_1])],[avatar_definition]) ).
fof(f184,plain,
( ~ epsilon_connected(sK17)
| spl18_1 ),
inference(avatar_component_clause,[],[f182]) ).
fof(f186,definition,
( spl18_2
<=> epsilon_transitive(sK17) ),
introduced(definition,[new_symbols(definition,[spl18_2])],[avatar_definition]) ).
fof(f188,plain,
( ~ epsilon_transitive(sK17)
| spl18_2 ),
inference(avatar_component_clause,[],[f186]) ).
fof(f189,plain,
( ~ spl18_1
| ~ spl18_2 ),
inference(avatar_split_clause,[],[f180,f186,f182]) ).
fof(f192,plain,
( in(sK2(sK17),sK17)
| spl18_1 ),
inference(resolution,[],[f116,f184]) ).
fof(f193,plain,
( ordinal(sK2(sK17))
| spl18_1 ),
inference(resolution,[],[f192,f169]) ).
fof(f196,plain,
( in(sK1(sK17),sK17)
| spl18_1 ),
inference(resolution,[],[f117,f184]) ).
fof(f197,plain,
( ordinal(sK1(sK17))
| spl18_1 ),
inference(resolution,[],[f196,f169]) ).
fof(f210,plain,
! [X0] :
( sK1(X0) = sK2(X0)
| in(sK1(X0),sK2(X0))
| ~ ordinal(sK1(X0))
| ~ ordinal(sK2(X0))
| epsilon_connected(X0) ),
inference(resolution,[],[f166,f113]) ).
fof(f213,plain,
! [X0] :
( in(sK1(X0),sK2(X0))
| ~ ordinal(sK1(X0))
| ~ ordinal(sK2(X0))
| epsilon_connected(X0) ),
inference(forward_subsumption_resolution,[],[f210,f114]) ).
fof(f216,plain,
! [X0] :
( epsilon_connected(X0)
| ~ ordinal(sK2(X0))
| ~ ordinal(sK1(X0)) ),
inference(forward_subsumption_resolution,[],[f213,f115]) ).
fof(f251,plain,
( ~ ordinal(sK2(sK17))
| ~ ordinal(sK1(sK17))
| spl18_1 ),
inference(resolution,[],[f216,f184]) ).
fof(f252,plain,
( ~ ordinal(sK1(sK17))
| spl18_1 ),
inference(forward_subsumption_resolution,[],[f251,f193]) ).
fof(f253,plain,
( $false
| spl18_1 ),
inference(forward_subsumption_resolution,[],[f252,f197]) ).
fof(f254,plain,
spl18_1,
inference(avatar_contradiction_clause,[],[f253]) ).
fof(f255,plain,
( ~ subset(sK0(sK17),sK17)
| spl18_2 ),
inference(resolution,[],[f188,f111]) ).
fof(f256,plain,
( in(sK0(sK17),sK17)
| spl18_2 ),
inference(resolution,[],[f188,f110]) ).
fof(f259,plain,
( ~ in(sK0(sK17),sK17)
| spl18_2 ),
inference(resolution,[],[f255,f168]) ).
fof(f272,plain,
( $false
| spl18_2 ),
inference(forward_subsumption_resolution,[],[f259,f256]) ).
fof(f273,plain,
spl18_2,
inference(avatar_contradiction_clause,[],[f272]) ).
cnf(s1,plain,
( ~ spl18_1
| ~ spl18_2 ),
inference(sat_conversion,[],[f189]) ).
cnf(s2,plain,
spl18_1,
inference(sat_conversion,[],[f254]) ).
cnf(s3,plain,
spl18_2,
inference(sat_conversion,[],[f273]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f274,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU234+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n005.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 04:14:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.56/1.46 % (426685)Detected formulas, will run a generic FOF schedule.
% 3.56/1.46 % (426693)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=38156604:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.56/1.46 % (426693)Refutation not found, incomplete strategy
% 3.56/1.46 % (426693)------------------------------
% 3.56/1.46 % (426693)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.46 % (426693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.46 % (426693)CaDiCaL version: 2.1.3
% 3.56/1.46 % (426693)Termination reason: Refutation not found, incomplete strategy
% 3.56/1.46 % (426693)Time elapsed: 0.0000 s
% 3.56/1.46 % (426693)Peak memory usage: 86 MB
% 3.56/1.46 % (426692)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=2796507362:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.56/1.46 % (426690)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=2743734538:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.56/1.46 % (426691)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=2514573085:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.56/1.46 % (426695)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3732678159:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.56/1.46 % (426696)dis-21_1_sil=8000:lcm=predicate:random_seed=2117388432: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.56/1.46 % (426694)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1398909623:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.56/1.46 % (426694)Refutation not found, incomplete strategy
% 3.56/1.46 % (426694)------------------------------
% 3.56/1.46 % (426694)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.46 % (426694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.46 % (426694)CaDiCaL version: 2.1.3
% 3.56/1.46 % (426694)Termination reason: Refutation not found, incomplete strategy
% 3.56/1.46 % (426694)Time elapsed: 0.002 s
% 3.56/1.46 % (426694)Peak memory usage: 88 MB
% 3.56/1.46 % (426694)Instructions burned: 1 (million)
% 3.56/1.46 % (426695)First to succeed.
% 3.56/1.46 % (426695)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-426685"
% 3.56/1.46 % (426696)Also succeeded, but the first one will report.
% 3.56/1.46 % (426693)------------------------------
% 3.56/1.46 % (426693)------------------------------
% 3.56/1.46 % (426704)lrs+10_1_sil=8000:sp=occurrence:random_seed=4005536776:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.56/1.46 % (426694)------------------------------
% 3.56/1.46 % (426694)------------------------------
% 3.56/1.46 % (426695)Refutation found. Thanks to Tanya!
% 3.56/1.46 % SZS status Theorem for theBenchmark
% 3.56/1.46 % SZS output start Proof for theBenchmark
% See solution above
% 3.56/1.46 % (426695)------------------------------
% 3.56/1.46 % (426695)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.46 % (426695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.46 % (426695)CaDiCaL version: 2.1.3
% 3.56/1.46 % (426695)Termination reason: Refutation
% 3.56/1.46 % (426695)Time elapsed: 0.006 s
% 3.56/1.46 % (426695)Peak memory usage: 89 MB
% 3.56/1.46 % (426695)Instructions burned: 7 (million)
% 3.56/1.46 % (426695)------------------------------
% 3.56/1.46 % (426695)------------------------------
% 3.56/1.46 % (426685)Success in time 0.422 s
% 3.56/1.46 % Vampire exiting
%------------------------------------------------------------------------------