↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEU882^5 : TPTP v9.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n025.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:02:35 PM UTC 2025

% Result   : Theorem 4.09s 4.29s
% Output   : Proof 4.09s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU882^5 : TPTP v9.2.0. Released v4.0.0.
% 0.07/0.15  % Command    : duper %s
% 0.15/0.36  % Computer : n025.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri Oct  3 06:26:38 EDT 2025
% 0.15/0.37  % CPUTime    : 
% 4.09/4.29  SZS status Theorem for theBenchmark.p
% 4.09/4.29  SZS output start Proof for theBenchmark.p
% 4.09/4.29  Clause #0 (by assumption #[]): Eq (Not (∀ (Xy : Iota), Exists fun Xf => Exists fun Xx => Eq (Xf Xx) Xy)) True
% 4.09/4.29  Clause #1 (by clausification #[0]): Eq (∀ (Xy : Iota), Exists fun Xf => Exists fun Xx => Eq (Xf Xx) Xy) False
% 4.09/4.29  Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (Not (Exists fun Xf => Exists fun Xx => Eq (Xf Xx) (skS.0 0 a))) True
% 4.09/4.29  Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun Xf => Exists fun Xx => Eq (Xf Xx) (skS.0 0 a)) False
% 4.09/4.29  Clause #4 (by clausification #[3]): ∀ (a : Iota → Iota) (a_1 : Iota), Eq (Exists fun Xx => Eq (a Xx) (skS.0 0 a_1)) False
% 4.09/4.29  Clause #5 (by clausification #[4]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Eq (Eq (a a_1) (skS.0 0 a_2)) False
% 4.09/4.29  Clause #6 (by clausification #[5]): ∀ (a : Iota → Iota) (a_1 a_2 : Iota), Ne (a a_1) (skS.0 0 a_2)
% 4.09/4.29  Clause #7 (by equality resolution #[6]): False
% 4.09/4.29  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------