%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC016+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 01:02:03 PM UTC 2026
% Result : Theorem 3.40s 1.36s
% Output : Refutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 40 ( 9 unt; 0 def)
% Number of atoms : 185 ( 57 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 231 ( 86 ~; 79 |; 52 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 37 ( 25 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ frontsegP(X3,X4)
| ~ frontsegP(X2,X4) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X1,X5)
& frontsegP(X0,X5) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ frontsegP(X3,X4)
| ~ frontsegP(X2,X4) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X1,X5)
& frontsegP(X0,X5) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( neq(X4,nil)
& frontsegP(X3,X4)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X1,X5)
| ~ frontsegP(X0,X5) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( neq(X4,nil)
& frontsegP(X3,X4)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X1,X5)
| ~ frontsegP(X0,X5) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f131,plain,
( sK1 = sK3
& sK0 = sK2
& ( nil = sK2
| nil != sK3 )
& ( ( neq(sK4,nil)
& frontsegP(sK3,sK4)
& frontsegP(sK2,sK4)
& ssList(sK4) )
| ~ neq(sK3,nil) )
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(sK1,X5)
| ~ frontsegP(sK0,X5) ) ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f99]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f146,plain,
ssList(sK2),
inference(cnf_transformation,[],[f131]) ).
fof(f149,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f131]) ).
fof(f150,plain,
! [X5] :
( nil = sK1
| ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(sK1,X5)
| ~ frontsegP(sK0,X5) ),
inference(cnf_transformation,[],[f131]) ).
fof(f151,plain,
( nil = sK1
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f131]) ).
fof(f152,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f131]) ).
fof(f153,plain,
( frontsegP(sK2,sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f131]) ).
fof(f154,plain,
( frontsegP(sK3,sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f131]) ).
fof(f155,plain,
( neq(sK4,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f131]) ).
fof(f156,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f131]) ).
fof(f157,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f131]) ).
fof(f158,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f131]) ).
fof(f159,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f199,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f151,f158,f158]) ).
fof(f200,plain,
! [X5] :
( ~ frontsegP(sK3,X5)
| ~ ssList(X5)
| ~ neq(X5,nil)
| nil = sK3
| ~ frontsegP(sK2,X5) ),
inference(definition_unfolding,[],[f150,f158,f158,f157]) ).
fof(f201,plain,
( nil != sK2
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f149,f157,f158]) ).
fof(f205,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f159]) ).
fof(f215,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f205]) ).
fof(f216,plain,
( nil = sK3
| ssList(sK4) ),
inference(resolution,[],[f199,f152]) ).
fof(f223,plain,
( ~ ssList(sK4)
| ~ neq(sK4,nil)
| nil = sK3
| ~ frontsegP(sK2,sK4)
| ~ neq(sK3,nil) ),
inference(resolution,[],[f200,f154]) ).
fof(f224,plain,
( ~ neq(sK4,nil)
| nil = sK3
| ~ frontsegP(sK2,sK4)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f223,f216]) ).
fof(f225,plain,
( ~ frontsegP(sK2,sK4)
| nil = sK3
| ~ neq(sK4,nil) ),
inference(forward_subsumption_resolution,[],[f224,f199]) ).
fof(f248,plain,
( nil = sK3
| ~ neq(sK4,nil)
| ~ neq(sK3,nil) ),
inference(resolution,[],[f225,f153]) ).
fof(f249,plain,
( ~ neq(sK4,nil)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f248,f199]) ).
fof(f250,plain,
( nil = sK3
| ~ neq(sK3,nil) ),
inference(resolution,[],[f249,f155]) ).
fof(f251,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f250,f199]) ).
fof(f258,plain,
( sK3 != sK3
| sK2 = sK3 ),
inference(superposition,[],[f156,f251]) ).
fof(f261,plain,
( sK2 != sK3
| neq(sK3,sK3) ),
inference(superposition,[],[f201,f251]) ).
fof(f264,plain,
sK2 = sK3,
inference(trivial_inequality_removal,[],[f258]) ).
fof(f287,plain,
neq(sK3,sK3),
inference(forward_subsumption_resolution,[],[f261,f264]) ).
fof(f288,plain,
neq(sK2,sK2),
inference(forward_demodulation,[],[f287,f264]) ).
fof(f290,plain,
~ ssList(sK2),
inference(resolution,[],[f288,f215]) ).
fof(f292,plain,
$false,
inference(forward_subsumption_resolution,[],[f290,f146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC016+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 07:26:31 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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
% 3.40/1.36 % (3225205)Detected formulas, will run a generic FOF schedule.
% 3.40/1.36 % (3225211)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=852170458:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.40/1.36 % (3225215)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=551843546:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.40/1.36 % (3225210)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=654275798:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.40/1.36 % (3225212)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=1267149967:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.40/1.36 % (3225214)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1169040889:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.40/1.36 % (3225213)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1192172016:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.40/1.36 % (3225216)dis-21_1_sil=8000:lcm=predicate:random_seed=1462264114: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.40/1.36 % (3225214)First to succeed.
% 3.40/1.36 % (3225213)Also succeeded, but the first one will report.
% 3.40/1.36 % (3225215)Also succeeded, but the first one will report.
% 3.40/1.36 % (3225214)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3225205"
% 3.40/1.36 % (3225216)Also succeeded, but the first one will report.
% 3.40/1.36 % (3225214)Refutation found. Thanks to Tanya!
% 3.40/1.36 % SZS status Theorem for theBenchmark
% 3.40/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 3.40/1.36 % (3225214)------------------------------
% 3.40/1.36 % (3225214)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.36 % (3225214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.36 % (3225214)CaDiCaL version: 2.1.3
% 3.40/1.36 % (3225214)Termination reason: Refutation
% 3.40/1.36 % (3225214)Time elapsed: 0.004 s
% 3.40/1.36 % (3225214)Peak memory usage: 88 MB
% 3.40/1.36 % (3225214)Instructions burned: 5 (million)
% 3.40/1.36 % (3225214)------------------------------
% 3.40/1.36 % (3225214)------------------------------
% 3.40/1.36 % (3225205)Success in time 0.415 s
% 3.40/1.36 % Vampire exiting
%------------------------------------------------------------------------------