%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC206+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 : n014.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.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 19 unt; 6 def)
% Number of atoms : 183 ( 31 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 201 ( 80 ~; 70 |; 28 &)
% ( 10 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 29 ( 0 sgn 19 !; 10 ?)
% 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(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
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] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) ) )
& 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)
| neq(X0,nil)
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,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(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ neq(X0,nil)
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( neq(X4,nil)
& segmentP(X3,X4)
& segmentP(X2,X4)
& ssList(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] :
( neq(X4,nil)
& segmentP(X3,X4)
& segmentP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& 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(f361,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f411,plain,
( ~ neq(sK50,nil)
| ssList(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( ~ neq(sK50,nil)
| segmentP(sK49,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ neq(sK50,nil)
| neq(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
~ neq(sK47,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f418,f420]) ).
fof(f427,plain,
~ neq(sK49,nil),
inference(definition_unfolding,[],[f417,f419]) ).
fof(f461,definition,
( spl52_1
<=> ssList(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f463,plain,
( ssList(sK51)
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f465,definition,
( spl52_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f468,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f411,f465,f461]) ).
fof(f470,definition,
( spl52_3
<=> segmentP(sK49,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f472,plain,
( segmentP(sK49,sK51)
| ~ spl52_3 ),
inference(avatar_component_clause,[],[f470]) ).
fof(f473,plain,
( spl52_3
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f412,f465,f470]) ).
fof(f480,definition,
( spl52_5
<=> neq(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f482,plain,
( neq(sK51,nil)
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f480]) ).
fof(f483,plain,
( spl52_5
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f414,f465,f480]) ).
fof(f485,definition,
( spl52_6
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f487,plain,
( nil = sK49
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f485]) ).
fof(f493,plain,
spl52_2,
inference(avatar_split_clause,[],[f426,f465]) ).
fof(f495,definition,
( spl52_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_8])],[avatar_definition]) ).
fof(f496,plain,
( ssList(nil)
| ~ spl52_8 ),
inference(avatar_component_clause,[],[f495]) ).
fof(f523,plain,
spl52_8,
inference(avatar_split_clause,[],[f306,f495]) ).
fof(f624,plain,
( ~ ssList(nil)
| nil = sK49
| ~ ssList(sK49) ),
inference(resolution,[],[f303,f427]) ).
fof(f629,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f624,f496]) ).
fof(f630,plain,
( nil = sK49
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f629,f421]) ).
fof(f631,plain,
( spl52_6
| ~ spl52_8 ),
inference(avatar_split_clause,[],[f630,f495,f485]) ).
fof(f633,plain,
( ~ neq(nil,nil)
| ~ spl52_6 ),
inference(superposition,[],[f427,f487]) ).
fof(f634,plain,
( segmentP(nil,sK51)
| ~ spl52_3
| ~ spl52_6 ),
inference(superposition,[],[f472,f487]) ).
fof(f654,plain,
( nil = sK51
| ~ ssList(sK51)
| ~ spl52_3
| ~ spl52_6 ),
inference(resolution,[],[f634,f361]) ).
fof(f655,plain,
( nil = sK51
| ~ spl52_1
| ~ spl52_3
| ~ spl52_6 ),
inference(forward_subsumption_resolution,[],[f654,f463]) ).
fof(f663,plain,
( neq(nil,nil)
| ~ spl52_1
| ~ spl52_3
| ~ spl52_5
| ~ spl52_6 ),
inference(superposition,[],[f482,f655]) ).
fof(f668,plain,
( $false
| ~ spl52_1
| ~ spl52_3
| ~ spl52_5
| ~ spl52_6 ),
inference(forward_subsumption_resolution,[],[f663,f633]) ).
fof(f669,plain,
( ~ spl52_1
| ~ spl52_3
| ~ spl52_5
| ~ spl52_6 ),
inference(avatar_contradiction_clause,[],[f668]) ).
cnf(s1,plain,
( spl52_1
| ~ spl52_2 ),
inference(sat_conversion,[],[f468]) ).
cnf(s2,plain,
( ~ spl52_2
| spl52_3 ),
inference(sat_conversion,[],[f473]) ).
cnf(s4,plain,
( ~ spl52_2
| spl52_5 ),
inference(sat_conversion,[],[f483]) ).
cnf(s6,plain,
spl52_2,
inference(sat_conversion,[],[f493]) ).
cnf(s14,plain,
spl52_8,
inference(sat_conversion,[],[f523]) ).
cnf(s16,plain,
( spl52_6
| ~ spl52_8 ),
inference(sat_conversion,[],[f631]) ).
cnf(s18,plain,
( ~ spl52_1
| ~ spl52_3
| ~ spl52_5
| ~ spl52_6 ),
inference(sat_conversion,[],[f669]) ).
cnf(s19,plain,
spl52_6,
inference(rat,[],[s16,s14]) ).
cnf(s23,plain,
spl52_5,
inference(rat,[],[s4,s6]) ).
cnf(s25,plain,
spl52_3,
inference(rat,[],[s2,s6]) ).
cnf(s26,plain,
~ spl52_1,
inference(rat,[],[s18,s19,s23,s25]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s1,s6,s26]) ).
fof(f671,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC206+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n014.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 08:27:16 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.48 % (1631980)Will run a generic schedule for satisfiability detection.
% 0.16/0.48 % (1631990)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3297164565:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48 % (1631986)% WARNING: option uhcvi not known.
% 0.16/0.48 % (1631987)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2603237275:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.48 % (1631985)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=795343211_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.48 % (1631986)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=114543390:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.48 % (1631988)dis+10_1_sil=32000:sp=arity:random_seed=2650150217:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.48 % (1631989)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2355957737:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.48 % (1631991)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2341549006:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.48 % (1631989) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1631980-1631989"...
% 0.16/0.48 % TRYING [1]
% 0.16/0.48 % (1631986) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1631980-1631986"...
% 0.16/0.48 % TRYING [2]
% 0.16/0.48 % (1631988) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1631980-1631988"...
% 0.16/0.48 % (1631989)...printing done.
% 0.16/0.48 % (1631986)...printing done.
% 0.16/0.48 % (1631989)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Theorem for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (1631989)------------------------------
% 0.16/0.48 % (1631989)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (1631989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (1631989)CaDiCaL version: 2.1.3
% 0.16/0.48 % (1631989)Termination reason: Refutation
% 0.16/0.48 % (1631989)Time elapsed: 0.015 s
% 0.16/0.48 % (1631989)Peak memory usage: 13 MB
% 0.16/0.48 % (1631989)Instructions burned: 24 (million)
% 0.16/0.48 % (1631980)Success in time 0.056 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------