%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC207+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 : n001.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:06 PM UTC 2026
% Result : Theorem 0.09s 0.46s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 17 unt; 5 def)
% Number of atoms : 188 ( 48 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 211 ( 85 ~; 73 |; 32 &)
% ( 7 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 25 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| neq(X0,nil)
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X3,X5)
& leq(X4,X5) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/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(X1,nil)
| neq(X0,nil)
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X3,X5)
& leq(X4,X5) ) ) )
& ( nil != X3
| nil != 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(f120,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ neq(X0,nil)
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ neq(X0,nil)
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4) )
| ( nil = X3
& nil = 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(f307,plain,
! [X0,X1] :
( ~ ssItem(X1)
| ~ ssList(X0)
| cons(X1,X0) != X0 ),
inference(cnf_transformation,[],[f120]) ).
fof(f413,plain,
( nil = sK50
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( nil = sK50
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
~ neq(sK47,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f429,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f421,f423]) ).
fof(f430,plain,
~ neq(sK49,nil),
inference(definition_unfolding,[],[f420,f422]) ).
fof(f467,definition,
( spl52_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f468,plain,
( nil != sK49
| spl52_2 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f469,plain,
( nil = sK49
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f472,definition,
( spl52_3
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f474,plain,
( nil = sK50
| ~ spl52_3 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f477,definition,
( spl52_4
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f479,plain,
( ssItem(sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f480,plain,
( spl52_4
| spl52_3 ),
inference(avatar_split_clause,[],[f413,f472,f477]) ).
fof(f487,definition,
( spl52_6
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f489,plain,
( sK49 = cons(sK51,nil)
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f487]) ).
fof(f490,plain,
( spl52_6
| spl52_3 ),
inference(avatar_split_clause,[],[f415,f472,f487]) ).
fof(f495,definition,
( spl52_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_7])],[avatar_definition]) ).
fof(f496,plain,
( ssList(nil)
| ~ spl52_7 ),
inference(avatar_component_clause,[],[f495]) ).
fof(f523,plain,
spl52_7,
inference(avatar_split_clause,[],[f306,f495]) ).
fof(f526,plain,
( ~ neq(nil,nil)
| ~ spl52_2 ),
inference(superposition,[],[f430,f469]) ).
fof(f528,plain,
( neq(nil,nil)
| ~ spl52_3 ),
inference(superposition,[],[f429,f474]) ).
fof(f530,plain,
( $false
| ~ spl52_2
| ~ spl52_3 ),
inference(forward_subsumption_resolution,[],[f528,f526]) ).
fof(f531,plain,
( ~ spl52_2
| ~ spl52_3 ),
inference(avatar_contradiction_clause,[],[f530]) ).
fof(f532,plain,
( nil = cons(sK51,nil)
| ~ spl52_2
| ~ spl52_6 ),
inference(forward_demodulation,[],[f489,f469]) ).
fof(f700,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(sK51,X0) != X0 )
| ~ spl52_4 ),
inference(resolution,[],[f307,f479]) ).
fof(f707,plain,
( sK49 != cons(sK51,sK49)
| ~ spl52_4 ),
inference(resolution,[],[f700,f424]) ).
fof(f709,plain,
( nil != cons(sK51,nil)
| ~ spl52_2
| ~ spl52_4 ),
inference(forward_demodulation,[],[f707,f469]) ).
fof(f712,plain,
( $false
| ~ spl52_2
| ~ spl52_4
| ~ spl52_6 ),
inference(forward_subsumption_resolution,[],[f709,f532]) ).
fof(f713,plain,
( ~ spl52_2
| ~ spl52_4
| ~ spl52_6 ),
inference(avatar_contradiction_clause,[],[f712]) ).
fof(f788,plain,
( ~ ssList(nil)
| nil = sK49
| ~ ssList(sK49) ),
inference(resolution,[],[f303,f430]) ).
fof(f793,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl52_7 ),
inference(forward_subsumption_resolution,[],[f788,f496]) ).
fof(f794,plain,
( ~ ssList(sK49)
| spl52_2
| ~ spl52_7 ),
inference(forward_subsumption_resolution,[],[f793,f468]) ).
fof(f795,plain,
( $false
| spl52_2
| ~ spl52_7 ),
inference(forward_subsumption_resolution,[],[f794,f424]) ).
fof(f796,plain,
( spl52_2
| ~ spl52_7 ),
inference(avatar_contradiction_clause,[],[f795]) ).
cnf(s3,plain,
( spl52_3
| spl52_4 ),
inference(sat_conversion,[],[f480]) ).
cnf(s5,plain,
( spl52_3
| spl52_6 ),
inference(sat_conversion,[],[f490]) ).
cnf(s16,plain,
spl52_7,
inference(sat_conversion,[],[f523]) ).
cnf(s17,plain,
( ~ spl52_2
| ~ spl52_3 ),
inference(sat_conversion,[],[f531]) ).
cnf(s19,plain,
( ~ spl52_2
| ~ spl52_4
| ~ spl52_6 ),
inference(sat_conversion,[],[f713]) ).
cnf(s21,plain,
( spl52_2
| ~ spl52_7 ),
inference(sat_conversion,[],[f796]) ).
cnf(s22,plain,
spl52_2,
inference(rat,[],[s21,s16]) ).
cnf(s23,plain,
~ spl52_3,
inference(rat,[],[s17,s22]) ).
cnf(s27,plain,
spl52_6,
inference(rat,[],[s5,s23]) ).
cnf(s28,plain,
~ spl52_4,
inference(rat,[],[s19,s22,s27]) ).
cnf(s30,plain,
$false,
inference(rat,[],[s3,s28,s23]) ).
fof(f797,plain,
$false,
inference(avatar_sat_refutation,[],[s30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC207+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n001.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 08:33:18 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41 Running first-order model finding
% 0.09/0.41 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.09/0.46 % (215124)Will run a generic schedule for satisfiability detection.
% 0.09/0.46 % (215133)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1285877942:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.46 % (215130)% WARNING: option uhcvi not known.
% 0.09/0.46 % (215132)dis+10_1_sil=32000:sp=arity:random_seed=1460337245:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.46 % (215134)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1712472959:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.46 % (215135)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1808062071:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.46 % (215130)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3086133070:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.46 % (215129)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1653988987_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.46 % (215131)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2064953365:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.46 % (215133) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-215124-215133"...
% 0.09/0.46 % (215133)...printing done.
% 0.09/0.46 % (215133)Refutation found. Thanks to Tanya!
% 0.09/0.46 % SZS status Theorem for theBenchmark
% 0.09/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.46 % (215133)------------------------------
% 0.09/0.46 % (215133)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.46 % (215133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.46 % (215133)CaDiCaL version: 2.1.3
% 0.09/0.46 % (215133)Termination reason: Refutation
% 0.09/0.46 % (215133)Time elapsed: 0.011 s
% 0.09/0.46 % (215133)Peak memory usage: 13 MB
% 0.09/0.46 % (215133)Instructions burned: 31 (million)
% 0.09/0.46 % (215124)Success in time 0.038 s
% 0.09/0.46 % Vampire exiting
%------------------------------------------------------------------------------