TSTP Solution File: NUM924+7 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM924+7 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n029.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 31 12:30:59 EDT 2023
% Result : Theorem 3.76s 1.01s
% Output : CNFRefutation 4.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 8 con; 0-5 aty)
% Number of variables : 20 (; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f54,axiom,
ti(int,min) = min,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f100,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t)),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),zero_zero(int)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f101,axiom,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)) = hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f120,axiom,
! [K_1] : number_number_of(int,K_1) = ti(int,K_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f121,axiom,
! [Z_1,W] : hAPP(int,int,times_times(int,Z_1),W) = hAPP(int,int,times_times(int,W),Z_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f160,axiom,
! [W] : hAPP(int,int,times_times(int,pls),W) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f220,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f564,axiom,
hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),number_number_of(int,min)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1250,axiom,
! [X_a,X_c,X_b,P,Q,R] : hAPP(X_a,X_c,combc(X_a,X_b,X_c,P,Q),R) = hAPP(X_b,X_c,hAPP(X_a,fun(X_b,X_c),P,R),Q),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1255,conjecture,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1256,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(negated_conjecture,[status(cth)],[f1255]) ).
fof(f1360,plain,
ti(int,min) = min,
inference(cnf_transformation,[status(esa)],[f54]) ).
fof(f1420,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t)),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),zero_zero(int)))),
inference(cnf_transformation,[status(esa)],[f100]) ).
fof(f1421,plain,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)) = hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),t),
inference(cnf_transformation,[status(esa)],[f101]) ).
fof(f1467,plain,
! [X0] : number_number_of(int,X0) = ti(int,X0),
inference(cnf_transformation,[status(esa)],[f120]) ).
fof(f1468,plain,
! [X0,X1] : hAPP(int,int,times_times(int,X0),X1) = hAPP(int,int,times_times(int,X1),X0),
inference(cnf_transformation,[status(esa)],[f121]) ).
fof(f1592,plain,
! [X0] : hAPP(int,int,times_times(int,pls),X0) = pls,
inference(cnf_transformation,[status(esa)],[f160]) ).
fof(f1755,plain,
pls = zero_zero(int),
inference(cnf_transformation,[status(esa)],[f220]) ).
fof(f2708,plain,
hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),number_number_of(int,min)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)),
inference(cnf_transformation,[status(esa)],[f564]) ).
fof(f4486,plain,
! [X0,X1,X2,X3,X4,X5] : hAPP(X0,X1,combc(X0,X2,X1,X3,X4),X5) = hAPP(X2,X1,hAPP(X0,fun(X2,X1),X3,X5),X4),
inference(cnf_transformation,[status(esa)],[f1250]) ).
fof(f4493,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(cnf_transformation,[status(esa)],[f1256]) ).
fof(f4795,plain,
hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),ti(int,min)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)),
inference(forward_demodulation,[status(thm)],[f1467,f2708]) ).
fof(f4796,plain,
hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),min) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)),
inference(forward_demodulation,[status(thm)],[f1360,f4795]) ).
fof(f5125,plain,
~ hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)))),
inference(forward_demodulation,[status(thm)],[f4486,f4493]) ).
fof(f5126,plain,
~ hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),pls),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)))),
inference(forward_demodulation,[status(thm)],[f1755,f5125]) ).
fof(f5127,plain,
~ hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),pls),hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),min))),
inference(forward_demodulation,[status(thm)],[f4796,f5126]) ).
fof(f5165,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),zero_zero(int)))),
inference(backward_demodulation,[status(thm)],[f1421,f1420]) ).
fof(f5166,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),zero_zero(int))),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)))),
inference(forward_demodulation,[status(thm)],[f4486,f5165]) ).
fof(f5167,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),hAPP(int,int,times_times(int,zero_zero(int)),hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)))),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)))),
inference(forward_demodulation,[status(thm)],[f1468,f5166]) ).
fof(f5168,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),hAPP(int,int,times_times(int,pls),hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)))),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)))),
inference(forward_demodulation,[status(thm)],[f1755,f5167]) ).
fof(f5169,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),pls),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)))),
inference(forward_demodulation,[status(thm)],[f1592,f5168]) ).
fof(f5170,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),pls),hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),min))),
inference(forward_demodulation,[status(thm)],[f4796,f5169]) ).
fof(f5171,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f5170,f5127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM924+7 : TPTP v8.1.2. Released v5.3.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 10:06:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % Drodi V3.5.1
% 3.76/1.01 % Refutation found
% 3.76/1.01 % SZS status Theorem for theBenchmark: Theorem is valid
% 3.76/1.01 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 4.42/1.05 % Elapsed time: 0.700082 seconds
% 4.42/1.05 % CPU time: 4.472330 seconds
% 4.42/1.05 % Memory used: 223.814 MB
%------------------------------------------------------------------------------