%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV175+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:08:18 PM UTC 2026
% Result : Theorem 2.57s 1.13s
% Output : Refutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 138 ( 31 equ)
% Maximal formula atoms : 28 ( 8 avg)
% Number of connectives : 179 ( 57 ~; 48 |; 52 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-3 aty)
% Number of variables : 30 ( 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,n135299) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n4) )
=> a_select3(q_init,X0,X1) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,pred(pv28)) )
=> a_select2(rho_init,X2) = init )
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n4) )
=> a_select3(center_init,X3,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(muold_init,X4) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(rhoold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(sigmaold_init,X6) = init ) ) )
=> a_select3(q_init,pv30,pv28) = init ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0051) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,n135299) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n4) )
=> a_select3(q_init,X0,X1) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,pred(pv28)) )
=> a_select2(rho_init,X2) = init )
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n4) )
=> a_select3(center_init,X3,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(muold_init,X4) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(rhoold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(sigmaold_init,X6) = init ) ) )
=> a_select3(q_init,pv30,pv28) = init ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f94,plain,
( init != a_select3(q_init,pv30,pv28)
& leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [X0] :
( ! [X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
| ~ leq(n0,X0)
| ~ leq(X0,n135299) )
& ! [X2] :
( a_select2(rho_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,pred(pv28)) )
& ! [X3] :
( a_select3(center_init,X3,n0) = init
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ( ! [X4] :
( a_select2(muold_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X5] :
( a_select2(rhoold_init,X5) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X6] :
( a_select2(sigmaold_init,X6) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n1) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( init != a_select3(q_init,pv30,pv28)
& leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [X0] :
( ! [X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
| ~ leq(n0,X0)
| ~ leq(X0,n135299) )
& ! [X2] :
( a_select2(rho_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,pred(pv28)) )
& ! [X3] :
( a_select3(center_init,X3,n0) = init
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ( ! [X4] :
( a_select2(muold_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X5] :
( a_select2(rhoold_init,X5) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X6] :
( a_select2(sigmaold_init,X6) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n1) ) ),
inference(flattening,[],[f94]) ).
fof(f125,plain,
! [X0,X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X0)
| ~ leq(X0,n135299) ),
inference(cnf_transformation,[],[f95]) ).
fof(f126,plain,
leq(pv30,n135299),
inference(cnf_transformation,[],[f95]) ).
fof(f127,plain,
leq(pv28,n4),
inference(cnf_transformation,[],[f95]) ).
fof(f128,plain,
leq(n0,pv30),
inference(cnf_transformation,[],[f95]) ).
fof(f129,plain,
leq(n0,pv28),
inference(cnf_transformation,[],[f95]) ).
fof(f130,plain,
init != a_select3(q_init,pv30,pv28),
inference(cnf_transformation,[],[f95]) ).
fof(f189,plain,
( init != init
| ~ leq(n0,pv28)
| ~ leq(pv28,n4)
| ~ leq(n0,pv30)
| ~ leq(pv30,n135299) ),
inference(superposition,[],[f130,f125]) ).
fof(f190,plain,
( ~ leq(n0,pv28)
| ~ leq(pv28,n4)
| ~ leq(n0,pv30)
| ~ leq(pv30,n135299) ),
inference(trivial_inequality_removal,[],[f189]) ).
fof(f191,plain,
( ~ leq(pv28,n4)
| ~ leq(n0,pv30)
| ~ leq(pv30,n135299) ),
inference(forward_subsumption_resolution,[],[f190,f129]) ).
fof(f192,plain,
( ~ leq(n0,pv30)
| ~ leq(pv30,n135299) ),
inference(forward_subsumption_resolution,[],[f191,f127]) ).
fof(f193,plain,
~ leq(pv30,n135299),
inference(forward_subsumption_resolution,[],[f192,f128]) ).
fof(f194,plain,
$false,
inference(forward_subsumption_resolution,[],[f193,f126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV175+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n004.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 10:04:37 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 Running first-order theorem proving
% 0.08/0.20 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
% 2.57/1.13 % (256321)Detected formulas, will run a generic FOF schedule.
% 2.57/1.13 % (256330)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=789743275:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.57/1.13 % (256330)First to succeed.
% 2.57/1.13 % (256330)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-256321"
% 2.57/1.13 % (256331)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2925869021:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.57/1.13 % (256329)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1420075175:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.57/1.13 % (256326)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=3499582252:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.57/1.13 % (256328)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=2777981424:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.57/1.13 % (256327)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=305042556:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.57/1.13 % (256332)dis-21_1_sil=8000:lcm=predicate:random_seed=2685970258: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.57/1.13 % (256331)Also succeeded, but the first one will report.
% 2.57/1.13 % (256332)Also succeeded, but the first one will report.
% 2.57/1.13 % (256329)Also succeeded, but the first one will report.
% 2.57/1.13 % (256330)Refutation found. Thanks to Tanya!
% 2.57/1.13 % SZS status Theorem for theBenchmark
% 2.57/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 2.57/1.13 % (256330)------------------------------
% 2.57/1.13 % (256330)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.13 % (256330)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.13 % (256330)CaDiCaL version: 2.1.3
% 2.57/1.13 % (256330)Termination reason: Refutation
% 2.57/1.13 % (256330)Time elapsed: 0.002 s
% 2.57/1.13 % (256330)Peak memory usage: 88 MB
% 2.57/1.13 % (256330)Instructions burned: 3 (million)
% 2.57/1.13 % (256330)------------------------------
% 2.57/1.13 % (256330)------------------------------
% 2.57/1.13 % (256321)Success in time 0.286 s
% 2.57/1.13 % Vampire exiting
%------------------------------------------------------------------------------