TSTP Solution File: NUM429+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM429+3 : 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 : n021.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:04 EDT 2024
% Result : Theorem 0.56s 0.78s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 46 ( 16 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 40 ( 8 ~; 3 |; 27 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 3 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f116,plain,
$false,
inference(resolution,[],[f103,f115]) ).
fof(f115,plain,
~ aInteger0(sK2),
inference(equality_resolution,[],[f114]) ).
fof(f114,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtasdt0(xq,sK2)
| ~ aInteger0(X0) ),
inference(forward_demodulation,[],[f111,f104]) ).
fof(f104,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK2),
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK1)
& aInteger0(sK1)
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK2)
& aInteger0(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f27,f65,f64]) ).
fof(f64,plain,
( ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) )
=> ( sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK1)
& aInteger0(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f65,plain,
( ? [X1] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1)
& aInteger0(X1) )
=> ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK2)
& aInteger0(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) )
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ? [X1] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1)
& aInteger0(X1) ) ),
inference(rectify,[],[f23]) ).
fof(f23,axiom,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) )
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).
fof(f111,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
inference(negated_conjecture,[],[f24]) ).
fof(f24,conjecture,
? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f103,plain,
aInteger0(sK2),
inference(cnf_transformation,[],[f66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM429+3 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.10 % 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.10/0.30 % Computer : n021.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.30 % CPULimit : 300
% 0.14/0.30 % WCLimit : 300
% 0.14/0.30 % DateTime : Mon May 20 03:46:53 EDT 2024
% 0.14/0.30 % CPUTime :
% 0.14/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.30 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.56/0.77 % (1451)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.56/0.77 % (1449)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.56/0.77 % (1450)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.56/0.77 % (1452)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.56/0.77 % (1453)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.56/0.77 % (1454)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.56/0.77 % (1455)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.56/0.77 % (1456)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.56/0.78 % (1450)First to succeed.
% 0.56/0.78 % (1449)Also succeeded, but the first one will report.
% 0.56/0.78 % (1450)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1448"
% 0.56/0.78 % (1451)Also succeeded, but the first one will report.
% 0.56/0.78 % (1456)Also succeeded, but the first one will report.
% 0.56/0.78 % (1453)Also succeeded, but the first one will report.
% 0.56/0.78 % (1450)Refutation found. Thanks to Tanya!
% 0.56/0.78 % SZS status Theorem for theBenchmark
% 0.56/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.78 % (1450)------------------------------
% 0.56/0.78 % (1450)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.78 % (1450)Termination reason: Refutation
% 0.56/0.78
% 0.56/0.78 % (1450)Memory used [KB]: 1042
% 0.56/0.78 % (1450)Time elapsed: 0.004 s
% 0.56/0.78 % (1450)Instructions burned: 4 (million)
% 0.56/0.78 % (1448)Success in time 0.476 s
% 0.56/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------