%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC362+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:03:38 PM UTC 2026
% Result : Theorem 2.29s 0.79s
% Output : Refutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 4 def)
% Number of atoms : 105 ( 12 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 105 ( 35 ~; 29 |; 29 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ~ segmentP(X3,X2)
| segmentP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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)
| ~ segmentP(X3,X2)
| segmentP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& segmentP(X3,X2)
& ~ segmentP(X1,X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& 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)
& segmentP(X3,X2)
& ~ segmentP(X1,X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ( ( neq(sK54,nil)
& segmentP(sK56,sK55)
& ~ segmentP(sK54,sK53) )
| ( neq(sK54,nil)
& ~ neq(sK56,nil) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f500,plain,
( ~ segmentP(sK54,sK53)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( segmentP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( neq(sK54,nil)
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f535,plain,
neq(sK54,nil),
inference(duplicate_literal_removal,[],[f505]) ).
fof(f544,definition,
( spl57_1
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f546,plain,
( ~ neq(sK56,nil)
| spl57_1 ),
inference(avatar_component_clause,[],[f544]) ).
fof(f548,definition,
( spl57_2
<=> segmentP(sK54,sK53) ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f551,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f500,f548,f544]) ).
fof(f553,definition,
( spl57_3
<=> neq(sK54,nil) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f558,definition,
( spl57_4
<=> segmentP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).
fof(f560,plain,
( segmentP(sK56,sK55)
| ~ spl57_4 ),
inference(avatar_component_clause,[],[f558]) ).
fof(f561,plain,
( ~ spl57_1
| spl57_4 ),
inference(avatar_split_clause,[],[f502,f558,f544]) ).
fof(f564,plain,
spl57_3,
inference(avatar_split_clause,[],[f535,f553]) ).
fof(f602,plain,
( ~ neq(sK54,nil)
| spl57_1 ),
inference(forward_demodulation,[],[f546,f507]) ).
fof(f603,plain,
( ~ spl57_3
| spl57_1 ),
inference(avatar_split_clause,[],[f602,f544,f553]) ).
fof(f605,plain,
( segmentP(sK56,sK53)
| ~ spl57_4 ),
inference(forward_demodulation,[],[f560,f506]) ).
fof(f607,plain,
( segmentP(sK54,sK53)
| ~ spl57_4 ),
inference(forward_demodulation,[],[f605,f507]) ).
fof(f608,plain,
( spl57_2
| ~ spl57_4 ),
inference(avatar_split_clause,[],[f607,f558,f548]) ).
cnf(s1,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(sat_conversion,[],[f551]) ).
cnf(s3,plain,
( ~ spl57_1
| spl57_4 ),
inference(sat_conversion,[],[f561]) ).
cnf(s6,plain,
spl57_3,
inference(sat_conversion,[],[f564]) ).
cnf(s16,plain,
( spl57_1
| ~ spl57_3 ),
inference(sat_conversion,[],[f603]) ).
cnf(s18,plain,
( spl57_2
| ~ spl57_4 ),
inference(sat_conversion,[],[f608]) ).
cnf(s23,plain,
spl57_1,
inference(rat,[],[s16,s6]) ).
cnf(s24,plain,
spl57_4,
inference(rat,[],[s3,s23]) ).
cnf(s25,plain,
spl57_2,
inference(rat,[],[s18,s24]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s1,s25,s23]) ).
fof(f609,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC362+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.17 % Computer : n020.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Mon Sep 28 09:18:49 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.21 Running first-order theorem proving
% 0.06/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.29/0.79 % (49887)Detected formulas, will run a generic FOF schedule.
% 2.29/0.79 % (49897)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2594622293:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.29/0.79 % (49897)First to succeed.
% 2.29/0.79 % (49897)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-49887"
% 2.29/0.79 % (49895)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1548893202:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.29/0.79 % (49896)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3653860552:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.29/0.79 % (49894)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=714868365:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.29/0.79 % (49898)dis-21_1_sil=8000:lcm=predicate:random_seed=2353958074:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.29/0.79 % (49893)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3668023151:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.29/0.79 % (49892)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=172716995:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.29/0.79 % (49896)Also succeeded, but the first one will report.
% 2.29/0.79 % (49895)Also succeeded, but the first one will report.
% 2.29/0.79 % (49898)Also succeeded, but the first one will report.
% 2.29/0.79 % (49897)Refutation found. Thanks to Tanya!
% 2.29/0.79 % SZS status Theorem for theBenchmark
% 2.29/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 2.29/0.79 % (49897)------------------------------
% 2.29/0.79 % (49897)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.29/0.79 % (49897)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/0.79 % (49897)CaDiCaL version: 2.1.3
% 2.29/0.79 % (49897)Termination reason: Refutation
% 2.29/0.79 % (49897)Time elapsed: 0.004 s
% 2.29/0.79 % (49897)Peak memory usage: 90 MB
% 2.29/0.79 % (49897)Instructions burned: 10 (million)
% 2.29/0.79 % (49897)------------------------------
% 2.29/0.79 % (49897)------------------------------
% 2.29/0.79 % (49887)Success in time 0.292 s
% 2.29/0.79 % Vampire exiting
%------------------------------------------------------------------------------