%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC367+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 : n026.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:44 PM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 16 unt; 5 def)
% Number of atoms : 124 ( 29 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 126 ( 49 ~; 41 |; 20 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 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 : 19 ( 0 sgn 11 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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
| rearsegP(X1,X0)
| ( ( 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
| rearsegP(X1,X0)
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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
& ~ rearsegP(X1,X0)
& ( ( 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
& ~ rearsegP(X1,X0)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f353,plain,
! [X0] :
( ~ ssList(X0)
| nil != X0
| rearsegP(nil,X0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f413,plain,
( rearsegP(sK50,sK49)
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( rearsegP(sK50,sK49)
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
~ rearsegP(sK48,sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
~ rearsegP(sK50,sK49),
inference(definition_unfolding,[],[f416,f418,f417]) ).
fof(f443,plain,
( ~ ssList(nil)
| rearsegP(nil,nil) ),
inference(equality_resolution,[],[f353]) ).
fof(f501,plain,
( ~ ssList(nil)
| ~ rearsegP(nil,nil) ),
inference(consistent_polarity_flipping,[],[f443]) ).
fof(f530,plain,
rearsegP(sK50,sK49),
inference(consistent_polarity_flipping,[],[f424]) ).
fof(f531,plain,
( ~ rearsegP(sK50,sK49)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f414]) ).
fof(f532,plain,
( ~ rearsegP(sK50,sK49)
| nil = sK49 ),
inference(consistent_polarity_flipping,[],[f413]) ).
fof(f541,definition,
( spl51_1
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f543,plain,
( nil = sK49
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f550,definition,
( spl51_3
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f552,plain,
( nil = sK50
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f550]) ).
fof(f555,definition,
( spl51_4
<=> rearsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f556,plain,
( rearsegP(sK50,sK49)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f555]) ).
fof(f558,plain,
( spl51_1
| ~ spl51_4 ),
inference(avatar_split_clause,[],[f532,f555,f541]) ).
fof(f559,plain,
( spl51_3
| ~ spl51_4 ),
inference(avatar_split_clause,[],[f531,f555,f550]) ).
fof(f560,plain,
spl51_4,
inference(avatar_split_clause,[],[f530,f555]) ).
fof(f566,definition,
( spl51_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f586,definition,
( spl51_10
<=> rearsegP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl51_10])],[avatar_definition]) ).
fof(f589,plain,
( ~ spl51_10
| ~ spl51_6 ),
inference(avatar_split_clause,[],[f501,f566,f586]) ).
fof(f595,plain,
spl51_6,
inference(avatar_split_clause,[],[f306,f566]) ).
fof(f600,plain,
( rearsegP(sK50,nil)
| ~ spl51_1
| ~ spl51_4 ),
inference(forward_demodulation,[],[f556,f543]) ).
fof(f601,plain,
( rearsegP(nil,nil)
| ~ spl51_1
| ~ spl51_3
| ~ spl51_4 ),
inference(forward_demodulation,[],[f600,f552]) ).
fof(f602,plain,
( spl51_10
| ~ spl51_1
| ~ spl51_3
| ~ spl51_4 ),
inference(avatar_split_clause,[],[f601,f555,f550,f541,f586]) ).
cnf(s3,plain,
( spl51_1
| ~ spl51_4 ),
inference(sat_conversion,[],[f558]) ).
cnf(s4,plain,
( spl51_3
| ~ spl51_4 ),
inference(sat_conversion,[],[f559]) ).
cnf(s5,plain,
spl51_4,
inference(sat_conversion,[],[f560]) ).
cnf(s12,plain,
( ~ spl51_6
| ~ spl51_10 ),
inference(sat_conversion,[],[f589]) ).
cnf(s14,plain,
spl51_6,
inference(sat_conversion,[],[f595]) ).
cnf(s17,plain,
( ~ spl51_1
| ~ spl51_3
| ~ spl51_4
| spl51_10 ),
inference(sat_conversion,[],[f602]) ).
cnf(s19,plain,
~ spl51_10,
inference(rat,[],[s12,s14]) ).
cnf(s22,plain,
spl51_3,
inference(rat,[],[s4,s5]) ).
cnf(s23,plain,
~ spl51_1,
inference(rat,[],[s17,s19,s5,s22]) ).
cnf(s24,plain,
$false,
inference(rat,[],[s3,s5,s23]) ).
fof(f603,plain,
$false,
inference(avatar_sat_refutation,[],[s24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC367+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.07/0.19 % Computer : n026.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 09:22:56 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.23 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.19/0.28 % (3715665)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (3715670)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2347352553_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % (3715671)% WARNING: option uhcvi not known.
% 0.19/0.28 % (3715673)dis+10_1_sil=32000:sp=arity:random_seed=2256394642:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (3715671)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4256476729:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % TRYING [1]
% 0.19/0.28 % (3715672)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1595907263:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (3715674)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=980636160:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % (3715675)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3636123195:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28 % TRYING [2]
% 0.19/0.28 % (3715676)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1115931964:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28 % TRYING [3]
% 0.19/0.28 % (3715671) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3715665-3715671"...
% 0.19/0.28 % (3715673) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3715665-3715673"...
% 0.19/0.28 % (3715672) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3715665-3715672"...
% 0.19/0.28 % (3715671)...printing done.
% 0.19/0.28 % (3715673)...printing done.
% 0.19/0.28 % (3715671)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (3715671)------------------------------
% 0.19/0.28 % (3715671)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (3715671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (3715671)CaDiCaL version: 2.1.3
% 0.19/0.28 % (3715671)Termination reason: Refutation
% 0.19/0.28 % (3715671)Time elapsed: 0.006 s
% 0.19/0.28 % (3715671)Peak memory usage: 13 MB
% 0.19/0.28 % (3715671)Instructions burned: 9 (million)
% 0.19/0.28 % (3715665)Success in time 0.047 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------