TSTP Solution File: NUM925+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM925+1 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n021.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 : Thu Aug 31 10:41:27 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 49 ( 26 unt; 19 typ; 0 def)
% Number of atoms : 40 ( 32 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 6 |; 3 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 12 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
zero_zero_int: $i ).
tff(decl_23,type,
one_one_int: $i ).
tff(decl_24,type,
n: $i ).
tff(decl_25,type,
semiri1621563631at_int: $i > $i ).
tff(decl_26,type,
plus_plus_int: ( $i * $i ) > $i ).
tff(decl_27,type,
ord_less_int: ( $i * $i ) > $o ).
tff(decl_28,type,
t: $i ).
tff(decl_29,type,
pls: $i ).
tff(decl_30,type,
bit1: $i > $i ).
tff(decl_31,type,
bit0: $i > $i ).
tff(decl_32,type,
number_number_of_nat: $i > $i ).
tff(decl_33,type,
power_power_int: ( $i * $i ) > $i ).
tff(decl_34,type,
one_one_nat: $i ).
tff(decl_35,type,
power_power_nat: ( $i * $i ) > $i ).
tff(decl_36,type,
zero_zero_nat: $i ).
tff(decl_37,type,
number_number_of_int: $i > $i ).
tff(decl_38,type,
plus_plus_nat: ( $i * $i ) > $i ).
tff(decl_39,type,
ord_less_nat: ( $i * $i ) > $o ).
tff(decl_40,type,
semiri984289939at_nat: $i > $i ).
fof(conj_0,conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(fact_83_Bit0__def,axiom,
! [X19] : bit0(X19) = plus_plus_int(X19,X19),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_83_Bit0__def) ).
fof(fact_99_Bit1__def,axiom,
! [X19] : bit1(X19) = plus_plus_int(plus_plus_int(one_one_int,X19),X19),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_99_Bit1__def) ).
fof(fact_84_zadd__0__right,axiom,
! [X15] : plus_plus_int(X15,zero_zero_int) = X15,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_84_zadd__0__right) ).
fof(fact_92_power__eq__0__iff__number__of,axiom,
! [X3,X23] :
( power_power_int(X3,number_number_of_nat(X23)) = zero_zero_int
<=> ( X3 = zero_zero_int
& number_number_of_nat(X23) != zero_zero_nat ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_92_power__eq__0__iff__number__of) ).
fof(fact_78_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_78_Pls__def) ).
fof(fact_62_bin__less__0__simps_I1_J,axiom,
~ ord_less_int(pls,zero_zero_int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_bin__less__0__simps_I1_J) ).
fof(fact_0_n1pos,axiom,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos) ).
fof(c_0_8,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
fof(c_0_9,plain,
! [X131] : bit0(X131) = plus_plus_int(X131,X131),
inference(variable_rename,[status(thm)],[fact_83_Bit0__def]) ).
fof(c_0_10,plain,
! [X151] : bit1(X151) = plus_plus_int(plus_plus_int(one_one_int,X151),X151),
inference(variable_rename,[status(thm)],[fact_99_Bit1__def]) ).
fof(c_0_11,plain,
! [X132] : plus_plus_int(X132,zero_zero_int) = X132,
inference(variable_rename,[status(thm)],[fact_84_zadd__0__right]) ).
fof(c_0_12,plain,
! [X136,X137] :
( ( X136 = zero_zero_int
| power_power_int(X136,number_number_of_nat(X137)) != zero_zero_int )
& ( number_number_of_nat(X137) != zero_zero_nat
| power_power_int(X136,number_number_of_nat(X137)) != zero_zero_int )
& ( X136 != zero_zero_int
| number_number_of_nat(X137) = zero_zero_nat
| power_power_int(X136,number_number_of_nat(X137)) = zero_zero_int ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_92_power__eq__0__iff__number__of])])]) ).
cnf(c_0_13,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
bit1(X1) = plus_plus_int(plus_plus_int(one_one_int,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
plus_plus_int(X1,zero_zero_int) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_78_Pls__def]) ).
cnf(c_0_18,plain,
( X1 = zero_zero_int
| power_power_int(X1,number_number_of_nat(X2)) != zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_15]) ).
cnf(c_0_20,plain,
plus_plus_int(X1,pls) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
~ ord_less_int(pls,zero_zero_int),
inference(fof_simplification,[status(thm)],[fact_62_bin__less__0__simps_I1_J]) ).
cnf(c_0_22,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).
cnf(c_0_23,plain,
( X1 = pls
| power_power_int(X1,number_number_of_nat(X2)) != pls ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17]),c_0_17]) ).
cnf(c_0_24,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(one_one_int,one_one_int))) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_17]) ).
cnf(c_0_25,plain,
~ ord_less_int(pls,zero_zero_int),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(rw,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_27,negated_conjecture,
plus_plus_int(one_one_int,semiri1621563631at_int(n)) = pls,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
~ ord_less_int(pls,pls),
inference(rw,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM925+1 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.34 % Computer : n021.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Fri Aug 25 08:22:10 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.020000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.025000 s
%------------------------------------------------------------------------------