TSTP Solution File: SWV164+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWV164+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.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 : Tue Apr 30 16:41:35 EDT 2024
% Result : Theorem 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 104 ( 24 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 105 ( 33 ~; 21 |; 38 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 16 con; 0-3 aty)
% Number of variables : 34 ( 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8804,plain,
$false,
inference(subsumption_resolution,[],[f8795,f646]) ).
fof(f646,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[],[f624,f309]) ).
fof(f309,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f624,plain,
! [X0] : ~ leq(succ(X0),X0),
inference(resolution,[],[f364,f314]) ).
fof(f314,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f364,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f215]) ).
fof(f215,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f8795,plain,
leq(n0,tptp_minus_1),
inference(superposition,[],[f269,f8793]) ).
fof(f8793,plain,
n0 = sK13,
inference(subsumption_resolution,[],[f8734,f575]) ).
fof(f575,plain,
leq(sK13,n0),
inference(resolution,[],[f569,f269]) ).
fof(f569,plain,
! [X0] :
( ~ leq(X0,tptp_minus_1)
| leq(X0,n0) ),
inference(superposition,[],[f339,f309]) ).
fof(f339,plain,
! [X0,X1] :
( leq(X0,succ(X1))
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0,X1] :
( leq(X0,succ(X1))
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
=> leq(X0,succ(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ) ).
fof(f8734,plain,
( ~ leq(sK13,n0)
| n0 = sK13 ),
inference(resolution,[],[f337,f268]) ).
fof(f268,plain,
leq(n0,sK13),
inference(cnf_transformation,[],[f202]) ).
fof(f202,plain,
( a_select3(q,pv10,sK13) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,sK13)),minus(a_select2(x,pv10),a_select2(mu,sK13))),tptp_minus_2),times(a_select2(sigma,sK13),a_select2(sigma,sK13)))),a_select2(rho,sK13)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,sK13))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
& leq(sK13,tptp_minus_1)
& leq(n0,sK13)
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f200,f201]) ).
fof(f201,plain,
( ? [X0] :
( a_select3(q,pv10,X0) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X0)),minus(a_select2(x,pv10),a_select2(mu,X0))),tptp_minus_2),times(a_select2(sigma,X0),a_select2(sigma,X0)))),a_select2(rho,X0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> ( a_select3(q,pv10,sK13) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,sK13)),minus(a_select2(x,pv10),a_select2(mu,sK13))),tptp_minus_2),times(a_select2(sigma,sK13),a_select2(sigma,sK13)))),a_select2(rho,sK13)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,sK13))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
& leq(sK13,tptp_minus_1)
& leq(n0,sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f200,plain,
( ? [X0] :
( a_select3(q,pv10,X0) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X0)),minus(a_select2(x,pv10),a_select2(mu,X0))),tptp_minus_2),times(a_select2(sigma,X0),a_select2(sigma,X0)))),a_select2(rho,X0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(rectify,[],[f125]) ).
fof(f125,plain,
( ? [X1] :
( a_select3(q,pv10,X1) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X1)),minus(a_select2(x,pv10),a_select2(mu,X1))),tptp_minus_2),times(a_select2(sigma,X1),a_select2(sigma,X1)))),a_select2(rho,X1)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X1))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
& leq(X1,tptp_minus_1)
& leq(n0,X1) )
& ! [X0] :
( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X0) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
( ? [X1] :
( a_select3(q,pv10,X1) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X1)),minus(a_select2(x,pv10),a_select2(mu,X1))),tptp_minus_2),times(a_select2(sigma,X1),a_select2(sigma,X1)))),a_select2(rho,X1)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X1))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
& leq(X1,tptp_minus_1)
& leq(n0,X1) )
& ! [X0] :
( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X0) )
& leq(pv10,n135299)
& leq(n0,pv10) ),
inference(ennf_transformation,[],[f102]) ).
fof(f102,plain,
~ ( ( ! [X0] :
( ( leq(X0,pred(pv10))
& leq(n0,X0) )
=> n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X1] :
( ( leq(X1,tptp_minus_1)
& leq(n0,X1) )
=> a_select3(q,pv10,X1) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X1)),minus(a_select2(x,pv10),a_select2(mu,X1))),tptp_minus_2),times(a_select2(sigma,X1),a_select2(sigma,X1)))),a_select2(rho,X1)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X1))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ! [X13] :
( ( leq(X13,pred(pv10))
& leq(n0,X13) )
=> n1 = sum(n0,n4,a_select3(q,X13,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X17] :
( ( leq(X17,tptp_minus_1)
& leq(n0,X17) )
=> a_select3(q,pv10,X17) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X17)),minus(a_select2(x,pv10),a_select2(mu,X17))),tptp_minus_2),times(a_select2(sigma,X17),a_select2(sigma,X17)))),a_select2(rho,X17)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X17))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ! [X13] :
( ( leq(X13,pred(pv10))
& leq(n0,X13) )
=> n1 = sum(n0,n4,a_select3(q,X13,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X17] :
( ( leq(X17,tptp_minus_1)
& leq(n0,X17) )
=> a_select3(q,pv10,X17) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X17)),minus(a_select2(x,pv10),a_select2(mu,X17))),tptp_minus_2),times(a_select2(sigma,X17),a_select2(sigma,X17)))),a_select2(rho,X17)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X17))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0014) ).
fof(f337,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n0)
| n0 = X0 ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( n0 = X0
| ~ leq(X0,n0)
| ~ leq(n0,X0) ),
inference(flattening,[],[f136]) ).
fof(f136,plain,
! [X0] :
( n0 = X0
| ~ leq(X0,n0)
| ~ leq(n0,X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f93,axiom,
! [X0] :
( ( leq(X0,n0)
& leq(n0,X0) )
=> n0 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f269,plain,
leq(sK13,tptp_minus_1),
inference(cnf_transformation,[],[f202]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV164+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 05:33:41 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (18573)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (18576)WARNING: value z3 for option sas not known
% 0.14/0.37 % (18576)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38 % (18574)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (18577)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (18575)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (18578)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.38 % (18579)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.38 % (18580)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.44 % (18576)First to succeed.
% 0.21/0.44 % (18576)Refutation found. Thanks to Tanya!
% 0.21/0.44 % SZS status Theorem for theBenchmark
% 0.21/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.44 % (18576)------------------------------
% 0.21/0.44 % (18576)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.44 % (18576)Termination reason: Refutation
% 0.21/0.44
% 0.21/0.44 % (18576)Memory used [KB]: 2343
% 0.21/0.44 % (18576)Time elapsed: 0.073 s
% 0.21/0.44 % (18576)Instructions burned: 232 (million)
% 0.21/0.44 % (18576)------------------------------
% 0.21/0.44 % (18576)------------------------------
% 0.21/0.44 % (18573)Success in time 0.086 s
%------------------------------------------------------------------------------