TSTP Solution File: SWV166+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV166+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 10:28:17 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 295 ( 75 equ)
% Maximal formula atoms : 36 ( 11 avg)
% Number of connectives : 389 ( 120 ~; 100 |; 123 &)
% ( 3 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 17 con; 0-3 aty)
% Number of variables : 76 ( 72 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f293,plain,
$false,
inference(avatar_sat_refutation,[],[f236,f241,f292]) ).
fof(f292,plain,
~ spl2_3,
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f291,plain,
( $false
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f290,f137]) ).
fof(f137,plain,
leq(sK0,n4),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
( init != a_select2(rhoold_init,sK0)
& leq(sK0,n4)
& leq(n0,sK0)
& ( ! [X1] :
( init = a_select2(sigmaold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(rhoold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ( ! [X3] :
( init = a_select2(muold_init,X3)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
| ~ gt(loopcounter,n1) )
& ! [X4] :
( init = a_select3(center_init,X4,n0)
| ~ leq(X4,n4)
| ~ leq(n0,X4) )
& ! [X5] :
( init = a_select2(sigma_init,X5)
| ~ leq(X5,pred(pv40))
| ~ leq(n0,X5) )
& ! [X6] :
( init = a_select2(mu_init,X6)
| ~ leq(X6,pred(pv40))
| ~ leq(n0,X6) )
& ! [X7] :
( init = a_select2(rho_init,X7)
| ~ leq(X7,n4)
| ~ leq(n0,X7) )
& ! [X8] :
( ! [X9] :
( init = a_select3(q_init,X8,X9)
| ~ leq(X9,n4)
| ~ leq(n0,X9) )
| ~ leq(X8,n135299)
| ~ leq(n0,X8) )
& gt(loopcounter,n1)
& leq(pv40,n4)
& leq(n0,pv40)
& n0 != pv90 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f118,f119]) ).
fof(f119,plain,
( ? [X0] :
( init != a_select2(rhoold_init,X0)
& leq(X0,n4)
& leq(n0,X0) )
=> ( init != a_select2(rhoold_init,sK0)
& leq(sK0,n4)
& leq(n0,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
( ? [X0] :
( init != a_select2(rhoold_init,X0)
& leq(X0,n4)
& leq(n0,X0) )
& ( ! [X1] :
( init = a_select2(sigmaold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(rhoold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ( ! [X3] :
( init = a_select2(muold_init,X3)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
| ~ gt(loopcounter,n1) )
& ! [X4] :
( init = a_select3(center_init,X4,n0)
| ~ leq(X4,n4)
| ~ leq(n0,X4) )
& ! [X5] :
( init = a_select2(sigma_init,X5)
| ~ leq(X5,pred(pv40))
| ~ leq(n0,X5) )
& ! [X6] :
( init = a_select2(mu_init,X6)
| ~ leq(X6,pred(pv40))
| ~ leq(n0,X6) )
& ! [X7] :
( init = a_select2(rho_init,X7)
| ~ leq(X7,n4)
| ~ leq(n0,X7) )
& ! [X8] :
( ! [X9] :
( init = a_select3(q_init,X8,X9)
| ~ leq(X9,n4)
| ~ leq(n0,X9) )
| ~ leq(X8,n135299)
| ~ leq(n0,X8) )
& gt(loopcounter,n1)
& leq(pv40,n4)
& leq(n0,pv40)
& n0 != pv90 ),
inference(rectify,[],[f96]) ).
fof(f96,plain,
( ? [X9] :
( init != a_select2(rhoold_init,X9)
& leq(X9,n4)
& leq(n0,X9) )
& ( ! [X0] :
( init = a_select2(sigmaold_init,X0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) )
| ~ gt(loopcounter,n1) )
& ( ! [X1] :
( init = a_select2(rhoold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(muold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ! [X3] :
( init = a_select3(center_init,X3,n0)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
& ! [X4] :
( init = a_select2(sigma_init,X4)
| ~ leq(X4,pred(pv40))
| ~ leq(n0,X4) )
& ! [X5] :
( init = a_select2(mu_init,X5)
| ~ leq(X5,pred(pv40))
| ~ leq(n0,X5) )
& ! [X6] :
( init = a_select2(rho_init,X6)
| ~ leq(X6,n4)
| ~ leq(n0,X6) )
& ! [X7] :
( ! [X8] :
( init = a_select3(q_init,X7,X8)
| ~ leq(X8,n4)
| ~ leq(n0,X8) )
| ~ leq(X7,n135299)
| ~ leq(n0,X7) )
& gt(loopcounter,n1)
& leq(pv40,n4)
& leq(n0,pv40)
& n0 != pv90 ),
inference(flattening,[],[f95]) ).
fof(f95,plain,
( ? [X9] :
( init != a_select2(rhoold_init,X9)
& leq(X9,n4)
& leq(n0,X9) )
& ( ! [X0] :
( init = a_select2(sigmaold_init,X0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) )
| ~ gt(loopcounter,n1) )
& ( ! [X1] :
( init = a_select2(rhoold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(muold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ! [X3] :
( init = a_select3(center_init,X3,n0)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
& ! [X4] :
( init = a_select2(sigma_init,X4)
| ~ leq(X4,pred(pv40))
| ~ leq(n0,X4) )
& ! [X5] :
( init = a_select2(mu_init,X5)
| ~ leq(X5,pred(pv40))
| ~ leq(n0,X5) )
& ! [X6] :
( init = a_select2(rho_init,X6)
| ~ leq(X6,n4)
| ~ leq(n0,X6) )
& ! [X7] :
( ! [X8] :
( init = a_select3(q_init,X7,X8)
| ~ leq(X8,n4)
| ~ leq(n0,X8) )
| ~ leq(X7,n135299)
| ~ leq(n0,X7) )
& gt(loopcounter,n1)
& leq(pv40,n4)
& leq(n0,pv40)
& n0 != pv90 ),
inference(ennf_transformation,[],[f94]) ).
fof(f94,plain,
~ ( ( ( gt(loopcounter,n1)
=> ! [X0] :
( ( leq(X0,n4)
& leq(n0,X0) )
=> init = a_select2(sigmaold_init,X0) ) )
& ( gt(loopcounter,n1)
=> ! [X1] :
( ( leq(X1,n4)
& leq(n0,X1) )
=> init = a_select2(rhoold_init,X1) ) )
& ( gt(loopcounter,n1)
=> ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> init = a_select2(muold_init,X2) ) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select3(center_init,X3,n0) )
& ! [X4] :
( ( leq(X4,pred(pv40))
& leq(n0,X4) )
=> init = a_select2(sigma_init,X4) )
& ! [X5] :
( ( leq(X5,pred(pv40))
& leq(n0,X5) )
=> init = a_select2(mu_init,X5) )
& ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> init = a_select2(rho_init,X6) )
& ! [X7] :
( ( leq(X7,n135299)
& leq(n0,X7) )
=> ! [X8] :
( ( leq(X8,n4)
& leq(n0,X8) )
=> init = a_select3(q_init,X7,X8) ) )
& gt(loopcounter,n1)
& leq(pv40,n4)
& leq(n0,pv40)
& n0 != pv90 )
=> ! [X9] :
( ( leq(X9,n4)
& leq(n0,X9) )
=> init = a_select2(rhoold_init,X9) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> init = a_select2(sigmaold_init,X4) ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> init = a_select2(rhoold_init,X28) ) )
& ( gt(loopcounter,n1)
=> ! [X27] :
( ( leq(X27,n4)
& leq(n0,X27) )
=> init = a_select2(muold_init,X27) ) )
& ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> init = a_select3(center_init,X21,n0) )
& ! [X20] :
( ( leq(X20,pred(pv40))
& leq(n0,X20) )
=> init = a_select2(sigma_init,X20) )
& ! [X19] :
( ( leq(X19,pred(pv40))
& leq(n0,X19) )
=> init = a_select2(mu_init,X19) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select2(rho_init,X3) )
& ! [X13] :
( ( leq(X13,n135299)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) )
& gt(loopcounter,n1)
& leq(pv40,n4)
& leq(n0,pv40)
& n0 != pv90 )
=> ! [X10] :
( ( leq(X10,n4)
& leq(n0,X10) )
=> init = a_select2(rhoold_init,X10) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> init = a_select2(sigmaold_init,X4) ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> init = a_select2(rhoold_init,X28) ) )
& ( gt(loopcounter,n1)
=> ! [X27] :
( ( leq(X27,n4)
& leq(n0,X27) )
=> init = a_select2(muold_init,X27) ) )
& ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> init = a_select3(center_init,X21,n0) )
& ! [X20] :
( ( leq(X20,pred(pv40))
& leq(n0,X20) )
=> init = a_select2(sigma_init,X20) )
& ! [X19] :
( ( leq(X19,pred(pv40))
& leq(n0,X19) )
=> init = a_select2(mu_init,X19) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select2(rho_init,X3) )
& ! [X13] :
( ( leq(X13,n135299)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) )
& gt(loopcounter,n1)
& leq(pv40,n4)
& leq(n0,pv40)
& n0 != pv90 )
=> ! [X10] :
( ( leq(X10,n4)
& leq(n0,X10) )
=> init = a_select2(rhoold_init,X10) ) ),
file('/export/starexec/sandbox/tmp/tmp.lJfRDKbaod/Vampire---4.8_1007',cl5_nebula_init_0006) ).
fof(f290,plain,
( ~ leq(sK0,n4)
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f289,f136]) ).
fof(f136,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f120]) ).
fof(f289,plain,
( ~ leq(n0,sK0)
| ~ leq(sK0,n4)
| ~ spl2_3 ),
inference(resolution,[],[f235,f198]) ).
fof(f198,plain,
~ sQ1_eqProxy(init,a_select2(rhoold_init,sK0)),
inference(equality_proxy_replacement,[],[f138,f197]) ).
fof(f197,plain,
! [X0,X1] :
( sQ1_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ1_eqProxy])]) ).
fof(f138,plain,
init != a_select2(rhoold_init,sK0),
inference(cnf_transformation,[],[f120]) ).
fof(f235,plain,
( ! [X2] :
( sQ1_eqProxy(init,a_select2(rhoold_init,X2))
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f234,plain,
( spl2_3
<=> ! [X2] :
( sQ1_eqProxy(init,a_select2(rhoold_init,X2))
| ~ leq(n0,X2)
| ~ leq(X2,n4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f241,plain,
spl2_1,
inference(avatar_split_clause,[],[f127,f226]) ).
fof(f226,plain,
( spl2_1
<=> gt(loopcounter,n1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f127,plain,
gt(loopcounter,n1),
inference(cnf_transformation,[],[f120]) ).
fof(f236,plain,
( ~ spl2_1
| spl2_3 ),
inference(avatar_split_clause,[],[f200,f234,f226]) ).
fof(f200,plain,
! [X2] :
( sQ1_eqProxy(init,a_select2(rhoold_init,X2))
| ~ leq(X2,n4)
| ~ leq(n0,X2)
| ~ gt(loopcounter,n1) ),
inference(equality_proxy_replacement,[],[f134,f197]) ).
fof(f134,plain,
! [X2] :
( init = a_select2(rhoold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2)
| ~ gt(loopcounter,n1) ),
inference(cnf_transformation,[],[f120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV166+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 21:12:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.lJfRDKbaod/Vampire---4.8_1007
% 0.58/0.75 % (1148)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.58/0.75 % (1141)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.58/0.75 % (1143)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.76 % (1144)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.76 % (1142)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.58/0.76 % (1146)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.76 % (1145)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.58/0.76 % (1147)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.58/0.76 % (1148)First to succeed.
% 0.58/0.76 % (1148)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1140"
% 0.58/0.76 % (1148)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (1148)------------------------------
% 0.58/0.76 % (1148)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (1148)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (1148)Memory used [KB]: 1176
% 0.58/0.76 % (1148)Time elapsed: 0.004 s
% 0.58/0.76 % (1148)Instructions burned: 7 (million)
% 0.58/0.76 % (1140)Success in time 0.39 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------