↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n014.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:51 PM UTC 2025

% Result   : Theorem 11.12s 11.32s
% Output   : Proof 11.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEU083+1 : TPTP v9.2.0. Released v3.2.0.
% 0.11/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n014.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri Oct  3 06:25:23 EDT 2025
% 0.14/0.34  % CPUTime    : 
% 11.12/11.32  SZS status Theorem for theBenchmark.p
% 11.12/11.32  SZS output start Proof for theBenchmark.p
% 11.12/11.32  Clause #34 (by assumption #[]): Eq (∀ (A B : Iota), And (finite A) (finite B) → finite (set_union2 A B)) True
% 11.12/11.32  Clause #60 (by assumption #[]): Eq (Not (∀ (A B : Iota), And (finite A) (finite B) → finite (set_union2 A B))) True
% 11.12/11.32  Clause #127 (by clausification #[34]): ∀ (a : Iota), Eq (∀ (B : Iota), And (finite a) (finite B) → finite (set_union2 a B)) True
% 11.12/11.32  Clause #128 (by clausification #[127]): ∀ (a a_1 : Iota), Eq (And (finite a) (finite a_1) → finite (set_union2 a a_1)) True
% 11.12/11.32  Clause #129 (by clausification #[128]): ∀ (a a_1 : Iota), Or (Eq (And (finite a) (finite a_1)) False) (Eq (finite (set_union2 a a_1)) True)
% 11.12/11.32  Clause #130 (by clausification #[129]): ∀ (a a_1 : Iota), Or (Eq (finite (set_union2 a a_1)) True) (Or (Eq (finite a) False) (Eq (finite a_1) False))
% 11.12/11.32  Clause #162 (by clausification #[60]): Eq (∀ (A B : Iota), And (finite A) (finite B) → finite (set_union2 A B)) False
% 11.12/11.32  Clause #163 (by clausification #[162]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), And (finite (skS.0 3 a)) (finite B) → finite (set_union2 (skS.0 3 a) B))) True
% 11.12/11.32  Clause #164 (by clausification #[163]): ∀ (a : Iota), Eq (∀ (B : Iota), And (finite (skS.0 3 a)) (finite B) → finite (set_union2 (skS.0 3 a) B)) False
% 11.12/11.32  Clause #165 (by clausification #[164]): ∀ (a a_1 : Iota),
% 11.12/11.32    Eq (Not (And (finite (skS.0 3 a)) (finite (skS.0 4 a a_1)) → finite (set_union2 (skS.0 3 a) (skS.0 4 a a_1)))) True
% 11.12/11.32  Clause #166 (by clausification #[165]): ∀ (a a_1 : Iota),
% 11.12/11.32    Eq (And (finite (skS.0 3 a)) (finite (skS.0 4 a a_1)) → finite (set_union2 (skS.0 3 a) (skS.0 4 a a_1))) False
% 11.12/11.32  Clause #167 (by clausification #[166]): ∀ (a a_1 : Iota), Eq (And (finite (skS.0 3 a)) (finite (skS.0 4 a a_1))) True
% 11.12/11.32  Clause #168 (by clausification #[166]): ∀ (a a_1 : Iota), Eq (finite (set_union2 (skS.0 3 a) (skS.0 4 a a_1))) False
% 11.12/11.32  Clause #169 (by clausification #[167]): ∀ (a a_1 : Iota), Eq (finite (skS.0 4 a a_1)) True
% 11.12/11.32  Clause #170 (by clausification #[167]): ∀ (a : Iota), Eq (finite (skS.0 3 a)) True
% 11.12/11.32  Clause #174 (by superposition #[170, 130]): ∀ (a a_1 : Iota), Or (Eq (finite (set_union2 (skS.0 3 a) a_1)) True) (Or (Eq True False) (Eq (finite a_1) False))
% 11.12/11.32  Clause #506 (by clausification #[174]): ∀ (a a_1 : Iota), Or (Eq (finite (set_union2 (skS.0 3 a) a_1)) True) (Eq (finite a_1) False)
% 11.12/11.32  Clause #508 (by superposition #[506, 169]): ∀ (a a_1 a_2 : Iota), Or (Eq (finite (set_union2 (skS.0 3 a) (skS.0 4 a_1 a_2))) True) (Eq False True)
% 11.12/11.32  Clause #1578 (by clausification #[508]): ∀ (a a_1 a_2 : Iota), Eq (finite (set_union2 (skS.0 3 a) (skS.0 4 a_1 a_2))) True
% 11.12/11.32  Clause #1579 (by superposition #[1578, 168]): Eq True False
% 11.12/11.32  Clause #1588 (by clausification #[1579]): False
% 11.12/11.32  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------