TSTP Solution File: NUM523+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM523+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.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:58 EDT 2024
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 59 ( 10 unt; 0 def)
% Number of atoms : 193 ( 17 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 232 ( 98 ~; 99 |; 23 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 42 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f403,plain,
$false,
inference(avatar_sat_refutation,[],[f213,f227,f368,f371,f384]) ).
fof(f384,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f383]) ).
fof(f383,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f382,f126]) ).
fof(f126,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
( sz00 != xp
& sz00 != xm
& sz00 != xn
& aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2987) ).
fof(f382,plain,
( ~ aNaturalNumber0(xn)
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f381,f128]) ).
fof(f128,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f40]) ).
fof(f381,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f380,f134]) ).
fof(f134,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
isPrime0(xp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3025) ).
fof(f380,plain,
( ~ isPrime0(xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f379,f212]) ).
fof(f212,plain,
( ~ doDivides0(xp,xn)
| spl4_2 ),
inference(avatar_component_clause,[],[f210]) ).
fof(f210,plain,
( spl4_2
<=> doDivides0(xp,xn) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f379,plain,
( doDivides0(xp,xn)
| ~ isPrime0(xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ spl4_1 ),
inference(duplicate_literal_removal,[],[f376]) ).
fof(f376,plain,
( doDivides0(xp,xn)
| doDivides0(xp,xn)
| ~ isPrime0(xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xn)
| ~ spl4_1 ),
inference(resolution,[],[f207,f146]) ).
fof(f146,plain,
! [X2,X0,X1] :
( ~ doDivides0(X2,sdtasdt0(X0,X1))
| doDivides0(X2,X0)
| doDivides0(X2,X1)
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1,X2] :
( doDivides0(X2,X1)
| doDivides0(X2,X0)
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f64]) ).
fof(f64,plain,
! [X0,X1,X2] :
( doDivides0(X2,X1)
| doDivides0(X2,X0)
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( doDivides0(X2,sdtasdt0(X0,X1))
& isPrime0(X2) )
=> ( doDivides0(X2,X1)
| doDivides0(X2,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mPDP) ).
fof(f207,plain,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f206,plain,
( spl4_1
<=> doDivides0(xp,sdtasdt0(xn,xn)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f371,plain,
( ~ spl4_5
| spl4_1
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f370,f217,f206,f253]) ).
fof(f253,plain,
( spl4_5
<=> aNaturalNumber0(sdtasdt0(xm,xm)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f217,plain,
( spl4_3
<=> aNaturalNumber0(sdtasdt0(xn,xn)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f370,plain,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| ~ spl4_3 ),
inference(subsumption_resolution,[],[f369,f128]) ).
fof(f369,plain,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| ~ aNaturalNumber0(xp)
| ~ spl4_3 ),
inference(subsumption_resolution,[],[f249,f218]) ).
fof(f218,plain,
( aNaturalNumber0(sdtasdt0(xn,xn))
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f249,plain,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| ~ aNaturalNumber0(sdtasdt0(xn,xn))
| ~ aNaturalNumber0(xp) ),
inference(superposition,[],[f200,f133]) ).
fof(f133,plain,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3014) ).
fof(f200,plain,
! [X2,X0] :
( doDivides0(X0,sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f163]) ).
fof(f163,plain,
! [X2,X0,X1] :
( doDivides0(X0,X1)
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ( sdtasdt0(X0,sK2(X0,X1)) = X1
& aNaturalNumber0(sK2(X0,X1)) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f119,f120]) ).
fof(f120,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X0,sK2(X0,X1)) = X1
& aNaturalNumber0(sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(rectify,[],[f118]) ).
fof(f118,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f78]) ).
fof(f78,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(f368,plain,
spl4_5,
inference(avatar_contradiction_clause,[],[f367]) ).
fof(f367,plain,
( $false
| spl4_5 ),
inference(subsumption_resolution,[],[f366,f127]) ).
fof(f127,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f40]) ).
fof(f366,plain,
( ~ aNaturalNumber0(xm)
| spl4_5 ),
inference(duplicate_literal_removal,[],[f365]) ).
fof(f365,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xm)
| spl4_5 ),
inference(resolution,[],[f255,f145]) ).
fof(f145,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f62]) ).
fof(f62,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/benchmark/theBenchmark.p',mSortsB_02) ).
fof(f255,plain,
( ~ aNaturalNumber0(sdtasdt0(xm,xm))
| spl4_5 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f227,plain,
spl4_3,
inference(avatar_contradiction_clause,[],[f226]) ).
fof(f226,plain,
( $false
| spl4_3 ),
inference(subsumption_resolution,[],[f225,f126]) ).
fof(f225,plain,
( ~ aNaturalNumber0(xn)
| spl4_3 ),
inference(duplicate_literal_removal,[],[f224]) ).
fof(f224,plain,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xn)
| spl4_3 ),
inference(resolution,[],[f219,f145]) ).
fof(f219,plain,
( ~ aNaturalNumber0(sdtasdt0(xn,xn))
| spl4_3 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f213,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f135,f210,f206]) ).
fof(f135,plain,
( ~ doDivides0(xp,xn)
| ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
( ~ doDivides0(xp,xn)
| ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
inference(ennf_transformation,[],[f45]) ).
fof(f45,negated_conjecture,
~ ( doDivides0(xp,xn)
& doDivides0(xp,sdtasdt0(xn,xn)) ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
( doDivides0(xp,xn)
& doDivides0(xp,sdtasdt0(xn,xn)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM523+1 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13 % 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.13/0.34 % Computer : n017.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.34 % DateTime : Mon May 20 05:38:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.34 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/benchmark/theBenchmark.p
% 0.61/0.79 % (12155)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 (2995ds/34Mi)
% 0.61/0.79 % (12158)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.61/0.79 % (12156)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 (2995ds/51Mi)
% 0.61/0.79 % (12157)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.79 % (12160)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.61/0.79 % (12159)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 (2995ds/34Mi)
% 0.61/0.79 % (12161)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 (2995ds/83Mi)
% 0.61/0.79 % (12162)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.61/0.79 % (12160)First to succeed.
% 0.61/0.79 % (12160)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12154"
% 0.61/0.80 % (12160)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for theBenchmark
% 0.61/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.80 % (12160)------------------------------
% 0.61/0.80 % (12160)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (12160)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (12160)Memory used [KB]: 1197
% 0.61/0.80 % (12160)Time elapsed: 0.008 s
% 0.61/0.80 % (12160)Instructions burned: 13 (million)
% 0.61/0.80 % (12154)Success in time 0.445 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------