↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SET883+1 : TPTP v9.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n028.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 08:00:38 PM UTC 2025

% Result   : Theorem 3.49s 3.66s
% Output   : Proof 3.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET883+1 : TPTP v9.2.0. Released v3.2.0.
% 0.03/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Thu Oct  2 13:43:53 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.49/3.66  SZS status Theorem for theBenchmark.p
% 3.49/3.66  SZS output start Proof for theBenchmark.p
% 3.49/3.66  Clause #3 (by assumption #[]): Eq (Not (∀ (A B : Iota), subset (singleton A) (singleton B) → Eq A B)) True
% 3.49/3.66  Clause #4 (by assumption #[]): Eq (∀ (A B : Iota), subset (singleton A) (singleton B) → Eq A B) True
% 3.49/3.66  Clause #11 (by clausification #[4]): ∀ (a : Iota), Eq (∀ (B : Iota), subset (singleton a) (singleton B) → Eq a B) True
% 3.49/3.66  Clause #12 (by clausification #[11]): ∀ (a a_1 : Iota), Eq (subset (singleton a) (singleton a_1) → Eq a a_1) True
% 3.49/3.66  Clause #13 (by clausification #[12]): ∀ (a a_1 : Iota), Or (Eq (subset (singleton a) (singleton a_1)) False) (Eq (Eq a a_1) True)
% 3.49/3.66  Clause #14 (by clausification #[13]): ∀ (a a_1 : Iota), Or (Eq (subset (singleton a) (singleton a_1)) False) (Eq a a_1)
% 3.49/3.66  Clause #17 (by clausification #[3]): Eq (∀ (A B : Iota), subset (singleton A) (singleton B) → Eq A B) False
% 3.49/3.66  Clause #18 (by clausification #[17]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), subset (singleton (skS.0 2 a)) (singleton B) → Eq (skS.0 2 a) B)) True
% 3.49/3.66  Clause #19 (by clausification #[18]): ∀ (a : Iota), Eq (∀ (B : Iota), subset (singleton (skS.0 2 a)) (singleton B) → Eq (skS.0 2 a) B) False
% 3.49/3.66  Clause #20 (by clausification #[19]): ∀ (a a_1 : Iota),
% 3.49/3.66    Eq (Not (subset (singleton (skS.0 2 a)) (singleton (skS.0 3 a a_1)) → Eq (skS.0 2 a) (skS.0 3 a a_1))) True
% 3.49/3.66  Clause #21 (by clausification #[20]): ∀ (a a_1 : Iota), Eq (subset (singleton (skS.0 2 a)) (singleton (skS.0 3 a a_1)) → Eq (skS.0 2 a) (skS.0 3 a a_1)) False
% 3.49/3.66  Clause #22 (by clausification #[21]): ∀ (a a_1 : Iota), Eq (subset (singleton (skS.0 2 a)) (singleton (skS.0 3 a a_1))) True
% 3.49/3.66  Clause #23 (by clausification #[21]): ∀ (a a_1 : Iota), Eq (Eq (skS.0 2 a) (skS.0 3 a a_1)) False
% 3.49/3.66  Clause #24 (by superposition #[22, 14]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (skS.0 2 a) (skS.0 3 a a_1))
% 3.49/3.66  Clause #25 (by clausification #[24]): ∀ (a a_1 : Iota), Eq (skS.0 2 a) (skS.0 3 a a_1)
% 3.49/3.66  Clause #27 (by clausification #[23]): ∀ (a a_1 : Iota), Ne (skS.0 2 a) (skS.0 3 a a_1)
% 3.49/3.66  Clause #28 (by forward demodulation #[27, 25]): ∀ (a : Iota), Ne (skS.0 2 a) (skS.0 2 a)
% 3.49/3.66  Clause #29 (by eliminate resolved literals #[28]): False
% 3.49/3.66  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------