%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC217+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:08 PM UTC 2026
% Result : Theorem 0.09s 0.23s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 18 unt; 5 def)
% Number of atoms : 181 ( 44 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 206 ( 81 ~; 66 |; 38 &)
% ( 7 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| neq(X0,nil)
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) )
& neq(X3,nil) ) ) ) ) ) ),
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
| ~ neq(X1,nil)
| neq(X0,nil)
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) )
& neq(X3,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ neq(X0,nil)
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ neq(X0,nil)
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& ~ neq(sK53,nil)
& ( nil = sK55
| nil != sK56 )
& ( ( sK55 = cons(sK57,nil)
& memberP(sK56,sK57)
& ssItem(sK57) )
| ~ neq(sK56,nil) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f222]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f390,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ssItem(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( sK55 = cons(sK57,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f505,f507]) ).
fof(f509,plain,
~ neq(sK55,nil),
inference(definition_unfolding,[],[f504,f506]) ).
fof(f547,definition,
( spl58_1
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl58_1])],[avatar_definition]) ).
fof(f551,definition,
( spl58_2
<=> ssItem(sK57) ),
introduced(definition,[new_symbols(definition,[spl58_2])],[avatar_definition]) ).
fof(f553,plain,
( ssItem(sK57)
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f551]) ).
fof(f554,plain,
( ~ spl58_1
| spl58_2 ),
inference(avatar_split_clause,[],[f500,f551,f547]) ).
fof(f561,definition,
( spl58_4
<=> sK55 = cons(sK57,nil) ),
introduced(definition,[new_symbols(definition,[spl58_4])],[avatar_definition]) ).
fof(f563,plain,
( sK55 = cons(sK57,nil)
| ~ spl58_4 ),
inference(avatar_component_clause,[],[f561]) ).
fof(f564,plain,
( ~ spl58_1
| spl58_4 ),
inference(avatar_split_clause,[],[f502,f561,f547]) ).
fof(f570,definition,
( spl58_6
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl58_6])],[avatar_definition]) ).
fof(f571,plain,
( nil != sK55
| spl58_6 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f574,plain,
spl58_1,
inference(avatar_split_clause,[],[f508,f547]) ).
fof(f576,definition,
( spl58_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl58_7])],[avatar_definition]) ).
fof(f577,plain,
( ssList(nil)
| ~ spl58_7 ),
inference(avatar_component_clause,[],[f576]) ).
fof(f609,plain,
spl58_7,
inference(avatar_split_clause,[],[f389,f576]) ).
fof(f973,plain,
( nil != sK55
| ~ ssItem(sK57)
| ~ ssList(nil)
| ~ spl58_4 ),
inference(superposition,[],[f390,f563]) ).
fof(f974,plain,
( nil != sK55
| ~ ssList(nil)
| ~ spl58_2
| ~ spl58_4 ),
inference(forward_subsumption_resolution,[],[f973,f553]) ).
fof(f975,plain,
( nil != sK55
| ~ spl58_2
| ~ spl58_4
| ~ spl58_7 ),
inference(forward_subsumption_resolution,[],[f974,f577]) ).
fof(f976,plain,
( ~ spl58_6
| ~ spl58_2
| ~ spl58_4
| ~ spl58_7 ),
inference(avatar_split_clause,[],[f975,f576,f561,f551,f570]) ).
fof(f1000,plain,
( nil = sK55
| ~ ssList(nil)
| ~ ssList(sK55) ),
inference(resolution,[],[f387,f509]) ).
fof(f1005,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| spl58_6 ),
inference(forward_subsumption_resolution,[],[f1000,f571]) ).
fof(f1006,plain,
( ~ ssList(sK55)
| spl58_6
| ~ spl58_7 ),
inference(forward_subsumption_resolution,[],[f1005,f577]) ).
fof(f1007,plain,
( $false
| spl58_6
| ~ spl58_7 ),
inference(forward_subsumption_resolution,[],[f1006,f498]) ).
fof(f1008,plain,
( spl58_6
| ~ spl58_7 ),
inference(avatar_contradiction_clause,[],[f1007]) ).
cnf(s1,plain,
( ~ spl58_1
| spl58_2 ),
inference(sat_conversion,[],[f554]) ).
cnf(s3,plain,
( ~ spl58_1
| spl58_4 ),
inference(sat_conversion,[],[f564]) ).
cnf(s5,plain,
spl58_1,
inference(sat_conversion,[],[f574]) ).
cnf(s14,plain,
spl58_7,
inference(sat_conversion,[],[f609]) ).
cnf(s32,plain,
( ~ spl58_2
| ~ spl58_4
| ~ spl58_6
| ~ spl58_7 ),
inference(sat_conversion,[],[f976]) ).
cnf(s34,plain,
( spl58_6
| ~ spl58_7 ),
inference(sat_conversion,[],[f1008]) ).
cnf(s35,plain,
spl58_6,
inference(rat,[],[s34,s14]) ).
cnf(s40,plain,
spl58_4,
inference(rat,[],[s3,s5]) ).
cnf(s41,plain,
~ spl58_2,
inference(rat,[],[s32,s14,s35,s40]) ).
cnf(s43,plain,
$false,
inference(rat,[],[s1,s41,s5]) ).
fof(f1009,plain,
$false,
inference(avatar_sat_refutation,[],[s43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC217+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.16 % Computer : n013.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Mon Sep 28 08:31:51 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 Running first-order model finding
% 0.09/0.19 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.23 % (1024512)Will run a generic schedule for satisfiability detection.
% 0.09/0.23 % (1024520)dis+10_1_sil=32000:sp=arity:random_seed=1300404555:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.23 % (1024518)% WARNING: option uhcvi not known.
% 0.09/0.23 % (1024517)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2842120418_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.23 % (1024520) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1024512-1024520"...
% 0.09/0.23 % (1024521)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1863472452:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.23 % (1024518)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3862681601:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.23 % (1024519)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1142049293:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.23 % (1024522)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3985843136:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.23 % (1024523)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4132847698:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.23 % (1024520)...printing done.
% 0.09/0.23 % (1024520)Refutation found. Thanks to Tanya!
% 0.09/0.23 % SZS status Theorem for theBenchmark
% 0.09/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.23 % (1024520)------------------------------
% 0.09/0.23 % (1024520)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.23 % (1024520)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.23 % (1024520)CaDiCaL version: 2.1.3
% 0.09/0.23 % (1024520)Termination reason: Refutation
% 0.09/0.23 % (1024520)Time elapsed: 0.008 s
% 0.09/0.23 % (1024520)Peak memory usage: 13 MB
% 0.09/0.23 % (1024520)Instructions burned: 23 (million)
% 0.09/0.23 % (1024512)Success in time 0.033 s
% 0.09/0.23 % Vampire exiting
%------------------------------------------------------------------------------