%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR086+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 09:42:49 AM UTC 2026
% Result : Theorem 0.19s 1.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 99 ( 44 ~; 37 |; 12 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 44 ( 38 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0,X1] :
( s__subclass(X0,X1)
=> ( s__instance(X0,s__SetOrClass)
& s__instance(X1,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kb_SUMO_26) ).
fof(f27,axiom,
! [X0,X1,X2] :
( ( s__instance(X1,s__SetOrClass)
& s__instance(X0,s__SetOrClass) )
=> ( ( s__subclass(X0,X1)
& s__instance(X2,X0) )
=> s__instance(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kb_SUMO_27) ).
fof(f3587,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kb_SUMO_3600) ).
fof(f3590,axiom,
! [X0] :
( s__instance(X0,s__GraphArc)
=> ( s__instance(X0,s__GraphLoop)
<=> ? [X1] :
( s__instance(X1,s__GraphNode)
& s__links(X1,X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kb_SUMO_3603) ).
fof(f7218,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(f7219,conjecture,
? [X0] : s__links(X0,X0,s__Arc13_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(f7220,negated_conjecture,
~ ? [X0] : s__links(X0,X0,s__Arc13_1),
inference(negated_conjecture,[status(cth)],[f7219]) ).
fof(f7222,plain,
! [X0] : ~ s__links(X0,X0,s__Arc13_1),
inference(ennf_transformation,[],[f7220]) ).
fof(f7266,plain,
! [X0] :
( ( s__instance(X0,s__GraphLoop)
<=> ? [X1] :
( s__instance(X1,s__GraphNode)
& s__links(X1,X1,X0) ) )
| ~ s__instance(X0,s__GraphArc) ),
inference(ennf_transformation,[],[f3590]) ).
fof(f7270,plain,
! [X0,X1,X2] :
( s__instance(X2,X1)
| ~ s__subclass(X0,X1)
| ~ s__instance(X2,X0)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X0,s__SetOrClass) ),
inference(ennf_transformation,[],[f27]) ).
fof(f7271,plain,
! [X0,X1,X2] :
( s__instance(X2,X1)
| ~ s__subclass(X0,X1)
| ~ s__instance(X2,X0)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X0,s__SetOrClass) ),
inference(flattening,[],[f7270]) ).
fof(f7272,plain,
! [X0,X1] :
( ( s__instance(X0,s__SetOrClass)
& s__instance(X1,s__SetOrClass) )
| ~ s__subclass(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f7284,plain,
! [X0] :
( ( ( s__instance(X0,s__GraphLoop)
| ! [X1] :
( ~ s__instance(X1,s__GraphNode)
| ~ s__links(X1,X1,X0) ) )
& ( ? [X1] :
( s__instance(X1,s__GraphNode)
& s__links(X1,X1,X0) )
| ~ s__instance(X0,s__GraphLoop) ) )
| ~ s__instance(X0,s__GraphArc) ),
inference(nnf_transformation,[],[f7266]) ).
fof(f7285,plain,
! [X0] :
( ( ( s__instance(X0,s__GraphLoop)
| ! [X1] :
( ~ s__instance(X1,s__GraphNode)
| ~ s__links(X1,X1,X0) ) )
& ( ? [X2] :
( s__instance(X2,s__GraphNode)
& s__links(X2,X2,X0) )
| ~ s__instance(X0,s__GraphLoop) ) )
| ~ s__instance(X0,s__GraphArc) ),
inference(rectify,[],[f7284]) ).
fof(f7286,plain,
! [X0] :
( ( ( s__instance(X0,s__GraphLoop)
| ! [X1] :
( ~ s__instance(X1,s__GraphNode)
| ~ s__links(X1,X1,X0) ) )
& ( ( s__instance(sK11(X0),s__GraphNode)
& s__links(sK11(X0),sK11(X0),X0) )
| ~ s__instance(X0,s__GraphLoop) ) )
| ~ s__instance(X0,s__GraphArc) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X2,sK11(X0))],[f7285]) ).
fof(f7287,plain,
! [X0] : ~ s__links(X0,X0,s__Arc13_1),
inference(cnf_transformation,[],[f7222]) ).
fof(f7316,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(cnf_transformation,[],[f7218]) ).
fof(f7340,plain,
! [X0] :
( s__links(sK11(X0),sK11(X0),X0)
| ~ s__instance(X0,s__GraphLoop)
| ~ s__instance(X0,s__GraphArc) ),
inference(cnf_transformation,[],[f7286]) ).
fof(f7343,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(cnf_transformation,[],[f3587]) ).
fof(f7346,plain,
! [X2,X0,X1] :
( s__instance(X2,X1)
| ~ s__subclass(X0,X1)
| ~ s__instance(X2,X0)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X0,s__SetOrClass) ),
inference(cnf_transformation,[],[f7271]) ).
fof(f7347,plain,
! [X0,X1] :
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X0,X1) ),
inference(cnf_transformation,[],[f7272]) ).
fof(f7348,plain,
! [X0,X1] :
( s__instance(X0,s__SetOrClass)
| ~ s__subclass(X0,X1) ),
inference(cnf_transformation,[],[f7272]) ).
fof(f7373,plain,
( ~ s__instance(s__Arc13_1,s__GraphLoop)
| ~ s__instance(s__Arc13_1,s__GraphArc) ),
inference(resolution,[],[f7340,f7287]) ).
fof(f7374,plain,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(forward_subsumption_resolution,[],[f7373,f7316]) ).
fof(f7394,plain,
! [X2,X0,X1] :
( s__instance(X2,X1)
| ~ s__subclass(X0,X1)
| ~ s__instance(X2,X0)
| ~ s__instance(X0,s__SetOrClass) ),
inference(forward_subsumption_resolution,[],[f7346,f7347]) ).
fof(f7395,plain,
! [X2,X0,X1] :
( s__instance(X2,X1)
| ~ s__subclass(X0,X1)
| ~ s__instance(X2,X0) ),
inference(forward_subsumption_resolution,[],[f7394,f7348]) ).
fof(f7397,plain,
! [X0] :
( ~ s__subclass(X0,s__GraphArc)
| ~ s__instance(s__Arc13_1,X0) ),
inference(resolution,[],[f7395,f7374]) ).
fof(f7399,plain,
~ s__instance(s__Arc13_1,s__GraphLoop),
inference(resolution,[],[f7397,f7343]) ).
fof(f7400,plain,
$false,
inference(forward_subsumption_resolution,[],[f7399,f7316]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR086+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.25 % Computer : n017.cluster.edu
% 0.08/0.25 % Model : x86_64 x86_64
% 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.25 % Memory : 8046.5625MB
% 0.08/0.25 % OS : Linux 6.8.0-71-generic
% 0.08/0.25 % CPULimit : 300
% 0.08/0.25 % WCLimit : 300
% 0.08/0.25 % DateTime : Mon Sep 28 22:32:29 UTC 2026
% 0.08/0.25 % CPUTime :
% 0.08/0.25 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.28 Running first-order theorem proving
% 0.18/0.28 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/1.40 % (4111137)Detected formulas, will run a generic FOF schedule.
% 0.19/1.40 % (4111146)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2185496686:i=119:av=off:ss=axioms_2997 on theBenchmark for (2997ds/119Mi)
% 0.19/1.40 % (4111146)First to succeed.
% 0.19/1.40 % (4111146)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4111137"
% 0.19/1.40 % (4111142)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=3887603979:i=141193_2997 on theBenchmark for (2997ds/141193Mi)
% 0.19/1.40 % (4111145)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2702026582:i=109:sd=1:ins=1:gsp=on:ss=axioms_2997 on theBenchmark for (2997ds/109Mi)
% 0.19/1.40 % (4111144)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=563090478:i=141695:sd=1:nm=32:gsp=on:ss=included_2997 on theBenchmark for (2997ds/141695Mi)
% 0.19/1.40 % (4111147)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1342493:s2a=on:i=139:gtg=position_2997 on theBenchmark for (2997ds/139Mi)
% 0.19/1.40 % (4111143)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=413168825:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2997 on theBenchmark for (2997ds/134677Mi)
% 0.19/1.40 % (4111148)dis-21_1_sil=8000:lcm=predicate:random_seed=2660819679:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2997 on theBenchmark for (2997ds/129Mi)
% 0.19/1.40 % (4111145)Refutation not found, incomplete strategy
% 0.19/1.40 % (4111145)------------------------------
% 0.19/1.40 % (4111145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.40 % (4111145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.40 % (4111145)CaDiCaL version: 2.1.3
% 0.19/1.40 % (4111145)Termination reason: Refutation not found, incomplete strategy
% 0.19/1.40 % (4111145)Time elapsed: 0.023 s
% 0.19/1.40 % (4111145)Peak memory usage: 94 MB
% 0.19/1.40 % (4111145)Instructions burned: 39 (million)
% 0.19/1.40 % (4111147)Instruction limit reached!
% 0.19/1.40 % (4111147)------------------------------
% 0.19/1.40 % (4111147)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.40 % (4111147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.40 % (4111147)CaDiCaL version: 2.1.3
% 0.19/1.40 % (4111147)Termination reason: Instruction limit
% 0.19/1.40 % (4111147)Termination phase: Preprocessing 3
% 0.19/1.40 % (4111147)Time elapsed: 0.082 s
% 0.19/1.40 % (4111147)Peak memory usage: 94 MB
% 0.19/1.40 % (4111147)Instructions burned: 141 (million)
% 0.19/1.40 % (4111148)Instruction limit reached!
% 0.19/1.40 % (4111148)------------------------------
% 0.19/1.40 % (4111148)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.40 % (4111148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.40 % (4111148)CaDiCaL version: 2.1.3
% 0.19/1.40 % (4111148)Termination reason: Instruction limit
% 0.19/1.40 % (4111148)Termination phase: Saturation
% 0.19/1.40 % (4111148)Time elapsed: 0.074 s
% 0.19/1.40 % (4111148)Peak memory usage: 95 MB
% 0.19/1.40 % (4111148)Instructions burned: 130 (million)
% 0.19/1.40 % (4111146)Refutation found. Thanks to Tanya!
% 0.19/1.41 % SZS status Theorem for theBenchmark
% 0.19/1.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/1.41 % (4111146)------------------------------
% 0.19/1.41 % (4111146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.41 % (4111146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.41 % (4111146)CaDiCaL version: 2.1.3
% 0.19/1.41 % (4111146)Termination reason: Refutation
% 0.19/1.41 % (4111146)Time elapsed: 0.015 s
% 0.19/1.41 % (4111146)Peak memory usage: 95 MB
% 0.19/1.41 % (4111146)Instructions burned: 44 (million)
% 0.19/1.41 % (4111146)------------------------------
% 0.19/1.41 % (4111146)------------------------------
% 0.19/1.41 % (4111137)Success in time 0.483 s
% 0.19/1.41 % Vampire exiting
%------------------------------------------------------------------------------