%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC398+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:05:52 PM UTC 2026
% Result : Theorem 0.21s 0.30s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 126 ( 31 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 152 ( 52 ~; 47 |; 36 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 51 ( 33 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ equalelemsP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssList(X7)
& app(X7,cons(X5,nil)) = X2 ) ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X0,X8)
| memberP(X1,X8) ) )
| ( nil != X3
& nil = 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
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ equalelemsP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssList(X7)
& app(X7,cons(X5,nil)) = X2 ) ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X0,X8)
| memberP(X1,X8) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 ) ) )
& ssList(X4) )
& ? [X8] :
( memberP(X0,X8)
& ~ memberP(X1,X8)
& ssItem(X8) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 ) ) )
& ssList(X4) )
& ? [X8] :
( memberP(X0,X8)
& ~ memberP(X1,X8)
& ssItem(X8) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f332,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,X0)
| memberP(app(X1,X2),X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f412,plain,
ssList(sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
sK50 = app(sK49,sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
ssItem(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
~ memberP(sK48,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
memberP(sK47,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
memberP(sK49,sK51),
inference(definition_unfolding,[],[f417,f420]) ).
fof(f428,plain,
~ memberP(sK50,sK51),
inference(definition_unfolding,[],[f416,f421]) ).
fof(f484,plain,
! [X2,X0,X1] :
( ~ memberP(app(X1,X2),X0)
| ~ ssList(X1)
| ~ ssList(X2)
| memberP(X1,X0)
| ~ ssItem(X0) ),
inference(consistent_polarity_flipping,[],[f332]) ).
fof(f512,plain,
~ memberP(sK49,sK51),
inference(consistent_polarity_flipping,[],[f427]) ).
fof(f513,plain,
memberP(sK50,sK51),
inference(consistent_polarity_flipping,[],[f428]) ).
fof(f1295,plain,
! [X0] :
( ~ memberP(sK50,X0)
| ~ ssList(sK49)
| ~ ssList(sK52)
| memberP(sK49,X0)
| ~ ssItem(X0) ),
inference(superposition,[],[f484,f414]) ).
fof(f1300,plain,
! [X0] :
( ~ memberP(sK50,X0)
| ~ ssList(sK52)
| memberP(sK49,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f1295,f422]) ).
fof(f1301,plain,
! [X0] :
( ~ memberP(sK50,X0)
| memberP(sK49,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f1300,f412]) ).
fof(f2815,plain,
( memberP(sK49,sK51)
| ~ ssItem(sK51) ),
inference(resolution,[],[f1301,f513]) ).
fof(f2819,plain,
~ ssItem(sK51),
inference(forward_subsumption_resolution,[],[f2815,f512]) ).
fof(f2820,plain,
$false,
inference(forward_subsumption_resolution,[],[f2819,f415]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC398+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n011.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 09:27:30 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.30 % (3270905)Will run a generic schedule for satisfiability detection.
% 0.21/0.30 % (3270911)% WARNING: option uhcvi not known.
% 0.21/0.30 % (3270911)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1320226102:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.30 % (3270912)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2804810268:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.30 % (3270910)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2885591579_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.30 % (3270914)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2621061575:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.30 % (3270913)dis+10_1_sil=32000:sp=arity:random_seed=3897066232:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.30 % (3270915)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1515636489:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.30 % (3270916)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2892280470:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.30 % TRYING [1]
% 0.21/0.30 % TRYING [2]
% 0.21/0.30 % TRYING [3]
% 0.21/0.30 % (3270911) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3270905-3270911"...
% 0.21/0.30 % (3270911)...printing done.
% 0.21/0.30 % (3270911)Refutation found. Thanks to Tanya!
% 0.21/0.30 % SZS status Theorem for theBenchmark
% 0.21/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.30 % (3270911)------------------------------
% 0.21/0.30 % (3270911)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (3270911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (3270911)CaDiCaL version: 2.1.3
% 0.21/0.30 % (3270911)Termination reason: Refutation
% 0.21/0.30 % (3270911)Time elapsed: 0.030 s
% 0.21/0.30 % (3270911)Peak memory usage: 13 MB
% 0.21/0.30 % (3270911)Instructions burned: 81 (million)
% 0.21/0.30 % (3270905)Success in time 0.067 s
% 0.21/0.30 % Vampire exiting
%------------------------------------------------------------------------------