%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC130+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 : n007.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:47 PM UTC 2026
% Result : Theorem 0.50s 0.58s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 22 unt; 2 def)
% Number of atoms : 94 ( 18 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 83 ( 30 ~; 25 |; 14 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 24 ( 0 sgn 16 !; 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(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax60) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| neq(X3,nil)
| cyclefreeP(X1) ) ) ) ) ),
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
| neq(X3,nil)
| cyclefreeP(X1) ) ) ) ) ),
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
& ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& 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(f363,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f412,plain,
~ cyclefreeP(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
~ neq(sK50,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
ssList(sK50),
inference(definition_unfolding,[],[f417,f415]) ).
fof(f421,plain,
~ cyclefreeP(sK50),
inference(definition_unfolding,[],[f412,f415]) ).
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(f579,plain,
~ cyclefreeP(nil),
inference(consistent_polarity_flipping,[],[f363]) ).
fof(f615,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f420]) ).
fof(f617,plain,
neq(sK50,nil),
inference(consistent_polarity_flipping,[],[f413]) ).
fof(f618,plain,
cyclefreeP(sK50),
inference(consistent_polarity_flipping,[],[f421]) ).
fof(f632,definition,
( spl51_2
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f633,plain,
( ~ ssList(nil)
| spl51_2 ),
inference(avatar_component_clause,[],[f632]) ).
fof(f661,plain,
~ spl51_2,
inference(avatar_split_clause,[],[f527,f632]) ).
fof(f753,definition,
( spl51_9
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_9])],[avatar_definition]) ).
fof(f755,plain,
( nil = sK50
| ~ spl51_9 ),
inference(avatar_component_clause,[],[f753]) ).
fof(f763,plain,
( ssList(nil)
| nil = sK50
| ssList(sK50) ),
inference(resolution,[],[f525,f617]) ).
fof(f768,plain,
( nil = sK50
| ssList(sK50)
| spl51_2 ),
inference(forward_subsumption_resolution,[],[f763,f633]) ).
fof(f769,plain,
( nil = sK50
| spl51_2 ),
inference(forward_subsumption_resolution,[],[f768,f615]) ).
fof(f770,plain,
( spl51_9
| spl51_2 ),
inference(avatar_split_clause,[],[f769,f632,f753]) ).
fof(f923,plain,
( cyclefreeP(nil)
| ~ spl51_9 ),
inference(superposition,[],[f618,f755]) ).
fof(f928,plain,
( $false
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f923,f579]) ).
fof(f929,plain,
~ spl51_9,
inference(avatar_contradiction_clause,[],[f928]) ).
cnf(s9,plain,
~ spl51_2,
inference(sat_conversion,[],[f661]) ).
cnf(s11,plain,
( spl51_2
| spl51_9 ),
inference(sat_conversion,[],[f770]) ).
cnf(s17,plain,
~ spl51_9,
inference(sat_conversion,[],[f929]) ).
cnf(s20,plain,
spl51_2,
inference(rat,[],[s11,s17]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s9,s20]) ).
fof(f930,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC130+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.44 % Computer : n007.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Mon Sep 28 08:01:10 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.21/0.49 Running first-order model finding
% 0.21/0.50 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.50/0.58 % (2235466)Will run a generic schedule for satisfiability detection.
% 0.50/0.58 % (2235471)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1948271981_2999 on theBenchmark for (2999ds/0Mi)
% 0.50/0.58 % (2235473)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1405034629:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.50/0.58 % (2235472)% WARNING: option uhcvi not known.
% 0.50/0.58 % TRYING [1]
% 0.50/0.58 % TRYING [2]
% 0.50/0.58 % (2235475)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=44413461:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.50/0.58 % (2235472)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=146297232:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.50/0.58 % (2235474)dis+10_1_sil=32000:sp=arity:random_seed=3044243356:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.50/0.58 % (2235476)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2628210261:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.50/0.58 % (2235477)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1795907313:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.50/0.58 % TRYING [3]
% 0.50/0.58 % TRYING [4]
% 0.50/0.58 % (2235472) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2235466-2235472"...
% 0.50/0.58 % (2235474) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2235466-2235474"...
% 0.50/0.58 % (2235474)...printing done.
% 0.50/0.58 % (2235472)...printing done.
% 0.50/0.58 % (2235475) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2235466-2235475"...
% 0.50/0.58 % (2235472)Refutation found. Thanks to Tanya!
% 0.50/0.58 % SZS status Theorem for theBenchmark
% 0.50/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.58 % (2235472)------------------------------
% 0.50/0.58 % (2235472)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.50/0.58 % (2235472)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.50/0.58 % (2235472)CaDiCaL version: 2.1.3
% 0.50/0.58 % (2235472)Termination reason: Refutation
% 0.50/0.58 % (2235472)Time elapsed: 0.024 s
% 0.50/0.58 % (2235472)Peak memory usage: 13 MB
% 0.50/0.58 % (2235472)Instructions burned: 22 (million)
% 0.50/0.58 % (2235466)Success in time 0.069 s
% 0.50/0.58 % Vampire exiting
%------------------------------------------------------------------------------