%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC317+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 : 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:31 PM UTC 2026
% Result : Theorem 0.18s 0.27s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 51 ( 13 unt; 6 def)
% Number of atoms : 184 ( 45 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 230 ( 97 ~; 83 |; 32 &)
% ( 6 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 24 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(cons(X4,nil),X5) = X0
& app(X5,cons(X4,nil)) = X1 ) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X2
| app(X7,cons(X6,nil)) != X3 ) ) ) )
& ( ~ neq(X1,nil)
| 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)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(cons(X4,nil),X5) = X0
& app(X5,cons(X4,nil)) = X1 ) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X2
| app(X7,cons(X6,nil)) != X3 ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X0
| app(X5,cons(X4,nil)) != X1 ) )
& ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X2
& app(X7,cons(X6,nil)) = X3
& ssList(X7) )
& ssItem(X6) ) )
| ( neq(X1,nil)
& ~ 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)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X0
| app(X5,cons(X4,nil)) != X1 ) )
& ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X2
& app(X7,cons(X6,nil)) = X3
& ssList(X7) )
& ssItem(X6) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f412,plain,
! [X4,X5] :
( ~ neq(sK50,nil)
| app(X5,cons(X4,nil)) != sK48
| app(cons(X4,nil),X5) != sK47
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( ~ neq(sK50,nil)
| sK50 = app(sK52,cons(sK51,nil)) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( ~ neq(sK50,nil)
| sK49 = app(cons(sK51,nil),sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f432,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f421,f425]) ).
fof(f437,plain,
! [X4,X5] :
( ~ neq(sK50,nil)
| app(X5,cons(X4,nil)) != sK50
| app(cons(X4,nil),X5) != sK49
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f412,f425,f424]) ).
fof(f569,definition,
( spl53_1
<=> ! [X4,X5] :
( app(X5,cons(X4,nil)) != sK50
| ~ ssItem(X4)
| ~ ssList(X5)
| app(cons(X4,nil),X5) != sK49 ) ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f570,plain,
( ! [X4,X5] :
( app(cons(X4,nil),X5) != sK49
| ~ ssItem(X4)
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK50 )
| ~ spl53_1 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f572,definition,
( spl53_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f576,plain,
( spl53_1
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f437,f572,f569]) ).
fof(f578,definition,
( spl53_3
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f580,plain,
( ssList(sK52)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f578]) ).
fof(f583,definition,
( spl53_4
<=> sK50 = app(sK52,cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f585,plain,
( sK50 = app(sK52,cons(sK51,nil))
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f583]) ).
fof(f588,definition,
( spl53_5
<=> sK49 = app(cons(sK51,nil),sK52) ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f590,plain,
( sK49 = app(cons(sK51,nil),sK52)
| ~ spl53_5 ),
inference(avatar_component_clause,[],[f588]) ).
fof(f592,plain,
( spl53_3
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f416,f572,f578]) ).
fof(f593,plain,
( spl53_4
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f417,f572,f583]) ).
fof(f594,plain,
( spl53_5
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f418,f572,f588]) ).
fof(f596,definition,
( spl53_6
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).
fof(f598,plain,
( ssItem(sK51)
| ~ spl53_6 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f599,plain,
( spl53_6
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f419,f572,f596]) ).
fof(f601,plain,
spl53_2,
inference(avatar_split_clause,[],[f432,f572]) ).
fof(f637,plain,
( sK49 != sK49
| ~ ssItem(sK51)
| ~ ssList(sK52)
| sK50 != app(sK52,cons(sK51,nil))
| ~ spl53_1
| ~ spl53_5 ),
inference(superposition,[],[f570,f590]) ).
fof(f638,plain,
( ~ ssItem(sK51)
| ~ ssList(sK52)
| sK50 != app(sK52,cons(sK51,nil))
| ~ spl53_1
| ~ spl53_5 ),
inference(trivial_inequality_removal,[],[f637]) ).
fof(f639,plain,
( ~ ssList(sK52)
| sK50 != app(sK52,cons(sK51,nil))
| ~ spl53_1
| ~ spl53_5
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f638,f598]) ).
fof(f640,plain,
( sK50 != app(sK52,cons(sK51,nil))
| ~ spl53_1
| ~ spl53_3
| ~ spl53_5
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f639,f580]) ).
fof(f641,plain,
( $false
| ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f640,f585]) ).
fof(f642,plain,
( ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(avatar_contradiction_clause,[],[f641]) ).
cnf(s2,plain,
( spl53_1
| ~ spl53_2 ),
inference(sat_conversion,[],[f576]) ).
cnf(s6,plain,
( ~ spl53_2
| spl53_3 ),
inference(sat_conversion,[],[f592]) ).
cnf(s7,plain,
( ~ spl53_2
| spl53_4 ),
inference(sat_conversion,[],[f593]) ).
cnf(s8,plain,
( ~ spl53_2
| spl53_5 ),
inference(sat_conversion,[],[f594]) ).
cnf(s9,plain,
( ~ spl53_2
| spl53_6 ),
inference(sat_conversion,[],[f599]) ).
cnf(s11,plain,
spl53_2,
inference(sat_conversion,[],[f601]) ).
cnf(s21,plain,
( ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(sat_conversion,[],[f642]) ).
cnf(s26,plain,
spl53_6,
inference(rat,[],[s9,s11]) ).
cnf(s27,plain,
spl53_5,
inference(rat,[],[s8,s11]) ).
cnf(s28,plain,
spl53_4,
inference(rat,[],[s7,s11]) ).
cnf(s29,plain,
spl53_3,
inference(rat,[],[s6,s11]) ).
cnf(s30,plain,
~ spl53_1,
inference(rat,[],[s21,s26,s27,s28,s29]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s2,s11,s30]) ).
fof(f643,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC317+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.08/0.18 % Computer : n011.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 09:01:45 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.18/0.27 % (3260965)Will run a generic schedule for satisfiability detection.
% 0.18/0.27 % (3260976)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1467053626:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.27 % (3260971)% WARNING: option uhcvi not known.
% 0.18/0.27 % (3260972)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2310208713:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.27 % (3260970)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2309695977_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.27 % (3260975)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=833818791:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.27 % (3260971)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2315178598:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.27 % (3260973)dis+10_1_sil=32000:sp=arity:random_seed=4266047762:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.27 % (3260974)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=308528198:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.27 % (3260971) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3260965-3260971"...
% 0.18/0.27 % (3260971)...printing done.
% 0.18/0.27 % (3260971)Refutation found. Thanks to Tanya!
% 0.18/0.27 % SZS status Theorem for theBenchmark
% 0.18/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27 % (3260971)------------------------------
% 0.18/0.27 % (3260971)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27 % (3260971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27 % (3260971)CaDiCaL version: 2.1.3
% 0.18/0.27 % (3260971)Termination reason: Refutation
% 0.18/0.27 % (3260971)Time elapsed: 0.008 s
% 0.18/0.27 % (3260971)Peak memory usage: 13 MB
% 0.18/0.27 % (3260971)Instructions burned: 11 (million)
% 0.18/0.27 % (3260965)Success in time 0.042 s
% 0.18/0.27 % Vampire exiting
%------------------------------------------------------------------------------