TSTP Solution File: NUM925^1 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : NUM925^1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n020.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 : 600s
% DateTime : Mon Jul 18 13:57:40 EDT 2022
% Result : Theorem 23.45s 23.91s
% Output : Proof 23.45s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_int,type,
int: $tType ).
thf(ty_nat,type,
nat: $tType ).
thf(ty_semiri1621563631at_int,type,
semiri1621563631at_int: nat > int ).
thf(ty_n,type,
n: nat ).
thf(ty_bit1,type,
bit1: int > int ).
thf(ty_bit0,type,
bit0: int > int ).
thf(ty_zero_zero_int,type,
zero_zero_int: int ).
thf(ty_one_one_int,type,
one_one_int: int ).
thf(ty_pls,type,
pls: int ).
thf(ty_power_power_int,type,
power_power_int: int > nat > int ).
thf(ty_plus_plus_int,type,
plus_plus_int: int > int > int ).
thf(ty_number_number_of_nat,type,
number_number_of_nat: int > nat ).
thf(sP1,plain,
( sP1
<=> ! [X1: int] :
( ( pls = X1 )
=> ( X1 = pls ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( pls = zero_zero_int )
=> ( zero_zero_int = pls ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: int] :
( ( ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
= zero_zero_int )
= ( X1 = zero_zero_int ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
= zero_zero_int ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ( zero_zero_int = pls ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ! [X1: int,X2: int] :
( ( X1 = X2 )
=> ( X2 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( sP4
= ( ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) )
= zero_zero_int ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) )
= zero_zero_int ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( ord_less_int @ pls @ zero_zero_int ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( ord_less_int @ zero_zero_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( pls = zero_zero_int ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(conj_0,conjecture,
~ sP4 ).
thf(h0,negated_conjecture,
sP4,
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(1,plain,
( ~ sP7
| ~ sP4
| sP8 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP10
| sP9
| ~ sP5
| ~ sP8 ),
inference(mating_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP3
| sP7 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP2
| ~ sP11
| sP5 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP1
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP6
| sP1 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
sP6,
inference(eq_sym,[status(thm)],]) ).
thf(fact_78_Pls__def,axiom,
sP11 ).
thf(fact_62_bin__less__0__simps_I1_J,axiom,
~ sP9 ).
thf(fact_7_zero__eq__power2,axiom,
sP3 ).
thf(fact_0_n1pos,axiom,
sP10 ).
thf(8,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,h0,fact_78_Pls__def,fact_62_bin__less__0__simps_I1_J,fact_7_zero__eq__power2,fact_0_n1pos]) ).
thf(0,theorem,
~ sP4,
inference(contra,[status(thm),contra(discharge,[h0])],[8,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM925^1 : TPTP v8.1.0. Released v5.3.0.
% 0.03/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jul 7 19:48:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 23.45/23.91 % SZS status Theorem
% 23.45/23.91 % Mode: mode9a:USE_SINE=true:SINE_TOLERANCE=1.2:SINE_GENERALITY_THRESHOLD=4:SINE_RANK_LIMIT=1.:SINE_DEPTH=0
% 23.45/23.91 % Inferences: 2412
% 23.45/23.91 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------