%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC352+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 : n005.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:40 PM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 17 unt; 6 def)
% Number of atoms : 172 ( 33 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 183 ( 71 ~; 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 : 25 ( 0 sgn 17 !; 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(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| frontsegP(X1,X0)
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ frontsegP(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
| frontsegP(X1,X0)
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ frontsegP(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(f158,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ frontsegP(X1,X0)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( 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
& ~ frontsegP(X1,X0)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& 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(f346,plain,
! [X0] :
( ~ ssList(X0)
| nil != X0
| frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f411,plain,
( frontsegP(sK50,sK49)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
~ frontsegP(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(f423,plain,
~ frontsegP(sK50,sK49),
inference(definition_unfolding,[],[f415,f417,f416]) ).
fof(f441,plain,
( ~ ssList(nil)
| frontsegP(nil,nil) ),
inference(equality_resolution,[],[f346]) ).
fof(f457,definition,
( spl51_1
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f459,plain,
( ~ neq(sK50,nil)
| spl51_1 ),
inference(avatar_component_clause,[],[f457]) ).
fof(f461,definition,
( spl51_2
<=> frontsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f462,plain,
( ~ frontsegP(sK50,sK49)
| spl51_2 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f464,plain,
( ~ spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f411,f461,f457]) ).
fof(f471,definition,
( spl51_4
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f473,plain,
( nil = sK49
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f475,definition,
( spl51_5
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f476,plain,
( nil = sK50
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f477,plain,
( nil != sK50
| spl51_5 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f478,plain,
( spl51_4
| ~ spl51_5 ),
inference(avatar_split_clause,[],[f413,f475,f471]) ).
fof(f479,plain,
~ spl51_2,
inference(avatar_split_clause,[],[f423,f461]) ).
fof(f481,definition,
( spl51_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f482,plain,
( ssList(nil)
| ~ spl51_6 ),
inference(avatar_component_clause,[],[f481]) ).
fof(f505,definition,
( spl51_11
<=> frontsegP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl51_11])],[avatar_definition]) ).
fof(f507,plain,
( frontsegP(nil,nil)
| ~ spl51_11 ),
inference(avatar_component_clause,[],[f505]) ).
fof(f508,plain,
( spl51_11
| ~ spl51_6 ),
inference(avatar_split_clause,[],[f441,f481,f505]) ).
fof(f509,plain,
spl51_6,
inference(avatar_split_clause,[],[f306,f481]) ).
fof(f611,plain,
( ~ ssList(nil)
| nil = sK50
| ~ ssList(sK50)
| spl51_1 ),
inference(resolution,[],[f303,f459]) ).
fof(f616,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_1
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f611,f482]) ).
fof(f617,plain,
( ~ ssList(sK50)
| spl51_1
| spl51_5
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f616,f477]) ).
fof(f618,plain,
( $false
| spl51_1
| spl51_5
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f617,f414]) ).
fof(f619,plain,
( spl51_1
| spl51_5
| ~ spl51_6 ),
inference(avatar_contradiction_clause,[],[f618]) ).
fof(f623,plain,
( ~ frontsegP(sK50,nil)
| spl51_2
| ~ spl51_4 ),
inference(superposition,[],[f462,f473]) ).
fof(f625,plain,
( ~ frontsegP(nil,nil)
| spl51_2
| ~ spl51_4
| ~ spl51_5 ),
inference(forward_demodulation,[],[f623,f476]) ).
fof(f626,plain,
( $false
| spl51_2
| ~ spl51_4
| ~ spl51_5
| ~ spl51_11 ),
inference(forward_subsumption_resolution,[],[f625,f507]) ).
fof(f627,plain,
( spl51_2
| ~ spl51_4
| ~ spl51_5
| ~ spl51_11 ),
inference(avatar_contradiction_clause,[],[f626]) ).
cnf(s1,plain,
( ~ spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f464]) ).
cnf(s3,plain,
( spl51_4
| ~ spl51_5 ),
inference(sat_conversion,[],[f478]) ).
cnf(s4,plain,
~ spl51_2,
inference(sat_conversion,[],[f479]) ).
cnf(s11,plain,
( ~ spl51_6
| spl51_11 ),
inference(sat_conversion,[],[f508]) ).
cnf(s12,plain,
spl51_6,
inference(sat_conversion,[],[f509]) ).
cnf(s14,plain,
( spl51_1
| spl51_5
| ~ spl51_6 ),
inference(sat_conversion,[],[f619]) ).
cnf(s15,plain,
( spl51_2
| ~ spl51_4
| ~ spl51_5
| ~ spl51_11 ),
inference(sat_conversion,[],[f627]) ).
cnf(s16,plain,
spl51_11,
inference(rat,[],[s11,s12]) ).
cnf(s19,plain,
~ spl51_1,
inference(rat,[],[s1,s4]) ).
cnf(s20,plain,
spl51_5,
inference(rat,[],[s14,s12,s19]) ).
cnf(s21,plain,
~ spl51_4,
inference(rat,[],[s15,s16,s4,s20]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s3,s20,s21]) ).
fof(f628,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC352+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.10/0.17 % Computer : n005.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 09:12:16 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 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.10/0.26 % (657121)Will run a generic schedule for satisfiability detection.
% 0.10/0.26 % (657132)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3986210521:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.26 % (657126)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3655112705_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.26 % (657129)dis+10_1_sil=32000:sp=arity:random_seed=3941472415:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.26 % (657128)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3609881180:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.26 % (657131)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=591295610:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.26 % (657130)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1195982740:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.26 % (657127)% WARNING: option uhcvi not known.
% 0.10/0.26 % (657127)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1551929447:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.26 % (657130) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-657121-657130"...
% 0.10/0.26 % (657130)...printing done.
% 0.10/0.26 % (657130)Refutation found. Thanks to Tanya!
% 0.10/0.26 % SZS status Theorem for theBenchmark
% 0.10/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.26 % (657130)------------------------------
% 0.10/0.26 % (657130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26 % (657130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26 % (657130)CaDiCaL version: 2.1.3
% 0.10/0.26 % (657130)Termination reason: Refutation
% 0.10/0.26 % (657130)Time elapsed: 0.008 s
% 0.10/0.26 % (657130)Peak memory usage: 13 MB
% 0.10/0.26 % (657130)Instructions burned: 23 (million)
% 0.10/0.26 % (657121)Success in time 0.044 s
% 0.10/0.26 % Vampire exiting
%------------------------------------------------------------------------------