TSTP Solution File: NUM482+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM482+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/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:29 EDT 2024
% Result : Theorem 0.37s 0.59s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 129 ( 18 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 146 ( 59 ~; 55 |; 20 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 31 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f473,plain,
$false,
inference(avatar_sat_refutation,[],[f335,f440,f468,f470,f472]) ).
fof(f472,plain,
spl4_13,
inference(avatar_contradiction_clause,[],[f471]) ).
fof(f471,plain,
( $false
| spl4_13 ),
inference(resolution,[],[f463,f200]) ).
fof(f200,plain,
isPrime0(xk),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
( ! [X0] :
( ~ isPrime0(X0)
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) )
& isPrime0(xk) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,negated_conjecture,
~ ( isPrime0(xk)
=> ? [X0] :
( isPrime0(X0)
& doDivides0(X0,xk)
& aNaturalNumber0(X0) ) ),
inference(negated_conjecture,[],[f41]) ).
fof(f41,conjecture,
( isPrime0(xk)
=> ? [X0] :
( isPrime0(X0)
& doDivides0(X0,xk)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.770NpIbDLg/Vampire---4.8_12660',m__) ).
fof(f463,plain,
( ~ isPrime0(xk)
| spl4_13 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f461,plain,
( spl4_13
<=> isPrime0(xk) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_13])]) ).
fof(f470,plain,
spl4_14,
inference(avatar_contradiction_clause,[],[f469]) ).
fof(f469,plain,
( $false
| spl4_14 ),
inference(resolution,[],[f467,f194]) ).
fof(f194,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
aNaturalNumber0(xk),
file('/export/starexec/sandbox/tmp/tmp.770NpIbDLg/Vampire---4.8_12660',m__1716) ).
fof(f467,plain,
( ~ aNaturalNumber0(xk)
| spl4_14 ),
inference(avatar_component_clause,[],[f465]) ).
fof(f465,plain,
( spl4_14
<=> aNaturalNumber0(xk) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_14])]) ).
fof(f468,plain,
( ~ spl4_13
| ~ spl4_14
| ~ spl4_9 ),
inference(avatar_split_clause,[],[f459,f438,f465,f461]) ).
fof(f438,plain,
( spl4_9
<=> ! [X0] :
( ~ aNaturalNumber0(X0)
| doDivides0(X0,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_9])]) ).
fof(f459,plain,
( ~ aNaturalNumber0(xk)
| ~ isPrime0(xk)
| ~ spl4_9 ),
inference(duplicate_literal_removal,[],[f456]) ).
fof(f456,plain,
( ~ aNaturalNumber0(xk)
| ~ isPrime0(xk)
| ~ aNaturalNumber0(xk)
| ~ spl4_9 ),
inference(resolution,[],[f439,f201]) ).
fof(f201,plain,
! [X0] :
( ~ doDivides0(X0,xk)
| ~ isPrime0(X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f439,plain,
( ! [X0] :
( doDivides0(X0,X0)
| ~ aNaturalNumber0(X0) )
| ~ spl4_9 ),
inference(avatar_component_clause,[],[f438]) ).
fof(f440,plain,
( ~ spl4_1
| spl4_9 ),
inference(avatar_split_clause,[],[f435,f438,f216]) ).
fof(f216,plain,
( spl4_1
<=> aNaturalNumber0(sz10) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f435,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sz10)
| doDivides0(X0,X0) ),
inference(duplicate_literal_removal,[],[f423]) ).
fof(f423,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sz10)
| doDivides0(X0,X0)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X0) ),
inference(superposition,[],[f208,f140]) ).
fof(f140,plain,
! [X0] :
( sdtasdt0(X0,sz10) = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0] :
( ( sdtasdt0(sz10,X0) = X0
& sdtasdt0(X0,sz10) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtasdt0(sz10,X0) = X0
& sdtasdt0(X0,sz10) = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.770NpIbDLg/Vampire---4.8_12660',m_MulUnit) ).
fof(f208,plain,
! [X2,X0] :
( ~ aNaturalNumber0(sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X2)
| doDivides0(X0,sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f178]) ).
fof(f178,plain,
! [X2,X0,X1] :
( doDivides0(X0,X1)
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ( sdtasdt0(X0,sK1(X0,X1)) = X1
& aNaturalNumber0(sK1(X0,X1)) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f117,f118]) ).
fof(f118,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X0,sK1(X0,X1)) = X1
& aNaturalNumber0(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f117,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,[],[f116]) ).
fof(f116,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,[],[f92]) ).
fof(f92,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f91]) ).
fof(f91,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/sandbox/tmp/tmp.770NpIbDLg/Vampire---4.8_12660',mDefDiv) ).
fof(f335,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f334]) ).
fof(f334,plain,
( $false
| spl4_1 ),
inference(resolution,[],[f218,f130]) ).
fof(f130,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
( sz00 != sz10
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/tmp/tmp.770NpIbDLg/Vampire---4.8_12660',mSortsC_01) ).
fof(f218,plain,
( ~ aNaturalNumber0(sz10)
| spl4_1 ),
inference(avatar_component_clause,[],[f216]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : NUM482+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.08 % 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.07/0.27 % Computer : n026.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Tue Apr 30 17:15:34 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.07/0.27 This is a FOF_THM_RFO_SEQ problem
% 0.07/0.27 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.770NpIbDLg/Vampire---4.8_12660
% 0.37/0.58 % (12902)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 (2997ds/83Mi)
% 0.37/0.58 % (12896)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 (2997ds/34Mi)
% 0.37/0.58 % (12898)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2997ds/78Mi)
% 0.37/0.58 % (12899)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2997ds/33Mi)
% 0.37/0.58 % (12897)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 (2997ds/51Mi)
% 0.37/0.58 % (12901)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2997ds/45Mi)
% 0.37/0.58 % (12900)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 (2997ds/34Mi)
% 0.37/0.58 % (12899)Refutation not found, incomplete strategy% (12899)------------------------------
% 0.37/0.58 % (12899)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.37/0.58 % (12899)Termination reason: Refutation not found, incomplete strategy
% 0.37/0.58
% 0.37/0.58 % (12899)Memory used [KB]: 1048
% 0.37/0.58 % (12899)Time elapsed: 0.005 s
% 0.37/0.58 % (12899)Instructions burned: 5 (million)
% 0.37/0.58 % (12899)------------------------------
% 0.37/0.58 % (12899)------------------------------
% 0.37/0.58 % (12897)First to succeed.
% 0.37/0.59 % (12903)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 (2997ds/56Mi)
% 0.37/0.59 % (12897)Refutation found. Thanks to Tanya!
% 0.37/0.59 % SZS status Theorem for Vampire---4
% 0.37/0.59 % SZS output start Proof for Vampire---4
% See solution above
% 0.37/0.59 % (12897)------------------------------
% 0.37/0.59 % (12897)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.37/0.59 % (12897)Termination reason: Refutation
% 0.37/0.59
% 0.37/0.59 % (12897)Memory used [KB]: 1183
% 0.37/0.59 % (12897)Time elapsed: 0.009 s
% 0.37/0.59 % (12897)Instructions burned: 12 (million)
% 0.37/0.59 % (12897)------------------------------
% 0.37/0.59 % (12897)------------------------------
% 0.37/0.59 % (12892)Success in time 0.302 s
% 0.37/0.59 % Vampire---4.8 exiting
%------------------------------------------------------------------------------