TSTP Solution File: NUM994_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM994_5 : TPTP v8.2.0. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n025.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:47:43 EDT 2024
% Result : Theorem 0.63s 0.78s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 44
% Syntax : Number of formulae : 70 ( 7 unt; 37 typ; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 58 ( 25 ~; 23 |; 2 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 17 ( 10 >; 7 *; 0 +; 0 <<)
% Number of predicates : 26 ( 25 usr; 3 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 42 ( 18 !; 0 ?; 42 :)
% ( 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(func_def_0,type,
abs_abs:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_1,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
bit0: int > int ).
tff(func_def_4,type,
bit1: int > int ).
tff(func_def_5,type,
pls: int ).
tff(func_def_6,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_7,type,
fFalse: bool ).
tff(func_def_8,type,
fTrue: bool ).
tff(func_def_9,type,
v: int ).
tff(func_def_10,type,
w: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
mult_zero:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
ordered_ring:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
linordered_ring:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
no_zero_divisors:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
ordered_ring_abs:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
ordered_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
ab_semigroup_mult:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
ordere1490568538miring:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
ring_n68954251visors:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
linord581940658strict:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
ordere453448008miring:
!>[X0: $tType] : $o ).
tff(pred_def_18,type,
ordere142940540dd_abs:
!>[X0: $tType] : $o ).
tff(pred_def_19,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_20,type,
pp: bool > $o ).
tff(pred_def_21,type,
sP0: ( bool * int * bool ) > $o ).
tff(pred_def_22,type,
sP1: ( bool * int * bool ) > $o ).
tff(pred_def_23,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f875,plain,
$false,
inference(avatar_sat_refutation,[],[f633,f698,f874]) ).
tff(f874,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f873]) ).
tff(f873,plain,
( $false
| spl3_2 ),
inference(subsumption_resolution,[],[f863,f499]) ).
tff(f499,plain,
ordere142940540dd_abs(int),
inference(cnf_transformation,[],[f98]) ).
tff(f98,axiom,
ordere142940540dd_abs(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Groups_Oordered__ab__group__add__abs) ).
tff(f863,plain,
( ~ ordere142940540dd_abs(int)
| spl3_2 ),
inference(resolution,[],[f851,f404]) ).
tff(f404,plain,
! [X0: $tType,X1: X0] :
( ord_less_eq(X0,zero_zero(X0),abs_abs(X0,X1))
| ~ ordere142940540dd_abs(X0) ),
inference(cnf_transformation,[],[f231]) ).
tff(f231,plain,
! [X0: $tType] :
( ! [X1: X0] : ord_less_eq(X0,zero_zero(X0),abs_abs(X0,X1))
| ~ ordere142940540dd_abs(X0) ),
inference(ennf_transformation,[],[f162]) ).
tff(f162,plain,
! [X0: $tType] :
( ordere142940540dd_abs(X0)
=> ! [X1: X0] : ord_less_eq(X0,zero_zero(X0),abs_abs(X0,X1)) ),
inference(rectify,[],[f45]) ).
tff(f45,axiom,
! [X0: $tType] :
( ordere142940540dd_abs(X0)
=> ! [X9: X0] : ord_less_eq(X0,zero_zero(X0),abs_abs(X0,X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_44_abs__ge__zero) ).
tff(f851,plain,
( ~ ord_less_eq(int,zero_zero(int),abs_abs(int,w))
| spl3_2 ),
inference(subsumption_resolution,[],[f824,f358]) ).
tff(f358,plain,
ord_less_eq(int,zero_zero(int),number_number_of(int,bit0(bit1(pls)))),
inference(cnf_transformation,[],[f12]) ).
tff(f12,axiom,
ord_less_eq(int,zero_zero(int),number_number_of(int,bit0(bit1(pls)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_11_Nat__Transfer_Otransfer__nat__int__function__closures_I7_J) ).
tff(f824,plain,
( ~ ord_less_eq(int,zero_zero(int),abs_abs(int,w))
| ~ ord_less_eq(int,zero_zero(int),number_number_of(int,bit0(bit1(pls))))
| spl3_2 ),
inference(resolution,[],[f632,f409]) ).
tff(f409,plain,
! [X0: int,X1: int] :
( ord_less_eq(int,zero_zero(int),times_times(int,X1,X0))
| ~ ord_less_eq(int,zero_zero(int),X0)
| ~ ord_less_eq(int,zero_zero(int),X1) ),
inference(cnf_transformation,[],[f234]) ).
tff(f234,plain,
! [X0: int,X1: int] :
( ord_less_eq(int,zero_zero(int),times_times(int,X1,X0))
| ~ ord_less_eq(int,zero_zero(int),X0)
| ~ ord_less_eq(int,zero_zero(int),X1) ),
inference(flattening,[],[f233]) ).
tff(f233,plain,
! [X0: int,X1: int] :
( ord_less_eq(int,zero_zero(int),times_times(int,X1,X0))
| ~ ord_less_eq(int,zero_zero(int),X0)
| ~ ord_less_eq(int,zero_zero(int),X1) ),
inference(ennf_transformation,[],[f165]) ).
tff(f165,plain,
! [X0: int,X1: int] :
( ord_less_eq(int,zero_zero(int),X1)
=> ( ord_less_eq(int,zero_zero(int),X0)
=> ord_less_eq(int,zero_zero(int),times_times(int,X1,X0)) ) ),
inference(rectify,[],[f49]) ).
tff(f49,axiom,
! [X17: int,X18: int] :
( ord_less_eq(int,zero_zero(int),X18)
=> ( ord_less_eq(int,zero_zero(int),X17)
=> ord_less_eq(int,zero_zero(int),times_times(int,X18,X17)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_48_Nat__Transfer_Otransfer__nat__int__function__closures_I2_J) ).
tff(f632,plain,
( ~ ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,w)))
| spl3_2 ),
inference(avatar_component_clause,[],[f630]) ).
tff(f630,plain,
( spl3_2
<=> ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,w))) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
tff(f698,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f697]) ).
tff(f697,plain,
( $false
| spl3_1 ),
inference(subsumption_resolution,[],[f687,f499]) ).
tff(f687,plain,
( ~ ordere142940540dd_abs(int)
| spl3_1 ),
inference(resolution,[],[f661,f404]) ).
tff(f661,plain,
( ~ ord_less_eq(int,zero_zero(int),abs_abs(int,v))
| spl3_1 ),
inference(subsumption_resolution,[],[f634,f358]) ).
tff(f634,plain,
( ~ ord_less_eq(int,zero_zero(int),abs_abs(int,v))
| ~ ord_less_eq(int,zero_zero(int),number_number_of(int,bit0(bit1(pls))))
| spl3_1 ),
inference(resolution,[],[f628,f409]) ).
tff(f628,plain,
( ~ ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,v)))
| spl3_1 ),
inference(avatar_component_clause,[],[f626]) ).
tff(f626,plain,
( spl3_1
<=> ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,v))) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
tff(f633,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f528,f630,f626]) ).
tff(f528,plain,
( ~ ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,w)))
| ~ ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,v))) ),
inference(cnf_transformation,[],[f285]) ).
tff(f285,plain,
( ~ ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,w)))
| ~ ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,v))) ),
inference(ennf_transformation,[],[f128]) ).
tff(f128,negated_conjecture,
~ ( ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,w)))
& ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,v))) ),
inference(negated_conjecture,[],[f127]) ).
tff(f127,conjecture,
( ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,w)))
& ord_less_eq(int,zero_zero(int),times_times(int,number_number_of(int,bit0(bit1(pls))),abs_abs(int,v))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM994_5 : TPTP v8.2.0. Released v6.0.0.
% 0.08/0.15 % 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.16/0.37 % Computer : n025.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 06:44:23 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TF1_THM_EQU_NAR problem
% 0.16/0.37 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.63/0.77 % (16200)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.63/0.77 % (16193)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.63/0.77 % (16195)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.63/0.77 % (16196)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.63/0.77 % (16194)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.63/0.77 % (16197)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.63/0.77 % (16198)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.63/0.77 % (16199)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.63/0.77 % (16200)Refutation not found, incomplete strategy% (16200)------------------------------
% 0.63/0.77 % (16200)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.77 % (16200)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.77
% 0.63/0.77 % (16200)Memory used [KB]: 1089
% 0.63/0.77 % (16200)Time elapsed: 0.002 s
% 0.63/0.77 % (16200)Instructions burned: 4 (million)
% 0.63/0.77 % (16200)------------------------------
% 0.63/0.77 % (16200)------------------------------
% 0.63/0.78 % (16199)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.63/0.78 % (16198)Refutation not found, incomplete strategy% (16198)------------------------------
% 0.63/0.78 % (16198)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.78 % (16198)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.78 % (16199)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.63/0.78
% 0.63/0.78 % (16198)Memory used [KB]: 1136
% 0.63/0.78 % (16198)Time elapsed: 0.004 s
% 0.63/0.78 % (16198)Instructions burned: 4 (million)
% 0.63/0.78 % (16201)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.63/0.78 % (16198)------------------------------
% 0.63/0.78 % (16198)------------------------------
% 0.63/0.78 % (16202)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.63/0.78 % (16197)First to succeed.
% 0.63/0.78 % (16197)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16192"
% 0.63/0.78 % (16197)Refutation found. Thanks to Tanya!
% 0.63/0.78 % SZS status Theorem for theBenchmark
% 0.63/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.63/0.78 % (16197)------------------------------
% 0.63/0.78 % (16197)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.78 % (16197)Termination reason: Refutation
% 0.63/0.78
% 0.63/0.78 % (16197)Memory used [KB]: 1343
% 0.63/0.78 % (16197)Time elapsed: 0.010 s
% 0.63/0.78 % (16197)Instructions burned: 16 (million)
% 0.63/0.78 % (16192)Success in time 0.404 s
% 0.63/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------