TSTP Solution File: NUM926+5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM926+5 : TPTP v8.2.0. Released v5.3.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 : n027.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:18 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 54 ( 15 unt; 0 def)
% Number of atoms : 114 ( 39 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 101 ( 41 ~; 39 |; 6 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 60 ( 38 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f717,plain,
$false,
inference(avatar_sat_refutation,[],[f676,f678,f716]) ).
fof(f716,plain,
( spl6_1
| ~ spl6_2 ),
inference(avatar_contradiction_clause,[],[f715]) ).
fof(f715,plain,
( $false
| spl6_1
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f700,f673]) ).
fof(f673,plain,
( ord_less(int,t,one_one(int))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f671]) ).
fof(f671,plain,
( spl6_2
<=> ord_less(int,t,one_one(int)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f700,plain,
( ~ ord_less(int,t,one_one(int))
| spl6_1 ),
inference(resolution,[],[f669,f426]) ).
fof(f426,plain,
! [X0,X1] :
( ord_less_eq(int,X0,X1)
| ~ ord_less(int,X0,X1) ),
inference(cnf_transformation,[],[f337]) ).
fof(f337,plain,
! [X0,X1] :
( ( ord_less(int,X0,X1)
| X0 = X1
| ~ ord_less_eq(int,X0,X1) )
& ( ( X0 != X1
& ord_less_eq(int,X0,X1) )
| ~ ord_less(int,X0,X1) ) ),
inference(flattening,[],[f336]) ).
fof(f336,plain,
! [X0,X1] :
( ( ord_less(int,X0,X1)
| X0 = X1
| ~ ord_less_eq(int,X0,X1) )
& ( ( X0 != X1
& ord_less_eq(int,X0,X1) )
| ~ ord_less(int,X0,X1) ) ),
inference(nnf_transformation,[],[f180]) ).
fof(f180,plain,
! [X0,X1] :
( ord_less(int,X0,X1)
<=> ( X0 != X1
& ord_less_eq(int,X0,X1) ) ),
inference(rectify,[],[f50]) ).
fof(f50,axiom,
! [X15,X16] :
( ord_less(int,X15,X16)
<=> ( X15 != X16
& ord_less_eq(int,X15,X16) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_zless__le) ).
fof(f669,plain,
( ~ ord_less_eq(int,t,one_one(int))
| spl6_1 ),
inference(avatar_component_clause,[],[f667]) ).
fof(f667,plain,
( spl6_1
<=> ord_less_eq(int,t,one_one(int)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f678,plain,
~ spl6_1,
inference(avatar_split_clause,[],[f677,f667]) ).
fof(f677,plain,
~ ord_less_eq(int,t,one_one(int)),
inference(subsumption_resolution,[],[f661,f404]) ).
fof(f404,plain,
ord_less_eq(int,one_one(int),t),
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
ord_less_eq(int,one_one(int),t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f661,plain,
( ~ ord_less_eq(int,one_one(int),t)
| ~ ord_less_eq(int,t,one_one(int)) ),
inference(resolution,[],[f648,f600]) ).
fof(f600,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ ord_less_eq(int,X1,X0)
| ~ ord_less_eq(int,X0,X1) ),
inference(equality_proxy_replacement,[],[f431,f560]) ).
fof(f560,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
fof(f431,plain,
! [X0,X1] :
( X0 = X1
| ~ ord_less_eq(int,X1,X0)
| ~ ord_less_eq(int,X0,X1) ),
inference(cnf_transformation,[],[f288]) ).
fof(f288,plain,
! [X0,X1] :
( X0 = X1
| ~ ord_less_eq(int,X1,X0)
| ~ ord_less_eq(int,X0,X1) ),
inference(flattening,[],[f287]) ).
fof(f287,plain,
! [X0,X1] :
( X0 = X1
| ~ ord_less_eq(int,X1,X0)
| ~ ord_less_eq(int,X0,X1) ),
inference(ennf_transformation,[],[f183]) ).
fof(f183,plain,
! [X0,X1] :
( ord_less_eq(int,X0,X1)
=> ( ord_less_eq(int,X1,X0)
=> X0 = X1 ) ),
inference(rectify,[],[f53]) ).
fof(f53,axiom,
! [X14,X10] :
( ord_less_eq(int,X14,X10)
=> ( ord_less_eq(int,X10,X14)
=> X10 = X14 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_25_zle__antisym) ).
fof(f648,plain,
~ sQ5_eqProxy(t,one_one(int)),
inference(resolution,[],[f643,f582]) ).
fof(f582,plain,
( sQ5_eqProxy(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))))
| ~ sQ5_eqProxy(t,one_one(int)) ),
inference(equality_proxy_replacement,[],[f405,f560,f560]) ).
fof(f405,plain,
( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls)))))
| t != one_one(int) ),
inference(cnf_transformation,[],[f331]) ).
fof(f331,plain,
( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls)))))
| t != one_one(int) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f272,f330]) ).
fof(f330,plain,
( ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))
=> plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))) ),
introduced(choice_axiom,[]) ).
fof(f272,plain,
( ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))
| t != one_one(int) ),
inference(ennf_transformation,[],[f165]) ).
fof(f165,plain,
( t = one_one(int)
=> ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) ),
inference(rectify,[],[f29]) ).
fof(f29,axiom,
( t = one_one(int)
=> ? [X3,X4] : plus_plus(int,power_power(int,X3,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X4,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f643,plain,
! [X0,X1] : ~ sQ5_eqProxy(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))),
inference(equality_proxy_replacement,[],[f555,f560]) ).
fof(f555,plain,
! [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) != plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))),
inference(cnf_transformation,[],[f323]) ).
fof(f323,plain,
! [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) != plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))),
inference(ennf_transformation,[],[f251]) ).
fof(f251,plain,
~ ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))),
inference(rectify,[],[f143]) ).
fof(f143,negated_conjecture,
~ ? [X3,X4] : plus_plus(int,power_power(int,X3,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X4,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(negated_conjecture,[],[f142]) ).
fof(f142,conjecture,
? [X3,X4] : plus_plus(int,power_power(int,X3,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X4,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(f676,plain,
spl6_2,
inference(avatar_split_clause,[],[f675,f671]) ).
fof(f675,plain,
ord_less(int,t,one_one(int)),
inference(subsumption_resolution,[],[f660,f649]) ).
fof(f649,plain,
~ ord_less(int,one_one(int),t),
inference(resolution,[],[f643,f583]) ).
fof(f583,plain,
( sQ5_eqProxy(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))))
| ~ ord_less(int,one_one(int),t) ),
inference(equality_proxy_replacement,[],[f406,f560]) ).
fof(f406,plain,
( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls)))))
| ~ ord_less(int,one_one(int),t) ),
inference(cnf_transformation,[],[f333]) ).
fof(f333,plain,
( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls)))))
| ~ ord_less(int,one_one(int),t) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f273,f332]) ).
fof(f332,plain,
( ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))
=> plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))) ),
introduced(choice_axiom,[]) ).
fof(f273,plain,
( ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))
| ~ ord_less(int,one_one(int),t) ),
inference(ennf_transformation,[],[f166]) ).
fof(f166,plain,
( ord_less(int,one_one(int),t)
=> ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) ),
inference(rectify,[],[f30]) ).
fof(f30,axiom,
( ord_less(int,one_one(int),t)
=> ? [X3,X4] : plus_plus(int,power_power(int,X3,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X4,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f660,plain,
( ord_less(int,one_one(int),t)
| ord_less(int,t,one_one(int)) ),
inference(resolution,[],[f648,f599]) ).
fof(f599,plain,
! [X0,X1] :
( ord_less(int,X1,X0)
| sQ5_eqProxy(X0,X1)
| ord_less(int,X0,X1) ),
inference(equality_proxy_replacement,[],[f429,f560]) ).
fof(f429,plain,
! [X0,X1] :
( ord_less(int,X1,X0)
| X0 = X1
| ord_less(int,X0,X1) ),
inference(cnf_transformation,[],[f181]) ).
fof(f181,plain,
! [X0,X1] :
( ord_less(int,X1,X0)
| X0 = X1
| ord_less(int,X0,X1) ),
inference(rectify,[],[f51]) ).
fof(f51,axiom,
! [X7,X8] :
( ord_less(int,X8,X7)
| X7 = X8
| ord_less(int,X7,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zless__linear) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : NUM926+5 : TPTP v8.2.0. Released v5.3.0.
% 0.12/0.13 % 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.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 07:01:52 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34 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.56/0.72 % (6629)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.56/0.72 % (6628)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.56/0.72 % (6630)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.56/0.72 % (6631)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.56/0.72 % (6624)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.56/0.72 % (6625)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.56/0.73 % (6628)First to succeed.
% 0.56/0.73 % (6626)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.73 % (6627)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.56/0.73 % (6628)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6623"
% 0.56/0.73 % (6628)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for theBenchmark
% 0.56/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73 % (6628)------------------------------
% 0.56/0.73 % (6628)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (6628)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (6628)Memory used [KB]: 1284
% 0.56/0.73 % (6628)Time elapsed: 0.009 s
% 0.56/0.73 % (6628)Instructions burned: 17 (million)
% 0.56/0.73 % (6623)Success in time 0.383 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------