%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC069+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 : 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:04:31 PM UTC 2026
% Result : Theorem 0.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 70 ( 15 unt; 8 def)
% Number of atoms : 226 ( 40 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 263 ( 107 ~; 98 |; 36 &)
% ( 10 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 20 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/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
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X3,X5)
| ~ segmentP(X2,X5) ) )
& 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
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X3,X5)
| ~ segmentP(X2,X5) ) )
& 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(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ? [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
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ? [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(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,
( ~ neq(sK50,nil)
| ssList(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( ~ neq(sK50,nil)
| segmentP(sK49,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( ~ neq(sK50,nil)
| segmentP(sK50,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ neq(sK50,nil)
| neq(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
( nil != sK49
| nil != sK50 ),
inference(definition_unfolding,[],[f417,f419,f420]) ).
fof(f427,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f415,f419,f420]) ).
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(f467,plain,
( ~ neq(sK50,nil)
| spl52_2 ),
inference(avatar_component_clause,[],[f465]) ).
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(f475,definition,
( spl52_4
<=> segmentP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f477,plain,
( segmentP(sK50,sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f478,plain,
( spl52_4
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f413,f465,f475]) ).
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(f489,definition,
( spl52_7
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_7])],[avatar_definition]) ).
fof(f491,plain,
( nil != sK50
| spl52_7 ),
inference(avatar_component_clause,[],[f489]) ).
fof(f492,plain,
( spl52_6
| ~ spl52_7 ),
inference(avatar_split_clause,[],[f416,f489,f485]) ).
fof(f493,plain,
( ~ spl52_7
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f426,f485,f489]) ).
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(f630,plain,
( ~ ssList(nil)
| nil = sK50
| ~ ssList(sK50)
| spl52_2 ),
inference(resolution,[],[f303,f467]) ).
fof(f638,plain,
( nil = sK50
| ~ ssList(sK50)
| spl52_2
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f630,f496]) ).
fof(f639,plain,
( ~ ssList(sK50)
| spl52_2
| spl52_7
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f638,f491]) ).
fof(f640,plain,
( $false
| spl52_2
| spl52_7
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f639,f418]) ).
fof(f641,plain,
( spl52_2
| spl52_7
| ~ spl52_8 ),
inference(avatar_contradiction_clause,[],[f640]) ).
fof(f649,plain,
( ~ segmentP(sK50,sK51)
| ~ segmentP(sK49,sK51)
| ~ ssList(sK51)
| ~ spl52_5 ),
inference(resolution,[],[f482,f427]) ).
fof(f650,plain,
( ~ segmentP(sK49,sK51)
| ~ ssList(sK51)
| ~ spl52_4
| ~ spl52_5 ),
inference(forward_subsumption_resolution,[],[f649,f477]) ).
fof(f651,plain,
( ~ ssList(sK51)
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5 ),
inference(forward_subsumption_resolution,[],[f650,f472]) ).
fof(f652,plain,
( $false
| ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5 ),
inference(forward_subsumption_resolution,[],[f651,f463]) ).
fof(f653,plain,
( ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5 ),
inference(avatar_contradiction_clause,[],[f652]) ).
cnf(s1,plain,
( spl52_1
| ~ spl52_2 ),
inference(sat_conversion,[],[f468]) ).
cnf(s2,plain,
( ~ spl52_2
| spl52_3 ),
inference(sat_conversion,[],[f473]) ).
cnf(s3,plain,
( ~ spl52_2
| spl52_4 ),
inference(sat_conversion,[],[f478]) ).
cnf(s4,plain,
( ~ spl52_2
| spl52_5 ),
inference(sat_conversion,[],[f483]) ).
cnf(s5,plain,
( spl52_6
| ~ spl52_7 ),
inference(sat_conversion,[],[f492]) ).
cnf(s6,plain,
( ~ spl52_6
| ~ spl52_7 ),
inference(sat_conversion,[],[f493]) ).
cnf(s14,plain,
spl52_8,
inference(sat_conversion,[],[f523]) ).
cnf(s17,plain,
( spl52_2
| spl52_7
| ~ spl52_8 ),
inference(sat_conversion,[],[f641]) ).
cnf(s18,plain,
( ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5 ),
inference(sat_conversion,[],[f653]) ).
cnf(s22,plain,
~ spl52_7,
inference(rat,[],[s5,s6]) ).
cnf(s23,plain,
spl52_2,
inference(rat,[],[s17,s14,s22]) ).
cnf(s24,plain,
spl52_5,
inference(rat,[],[s4,s23]) ).
cnf(s25,plain,
spl52_4,
inference(rat,[],[s3,s23]) ).
cnf(s26,plain,
spl52_3,
inference(rat,[],[s2,s23]) ).
cnf(s27,plain,
spl52_1,
inference(rat,[],[s1,s23]) ).
cnf(s28,plain,
$false,
inference(rat,[],[s18,s24,s27,s25,s26]) ).
fof(f654,plain,
$false,
inference(avatar_sat_refutation,[],[s28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC069+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.11/0.38 % Computer : n019.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 07:43:18 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.16/0.48 % (3835938)Will run a generic schedule for satisfiability detection.
% 0.16/0.48 % (3835948)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3922522984:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48 % (3835944)% WARNING: option uhcvi not known.
% 0.16/0.48 % (3835943)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4141114977_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.48 % (3835944)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2734580702:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.48 % (3835945)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3780994754:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.48 % (3835946)dis+10_1_sil=32000:sp=arity:random_seed=1569377665:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.48 % (3835947)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2895909046:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.48 % (3835949)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2692916789:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.48 % (3835947) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3835938-3835947"...
% 0.16/0.48 % TRYING [1]
% 0.16/0.48 % (3835946) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3835938-3835946"...
% 0.16/0.48 % (3835944) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3835938-3835944"...
% 0.16/0.48 % TRYING [2]
% 0.16/0.48 % (3835947)...printing done.
% 0.16/0.48 % (3835946)...printing done.
% 0.16/0.48 % (3835944)...printing done.
% 0.16/0.48 % (3835947)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 % (3835947)------------------------------
% 0.16/0.48 % (3835947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (3835947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (3835947)CaDiCaL version: 2.1.3
% 0.16/0.48 % (3835947)Termination reason: Refutation
% 0.16/0.48 % (3835947)Time elapsed: 0.015 s
% 0.16/0.48 % (3835947)Peak memory usage: 13 MB
% 0.16/0.48 % (3835947)Instructions burned: 23 (million)
% 0.16/0.48 % (3835938)Success in time 0.052 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------