↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n007.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:07:30 PM UTC 2025

% Result   : Theorem 3.43s 3.62s
% Output   : Proof 3.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN361+1 : TPTP v9.2.0. Released v2.0.0.
% 0.11/0.13  % Command    : duper %s
% 0.14/0.33  % Computer : n007.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Thu Oct  2 15:44:53 EDT 2025
% 0.14/0.33  % CPUTime    : 
% 3.43/3.62  SZS status Theorem for theBenchmark.p
% 3.43/3.62  SZS output start Proof for theBenchmark.p
% 3.43/3.62  Clause #0 (by assumption #[]): Eq
% 3.43/3.62    (Not
% 3.43/3.62      (And (And (Exists fun V => ∀ (X : Iota), big_p X V) (∀ (X : Iota), big_s X → Exists fun Y => big_q Y X))
% 3.43/3.62          (∀ (X Y : Iota), big_p X Y → Not (big_q X Y)) →
% 3.43/3.62        Exists fun U => Not (big_s U)))
% 3.43/3.62    True
% 3.43/3.62  Clause #1 (by clausification #[0]): Eq
% 3.43/3.62    (And (And (Exists fun V => ∀ (X : Iota), big_p X V) (∀ (X : Iota), big_s X → Exists fun Y => big_q Y X))
% 3.43/3.62        (∀ (X Y : Iota), big_p X Y → Not (big_q X Y)) →
% 3.43/3.62      Exists fun U => Not (big_s U))
% 3.43/3.62    False
% 3.43/3.62  Clause #2 (by clausification #[1]): Eq
% 3.43/3.62    (And (And (Exists fun V => ∀ (X : Iota), big_p X V) (∀ (X : Iota), big_s X → Exists fun Y => big_q Y X))
% 3.43/3.62      (∀ (X Y : Iota), big_p X Y → Not (big_q X Y)))
% 3.43/3.62    True
% 3.43/3.62  Clause #3 (by clausification #[1]): Eq (Exists fun U => Not (big_s U)) False
% 3.43/3.62  Clause #4 (by clausification #[2]): Eq (∀ (X Y : Iota), big_p X Y → Not (big_q X Y)) True
% 3.43/3.62  Clause #5 (by clausification #[2]): Eq (And (Exists fun V => ∀ (X : Iota), big_p X V) (∀ (X : Iota), big_s X → Exists fun Y => big_q Y X)) True
% 3.43/3.62  Clause #6 (by clausification #[4]): ∀ (a : Iota), Eq (∀ (Y : Iota), big_p a Y → Not (big_q a Y)) True
% 3.43/3.62  Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (big_p a a_1 → Not (big_q a a_1)) True
% 3.43/3.62  Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (big_p a a_1) False) (Eq (Not (big_q a a_1)) True)
% 3.43/3.62  Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (big_p a a_1) False) (Eq (big_q a a_1) False)
% 3.43/3.62  Clause #10 (by clausification #[3]): ∀ (a : Iota), Eq (Not (big_s a)) False
% 3.43/3.62  Clause #11 (by clausification #[10]): ∀ (a : Iota), Eq (big_s a) True
% 3.43/3.62  Clause #12 (by clausification #[5]): Eq (∀ (X : Iota), big_s X → Exists fun Y => big_q Y X) True
% 3.43/3.62  Clause #13 (by clausification #[5]): Eq (Exists fun V => ∀ (X : Iota), big_p X V) True
% 3.43/3.62  Clause #14 (by clausification #[12]): ∀ (a : Iota), Eq (big_s a → Exists fun Y => big_q Y a) True
% 3.43/3.62  Clause #15 (by clausification #[14]): ∀ (a : Iota), Or (Eq (big_s a) False) (Eq (Exists fun Y => big_q Y a) True)
% 3.43/3.62  Clause #16 (by clausification #[15]): ∀ (a a_1 : Iota), Or (Eq (big_s a) False) (Eq (big_q (skS.0 0 a a_1) a) True)
% 3.43/3.62  Clause #17 (by forward demodulation #[16, 11]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (big_q (skS.0 0 a a_1) a) True)
% 3.43/3.62  Clause #18 (by clausification #[17]): ∀ (a a_1 : Iota), Eq (big_q (skS.0 0 a a_1) a) True
% 3.43/3.62  Clause #19 (by clausification #[13]): ∀ (a : Iota), Eq (∀ (X : Iota), big_p X (skS.0 1 a)) True
% 3.43/3.62  Clause #20 (by clausification #[19]): ∀ (a a_1 : Iota), Eq (big_p a (skS.0 1 a_1)) True
% 3.43/3.62  Clause #21 (by superposition #[20, 9]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (big_q a (skS.0 1 a_1)) False)
% 3.43/3.62  Clause #22 (by clausification #[21]): ∀ (a a_1 : Iota), Eq (big_q a (skS.0 1 a_1)) False
% 3.43/3.62  Clause #23 (by superposition #[22, 18]): Eq False True
% 3.43/3.62  Clause #24 (by clausification #[23]): False
% 3.43/3.62  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------