%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC049+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 : n016.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:12 PM UTC 2026
% Result : Theorem 2.71s 1.35s
% Output : Refutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 153 ( 45 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 198 ( 80 ~; 62 |; 43 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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 : 34 ( 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(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)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f106,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f130,plain,
( sK1 = sK3
& sK0 = sK2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4) )
& ( nil = sK2
| nil != sK3 )
& ( nil != sK1
| nil != sK0 )
& ( ~ neq(sK3,nil)
| ( neq(sK2,nil)
& rearsegP(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(f131,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f143,plain,
ssList(sK2),
inference(cnf_transformation,[],[f130]) ).
fof(f144,plain,
ssList(sK3),
inference(cnf_transformation,[],[f130]) ).
fof(f145,plain,
( rearsegP(sK3,sK2)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f130]) ).
fof(f146,plain,
( neq(sK2,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f130]) ).
fof(f147,plain,
( nil != sK1
| nil != sK0 ),
inference(cnf_transformation,[],[f130]) ).
fof(f148,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f149,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f150,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f151,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f153,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f156,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f161,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f189,plain,
! [X4] :
( ~ rearsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ rearsegP(sK2,X4) ),
inference(definition_unfolding,[],[f149,f151,f150]) ).
fof(f190,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f147,f151,f150]) ).
fof(f202,plain,
nil != sK3,
inference(forward_subsumption_resolution,[],[f190,f148]) ).
fof(f203,plain,
( ~ neq(sK2,nil)
| ~ ssList(sK2)
| ~ rearsegP(sK2,sK2)
| ~ neq(sK3,nil) ),
inference(resolution,[],[f189,f145]) ).
fof(f204,plain,
( ~ ssList(sK2)
| ~ rearsegP(sK2,sK2)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f203,f146]) ).
fof(f205,plain,
( ~ rearsegP(sK2,sK2)
| ~ neq(sK3,nil) ),
inference(forward_subsumption_resolution,[],[f204,f143]) ).
fof(f210,plain,
( ~ ssList(sK2)
| ~ neq(sK3,nil) ),
inference(resolution,[],[f161,f205]) ).
fof(f212,plain,
~ neq(sK3,nil),
inference(forward_subsumption_resolution,[],[f210,f143]) ).
fof(f224,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(resolution,[],[f153,f212]) ).
fof(f231,plain,
( ~ ssList(nil)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f224,f202]) ).
fof(f232,plain,
~ ssList(sK3),
inference(forward_subsumption_resolution,[],[f231,f156]) ).
fof(f233,plain,
$false,
inference(forward_subsumption_resolution,[],[f232,f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC049+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.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 07:41:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.71/1.35 % (3458092)Detected formulas, will run a generic FOF schedule.
% 2.71/1.35 % (3458101)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=958725846:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.71/1.35 % (3458101)First to succeed.
% 2.71/1.35 % (3458101)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3458092"
% 2.71/1.35 % (3458103)dis-21_1_sil=8000:lcm=predicate:random_seed=4180626649: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.71/1.35 % (3458098)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=564406629:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.71/1.35 % (3458099)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=1967631232:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.71/1.35 % (3458097)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=2851622300:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.71/1.35 % (3458100)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1720364926:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.71/1.35 % (3458102)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3943862314:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.71/1.35 % (3458100)Also succeeded, but the first one will report.
% 2.71/1.35 % (3458102)Also succeeded, but the first one will report.
% 2.71/1.35 % (3458103)Also succeeded, but the first one will report.
% 2.71/1.35 % (3458101)Refutation found. Thanks to Tanya!
% 2.71/1.35 % SZS status Theorem for theBenchmark
% 2.71/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 2.71/1.35 % (3458101)------------------------------
% 2.71/1.35 % (3458101)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.35 % (3458101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.35 % (3458101)CaDiCaL version: 2.1.3
% 2.71/1.35 % (3458101)Termination reason: Refutation
% 2.71/1.35 % (3458101)Time elapsed: 0.002 s
% 2.71/1.35 % (3458101)Peak memory usage: 88 MB
% 2.71/1.35 % (3458101)Instructions burned: 4 (million)
% 2.71/1.35 % (3458101)------------------------------
% 2.71/1.35 % (3458101)------------------------------
% 2.71/1.35 % (3458092)Success in time 0.299 s
% 2.71/1.35 % Vampire exiting
%------------------------------------------------------------------------------