TSTP Solution File: NUN015_5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : NUN015_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n010.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 12:47:07 EDT 2023
% Result : Theorem 12.14s 12.32s
% Output : Proof 12.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUN015_5 : TPTP v8.1.2. Released v6.0.0.
% 0.00/0.12 % Command : duper %s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun Aug 27 09:40:49 EDT 2023
% 0.11/0.33 % CPUTime :
% 12.14/12.32 SZS status Theorem for theBenchmark.p
% 12.14/12.32 SZS output start Proof for theBenchmark.p
% 12.14/12.32 Clause #0 (by assumption #[]): Eq (Ne v (zero_zero int)) True
% 12.14/12.32 Clause #1 (by assumption #[]): Eq
% 12.14/12.32 (∀ (A : Type),
% 12.14/12.32 linordered_idom A →
% 12.14/12.32 ∀ (A1 : A),
% 12.14/12.32 Iff (ord_less A (zero_zero A) (power_power A A1 (number_number_of nat (bit0 (bit1 pls)))))
% 12.14/12.32 (Ne A1 (zero_zero A)))
% 12.14/12.32 True
% 12.14/12.32 Clause #37 (by assumption #[]): Eq (Eq pls (zero_zero int)) True
% 12.14/12.32 Clause #97 (by assumption #[]): Eq (linordered_idom int) True
% 12.14/12.32 Clause #120 (by assumption #[]): Eq (Not (ord_less int (zero_zero int) (power_power int v (number_number_of nat (bit0 (bit1 pls)))))) True
% 12.14/12.32 Clause #121 (by clausification #[0]): Ne v (zero_zero int)
% 12.14/12.32 Clause #122 (by clausification #[1]): ∀ (a : Type),
% 12.14/12.32 Eq
% 12.14/12.32 (linordered_idom a →
% 12.14/12.32 ∀ (A1 : a),
% 12.14/12.32 Iff (ord_less a (zero_zero a) (power_power a A1 (number_number_of nat (bit0 (bit1 pls)))))
% 12.14/12.32 (Ne A1 (zero_zero a)))
% 12.14/12.32 True
% 12.14/12.32 Clause #123 (by clausification #[122]): ∀ (a : Type),
% 12.14/12.32 Or (Eq (linordered_idom a) False)
% 12.14/12.32 (Eq
% 12.14/12.32 (∀ (A1 : a),
% 12.14/12.32 Iff (ord_less a (zero_zero a) (power_power a A1 (number_number_of nat (bit0 (bit1 pls)))))
% 12.14/12.32 (Ne A1 (zero_zero a)))
% 12.14/12.32 True)
% 12.14/12.32 Clause #124 (by clausification #[123]): ∀ (a : Type) (a_1 : a),
% 12.14/12.32 Or (Eq (linordered_idom a) False)
% 12.14/12.32 (Eq
% 12.14/12.32 (Iff (ord_less a (zero_zero a) (power_power a a_1 (number_number_of nat (bit0 (bit1 pls)))))
% 12.14/12.32 (Ne a_1 (zero_zero a)))
% 12.14/12.32 True)
% 12.14/12.32 Clause #125 (by clausification #[124]): ∀ (a : Type) (a_1 : a),
% 12.14/12.32 Or (Eq (linordered_idom a) False)
% 12.14/12.32 (Or (Eq (ord_less a (zero_zero a) (power_power a a_1 (number_number_of nat (bit0 (bit1 pls))))) True)
% 12.14/12.32 (Eq (Ne a_1 (zero_zero a)) False))
% 12.14/12.32 Clause #127 (by clausification #[125]): ∀ (a : Type) (a_1 : a),
% 12.14/12.32 Or (Eq (linordered_idom a) False)
% 12.14/12.32 (Or (Eq (ord_less a (zero_zero a) (power_power a a_1 (number_number_of nat (bit0 (bit1 pls))))) True)
% 12.14/12.32 (Eq a_1 (zero_zero a)))
% 12.14/12.32 Clause #132 (by superposition #[97, 127]): ∀ (a : int),
% 12.14/12.32 Or (Eq (ord_less int (zero_zero int) (power_power int a (number_number_of nat (bit0 (bit1 pls))))) True)
% 12.14/12.32 (Or (Eq a (zero_zero int)) (Eq False True))
% 12.14/12.32 Clause #150 (by clausification #[37]): Eq pls (zero_zero int)
% 12.14/12.32 Clause #151 (by backward demodulation #[150, 121]): Ne v pls
% 12.14/12.32 Clause #981 (by clausification #[120]): Eq (ord_less int (zero_zero int) (power_power int v (number_number_of nat (bit0 (bit1 pls))))) False
% 12.14/12.32 Clause #982 (by forward demodulation #[981, 150]): Eq (ord_less int pls (power_power int v (number_number_of nat (bit0 (bit1 pls))))) False
% 12.14/12.32 Clause #1973 (by clausification #[132]): ∀ (a : int),
% 12.14/12.32 Or (Eq (ord_less int (zero_zero int) (power_power int a (number_number_of nat (bit0 (bit1 pls))))) True)
% 12.14/12.32 (Eq a (zero_zero int))
% 12.14/12.32 Clause #1974 (by forward demodulation #[1973, 150]): ∀ (a : int),
% 12.14/12.32 Or (Eq (ord_less int pls (power_power int a (number_number_of nat (bit0 (bit1 pls))))) True) (Eq a (zero_zero int))
% 12.14/12.32 Clause #1975 (by forward demodulation #[1974, 150]): ∀ (a : int), Or (Eq (ord_less int pls (power_power int a (number_number_of nat (bit0 (bit1 pls))))) True) (Eq a pls)
% 12.14/12.32 Clause #1976 (by superposition #[1975, 982]): Or (Eq v pls) (Eq True False)
% 12.14/12.32 Clause #2077 (by clausification #[1976]): Eq v pls
% 12.14/12.32 Clause #2078 (by forward contextual literal cutting #[2077, 151]): False
% 12.14/12.32 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------