%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC054+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 : n014.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:13 PM UTC 2026
% Result : Theorem 3.64s 1.49s
% Output : Refutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of formulae : 39 ( 9 unt; 0 def)
% Number of atoms : 165 ( 51 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 209 ( 83 ~; 77 |; 39 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 31 ( 24 !; 7 ?)
% 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)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X1,X5)
& segmentP(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)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X1,X5)
& segmentP(X0,X5) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X3,X4)
& segmentP(X2,X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X1,X5)
| ~ segmentP(X0,X5) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f129,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& ( nil = sK2
| nil != sK3 )
& ( ( ssList(sK4)
& neq(sK4,nil)
& segmentP(sK3,sK4)
& segmentP(sK2,sK4) )
| ~ neq(sK3,nil) )
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(sK1,X5)
| ~ segmentP(sK0,X5) ) ) )
& 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)],[f98]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f142,plain,
ssList(sK2),
inference(cnf_transformation,[],[f129]) ).
fof(f144,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f145,plain,
! [X5] :
( nil = sK1
| ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(sK1,X5)
| ~ segmentP(sK0,X5) ),
inference(cnf_transformation,[],[f129]) ).
fof(f146,plain,
( nil = sK1
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f147,plain,
( segmentP(sK2,sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f148,plain,
( segmentP(sK3,sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f149,plain,
( neq(sK4,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f150,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f129]) ).
fof(f151,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f129]) ).
fof(f152,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f129]) ).
fof(f153,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f129]) ).
fof(f155,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f193,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f146,f153,f153]) ).
fof(f194,plain,
! [X5] :
( ~ segmentP(sK3,X5)
| ~ ssList(X5)
| ~ neq(X5,nil)
| nil = sK3
| ~ segmentP(sK2,X5) ),
inference(definition_unfolding,[],[f145,f153,f153,f152]) ).
fof(f195,plain,
( nil != sK2
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f144,f152,f153]) ).
fof(f199,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f155]) ).
fof(f207,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f199]) ).
fof(f208,plain,
( nil = sK3
| ssList(sK4) ),
inference(resolution,[],[f193,f150]) ).
fof(f215,plain,
( ~ ssList(sK4)
| ~ neq(sK4,nil)
| nil = sK3
| ~ segmentP(sK2,sK4)
| ~ neq(sK3,nil) ),
inference(resolution,[],[f194,f148]) ).
fof(f216,plain,
( ~ neq(sK4,nil)
| nil = sK3
| ~ segmentP(sK2,sK4)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f215,f208]) ).
fof(f217,plain,
( ~ segmentP(sK2,sK4)
| nil = sK3
| ~ neq(sK4,nil) ),
inference(forward_subsumption_resolution,[],[f216,f193]) ).
fof(f240,plain,
( nil = sK3
| ~ neq(sK4,nil)
| ~ neq(sK3,nil) ),
inference(resolution,[],[f217,f147]) ).
fof(f241,plain,
( ~ neq(sK4,nil)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f240,f193]) ).
fof(f242,plain,
( nil = sK3
| ~ neq(sK3,nil) ),
inference(resolution,[],[f241,f149]) ).
fof(f243,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f242,f193]) ).
fof(f250,plain,
( sK3 != sK3
| sK2 = sK3 ),
inference(superposition,[],[f151,f243]) ).
fof(f253,plain,
( sK2 != sK3
| neq(sK3,sK3) ),
inference(superposition,[],[f195,f243]) ).
fof(f256,plain,
sK2 = sK3,
inference(trivial_inequality_removal,[],[f250]) ).
fof(f279,plain,
neq(sK3,sK3),
inference(forward_subsumption_resolution,[],[f253,f256]) ).
fof(f280,plain,
neq(sK2,sK2),
inference(forward_demodulation,[],[f279,f256]) ).
fof(f282,plain,
~ ssList(sK2),
inference(resolution,[],[f280,f207]) ).
fof(f284,plain,
$false,
inference(forward_subsumption_resolution,[],[f282,f142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC054+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.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 07:38:01 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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.64/1.49 % (1611975)Detected formulas, will run a generic FOF schedule.
% 3.64/1.49 % (1611980)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=1945576633:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.64/1.49 % (1611981)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=13984048:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.64/1.49 % (1611986)dis-21_1_sil=8000:lcm=predicate:random_seed=3725969760: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.64/1.49 % (1611982)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=761187987:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.64/1.49 % (1611983)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1271132451:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.64/1.49 % (1611984)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1336450863:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.64/1.49 % (1611984)First to succeed.
% 3.64/1.49 % (1611983)Also succeeded, but the first one will report.
% 3.64/1.49 % (1611984)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1611975"
% 3.64/1.49 % (1611986)Also succeeded, but the first one will report.
% 3.64/1.49 % (1611985)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2480988206:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.64/1.49 % (1611985)Also succeeded, but the first one will report.
% 3.64/1.49 % (1611984)Refutation found. Thanks to Tanya!
% 3.64/1.49 % SZS status Theorem for theBenchmark
% 3.64/1.49 % SZS output start Proof for theBenchmark
% See solution above
% 3.64/1.49 % (1611984)------------------------------
% 3.64/1.49 % (1611984)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.64/1.49 % (1611984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.64/1.49 % (1611984)CaDiCaL version: 2.1.3
% 3.64/1.49 % (1611984)Termination reason: Refutation
% 3.64/1.49 % (1611984)Time elapsed: 0.005 s
% 3.64/1.49 % (1611984)Peak memory usage: 88 MB
% 3.64/1.49 % (1611984)Instructions burned: 5 (million)
% 3.64/1.49 % (1611984)------------------------------
% 3.64/1.49 % (1611984)------------------------------
% 3.64/1.49 % (1611975)Success in time 0.447 s
% 3.64/1.49 % Vampire exiting
%------------------------------------------------------------------------------