TSTP Solution File: SYN382+1 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYN382+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n017.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 Sep  1 02:11:32 EDT 2023

% Result   : Theorem 3.41s 3.59s
% Output   : Proof 3.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14  % Problem    : SYN382+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.15  % Command    : duper %s
% 0.15/0.35  % Computer : n017.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sat Aug 26 17:40:56 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 3.41/3.59  SZS status Theorem for theBenchmark.p
% 3.41/3.59  SZS output start Proof for theBenchmark.p
% 3.41/3.59  Clause #0 (by assumption #[]): Eq
% 3.41/3.59    (Not
% 3.41/3.59      ((∀ (Z : Iota), Exists fun X => Or (∀ (Y : Iota), big_p X Y) (big_q X Z)) →
% 3.41/3.59        ∀ (Y : Iota), Exists fun X => Or (big_p X Y) (big_q X Y)))
% 3.41/3.59    True
% 3.41/3.59  Clause #1 (by clausification #[0]): Eq
% 3.41/3.59    ((∀ (Z : Iota), Exists fun X => Or (∀ (Y : Iota), big_p X Y) (big_q X Z)) →
% 3.41/3.59      ∀ (Y : Iota), Exists fun X => Or (big_p X Y) (big_q X Y))
% 3.41/3.59    False
% 3.41/3.59  Clause #2 (by clausification #[1]): Eq (∀ (Z : Iota), Exists fun X => Or (∀ (Y : Iota), big_p X Y) (big_q X Z)) True
% 3.41/3.59  Clause #3 (by clausification #[1]): Eq (∀ (Y : Iota), Exists fun X => Or (big_p X Y) (big_q X Y)) False
% 3.41/3.59  Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun X => Or (∀ (Y : Iota), big_p X Y) (big_q X a)) True
% 3.41/3.59  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (Or (∀ (Y : Iota), big_p (skS.0 0 a a_1) Y) (big_q (skS.0 0 a a_1) a)) True
% 3.41/3.59  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (∀ (Y : Iota), big_p (skS.0 0 a a_1) Y) True) (Eq (big_q (skS.0 0 a a_1) a) True)
% 3.41/3.59  Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : Iota), Or (Eq (big_q (skS.0 0 a a_1) a) True) (Eq (big_p (skS.0 0 a a_1) a_2) True)
% 3.41/3.59  Clause #8 (by clausification #[3]): ∀ (a : Iota), Eq (Not (Exists fun X => Or (big_p X (skS.0 1 a)) (big_q X (skS.0 1 a)))) True
% 3.41/3.59  Clause #9 (by clausification #[8]): ∀ (a : Iota), Eq (Exists fun X => Or (big_p X (skS.0 1 a)) (big_q X (skS.0 1 a))) False
% 3.41/3.59  Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Eq (Or (big_p a (skS.0 1 a_1)) (big_q a (skS.0 1 a_1))) False
% 3.41/3.59  Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (big_q a (skS.0 1 a_1)) False
% 3.41/3.59  Clause #12 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (big_p a (skS.0 1 a_1)) False
% 3.41/3.59  Clause #14 (by superposition #[12, 7]): ∀ (a a_1 : Iota), Or (Eq (big_q (skS.0 0 a a_1) a) True) (Eq False True)
% 3.41/3.59  Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Eq (big_q (skS.0 0 a a_1) a) True
% 3.41/3.59  Clause #16 (by superposition #[15, 11]): Eq True False
% 3.41/3.59  Clause #17 (by clausification #[16]): False
% 3.41/3.59  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------