%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC349+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:03:34 PM UTC 2026
% Result : Theorem 0.20s 1.14s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 62 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 62 ( 18 ~; 11 |; 24 &)
% ( 0 <=>; 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 : 20 ( 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X2
| X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| frontsegP(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)
=> ( nil != X2
| X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| frontsegP(X1,X0) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X2
& X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ frontsegP(X1,X0)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X2
& X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ frontsegP(X1,X0)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f100]) ).
fof(f104,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f113,plain,
( nil = sK2
& sK1 = sK3
& sK0 = sK2
& neq(sK1,nil)
& ~ frontsegP(sK1,sK0)
& 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)],[f101]) ).
fof(f120,plain,
ssList(sK1),
inference(cnf_transformation,[],[f113]) ).
fof(f123,plain,
~ frontsegP(sK1,sK0),
inference(cnf_transformation,[],[f113]) ).
fof(f125,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f113]) ).
fof(f126,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f113]) ).
fof(f127,plain,
nil = sK2,
inference(cnf_transformation,[],[f113]) ).
fof(f133,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f142,plain,
~ frontsegP(sK3,sK2),
inference(definition_unfolding,[],[f123,f126,f125]) ).
fof(f143,plain,
ssList(sK3),
inference(definition_unfolding,[],[f120,f126]) ).
fof(f148,plain,
! [X0] :
( frontsegP(X0,sK2)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f133,f127]) ).
fof(f156,plain,
~ ssList(sK3),
inference(resolution,[],[f148,f142]) ).
fof(f159,plain,
$false,
inference(forward_subsumption_resolution,[],[f156,f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC349+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n015.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:15:46 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/1.14 % (2493780)Detected formulas, will run a generic FOF schedule.
% 0.20/1.14 % (2493788)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2639248783:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.20/1.14 % (2493788)First to succeed.
% 0.20/1.14 % (2493788)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2493780"
% 0.20/1.14 % (2493790)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4264970485:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.20/1.14 % (2493789)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2224239575:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.20/1.14 % (2493786)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=88727834:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.20/1.14 % (2493791)dis-21_1_sil=8000:lcm=predicate:random_seed=2331893346: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)
% 0.20/1.14 % (2493785)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=32031726:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.20/1.14 % (2493787)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=1044755761:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.20/1.14 % (2493789)Also succeeded, but the first one will report.
% 0.20/1.14 % (2493790)Also succeeded, but the first one will report.
% 0.20/1.14 % (2493791)Also succeeded, but the first one will report.
% 0.20/1.14 % (2493788)Refutation found. Thanks to Tanya!
% 0.20/1.14 % SZS status Theorem for theBenchmark
% 0.20/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.14 % (2493788)------------------------------
% 0.20/1.14 % (2493788)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.14 % (2493788)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.14 % (2493788)CaDiCaL version: 2.1.3
% 0.20/1.14 % (2493788)Termination reason: Refutation
% 0.20/1.14 % (2493788)Time elapsed: 0.002 s
% 0.20/1.14 % (2493788)Peak memory usage: 89 MB
% 0.20/1.14 % (2493788)Instructions burned: 2 (million)
% 0.20/1.14 % (2493788)------------------------------
% 0.20/1.14 % (2493788)------------------------------
% 0.20/1.14 % (2493780)Success in time 0.29 s
% 0.20/1.14 % Vampire exiting
%------------------------------------------------------------------------------