TSTP Solution File: NUM960_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM960_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 : n014.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:58 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 40
% Syntax : Number of formulae : 49 ( 7 unt; 37 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 3 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 23 ( 14 >; 9 *; 0 +; 0 <<)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-3 aty)
% Number of variables : 27 ( 8 !; 0 ?; 27 :)
% ( 19 !>; 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,
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,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_10,type,
fFalse: bool ).
tff(func_def_11,type,
fTrue: bool ).
tff(func_def_12,type,
m: int ).
tff(func_def_13,type,
s1: int ).
tff(func_def_14,type,
s: int ).
tff(func_def_15,type,
t: int ).
tff(func_def_16,type,
sK0: int ).
tff(func_def_17,type,
sK1: 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,
linorder:
!>[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,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
zcong: ( int * int * int ) > $o ).
tff(pred_def_11,type,
zprime: int > $o ).
tff(pred_def_12,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_13,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
twoSqu1567020053sum2sq: int > $o ).
tff(pred_def_15,type,
pp: bool > $o ).
tff(pred_def_16,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f408,plain,
$false,
inference(subsumption_resolution,[],[f404,f319]) ).
tff(f319,plain,
ord_less(int,s,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,
( zcong(s1,s,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,s,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),s) ),
file('/export/starexec/sandbox/tmp/tmp.SvFY5EgzL3/Vampire---4.8_25881',fact_0_s0p) ).
tff(f404,plain,
~ ord_less(int,s,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(resolution,[],[f233,f237]) ).
tff(f237,plain,
! [X0: int,X1: int] :
( ord_less_eq(int,X1,minus_minus(int,X0,one_one(int)))
| ~ ord_less(int,X1,X0) ),
inference(cnf_transformation,[],[f193]) ).
tff(f193,plain,
! [X0: int,X1: int] :
( ( ord_less_eq(int,X1,minus_minus(int,X0,one_one(int)))
| ~ ord_less(int,X1,X0) )
& ( ord_less(int,X1,X0)
| ~ ord_less_eq(int,X1,minus_minus(int,X0,one_one(int))) ) ),
inference(nnf_transformation,[],[f119]) ).
tff(f119,plain,
! [X0: int,X1: int] :
( ord_less_eq(int,X1,minus_minus(int,X0,one_one(int)))
<=> ord_less(int,X1,X0) ),
inference(rectify,[],[f64]) ).
tff(f64,axiom,
! [X15: int,X16: int] :
( ord_less_eq(int,X16,minus_minus(int,X15,one_one(int)))
<=> ord_less(int,X16,X15) ),
file('/export/starexec/sandbox/tmp/tmp.SvFY5EgzL3/Vampire---4.8_25881',fact_63_zle__diff1__eq) ).
tff(f233,plain,
~ ord_less_eq(int,s,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),
inference(cnf_transformation,[],[f117]) ).
tff(f117,plain,
~ ord_less_eq(int,s,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),
inference(flattening,[],[f116]) ).
tff(f116,negated_conjecture,
~ ord_less_eq(int,s,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),
inference(negated_conjecture,[],[f115]) ).
tff(f115,conjecture,
ord_less_eq(int,s,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),
file('/export/starexec/sandbox/tmp/tmp.SvFY5EgzL3/Vampire---4.8_25881',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM960_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/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.36 % Computer : n014.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 14:56:08 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/tmp/tmp.SvFY5EgzL3/Vampire---4.8_25881
% 0.57/0.75 % (26142)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.57/0.75 % (26136)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.57/0.75 % (26142)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.57/0.75 % (26138)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.57/0.75 % (26139)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.57/0.75 % (26137)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.57/0.75 % (26143)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.57/0.76 % (26142)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.57/0.76 % (26140)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.57/0.76 % (26143)First to succeed.
% 0.57/0.76 % (26143)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26132"
% 0.57/0.76 % (26140)Also succeeded, but the first one will report.
% 0.57/0.76 % (26143)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (26143)------------------------------
% 0.57/0.76 % (26143)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (26143)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (26143)Memory used [KB]: 1160
% 0.57/0.76 % (26143)Time elapsed: 0.006 s
% 0.57/0.76 % (26143)Instructions burned: 9 (million)
% 0.57/0.76 % (26132)Success in time 0.382 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------