%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC210+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 : n001.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:57 PM UTC 2026
% Result : Theorem 3.51s 1.47s
% Output : Refutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 13 unt; 0 def)
% Number of atoms : 101 ( 20 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 111 ( 39 ~; 30 |; 30 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 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 : 24 ( 16 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ~ singletonP(X2)
| neq(X0,nil) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/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)
| ~ singletonP(X2)
| neq(X0,nil) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& singletonP(X2)
& ~ neq(X0,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& singletonP(X2)
& ~ neq(X0,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& 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(f110,plain,
( sK1 = sK3
& sK0 = sK2
& ( ( neq(sK1,nil)
& singletonP(sK2)
& ~ neq(sK0,nil) )
| ( neq(sK1,nil)
& ~ neq(sK3,nil) ) )
& 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(f111,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f120,plain,
ssList(sK2),
inference(cnf_transformation,[],[f110]) ).
fof(f122,plain,
( ~ neq(sK0,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f110]) ).
fof(f124,plain,
( singletonP(sK2)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f110]) ).
fof(f127,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f110]) ).
fof(f128,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f110]) ).
fof(f129,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f110]) ).
fof(f131,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f134,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f135,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f150,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f127,f129,f129]) ).
fof(f154,plain,
( ~ neq(sK2,nil)
| ~ neq(sK3,nil) ),
inference(definition_unfolding,[],[f122,f128]) ).
fof(f162,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f150]) ).
fof(f163,plain,
singletonP(sK2),
inference(forward_subsumption_resolution,[],[f124,f162]) ).
fof(f164,plain,
~ neq(sK2,nil),
inference(forward_subsumption_resolution,[],[f154,f162]) ).
fof(f165,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f131,f164]) ).
fof(f170,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f165,f134]) ).
fof(f171,plain,
nil = sK2,
inference(forward_subsumption_resolution,[],[f170,f120]) ).
fof(f172,plain,
~ singletonP(sK2),
inference(superposition,[],[f135,f171]) ).
fof(f176,plain,
$false,
inference(forward_subsumption_resolution,[],[f172,f163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC210+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n001.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 08:33:33 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 3.51/1.47 % (215978)Detected formulas, will run a generic FOF schedule.
% 3.51/1.47 % (215989)dis-21_1_sil=8000:lcm=predicate:random_seed=2189290321: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.51/1.47 % (215986)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=668577388:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.51/1.47 % (215984)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=768872066:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.51/1.47 % (215988)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=909389158:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.51/1.47 % (215987)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1553771352:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.51/1.47 % (215983)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=1635716545:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.51/1.47 % (215985)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=1191582200:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.51/1.47 % (215987)First to succeed.
% 3.51/1.47 % (215986)Also succeeded, but the first one will report.
% 3.51/1.47 % (215987)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-215978"
% 3.51/1.47 % (215989)Instruction limit reached!
% 3.51/1.47 % (215989)------------------------------
% 3.51/1.47 % (215989)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.47 % (215989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.47 % (215989)CaDiCaL version: 2.1.3
% 3.51/1.47 % (215989)Termination reason: Instruction limit
% 3.51/1.47 % (215989)Termination phase: Saturation
% 3.51/1.47 % (215989)Time elapsed: 0.040 s
% 3.51/1.47 % (215989)Peak memory usage: 90 MB
% 3.51/1.47 % (215989)Instructions burned: 131 (million)
% 3.51/1.47 % (215988)Also succeeded, but the first one will report.
% 3.51/1.47 % (215997)lrs+10_1_sil=8000:sp=occurrence:random_seed=3432893370:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.51/1.47 % (215997)Also succeeded, but the first one will report.
% 3.51/1.47 % (215987)Refutation found. Thanks to Tanya!
% 3.51/1.47 % SZS status Theorem for theBenchmark
% 3.51/1.47 % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.47 % (215987)------------------------------
% 3.51/1.47 % (215987)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.47 % (215987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.47 % (215987)CaDiCaL version: 2.1.3
% 3.51/1.47 % (215987)Termination reason: Refutation
% 3.51/1.47 % (215987)Time elapsed: 0.003 s
% 3.51/1.47 % (215987)Peak memory usage: 88 MB
% 3.51/1.47 % (215987)Instructions burned: 2 (million)
% 3.51/1.47 % (215987)------------------------------
% 3.51/1.47 % (215987)------------------------------
% 3.51/1.47 % (215978)Success in time 0.412 s
% 3.51/1.47 % Vampire exiting
%------------------------------------------------------------------------------