TSTP Solution File: NUM464+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM464+2 : TPTP v8.1.2. 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 : n026.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 May 1 03:31:22 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 77 ( 28 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 85 ( 35 ~; 31 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f142,plain,
$false,
inference(subsumption_resolution,[],[f139,f138]) ).
fof(f138,plain,
sdtlseqdt0(sz10,sz10),
inference(forward_demodulation,[],[f137,f132]) ).
fof(f132,plain,
sz10 = xm,
inference(subsumption_resolution,[],[f131,f77]) ).
fof(f77,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f27]) ).
fof(f27,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox/tmp/tmp.fEuhLgXERL/Vampire---4.8_16035',m__987) ).
fof(f131,plain,
( sz10 = xm
| ~ aNaturalNumber0(xm) ),
inference(subsumption_resolution,[],[f128,f79]) ).
fof(f79,plain,
sz00 != xm,
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
( ~ sdtlseqdt0(sz10,xm)
& ! [X0] :
( xm != sdtpldt0(sz10,X0)
| ~ aNaturalNumber0(X0) )
& sz00 != xm ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
( ~ sdtlseqdt0(sz10,xm)
& ! [X0] :
( xm != sdtpldt0(sz10,X0)
| ~ aNaturalNumber0(X0) )
& sz00 != xm ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,negated_conjecture,
~ ( sz00 != xm
=> ( sdtlseqdt0(sz10,xm)
| ? [X0] :
( xm = sdtpldt0(sz10,X0)
& aNaturalNumber0(X0) ) ) ),
inference(negated_conjecture,[],[f28]) ).
fof(f28,conjecture,
( sz00 != xm
=> ( sdtlseqdt0(sz10,xm)
| ? [X0] :
( xm = sdtpldt0(sz10,X0)
& aNaturalNumber0(X0) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fEuhLgXERL/Vampire---4.8_16035',m__) ).
fof(f128,plain,
( sz10 = xm
| sz00 = xm
| ~ aNaturalNumber0(xm) ),
inference(resolution,[],[f81,f88]) ).
fof(f88,plain,
! [X0] :
( sdtlseqdt0(sz10,X0)
| sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0] :
( ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0] :
( ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| sz10 = X0
| sz00 = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.fEuhLgXERL/Vampire---4.8_16035',mLENTr) ).
fof(f81,plain,
~ sdtlseqdt0(sz10,xm),
inference(cnf_transformation,[],[f32]) ).
fof(f137,plain,
sdtlseqdt0(xm,sz10),
inference(subsumption_resolution,[],[f136,f77]) ).
fof(f136,plain,
( sdtlseqdt0(xm,sz10)
| ~ aNaturalNumber0(xm) ),
inference(subsumption_resolution,[],[f130,f91]) ).
fof(f91,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
( sz00 != sz10
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/tmp/tmp.fEuhLgXERL/Vampire---4.8_16035',mSortsC_01) ).
fof(f130,plain,
( sdtlseqdt0(xm,sz10)
| ~ aNaturalNumber0(sz10)
| ~ aNaturalNumber0(xm) ),
inference(resolution,[],[f81,f98]) ).
fof(f98,plain,
! [X0,X1] :
( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1] :
( ( sdtlseqdt0(X1,X0)
& X0 != X1 )
| sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ( sdtlseqdt0(X1,X0)
& X0 != X1 )
| sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& X0 != X1 )
| sdtlseqdt0(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.fEuhLgXERL/Vampire---4.8_16035',mLETotal) ).
fof(f139,plain,
~ sdtlseqdt0(sz10,sz10),
inference(superposition,[],[f81,f132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% 0.11/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.16/0.36 % Computer : n026.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 17:16:34 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.fEuhLgXERL/Vampire---4.8_16035
% 0.55/0.73 % (16293)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.55/0.73 % (16287)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.55/0.73 % (16288)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.55/0.73 % (16290)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.55/0.73 % (16289)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.55/0.73 % (16292)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.55/0.73 % (16294)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.55/0.73 % (16291)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.55/0.74 % (16292)First to succeed.
% 0.55/0.74 % (16290)Also succeeded, but the first one will report.
% 0.55/0.74 % (16292)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for Vampire---4
% 0.55/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.74 % (16292)------------------------------
% 0.55/0.74 % (16292)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.74 % (16292)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (16292)Memory used [KB]: 1054
% 0.55/0.74 % (16292)Time elapsed: 0.004 s
% 0.55/0.74 % (16292)Instructions burned: 5 (million)
% 0.55/0.74 % (16292)------------------------------
% 0.55/0.74 % (16292)------------------------------
% 0.55/0.74 % (16283)Success in time 0.367 s
% 0.55/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------