%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC051+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 : n002.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:27 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 14 unt; 3 def)
% Number of atoms : 145 ( 18 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 151 ( 51 ~; 58 |; 30 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 17 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ( ~ 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
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f163,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( 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
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f350,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f411,plain,
! [X4] :
( ~ rearsegP(sK47,X4)
| ~ rearsegP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( rearsegP(sK50,sK49)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( neq(sK49,nil)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
ssList(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK49),
inference(definition_unfolding,[],[f421,f417]) ).
fof(f424,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f416,f418]) ).
fof(f425,plain,
! [X4] :
( ~ rearsegP(sK49,X4)
| ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f411,f417,f418]) ).
fof(f571,plain,
! [X0] :
( ~ rearsegP(X0,X0)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f350]) ).
fof(f622,plain,
~ ssList(sK49),
inference(consistent_polarity_flipping,[],[f422]) ).
fof(f625,plain,
~ neq(sK50,nil),
inference(consistent_polarity_flipping,[],[f424]) ).
fof(f627,plain,
( ~ neq(sK49,nil)
| neq(sK50,nil) ),
inference(consistent_polarity_flipping,[],[f413]) ).
fof(f628,plain,
( ~ rearsegP(sK50,sK49)
| neq(sK50,nil) ),
inference(consistent_polarity_flipping,[],[f412]) ).
fof(f629,plain,
! [X4] :
( neq(X4,nil)
| rearsegP(sK50,X4)
| rearsegP(sK49,X4)
| ssList(X4) ),
inference(consistent_polarity_flipping,[],[f425]) ).
fof(f638,definition,
( spl51_1
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f642,definition,
( spl51_2
<=> rearsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f644,plain,
( ~ rearsegP(sK50,sK49)
| spl51_2 ),
inference(avatar_component_clause,[],[f642]) ).
fof(f645,plain,
( spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f628,f642,f638]) ).
fof(f647,definition,
( spl51_3
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f649,plain,
( ~ neq(sK49,nil)
| spl51_3 ),
inference(avatar_component_clause,[],[f647]) ).
fof(f650,plain,
( spl51_1
| ~ spl51_3 ),
inference(avatar_split_clause,[],[f627,f647,f638]) ).
fof(f660,plain,
~ spl51_1,
inference(avatar_split_clause,[],[f625,f638]) ).
fof(f697,plain,
( rearsegP(sK50,sK49)
| rearsegP(sK49,sK49)
| ssList(sK49)
| spl51_3 ),
inference(resolution,[],[f629,f649]) ).
fof(f698,plain,
( rearsegP(sK49,sK49)
| ssList(sK49)
| spl51_2
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f697,f644]) ).
fof(f700,plain,
( rearsegP(sK49,sK49)
| spl51_2
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f698,f622]) ).
fof(f710,plain,
( ssList(sK49)
| spl51_2
| spl51_3 ),
inference(resolution,[],[f571,f700]) ).
fof(f711,plain,
( $false
| spl51_2
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f710,f622]) ).
fof(f712,plain,
( spl51_2
| spl51_3 ),
inference(avatar_contradiction_clause,[],[f711]) ).
cnf(s1,plain,
( spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f645]) ).
cnf(s2,plain,
( spl51_1
| ~ spl51_3 ),
inference(sat_conversion,[],[f650]) ).
cnf(s4,plain,
~ spl51_1,
inference(sat_conversion,[],[f660]) ).
cnf(s15,plain,
( spl51_2
| spl51_3 ),
inference(sat_conversion,[],[f712]) ).
cnf(s20,plain,
~ spl51_3,
inference(rat,[],[s2,s4]) ).
cnf(s21,plain,
spl51_2,
inference(rat,[],[s15,s20]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s1,s21,s4]) ).
fof(f713,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC051+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.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 07:40:23 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.16/0.47 % (187217)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (187222)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=601806916_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % (187223)% WARNING: option uhcvi not known.
% 0.16/0.47 % (187223)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=507610702:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (187224)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1040980886:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (187225)dis+10_1_sil=32000:sp=arity:random_seed=3004197931:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (187226)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1858982534:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % (187228)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4225153556:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % (187227)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=544580906:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % TRYING [3]
% 0.16/0.47 % (187223) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-187217-187223"...
% 0.16/0.47 % (187225) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-187217-187225"...
% 0.16/0.47 % (187223)...printing done.
% 0.16/0.47 % (187225)...printing done.
% 0.16/0.47 % (187223)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (187223)------------------------------
% 0.16/0.47 % (187223)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (187223)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (187223)CaDiCaL version: 2.1.3
% 0.16/0.47 % (187223)Termination reason: Refutation
% 0.16/0.47 % (187223)Time elapsed: 0.007 s
% 0.16/0.47 % (187223)Peak memory usage: 12 MB
% 0.16/0.47 % (187223)Instructions burned: 10 (million)
% 0.16/0.47 % (187217)Success in time 0.046 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------