TSTP Solution File: NUM894_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM894_1 : TPTP v8.1.2. Released v5.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 : n020.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 : Sun May 5 08:16:15 EDT 2024
% Result : Theorem 0.58s 0.73s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 7 unt; 2 typ; 0 def)
% Number of atoms : 17 ( 1 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 1 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 47 ( 15 atm; 11 fun; 9 num; 12 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 10 !; 2 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_4,type,
sK0: $int ).
tff(func_def_5,type,
sK1: $int ).
tff(f26,plain,
$false,
inference(subsumption_resolution,[],[f25,f19]) ).
tff(f19,plain,
$less(sK1,$sum(1,sK0)),
inference(forward_demodulation,[],[f17,f4]) ).
tff(f4,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f17,plain,
$less(sK1,$sum(sK0,1)),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
? [X0: $int,X1: $int] :
( $less(X0,X1)
& $less(X1,$sum(X0,1)) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
=> ~ $less(X0,X1) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
=> $lesseq(X1,X0) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
=> $lesseq(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.dbqozijeDr/Vampire---4.8_15838',less_successor) ).
tff(f25,plain,
~ $less(sK1,$sum(1,sK0)),
inference(forward_demodulation,[],[f23,f4]) ).
tff(f23,plain,
~ $less(sK1,$sum(sK0,1)),
inference(unit_resulting_resolution,[],[f18,f15]) ).
tff(f15,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_161,[]) ).
tff(f18,plain,
$less(sK0,sK1),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM894_1 : TPTP v8.1.2. Released v5.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n020.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 : Fri May 3 14:53:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_NEQ_ARI problem
% 0.14/0.35 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/tmp/tmp.dbqozijeDr/Vampire---4.8_15838
% 0.58/0.73 % (15953)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 (2996ds/83Mi)
% 0.58/0.73 % (15947)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 (2996ds/34Mi)
% 0.58/0.73 % (15949)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.73 % (15950)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.73 % (15951)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 (2996ds/34Mi)
% 0.58/0.73 % (15953)First to succeed.
% 0.58/0.73 % (15952)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.73 % (15948)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 (2996ds/51Mi)
% 0.58/0.73 % (15953)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15946"
% 0.58/0.73 % (15953)Refutation found. Thanks to Tanya!
% 0.58/0.73 % SZS status Theorem for Vampire---4
% 0.58/0.73 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.73 % (15953)------------------------------
% 0.58/0.73 % (15953)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.73 % (15953)Termination reason: Refutation
% 0.58/0.73
% 0.58/0.73 % (15953)Memory used [KB]: 975
% 0.58/0.73 % (15953)Time elapsed: 0.002 s
% 0.58/0.73 % (15953)Instructions burned: 3 (million)
% 0.58/0.73 % (15946)Success in time 0.37 s
% 0.58/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------