TSTP Solution File: NUM925+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM925+3 : 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:31:00 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 20 unt; 0 def)
% Number of atoms : 80 ( 21 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 68 ( 32 ~; 26 |; 2 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 15 (; 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,hypothesis,
is_int(one_one_int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,hypothesis,
! [B_1_1,B_2_1] :
( ( is_int(B_1_1)
& is_int(B_2_1) )
=> is_int(plus_plus_int(B_1_1,B_2_1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,hypothesis,
! [B_1_1,B_2_1] : is_int(hAPP_nat_int(B_1_1,B_2_1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f29,axiom,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f39,axiom,
! [A_1] :
( is_int(A_1)
=> ( hAPP_nat_int(power_power_int(A_1),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int
<=> A_1 = zero_zero_int ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f77,axiom,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f127,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1233,conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1234,negated_conjecture,
~ ( hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ),
inference(negated_conjecture,[status(cth)],[f1233]) ).
fof(f1239,plain,
is_int(one_one_int),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f1240,plain,
! [B_1_1,B_2_1] :
( ~ is_int(B_1_1)
| ~ is_int(B_2_1)
| is_int(plus_plus_int(B_1_1,B_2_1)) ),
inference(pre_NNF_transformation,[status(esa)],[f4]) ).
fof(f1241,plain,
! [X0,X1] :
( ~ is_int(X0)
| ~ is_int(X1)
| is_int(plus_plus_int(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f1240]) ).
fof(f1266,plain,
! [X0,X1] : is_int(hAPP_nat_int(X0,X1)),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f1275,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
inference(cnf_transformation,[status(esa)],[f29]) ).
fof(f1293,plain,
! [A_1] :
( ~ is_int(A_1)
| ( hAPP_nat_int(power_power_int(A_1),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int
<=> A_1 = zero_zero_int ) ),
inference(pre_NNF_transformation,[status(esa)],[f39]) ).
fof(f1294,plain,
! [A_1] :
( ~ is_int(A_1)
| ( ( hAPP_nat_int(power_power_int(A_1),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int
| A_1 = zero_zero_int )
& ( hAPP_nat_int(power_power_int(A_1),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int
| A_1 != zero_zero_int ) ) ),
inference(NNF_transformation,[status(esa)],[f1293]) ).
fof(f1295,plain,
! [X0] :
( ~ is_int(X0)
| hAPP_nat_int(power_power_int(X0),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int
| X0 = zero_zero_int ),
inference(cnf_transformation,[status(esa)],[f1294]) ).
fof(f1365,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
inference(cnf_transformation,[status(esa)],[f77]) ).
fof(f1522,plain,
pls = zero_zero_int,
inference(cnf_transformation,[status(esa)],[f127]) ).
fof(f4524,plain,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(cnf_transformation,[status(esa)],[f1234]) ).
fof(f4736,plain,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(zero_zero_int)))) = zero_zero_int,
inference(backward_demodulation,[status(thm)],[f1522,f4524]) ).
fof(f4759,plain,
( spl0_9
<=> is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))) ),
introduced(split_symbol_definition) ).
fof(f4761,plain,
( ~ is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))
| spl0_9 ),
inference(component_clause,[status(thm)],[f4759]) ).
fof(f4765,plain,
( spl0_11
<=> plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)) = zero_zero_int ),
introduced(split_symbol_definition) ).
fof(f4766,plain,
( plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)) = zero_zero_int
| ~ spl0_11 ),
inference(component_clause,[status(thm)],[f4765]) ).
fof(f4775,plain,
( spl0_13
<=> is_int(one_one_int) ),
introduced(split_symbol_definition) ).
fof(f4777,plain,
( ~ is_int(one_one_int)
| spl0_13 ),
inference(component_clause,[status(thm)],[f4775]) ).
fof(f4778,plain,
( spl0_14
<=> is_int(hAPP_nat_int(semiri1621563631at_int,n)) ),
introduced(split_symbol_definition) ).
fof(f4780,plain,
( ~ is_int(hAPP_nat_int(semiri1621563631at_int,n))
| spl0_14 ),
inference(component_clause,[status(thm)],[f4778]) ).
fof(f4781,plain,
( ~ is_int(one_one_int)
| ~ is_int(hAPP_nat_int(semiri1621563631at_int,n))
| spl0_9 ),
inference(resolution,[status(thm)],[f4761,f1241]) ).
fof(f4782,plain,
( ~ spl0_13
| ~ spl0_14
| spl0_9 ),
inference(split_clause,[status(thm)],[f4781,f4775,f4778,f4759]) ).
fof(f4783,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f4777,f1239]) ).
fof(f4784,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f4783]) ).
fof(f4929,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),pls)),
inference(forward_demodulation,[status(thm)],[f1522,f1365]) ).
fof(f4930,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),zero_zero_int)),
inference(forward_demodulation,[status(thm)],[f1522,f4929]) ).
fof(f4934,plain,
! [X0] :
( ~ is_int(X0)
| hAPP_nat_int(power_power_int(X0),number_number_of_nat(bit0(bit1(zero_zero_int)))) != zero_zero_int
| X0 = zero_zero_int ),
inference(forward_demodulation,[status(thm)],[f1522,f1295]) ).
fof(f4937,plain,
( ~ is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))
| plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)) = zero_zero_int ),
inference(resolution,[status(thm)],[f4934,f4736]) ).
fof(f4938,plain,
( ~ spl0_9
| spl0_11 ),
inference(split_clause,[status(thm)],[f4937,f4759,f4765]) ).
fof(f5364,plain,
( $false
| spl0_14 ),
inference(backward_subsumption_resolution,[status(thm)],[f4780,f1266]) ).
fof(f5365,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f5364]) ).
fof(f5389,plain,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),zero_zero_int))
| ~ spl0_11 ),
inference(backward_demodulation,[status(thm)],[f4766,f1275]) ).
fof(f5390,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f5389,f4930]) ).
fof(f5391,plain,
~ spl0_11,
inference(contradiction_clause,[status(thm)],[f5390]) ).
fof(f5392,plain,
$false,
inference(sat_refutation,[status(thm)],[f4782,f4784,f4938,f5365,f5391]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM925+3 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n029.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue May 30 10:05:21 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.38 % Drodi V3.5.1
% 0.15/0.42 % Refutation found
% 0.15/0.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.47 % Elapsed time: 0.158244 seconds
% 0.15/0.47 % CPU time: 0.189484 seconds
% 0.15/0.47 % Memory used: 47.276 MB
%------------------------------------------------------------------------------