TSTP Solution File: NUM926+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NUM926+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n002.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 Aug 31 18:03:05 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 13 unt; 0 def)
% Number of atoms : 79 ( 32 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 70 ( 31 ~; 24 |; 6 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 42 ( 20 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f632,plain,
$false,
inference(avatar_sat_refutation,[],[f599,f610,f629]) ).
fof(f629,plain,
spl5_1,
inference(avatar_contradiction_clause,[],[f625]) ).
fof(f625,plain,
( $false
| spl5_1 ),
inference(resolution,[],[f594,f391]) ).
fof(f391,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(f594,plain,
( ~ ord_less_eq_int(one_one_int,t)
| spl5_1 ),
inference(avatar_component_clause,[],[f592]) ).
fof(f592,plain,
( spl5_1
<=> ord_less_eq_int(one_one_int,t) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f610,plain,
~ spl5_2,
inference(avatar_split_clause,[],[f582,f596]) ).
fof(f596,plain,
( spl5_2
<=> ord_less_int(one_one_int,t) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f582,plain,
~ ord_less_int(one_one_int,t),
inference(resolution,[],[f512,f558]) ).
fof(f558,plain,
( sQ4_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(sK1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK0,number_number_of_nat(bit0(bit1(pls))))))
| ~ ord_less_int(one_one_int,t) ),
inference(equality_proxy_replacement,[],[f459,f498]) ).
fof(f498,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).
fof(f459,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK0,number_number_of_nat(bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f318]) ).
fof(f318,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK0,number_number_of_nat(bit0(bit1(pls))))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f316,f317]) ).
fof(f317,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(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X0,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(sK1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK0,number_number_of_nat(bit0(bit1(pls))))) ),
introduced(choice_axiom,[]) ).
fof(f316,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(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X0,number_number_of_nat(bit0(bit1(pls))))) ),
inference(rectify,[],[f237]) ).
fof(f237,plain,
( ~ ord_less_int(one_one_int,t)
| ? [X1,X0] : 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,[],[f3]) ).
fof(f3,axiom,
( ord_less_int(one_one_int,t)
=> ? [X1,X0] : 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(f512,plain,
! [X0,X1] : ~ sQ4_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(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))))),
inference(equality_proxy_replacement,[],[f373,f498]) ).
fof(f373,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(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X0,number_number_of_nat(bit0(bit1(pls))))),
inference(cnf_transformation,[],[f241]) ).
fof(f241,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(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X0,number_number_of_nat(bit0(bit1(pls))))),
inference(ennf_transformation,[],[f126]) ).
fof(f126,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(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X0,number_number_of_nat(bit0(bit1(pls))))),
inference(rectify,[],[f125]) ).
fof(f125,negated_conjecture,
~ ? [X1,X0] : 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,
? [X1,X0] : 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(f599,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f588,f596,f592]) ).
fof(f588,plain,
( ord_less_int(one_one_int,t)
| ~ ord_less_eq_int(one_one_int,t) ),
inference(resolution,[],[f581,f545]) ).
fof(f545,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| ~ ord_less_eq_int(X0,X1)
| ord_less_int(X0,X1) ),
inference(equality_proxy_replacement,[],[f435,f498]) ).
fof(f435,plain,
! [X0,X1] :
( ord_less_int(X0,X1)
| X0 = X1
| ~ ord_less_eq_int(X0,X1) ),
inference(cnf_transformation,[],[f301]) ).
fof(f301,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,[],[f300]) ).
fof(f300,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,[],[f129]) ).
fof(f129,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/benchmark/theBenchmark.p',fact_28_zless__le) ).
fof(f581,plain,
~ sQ4_eqProxy(one_one_int,t),
inference(resolution,[],[f512,f564]) ).
fof(f564,plain,
( sQ4_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(sK3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK2,number_number_of_nat(bit0(bit1(pls))))))
| ~ sQ4_eqProxy(one_one_int,t) ),
inference(equality_proxy_replacement,[],[f467,f498,f498]) ).
fof(f467,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(sK3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))))
| one_one_int != t ),
inference(cnf_transformation,[],[f326]) ).
fof(f326,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(sK3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))))
| one_one_int != t ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f324,f325]) ).
fof(f325,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(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X0,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(sK3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK2,number_number_of_nat(bit0(bit1(pls))))) ),
introduced(choice_axiom,[]) ).
fof(f324,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(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))))
| one_one_int != t ),
inference(rectify,[],[f236]) ).
fof(f236,plain,
( ? [X1,X0] : 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
=> ? [X1,X0] : 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.11/0.12 % Problem : NUM926+1 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Tue Aug 30 09:35:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49 % (8419)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (8441)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.50 % (8435)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.50 % (8427)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (8433)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50 % (8427)Instruction limit reached!
% 0.19/0.50 % (8427)------------------------------
% 0.19/0.50 % (8427)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (8418)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51 % (8425)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.51 % (8433)Instruction limit reached!
% 0.19/0.51 % (8433)------------------------------
% 0.19/0.51 % (8433)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (8435)First to succeed.
% 0.19/0.51 % (8427)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (8427)Termination reason: Unknown
% 0.19/0.51 % (8427)Termination phase: Property scanning
% 0.19/0.51
% 0.19/0.51 % (8427)Memory used [KB]: 1663
% 0.19/0.51 % (8427)Time elapsed: 0.004 s
% 0.19/0.51 % (8427)Instructions burned: 7 (million)
% 0.19/0.51 % (8427)------------------------------
% 0.19/0.51 % (8427)------------------------------
% 0.19/0.51 % (8435)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (8435)------------------------------
% 0.19/0.51 % (8435)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (8435)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (8435)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (8435)Memory used [KB]: 6268
% 0.19/0.51 % (8435)Time elapsed: 0.117 s
% 0.19/0.51 % (8435)Instructions burned: 9 (million)
% 0.19/0.51 % (8435)------------------------------
% 0.19/0.51 % (8435)------------------------------
% 0.19/0.51 % (8411)Success in time 0.165 s
%------------------------------------------------------------------------------