%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR086+5 : 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 : n012.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.08s 0.90s
% Output : Refutation 0.08s
% 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(f4773,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kb_SUMO_4786) ).
fof(f4776,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_4789) ).
fof(f16749,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(f16750,conjecture,
? [X0] : s__links(X0,X0,s__Arc13_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(f16751,negated_conjecture,
~ ? [X0] : s__links(X0,X0,s__Arc13_1),
inference(negated_conjecture,[status(cth)],[f16750]) ).
fof(f16765,plain,
! [X0] : ~ s__links(X0,X0,s__Arc13_1),
inference(ennf_transformation,[],[f16751]) ).
fof(f16809,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,[],[f4776]) ).
fof(f16813,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(f16814,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,[],[f16813]) ).
fof(f16815,plain,
! [X0,X1] :
( ( s__instance(X0,s__SetOrClass)
& s__instance(X1,s__SetOrClass) )
| ~ s__subclass(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f16869,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,[],[f16809]) ).
fof(f16870,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,[],[f16869]) ).
fof(f16871,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))],[f16870]) ).
fof(f16874,plain,
! [X0] : ~ s__links(X0,X0,s__Arc13_1),
inference(cnf_transformation,[],[f16765]) ).
fof(f16903,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(cnf_transformation,[],[f16749]) ).
fof(f16927,plain,
! [X0] :
( s__links(sK11(X0),sK11(X0),X0)
| ~ s__instance(X0,s__GraphLoop)
| ~ s__instance(X0,s__GraphArc) ),
inference(cnf_transformation,[],[f16871]) ).
fof(f16930,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(cnf_transformation,[],[f4773]) ).
fof(f16933,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,[],[f16814]) ).
fof(f16934,plain,
! [X0,X1] :
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X0,X1) ),
inference(cnf_transformation,[],[f16815]) ).
fof(f16935,plain,
! [X0,X1] :
( s__instance(X0,s__SetOrClass)
| ~ s__subclass(X0,X1) ),
inference(cnf_transformation,[],[f16815]) ).
fof(f17014,plain,
( ~ s__instance(s__Arc13_1,s__GraphLoop)
| ~ s__instance(s__Arc13_1,s__GraphArc) ),
inference(resolution,[],[f16927,f16874]) ).
fof(f17015,plain,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(forward_subsumption_resolution,[],[f17014,f16903]) ).
fof(f17051,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,[],[f16933,f16934]) ).
fof(f17052,plain,
! [X2,X0,X1] :
( s__instance(X2,X1)
| ~ s__subclass(X0,X1)
| ~ s__instance(X2,X0) ),
inference(forward_subsumption_resolution,[],[f17051,f16935]) ).
fof(f17054,plain,
! [X0] :
( ~ s__subclass(X0,s__GraphArc)
| ~ s__instance(s__Arc13_1,X0) ),
inference(resolution,[],[f17052,f17015]) ).
fof(f17056,plain,
~ s__instance(s__Arc13_1,s__GraphLoop),
inference(resolution,[],[f17054,f16930]) ).
fof(f17057,plain,
$false,
inference(forward_subsumption_resolution,[],[f17056,f16903]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : CSR086+5 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 22:34:49 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.12 Running first-order theorem proving
% 0.08/0.12 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.08/0.90 % (3872504)Detected formulas, will run a generic FOF schedule.
% 0.08/0.90 % (3872511)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=3355693153:i=141695:sd=1:nm=32:gsp=on:ss=included_2998 on theBenchmark for (2998ds/141695Mi)
% 0.08/0.90 % (3872512)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=143210514:i=109:sd=1:ins=1:gsp=on:ss=axioms_2998 on theBenchmark for (2998ds/109Mi)
% 0.08/0.90 % (3872510)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=670196995:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2998 on theBenchmark for (2998ds/134677Mi)
% 0.08/0.90 % (3872509)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=1683793692:i=141193_2998 on theBenchmark for (2998ds/141193Mi)
% 0.08/0.90 % (3872514)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1539665437:s2a=on:i=139:gtg=position_2998 on theBenchmark for (2998ds/139Mi)
% 0.08/0.90 % (3872513)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1313019563:i=119:av=off:ss=axioms_2998 on theBenchmark for (2998ds/119Mi)
% 0.08/0.90 % (3872515)dis-21_1_sil=8000:lcm=predicate:random_seed=562180090:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2998 on theBenchmark for (2998ds/129Mi)
% 0.08/0.90 % (3872512)Refutation not found, incomplete strategy
% 0.08/0.90 % (3872512)------------------------------
% 0.08/0.90 % (3872512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.08/0.90 % (3872512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.90 % (3872512)CaDiCaL version: 2.1.3
% 0.08/0.90 % (3872512)Termination reason: Refutation not found, incomplete strategy
% 0.08/0.90 % (3872512)Time elapsed: 0.026 s
% 0.08/0.90 % (3872512)Peak memory usage: 102 MB
% 0.08/0.90 % (3872512)Instructions burned: 61 (million)
% 0.08/0.90 % (3872513)First to succeed.
% 0.08/0.90 % (3872513)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3872504"
% 0.08/0.90 % (3872514)Instruction limit reached!
% 0.08/0.90 % (3872514)------------------------------
% 0.08/0.90 % (3872514)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.08/0.90 % (3872514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.90 % (3872514)CaDiCaL version: 2.1.3
% 0.08/0.90 % (3872514)Termination reason: Instruction limit
% 0.08/0.90 % (3872514)Termination phase: SInE selection
% 0.08/0.90 % (3872514)Time elapsed: 0.043 s
% 0.08/0.90 % (3872514)Peak memory usage: 99 MB
% 0.08/0.90 % (3872514)Instructions burned: 139 (million)
% 0.08/0.90 % (3872515)Also succeeded, but the first one will report.
% 0.08/0.90 % (3872523)lrs+10_1_sil=8000:sp=occurrence:random_seed=330988642:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 0.08/0.90 % (3872512)------------------------------
% 0.08/0.90 % (3872512)------------------------------
% 0.08/0.90 % (3872523)Also succeeded, but the first one will report.
% 0.08/0.90 % (3872513)Refutation found. Thanks to Tanya!
% 0.08/0.90 % SZS status Theorem for theBenchmark
% 0.08/0.90 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.90 % (3872513)------------------------------
% 0.08/0.90 % (3872513)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.08/0.90 % (3872513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.90 % (3872513)CaDiCaL version: 2.1.3
% 0.08/0.90 % (3872513)Termination reason: Refutation
% 0.08/0.90 % (3872513)Time elapsed: 0.027 s
% 0.08/0.90 % (3872513)Peak memory usage: 103 MB
% 0.08/0.90 % (3872513)Instructions burned: 70 (million)
% 0.08/0.90 % (3872513)------------------------------
% 0.08/0.90 % (3872513)------------------------------
% 0.08/0.90 % (3872504)Success in time 0.484 s
% 0.08/0.90 % Vampire exiting
%------------------------------------------------------------------------------