%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR086+2 : 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 2.90s 1.04s
% Output : Refutation 2.90s
% 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(f37982,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(f37983,conjecture,
? [X0] : s__links(X0,X0,s__Arc13_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(f37984,negated_conjecture,
~ ? [X0] : s__links(X0,X0,s__Arc13_1),
inference(negated_conjecture,[status(cth)],[f37983]) ).
fof(f37985,plain,
! [X0] : ~ s__links(X0,X0,s__Arc13_1),
inference(ennf_transformation,[],[f37984]) ).
fof(f38037,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(f38041,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(f38042,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,[],[f38041]) ).
fof(f38043,plain,
! [X0,X1] :
( ( s__instance(X0,s__SetOrClass)
& s__instance(X1,s__SetOrClass) )
| ~ s__subclass(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f38089,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,[],[f38037]) ).
fof(f38090,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,[],[f38089]) ).
fof(f38091,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))],[f38090]) ).
fof(f38094,plain,
! [X0] : ~ s__links(X0,X0,s__Arc13_1),
inference(cnf_transformation,[],[f37985]) ).
fof(f38123,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(cnf_transformation,[],[f37982]) ).
fof(f38161,plain,
! [X0] :
( s__links(sK11(X0),sK11(X0),X0)
| ~ s__instance(X0,s__GraphLoop)
| ~ s__instance(X0,s__GraphArc) ),
inference(cnf_transformation,[],[f38091]) ).
fof(f38164,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(cnf_transformation,[],[f4773]) ).
fof(f38173,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,[],[f38042]) ).
fof(f38174,plain,
! [X0,X1] :
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X0,X1) ),
inference(cnf_transformation,[],[f38043]) ).
fof(f38175,plain,
! [X0,X1] :
( s__instance(X0,s__SetOrClass)
| ~ s__subclass(X0,X1) ),
inference(cnf_transformation,[],[f38043]) ).
fof(f38403,plain,
( ~ s__instance(s__Arc13_1,s__GraphLoop)
| ~ s__instance(s__Arc13_1,s__GraphArc) ),
inference(resolution,[],[f38161,f38094]) ).
fof(f38404,plain,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(forward_subsumption_resolution,[],[f38403,f38123]) ).
fof(f38591,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,[],[f38173,f38174]) ).
fof(f38592,plain,
! [X2,X0,X1] :
( s__instance(X2,X1)
| ~ s__subclass(X0,X1)
| ~ s__instance(X2,X0) ),
inference(forward_subsumption_resolution,[],[f38591,f38175]) ).
fof(f38594,plain,
! [X0] :
( ~ s__subclass(X0,s__GraphArc)
| ~ s__instance(s__Arc13_1,X0) ),
inference(resolution,[],[f38592,f38404]) ).
fof(f38596,plain,
~ s__instance(s__Arc13_1,s__GraphLoop),
inference(resolution,[],[f38594,f38164]) ).
fof(f38597,plain,
$false,
inference(forward_subsumption_resolution,[],[f38596,f38123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : CSR086+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Mon Sep 28 22:34:34 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.12 Running first-order theorem proving
% 0.09/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
% 2.90/1.04 % (3872063)Detected formulas, will run a generic FOF schedule.
% 2.90/1.04 % (3872073)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=848804434:s2a=on:i=139:gtg=position_2997 on theBenchmark for (2997ds/139Mi)
% 2.90/1.04 % (3872074)dis-21_1_sil=8000:lcm=predicate:random_seed=1515526806: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)
% 2.90/1.04 % (3872072)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1054462810:i=119:av=off:ss=axioms_2997 on theBenchmark for (2997ds/119Mi)
% 2.90/1.04 % (3872070)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=3532531958:i=141695:sd=1:nm=32:gsp=on:ss=included_2997 on theBenchmark for (2997ds/141695Mi)
% 2.90/1.04 % (3872068)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=890845960:i=141193_2997 on theBenchmark for (2997ds/141193Mi)
% 2.90/1.04 % (3872071)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4282524107:i=109:sd=1:ins=1:gsp=on:ss=axioms_2997 on theBenchmark for (2997ds/109Mi)
% 2.90/1.04 % (3872069)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=2945339816:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2997 on theBenchmark for (2997ds/134677Mi)
% 2.90/1.04 % (3872073)Instruction limit reached!
% 2.90/1.04 % (3872073)------------------------------
% 2.90/1.04 % (3872073)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.04 % (3872073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.04 % (3872073)CaDiCaL version: 2.1.3
% 2.90/1.04 % (3872073)Termination reason: Instruction limit
% 2.90/1.04 % (3872073)Termination phase: Property scanning
% 2.90/1.04 % (3872073)Time elapsed: 0.033 s
% 2.90/1.04 % (3872073)Peak memory usage: 104 MB
% 2.90/1.04 % (3872073)Instructions burned: 144 (million)
% 2.90/1.04 % (3872071)Refutation not found, incomplete strategy
% 2.90/1.04 % (3872071)------------------------------
% 2.90/1.04 % (3872071)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.04 % (3872071)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.04 % (3872071)CaDiCaL version: 2.1.3
% 2.90/1.04 % (3872071)Termination reason: Refutation not found, incomplete strategy
% 2.90/1.04 % (3872071)Time elapsed: 0.034 s
% 2.90/1.04 % (3872071)Peak memory usage: 108 MB
% 2.90/1.04 % (3872071)Instructions burned: 99 (million)
% 2.90/1.04 % (3872072)First to succeed.
% 2.90/1.04 % (3872072)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3872063"
% 2.90/1.04 % (3872074)Instruction limit reached!
% 2.90/1.04 % (3872074)------------------------------
% 2.90/1.04 % (3872074)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.04 % (3872074)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.04 % (3872074)CaDiCaL version: 2.1.3
% 2.90/1.04 % (3872074)Termination reason: Instruction limit
% 2.90/1.04 % (3872074)Termination phase: Naming
% 2.90/1.04 % (3872074)Time elapsed: 0.043 s
% 2.90/1.04 % (3872074)Peak memory usage: 106 MB
% 2.90/1.04 % (3872074)Instructions burned: 129 (million)
% 2.90/1.04 % (3872082)lrs+10_1_sil=8000:sp=occurrence:random_seed=3323033436:i=285:sd=3:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/285Mi)
% 2.90/1.04 % (3872083)lrs+10_1_sil=32000:urr=on:br=off:random_seed=573200724:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 2.90/1.04 % (3872071)------------------------------
% 2.90/1.04 % (3872071)------------------------------
% 2.90/1.04 % (3872082)Also succeeded, but the first one will report.
% 2.90/1.04 % (3872072)Refutation found. Thanks to Tanya!
% 2.90/1.04 % SZS status Theorem for theBenchmark
% 2.90/1.04 % SZS output start Proof for theBenchmark
% See solution above
% 2.90/1.04 % (3872072)------------------------------
% 2.90/1.04 % (3872072)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.04 % (3872072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.04 % (3872072)CaDiCaL version: 2.1.3
% 2.90/1.04 % (3872072)Termination reason: Refutation
% 2.90/1.04 % (3872072)Time elapsed: 0.040 s
% 2.90/1.04 % (3872072)Peak memory usage: 109 MB
% 2.90/1.04 % (3872072)Instructions burned: 116 (million)
% 2.90/1.04 % (3872072)------------------------------
% 2.90/1.04 % (3872072)------------------------------
% 2.90/1.04 % (3872063)Success in time 0.613 s
% 2.90/1.04 % Vampire exiting
%------------------------------------------------------------------------------