↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n006.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:08:44 PM UTC 2025

% Result   : Theorem 4.74s 4.96s
% Output   : Proof 4.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem    : SYO202^5 : TPTP v9.2.0. Released v4.0.0.
% 0.00/0.09  % Command    : duper %s
% 0.08/0.29  % Computer : n006.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.29  % CPULimit   : 300
% 0.13/0.29  % WCLimit    : 300
% 0.13/0.29  % DateTime   : Fri Oct  3 12:53:08 EDT 2025
% 0.13/0.29  % CPUTime    : 
% 4.74/4.96  SZS status Theorem for theBenchmark.p
% 4.74/4.96  SZS output start Proof for theBenchmark.p
% 4.74/4.96  Clause #0 (by assumption #[]): Eq (Not (Not (Exists fun Xp => And (Xp (Eq Xp Xp)) (Not (Xp (Eq Xp Xp)))))) True
% 4.74/4.96  Clause #1 (by clausification #[0]): Eq (Not (Exists fun Xp => And (Xp (Eq Xp Xp)) (Not (Xp (Eq Xp Xp))))) False
% 4.74/4.96  Clause #2 (by clausification #[1]): Eq (Exists fun Xp => And (Xp (Eq Xp Xp)) (Not (Xp (Eq Xp Xp)))) True
% 4.74/4.96  Clause #3 (by clausification #[2]): ∀ (a : Prop → Prop),
% 4.74/4.96    Eq (And (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a))) (Not (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a))))) True
% 4.74/4.96  Clause #4 (by clausification #[3]): ∀ (a : Prop → Prop), Eq (Not (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a)))) True
% 4.74/4.96  Clause #5 (by clausification #[3]): ∀ (a : Prop → Prop), Eq (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a))) True
% 4.74/4.96  Clause #6 (by clausification #[4]): ∀ (a : Prop → Prop), Eq (skS.0 0 a (Eq (skS.0 0 a) (skS.0 0 a))) False
% 4.74/4.96  Clause #7 (by bool simp #[6]): ∀ (a : Prop → Prop), Eq (skS.0 0 a True) False
% 4.74/4.96  Clause #8 (by bool simp #[5]): ∀ (a : Prop → Prop), Eq (skS.0 0 a True) True
% 4.74/4.96  Clause #9 (by superposition #[8, 7]): Eq True False
% 4.74/4.96  Clause #10 (by clausification #[9]): False
% 4.74/4.96  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------