↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SET043^5 : TPTP v9.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n015.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 : Fri Oct  3 07:59:28 PM UTC 2025

% Result   : Theorem 3.55s 3.72s
% Output   : Proof 3.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET043^5 : TPTP v9.2.0. Released v4.0.0.
% 0.07/0.14  % Command    : duper %s
% 0.13/0.35  % Computer : n015.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   : Thu Oct  2 13:33:38 EDT 2025
% 0.13/0.35  % CPUTime    : 
% 3.55/3.72  SZS status Theorem for theBenchmark.p
% 3.55/3.72  SZS output start Proof for theBenchmark.p
% 3.55/3.72  Clause #0 (by assumption #[]): Eq (Not (Not (Exists fun U => ∀ (V : Iota), Iff (cE V U) (Not (cE V V))))) True
% 3.55/3.72  Clause #1 (by clausification #[0]): Eq (Not (Exists fun U => ∀ (V : Iota), Iff (cE V U) (Not (cE V V)))) False
% 3.55/3.72  Clause #2 (by clausification #[1]): Eq (Exists fun U => ∀ (V : Iota), Iff (cE V U) (Not (cE V V))) True
% 3.55/3.72  Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (V : Iota), Iff (cE V (skS.0 0 a)) (Not (cE V V))) True
% 3.55/3.72  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (Iff (cE a (skS.0 0 a_1)) (Not (cE a a))) True
% 3.55/3.72  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Or (Eq (cE a (skS.0 0 a_1)) True) (Eq (Not (cE a a)) False)
% 3.55/3.72  Clause #6 (by clausification #[4]): ∀ (a a_1 : Iota), Or (Eq (cE a (skS.0 0 a_1)) False) (Eq (Not (cE a a)) True)
% 3.55/3.72  Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (cE a (skS.0 0 a_1)) True) (Eq (cE a a) True)
% 3.55/3.72  Clause #8 (by equality factoring #[7]): ∀ (a : Iota), Or (Ne True True) (Eq (cE (skS.0 0 a) (skS.0 0 a)) True)
% 3.55/3.72  Clause #9 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq (cE a (skS.0 0 a_1)) False) (Eq (cE a a) False)
% 3.55/3.72  Clause #13 (by clausification #[8]): ∀ (a : Iota), Or (Eq (cE (skS.0 0 a) (skS.0 0 a)) True) (Or (Eq True False) (Eq True False))
% 3.55/3.72  Clause #15 (by clausification #[13]): ∀ (a : Iota), Or (Eq (cE (skS.0 0 a) (skS.0 0 a)) True) (Eq True False)
% 3.55/3.72  Clause #16 (by clausification #[15]): ∀ (a : Iota), Eq (cE (skS.0 0 a) (skS.0 0 a)) True
% 3.55/3.72  Clause #17 (by superposition #[16, 9]): Or (Eq True False) (Eq True False)
% 3.55/3.72  Clause #18 (by clausification #[17]): Eq True False
% 3.55/3.72  Clause #19 (by clausification #[18]): False
% 3.55/3.72  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------