TSTP Solution File: NUM924+6 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : NUM924+6 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n023.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 20:36:05 EDT 2024
% Result : Theorem 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 48 ( 48 unt; 0 def)
% Number of atoms : 48 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 14 ( 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,hypothesis,
! [B_1_1] : ti(int,bit1(B_1_1)) = bit1(B_1_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f43,axiom,
ti(int,min) = min,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,hypothesis,
ti(int,pls) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f68,axiom,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f69,axiom,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f88,axiom,
! [K] : number_number_of(int,K) = ti(int,K),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f89,axiom,
! [Z,W] : times_times(int,Z,W) = times_times(int,W,Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f128,axiom,
! [W] : times_times(int,pls,W) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f162,axiom,
! [Z,W] : plus_plus(int,Z,W) = plus_plus(int,W,Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f163,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f175,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f390,axiom,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),number_number_of(int,min)) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f650,conjecture,
ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f651,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(negated_conjecture,[status(cth)],[f650]) ).
fof(f759,plain,
! [X0] : ti(int,bit1(X0)) = bit1(X0),
inference(cnf_transformation,[status(esa)],[f42]) ).
fof(f760,plain,
ti(int,min) = min,
inference(cnf_transformation,[status(esa)],[f43]) ).
fof(f761,plain,
ti(int,pls) = pls,
inference(cnf_transformation,[status(esa)],[f44]) ).
fof(f828,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(cnf_transformation,[status(esa)],[f68]) ).
fof(f829,plain,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
inference(cnf_transformation,[status(esa)],[f69]) ).
fof(f875,plain,
! [X0] : number_number_of(int,X0) = ti(int,X0),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f876,plain,
! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
inference(cnf_transformation,[status(esa)],[f89]) ).
fof(f1000,plain,
! [X0] : times_times(int,pls,X0) = pls,
inference(cnf_transformation,[status(esa)],[f128]) ).
fof(f1099,plain,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(cnf_transformation,[status(esa)],[f162]) ).
fof(f1100,plain,
zero_zero(int) = number_number_of(int,pls),
inference(cnf_transformation,[status(esa)],[f163]) ).
fof(f1132,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(cnf_transformation,[status(esa)],[f175]) ).
fof(f1674,plain,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),number_number_of(int,min)) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(cnf_transformation,[status(esa)],[f390]) ).
fof(f2259,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(cnf_transformation,[status(esa)],[f651]) ).
fof(f2289,plain,
zero_zero(int) = ti(int,pls),
inference(forward_demodulation,[status(thm)],[f875,f1100]) ).
fof(f2290,plain,
zero_zero(int) = pls,
inference(forward_demodulation,[status(thm)],[f761,f2289]) ).
fof(f2292,plain,
one_one(int) = ti(int,bit1(pls)),
inference(forward_demodulation,[status(thm)],[f875,f1132]) ).
fof(f2293,plain,
one_one(int) = bit1(pls),
inference(forward_demodulation,[status(thm)],[f759,f2292]) ).
fof(f2617,plain,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),number_number_of(int,min)) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(forward_demodulation,[status(thm)],[f2293,f1674]) ).
fof(f2618,plain,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),ti(int,min)) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(forward_demodulation,[status(thm)],[f875,f2617]) ).
fof(f2619,plain,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(forward_demodulation,[status(thm)],[f760,f2618]) ).
fof(f2620,plain,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min) = plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),
inference(forward_demodulation,[status(thm)],[f1099,f2619]) ).
fof(f2621,plain,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min) = plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(one_one(int))))),
inference(forward_demodulation,[status(thm)],[f2293,f2620]) ).
fof(f2745,plain,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),zero_zero(int)),
inference(forward_demodulation,[status(thm)],[f1099,f2259]) ).
fof(f2746,plain,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(one_one(int))))),zero_zero(int)),
inference(forward_demodulation,[status(thm)],[f2293,f2745]) ).
fof(f2747,plain,
~ ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min),zero_zero(int)),
inference(forward_demodulation,[status(thm)],[f2621,f2746]) ).
fof(f2748,plain,
~ ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min),pls),
inference(forward_demodulation,[status(thm)],[f2290,f2747]) ).
fof(f2760,plain,
ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(backward_demodulation,[status(thm)],[f829,f828]) ).
fof(f2761,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(forward_demodulation,[status(thm)],[f1099,f2760]) ).
fof(f2762,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(one_one(int))))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(forward_demodulation,[status(thm)],[f2293,f2761]) ).
fof(f2763,plain,
ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(forward_demodulation,[status(thm)],[f2621,f2762]) ).
fof(f2764,plain,
ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min),times_times(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))),
inference(forward_demodulation,[status(thm)],[f876,f2763]) ).
fof(f2765,plain,
ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min),times_times(int,pls,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))),
inference(forward_demodulation,[status(thm)],[f2290,f2764]) ).
fof(f2766,plain,
ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(one_one(int)))),min),pls),
inference(forward_demodulation,[status(thm)],[f1000,f2765]) ).
fof(f2767,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f2766,f2748]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM924+6 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.29 % Computer : n023.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Mon Apr 29 20:57:10 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.14/0.32 % Drodi V3.6.0
% 0.14/0.46 % Refutation found
% 0.14/0.46 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.47 % Elapsed time: 0.180720 seconds
% 0.14/0.47 % CPU time: 1.127520 seconds
% 0.14/0.47 % Total memory used: 117.155 MB
% 0.14/0.47 % Net memory used: 116.672 MB
%------------------------------------------------------------------------------