↑ Up

Duper---1.0.THM-Prf.s

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

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

% Result   : Theorem 11.19s 11.36s
% Output   : Proof 11.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU163+2 : TPTP v9.2.0. Released v3.3.0.
% 0.12/0.13  % Command    : duper %s
% 0.13/0.35  % Computer : n005.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   : Fri Oct  3 04:36:23 EDT 2025
% 0.13/0.35  % CPUTime    : 
% 11.19/11.36  SZS status Theorem for theBenchmark.p
% 11.19/11.36  SZS output start Proof for theBenchmark.p
% 11.19/11.36  Clause #35 (by assumption #[]): Eq (∀ (A B : Iota), in A B → subset A (union B)) True
% 11.19/11.36  Clause #78 (by assumption #[]): Eq (Not (∀ (A B : Iota), in A B → subset A (union B))) True
% 11.19/11.36  Clause #150 (by clausification #[35]): ∀ (a : Iota), Eq (∀ (B : Iota), in a B → subset a (union B)) True
% 11.19/11.36  Clause #151 (by clausification #[150]): ∀ (a a_1 : Iota), Eq (in a a_1 → subset a (union a_1)) True
% 11.19/11.36  Clause #152 (by clausification #[151]): ∀ (a a_1 : Iota), Or (Eq (in a a_1) False) (Eq (subset a (union a_1)) True)
% 11.19/11.36  Clause #298 (by clausification #[78]): Eq (∀ (A B : Iota), in A B → subset A (union B)) False
% 11.19/11.36  Clause #299 (by clausification #[298]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), in (skS.0 7 a) B → subset (skS.0 7 a) (union B))) True
% 11.19/11.36  Clause #300 (by clausification #[299]): ∀ (a : Iota), Eq (∀ (B : Iota), in (skS.0 7 a) B → subset (skS.0 7 a) (union B)) False
% 11.19/11.36  Clause #301 (by clausification #[300]): ∀ (a a_1 : Iota), Eq (Not (in (skS.0 7 a) (skS.0 8 a a_1) → subset (skS.0 7 a) (union (skS.0 8 a a_1)))) True
% 11.19/11.36  Clause #302 (by clausification #[301]): ∀ (a a_1 : Iota), Eq (in (skS.0 7 a) (skS.0 8 a a_1) → subset (skS.0 7 a) (union (skS.0 8 a a_1))) False
% 11.19/11.36  Clause #303 (by clausification #[302]): ∀ (a a_1 : Iota), Eq (in (skS.0 7 a) (skS.0 8 a a_1)) True
% 11.19/11.36  Clause #304 (by clausification #[302]): ∀ (a a_1 : Iota), Eq (subset (skS.0 7 a) (union (skS.0 8 a a_1))) False
% 11.19/11.36  Clause #306 (by superposition #[303, 152]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (subset (skS.0 7 a) (union (skS.0 8 a a_1))) True)
% 11.19/11.36  Clause #3118 (by clausification #[306]): ∀ (a a_1 : Iota), Eq (subset (skS.0 7 a) (union (skS.0 8 a a_1))) True
% 11.19/11.36  Clause #3119 (by superposition #[3118, 304]): Eq True False
% 11.19/11.36  Clause #3151 (by clausification #[3119]): False
% 11.19/11.36  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------