%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC082+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 : 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:04:35 PM UTC 2026
% Result : Theorem 0.08s 0.44s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 12 unt; 5 def)
% Number of atoms : 177 ( 22 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 213 ( 82 ~; 70 |; 46 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 15 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X3,X5)
| ~ segmentP(X2,X5) ) )
& neq(X3,nil) ) ) ) ) ) ),
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)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X3,X5)
| ~ segmentP(X2,X5) ) )
& neq(X3,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( ? [X5] :
( neq(X5,nil)
& segmentP(X3,X5)
& segmentP(X2,X5)
& ssList(X5) )
| ~ 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] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( ? [X5] :
( neq(X5,nil)
& segmentP(X3,X5)
& segmentP(X2,X5)
& ssList(X5) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ( nil = sK55
| nil != sK56 )
& ( ( neq(sK57,nil)
& segmentP(sK56,sK57)
& segmentP(sK55,sK57)
& ssList(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(X5,sK57)],[f222]) ).
fof(f500,plain,
( ssList(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( segmentP(sK55,sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( segmentP(sK56,sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( neq(sK57,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f506,f508]) ).
fof(f510,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK56,X4)
| ~ segmentP(sK55,X4) ),
inference(definition_unfolding,[],[f505,f508,f507]) ).
fof(f514,definition,
( spl58_1
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl58_1])],[avatar_definition]) ).
fof(f518,definition,
( spl58_2
<=> ssList(sK57) ),
introduced(definition,[new_symbols(definition,[spl58_2])],[avatar_definition]) ).
fof(f520,plain,
( ssList(sK57)
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f518]) ).
fof(f521,plain,
( ~ spl58_1
| spl58_2 ),
inference(avatar_split_clause,[],[f500,f518,f514]) ).
fof(f523,definition,
( spl58_3
<=> segmentP(sK55,sK57) ),
introduced(definition,[new_symbols(definition,[spl58_3])],[avatar_definition]) ).
fof(f525,plain,
( segmentP(sK55,sK57)
| ~ spl58_3 ),
inference(avatar_component_clause,[],[f523]) ).
fof(f526,plain,
( ~ spl58_1
| spl58_3 ),
inference(avatar_split_clause,[],[f501,f523,f514]) ).
fof(f528,definition,
( spl58_4
<=> segmentP(sK56,sK57) ),
introduced(definition,[new_symbols(definition,[spl58_4])],[avatar_definition]) ).
fof(f530,plain,
( segmentP(sK56,sK57)
| ~ spl58_4 ),
inference(avatar_component_clause,[],[f528]) ).
fof(f531,plain,
( ~ spl58_1
| spl58_4 ),
inference(avatar_split_clause,[],[f502,f528,f514]) ).
fof(f533,definition,
( spl58_5
<=> neq(sK57,nil) ),
introduced(definition,[new_symbols(definition,[spl58_5])],[avatar_definition]) ).
fof(f535,plain,
( neq(sK57,nil)
| ~ spl58_5 ),
inference(avatar_component_clause,[],[f533]) ).
fof(f536,plain,
( ~ spl58_1
| spl58_5 ),
inference(avatar_split_clause,[],[f503,f533,f514]) ).
fof(f546,plain,
spl58_1,
inference(avatar_split_clause,[],[f509,f514]) ).
fof(f549,plain,
( ~ neq(sK57,nil)
| ~ segmentP(sK56,sK57)
| ~ segmentP(sK55,sK57)
| ~ spl58_2 ),
inference(resolution,[],[f510,f520]) ).
fof(f550,plain,
( ~ segmentP(sK56,sK57)
| ~ segmentP(sK55,sK57)
| ~ spl58_2
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f549,f535]) ).
fof(f565,plain,
( ~ segmentP(sK55,sK57)
| ~ spl58_2
| ~ spl58_4
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f550,f530]) ).
fof(f575,plain,
( $false
| ~ spl58_2
| ~ spl58_3
| ~ spl58_4
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f565,f525]) ).
fof(f576,plain,
( ~ spl58_2
| ~ spl58_3
| ~ spl58_4
| ~ spl58_5 ),
inference(avatar_contradiction_clause,[],[f575]) ).
cnf(s1,plain,
( ~ spl58_1
| spl58_2 ),
inference(sat_conversion,[],[f521]) ).
cnf(s2,plain,
( ~ spl58_1
| spl58_3 ),
inference(sat_conversion,[],[f526]) ).
cnf(s3,plain,
( ~ spl58_1
| spl58_4 ),
inference(sat_conversion,[],[f531]) ).
cnf(s4,plain,
( ~ spl58_1
| spl58_5 ),
inference(sat_conversion,[],[f536]) ).
cnf(s6,plain,
spl58_1,
inference(sat_conversion,[],[f546]) ).
cnf(s9,plain,
( ~ spl58_2
| ~ spl58_3
| ~ spl58_4
| ~ spl58_5 ),
inference(sat_conversion,[],[f576]) ).
cnf(s10,plain,
spl58_5,
inference(rat,[],[s4,s6]) ).
cnf(s11,plain,
spl58_4,
inference(rat,[],[s3,s6]) ).
cnf(s12,plain,
spl58_3,
inference(rat,[],[s2,s6]) ).
cnf(s13,plain,
~ spl58_2,
inference(rat,[],[s9,s10,s11,s12]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s13,s6]) ).
fof(f577,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC082+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.08/0.37 % Computer : n013.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 28 07:45:57 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.40 Running first-order model finding
% 0.08/0.40 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.08/0.44 % (1007920)Will run a generic schedule for satisfiability detection.
% 0.08/0.44 % (1007930)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3098837280:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.44 % (1007926)% WARNING: option uhcvi not known.
% 0.08/0.44 % (1007930) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1007920-1007930"...
% 0.08/0.44 % (1007930)...printing done.
% 0.08/0.44 % (1007926)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1490883445:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.44 % (1007925)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2511604361_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.44 % (1007927)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2400792299:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.44 % (1007930)Refutation found. Thanks to Tanya!
% 0.08/0.44 % SZS status Theorem for theBenchmark
% 0.08/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.45 % (1007930)------------------------------
% 0.08/0.45 % (1007930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.45 % (1007930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.45 % (1007930)CaDiCaL version: 2.1.3
% 0.08/0.45 % (1007930)Termination reason: Refutation
% 0.08/0.45 % (1007930)Time elapsed: 0.005 s
% 0.08/0.45 % (1007930)Peak memory usage: 12 MB
% 0.08/0.45 % (1007930)Instructions burned: 14 (million)
% 0.08/0.45 % (1007920)Success in time 0.033 s
% 0.08/0.45 % Vampire exiting
%------------------------------------------------------------------------------