%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC038+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 : n011.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:02:09 PM UTC 2026
% Result : Theorem 3.64s 1.49s
% Output : Refutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 93 ( 45 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 100 ( 30 ~; 26 |; 33 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 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 : 21 ( 13 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f102,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f131,plain,
( nil = sK1
& sK1 = sK3
& sK0 = sK2
& nil != sK0
& ( ( nil = sK3
& nil = sK2 )
| ( neq(sK2,nil)
& frontsegP(sK3,sK2) ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f134,plain,
! [X0] :
( ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f146,plain,
ssList(sK2),
inference(cnf_transformation,[],[f131]) ).
fof(f148,plain,
( nil = sK2
| frontsegP(sK3,sK2) ),
inference(cnf_transformation,[],[f131]) ).
fof(f152,plain,
nil != sK0,
inference(cnf_transformation,[],[f131]) ).
fof(f153,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f131]) ).
fof(f154,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f131]) ).
fof(f155,plain,
nil = sK1,
inference(cnf_transformation,[],[f131]) ).
fof(f161,plain,
! [X0] :
( nil = X0
| ~ frontsegP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f196,plain,
nil = sK3,
inference(definition_unfolding,[],[f155,f154]) ).
fof(f197,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f152,f196,f153]) ).
fof(f201,plain,
( sK2 = sK3
| frontsegP(sK3,sK2) ),
inference(definition_unfolding,[],[f148,f196]) ).
fof(f206,plain,
! [X0] :
( ~ frontsegP(sK3,X0)
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f161,f196,f196]) ).
fof(f230,plain,
frontsegP(sK3,sK2),
inference(forward_subsumption_resolution,[],[f201,f197]) ).
fof(f231,plain,
( sK2 = sK3
| ~ ssList(sK2) ),
inference(resolution,[],[f206,f230]) ).
fof(f234,plain,
~ ssList(sK2),
inference(forward_subsumption_resolution,[],[f231,f197]) ).
fof(f235,plain,
$false,
inference(forward_subsumption_resolution,[],[f234,f146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC038+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n011.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:32:35 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 3.64/1.49 % (3227865)Detected formulas, will run a generic FOF schedule.
% 3.64/1.49 % (3227871)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=615729934:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.64/1.49 % (3227875)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3063657921:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.64/1.49 % (3227874)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2989477169:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.64/1.49 % (3227876)dis-21_1_sil=8000:lcm=predicate:random_seed=1412594178: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)
% 3.64/1.49 % (3227873)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1873812051:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.64/1.49 % (3227870)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=4224404549:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.64/1.49 % (3227872)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=697423055:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.64/1.49 % (3227874)First to succeed.
% 3.64/1.49 % (3227873)Also succeeded, but the first one will report.
% 3.64/1.49 % (3227874)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3227865"
% 3.64/1.49 % (3227876)Also succeeded, but the first one will report.
% 3.64/1.49 % (3227875)Also succeeded, but the first one will report.
% 3.64/1.49 % (3227874)Refutation found. Thanks to Tanya!
% 3.64/1.49 % SZS status Theorem for theBenchmark
% 3.64/1.49 % SZS output start Proof for theBenchmark
% See solution above
% 3.64/1.49 % (3227874)------------------------------
% 3.64/1.49 % (3227874)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.64/1.49 % (3227874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.64/1.49 % (3227874)CaDiCaL version: 2.1.3
% 3.64/1.49 % (3227874)Termination reason: Refutation
% 3.64/1.49 % (3227874)Time elapsed: 0.003 s
% 3.64/1.49 % (3227874)Peak memory usage: 88 MB
% 3.64/1.49 % (3227874)Instructions burned: 3 (million)
% 3.64/1.49 % (3227874)------------------------------
% 3.64/1.49 % (3227874)------------------------------
% 3.64/1.49 % (3227865)Success in time 0.438 s
% 3.64/1.49 % Vampire exiting
%------------------------------------------------------------------------------