TSTP Solution File: NUM957_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM957_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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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:57 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 33
% Syntax : Number of formulae : 50 ( 16 unt; 28 typ; 0 def)
% Number of atoms : 33 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 7 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 16 ( 11 >; 5 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 34 ( 18 !; 0 ?; 34 :)
% ( 16 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(func_def_0,type,
minus_minus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
bit0: int > int ).
tff(func_def_6,type,
bit1: int > int ).
tff(func_def_7,type,
pls: int ).
tff(func_def_8,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_9,type,
fFalse: bool ).
tff(func_def_10,type,
fTrue: bool ).
tff(func_def_11,type,
m: int ).
tff(func_def_12,type,
t: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
zprime: int > $o ).
tff(pred_def_10,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_11,type,
twoSqu1567020053sum2sq: int > $o ).
tff(pred_def_12,type,
pp: bool > $o ).
tff(pred_def_13,type,
sQ0_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f431,plain,
$false,
inference(subsumption_resolution,[],[f430,f352]) ).
tff(f352,plain,
ord_less(int,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),one_one(int)),t),
inference(definition_unfolding,[],[f288,f247,f247]) ).
tff(f247,plain,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
inference(cnf_transformation,[],[f133]) ).
tff(f133,plain,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
inference(rectify,[],[f72]) ).
tff(f72,axiom,
! [X6: int] : ( bit0(X6) = plus_plus(int,X6,X6) ),
file('/export/starexec/sandbox/tmp/tmp.1zn3N4uCkF/Vampire---4.8_21223',fact_71_Bit0__def) ).
tff(f288,plain,
ord_less(int,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int)),t),
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
ord_less(int,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int)),t),
file('/export/starexec/sandbox/tmp/tmp.1zn3N4uCkF/Vampire---4.8_21223',fact_1__0964_A_K_Am_A_L_A1_A_N_A1_A_060_At_096) ).
tff(f430,plain,
~ ord_less(int,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),one_one(int)),t),
inference(subsumption_resolution,[],[f429,f350]) ).
tff(f350,plain,
ord_less(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int))),
inference(definition_unfolding,[],[f286,f247,f247]) ).
tff(f286,plain,
ord_less(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
ord_less(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
file('/export/starexec/sandbox/tmp/tmp.1zn3N4uCkF/Vampire---4.8_21223',fact_0_p0) ).
tff(f429,plain,
( ~ ord_less(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),one_one(int)),t) ),
inference(resolution,[],[f317,f308]) ).
tff(f308,plain,
! [X2: int,X0: int,X1: int] :
( ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1))
| ~ ord_less(int,zero_zero(int),X0)
| ~ ord_less(int,X2,X1) ),
inference(cnf_transformation,[],[f191]) ).
tff(f191,plain,
! [X0: int,X1: int,X2: int] :
( ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1))
| ~ ord_less(int,zero_zero(int),X0)
| ~ ord_less(int,X2,X1) ),
inference(flattening,[],[f190]) ).
tff(f190,plain,
! [X0: int,X1: int,X2: int] :
( ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1))
| ~ ord_less(int,zero_zero(int),X0)
| ~ ord_less(int,X2,X1) ),
inference(ennf_transformation,[],[f166]) ).
tff(f166,plain,
! [X0: int,X1: int,X2: int] :
( ord_less(int,X2,X1)
=> ( ord_less(int,zero_zero(int),X0)
=> ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1)) ) ),
inference(rectify,[],[f62]) ).
tff(f62,axiom,
! [X6: int,X18: int,X19: int] :
( ord_less(int,X19,X18)
=> ( ord_less(int,zero_zero(int),X6)
=> ord_less(int,times_times(int,X6,X19),times_times(int,X6,X18)) ) ),
file('/export/starexec/sandbox/tmp/tmp.1zn3N4uCkF/Vampire---4.8_21223',fact_61_zmult__zless__mono2) ).
tff(f317,plain,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),t)),
inference(definition_unfolding,[],[f215,f247,f247,f247,f247,f247,f247]) ).
tff(f215,plain,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
inference(cnf_transformation,[],[f111]) ).
tff(f111,plain,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
inference(flattening,[],[f110]) ).
tff(f110,negated_conjecture,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
inference(negated_conjecture,[],[f109]) ).
tff(f109,conjecture,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
file('/export/starexec/sandbox/tmp/tmp.1zn3N4uCkF/Vampire---4.8_21223',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM957_5 : TPTP v8.1.2. Released v6.0.0.
% 0.11/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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 14:27:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TF1_THM_EQU_NAR problem
% 0.13/0.35 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/tmp/tmp.1zn3N4uCkF/Vampire---4.8_21223
% 0.56/0.74 % (21339)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 (2996ds/56Mi)
% 0.56/0.74 % (21332)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.56/0.74 % (21334)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.56/0.74 % (21333)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.56/0.74 % (21335)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.56/0.74 % (21337)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.56/0.74 % (21336)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.56/0.74 % (21338)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.56/0.75 % (21339)First to succeed.
% 0.56/0.75 % (21338)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.56/0.75 % (21339)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21331"
% 0.56/0.75 % (21339)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for Vampire---4
% 0.56/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75 % (21339)------------------------------
% 0.56/0.75 % (21339)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (21339)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (21339)Memory used [KB]: 1156
% 0.56/0.75 % (21339)Time elapsed: 0.004 s
% 0.56/0.75 % (21339)Instructions burned: 10 (million)
% 0.56/0.75 % (21331)Success in time 0.383 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------