TSTP Solution File: NUM837+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM837+2 : TPTP v8.2.0. Released v4.1.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 : n018.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:46:22 EDT 2024
% Result : Theorem 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 28 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 10 ~; 7 |; 3 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 19 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,plain,
$false,
inference(subsumption_resolution,[],[f62,f44]) ).
fof(f44,plain,
! [X0] : vd269 != vplus(vd268,X0),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] : vd269 != vplus(vd268,X0),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0] : vd269 = vplus(vd268,X0),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0] : vd269 = vplus(vd268,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(171)') ).
fof(f62,plain,
vd269 = vplus(vd268,sK2(vd269,vd268)),
inference(resolution,[],[f53,f45]) ).
fof(f45,plain,
less(vd268,vd269),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
less(vd268,vd269),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct1(170), 270, 0)') ).
fof(f53,plain,
! [X0,X1] :
( ~ less(X1,X0)
| vplus(X1,sK2(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( vplus(X1,sK2(X0,X1)) = X0
| ~ less(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f41,f42]) ).
fof(f42,plain,
! [X0,X1] :
( ? [X3] : vplus(X1,X3) = X0
=> vplus(X1,sK2(X0,X1)) = X0 ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( ? [X3] : vplus(X1,X3) = X0
| ~ less(X1,X0) ) ),
inference(rectify,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( ? [X2] : vplus(X1,X2) = X0
| ~ less(X1,X0) ) ),
inference(nnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( less(X1,X0)
<=> ? [X2] : vplus(X1,X2) = X0 ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X15,X16] :
( less(X16,X15)
<=> ? [X17] : vplus(X16,X17) = X15 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM837+2 : TPTP v8.2.0. Released v4.1.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.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 05:34:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/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.58/0.74 % (22498)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.58/0.74 % (22498)Refutation not found, incomplete strategy% (22498)------------------------------
% 0.58/0.74 % (22498)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (22498)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (22498)Memory used [KB]: 1023
% 0.58/0.74 % (22498)Time elapsed: 0.002 s
% 0.58/0.74 % (22498)Instructions burned: 2 (million)
% 0.58/0.74 % (22498)------------------------------
% 0.58/0.74 % (22498)------------------------------
% 0.58/0.74 % (22491)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.58/0.74 % (22493)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.74 % (22492)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.58/0.74 % (22495)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 (2996ds/34Mi)
% 0.58/0.74 % (22496)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.58/0.74 % (22494)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.58/0.74 % (22497)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.58/0.74 % (22496)Also succeeded, but the first one will report.
% 0.58/0.74 % (22493)First to succeed.
% 0.58/0.74 % (22491)Also succeeded, but the first one will report.
% 0.58/0.74 % (22495)Refutation not found, incomplete strategy% (22495)------------------------------
% 0.58/0.74 % (22495)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (22495)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (22493)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22490"
% 0.58/0.74 % (22495)Memory used [KB]: 1048
% 0.58/0.74 % (22495)Time elapsed: 0.003 s
% 0.58/0.74 % (22497)Also succeeded, but the first one will report.
% 0.58/0.74 % (22495)Instructions burned: 3 (million)
% 0.58/0.74 % (22499)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.58/0.74 % (22495)------------------------------
% 0.58/0.74 % (22495)------------------------------
% 0.58/0.74 % (22493)Refutation found. Thanks to Tanya!
% 0.58/0.74 % SZS status Theorem for theBenchmark
% 0.58/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.74 % (22493)------------------------------
% 0.58/0.74 % (22493)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (22493)Termination reason: Refutation
% 0.58/0.74
% 0.58/0.74 % (22493)Memory used [KB]: 1034
% 0.58/0.74 % (22493)Time elapsed: 0.003 s
% 0.58/0.74 % (22493)Instructions burned: 3 (million)
% 0.58/0.74 % (22490)Success in time 0.381 s
% 0.58/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------