%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC132+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 : n003.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:48 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 18 unt; 2 def)
% Number of atoms : 86 ( 17 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 83 ( 33 ~; 22 |; 14 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 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 : 22 ( 0 sgn 14 !; 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] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f363,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f411,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
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(f421,plain,
~ cyclefreeP(sK50),
inference(definition_unfolding,[],[f412,f415]) ).
fof(f527,plain,
~ cyclefreeP(nil),
inference(consistent_polarity_flipping,[],[f363]) ).
fof(f557,plain,
cyclefreeP(sK50),
inference(consistent_polarity_flipping,[],[f421]) ).
fof(f570,definition,
( spl51_2
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f571,plain,
( ssList(nil)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f599,plain,
spl51_2,
inference(avatar_split_clause,[],[f306,f570]) ).
fof(f677,plain,
( ~ ssList(nil)
| nil = sK50
| ~ ssList(sK50) ),
inference(resolution,[],[f303,f413]) ).
fof(f682,plain,
( nil = sK50
| ~ ssList(sK50)
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f677,f571]) ).
fof(f683,plain,
( nil = sK50
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f682,f411]) ).
fof(f711,definition,
( spl51_9
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_9])],[avatar_definition]) ).
fof(f713,plain,
( nil = sK50
| ~ spl51_9 ),
inference(avatar_component_clause,[],[f711]) ).
fof(f800,plain,
( spl51_9
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f683,f570,f711]) ).
fof(f817,plain,
( cyclefreeP(nil)
| ~ spl51_9 ),
inference(superposition,[],[f557,f713]) ).
fof(f829,plain,
( $false
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f817,f527]) ).
fof(f830,plain,
~ spl51_9,
inference(avatar_contradiction_clause,[],[f829]) ).
cnf(s9,plain,
spl51_2,
inference(sat_conversion,[],[f599]) ).
cnf(s20,plain,
( ~ spl51_2
| spl51_9 ),
inference(sat_conversion,[],[f800]) ).
cnf(s22,plain,
~ spl51_9,
inference(sat_conversion,[],[f830]) ).
cnf(s24,plain,
~ spl51_2,
inference(rat,[],[s20,s22]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s9,s24]) ).
fof(f831,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC132+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.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 08:05:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.46 % (1421966)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (1421972)% WARNING: option uhcvi not known.
% 0.11/0.46 % (1421972)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1468944108:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46 % (1421971)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2855198910_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46 % (1421972) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1421966-1421972"...
% 0.11/0.46 % (1421973)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2048407000:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46 % (1421974)dis+10_1_sil=32000:sp=arity:random_seed=3036364718:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (1421975)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=794376908:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (1421977)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=273566915:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.46 % (1421976)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=425997573:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46 % (1421972)...printing done.
% 0.11/0.46 % (1421972)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (1421972)------------------------------
% 0.11/0.46 % (1421972)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (1421972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (1421972)CaDiCaL version: 2.1.3
% 0.11/0.46 % (1421972)Termination reason: Refutation
% 0.11/0.46 % (1421972)Time elapsed: 0.008 s
% 0.11/0.46 % (1421972)Peak memory usage: 13 MB
% 0.11/0.46 % (1421972)Instructions burned: 19 (million)
% 0.11/0.46 % (1421966)Success in time 0.046 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------