TSTP Solution File: NUM477+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM477+2 : 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 : n023.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:32 EDT 2024
% Result : Theorem 0.47s 0.72s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 10 unt; 0 def)
% Number of atoms : 103 ( 28 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 96 ( 37 ~; 35 |; 15 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f383,plain,
$false,
inference(avatar_sat_refutation,[],[f259,f347,f349,f371,f380,f382]) ).
fof(f382,plain,
~ spl3_11,
inference(avatar_contradiction_clause,[],[f381]) ).
fof(f381,plain,
( $false
| ~ spl3_11 ),
inference(resolution,[],[f346,f173]) ).
fof(f173,plain,
~ sdtlseqdt0(xm,xn),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
( ~ sdtlseqdt0(xm,xn)
& ! [X0] :
( xn != sdtpldt0(xm,X0)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,negated_conjecture,
~ ( sdtlseqdt0(xm,xn)
| ? [X0] :
( xn = sdtpldt0(xm,X0)
& aNaturalNumber0(X0) ) ),
inference(negated_conjecture,[],[f37]) ).
fof(f37,conjecture,
( sdtlseqdt0(xm,xn)
| ? [X0] :
( xn = sdtpldt0(xm,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f346,plain,
( sdtlseqdt0(xm,xn)
| ~ spl3_11 ),
inference(avatar_component_clause,[],[f344]) ).
fof(f344,plain,
( spl3_11
<=> sdtlseqdt0(xm,xn) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_11])]) ).
fof(f380,plain,
~ spl3_12,
inference(avatar_contradiction_clause,[],[f379]) ).
fof(f379,plain,
( $false
| ~ spl3_12 ),
inference(trivial_inequality_removal,[],[f375]) ).
fof(f375,plain,
( sz00 != sz00
| ~ spl3_12 ),
inference(superposition,[],[f171,f363]) ).
fof(f363,plain,
( sz00 = xn
| ~ spl3_12 ),
inference(avatar_component_clause,[],[f361]) ).
fof(f361,plain,
( spl3_12
<=> sz00 = xn ),
introduced(avatar_definition,[new_symbols(naming,[spl3_12])]) ).
fof(f171,plain,
sz00 != xn,
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
( sz00 != xn
& doDivides0(xm,xn)
& xn = sdtasdt0(xm,sK2)
& aNaturalNumber0(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f36,f109]) ).
fof(f109,plain,
( ? [X0] :
( xn = sdtasdt0(xm,X0)
& aNaturalNumber0(X0) )
=> ( xn = sdtasdt0(xm,sK2)
& aNaturalNumber0(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f36,axiom,
( sz00 != xn
& doDivides0(xm,xn)
& ? [X0] :
( xn = sdtasdt0(xm,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1494_04) ).
fof(f371,plain,
( ~ spl3_4
| spl3_12
| ~ spl3_10 ),
inference(avatar_split_clause,[],[f355,f340,f361,f219]) ).
fof(f219,plain,
( spl3_4
<=> aNaturalNumber0(xm) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f340,plain,
( spl3_10
<=> sz00 = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_10])]) ).
fof(f355,plain,
( sz00 = xn
| ~ aNaturalNumber0(xm)
| ~ spl3_10 ),
inference(superposition,[],[f124,f350]) ).
fof(f350,plain,
( xn = sdtasdt0(xm,sz00)
| ~ spl3_10 ),
inference(superposition,[],[f169,f342]) ).
fof(f342,plain,
( sz00 = sK2
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f340]) ).
fof(f169,plain,
xn = sdtasdt0(xm,sK2),
inference(cnf_transformation,[],[f110]) ).
fof(f124,plain,
! [X0] :
( sz00 = sdtasdt0(X0,sz00)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulZero) ).
fof(f349,plain,
spl3_9,
inference(avatar_contradiction_clause,[],[f348]) ).
fof(f348,plain,
( $false
| spl3_9 ),
inference(resolution,[],[f338,f168]) ).
fof(f168,plain,
aNaturalNumber0(sK2),
inference(cnf_transformation,[],[f110]) ).
fof(f338,plain,
( ~ aNaturalNumber0(sK2)
| spl3_9 ),
inference(avatar_component_clause,[],[f336]) ).
fof(f336,plain,
( spl3_9
<=> aNaturalNumber0(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_9])]) ).
fof(f347,plain,
( ~ spl3_9
| ~ spl3_4
| spl3_10
| spl3_11 ),
inference(avatar_split_clause,[],[f321,f344,f340,f219,f336]) ).
fof(f321,plain,
( sdtlseqdt0(xm,xn)
| sz00 = sK2
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(sK2) ),
inference(superposition,[],[f156,f169]) ).
fof(f156,plain,
! [X0,X1] :
( sdtlseqdt0(X1,sdtasdt0(X1,X0))
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f85,plain,
! [X0,X1] :
( sdtlseqdt0(X1,sdtasdt0(X1,X0))
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f84]) ).
fof(f84,plain,
! [X0,X1] :
( sdtlseqdt0(X1,sdtasdt0(X1,X0))
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( sz00 != X0
=> sdtlseqdt0(X1,sdtasdt0(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMonMul2) ).
fof(f259,plain,
spl3_4,
inference(avatar_contradiction_clause,[],[f258]) ).
fof(f258,plain,
( $false
| spl3_4 ),
inference(resolution,[],[f221,f166]) ).
fof(f166,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1494) ).
fof(f221,plain,
( ~ aNaturalNumber0(xm)
| spl3_4 ),
inference(avatar_component_clause,[],[f219]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM477+2 : TPTP v8.2.0. Released v4.0.0.
% 0.07/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.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 04:26:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/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/benchmark/theBenchmark.p
% 0.47/0.71 % (3924)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 (2996ds/56Mi)
% 0.47/0.71 % (3918)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.47/0.71 % (3923)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.47/0.71 % (3920)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.47/0.71 % (3919)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.71 % (3918)First to succeed.
% 0.47/0.72 % (3918)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3916"
% 0.47/0.72 % (3917)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.47/0.72 % (3918)Refutation found. Thanks to Tanya!
% 0.47/0.72 % SZS status Theorem for theBenchmark
% 0.47/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.72 % (3918)------------------------------
% 0.47/0.72 % (3918)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.72 % (3918)Termination reason: Refutation
% 0.47/0.72
% 0.47/0.72 % (3918)Memory used [KB]: 1169
% 0.47/0.72 % (3918)Time elapsed: 0.008 s
% 0.47/0.72 % (3918)Instructions burned: 10 (million)
% 0.47/0.72 % (3916)Success in time 0.35 s
% 0.47/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------