%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC041+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 : n012.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:04:24 PM UTC 2026
% Result : Theorem 0.07s 0.35s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 110 ( 57 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 132 ( 44 ~; 38 |; 36 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 40 ( 24 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
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)
=> ( 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 ) ) ) ) )
| ( 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)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ! [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 ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ? [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) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ? [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) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f394,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil = X0
| nil != app(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f412,plain,
ssList(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
sK50 = app(sK49,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
nil != sK47,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
nil = sK48,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
nil = sK50,
inference(definition_unfolding,[],[f420,f419]) ).
fof(f477,plain,
! [X0,X1] :
( app(X0,X1) != sK50
| ~ ssList(X1)
| sK50 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f394,f424,f424]) ).
fof(f483,plain,
sK49 != sK50,
inference(definition_unfolding,[],[f417,f424,f418]) ).
fof(f766,plain,
( sK50 != sK50
| ~ ssList(sK51)
| sK49 = sK50
| ~ ssList(sK49) ),
inference(superposition,[],[f477,f414]) ).
fof(f769,plain,
( ~ ssList(sK51)
| sK49 = sK50
| ~ ssList(sK49) ),
inference(trivial_inequality_removal,[],[f766]) ).
fof(f770,plain,
( sK49 = sK50
| ~ ssList(sK49) ),
inference(forward_subsumption_resolution,[],[f769,f412]) ).
fof(f771,plain,
~ ssList(sK49),
inference(forward_subsumption_resolution,[],[f770,f483]) ).
fof(f772,plain,
$false,
inference(forward_subsumption_resolution,[],[f771,f421]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC041+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.30 % CPULimit : 300
% 0.05/0.30 % WCLimit : 300
% 0.05/0.30 % DateTime : Mon Sep 28 07:34:34 UTC 2026
% 0.05/0.30 % CPUTime :
% 0.05/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.32 Running first-order model finding
% 0.05/0.32 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.07/0.35 % (3216759)Will run a generic schedule for satisfiability detection.
% 0.07/0.35 % (3216765)% WARNING: option uhcvi not known.
% 0.07/0.35 % (3216764)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1600415856_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.35 % (3216765)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1715294551:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.35 % (3216766)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2851970065:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.35 % (3216767)dis+10_1_sil=32000:sp=arity:random_seed=3250674618:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.35 % (3216768)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2313972847:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.35 % (3216769)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2584714390:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.35 % (3216770)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1157749631:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.35 % (3216767) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3216759-3216767"...
% 0.07/0.35 % (3216765) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3216759-3216765"...
% 0.07/0.35 % (3216765)...printing done.
% 0.07/0.35 % (3216767)...printing done.
% 0.07/0.35 % (3216765)Refutation found. Thanks to Tanya!
% 0.07/0.35 % SZS status Theorem for theBenchmark
% 0.07/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.35 % (3216765)------------------------------
% 0.07/0.35 % (3216765)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.35 % (3216765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.35 % (3216765)CaDiCaL version: 2.1.3
% 0.07/0.35 % (3216765)Termination reason: Refutation
% 0.07/0.35 % (3216765)Time elapsed: 0.005 s
% 0.07/0.35 % (3216765)Peak memory usage: 12 MB
% 0.07/0.35 % (3216765)Instructions burned: 14 (million)
% 0.07/0.35 % (3216759)Success in time 0.029 s
% 0.07/0.35 % Vampire exiting
%------------------------------------------------------------------------------