%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC037+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:08 PM UTC 2026
% Result : Theorem 3.35s 1.22s
% Output : Refutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 137 ( 55 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 150 ( 49 ~; 44 |; 40 &)
% ( 4 <=>; 13 =>; 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 : 35 ( 25 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ? [X4] :
( neq(X4,nil)
& segmentP(X3,X4)
& segmentP(X2,X4)
& ssList(X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ? [X4] :
( neq(X4,nil)
& segmentP(X3,X4)
& segmentP(X2,X4)
& ssList(X4) )
| ( nil = X3
& nil = X2 ) )
& 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(f102,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f130,plain,
( nil = sK1
& sK1 = sK3
& sK0 = sK2
& nil != sK0
& ( ( neq(sK4,nil)
& segmentP(sK3,sK4)
& segmentP(sK2,sK4)
& ssList(sK4) )
| ( nil = sK3
& nil = sK2 ) )
& 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(f131,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f133,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f145,plain,
( ssList(sK4)
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f149,plain,
( segmentP(sK3,sK4)
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f151,plain,
( neq(sK4,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f153,plain,
nil != sK0,
inference(cnf_transformation,[],[f130]) ).
fof(f154,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f155,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f156,plain,
nil = sK1,
inference(cnf_transformation,[],[f130]) ).
fof(f157,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f162,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f195,plain,
nil = sK3,
inference(definition_unfolding,[],[f156,f155]) ).
fof(f196,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f153,f195,f154]) ).
fof(f198,plain,
( neq(sK4,sK3)
| sK2 = sK3 ),
inference(definition_unfolding,[],[f151,f195,f195]) ).
fof(f200,plain,
( segmentP(sK3,sK4)
| sK2 = sK3 ),
inference(definition_unfolding,[],[f149,f195]) ).
fof(f204,plain,
( ssList(sK4)
| sK2 = sK3 ),
inference(definition_unfolding,[],[f145,f195]) ).
fof(f209,plain,
! [X0] :
( ~ segmentP(sK3,X0)
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f162,f195,f195]) ).
fof(f221,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f157]) ).
fof(f229,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f221]) ).
fof(f230,plain,
ssList(sK4),
inference(forward_subsumption_resolution,[],[f204,f196]) ).
fof(f231,plain,
neq(sK4,sK3),
inference(forward_subsumption_resolution,[],[f198,f196]) ).
fof(f232,plain,
segmentP(sK3,sK4),
inference(forward_subsumption_resolution,[],[f200,f196]) ).
fof(f234,plain,
( sK3 = sK4
| ~ ssList(sK4) ),
inference(resolution,[],[f209,f232]) ).
fof(f237,plain,
sK3 = sK4,
inference(forward_subsumption_resolution,[],[f234,f230]) ).
fof(f244,plain,
neq(sK4,sK4),
inference(superposition,[],[f231,f237]) ).
fof(f290,plain,
~ ssList(sK4),
inference(resolution,[],[f229,f244]) ).
fof(f291,plain,
$false,
inference(forward_subsumption_resolution,[],[f290,f230]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC037+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 07:32:45 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 3.35/1.22 % (3228289)Detected formulas, will run a generic FOF schedule.
% 3.35/1.22 % (3228298)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1706513894:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.35/1.22 % (3228300)dis-21_1_sil=8000:lcm=predicate:random_seed=2033274419: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.35/1.22 % (3228296)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=2418937731:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.35/1.22 % (3228299)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1273656348:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.35/1.22 % (3228294)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=266255062:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.35/1.22 % (3228295)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=1007852230:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.35/1.22 % (3228297)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1098139657:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.35/1.22 % (3228298)First to succeed.
% 3.35/1.22 % (3228297)Also succeeded, but the first one will report.
% 3.35/1.22 % (3228298)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3228289"
% 3.35/1.22 % (3228299)Also succeeded, but the first one will report.
% 3.35/1.22 % (3228300)Instruction limit reached!
% 3.35/1.22 % (3228300)------------------------------
% 3.35/1.22 % (3228300)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.22 % (3228300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.22 % (3228300)CaDiCaL version: 2.1.3
% 3.35/1.22 % (3228300)Termination reason: Instruction limit
% 3.35/1.22 % (3228300)Termination phase: Saturation
% 3.35/1.22 % (3228300)Time elapsed: 0.070 s
% 3.35/1.22 % (3228300)Peak memory usage: 89 MB
% 3.35/1.22 % (3228300)Instructions burned: 129 (million)
% 3.35/1.22 % (3228308)lrs+10_1_sil=8000:sp=occurrence:random_seed=1758718152:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.35/1.22 % (3228308)Also succeeded, but the first one will report.
% 3.35/1.22 % (3228298)Refutation found. Thanks to Tanya!
% 3.35/1.22 % SZS status Theorem for theBenchmark
% 3.35/1.22 % SZS output start Proof for theBenchmark
% See solution above
% 3.35/1.22 % (3228298)------------------------------
% 3.35/1.22 % (3228298)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.22 % (3228298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.22 % (3228298)CaDiCaL version: 2.1.3
% 3.35/1.22 % (3228298)Termination reason: Refutation
% 3.35/1.22 % (3228298)Time elapsed: 0.004 s
% 3.35/1.22 % (3228298)Peak memory usage: 88 MB
% 3.35/1.22 % (3228298)Instructions burned: 5 (million)
% 3.35/1.22 % (3228298)------------------------------
% 3.35/1.22 % (3228298)------------------------------
% 3.35/1.22 % (3228289)Success in time 0.415 s
% 3.35/1.22 % Vampire exiting
%------------------------------------------------------------------------------