%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC121+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:45 PM UTC 2026
% Result : Theorem 0.13s 0.48s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 3 unt; 0 def)
% Number of atoms : 92 ( 12 equ)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 108 ( 34 ~; 32 |; 34 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 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)
| ~ neq(X2,nil)
| ~ segmentP(X3,X2)
| ( neq(X0,nil)
& 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)
| ~ neq(X2,nil)
| ~ segmentP(X3,X2)
| ( neq(X0,nil)
& 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)
& neq(X2,nil)
& segmentP(X3,X2)
& ( ~ neq(X0,nil)
| ~ 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)
& neq(X2,nil)
& segmentP(X3,X2)
& ( ~ neq(X0,nil)
| ~ 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)
& neq(sK55,nil)
& segmentP(sK56,sK55)
& ( ~ neq(sK53,nil)
| ~ 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,
( ~ neq(sK53,nil)
| ~ segmentP(sK54,sK53)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ~ neq(sK53,nil)
| ~ segmentP(sK54,sK53)
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( segmentP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( segmentP(sK56,sK55)
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( neq(sK55,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( neq(sK55,nil)
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f512,plain,
( neq(sK55,nil)
| neq(sK56,nil) ),
inference(definition_unfolding,[],[f505,f509]) ).
fof(f513,plain,
( segmentP(sK56,sK55)
| neq(sK56,nil) ),
inference(definition_unfolding,[],[f503,f509]) ).
fof(f514,plain,
( ~ neq(sK55,nil)
| ~ segmentP(sK56,sK55)
| neq(sK56,nil) ),
inference(definition_unfolding,[],[f501,f508,f509,f508,f509]) ).
fof(f515,plain,
( ~ neq(sK55,nil)
| ~ segmentP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(definition_unfolding,[],[f500,f508,f509,f508]) ).
fof(f554,plain,
$false,
inference(global_subsumption,[],[f512,f504,f513,f502,f514,f515]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC121+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.37 % Computer : n014.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 07:59:31 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41 Running first-order model finding
% 0.13/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.48 % (1619157)Will run a generic schedule for satisfiability detection.
% 0.13/0.48 % (1619169)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3542275109_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.48 % (1619170)% WARNING: option uhcvi not known.
% 0.13/0.48 % (1619174)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2044857114:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.48 % (1619173)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1861745529:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.48 % (1619170)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2567057651:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.48 % (1619172)dis+10_1_sil=32000:sp=arity:random_seed=1473332189:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.48 % (1619171)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1807819469:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.48 % TRYING [1]
% 0.13/0.48 % TRYING [2]
% 0.13/0.48 % (1619171) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1619157-1619171"...
% 0.13/0.48 % (1619172) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1619157-1619172"...
% 0.13/0.48 % (1619170) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1619157-1619170"...
% 0.13/0.48 % TRYING [3]
% 0.13/0.48 % (1619171)...printing done.
% 0.13/0.48 % (1619172)...printing done.
% 0.13/0.48 % (1619170)...printing done.
% 0.13/0.48 % (1619171)Refutation found. Thanks to Tanya!
% 0.13/0.48 % SZS status Theorem for theBenchmark
% 0.13/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.48 % (1619171)------------------------------
% 0.13/0.48 % (1619171)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.48 % (1619171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.48 % (1619171)CaDiCaL version: 2.1.3
% 0.13/0.48 % (1619171)Termination reason: Refutation
% 0.13/0.48 % (1619171)Time elapsed: 0.009 s
% 0.13/0.48 % (1619171)Peak memory usage: 11 MB
% 0.13/0.48 % (1619171)Instructions burned: 8 (million)
% 0.13/0.48 % (1619157)Success in time 0.054 s
% 0.13/0.48 % Vampire exiting
%------------------------------------------------------------------------------