%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC385+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 : n001.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:49 PM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 72 ( 12 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 83 ( 25 ~; 19 |; 31 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 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)
| ( ~ singletonP(X2)
& neq(X3,nil) )
| ( singletonP(X0)
& segmentP(X1,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
| ~ neq(X1,nil)
| ~ segmentP(X3,X2)
| ( ~ singletonP(X2)
& neq(X3,nil) )
| ( singletonP(X0)
& segmentP(X1,X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& segmentP(X3,X2)
& ( singletonP(X2)
| ~ neq(X3,nil) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& 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)
& ( singletonP(X2)
| ~ neq(X3,nil) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& segmentP(sK56,sK55)
& ( singletonP(sK55)
| ~ neq(sK56,nil) )
& ( ~ singletonP(sK53)
| ~ segmentP(sK54,sK53) )
& 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,
( ~ singletonP(sK53)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( singletonP(sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f503,f505]) ).
fof(f507,plain,
( ~ singletonP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f500,f504,f505,f504]) ).
fof(f544,plain,
$false,
inference(global_subsumption,[],[f506,f502,f501,f507]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC385+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n001.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 09:29:17 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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 % (240744)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (240751)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3179431685:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (240751) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-240744-240751"...
% 0.20/0.28 % (240750)% WARNING: option uhcvi not known.
% 0.20/0.28 % (240751)...printing done.
% 0.20/0.28 % (240751)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.28 % (240751)------------------------------
% 0.20/0.28 % (240751)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (240751)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (240751)CaDiCaL version: 2.1.3
% 0.20/0.28 % (240751)Termination reason: Refutation
% 0.20/0.28 % (240751)Time elapsed: 0.003 s
% 0.20/0.28 % (240751)Peak memory usage: 11 MB
% 0.20/0.28 % (240751)Instructions burned: 8 (million)
% 0.20/0.28 % (240744)Success in time 0.043 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------