TSTP Solution File: SWV176+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV176+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -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 : Wed Aug 31 18:44:24 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 299 ( 70 equ)
% Maximal formula atoms : 37 ( 12 avg)
% Number of connectives : 388 ( 113 ~; 100 |; 130 &)
% ( 2 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 17 con; 0-3 aty)
% Number of variables : 73 ( 69 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f233,plain,
$false,
inference(avatar_sat_refutation,[],[f226,f227,f232]) ).
fof(f232,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f231]) ).
fof(f231,plain,
( $false
| ~ spl1_4 ),
inference(subsumption_resolution,[],[f230,f167]) ).
fof(f167,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
( ! [X0] :
( init = a_select2(rho_init,X0)
| ~ leq(n0,X0)
| ~ leq(X0,n4) )
& ( ~ gt(loopcounter,n1)
| ! [X1] :
( ~ leq(n0,X1)
| ~ leq(X1,n4)
| init = a_select2(rhoold_init,X1) ) )
& gt(loopcounter,n1)
& ( ! [X2] :
( init = a_select2(sigmaold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& leq(n0,pv44)
& ! [X3] :
( ~ leq(n0,X3)
| init = a_select2(mu_init,X3)
| ~ leq(X3,pred(pv40)) )
& leq(n0,pv40)
& leq(pv40,n4)
& init != a_select2(muold_init,sK0)
& leq(sK0,n4)
& leq(n0,sK0)
& leq(pv44,n135299)
& ! [X5] :
( ! [X6] :
( ~ leq(X6,n4)
| init = a_select3(q_init,X5,X6)
| ~ leq(n0,X6) )
| ~ leq(X5,n135299)
| ~ leq(n0,X5) )
& ! [X7] :
( ~ leq(X7,n4)
| init = a_select3(center_init,X7,n0)
| ~ leq(n0,X7) )
& ! [X8] :
( ~ leq(n0,X8)
| ~ leq(X8,pred(pv40))
| init = a_select2(sigma_init,X8) )
& ( ! [X9] :
( init = a_select2(muold_init,X9)
| ~ leq(X9,n4)
| ~ leq(n0,X9) )
| ~ gt(loopcounter,n1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f131,f132]) ).
fof(f132,plain,
( ? [X4] :
( init != a_select2(muold_init,X4)
& leq(X4,n4)
& leq(n0,X4) )
=> ( init != a_select2(muold_init,sK0)
& leq(sK0,n4)
& leq(n0,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ! [X0] :
( init = a_select2(rho_init,X0)
| ~ leq(n0,X0)
| ~ leq(X0,n4) )
& ( ~ gt(loopcounter,n1)
| ! [X1] :
( ~ leq(n0,X1)
| ~ leq(X1,n4)
| init = a_select2(rhoold_init,X1) ) )
& gt(loopcounter,n1)
& ( ! [X2] :
( init = a_select2(sigmaold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& leq(n0,pv44)
& ! [X3] :
( ~ leq(n0,X3)
| init = a_select2(mu_init,X3)
| ~ leq(X3,pred(pv40)) )
& leq(n0,pv40)
& leq(pv40,n4)
& ? [X4] :
( init != a_select2(muold_init,X4)
& leq(X4,n4)
& leq(n0,X4) )
& leq(pv44,n135299)
& ! [X5] :
( ! [X6] :
( ~ leq(X6,n4)
| init = a_select3(q_init,X5,X6)
| ~ leq(n0,X6) )
| ~ leq(X5,n135299)
| ~ leq(n0,X5) )
& ! [X7] :
( ~ leq(X7,n4)
| init = a_select3(center_init,X7,n0)
| ~ leq(n0,X7) )
& ! [X8] :
( ~ leq(n0,X8)
| ~ leq(X8,pred(pv40))
| init = a_select2(sigma_init,X8) )
& ( ! [X9] :
( init = a_select2(muold_init,X9)
| ~ leq(X9,n4)
| ~ leq(n0,X9) )
| ~ gt(loopcounter,n1) ) ),
inference(rectify,[],[f110]) ).
fof(f110,plain,
( ! [X1] :
( init = a_select2(rho_init,X1)
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
& ( ~ gt(loopcounter,n1)
| ! [X2] :
( ~ leq(n0,X2)
| ~ leq(X2,n4)
| init = a_select2(rhoold_init,X2) ) )
& gt(loopcounter,n1)
& ( ! [X7] :
( init = a_select2(sigmaold_init,X7)
| ~ leq(X7,n4)
| ~ leq(n0,X7) )
| ~ gt(loopcounter,n1) )
& leq(n0,pv44)
& ! [X3] :
( ~ leq(n0,X3)
| init = a_select2(mu_init,X3)
| ~ leq(X3,pred(pv40)) )
& leq(n0,pv40)
& leq(pv40,n4)
& ? [X9] :
( init != a_select2(muold_init,X9)
& leq(X9,n4)
& leq(n0,X9) )
& leq(pv44,n135299)
& ! [X4] :
( ! [X5] :
( ~ leq(X5,n4)
| init = a_select3(q_init,X4,X5)
| ~ leq(n0,X5) )
| ~ leq(X4,n135299)
| ~ leq(n0,X4) )
& ! [X6] :
( ~ leq(X6,n4)
| init = a_select3(center_init,X6,n0)
| ~ leq(n0,X6) )
& ! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,pred(pv40))
| init = a_select2(sigma_init,X0) )
& ( ! [X8] :
( init = a_select2(muold_init,X8)
| ~ leq(X8,n4)
| ~ leq(n0,X8) )
| ~ gt(loopcounter,n1) ) ),
inference(flattening,[],[f109]) ).
fof(f109,plain,
( ? [X9] :
( init != a_select2(muold_init,X9)
& leq(n0,X9)
& leq(X9,n4) )
& ! [X3] :
( init = a_select2(mu_init,X3)
| ~ leq(X3,pred(pv40))
| ~ leq(n0,X3) )
& leq(pv44,n135299)
& leq(pv40,n4)
& leq(n0,pv44)
& ( ! [X7] :
( init = a_select2(sigmaold_init,X7)
| ~ leq(n0,X7)
| ~ leq(X7,n4) )
| ~ gt(loopcounter,n1) )
& ! [X6] :
( init = a_select3(center_init,X6,n0)
| ~ leq(X6,n4)
| ~ leq(n0,X6) )
& ! [X1] :
( init = a_select2(rho_init,X1)
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
& gt(loopcounter,n1)
& leq(n0,pv40)
& ( ! [X8] :
( init = a_select2(muold_init,X8)
| ~ leq(X8,n4)
| ~ leq(n0,X8) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(rhoold_init,X2)
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
| ~ gt(loopcounter,n1) )
& ! [X4] :
( ! [X5] :
( init = a_select3(q_init,X4,X5)
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ leq(n0,X4)
| ~ leq(X4,n135299) )
& ! [X0] :
( init = a_select2(sigma_init,X0)
| ~ leq(n0,X0)
| ~ leq(X0,pred(pv40)) ) ),
inference(ennf_transformation,[],[f94]) ).
fof(f94,plain,
~ ( ( ! [X3] :
( ( leq(X3,pred(pv40))
& leq(n0,X3) )
=> init = a_select2(mu_init,X3) )
& leq(pv44,n135299)
& leq(pv40,n4)
& leq(n0,pv44)
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> init = a_select2(sigmaold_init,X7) ) )
& ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> init = a_select3(center_init,X6,n0) )
& ! [X1] :
( ( leq(n0,X1)
& leq(X1,n4) )
=> init = a_select2(rho_init,X1) )
& gt(loopcounter,n1)
& leq(n0,pv40)
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(X8,n4)
& leq(n0,X8) )
=> init = a_select2(muold_init,X8) ) )
& ( gt(loopcounter,n1)
=> ! [X2] :
( ( leq(n0,X2)
& leq(X2,n4) )
=> init = a_select2(rhoold_init,X2) ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n135299) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> init = a_select3(q_init,X4,X5) ) )
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,pred(pv40)) )
=> init = a_select2(sigma_init,X0) ) )
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> init = a_select2(muold_init,X9) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( leq(pv40,n4)
& ! [X20] :
( ( leq(X20,pred(pv40))
& leq(n0,X20) )
=> init = a_select2(sigma_init,X20) )
& leq(n0,pv44)
& leq(n0,pv40)
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n4) )
=> init = a_select2(rho_init,X3) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> init = a_select2(rhoold_init,X28) ) )
& gt(loopcounter,n1)
& ! [X19] :
( ( leq(X19,pred(pv40))
& leq(n0,X19) )
=> init = a_select2(mu_init,X19) )
& ! [X13] :
( ( leq(X13,n135299)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) )
& ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> init = a_select3(center_init,X21,n0) )
& ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> init = a_select2(sigmaold_init,X4) ) )
& ( gt(loopcounter,n1)
=> ! [X27] :
( ( leq(n0,X27)
& leq(X27,n4) )
=> init = a_select2(muold_init,X27) ) )
& leq(pv44,n135299) )
=> ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> init = a_select2(muold_init,X10) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( leq(pv40,n4)
& ! [X20] :
( ( leq(X20,pred(pv40))
& leq(n0,X20) )
=> init = a_select2(sigma_init,X20) )
& leq(n0,pv44)
& leq(n0,pv40)
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n4) )
=> init = a_select2(rho_init,X3) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> init = a_select2(rhoold_init,X28) ) )
& gt(loopcounter,n1)
& ! [X19] :
( ( leq(X19,pred(pv40))
& leq(n0,X19) )
=> init = a_select2(mu_init,X19) )
& ! [X13] :
( ( leq(X13,n135299)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) )
& ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> init = a_select3(center_init,X21,n0) )
& ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> init = a_select2(sigmaold_init,X4) ) )
& ( gt(loopcounter,n1)
=> ! [X27] :
( ( leq(n0,X27)
& leq(X27,n4) )
=> init = a_select2(muold_init,X27) ) )
& leq(pv44,n135299) )
=> ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> init = a_select2(muold_init,X10) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0056) ).
fof(f230,plain,
( ~ leq(n0,sK0)
| ~ spl1_4 ),
inference(subsumption_resolution,[],[f229,f168]) ).
fof(f168,plain,
leq(sK0,n4),
inference(cnf_transformation,[],[f133]) ).
fof(f229,plain,
( ~ leq(sK0,n4)
| ~ leq(n0,sK0)
| ~ spl1_4 ),
inference(trivial_inequality_removal,[],[f228]) ).
fof(f228,plain,
( init != init
| ~ leq(sK0,n4)
| ~ leq(n0,sK0)
| ~ spl1_4 ),
inference(superposition,[],[f169,f225]) ).
fof(f225,plain,
( ! [X9] :
( init = a_select2(muold_init,X9)
| ~ leq(X9,n4)
| ~ leq(n0,X9) )
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f224]) ).
fof(f224,plain,
( spl1_4
<=> ! [X9] :
( ~ leq(X9,n4)
| ~ leq(n0,X9)
| init = a_select2(muold_init,X9) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
fof(f169,plain,
init != a_select2(muold_init,sK0),
inference(cnf_transformation,[],[f133]) ).
fof(f227,plain,
spl1_1,
inference(avatar_split_clause,[],[f175,f212]) ).
fof(f212,plain,
( spl1_1
<=> gt(loopcounter,n1) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f175,plain,
gt(loopcounter,n1),
inference(cnf_transformation,[],[f133]) ).
fof(f226,plain,
( spl1_4
| ~ spl1_1 ),
inference(avatar_split_clause,[],[f162,f212,f224]) ).
fof(f162,plain,
! [X9] :
( ~ gt(loopcounter,n1)
| ~ leq(X9,n4)
| init = a_select2(muold_init,X9)
| ~ leq(n0,X9) ),
inference(cnf_transformation,[],[f133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV176+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 19:17:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.54 % (13810)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.55 % (13802)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.55 % (13816)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.55 % (13794)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.55 % (13801)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.55 % (13793)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.55 % (13800)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (13793)First to succeed.
% 0.20/0.55 % (13801)Instruction limit reached!
% 0.20/0.55 % (13801)------------------------------
% 0.20/0.55 % (13801)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (13793)Refutation found. Thanks to Tanya!
% 0.20/0.56 % SZS status Theorem for theBenchmark
% 0.20/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56 % (13793)------------------------------
% 0.20/0.56 % (13793)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (13793)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (13793)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56 % (13793)Memory used [KB]: 6140
% 0.20/0.56 % (13793)Time elapsed: 0.125 s
% 0.20/0.56 % (13793)Instructions burned: 4 (million)
% 0.20/0.56 % (13793)------------------------------
% 0.20/0.56 % (13793)------------------------------
% 0.20/0.56 % (13786)Success in time 0.203 s
%------------------------------------------------------------------------------