↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n022.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:01:50 PM UTC 2025

% Result   : Theorem 3.84s 4.06s
% Output   : Proof 3.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU532^2 : TPTP v9.2.0. Released v3.7.0.
% 0.07/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri Oct  3 05:51:08 EDT 2025
% 0.14/0.36  % CPUTime    : 
% 3.84/4.06  SZS status Theorem for theBenchmark.p
% 3.84/4.06  SZS output start Proof for theBenchmark.p
% 3.84/4.06  Clause #0 (by assumption #[]): Eq (Eq setadjoinIL (∀ (Xx Xy : Iota), in Xx (setadjoin Xx Xy))) True
% 3.84/4.06  Clause #1 (by assumption #[]): Eq (Not (setadjoinIL → ∀ (Xx Xy : Iota), in Xx (setadjoin Xx (setadjoin Xy emptyset)))) True
% 3.84/4.06  Clause #2 (by clausification #[0]): Eq setadjoinIL (∀ (Xx Xy : Iota), in Xx (setadjoin Xx Xy))
% 3.84/4.06  Clause #4 (by clausify Prop equality #[2]): Or (Eq setadjoinIL False) (Eq (∀ (Xx Xy : Iota), in Xx (setadjoin Xx Xy)) True)
% 3.84/4.06  Clause #6 (by clausification #[4]): ∀ (a : Iota), Or (Eq setadjoinIL False) (Eq (∀ (Xy : Iota), in a (setadjoin a Xy)) True)
% 3.84/4.06  Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq setadjoinIL False) (Eq (in a (setadjoin a a_1)) True)
% 3.84/4.06  Clause #12 (by clausification #[1]): Eq (setadjoinIL → ∀ (Xx Xy : Iota), in Xx (setadjoin Xx (setadjoin Xy emptyset))) False
% 3.84/4.06  Clause #13 (by clausification #[12]): Eq setadjoinIL True
% 3.84/4.06  Clause #14 (by clausification #[12]): Eq (∀ (Xx Xy : Iota), in Xx (setadjoin Xx (setadjoin Xy emptyset))) False
% 3.84/4.06  Clause #16 (by backward demodulation #[13, 7]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (in a (setadjoin a a_1)) True)
% 3.84/4.06  Clause #18 (by clausification #[14]): ∀ (a : Iota), Eq (Not (∀ (Xy : Iota), in (skS.0 2 a) (setadjoin (skS.0 2 a) (setadjoin Xy emptyset)))) True
% 3.84/4.06  Clause #19 (by clausification #[18]): ∀ (a : Iota), Eq (∀ (Xy : Iota), in (skS.0 2 a) (setadjoin (skS.0 2 a) (setadjoin Xy emptyset))) False
% 3.84/4.06  Clause #20 (by clausification #[19]): ∀ (a a_1 : Iota), Eq (Not (in (skS.0 2 a) (setadjoin (skS.0 2 a) (setadjoin (skS.0 3 a a_1) emptyset)))) True
% 3.84/4.06  Clause #21 (by clausification #[20]): ∀ (a a_1 : Iota), Eq (in (skS.0 2 a) (setadjoin (skS.0 2 a) (setadjoin (skS.0 3 a a_1) emptyset))) False
% 3.84/4.06  Clause #22 (by clausification #[16]): ∀ (a a_1 : Iota), Eq (in a (setadjoin a a_1)) True
% 3.84/4.06  Clause #23 (by superposition #[22, 21]): Eq True False
% 3.84/4.06  Clause #24 (by clausification #[23]): False
% 3.84/4.06  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------