%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC333+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 : n019.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:30 PM UTC 2026
% Result : Theorem 3.70s 1.29s
% Output : Refutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 165 ( 12 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 208 ( 78 ~; 69 |; 51 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 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 : 26 ( 14 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ segmentP(X3,X2)
| ~ totalorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& segmentP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X0,X5)
| ~ segmentP(X1,X5)
| ~ segmentP(X5,X0)
| ~ totalorderedP(X5) ) )
& segmentP(X1,X0)
& totalorderedP(X0) ) ) ) ) ) ),
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
| ~ segmentP(X3,X2)
| ~ totalorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& segmentP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X0,X5)
| ~ segmentP(X1,X5)
| ~ segmentP(X5,X0)
| ~ totalorderedP(X5) ) )
& segmentP(X1,X0)
& totalorderedP(X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& segmentP(X3,X2)
& totalorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ( ? [X5] :
( neq(X0,X5)
& segmentP(X1,X5)
& segmentP(X5,X0)
& totalorderedP(X5)
& ssList(X5) )
| ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& segmentP(X3,X2)
& totalorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ( ? [X5] :
( neq(X0,X5)
& segmentP(X1,X5)
& segmentP(X5,X0)
& totalorderedP(X5)
& ssList(X5) )
| ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f146,plain,
( sK1 = sK3
& sK0 = sK2
& segmentP(sK3,sK2)
& totalorderedP(sK2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ segmentP(X4,sK2)
| ~ totalorderedP(X4) )
& ( ( neq(sK0,sK4)
& segmentP(sK1,sK4)
& segmentP(sK4,sK0)
& totalorderedP(sK4)
& ssList(sK4) )
| ~ segmentP(sK1,sK0)
| ~ totalorderedP(sK0) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4)],[f99]) ).
fof(f167,plain,
( ssList(sK4)
| ~ segmentP(sK1,sK0)
| ~ totalorderedP(sK0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f168,plain,
( totalorderedP(sK4)
| ~ segmentP(sK1,sK0)
| ~ totalorderedP(sK0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f169,plain,
( segmentP(sK4,sK0)
| ~ segmentP(sK1,sK0)
| ~ totalorderedP(sK0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f170,plain,
( segmentP(sK1,sK4)
| ~ segmentP(sK1,sK0)
| ~ totalorderedP(sK0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f171,plain,
( neq(sK0,sK4)
| ~ segmentP(sK1,sK0)
| ~ totalorderedP(sK0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f172,plain,
! [X4] :
( ~ segmentP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4)
| ~ segmentP(X4,sK2)
| ~ totalorderedP(X4) ),
inference(cnf_transformation,[],[f146]) ).
fof(f173,plain,
totalorderedP(sK2),
inference(cnf_transformation,[],[f146]) ).
fof(f174,plain,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f146]) ).
fof(f175,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f146]) ).
fof(f176,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f146]) ).
fof(f238,plain,
( neq(sK2,sK4)
| ~ segmentP(sK3,sK2)
| ~ totalorderedP(sK2) ),
inference(definition_unfolding,[],[f171,f175,f176,f175,f175]) ).
fof(f239,plain,
( segmentP(sK3,sK4)
| ~ segmentP(sK3,sK2)
| ~ totalorderedP(sK2) ),
inference(definition_unfolding,[],[f170,f176,f176,f175,f175]) ).
fof(f240,plain,
( segmentP(sK4,sK2)
| ~ segmentP(sK3,sK2)
| ~ totalorderedP(sK2) ),
inference(definition_unfolding,[],[f169,f175,f176,f175,f175]) ).
fof(f241,plain,
( totalorderedP(sK4)
| ~ segmentP(sK3,sK2)
| ~ totalorderedP(sK2) ),
inference(definition_unfolding,[],[f168,f176,f175,f175]) ).
fof(f242,plain,
( ssList(sK4)
| ~ segmentP(sK3,sK2)
| ~ totalorderedP(sK2) ),
inference(definition_unfolding,[],[f167,f176,f175,f175]) ).
fof(f257,plain,
( totalorderedP(sK4)
| ~ totalorderedP(sK2) ),
inference(forward_subsumption_resolution,[],[f241,f174]) ).
fof(f258,plain,
totalorderedP(sK4),
inference(forward_subsumption_resolution,[],[f257,f173]) ).
fof(f259,plain,
( ssList(sK4)
| ~ totalorderedP(sK2) ),
inference(forward_subsumption_resolution,[],[f242,f174]) ).
fof(f260,plain,
ssList(sK4),
inference(forward_subsumption_resolution,[],[f259,f173]) ).
fof(f261,plain,
( neq(sK2,sK4)
| ~ totalorderedP(sK2) ),
inference(forward_subsumption_resolution,[],[f238,f174]) ).
fof(f262,plain,
neq(sK2,sK4),
inference(forward_subsumption_resolution,[],[f261,f173]) ).
fof(f263,plain,
( segmentP(sK3,sK4)
| ~ totalorderedP(sK2) ),
inference(forward_subsumption_resolution,[],[f239,f174]) ).
fof(f264,plain,
segmentP(sK3,sK4),
inference(forward_subsumption_resolution,[],[f263,f173]) ).
fof(f265,plain,
( segmentP(sK4,sK2)
| ~ totalorderedP(sK2) ),
inference(forward_subsumption_resolution,[],[f240,f174]) ).
fof(f266,plain,
segmentP(sK4,sK2),
inference(forward_subsumption_resolution,[],[f265,f173]) ).
fof(f268,plain,
( ~ neq(sK2,sK4)
| ~ ssList(sK4)
| ~ segmentP(sK4,sK2)
| ~ totalorderedP(sK4) ),
inference(resolution,[],[f172,f264]) ).
fof(f269,plain,
( ~ ssList(sK4)
| ~ segmentP(sK4,sK2)
| ~ totalorderedP(sK4) ),
inference(forward_subsumption_resolution,[],[f268,f262]) ).
fof(f271,plain,
( ~ segmentP(sK4,sK2)
| ~ totalorderedP(sK4) ),
inference(forward_subsumption_resolution,[],[f269,f260]) ).
fof(f273,plain,
~ totalorderedP(sK4),
inference(forward_subsumption_resolution,[],[f271,f266]) ).
fof(f274,plain,
$false,
inference(forward_subsumption_resolution,[],[f273,f258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC333+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.08/0.17 % Computer : n019.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:09:40 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 Running first-order theorem proving
% 0.08/0.20 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.70/1.29 % (3865368)Detected formulas, will run a generic FOF schedule.
% 3.70/1.29 % (3865374)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=1653688965:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.70/1.29 % (3865373)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=3511733939:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.70/1.29 % (3865378)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=346269520:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.70/1.29 % (3865376)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1833977370:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.70/1.29 % (3865379)dis-21_1_sil=8000:lcm=predicate:random_seed=3564434733: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.70/1.29 % (3865377)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3024389121:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.70/1.29 % (3865375)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=3636687679:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.70/1.29 % (3865377)First to succeed.
% 3.70/1.29 % (3865377)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3865368"
% 3.70/1.29 % (3865376)Also succeeded, but the first one will report.
% 3.70/1.29 % (3865379)Also succeeded, but the first one will report.
% 3.70/1.29 % (3865378)Also succeeded, but the first one will report.
% 3.70/1.29 % (3865377)Refutation found. Thanks to Tanya!
% 3.70/1.29 % SZS status Theorem for theBenchmark
% 3.70/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.70/1.29 % (3865377)------------------------------
% 3.70/1.29 % (3865377)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.29 % (3865377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.29 % (3865377)CaDiCaL version: 2.1.3
% 3.70/1.29 % (3865377)Termination reason: Refutation
% 3.70/1.29 % (3865377)Time elapsed: 0.004 s
% 3.70/1.29 % (3865377)Peak memory usage: 88 MB
% 3.70/1.29 % (3865377)Instructions burned: 4 (million)
% 3.70/1.29 % (3865377)------------------------------
% 3.70/1.29 % (3865377)------------------------------
% 3.70/1.29 % (3865368)Success in time 0.444 s
% 3.70/1.29 % Vampire exiting
%------------------------------------------------------------------------------