%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC205+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 : n019.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:05 PM UTC 2026
% Result : Theorem 0.29s 0.46s
% Output : Refutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 15 unt; 3 def)
% Number of atoms : 122 ( 38 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 130 ( 51 ~; 42 |; 22 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 14 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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 != X3
& nil = X2 )
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
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
| ~ neq(X1,nil)
| neq(X0,nil)
| ( nil != X3
& nil = X2 )
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
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(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ neq(X0,nil)
& ( nil = X3
| nil != X2 )
& ( nil = X2
| nil != X3 )
& 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 = X3
| nil != X2 )
& ( nil = X2
| nil != X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f411,plain,
( nil != sK49
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
~ neq(sK47,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f415,f417]) ).
fof(f424,plain,
~ neq(sK49,nil),
inference(definition_unfolding,[],[f414,f416]) ).
fof(f458,definition,
( spl51_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f460,plain,
( nil = sK50
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f458]) ).
fof(f462,definition,
( spl51_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f463,plain,
( nil = sK49
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f462]) ).
fof(f464,plain,
( nil != sK49
| spl51_2 ),
inference(avatar_component_clause,[],[f462]) ).
fof(f465,plain,
( spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f411,f462,f458]) ).
fof(f468,definition,
( spl51_3
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f469,plain,
( ssList(nil)
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f468]) ).
fof(f496,plain,
spl51_3,
inference(avatar_split_clause,[],[f306,f468]) ).
fof(f598,plain,
( ~ ssList(nil)
| nil = sK49
| ~ ssList(sK49) ),
inference(resolution,[],[f303,f424]) ).
fof(f603,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl51_3 ),
inference(forward_subsumption_resolution,[],[f598,f469]) ).
fof(f604,plain,
( ~ ssList(sK49)
| spl51_2
| ~ spl51_3 ),
inference(forward_subsumption_resolution,[],[f603,f464]) ).
fof(f605,plain,
( $false
| spl51_2
| ~ spl51_3 ),
inference(forward_subsumption_resolution,[],[f604,f418]) ).
fof(f606,plain,
( spl51_2
| ~ spl51_3 ),
inference(avatar_contradiction_clause,[],[f605]) ).
fof(f610,plain,
( neq(nil,nil)
| ~ spl51_1 ),
inference(superposition,[],[f423,f460]) ).
fof(f613,plain,
( ~ neq(nil,nil)
| ~ spl51_2 ),
inference(superposition,[],[f424,f463]) ).
fof(f620,plain,
( $false
| ~ spl51_1
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f613,f610]) ).
fof(f621,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_contradiction_clause,[],[f620]) ).
cnf(s1,plain,
( spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f465]) ).
cnf(s10,plain,
spl51_3,
inference(sat_conversion,[],[f496]) ).
cnf(s12,plain,
( spl51_2
| ~ spl51_3 ),
inference(sat_conversion,[],[f606]) ).
cnf(s14,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f621]) ).
cnf(s15,plain,
spl51_2,
inference(rat,[],[s12,s10]) ).
cnf(s16,plain,
~ spl51_1,
inference(rat,[],[s14,s15]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s1,s15,s16]) ).
fof(f622,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC205+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 08:27:18 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.29/0.46 % (3852285)Will run a generic schedule for satisfiability detection.
% 0.29/0.46 % (3852294)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2141176627:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.29/0.46 % (3852291)% WARNING: option uhcvi not known.
% 0.29/0.46 % (3852290)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3327515390_2999 on theBenchmark for (2999ds/0Mi)
% 0.29/0.46 % (3852291)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1935067276:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.29/0.46 % (3852292)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2376644285:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.29/0.46 % (3852293)dis+10_1_sil=32000:sp=arity:random_seed=3407104477:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.29/0.46 % (3852296)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3367071615:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.29/0.46 % (3852295)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=286730894:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.29/0.46 % (3852294) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3852285-3852294"...
% 0.29/0.46 % (3852294)...printing done.
% 0.29/0.46 % (3852294)Refutation found. Thanks to Tanya!
% 0.29/0.46 % SZS status Theorem for theBenchmark
% 0.29/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.29/0.46 % (3852294)------------------------------
% 0.29/0.46 % (3852294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.46 % (3852294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.46 % (3852294)CaDiCaL version: 2.1.3
% 0.29/0.46 % (3852294)Termination reason: Refutation
% 0.29/0.46 % (3852294)Time elapsed: 0.008 s
% 0.29/0.46 % (3852294)Peak memory usage: 13 MB
% 0.29/0.46 % (3852294)Instructions burned: 22 (million)
% 0.29/0.46 % (3852285)Success in time 0.038 s
% 0.29/0.46 % Vampire exiting
%------------------------------------------------------------------------------