↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n003.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:53 PM UTC 2025

% Result   : Theorem 4.47s 4.64s
% Output   : Proof 4.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SEU116+1 : TPTP v9.2.0. Released v3.2.0.
% 0.12/0.13  % Command    : duper %s
% 0.13/0.36  % Computer : n003.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Fri Oct  3 04:34:23 EDT 2025
% 0.13/0.36  % CPUTime    : 
% 4.47/4.64  SZS status Theorem for theBenchmark.p
% 4.47/4.64  SZS output start Proof for theBenchmark.p
% 4.47/4.64  Clause #20 (by assumption #[]): Eq (∀ (A B : Iota), element B (finite_subsets A) → finite B) True
% 4.47/4.64  Clause #29 (by assumption #[]): Eq (Not (∀ (A B : Iota), element B (finite_subsets A) → finite B)) True
% 4.47/4.64  Clause #40 (by clausification #[20]): ∀ (a : Iota), Eq (∀ (B : Iota), element B (finite_subsets a) → finite B) True
% 4.47/4.64  Clause #41 (by clausification #[40]): ∀ (a a_1 : Iota), Eq (element a (finite_subsets a_1) → finite a) True
% 4.47/4.64  Clause #42 (by clausification #[41]): ∀ (a a_1 : Iota), Or (Eq (element a (finite_subsets a_1)) False) (Eq (finite a) True)
% 4.47/4.64  Clause #48 (by clausification #[29]): Eq (∀ (A B : Iota), element B (finite_subsets A) → finite B) False
% 4.47/4.64  Clause #49 (by clausification #[48]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), element B (finite_subsets (skS.0 1 a)) → finite B)) True
% 4.47/4.64  Clause #50 (by clausification #[49]): ∀ (a : Iota), Eq (∀ (B : Iota), element B (finite_subsets (skS.0 1 a)) → finite B) False
% 4.47/4.64  Clause #51 (by clausification #[50]): ∀ (a a_1 : Iota), Eq (Not (element (skS.0 2 a a_1) (finite_subsets (skS.0 1 a)) → finite (skS.0 2 a a_1))) True
% 4.47/4.64  Clause #52 (by clausification #[51]): ∀ (a a_1 : Iota), Eq (element (skS.0 2 a a_1) (finite_subsets (skS.0 1 a)) → finite (skS.0 2 a a_1)) False
% 4.47/4.64  Clause #53 (by clausification #[52]): ∀ (a a_1 : Iota), Eq (element (skS.0 2 a a_1) (finite_subsets (skS.0 1 a))) True
% 4.47/4.64  Clause #54 (by clausification #[52]): ∀ (a a_1 : Iota), Eq (finite (skS.0 2 a a_1)) False
% 4.47/4.64  Clause #55 (by superposition #[53, 42]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (finite (skS.0 2 a a_1)) True)
% 4.47/4.64  Clause #215 (by clausification #[55]): ∀ (a a_1 : Iota), Eq (finite (skS.0 2 a a_1)) True
% 4.47/4.64  Clause #216 (by superposition #[215, 54]): Eq True False
% 4.47/4.64  Clause #218 (by clausification #[216]): False
% 4.47/4.64  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------