%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC333+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 : n015.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:35 PM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 59 ( 15 unt; 7 def)
% Number of atoms : 220 ( 10 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 278 ( 117 ~; 106 |; 38 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 13 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ segmentP(X3,X2)
| ~ totalorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& segmentP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X0,X5)
| ~ segmentP(X1,X5)
| ~ segmentP(X5,X0)
| ~ totalorderedP(X5) ) )
& segmentP(X1,X0)
& totalorderedP(X0) ) ) ) ) ) ),
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
| ~ segmentP(X3,X2)
| ~ totalorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& segmentP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X0,X5)
| ~ segmentP(X1,X5)
| ~ segmentP(X5,X0)
| ~ totalorderedP(X5) ) )
& segmentP(X1,X0)
& totalorderedP(X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& segmentP(X3,X2)
& totalorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ( ? [X5] :
( neq(X0,X5)
& segmentP(X1,X5)
& segmentP(X5,X0)
& totalorderedP(X5)
& ssList(X5) )
| ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& segmentP(X3,X2)
& totalorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ( ? [X5] :
( neq(X0,X5)
& segmentP(X1,X5)
& segmentP(X5,X0)
& totalorderedP(X5)
& ssList(X5) )
| ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f411,plain,
( ~ totalorderedP(sK47)
| ~ segmentP(sK48,sK47)
| ssList(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( ~ totalorderedP(sK47)
| ~ segmentP(sK48,sK47)
| totalorderedP(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( ~ totalorderedP(sK47)
| ~ segmentP(sK48,sK47)
| segmentP(sK51,sK47) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ totalorderedP(sK47)
| ~ segmentP(sK48,sK47)
| segmentP(sK48,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( ~ totalorderedP(sK47)
| ~ segmentP(sK48,sK47)
| neq(sK47,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
! [X4] :
( ~ neq(sK49,X4)
| ~ segmentP(X4,sK49)
| ~ segmentP(sK50,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
totalorderedP(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
segmentP(sK50,sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
( ~ totalorderedP(sK49)
| ~ segmentP(sK50,sK49)
| neq(sK49,sK51) ),
inference(definition_unfolding,[],[f415,f420,f421,f420,f420]) ).
fof(f428,plain,
( ~ totalorderedP(sK49)
| ~ segmentP(sK50,sK49)
| segmentP(sK50,sK51) ),
inference(definition_unfolding,[],[f414,f420,f421,f420,f421]) ).
fof(f429,plain,
( ~ totalorderedP(sK49)
| ~ segmentP(sK50,sK49)
| segmentP(sK51,sK49) ),
inference(definition_unfolding,[],[f413,f420,f421,f420,f420]) ).
fof(f430,plain,
( ~ totalorderedP(sK49)
| ~ segmentP(sK50,sK49)
| totalorderedP(sK51) ),
inference(definition_unfolding,[],[f412,f420,f421,f420]) ).
fof(f431,plain,
( ~ totalorderedP(sK49)
| ~ segmentP(sK50,sK49)
| ssList(sK51) ),
inference(definition_unfolding,[],[f411,f420,f421,f420]) ).
fof(f465,definition,
( spl52_1
<=> ssList(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f467,plain,
( ssList(sK51)
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f465]) ).
fof(f469,definition,
( spl52_2
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f473,definition,
( spl52_3
<=> totalorderedP(sK49) ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f476,plain,
( spl52_1
| ~ spl52_2
| ~ spl52_3 ),
inference(avatar_split_clause,[],[f431,f473,f469,f465]) ).
fof(f478,definition,
( spl52_4
<=> totalorderedP(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f480,plain,
( totalorderedP(sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f478]) ).
fof(f481,plain,
( spl52_4
| ~ spl52_2
| ~ spl52_3 ),
inference(avatar_split_clause,[],[f430,f473,f469,f478]) ).
fof(f483,definition,
( spl52_5
<=> segmentP(sK51,sK49) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f485,plain,
( segmentP(sK51,sK49)
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f483]) ).
fof(f486,plain,
( spl52_5
| ~ spl52_2
| ~ spl52_3 ),
inference(avatar_split_clause,[],[f429,f473,f469,f483]) ).
fof(f488,definition,
( spl52_6
<=> segmentP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f490,plain,
( segmentP(sK50,sK51)
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f488]) ).
fof(f491,plain,
( spl52_6
| ~ spl52_2
| ~ spl52_3 ),
inference(avatar_split_clause,[],[f428,f473,f469,f488]) ).
fof(f493,definition,
( spl52_7
<=> neq(sK49,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_7])],[avatar_definition]) ).
fof(f495,plain,
( neq(sK49,sK51)
| ~ spl52_7 ),
inference(avatar_component_clause,[],[f493]) ).
fof(f496,plain,
( spl52_7
| ~ spl52_2
| ~ spl52_3 ),
inference(avatar_split_clause,[],[f427,f473,f469,f493]) ).
fof(f497,plain,
spl52_3,
inference(avatar_split_clause,[],[f418,f473]) ).
fof(f498,plain,
spl52_2,
inference(avatar_split_clause,[],[f419,f469]) ).
fof(f531,plain,
( ~ segmentP(sK51,sK49)
| ~ segmentP(sK50,sK51)
| ~ totalorderedP(sK51)
| ~ ssList(sK51)
| ~ spl52_7 ),
inference(resolution,[],[f416,f495]) ).
fof(f532,plain,
( ~ segmentP(sK50,sK51)
| ~ totalorderedP(sK51)
| ~ ssList(sK51)
| ~ spl52_5
| ~ spl52_7 ),
inference(forward_subsumption_resolution,[],[f531,f485]) ).
fof(f533,plain,
( ~ totalorderedP(sK51)
| ~ ssList(sK51)
| ~ spl52_5
| ~ spl52_6
| ~ spl52_7 ),
inference(forward_subsumption_resolution,[],[f532,f490]) ).
fof(f534,plain,
( ~ ssList(sK51)
| ~ spl52_4
| ~ spl52_5
| ~ spl52_6
| ~ spl52_7 ),
inference(forward_subsumption_resolution,[],[f533,f480]) ).
fof(f535,plain,
( $false
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5
| ~ spl52_6
| ~ spl52_7 ),
inference(forward_subsumption_resolution,[],[f534,f467]) ).
fof(f536,plain,
( ~ spl52_1
| ~ spl52_4
| ~ spl52_5
| ~ spl52_6
| ~ spl52_7 ),
inference(avatar_contradiction_clause,[],[f535]) ).
cnf(s1,plain,
( spl52_1
| ~ spl52_2
| ~ spl52_3 ),
inference(sat_conversion,[],[f476]) ).
cnf(s2,plain,
( ~ spl52_2
| ~ spl52_3
| spl52_4 ),
inference(sat_conversion,[],[f481]) ).
cnf(s3,plain,
( ~ spl52_2
| ~ spl52_3
| spl52_5 ),
inference(sat_conversion,[],[f486]) ).
cnf(s4,plain,
( ~ spl52_2
| ~ spl52_3
| spl52_6 ),
inference(sat_conversion,[],[f491]) ).
cnf(s5,plain,
( ~ spl52_2
| ~ spl52_3
| spl52_7 ),
inference(sat_conversion,[],[f496]) ).
cnf(s6,plain,
spl52_3,
inference(sat_conversion,[],[f497]) ).
cnf(s7,plain,
spl52_2,
inference(sat_conversion,[],[f498]) ).
cnf(s16,plain,
( ~ spl52_1
| ~ spl52_4
| ~ spl52_5
| ~ spl52_6
| ~ spl52_7 ),
inference(sat_conversion,[],[f536]) ).
cnf(s20,plain,
spl52_7,
inference(rat,[],[s5,s6,s7]) ).
cnf(s21,plain,
spl52_6,
inference(rat,[],[s4,s6,s7]) ).
cnf(s22,plain,
spl52_5,
inference(rat,[],[s3,s6,s7]) ).
cnf(s23,plain,
spl52_4,
inference(rat,[],[s2,s6,s7]) ).
cnf(s24,plain,
~ spl52_1,
inference(rat,[],[s16,s20,s21,s22,s23]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s1,s6,s7,s24]) ).
fof(f537,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC333+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.08/0.20 % Computer : n015.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 09:12:02 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/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.20/0.28 % (2488022)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (2488031)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3556202828:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (2488028)% WARNING: option uhcvi not known.
% 0.20/0.28 % (2488031) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2488022-2488031"...
% 0.20/0.28 % (2488029)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2747099428:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (2488027)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3665075733_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % (2488028)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1915565035:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (2488030)dis+10_1_sil=32000:sp=arity:random_seed=1525714103:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (2488031)...printing done.
% 0.20/0.28 % (2488032)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=625520910:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % (2488033)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1375529113:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (2488031)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29 % (2488031)------------------------------
% 0.20/0.29 % (2488031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (2488031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (2488031)CaDiCaL version: 2.1.3
% 0.20/0.29 % (2488031)Termination reason: Refutation
% 0.20/0.29 % (2488031)Time elapsed: 0.006 s
% 0.20/0.29 % (2488031)Peak memory usage: 13 MB
% 0.20/0.29 % (2488031)Instructions burned: 19 (million)
% 0.20/0.29 % (2488022)Success in time 0.044 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------