%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC028+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 : 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:21 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 12 unt; 5 def)
% Number of atoms : 186 ( 57 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 205 ( 81 ~; 78 |; 26 &)
% ( 9 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 20 !; 8 ?)
% 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(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,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
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(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(f167,plain,
! [X0] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(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
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f304,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(f354,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f411,plain,
( nil = sK47
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( nil != sK48
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( neq(sK49,nil)
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( rearsegP(sK50,sK49)
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
( nil != sK50
| nil != sK49 ),
inference(definition_unfolding,[],[f412,f419,f418]) ).
fof(f426,plain,
( nil = sK49
| nil = sK50 ),
inference(definition_unfolding,[],[f411,f418,f419]) ).
fof(f441,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f501,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| neq(X1,X1) ),
inference(consistent_polarity_flipping,[],[f441]) ).
fof(f563,plain,
( ~ neq(sK49,nil)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f414]) ).
fof(f569,plain,
! [X1] :
( neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f501]) ).
fof(f573,definition,
( spl51_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f575,plain,
( nil = sK50
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f573]) ).
fof(f577,definition,
( spl51_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f578,plain,
( nil != sK49
| spl51_2 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f579,plain,
( nil = sK49
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f580,plain,
( spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f426,f577,f573]) ).
fof(f581,plain,
( ~ spl51_2
| ~ spl51_1 ),
inference(avatar_split_clause,[],[f425,f573,f577]) ).
fof(f583,definition,
( spl51_3
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f585,plain,
( ~ neq(sK49,nil)
| spl51_3 ),
inference(avatar_component_clause,[],[f583]) ).
fof(f587,plain,
( spl51_1
| ~ spl51_3 ),
inference(avatar_split_clause,[],[f563,f583,f573]) ).
fof(f589,definition,
( spl51_4
<=> rearsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f591,plain,
( rearsegP(sK50,sK49)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f589]) ).
fof(f592,plain,
( spl51_2
| spl51_4 ),
inference(avatar_split_clause,[],[f415,f589,f577]) ).
fof(f599,definition,
( spl51_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f600,plain,
( ssList(nil)
| ~ spl51_6 ),
inference(avatar_component_clause,[],[f599]) ).
fof(f628,plain,
spl51_6,
inference(avatar_split_clause,[],[f306,f599]) ).
fof(f631,plain,
( ~ neq(nil,nil)
| ~ spl51_2
| spl51_3 ),
inference(forward_demodulation,[],[f585,f579]) ).
fof(f633,plain,
( ~ ssList(nil)
| ~ spl51_2
| spl51_3 ),
inference(resolution,[],[f569,f631]) ).
fof(f634,plain,
( $false
| ~ spl51_2
| spl51_3
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f633,f600]) ).
fof(f635,plain,
( ~ spl51_2
| spl51_3
| ~ spl51_6 ),
inference(avatar_contradiction_clause,[],[f634]) ).
fof(f637,plain,
( rearsegP(nil,sK49)
| ~ spl51_1
| ~ spl51_4 ),
inference(forward_demodulation,[],[f591,f575]) ).
fof(f686,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl51_1
| ~ spl51_4 ),
inference(resolution,[],[f354,f637]) ).
fof(f689,plain,
( ~ ssList(sK49)
| ~ spl51_1
| spl51_2
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f686,f578]) ).
fof(f690,plain,
( $false
| ~ spl51_1
| spl51_2
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f689,f420]) ).
fof(f691,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_4 ),
inference(avatar_contradiction_clause,[],[f690]) ).
cnf(s1,plain,
( spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f580]) ).
cnf(s2,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f581]) ).
cnf(s4,plain,
( spl51_1
| ~ spl51_3 ),
inference(sat_conversion,[],[f587]) ).
cnf(s5,plain,
( spl51_2
| spl51_4 ),
inference(sat_conversion,[],[f592]) ).
cnf(s15,plain,
spl51_6,
inference(sat_conversion,[],[f628]) ).
cnf(s17,plain,
( ~ spl51_2
| spl51_3
| ~ spl51_6 ),
inference(sat_conversion,[],[f635]) ).
cnf(s18,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_4 ),
inference(sat_conversion,[],[f691]) ).
cnf(s23,plain,
spl51_1,
inference(rat,[],[s17,s1,s4,s15]) ).
cnf(s24,plain,
~ spl51_2,
inference(rat,[],[s2,s23]) ).
cnf(s25,plain,
~ spl51_4,
inference(rat,[],[s18,s23,s24]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s5,s25,s24]) ).
fof(f692,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC028+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.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 07:32:43 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39 Running first-order model finding
% 0.09/0.39 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.44 % (1408399)Will run a generic schedule for satisfiability detection.
% 0.09/0.44 % (1408405)% WARNING: option uhcvi not known.
% 0.09/0.44 % (1408404)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1680916792_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.44 % (1408410)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1453200271:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.44 % (1408405)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2834389562:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.44 % (1408406)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3788778129:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.44 % (1408407)dis+10_1_sil=32000:sp=arity:random_seed=670795934:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.44 % (1408409)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1022152750:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.44 % (1408408)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2827976321:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.44 % (1408405) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1408399-1408405"...
% 0.09/0.44 % (1408405)...printing done.
% 0.09/0.44 % (1408405)Refutation found. Thanks to Tanya!
% 0.09/0.44 % SZS status Theorem for theBenchmark
% 0.09/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.44 % (1408405)------------------------------
% 0.09/0.44 % (1408405)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.44 % (1408405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.44 % (1408405)CaDiCaL version: 2.1.3
% 0.09/0.44 % (1408405)Termination reason: Refutation
% 0.09/0.44 % (1408405)Time elapsed: 0.006 s
% 0.09/0.44 % (1408405)Peak memory usage: 13 MB
% 0.09/0.44 % (1408405)Instructions burned: 15 (million)
% 0.09/0.44 % (1408399)Success in time 0.041 s
% 0.09/0.44 % Vampire exiting
%------------------------------------------------------------------------------