↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYN961+1 : TPTP v9.2.0. Released v3.1.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:08:19 PM UTC 2025

% Result   : Theorem 5.55s 5.76s
% Output   : Proof 5.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SYN961+1 : TPTP v9.2.0. Released v3.1.0.
% 0.10/0.12  % Command    : duper %s
% 0.11/0.32  % Computer : n025.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Thu Oct  2 15:37:23 EDT 2025
% 0.11/0.32  % CPUTime    : 
% 5.55/5.76  SZS status Theorem for theBenchmark.p
% 5.55/5.76  SZS output start Proof for theBenchmark.p
% 5.55/5.76  Clause #0 (by assumption #[]): Eq (Not (∀ (A B : Iota), (∀ (X : Iota), p X) → And (p A) (p B))) True
% 5.55/5.76  Clause #1 (by clausification #[0]): Eq (∀ (A B : Iota), (∀ (X : Iota), p X) → And (p A) (p B)) False
% 5.55/5.76  Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), (∀ (X : Iota), p X) → And (p (skS.0 0 a)) (p B))) True
% 5.55/5.76  Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (B : Iota), (∀ (X : Iota), p X) → And (p (skS.0 0 a)) (p B)) False
% 5.55/5.76  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (Not ((∀ (X : Iota), p X) → And (p (skS.0 0 a)) (p (skS.0 1 a a_1)))) True
% 5.55/5.76  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq ((∀ (X : Iota), p X) → And (p (skS.0 0 a)) (p (skS.0 1 a a_1))) False
% 5.55/5.76  Clause #6 (by clausification #[5]): Eq (∀ (X : Iota), p X) True
% 5.55/5.76  Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (And (p (skS.0 0 a)) (p (skS.0 1 a a_1))) False
% 5.55/5.76  Clause #8 (by clausification #[6]): ∀ (a : Iota), Eq (p a) True
% 5.55/5.76  Clause #9 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (p (skS.0 0 a)) False) (Eq (p (skS.0 1 a a_1)) False)
% 5.55/5.76  Clause #10 (by forward demodulation #[9, 8]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (p (skS.0 1 a a_1)) False)
% 5.55/5.76  Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (p (skS.0 1 a a_1)) False
% 5.55/5.76  Clause #12 (by superposition #[11, 8]): Eq False True
% 5.55/5.76  Clause #13 (by clausification #[12]): False
% 5.55/5.76  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------