TSTP Solution File: NUM924+3 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : NUM924+3 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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:04 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 27 unt; 0 def)
% Number of atoms : 79 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 52 ( 26 ~; 21 |; 0 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 13 ( 4 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,hypothesis,
is_int(zero_zero_int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,hypothesis,
! [B_1_1] :
( is_int(B_1_1)
=> is_int(bit1(B_1_1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,axiom,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_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(f29,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(f60,axiom,
! [K_1] :
( is_int(K_1)
=> number_number_of_int(K_1) = K_1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f160,axiom,
! [Z,W] : hAPP_int_int(plus_plus_int(Z),W) = hAPP_int_int(plus_plus_int(W),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f186,axiom,
one_one_int = number_number_of_int(bit1(pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f198,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f393,axiom,
! [A_90] : hAPP_int_int(times_times_int(A_90),zero_zero_int) = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1230,conjecture,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_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(f1231,negated_conjecture,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_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)],[f1230]) ).
fof(f1233,plain,
is_int(zero_zero_int),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f1241,plain,
! [B_1_1] :
( ~ is_int(B_1_1)
| is_int(bit1(B_1_1)) ),
inference(pre_NNF_transformation,[status(esa)],[f7]) ).
fof(f1242,plain,
! [X0] :
( ~ is_int(X0)
| is_int(bit1(X0)) ),
inference(cnf_transformation,[status(esa)],[f1241]) ).
fof(f1275,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_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)],[f28]) ).
fof(f1276,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)],[f29]) ).
fof(f1339,plain,
! [K_1] :
( ~ is_int(K_1)
| number_number_of_int(K_1) = K_1 ),
inference(pre_NNF_transformation,[status(esa)],[f60]) ).
fof(f1340,plain,
! [X0] :
( ~ is_int(X0)
| number_number_of_int(X0) = X0 ),
inference(cnf_transformation,[status(esa)],[f1339]) ).
fof(f1627,plain,
! [X0,X1] : hAPP_int_int(plus_plus_int(X0),X1) = hAPP_int_int(plus_plus_int(X1),X0),
inference(cnf_transformation,[status(esa)],[f160]) ).
fof(f1682,plain,
one_one_int = number_number_of_int(bit1(pls)),
inference(cnf_transformation,[status(esa)],[f186]) ).
fof(f1710,plain,
pls = zero_zero_int,
inference(cnf_transformation,[status(esa)],[f198]) ).
fof(f2052,plain,
! [X0] : hAPP_int_int(times_times_int(X0),zero_zero_int) = zero_zero_int,
inference(cnf_transformation,[status(esa)],[f393]) ).
fof(f4406,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_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)],[f1231]) ).
fof(f4610,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(zero_zero_int))))),one_one_int)),zero_zero_int)),
inference(backward_demodulation,[status(thm)],[f1710,f4406]) ).
fof(f4627,plain,
one_one_int = number_number_of_int(bit1(zero_zero_int)),
inference(forward_demodulation,[status(thm)],[f1710,f1682]) ).
fof(f4688,plain,
( spl0_13
<=> is_int(zero_zero_int) ),
introduced(split_symbol_definition) ).
fof(f4690,plain,
( ~ is_int(zero_zero_int)
| spl0_13 ),
inference(component_clause,[status(thm)],[f4688]) ).
fof(f4696,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f4690,f1233]) ).
fof(f4697,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f4696]) ).
fof(f4709,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(zero_zero_int)))))),zero_zero_int)),
inference(paramodulation,[status(thm)],[f1627,f4610]) ).
fof(f4809,plain,
( spl0_23
<=> is_int(bit1(zero_zero_int)) ),
introduced(split_symbol_definition) ).
fof(f4811,plain,
( ~ is_int(bit1(zero_zero_int))
| spl0_23 ),
inference(component_clause,[status(thm)],[f4809]) ).
fof(f5075,plain,
( spl0_46
<=> one_one_int = bit1(zero_zero_int) ),
introduced(split_symbol_definition) ).
fof(f5076,plain,
( one_one_int = bit1(zero_zero_int)
| ~ spl0_46 ),
inference(component_clause,[status(thm)],[f5075]) ).
fof(f5078,plain,
( ~ is_int(bit1(zero_zero_int))
| one_one_int = bit1(zero_zero_int) ),
inference(paramodulation,[status(thm)],[f4627,f1340]) ).
fof(f5079,plain,
( ~ spl0_23
| spl0_46 ),
inference(split_clause,[status(thm)],[f5078,f4809,f5075]) ).
fof(f5086,plain,
( ~ is_int(zero_zero_int)
| spl0_23 ),
inference(resolution,[status(thm)],[f4811,f1242]) ).
fof(f5087,plain,
( ~ spl0_13
| spl0_23 ),
inference(split_clause,[status(thm)],[f5086,f4688,f4809]) ).
fof(f5103,plain,
( ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(one_one_int))))),zero_zero_int))
| ~ spl0_46 ),
inference(backward_demodulation,[status(thm)],[f5076,f4709]) ).
fof(f6154,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m))),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(forward_demodulation,[status(thm)],[f1627,f1275]) ).
fof(f6155,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int))))),m))),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(forward_demodulation,[status(thm)],[f1710,f6154]) ).
fof(f6156,plain,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(one_one_int)))),m))),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)))
| ~ spl0_46 ),
inference(forward_demodulation,[status(thm)],[f5076,f6155]) ).
fof(f6157,plain,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(one_one_int)))),m))),t)),zero_zero_int))
| ~ spl0_46 ),
inference(forward_demodulation,[status(thm)],[f2052,f6156]) ).
fof(f6674,plain,
hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))) = 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(forward_demodulation,[status(thm)],[f1627,f1276]) ).
fof(f6675,plain,
hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(zero_zero_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(forward_demodulation,[status(thm)],[f1710,f6674]) ).
fof(f6676,plain,
( hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(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)
| ~ spl0_46 ),
inference(forward_demodulation,[status(thm)],[f5076,f6675]) ).
fof(f6677,plain,
( hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(one_one_int)))) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m))),t)
| ~ spl0_46 ),
inference(forward_demodulation,[status(thm)],[f1627,f6676]) ).
fof(f6678,plain,
( hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(one_one_int)))) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int))))),m))),t)
| ~ spl0_46 ),
inference(forward_demodulation,[status(thm)],[f1710,f6677]) ).
fof(f6679,plain,
( hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(one_one_int)))) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(one_one_int)))),m))),t)
| ~ spl0_46 ),
inference(forward_demodulation,[status(thm)],[f5076,f6678]) ).
fof(f6680,plain,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(one_one_int))))),zero_zero_int))
| ~ spl0_46 ),
inference(backward_demodulation,[status(thm)],[f6679,f6157]) ).
fof(f6681,plain,
( $false
| ~ spl0_46 ),
inference(forward_subsumption_resolution,[status(thm)],[f6680,f5103]) ).
fof(f6682,plain,
~ spl0_46,
inference(contradiction_clause,[status(thm)],[f6681]) ).
fof(f6683,plain,
$false,
inference(sat_refutation,[status(thm)],[f4697,f5079,f5087,f6682]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM924+3 : TPTP v8.1.2. Released v5.3.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 29 20:44:12 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.44 % Drodi V3.6.0
% 0.20/0.55 % Refutation found
% 0.20/0.55 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.57 % Elapsed time: 0.218380 seconds
% 0.20/0.57 % CPU time: 0.964293 seconds
% 0.20/0.57 % Total memory used: 169.557 MB
% 0.20/0.57 % Net memory used: 168.742 MB
%------------------------------------------------------------------------------