%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC252+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 : n016.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:03:08 PM UTC 2026
% Result : Theorem 3.58s 1.17s
% Output : Refutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 219 ( 64 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 280 ( 109 ~; 101 |; 55 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 74 ( 56 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) ) )
| ( ! [X8] :
( ssItem(X8)
=> ( cons(X8,nil) != X2
| ~ memberP(X3,X8) ) )
& ( 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)
=> ( X1 != X3
| X0 != X2
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) ) )
| ( ! [X8] :
( ssItem(X8)
=> ( cons(X8,nil) != X2
| ~ memberP(X3,X8) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& lt(X4,X7)
& ~ leq(X4,X7)
& ssItem(X7) ) ) ) )
& ( ? [X8] :
( cons(X8,nil) = X2
& memberP(X3,X8)
& ssItem(X8) )
| ( nil = X3
& nil = 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 != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& lt(X4,X7)
& ~ leq(X4,X7)
& ssItem(X7) ) ) ) )
& ( ? [X8] :
( cons(X8,nil) = X2
& memberP(X3,X8)
& ssItem(X8) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f107,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f115,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f118,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f137,plain,
( sK1 = sK3
& sK0 = sK2
& nil != sK0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| ( memberP(X5,sK4(X4,X5,X6))
& memberP(X6,sK4(X4,X5,X6))
& lt(X4,sK4(X4,X5,X6))
& ~ leq(X4,sK4(X4,X5,X6))
& ssItem(sK4(X4,X5,X6)) ) ) ) )
& ( ( sK2 = cons(sK5,nil)
& memberP(sK3,sK5)
& ssItem(sK5) )
| ( nil = sK3
& nil = sK2 ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X7,sK4(X4,X5,X6)),skolemize(X8,sK5)],[f99]) ).
fof(f153,plain,
ssList(sK2),
inference(cnf_transformation,[],[f137]) ).
fof(f155,plain,
( ssItem(sK5)
| nil = sK2 ),
inference(cnf_transformation,[],[f137]) ).
fof(f159,plain,
( sK2 = cons(sK5,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f137]) ).
fof(f161,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| ssItem(sK4(X4,X5,X6)) ),
inference(cnf_transformation,[],[f137]) ).
fof(f165,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| memberP(X5,sK4(X4,X5,X6)) ),
inference(cnf_transformation,[],[f137]) ).
fof(f166,plain,
nil != sK0,
inference(cnf_transformation,[],[f137]) ).
fof(f167,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f137]) ).
fof(f180,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f188,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f191,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f192,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f214,plain,
nil != sK2,
inference(definition_unfolding,[],[f166,f167]) ).
fof(f215,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| memberP(X5,sK4(X4,X5,X6)) ),
inference(definition_unfolding,[],[f165,f167]) ).
fof(f219,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| ssItem(sK4(X4,X5,X6)) ),
inference(definition_unfolding,[],[f161,f167]) ).
fof(f230,plain,
ssItem(sK5),
inference(forward_subsumption_resolution,[],[f155,f214]) ).
fof(f232,plain,
sK2 = cons(sK5,nil),
inference(forward_subsumption_resolution,[],[f159,f214]) ).
fof(f233,plain,
! [X0,X1] :
( sK2 != app(app(X0,sK2),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK5)
| ssItem(sK4(sK5,X0,X1)) ),
inference(superposition,[],[f219,f232]) ).
fof(f234,plain,
! [X0,X1] :
( sK2 != app(app(X0,sK2),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssItem(sK4(sK5,X0,X1)) ),
inference(forward_subsumption_resolution,[],[f233,f230]) ).
fof(f235,plain,
! [X0,X1] :
( sK2 != app(app(X0,sK2),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK5)
| memberP(X0,sK4(sK5,X0,X1)) ),
inference(superposition,[],[f215,f232]) ).
fof(f236,plain,
! [X0,X1] :
( sK2 != app(app(X0,sK2),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X0,sK4(sK5,X0,X1)) ),
inference(forward_subsumption_resolution,[],[f235,f230]) ).
fof(f271,plain,
! [X0] :
( sK2 != app(sK2,X0)
| ~ ssList(nil)
| ~ ssList(X0)
| memberP(nil,sK4(sK5,nil,X0))
| ~ ssList(sK2) ),
inference(superposition,[],[f236,f188]) ).
fof(f272,plain,
! [X0] :
( sK2 != app(sK2,X0)
| ~ ssList(nil)
| ~ ssList(X0)
| ssItem(sK4(sK5,nil,X0))
| ~ ssList(sK2) ),
inference(superposition,[],[f234,f188]) ).
fof(f273,plain,
! [X0] :
( sK2 != app(sK2,X0)
| ~ ssList(X0)
| ssItem(sK4(sK5,nil,X0))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f272,f191]) ).
fof(f274,plain,
! [X0] :
( sK2 != app(sK2,X0)
| ~ ssList(X0)
| memberP(nil,sK4(sK5,nil,X0))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f271,f191]) ).
fof(f283,plain,
! [X0] :
( sK2 != app(sK2,X0)
| ~ ssList(X0)
| ssItem(sK4(sK5,nil,X0)) ),
inference(forward_subsumption_resolution,[],[f273,f153]) ).
fof(f284,plain,
! [X0] :
( sK2 != app(sK2,X0)
| ~ ssList(X0)
| memberP(nil,sK4(sK5,nil,X0)) ),
inference(forward_subsumption_resolution,[],[f274,f153]) ).
fof(f288,plain,
( sK2 != sK2
| ~ ssList(nil)
| ssItem(sK4(sK5,nil,nil))
| ~ ssList(sK2) ),
inference(superposition,[],[f283,f180]) ).
fof(f289,plain,
( ~ ssList(nil)
| ssItem(sK4(sK5,nil,nil))
| ~ ssList(sK2) ),
inference(trivial_inequality_removal,[],[f288]) ).
fof(f290,plain,
( ssItem(sK4(sK5,nil,nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f289,f191]) ).
fof(f291,plain,
ssItem(sK4(sK5,nil,nil)),
inference(forward_subsumption_resolution,[],[f290,f153]) ).
fof(f292,plain,
( sK2 != sK2
| ~ ssList(nil)
| memberP(nil,sK4(sK5,nil,nil))
| ~ ssList(sK2) ),
inference(superposition,[],[f284,f180]) ).
fof(f293,plain,
( ~ ssList(nil)
| memberP(nil,sK4(sK5,nil,nil))
| ~ ssList(sK2) ),
inference(trivial_inequality_removal,[],[f292]) ).
fof(f294,plain,
( memberP(nil,sK4(sK5,nil,nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f293,f191]) ).
fof(f295,plain,
memberP(nil,sK4(sK5,nil,nil)),
inference(forward_subsumption_resolution,[],[f294,f153]) ).
fof(f296,plain,
~ ssItem(sK4(sK5,nil,nil)),
inference(resolution,[],[f295,f192]) ).
fof(f297,plain,
$false,
inference(forward_subsumption_resolution,[],[f296,f291]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC252+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.06/0.18 % Computer : n016.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Mon Sep 28 08:46:33 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.20 Running first-order theorem proving
% 0.06/0.21 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.58/1.17 % (3484778)Detected formulas, will run a generic FOF schedule.
% 3.58/1.17 % (3484785)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=2448453207:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.58/1.17 % (3484787)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3297502955:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.58/1.17 % (3484789)dis-21_1_sil=8000:lcm=predicate:random_seed=2193820522: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.58/1.17 % (3484783)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=4220226679:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.58/1.17 % (3484784)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=1870908695:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.58/1.17 % (3484786)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3980997903:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.58/1.17 % (3484788)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2294063891:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.58/1.17 % (3484787)First to succeed.
% 3.58/1.17 % (3484787)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3484778"
% 3.58/1.17 % (3484788)Also succeeded, but the first one will report.
% 3.58/1.17 % (3484786)Instruction limit reached!
% 3.58/1.17 % (3484786)------------------------------
% 3.58/1.17 % (3484786)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.17 % (3484786)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.17 % (3484786)CaDiCaL version: 2.1.3
% 3.58/1.17 % (3484786)Termination reason: Instruction limit
% 3.58/1.17 % (3484786)Termination phase: Saturation
% 3.58/1.17 % (3484786)Time elapsed: 0.071 s
% 3.58/1.17 % (3484786)Peak memory usage: 89 MB
% 3.58/1.17 % (3484786)Instructions burned: 109 (million)
% 3.58/1.17 % (3484789)Instruction limit reached!
% 3.58/1.17 % (3484789)------------------------------
% 3.58/1.17 % (3484789)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.17 % (3484789)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.17 % (3484789)CaDiCaL version: 2.1.3
% 3.58/1.17 % (3484789)Termination reason: Instruction limit
% 3.58/1.17 % (3484789)Termination phase: Saturation
% 3.58/1.17 % (3484789)Time elapsed: 0.072 s
% 3.58/1.17 % (3484789)Peak memory usage: 91 MB
% 3.58/1.17 % (3484789)Instructions burned: 130 (million)
% 3.58/1.17 % (3484798)lrs+10_1_sil=32000:urr=on:br=off:random_seed=328461372:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.58/1.17 % (3484797)lrs+10_1_sil=8000:sp=occurrence:random_seed=343960128:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.58/1.17 % (3484797)Also succeeded, but the first one will report.
% 3.58/1.17 % (3484787)Refutation found. Thanks to Tanya!
% 3.58/1.17 % SZS status Theorem for theBenchmark
% 3.58/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 3.58/1.17 % (3484787)------------------------------
% 3.58/1.17 % (3484787)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.17 % (3484787)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.17 % (3484787)CaDiCaL version: 2.1.3
% 3.58/1.17 % (3484787)Termination reason: Refutation
% 3.58/1.17 % (3484787)Time elapsed: 0.005 s
% 3.58/1.17 % (3484787)Peak memory usage: 88 MB
% 3.58/1.17 % (3484787)Instructions burned: 7 (million)
% 3.58/1.17 % (3484787)------------------------------
% 3.58/1.17 % (3484787)------------------------------
% 3.58/1.17 % (3484778)Success in time 0.437 s
% 3.58/1.17 % Vampire exiting
%------------------------------------------------------------------------------