%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC217-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:08 PM UTC 2026
% Result : Unsatisfiable 0.30s 0.40s
% Output : Refutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 57 ( 22 unt; 5 def)
% Number of atoms : 115 ( 19 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 103 ( 45 ~; 53 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f98,axiom,
! [X0,X1] :
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f200,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f209,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,plain,
( sk3 = cons(sk5,nil)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f210]) ).
fof(f213,plain,
ssList(sk3),
inference(definition_unfolding,[],[f200,f205]) ).
fof(f215,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f216,plain,
~ neq(sk3,nil),
inference(definition_unfolding,[],[f207,f205]) ).
fof(f246,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f334,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ssItem(X0)
| ssList(X1) ),
inference(consistent_polarity_flipping,[],[f99]) ).
fof(f336,plain,
! [X0,X1] :
( ~ neq(X1,X0)
| ssList(X1)
| ssList(X0)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f102]) ).
fof(f422,plain,
~ ssList(sk3),
inference(consistent_polarity_flipping,[],[f213]) ).
fof(f426,plain,
~ neq(sk4,nil),
inference(consistent_polarity_flipping,[],[f215]) ).
fof(f427,plain,
neq(sk3,nil),
inference(consistent_polarity_flipping,[],[f216]) ).
fof(f428,plain,
( ~ ssItem(sk5)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f209]) ).
fof(f429,plain,
( sk3 = cons(sk5,nil)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f211]) ).
fof(f438,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f447,definition,
( spl0_3
<=> sk3 = cons(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f449,plain,
( sk3 = cons(sk5,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f447]) ).
fof(f450,plain,
( spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f429,f447,f438]) ).
fof(f452,definition,
( spl0_4
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f454,plain,
( ~ ssItem(sk5)
| spl0_4 ),
inference(avatar_component_clause,[],[f452]) ).
fof(f455,plain,
( spl0_1
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f428,f452,f438]) ).
fof(f461,definition,
( spl0_6
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f463,plain,
( nil = sk3
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f465,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f426,f438]) ).
fof(f471,definition,
( spl0_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f472,plain,
( ~ ssList(nil)
| spl0_8 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f507,plain,
~ spl0_8,
inference(avatar_split_clause,[],[f246,f471]) ).
fof(f701,plain,
( ssList(sk3)
| ssList(nil)
| nil = sk3 ),
inference(resolution,[],[f336,f427]) ).
fof(f704,plain,
( ssList(nil)
| nil = sk3 ),
inference(forward_subsumption_resolution,[],[f701,f422]) ).
fof(f705,plain,
( nil = sk3
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f704,f472]) ).
fof(f708,plain,
( spl0_6
| spl0_8 ),
inference(avatar_split_clause,[],[f705,f471,f461]) ).
fof(f747,plain,
( nil != sk3
| ssItem(sk5)
| ssList(nil)
| ~ spl0_3 ),
inference(superposition,[],[f334,f449]) ).
fof(f748,plain,
( ssItem(sk5)
| ssList(nil)
| ~ spl0_3
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f747,f463]) ).
fof(f749,plain,
( ssList(nil)
| ~ spl0_3
| spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f748,f454]) ).
fof(f750,plain,
( $false
| ~ spl0_3
| spl0_4
| ~ spl0_6
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f749,f472]) ).
fof(f751,plain,
( ~ spl0_3
| spl0_4
| ~ spl0_6
| spl0_8 ),
inference(avatar_contradiction_clause,[],[f750]) ).
cnf(s2,plain,
( spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f450]) ).
cnf(s3,plain,
( spl0_1
| ~ spl0_4 ),
inference(sat_conversion,[],[f455]) ).
cnf(s5,plain,
~ spl0_1,
inference(sat_conversion,[],[f465]) ).
cnf(s15,plain,
~ spl0_8,
inference(sat_conversion,[],[f507]) ).
cnf(s18,plain,
( spl0_6
| spl0_8 ),
inference(sat_conversion,[],[f708]) ).
cnf(s19,plain,
( ~ spl0_3
| spl0_4
| ~ spl0_6
| spl0_8 ),
inference(sat_conversion,[],[f751]) ).
cnf(s20,plain,
spl0_6,
inference(rat,[],[s18,s15]) ).
cnf(s25,plain,
~ spl0_4,
inference(rat,[],[s3,s5]) ).
cnf(s26,plain,
~ spl0_3,
inference(rat,[],[s19,s15,s20,s25]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s2,s26,s5]) ).
fof(f752,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC217-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.27 % Computer : n009.cluster.edu
% 0.12/0.27 % Model : x86_64 x86_64
% 0.12/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.27 % Memory : 8046.5625MB
% 0.12/0.27 % OS : Linux 6.8.0-71-generic
% 0.12/0.27 % CPULimit : 300
% 0.12/0.27 % WCLimit : 300
% 0.12/0.27 % DateTime : Mon Sep 28 08:32:15 UTC 2026
% 0.12/0.28 % CPUTime :
% 0.12/0.28 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.26/0.32 Running first-order model finding
% 0.26/0.32 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.40 % (2887067)Will run a generic schedule for satisfiability detection.
% 0.30/0.40 % (2887077)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1847392100:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.30/0.40 % (2887073)% WARNING: option uhcvi not known.
% 0.30/0.40 % (2887073)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1501712360:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.30/0.40 % (2887076)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2533092072:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.30/0.40 % (2887075)dis+10_1_sil=32000:sp=arity:random_seed=336179959:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.30/0.40 % (2887074)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=364887049:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.30/0.40 % (2887078)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2575655604:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.30/0.40 % (2887072)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2156239816_2999 on theBenchmark for (2999ds/0Mi)
% 0.30/0.40 % (2887073) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2887067-2887073"...
% 0.30/0.40 % (2887075) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2887067-2887075"...
% 0.30/0.40 % (2887073)...printing done.
% 0.30/0.40 % (2887075)...printing done.
% 0.30/0.40 % (2887073)Refutation found. Thanks to Tanya!
% 0.30/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.30/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.30/0.40 % (2887073)------------------------------
% 0.30/0.40 % (2887073)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.40 % (2887073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.40 % (2887073)CaDiCaL version: 2.1.3
% 0.30/0.40 % (2887073)Termination reason: Refutation
% 0.30/0.40 % (2887073)Time elapsed: 0.018 s
% 0.30/0.40 % (2887073)Peak memory usage: 13 MB
% 0.30/0.40 % (2887073)Instructions burned: 16 (million)
% 0.30/0.40 % (2887067)Success in time 0.06 s
% 0.30/0.40 % Vampire exiting
%------------------------------------------------------------------------------