TSTP Solution File: NUM924+5 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : NUM924+5 : 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 : Tue Apr 30 20:36:05 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,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/sandbox/benchmark/theBenchmark.p') ).
fof(f43,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/sandbox/benchmark/theBenchmark.p') ).
fof(f62,axiom,
! [K_1] : number_number_of(int,K_1) = K_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f63,axiom,
! [Z,W] : times_times(int,Z,W) = times_times(int,W,Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f102,axiom,
! [W] : times_times(int,pls,W) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f136,axiom,
! [Z,W] : plus_plus(int,Z,W) = plus_plus(int,W,Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f137,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f155,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/sandbox/benchmark/theBenchmark.p') ).
fof(f156,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)],[f155]) ).
fof(f273,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)],[f42]) ).
fof(f274,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)],[f43]) ).
fof(f320,plain,
! [X0] : number_number_of(int,X0) = X0,
inference(cnf_transformation,[status(esa)],[f62]) ).
fof(f321,plain,
! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
inference(cnf_transformation,[status(esa)],[f63]) ).
fof(f445,plain,
! [X0] : times_times(int,pls,X0) = pls,
inference(cnf_transformation,[status(esa)],[f102]) ).
fof(f544,plain,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(cnf_transformation,[status(esa)],[f136]) ).
fof(f545,plain,
zero_zero(int) = number_number_of(int,pls),
inference(cnf_transformation,[status(esa)],[f137]) ).
fof(f563,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)],[f156]) ).
fof(f581,plain,
zero_zero(int) = pls,
inference(forward_demodulation,[status(thm)],[f320,f545]) ).
fof(f582,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)],[f544,f563]) ).
fof(f583,plain,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(forward_demodulation,[status(thm)],[f581,f582]) ).
fof(f585,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)],[f274,f273]) ).
fof(f586,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)],[f544,f585]) ).
fof(f587,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),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)],[f321,f586]) ).
fof(f588,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),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)],[f581,f587]) ).
fof(f589,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(forward_demodulation,[status(thm)],[f445,f588]) ).
fof(f590,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f589,f583]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM924+5 : TPTP v8.1.2. Released v5.3.0.
% 0.08/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Apr 29 21:09:19 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.37 % Drodi V3.6.0
% 0.21/0.40 % Refutation found
% 0.21/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.42 % Elapsed time: 0.062178 seconds
% 0.21/0.42 % CPU time: 0.330329 seconds
% 0.21/0.42 % Total memory used: 70.319 MB
% 0.21/0.42 % Net memory used: 70.205 MB
%------------------------------------------------------------------------------