%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC028+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 : n002.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:06 PM UTC 2026
% Result : Theorem 3.47s 1.48s
% Output : Refutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 146 ( 77 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 170 ( 60 ~; 56 |; 39 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 31 ( 23 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax52) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
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 != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,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] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f130,plain,
( sK1 = sK3
& sK0 = sK2
& ( ( nil = sK1
& nil != sK0 )
| ( nil = sK0
& nil != sK1 ) )
& ( ( nil = sK3
& nil = sK2 )
| ( neq(sK2,nil)
& rearsegP(sK3,sK2) ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[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] :
( ( ( rearsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ rearsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f143,plain,
ssList(sK2),
inference(cnf_transformation,[],[f130]) ).
fof(f145,plain,
( rearsegP(sK3,sK2)
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f148,plain,
( neq(sK2,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f149,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f130]) ).
fof(f152,plain,
( nil = sK1
| nil = sK0 ),
inference(cnf_transformation,[],[f130]) ).
fof(f153,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f154,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f155,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f160,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f192,plain,
( nil = sK3
| nil = sK2 ),
inference(definition_unfolding,[],[f152,f154,f153]) ).
fof(f195,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f149,f153,f154]) ).
fof(f198,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f155]) ).
fof(f206,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f198]) ).
fof(f208,plain,
( sK2 != sK3
| nil = sK2 ),
inference(equality_factoring,[],[f192]) ).
fof(f223,plain,
! [X0] :
( ~ rearsegP(sK3,X0)
| sK3 = X0
| ~ ssList(X0)
| nil = sK2 ),
inference(superposition,[],[f160,f192]) ).
fof(f227,plain,
( sK2 = sK3
| ~ ssList(sK2)
| nil = sK2
| nil = sK2 ),
inference(resolution,[],[f223,f145]) ).
fof(f233,plain,
( sK2 = sK3
| ~ ssList(sK2)
| nil = sK2 ),
inference(duplicate_literal_removal,[],[f227]) ).
fof(f234,plain,
( ~ ssList(sK2)
| nil = sK2 ),
inference(forward_subsumption_resolution,[],[f233,f208]) ).
fof(f236,plain,
nil = sK2,
inference(forward_subsumption_resolution,[],[f234,f143]) ).
fof(f246,plain,
( neq(sK2,sK2)
| sK2 = sK3 ),
inference(superposition,[],[f148,f236]) ).
fof(f252,plain,
( sK2 != sK3
| sK2 != sK2 ),
inference(superposition,[],[f195,f236]) ).
fof(f253,plain,
sK2 != sK3,
inference(trivial_inequality_removal,[],[f252]) ).
fof(f257,plain,
neq(sK2,sK2),
inference(forward_subsumption_resolution,[],[f246,f253]) ).
fof(f259,plain,
~ ssList(sK2),
inference(resolution,[],[f257,f206]) ).
fof(f261,plain,
$false,
inference(forward_subsumption_resolution,[],[f259,f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC028+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.10/0.38 % Computer : n002.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 07:33:07 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.47/1.48 % (185021)Detected formulas, will run a generic FOF schedule.
% 3.47/1.48 % (185028)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=1648162703:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.47/1.48 % (185032)dis-21_1_sil=8000:lcm=predicate:random_seed=1773380100: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.47/1.48 % (185031)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4292037566:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.47/1.48 % (185030)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3439578745:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.47/1.48 % (185026)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=804360586:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.47/1.48 % (185029)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2503829135:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.47/1.48 % (185027)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=4110793744:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.47/1.48 % (185029)Also succeeded, but the first one will report.
% 3.47/1.48 % (185030)First to succeed.
% 3.47/1.48 % (185030)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-185021"
% 3.47/1.48 % (185031)Also succeeded, but the first one will report.
% 3.47/1.48 % (185032)Instruction limit reached!
% 3.47/1.48 % (185032)------------------------------
% 3.47/1.48 % (185032)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.48 % (185032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.48 % (185032)CaDiCaL version: 2.1.3
% 3.47/1.48 % (185032)Termination reason: Instruction limit
% 3.47/1.48 % (185032)Termination phase: Saturation
% 3.47/1.48 % (185032)Time elapsed: 0.077 s
% 3.47/1.48 % (185032)Peak memory usage: 90 MB
% 3.47/1.48 % (185032)Instructions burned: 130 (million)
% 3.47/1.48 % (185040)lrs+10_1_sil=8000:sp=occurrence:random_seed=2422870315:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.47/1.48 % (185040)Also succeeded, but the first one will report.
% 3.47/1.48 % (185030)Refutation found. Thanks to Tanya!
% 3.47/1.48 % SZS status Theorem for theBenchmark
% 3.47/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 3.47/1.48 % (185030)------------------------------
% 3.47/1.48 % (185030)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.48 % (185030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.48 % (185030)CaDiCaL version: 2.1.3
% 3.47/1.48 % (185030)Termination reason: Refutation
% 3.47/1.48 % (185030)Time elapsed: 0.004 s
% 3.47/1.48 % (185030)Peak memory usage: 88 MB
% 3.47/1.48 % (185030)Instructions burned: 5 (million)
% 3.47/1.48 % (185030)------------------------------
% 3.47/1.48 % (185030)------------------------------
% 3.47/1.48 % (185021)Success in time 0.41 s
% 3.47/1.48 % Vampire exiting
%------------------------------------------------------------------------------