%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC208+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:06 PM UTC 2026
% Result : Theorem 0.16s 0.46s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 12 unt; 3 def)
% Number of atoms : 99 ( 24 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 100 ( 34 ~; 33 |; 22 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,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
| ~ neq(X1,nil)
| neq(X0,nil)
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ neq(X0,nil)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& 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 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f411,plain,
( neq(sK49,nil)
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( neq(sK49,nil)
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
~ neq(sK47,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f417,f419]) ).
fof(f426,plain,
~ neq(sK49,nil),
inference(definition_unfolding,[],[f416,f418]) ).
fof(f460,definition,
( spl51_1
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f462,plain,
( nil = sK49
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f460]) ).
fof(f464,definition,
( spl51_2
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f465,plain,
( ~ neq(sK49,nil)
| spl51_2 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f467,plain,
( spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f411,f464,f460]) ).
fof(f469,definition,
( spl51_3
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f471,plain,
( nil = sK50
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f469]) ).
fof(f472,plain,
( spl51_3
| spl51_2 ),
inference(avatar_split_clause,[],[f412,f464,f469]) ).
fof(f479,plain,
~ spl51_2,
inference(avatar_split_clause,[],[f426,f464]) ).
fof(f512,plain,
( ~ neq(nil,nil)
| ~ spl51_1
| spl51_2 ),
inference(forward_demodulation,[],[f465,f462]) ).
fof(f514,plain,
( neq(nil,nil)
| ~ spl51_3 ),
inference(superposition,[],[f425,f471]) ).
fof(f516,plain,
( $false
| ~ spl51_1
| spl51_2
| ~ spl51_3 ),
inference(forward_subsumption_resolution,[],[f514,f512]) ).
fof(f517,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3 ),
inference(avatar_contradiction_clause,[],[f516]) ).
cnf(s1,plain,
( spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f467]) ).
cnf(s2,plain,
( spl51_2
| spl51_3 ),
inference(sat_conversion,[],[f472]) ).
cnf(s5,plain,
~ spl51_2,
inference(sat_conversion,[],[f479]) ).
cnf(s14,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3 ),
inference(sat_conversion,[],[f517]) ).
cnf(s18,plain,
spl51_3,
inference(rat,[],[s2,s5]) ).
cnf(s19,plain,
~ spl51_1,
inference(rat,[],[s14,s5,s18]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s1,s5,s19]) ).
fof(f518,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC208+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.13/0.38 % Computer : n017.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 08:23:06 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.41 Running first-order model finding
% 0.16/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.16/0.46 % (3396203)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (3396212)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3046737450:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.46 % (3396209)% WARNING: option uhcvi not known.
% 0.16/0.46 % (3396212) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3396203-3396212"...
% 0.16/0.46 % (3396212)...printing done.
% 0.16/0.46 % (3396208)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=675584744_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.46 % (3396209)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=421145018:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.46 % (3396210)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3210653862:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.46 % (3396211)dis+10_1_sil=32000:sp=arity:random_seed=1414877806:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.46 % (3396212)Refutation found. Thanks to Tanya!
% 0.16/0.46 % SZS status Theorem for theBenchmark
% 0.16/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46 % (3396212)------------------------------
% 0.16/0.46 % (3396212)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (3396212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (3396212)CaDiCaL version: 2.1.3
% 0.16/0.46 % (3396212)Termination reason: Refutation
% 0.17/0.46 % (3396212)Time elapsed: 0.006 s
% 0.17/0.46 % (3396212)Peak memory usage: 13 MB
% 0.17/0.46 % (3396212)Instructions burned: 18 (million)
% 0.17/0.46 % (3396203)Success in time 0.038 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------