TSTP Solution File: NUM926+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM926+1 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n003.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 Apr 30 14:39:04 EDT 2024
% Result : Theorem 0.21s 0.57s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 60 ( 27 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 26 ~; 19 |; 1 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 45 ( 29 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15837,plain,
$false,
inference(unit_resulting_resolution,[],[f464,f533,f465,f352]) ).
fof(f352,plain,
! [X0,X1] :
( ord_less_int(X1,X0)
| ord_less_int(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f161]) ).
fof(f161,plain,
! [X0,X1] :
( ord_less_int(X1,X0)
| X0 = X1
| ord_less_int(X0,X1) ),
inference(rectify,[],[f30]) ).
fof(f30,axiom,
! [X18,X19] :
( ord_less_int(X19,X18)
| X18 = X19
| ord_less_int(X18,X19) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_29_zless__linear) ).
fof(f465,plain,
~ ord_less_int(one_one_int,t),
inference(subsumption_resolution,[],[f308,f294]) ).
fof(f294,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,[],[f235]) ).
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),
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/benchmark/theBenchmark.p',conj_0) ).
fof(f308,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])],[f237,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(f237,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/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(f533,plain,
~ ord_less_int(t,one_one_int),
inference(unit_resulting_resolution,[],[f296,f515]) ).
fof(f515,plain,
! [X0,X1] :
( ~ ord_less_int(X1,X0)
| ~ ord_less_eq_int(X0,X1) ),
inference(forward_demodulation,[],[f514,f311]) ).
fof(f311,plain,
! [X0] : number_number_of_int(X0) = X0,
inference(cnf_transformation,[],[f128]) ).
fof(f128,plain,
! [X0] : number_number_of_int(X0) = X0,
inference(rectify,[],[f112]) ).
fof(f112,axiom,
! [X20] : number_number_of_int(X20) = X20,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_111_number__of__is__id) ).
fof(f514,plain,
! [X0,X1] :
( ~ ord_less_eq_int(number_number_of_int(X0),X1)
| ~ ord_less_int(X1,X0) ),
inference(forward_demodulation,[],[f513,f311]) ).
fof(f513,plain,
! [X0,X1] :
( ~ ord_less_int(X1,X0)
| ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(forward_demodulation,[],[f512,f311]) ).
fof(f512,plain,
! [X0,X1] :
( ~ ord_less_int(number_number_of_int(X1),X0)
| ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(forward_demodulation,[],[f398,f311]) ).
fof(f398,plain,
! [X0,X1] :
( ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
| ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(cnf_transformation,[],[f284]) ).
fof(f284,plain,
! [X0,X1] :
( ( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) )
& ( ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
| ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ) ),
inference(nnf_transformation,[],[f186]) ).
fof(f186,plain,
! [X0,X1] :
( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
<=> ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) ),
inference(rectify,[],[f39]) ).
fof(f39,axiom,
! [X27,X17] :
( ord_less_eq_int(number_number_of_int(X27),number_number_of_int(X17))
<=> ~ ord_less_int(number_number_of_int(X17),number_number_of_int(X27)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_38_le__number__of__eq__not__less) ).
fof(f296,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/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f464,plain,
one_one_int != t,
inference(subsumption_resolution,[],[f307,f294]) ).
fof(f307,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])],[f236,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(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)
| 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/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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM926+1 : TPTP v8.1.2. Released v5.3.0.
% 0.10/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Apr 29 23:26:33 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (9547)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38 % (9550)WARNING: value z3 for option sas not known
% 0.21/0.38 % (9548)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38 % (9550)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.38 % (9549)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38 % (9551)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38 % (9552)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.21/0.38 % (9553)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.21/0.38 % (9554)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.40 TRYING [1]
% 0.21/0.40 TRYING [2]
% 0.21/0.43 TRYING [3]
% 0.21/0.45 TRYING [1]
% 0.21/0.46 TRYING [2]
% 0.21/0.54 TRYING [4]
% 0.21/0.55 TRYING [3]
% 0.21/0.56 % (9554)First to succeed.
% 0.21/0.57 % (9554)Refutation found. Thanks to Tanya!
% 0.21/0.57 % SZS status Theorem for theBenchmark
% 0.21/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57 % (9554)------------------------------
% 0.21/0.57 % (9554)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.57 % (9554)Termination reason: Refutation
% 0.21/0.57
% 0.21/0.57 % (9554)Memory used [KB]: 3218
% 0.21/0.57 % (9554)Time elapsed: 0.187 s
% 0.21/0.57 % (9554)Instructions burned: 451 (million)
% 0.21/0.57 % (9554)------------------------------
% 0.21/0.57 % (9554)------------------------------
% 0.21/0.57 % (9547)Success in time 0.207 s
%------------------------------------------------------------------------------