TSTP Solution File: NUM991_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM991_5 : TPTP v8.1.2. Released v6.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 : n009.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:35:59 EDT 2024
% Result : Theorem 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 38
% Syntax : Number of formulae : 43 ( 7 unt; 36 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 16 ( 9 >; 7 *; 0 +; 0 <<)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-4 aty)
% Number of variables : 24 ( 0 !; 0 ?; 24 :)
% ( 24 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
if:
!>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_5,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_6,type,
fFalse: bool ).
tff(func_def_7,type,
fTrue: bool ).
tff(func_def_8,type,
m1: int ).
tff(func_def_9,type,
n: nat ).
tff(func_def_10,type,
t: int ).
tff(func_def_11,type,
tn: nat ).
tff(func_def_12,type,
sK0: ( nat * nat ) > nat ).
tff(func_def_13,type,
sK1: int > nat ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
ordere216010020id_add:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
ordere223160158up_add:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_18,type,
pp: bool > $o ).
tff(f311,plain,
$false,
inference(subsumption_resolution,[],[f223,f288]) ).
tff(f288,plain,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
file('/export/starexec/sandbox2/tmp/tmp.bpvU8NMZfI/Vampire---4.8_1532',fact_0_n1pos) ).
tff(f223,plain,
~ ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(cnf_transformation,[],[f136]) ).
tff(f136,plain,
~ ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(flattening,[],[f135]) ).
tff(f135,negated_conjecture,
~ ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(negated_conjecture,[],[f134]) ).
tff(f134,conjecture,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
file('/export/starexec/sandbox2/tmp/tmp.bpvU8NMZfI/Vampire---4.8_1532',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : NUM991_5 : TPTP v8.1.2. Released v6.0.0.
% 0.02/0.11 % 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.31 % Computer : n009.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 16:52:25 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a TF1_THM_EQU_NAR problem
% 0.10/0.32 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.bpvU8NMZfI/Vampire---4.8_1532
% 0.60/0.80 % (1646)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 (2995ds/34Mi)
% 0.60/0.80 % (1648)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.80 % (1650)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 (2995ds/34Mi)
% 0.60/0.80 % (1647)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 (2995ds/51Mi)
% 0.60/0.80 % (1649)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.80 % (1651)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.80 % (1652)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 (2995ds/83Mi)
% 0.60/0.80 % (1653)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 (2995ds/56Mi)
% 0.60/0.80 % (1652)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.80 % (1652)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.80 % (1651)First to succeed.
% 0.60/0.80 % (1653)Also succeeded, but the first one will report.
% 0.60/0.80 % (1652)Also succeeded, but the first one will report.
% 0.60/0.80 % (1651)Refutation found. Thanks to Tanya!
% 0.60/0.80 % SZS status Theorem for Vampire---4
% 0.60/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80 % (1651)------------------------------
% 0.60/0.80 % (1651)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (1651)Termination reason: Refutation
% 0.60/0.80
% 0.60/0.80 % (1651)Memory used [KB]: 1134
% 0.60/0.80 % (1651)Time elapsed: 0.005 s
% 0.60/0.80 % (1651)Instructions burned: 6 (million)
% 0.60/0.80 % (1651)------------------------------
% 0.60/0.80 % (1651)------------------------------
% 0.60/0.80 % (1642)Success in time 0.482 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------