%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC131+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 : n007.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:35 PM UTC 2026
% Result : Theorem 3.47s 1.45s
% Output : Refutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 17 unt; 1 def)
% Number of atoms : 88 ( 21 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 89 ( 33 ~; 21 |; 22 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 24 ( 0 sgn 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(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| neq(X3,nil)
| cyclefreeP(X1) ) ) ) ) ),
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(X3,nil)
| cyclefreeP(X1) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& 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(f108,plain,
( sK3 = sK5
& sK2 = sK4
& ~ neq(sK5,nil)
& ~ cyclefreeP(sK3)
& ssList(sK5)
& ssList(sK4)
& ssList(sK3)
& ssList(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f99]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f116,plain,
ssList(sK3),
inference(cnf_transformation,[],[f108]) ).
fof(f119,plain,
~ cyclefreeP(sK3),
inference(cnf_transformation,[],[f108]) ).
fof(f120,plain,
~ neq(sK5,nil),
inference(cnf_transformation,[],[f108]) ).
fof(f122,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f108]) ).
fof(f124,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f127,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f128,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f142,plain,
~ cyclefreeP(sK5),
inference(definition_unfolding,[],[f119,f122]) ).
fof(f143,plain,
ssList(sK5),
inference(definition_unfolding,[],[f116,f122]) ).
fof(f151,plain,
( nil = sK5
| ~ ssList(nil)
| ~ ssList(sK5) ),
inference(resolution,[],[f120,f124]) ).
fof(f152,plain,
( nil = sK5
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f151,f127]) ).
fof(f162,definition,
( spl11_3
<=> nil = sK5 ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
fof(f164,plain,
( nil = sK5
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f162]) ).
fof(f166,plain,
nil = sK5,
inference(forward_subsumption_resolution,[],[f152,f143]) ).
fof(f167,plain,
spl11_3,
inference(avatar_split_clause,[],[f166,f162]) ).
fof(f187,plain,
( ~ cyclefreeP(nil)
| ~ spl11_3 ),
inference(superposition,[],[f142,f164]) ).
fof(f188,plain,
( $false
| ~ spl11_3 ),
inference(forward_subsumption_resolution,[],[f187,f128]) ).
fof(f189,plain,
~ spl11_3,
inference(avatar_contradiction_clause,[],[f188]) ).
cnf(s2,plain,
spl11_3,
inference(sat_conversion,[],[f167]) ).
cnf(s5,plain,
~ spl11_3,
inference(sat_conversion,[],[f189]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s2,s5]) ).
fof(f190,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC131+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.37 % Computer : n007.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 08:01:26 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.47/1.45 % (2236036)Detected formulas, will run a generic FOF schedule.
% 3.47/1.45 % (2236041)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=3058793236:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.47/1.45 % (2236043)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=2778553691:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.47/1.45 % (2236047)dis-21_1_sil=8000:lcm=predicate:random_seed=3330235844: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.47/1.45 % (2236045)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=757985814:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.47/1.45 % (2236044)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1665268702:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.47/1.45 % (2236046)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3406841841:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.47/1.45 % (2236042)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=273467007:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.47/1.45 % (2236045)Also succeeded, but the first one will report.
% 3.47/1.45 % (2236044)First to succeed.
% 3.47/1.45 % (2236044)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2236036"
% 3.47/1.45 % (2236046)Also succeeded, but the first one will report.
% 3.47/1.45 % (2236047)Instruction limit reached!
% 3.47/1.45 % (2236047)------------------------------
% 3.47/1.45 % (2236047)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.45 % (2236047)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.45 % (2236047)CaDiCaL version: 2.1.3
% 3.47/1.45 % (2236047)Termination reason: Instruction limit
% 3.47/1.45 % (2236047)Termination phase: Saturation
% 3.47/1.45 % (2236047)Time elapsed: 0.075 s
% 3.47/1.45 % (2236047)Peak memory usage: 90 MB
% 3.47/1.45 % (2236047)Instructions burned: 130 (million)
% 3.47/1.45 % (2236055)lrs+10_1_sil=8000:sp=occurrence:random_seed=3301420151:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.47/1.45 % (2236055)Also succeeded, but the first one will report.
% 3.47/1.45 % (2236044)Refutation found. Thanks to Tanya!
% 3.47/1.45 % SZS status Theorem for theBenchmark
% 3.47/1.45 % SZS output start Proof for theBenchmark
% See solution above
% 3.47/1.45 % (2236044)------------------------------
% 3.47/1.45 % (2236044)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.45 % (2236044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.45 % (2236044)CaDiCaL version: 2.1.3
% 3.47/1.45 % (2236044)Termination reason: Refutation
% 3.47/1.45 % (2236044)Time elapsed: 0.003 s
% 3.47/1.45 % (2236044)Peak memory usage: 89 MB
% 3.47/1.45 % (2236044)Instructions burned: 3 (million)
% 3.47/1.45 % (2236044)------------------------------
% 3.47/1.45 % (2236044)------------------------------
% 3.47/1.45 % (2236036)Success in time 0.414 s
% 3.47/1.45 % Vampire exiting
%------------------------------------------------------------------------------