%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC369+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 : n020.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:44 PM UTC 2026
% Result : Theorem 0.11s 0.28s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 65 ( 21 unt; 6 def)
% Number of atoms : 177 ( 34 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 181 ( 69 ~; 69 |; 22 &)
% ( 10 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 19 !; 8 ?)
% 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(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/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
| segmentP(X1,X0)
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) ) ) ) ) ) ),
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
| segmentP(X1,X0)
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) ) ) ) ) ) ),
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
& ~ segmentP(X1,X0)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& segmentP(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
& ~ segmentP(X1,X0)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f360,plain,
! [X0] :
( ~ ssList(X0)
| nil != X0
| segmentP(nil,X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f411,plain,
( segmentP(sK50,sK49)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
~ segmentP(sK48,sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
ssList(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK50),
inference(definition_unfolding,[],[f419,f417]) ).
fof(f423,plain,
~ segmentP(sK50,sK49),
inference(definition_unfolding,[],[f415,f417,f416]) ).
fof(f443,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f360]) ).
fof(f525,plain,
! [X0,X1] :
( neq(X0,X1)
| ssList(X1)
| X0 = X1
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f527,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f581,plain,
( ssList(nil)
| ~ segmentP(nil,nil) ),
inference(consistent_polarity_flipping,[],[f443]) ).
fof(f626,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f422]) ).
fof(f628,plain,
segmentP(sK50,sK49),
inference(consistent_polarity_flipping,[],[f423]) ).
fof(f630,plain,
( ~ segmentP(sK50,sK49)
| ~ neq(sK50,nil) ),
inference(consistent_polarity_flipping,[],[f411]) ).
fof(f639,definition,
( spl51_1
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f641,plain,
( ~ neq(sK50,nil)
| spl51_1 ),
inference(avatar_component_clause,[],[f639]) ).
fof(f643,definition,
( spl51_2
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f644,plain,
( segmentP(sK50,sK49)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f643]) ).
fof(f646,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f630,f643,f639]) ).
fof(f653,definition,
( spl51_4
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f655,plain,
( nil = sK49
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f653]) ).
fof(f657,definition,
( spl51_5
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f658,plain,
( nil = sK50
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f657]) ).
fof(f660,plain,
( spl51_4
| ~ spl51_5 ),
inference(avatar_split_clause,[],[f413,f657,f653]) ).
fof(f661,plain,
spl51_2,
inference(avatar_split_clause,[],[f628,f643]) ).
fof(f667,definition,
( spl51_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).
fof(f668,plain,
( ~ ssList(nil)
| spl51_7 ),
inference(avatar_component_clause,[],[f667]) ).
fof(f682,definition,
( spl51_10
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl51_10])],[avatar_definition]) ).
fof(f684,plain,
( ~ segmentP(nil,nil)
| spl51_10 ),
inference(avatar_component_clause,[],[f682]) ).
fof(f685,plain,
( ~ spl51_10
| spl51_7 ),
inference(avatar_split_clause,[],[f581,f667,f682]) ).
fof(f696,plain,
~ spl51_7,
inference(avatar_split_clause,[],[f527,f667]) ).
fof(f791,plain,
( ssList(nil)
| nil = sK50
| ssList(sK50)
| spl51_1 ),
inference(resolution,[],[f525,f641]) ).
fof(f796,plain,
( nil = sK50
| ssList(sK50)
| spl51_1
| spl51_7 ),
inference(forward_subsumption_resolution,[],[f791,f668]) ).
fof(f800,plain,
( nil = sK50
| spl51_1
| spl51_7 ),
inference(forward_subsumption_resolution,[],[f796,f626]) ).
fof(f801,plain,
( spl51_5
| spl51_1
| spl51_7 ),
inference(avatar_split_clause,[],[f800,f667,f639,f657]) ).
fof(f808,plain,
( segmentP(nil,sK49)
| ~ spl51_2
| ~ spl51_5 ),
inference(superposition,[],[f644,f658]) ).
fof(f813,plain,
( segmentP(nil,nil)
| ~ spl51_2
| ~ spl51_4
| ~ spl51_5 ),
inference(forward_demodulation,[],[f808,f655]) ).
fof(f814,plain,
( $false
| ~ spl51_2
| ~ spl51_4
| ~ spl51_5
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f813,f684]) ).
fof(f815,plain,
( ~ spl51_2
| ~ spl51_4
| ~ spl51_5
| spl51_10 ),
inference(avatar_contradiction_clause,[],[f814]) ).
cnf(s1,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f646]) ).
cnf(s3,plain,
( spl51_4
| ~ spl51_5 ),
inference(sat_conversion,[],[f660]) ).
cnf(s4,plain,
spl51_2,
inference(sat_conversion,[],[f661]) ).
cnf(s10,plain,
( spl51_7
| ~ spl51_10 ),
inference(sat_conversion,[],[f685]) ).
cnf(s13,plain,
~ spl51_7,
inference(sat_conversion,[],[f696]) ).
cnf(s16,plain,
( spl51_1
| spl51_5
| spl51_7 ),
inference(sat_conversion,[],[f801]) ).
cnf(s18,plain,
( ~ spl51_2
| ~ spl51_4
| ~ spl51_5
| spl51_10 ),
inference(sat_conversion,[],[f815]) ).
cnf(s21,plain,
~ spl51_10,
inference(rat,[],[s10,s13]) ).
cnf(s23,plain,
~ spl51_1,
inference(rat,[],[s1,s4]) ).
cnf(s24,plain,
spl51_5,
inference(rat,[],[s16,s13,s23]) ).
cnf(s25,plain,
~ spl51_4,
inference(rat,[],[s18,s21,s4,s24]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s3,s24,s25]) ).
fof(f816,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC369+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.19 % Computer : n020.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Mon Sep 28 09:21:19 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.22 Running first-order model finding
% 0.11/0.22 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.11/0.28 % (51184)Will run a generic schedule for satisfiability detection.
% 0.11/0.28 % (51189)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3648019279_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.28 % (51190)% WARNING: option uhcvi not known.
% 0.11/0.28 % TRYING [1]
% 0.11/0.28 % (51191)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3369591164:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.28 % (51192)dis+10_1_sil=32000:sp=arity:random_seed=3712525721:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.28 % (51193)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2505092262:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.28 % TRYING [2]
% 0.11/0.28 % (51194)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=641372302:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.28 % (51195)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=473711155:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.28 % (51190)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2370690387:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.28 % TRYING [3]
% 0.11/0.28 % TRYING [4]
% 0.11/0.28 % (51190) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-51184-51190"...
% 0.11/0.28 % (51193) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-51184-51193"...
% 0.11/0.28 % (51192) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-51184-51192"...
% 0.11/0.28 % (51190)...printing done.
% 0.11/0.28 % (51193)...printing done.
% 0.11/0.28 % (51192)...printing done.
% 0.11/0.28 % (51190)Refutation found. Thanks to Tanya!
% 0.11/0.28 % SZS status Theorem for theBenchmark
% 0.11/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.28 % (51190)------------------------------
% 0.11/0.28 % (51190)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.28 % (51190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.28 % (51190)CaDiCaL version: 2.1.3
% 0.11/0.28 % (51190)Termination reason: Refutation
% 0.11/0.28 % (51190)Time elapsed: 0.012 s
% 0.11/0.28 % (51190)Peak memory usage: 13 MB
% 0.11/0.28 % (51190)Instructions burned: 17 (million)
% 0.11/0.28 % (51184)Success in time 0.049 s
% 0.11/0.28 % Vampire exiting
%------------------------------------------------------------------------------