%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC407+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 : n017.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.92s 0.42s
% Output : Refutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 76 ( 17 unt; 6 def)
% Number of atoms : 235 ( 43 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 265 ( 106 ~; 109 |; 26 &)
% ( 8 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 28 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,X4) ) )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X2
| ~ memberP(X3,X5) ) )
& ( 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] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,X4) ) )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X2
| ~ memberP(X3,X5) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& ( ? [X5] :
( cons(X5,nil) = X2
& memberP(X3,X5)
& ssItem(X5) )
| ( 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] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& ( ? [X5] :
( cons(X5,nil) = X2
& memberP(X3,X5)
& ssItem(X5) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f333,plain,
! [X2,X0,X1] :
( ~ memberP(cons(X1,X2),X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| memberP(X2,X0)
| X0 = X1
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f336,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f411,plain,
( nil = sK50
| ssItem(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( nil = sK50
| memberP(sK50,sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( nil = sK50
| sK49 = cons(sK52,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( nil = sK49
| ssItem(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( nil = sK49
| memberP(sK50,sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssItem(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
~ memberP(sK48,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
memberP(sK47,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f428,plain,
memberP(sK49,sK51),
inference(definition_unfolding,[],[f419,f421]) ).
fof(f429,plain,
~ memberP(sK50,sK51),
inference(definition_unfolding,[],[f418,f422]) ).
fof(f463,definition,
( spl53_1
<=> ssItem(sK52) ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f465,plain,
( ssItem(sK52)
| ~ spl53_1 ),
inference(avatar_component_clause,[],[f463]) ).
fof(f467,definition,
( spl53_2
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f469,plain,
( nil = sK50
| ~ spl53_2 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f470,plain,
( spl53_1
| spl53_2 ),
inference(avatar_split_clause,[],[f411,f467,f463]) ).
fof(f472,definition,
( spl53_3
<=> memberP(sK50,sK52) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f474,plain,
( memberP(sK50,sK52)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f475,plain,
( spl53_3
| spl53_2 ),
inference(avatar_split_clause,[],[f412,f467,f472]) ).
fof(f477,definition,
( spl53_4
<=> sK49 = cons(sK52,nil) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f479,plain,
( sK49 = cons(sK52,nil)
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f480,plain,
( spl53_4
| spl53_2 ),
inference(avatar_split_clause,[],[f413,f467,f477]) ).
fof(f482,definition,
( spl53_5
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f484,plain,
( nil = sK49
| ~ spl53_5 ),
inference(avatar_component_clause,[],[f482]) ).
fof(f485,plain,
( spl53_1
| spl53_5 ),
inference(avatar_split_clause,[],[f414,f482,f463]) ).
fof(f486,plain,
( spl53_3
| spl53_5 ),
inference(avatar_split_clause,[],[f415,f482,f472]) ).
fof(f493,definition,
( spl53_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl53_7])],[avatar_definition]) ).
fof(f494,plain,
( ssList(nil)
| ~ spl53_7 ),
inference(avatar_component_clause,[],[f493]) ).
fof(f495,plain,
( ~ ssList(nil)
| spl53_7 ),
inference(avatar_component_clause,[],[f493]) ).
fof(f520,plain,
( ~ memberP(nil,sK51)
| ~ spl53_2 ),
inference(superposition,[],[f429,f469]) ).
fof(f522,plain,
( memberP(nil,sK51)
| ~ spl53_5 ),
inference(superposition,[],[f428,f484]) ).
fof(f524,plain,
( $false
| ~ spl53_2
| ~ spl53_5 ),
inference(forward_subsumption_resolution,[],[f522,f520]) ).
fof(f525,plain,
( ~ spl53_2
| ~ spl53_5 ),
inference(avatar_contradiction_clause,[],[f524]) ).
fof(f526,plain,
( memberP(nil,sK52)
| ~ spl53_2
| ~ spl53_3 ),
inference(forward_demodulation,[],[f474,f469]) ).
fof(f527,plain,
( ~ ssItem(sK52)
| ~ spl53_2
| ~ spl53_3 ),
inference(resolution,[],[f336,f526]) ).
fof(f528,plain,
( $false
| ~ spl53_1
| ~ spl53_2
| ~ spl53_3 ),
inference(forward_subsumption_resolution,[],[f527,f465]) ).
fof(f529,plain,
( ~ spl53_1
| ~ spl53_2
| ~ spl53_3 ),
inference(avatar_contradiction_clause,[],[f528]) ).
fof(f530,plain,
( $false
| spl53_7 ),
inference(forward_subsumption_resolution,[],[f306,f495]) ).
fof(f531,plain,
spl53_7,
inference(avatar_contradiction_clause,[],[f530]) ).
fof(f776,plain,
( ! [X0] :
( ~ memberP(sK49,X0)
| ~ ssItem(sK52)
| ~ ssList(nil)
| memberP(nil,X0)
| sK52 = X0
| ~ ssItem(X0) )
| ~ spl53_4 ),
inference(superposition,[],[f333,f479]) ).
fof(f790,plain,
( ! [X0] :
( ~ memberP(sK49,X0)
| ~ ssList(nil)
| memberP(nil,X0)
| sK52 = X0
| ~ ssItem(X0) )
| ~ spl53_1
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f776,f465]) ).
fof(f795,plain,
( ! [X0] :
( ~ memberP(sK49,X0)
| memberP(nil,X0)
| sK52 = X0
| ~ ssItem(X0) )
| ~ spl53_1
| ~ spl53_4
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f790,f494]) ).
fof(f800,plain,
( ! [X0] :
( ~ memberP(sK49,X0)
| sK52 = X0
| ~ ssItem(X0) )
| ~ spl53_1
| ~ spl53_4
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f795,f336]) ).
fof(f803,plain,
( sK51 = sK52
| ~ ssItem(sK51)
| ~ spl53_1
| ~ spl53_4
| ~ spl53_7 ),
inference(resolution,[],[f800,f428]) ).
fof(f807,plain,
( sK51 = sK52
| ~ spl53_1
| ~ spl53_4
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f803,f417]) ).
fof(f808,plain,
( ~ memberP(sK50,sK52)
| ~ spl53_1
| ~ spl53_4
| ~ spl53_7 ),
inference(superposition,[],[f429,f807]) ).
fof(f811,plain,
( $false
| ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f808,f474]) ).
fof(f812,plain,
( ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_7 ),
inference(avatar_contradiction_clause,[],[f811]) ).
cnf(s1,plain,
( spl53_1
| spl53_2 ),
inference(sat_conversion,[],[f470]) ).
cnf(s2,plain,
( spl53_2
| spl53_3 ),
inference(sat_conversion,[],[f475]) ).
cnf(s3,plain,
( spl53_2
| spl53_4 ),
inference(sat_conversion,[],[f480]) ).
cnf(s4,plain,
( spl53_1
| spl53_5 ),
inference(sat_conversion,[],[f485]) ).
cnf(s5,plain,
( spl53_3
| spl53_5 ),
inference(sat_conversion,[],[f486]) ).
cnf(s13,plain,
( ~ spl53_2
| ~ spl53_5 ),
inference(sat_conversion,[],[f525]) ).
cnf(s14,plain,
( ~ spl53_1
| ~ spl53_2
| ~ spl53_3 ),
inference(sat_conversion,[],[f529]) ).
cnf(s15,plain,
spl53_7,
inference(sat_conversion,[],[f531]) ).
cnf(s34,plain,
( ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_7 ),
inference(sat_conversion,[],[f812]) ).
cnf(s41,plain,
spl53_1,
inference(rat,[],[s13,s1,s4]) ).
cnf(s42,plain,
spl53_2,
inference(rat,[],[s34,s2,s3,s41,s15]) ).
cnf(s43,plain,
~ spl53_3,
inference(rat,[],[s14,s41,s42]) ).
cnf(s44,plain,
~ spl53_5,
inference(rat,[],[s13,s42]) ).
cnf(s45,plain,
$false,
inference(rat,[],[s5,s44,s43]) ).
fof(f813,plain,
$false,
inference(avatar_sat_refutation,[],[s45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC407+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.08/0.19 % Computer : n017.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 09:26:36 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.92/0.42 % (3424651)Will run a generic schedule for satisfiability detection.
% 0.92/0.42 % (3424659)dis+10_1_sil=32000:sp=arity:random_seed=2398617308:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.92/0.42 % (3424657)% WARNING: option uhcvi not known.
% 0.92/0.42 % (3424660)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2827524840:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.92/0.42 % (3424656)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4047424239_2999 on theBenchmark for (2999ds/0Mi)
% 0.92/0.42 % (3424657)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3196552022:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.92/0.42 % (3424658)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1958248487:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.92/0.42 % (3424662)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=732039920:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.92/0.42 % (3424661)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=684825164:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.92/0.42 % TRYING [1]
% 0.92/0.42 % TRYING [2]
% 0.92/0.42 % TRYING [3]
% 0.92/0.42 % (3424659)Instruction limit reached!
% 0.92/0.42 % (3424659)------------------------------
% 0.92/0.42 % (3424659)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.42 % (3424659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.42 % (3424659)CaDiCaL version: 2.1.3
% 0.92/0.42 % (3424659)Termination reason: Instruction limit
% 0.92/0.42 % (3424659)Termination phase: Saturation
% 0.92/0.42 % (3424659)Time elapsed: 0.036 s
% 0.92/0.42 % (3424659)Peak memory usage: 13 MB
% 0.92/0.42 % (3424659)Instructions burned: 106 (million)
% 0.92/0.42 % TRYING [4]
% 0.92/0.42 % (3424670)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3514856551:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.92/0.42 % TRYING [1]
% 0.92/0.42 % TRYING [2]
% 0.92/0.42 % TRYING [3]
% 0.92/0.42 % TRYING [4]
% 0.92/0.42 % (3424660)Instruction limit reached!
% 0.92/0.42 % (3424660)------------------------------
% 0.92/0.42 % (3424660)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.42 % (3424660)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.42 % (3424660)CaDiCaL version: 2.1.3
% 0.92/0.42 % (3424660)Termination reason: Instruction limit
% 0.92/0.42 % (3424660)Termination phase: Saturation
% 0.92/0.42 % (3424660)Time elapsed: 0.070 s
% 0.92/0.42 % (3424660)Peak memory usage: 13 MB
% 0.92/0.42 % (3424660)Instructions burned: 117 (million)
% 0.92/0.42 % TRYING [5]
% 0.92/0.42 % TRYING [5]
% 0.92/0.42 % (3424672)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1367155144:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.92/0.42 % (3424662)Instruction limit reached!
% 0.92/0.42 % (3424662)------------------------------
% 0.92/0.42 % (3424662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.42 % (3424662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.42 % (3424662)CaDiCaL version: 2.1.3
% 0.92/0.42 % (3424662)Termination reason: Instruction limit
% 0.92/0.42 % (3424662)Termination phase: Saturation
% 0.92/0.42 % (3424662)Time elapsed: 0.102 s
% 0.92/0.42 % (3424662)Peak memory usage: 15 MB
% 0.92/0.42 % (3424662)Instructions burned: 160 (million)
% 0.92/0.42 % (3424674)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2735311081:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.92/0.42 % (3424674) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3424651-3424674"...
% 0.92/0.42 % (3424674)...printing done.
% 0.92/0.42 % (3424674)Refutation found. Thanks to Tanya!
% 0.92/0.42 % SZS status Theorem for theBenchmark
% 0.92/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.92/0.42 % (3424674)------------------------------
% 0.92/0.42 % (3424674)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.42 % (3424674)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.42 % (3424674)CaDiCaL version: 2.1.3
% 0.92/0.42 % (3424674)Termination reason: Refutation
% 0.92/0.42 % (3424674)Time elapsed: 0.014 s
% 0.92/0.42 % (3424674)Peak memory usage: 13 MB
% 0.92/0.42 % (3424674)Instructions burned: 19 (million)
% 0.92/0.42 % (3424651)Success in time 0.181 s
% 0.92/0.42 % Vampire exiting
%------------------------------------------------------------------------------