↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO142^5 : TPTP v9.2.0. Released v4.0.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:08:39 PM UTC 2025

% Result   : Theorem 3.45s 3.63s
% Output   : Proof 3.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SYO142^5 : TPTP v9.2.0. Released v4.0.0.
% 0.10/0.13  % Command    : duper %s
% 0.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Fri Oct  3 13:16:23 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 3.45/3.63  SZS status Theorem for theBenchmark.p
% 3.45/3.63  SZS output start Proof for theBenchmark.p
% 3.45/3.63  Clause #0 (by assumption #[]): Eq (Not (Exists fun Xx => Exists fun Xy => And (p Xx → p (f (f Xy))) (p Xy → p (f (f a))))) True
% 3.45/3.63  Clause #1 (by clausification #[0]): Eq (Exists fun Xx => Exists fun Xy => And (p Xx → p (f (f Xy))) (p Xy → p (f (f a)))) False
% 3.45/3.63  Clause #2 (by clausification #[1]): ∀ (a_1 : Iota), Eq (Exists fun Xy => And (p a_1 → p (f (f Xy))) (p Xy → p (f (f a)))) False
% 3.45/3.63  Clause #3 (by clausification #[2]): ∀ (a_1 a_2 : Iota), Eq (And (p a_1 → p (f (f a_2))) (p a_2 → p (f (f a)))) False
% 3.45/3.63  Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : Iota), Or (Eq (p a_1 → p (f (f a_2))) False) (Eq (p a_2 → p (f (f a))) False)
% 3.45/3.63  Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : Iota), Or (Eq (p a_1 → p (f (f a))) False) (Eq (p a_2) True)
% 3.45/3.63  Clause #6 (by clausification #[4]): ∀ (a_1 : Iota), Or (Eq (p a_1 → p (f (f a))) False) (Eq (p (f (f a_1))) False)
% 3.45/3.63  Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (p a) True) (Eq (p a_1) True)
% 3.45/3.63  Clause #9 (by equality factoring #[7]): ∀ (a : Iota), Or (Ne True True) (Eq (p a) True)
% 3.45/3.63  Clause #10 (by clausification #[9]): ∀ (a : Iota), Or (Eq (p a) True) (Or (Eq True False) (Eq True False))
% 3.45/3.63  Clause #12 (by clausification #[10]): ∀ (a : Iota), Or (Eq (p a) True) (Eq True False)
% 3.45/3.63  Clause #13 (by clausification #[12]): ∀ (a : Iota), Eq (p a) True
% 3.45/3.63  Clause #15 (by clausification #[6]): ∀ (a_1 : Iota), Or (Eq (p (f (f a_1))) False) (Eq (p (f (f a))) False)
% 3.45/3.63  Clause #17 (by superposition #[15, 13]): Or (Eq (p (f (f a))) False) (Eq False True)
% 3.45/3.63  Clause #18 (by clausification #[17]): Eq (p (f (f a))) False
% 3.45/3.63  Clause #19 (by superposition #[18, 13]): Eq False True
% 3.45/3.63  Clause #20 (by clausification #[19]): False
% 3.45/3.63  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------