TSTP Solution File: NUM505+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM505+1 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 08:12:36 EDT 2024
% Result : Theorem 0.59s 0.78s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 73 ( 13 unt; 0 def)
% Number of atoms : 280 ( 88 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 345 ( 138 ~; 130 |; 57 &)
% ( 11 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 52 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f602,plain,
$false,
inference(avatar_sat_refutation,[],[f244,f307,f553,f555,f559,f601]) ).
fof(f601,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f600]) ).
fof(f600,plain,
( $false
| ~ spl4_1
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f599,f590]) ).
fof(f590,plain,
( ~ sdtlseqdt0(xp,xp)
| ~ spl4_1 ),
inference(superposition,[],[f159,f239]) ).
fof(f239,plain,
( xp = xk
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f237,plain,
( spl4_1
<=> xp = xk ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f159,plain,
~ sdtlseqdt0(xp,xk),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
( ( ~ sdtlseqdt0(xk,xp)
| xp = xk )
& ~ sdtlseqdt0(xp,xk) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,negated_conjecture,
~ ( ~ sdtlseqdt0(xp,xk)
=> ( sdtlseqdt0(xk,xp)
& xp != xk ) ),
inference(negated_conjecture,[],[f50]) ).
fof(f50,conjecture,
( ~ sdtlseqdt0(xp,xk)
=> ( sdtlseqdt0(xk,xp)
& xp != xk ) ),
file('/export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',m__) ).
fof(f599,plain,
( sdtlseqdt0(xp,xp)
| ~ spl4_1
| ~ spl4_2 ),
inference(superposition,[],[f242,f239]) ).
fof(f242,plain,
( sdtlseqdt0(xk,xp)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl4_2
<=> sdtlseqdt0(xk,xp) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f559,plain,
( spl4_12
| spl4_3
| ~ spl4_5 ),
inference(avatar_split_clause,[],[f558,f278,f249,f323]) ).
fof(f323,plain,
( spl4_12
<=> sz00 = xp ),
introduced(avatar_definition,[new_symbols(naming,[spl4_12])]) ).
fof(f249,plain,
( spl4_3
<=> aNaturalNumber0(xk) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f278,plain,
( spl4_5
<=> aNaturalNumber0(sdtasdt0(xn,xm)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f558,plain,
( aNaturalNumber0(xk)
| sz00 = xp
| ~ spl4_5 ),
inference(subsumption_resolution,[],[f557,f139]) ).
fof(f139,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',m__1837) ).
fof(f557,plain,
( aNaturalNumber0(xk)
| sz00 = xp
| ~ aNaturalNumber0(xp)
| ~ spl4_5 ),
inference(subsumption_resolution,[],[f556,f279]) ).
fof(f279,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f556,plain,
( aNaturalNumber0(xk)
| sz00 = xp
| ~ aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xp) ),
inference(subsumption_resolution,[],[f502,f142]) ).
fof(f142,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
( doDivides0(xp,sdtasdt0(xn,xm))
& isPrime0(xp) ),
file('/export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',m__1860) ).
fof(f502,plain,
( aNaturalNumber0(xk)
| ~ doDivides0(xp,sdtasdt0(xn,xm))
| sz00 = xp
| ~ aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xp) ),
inference(superposition,[],[f233,f149]) ).
fof(f149,plain,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(cnf_transformation,[],[f45]) ).
fof(f45,axiom,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
file('/export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',m__2306) ).
fof(f233,plain,
! [X0,X1] :
( aNaturalNumber0(sdtsldt0(X1,X0))
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f216]) ).
fof(f216,plain,
! [X2,X0,X1] :
( aNaturalNumber0(X2)
| sdtsldt0(X1,X0) != X2
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtsldt0(X1,X0) = X2
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtsldt0(X1,X0) != X2 ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f135]) ).
fof(f135,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtsldt0(X1,X0) = X2
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtsldt0(X1,X0) != X2 ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0,X1] :
( ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f115]) ).
fof(f115,plain,
! [X0,X1] :
( ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( doDivides0(X0,X1)
& sz00 != X0 )
=> ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',mDefQuot) ).
fof(f555,plain,
( ~ spl4_3
| spl4_2 ),
inference(avatar_split_clause,[],[f554,f241,f249]) ).
fof(f554,plain,
( sdtlseqdt0(xk,xp)
| ~ aNaturalNumber0(xk) ),
inference(subsumption_resolution,[],[f246,f139]) ).
fof(f246,plain,
( sdtlseqdt0(xk,xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xk) ),
inference(resolution,[],[f159,f211]) ).
fof(f211,plain,
! [X0,X1] :
( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0,X1] :
( ( sdtlseqdt0(X1,X0)
& X0 != X1 )
| sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f106]) ).
fof(f106,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/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',mLETotal) ).
fof(f553,plain,
~ spl4_12,
inference(avatar_contradiction_clause,[],[f552]) ).
fof(f552,plain,
( $false
| ~ spl4_12 ),
inference(subsumption_resolution,[],[f551,f219]) ).
fof(f219,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',mSortsC) ).
fof(f551,plain,
( ~ aNaturalNumber0(sz00)
| ~ spl4_12 ),
inference(resolution,[],[f534,f229]) ).
fof(f229,plain,
( ~ isPrime0(sz00)
| ~ aNaturalNumber0(sz00) ),
inference(equality_resolution,[],[f203]) ).
fof(f203,plain,
! [X0] :
( sz00 != X0
| ~ isPrime0(X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
! [X0] :
( ( ( isPrime0(X0)
| ( sK3(X0) != X0
& sz10 != sK3(X0)
& doDivides0(sK3(X0),X0)
& aNaturalNumber0(sK3(X0)) )
| sz10 = X0
| sz00 = X0 )
& ( ( ! [X2] :
( X0 = X2
| sz10 = X2
| ~ doDivides0(X2,X0)
| ~ aNaturalNumber0(X2) )
& sz10 != X0
& sz00 != X0 )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f132,f133]) ).
fof(f133,plain,
! [X0] :
( ? [X1] :
( X0 != X1
& sz10 != X1
& doDivides0(X1,X0)
& aNaturalNumber0(X1) )
=> ( sK3(X0) != X0
& sz10 != sK3(X0)
& doDivides0(sK3(X0),X0)
& aNaturalNumber0(sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
! [X0] :
( ( ( isPrime0(X0)
| ? [X1] :
( X0 != X1
& sz10 != X1
& doDivides0(X1,X0)
& aNaturalNumber0(X1) )
| sz10 = X0
| sz00 = X0 )
& ( ( ! [X2] :
( X0 = X2
| sz10 = X2
| ~ doDivides0(X2,X0)
| ~ aNaturalNumber0(X2) )
& sz10 != X0
& sz00 != X0 )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(rectify,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ( ( isPrime0(X0)
| ? [X1] :
( X0 != X1
& sz10 != X1
& doDivides0(X1,X0)
& aNaturalNumber0(X1) )
| sz10 = X0
| sz00 = X0 )
& ( ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ( ( isPrime0(X0)
| ? [X1] :
( X0 != X1
& sz10 != X1
& doDivides0(X1,X0)
& aNaturalNumber0(X1) )
| sz10 = X0
| sz00 = X0 )
& ( ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0] :
( ( isPrime0(X0)
<=> ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 ) )
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
! [X0] :
( ( isPrime0(X0)
<=> ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 ) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( isPrime0(X0)
<=> ( ! [X1] :
( ( doDivides0(X1,X0)
& aNaturalNumber0(X1) )
=> ( X0 = X1
| sz10 = X1 ) )
& sz10 != X0
& sz00 != X0 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',mDefPrime) ).
fof(f534,plain,
( isPrime0(sz00)
| ~ spl4_12 ),
inference(superposition,[],[f141,f325]) ).
fof(f325,plain,
( sz00 = xp
| ~ spl4_12 ),
inference(avatar_component_clause,[],[f323]) ).
fof(f141,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f41]) ).
fof(f307,plain,
spl4_5,
inference(avatar_contradiction_clause,[],[f306]) ).
fof(f306,plain,
( $false
| spl4_5 ),
inference(subsumption_resolution,[],[f305,f137]) ).
fof(f137,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f305,plain,
( ~ aNaturalNumber0(xn)
| spl4_5 ),
inference(subsumption_resolution,[],[f304,f138]) ).
fof(f138,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f39]) ).
fof(f304,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn)
| spl4_5 ),
inference(resolution,[],[f280,f194]) ).
fof(f194,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f94]) ).
fof(f94,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918',mSortsB_02) ).
fof(f280,plain,
( ~ aNaturalNumber0(sdtasdt0(xn,xm))
| spl4_5 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f244,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f160,f241,f237]) ).
fof(f160,plain,
( ~ sdtlseqdt0(xk,xp)
| xp = xk ),
inference(cnf_transformation,[],[f57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : NUM505+1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.30 % Computer : n009.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Fri May 3 14:11:52 EDT 2024
% 0.09/0.31 % CPUTime :
% 0.09/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.31 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.QTafFKA4ri/Vampire---4.8_14918
% 0.59/0.77 % (15027)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 (2995ds/34Mi)
% 0.59/0.77 % (15030)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.59/0.77 % (15029)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.59/0.77 % (15031)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 (2995ds/34Mi)
% 0.59/0.77 % (15028)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 (2995ds/51Mi)
% 0.59/0.77 % (15032)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.59/0.77 % (15033)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 (2995ds/83Mi)
% 0.59/0.77 % (15034)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 (2995ds/56Mi)
% 0.59/0.78 % (15032)First to succeed.
% 0.59/0.78 % (15032)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15026"
% 0.59/0.78 % (15032)Refutation found. Thanks to Tanya!
% 0.59/0.78 % SZS status Theorem for Vampire---4
% 0.59/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.78 % (15032)------------------------------
% 0.59/0.78 % (15032)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78 % (15032)Termination reason: Refutation
% 0.59/0.78
% 0.59/0.78 % (15032)Memory used [KB]: 1226
% 0.59/0.78 % (15032)Time elapsed: 0.012 s
% 0.59/0.78 % (15032)Instructions burned: 18 (million)
% 0.59/0.78 % (15026)Success in time 0.461 s
% 0.59/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------