%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC408+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 : n014.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:55 PM UTC 2026
% Result : Theorem 0.57s 0.31s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 87 ( 15 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 84 ( 23 ~; 28 |; 18 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 25 !; 10 ?)
% 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)
=> ( app(X3,X3) != X2
| X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X1,X4)
| memberP(X0,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X3) != X2
| X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X1,X4)
| memberP(X0,X4) ) ) ) ) ) ) ),
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] :
( app(X3,X3) = X2
& X1 = X3
& X0 = X2
& ? [X4] :
( memberP(X1,X4)
& ~ memberP(X0,X4)
& ssItem(X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( app(X3,X3) = X2
& X1 = X3
& X0 = X2
& ? [X4] :
( memberP(X1,X4)
& ~ memberP(X0,X4)
& ssItem(X4) )
& 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(f411,plain,
ssItem(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
~ memberP(sK47,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
memberP(sK48,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK49 = app(sK50,sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
ssList(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK50),
inference(definition_unfolding,[],[f419,f416]) ).
fof(f423,plain,
memberP(sK50,sK51),
inference(definition_unfolding,[],[f413,f416]) ).
fof(f424,plain,
~ memberP(sK49,sK51),
inference(definition_unfolding,[],[f412,f415]) ).
fof(f556,plain,
! [X2,X0,X1] :
( ~ memberP(X1,X0)
| ssList(X1)
| ssList(X2)
| ssItem(X0)
| memberP(app(X1,X2),X0) ),
inference(consistent_polarity_flipping,[],[f332]) ).
fof(f634,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f422]) ).
fof(f637,plain,
~ ssItem(sK51),
inference(consistent_polarity_flipping,[],[f411]) ).
fof(f1451,plain,
! [X0] :
( ssList(sK50)
| ssList(X0)
| ssItem(sK51)
| memberP(app(sK50,X0),sK51) ),
inference(resolution,[],[f556,f423]) ).
fof(f1455,plain,
! [X0] :
( ssList(X0)
| ssItem(sK51)
| memberP(app(sK50,X0),sK51) ),
inference(forward_subsumption_resolution,[],[f1451,f634]) ).
fof(f1456,plain,
! [X0] :
( memberP(app(sK50,X0),sK51)
| ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1455,f637]) ).
fof(f3012,plain,
( memberP(sK49,sK51)
| ssList(sK50) ),
inference(superposition,[],[f1456,f417]) ).
fof(f3015,plain,
ssList(sK50),
inference(forward_subsumption_resolution,[],[f3012,f424]) ).
fof(f3022,plain,
$false,
inference(forward_subsumption_resolution,[],[f3015,f634]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC408+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n014.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:31:16 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 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.57/0.30 % (1659304)Will run a generic schedule for satisfiability detection.
% 0.57/0.30 % (1659311)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2155913843:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.57/0.30 % (1659310)% WARNING: option uhcvi not known.
% 0.57/0.30 % (1659310)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4124440413:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.57/0.30 % (1659309)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3867388973_2999 on theBenchmark for (2999ds/0Mi)
% 0.57/0.30 % (1659313)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2863324569:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.57/0.30 % (1659314)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=647701077:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.57/0.30 % (1659315)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2864824311:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.57/0.30 % TRYING [1]
% 0.57/0.30 % TRYING [2]
% 0.57/0.31 % TRYING [3]
% 0.57/0.31 % (1659312)dis+10_1_sil=32000:sp=arity:random_seed=2981641715:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.57/0.31 % TRYING [4]
% 0.57/0.31 % (1659310) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1659304-1659310"...
% 0.57/0.31 % (1659310)...printing done.
% 0.57/0.31 % (1659310)Refutation found. Thanks to Tanya!
% 0.57/0.31 % SZS status Theorem for theBenchmark
% 0.57/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.31 % (1659310)------------------------------
% 0.57/0.31 % (1659310)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.57/0.31 % (1659310)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.57/0.31 % (1659310)CaDiCaL version: 2.1.3
% 0.57/0.31 % (1659310)Termination reason: Refutation
% 0.57/0.31 % (1659310)Time elapsed: 0.053 s
% 0.57/0.31 % (1659310)Peak memory usage: 13 MB
% 0.57/0.31 % (1659310)Instructions burned: 88 (million)
% 0.57/0.31 % (1659304)Success in time 0.099 s
% 0.57/0.31 % Vampire exiting
%------------------------------------------------------------------------------