TSTP Solution File: NUM489+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM489+1 : TPTP v8.2.0. Released v4.0.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 : n008.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 May 21 01:42:38 EDT 2024
% Result : Theorem 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 70 ( 25 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 85 ( 39 ~; 31 |; 10 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f300,plain,
$false,
inference(subsumption_resolution,[],[f299,f131]) ).
fof(f131,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f299,plain,
~ aNaturalNumber0(xp),
inference(subsumption_resolution,[],[f298,f129]) ).
fof(f129,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f298,plain,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp) ),
inference(subsumption_resolution,[],[f297,f135]) ).
fof(f135,plain,
sdtlseqdt0(xp,xn),
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1870) ).
fof(f297,plain,
( ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp) ),
inference(trivial_inequality_removal,[],[f296]) ).
fof(f296,plain,
( xn != xn
| ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp) ),
inference(superposition,[],[f215,f210]) ).
fof(f210,plain,
! [X0,X1] :
( sdtpldt0(X0,sdtmndt0(X1,X0)) = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f195]) ).
fof(f195,plain,
! [X2,X0,X1] :
( sdtpldt0(X0,X2) = X1
| sdtmndt0(X1,X0) != X2
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f128,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtmndt0(X1,X0) = X2
| sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtmndt0(X1,X0) != X2 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f127]) ).
fof(f127,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtmndt0(X1,X0) = X2
| sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtmndt0(X1,X0) != X2 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0,X1] :
( ! [X2] :
( sdtmndt0(X1,X0) = X2
<=> ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f107]) ).
fof(f107,plain,
! [X0,X1] :
( ! [X2] :
( sdtmndt0(X1,X0) = X2
<=> ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( sdtlseqdt0(X0,X1)
=> ! [X2] :
( sdtmndt0(X1,X0) = X2
<=> ( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(f215,plain,
xn != sdtpldt0(xp,sdtmndt0(xn,xp)),
inference(forward_demodulation,[],[f139,f136]) ).
fof(f136,plain,
xr = sdtmndt0(xn,xp),
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
fof(f139,plain,
xn != sdtpldt0(xp,xr),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
xn != sdtpldt0(xp,xr),
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
xn != sdtpldt0(xp,xr),
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
xn = sdtpldt0(xp,xr),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM489+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % 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.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 06:59:37 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 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/benchmark/theBenchmark.p
% 0.58/0.73 % (28107)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 theBenchmark for (2996ds/83Mi)
% 0.58/0.73 % (28101)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 theBenchmark for (2996ds/34Mi)
% 0.58/0.73 % (28102)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 theBenchmark for (2996ds/51Mi)
% 0.58/0.73 % (28103)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.73 % (28104)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.73 % (28105)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 theBenchmark for (2996ds/34Mi)
% 0.58/0.73 % (28106)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.58/0.74 % (28106)First to succeed.
% 0.58/0.74 % (28106)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28100"
% 0.58/0.74 % (28106)Refutation found. Thanks to Tanya!
% 0.58/0.74 % SZS status Theorem for theBenchmark
% 0.58/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.74 % (28106)------------------------------
% 0.58/0.74 % (28106)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (28106)Termination reason: Refutation
% 0.58/0.74
% 0.58/0.74 % (28106)Memory used [KB]: 1154
% 0.58/0.74 % (28106)Time elapsed: 0.006 s
% 0.58/0.74 % (28106)Instructions burned: 8 (million)
% 0.58/0.74 % (28100)Success in time 0.379 s
% 0.58/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------