TSTP Solution File: NUM926+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM926+1 : TPTP v8.1.2. 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 : n010.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:33 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 66 ( 28 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 61 ( 28 ~; 20 |; 6 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 40 ( 24 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f576,plain,
$false,
inference(subsumption_resolution,[],[f575,f294]) ).
fof(f294,plain,
ord_less_eq_int(one_one_int,t),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox/tmp/tmp.2poVlxaHgU/Vampire---4.8_29981',fact_0_tpos) ).
fof(f575,plain,
~ ord_less_eq_int(one_one_int,t),
inference(subsumption_resolution,[],[f568,f560]) ).
fof(f560,plain,
~ ord_less_int(one_one_int,t),
inference(resolution,[],[f558,f465]) ).
fof(f465,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,[],[f296,f463]) ).
fof(f463,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
fof(f296,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,[],[f254]) ).
fof(f254,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])],[f236,f253]) ).
fof(f253,plain,
( ? [X0,X1] : 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(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(f236,plain,
( ? [X0,X1] : 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)
| ~ ord_less_int(one_one_int,t) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
( ord_less_int(one_one_int,t)
=> ? [X0,X1] : 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) ),
file('/export/starexec/sandbox/tmp/tmp.2poVlxaHgU/Vampire---4.8_29981',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(f558,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(resolution,[],[f549,f551]) ).
fof(f551,plain,
! [X0,X1] :
( ~ sQ5_eqProxy(X0,X1)
| sQ5_eqProxy(X1,X0) ),
inference(equality_proxy_axiom,[],[f463]) ).
fof(f549,plain,
! [X0,X1] : ~ sQ5_eqProxy(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)),
inference(equality_proxy_replacement,[],[f454,f463]) ).
fof(f454,plain,
! [X0,X1] : 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),
inference(cnf_transformation,[],[f250]) ).
fof(f250,plain,
! [X0,X1] : 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),
inference(ennf_transformation,[],[f125]) ).
fof(f125,negated_conjecture,
~ ? [X0,X1] : 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),
inference(negated_conjecture,[],[f124]) ).
fof(f124,conjecture,
? [X0,X1] : 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),
file('/export/starexec/sandbox/tmp/tmp.2poVlxaHgU/Vampire---4.8_29981',conj_0) ).
fof(f568,plain,
( ord_less_int(one_one_int,t)
| ~ ord_less_eq_int(one_one_int,t) ),
inference(resolution,[],[f559,f486]) ).
fof(f486,plain,
! [X0,X1] :
( ord_less_int(X0,X1)
| sQ5_eqProxy(X0,X1)
| ~ ord_less_eq_int(X0,X1) ),
inference(equality_proxy_replacement,[],[f323,f463]) ).
fof(f323,plain,
! [X0,X1] :
( ord_less_int(X0,X1)
| X0 = X1
| ~ ord_less_eq_int(X0,X1) ),
inference(cnf_transformation,[],[f258]) ).
fof(f258,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,[],[f257]) ).
fof(f257,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,[],[f144]) ).
fof(f144,plain,
! [X0,X1] :
( ord_less_int(X0,X1)
<=> ( X0 != X1
& ord_less_eq_int(X0,X1) ) ),
inference(rectify,[],[f29]) ).
fof(f29,axiom,
! [X16,X17] :
( ord_less_int(X16,X17)
<=> ( X16 != X17
& ord_less_eq_int(X16,X17) ) ),
file('/export/starexec/sandbox/tmp/tmp.2poVlxaHgU/Vampire---4.8_29981',fact_28_zless__le) ).
fof(f559,plain,
~ sQ5_eqProxy(one_one_int,t),
inference(resolution,[],[f558,f464]) ).
fof(f464,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(one_one_int,t) ),
inference(equality_proxy_replacement,[],[f295,f463,f463]) ).
fof(f295,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)))))
| one_one_int != t ),
inference(cnf_transformation,[],[f252]) ).
fof(f252,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)))))
| one_one_int != t ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f235,f251]) ).
fof(f251,plain,
( ? [X0,X1] : 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(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(f235,plain,
( ? [X0,X1] : 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)
| one_one_int != t ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
( one_one_int = t
=> ? [X0,X1] : 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) ),
file('/export/starexec/sandbox/tmp/tmp.2poVlxaHgU/Vampire---4.8_29981',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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM926+1 : TPTP v8.1.2. Released v5.3.0.
% 0.03/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.15/0.37 % Computer : n010.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Apr 30 16:37:04 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.23/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.2poVlxaHgU/Vampire---4.8_29981
% 0.59/0.75 % (30237)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.59/0.75 % (30231)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.59/0.75 % (30233)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.59/0.75 % (30234)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.59/0.75 % (30232)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.59/0.75 % (30235)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.59/0.75 % (30236)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.59/0.75 % (30235)First to succeed.
% 0.59/0.76 % (30231)Also succeeded, but the first one will report.
% 0.59/0.76 % (30235)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for Vampire---4
% 0.59/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76 % (30235)------------------------------
% 0.59/0.76 % (30235)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.76 % (30235)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (30235)Memory used [KB]: 1262
% 0.59/0.76 % (30235)Time elapsed: 0.008 s
% 0.59/0.76 % (30235)Instructions burned: 12 (million)
% 0.59/0.76 % (30235)------------------------------
% 0.59/0.76 % (30235)------------------------------
% 0.59/0.76 % (30227)Success in time 0.376 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------