↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n016.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:18 PM UTC 2025

% Result   : Theorem 3.66s 3.81s
% Output   : Proof 3.66s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : SYN950+1 : TPTP v9.2.0. Released v3.1.0.
% 0.08/0.15  % Command    : duper %s
% 0.15/0.36  % Computer : n016.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Thu Oct  2 15:04:38 EDT 2025
% 0.15/0.37  % CPUTime    : 
% 3.66/3.81  SZS status Theorem for theBenchmark.p
% 3.66/3.81  SZS output start Proof for theBenchmark.p
% 3.66/3.81  Clause #0 (by assumption #[]): Eq (Not (∀ (A B : Iota), (∀ (Y : Iota), q Y → p Y) → Exists fun X => And (p X → p A) (q X → p B))) True
% 3.66/3.81  Clause #1 (by clausification #[0]): Eq (∀ (A B : Iota), (∀ (Y : Iota), q Y → p Y) → Exists fun X => And (p X → p A) (q X → p B)) False
% 3.66/3.81  Clause #2 (by clausification #[1]): ∀ (a : Iota),
% 3.66/3.81    Eq (Not (∀ (B : Iota), (∀ (Y : Iota), q Y → p Y) → Exists fun X => And (p X → p (skS.0 0 a)) (q X → p B))) True
% 3.66/3.81  Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (B : Iota), (∀ (Y : Iota), q Y → p Y) → Exists fun X => And (p X → p (skS.0 0 a)) (q X → p B)) False
% 3.66/3.81  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota),
% 3.66/3.81    Eq (Not ((∀ (Y : Iota), q Y → p Y) → Exists fun X => And (p X → p (skS.0 0 a)) (q X → p (skS.0 1 a a_1)))) True
% 3.66/3.81  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota),
% 3.66/3.81    Eq ((∀ (Y : Iota), q Y → p Y) → Exists fun X => And (p X → p (skS.0 0 a)) (q X → p (skS.0 1 a a_1))) False
% 3.66/3.81  Clause #6 (by clausification #[5]): Eq (∀ (Y : Iota), q Y → p Y) True
% 3.66/3.81  Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Exists fun X => And (p X → p (skS.0 0 a)) (q X → p (skS.0 1 a a_1))) False
% 3.66/3.81  Clause #8 (by clausification #[6]): ∀ (a : Iota), Eq (q a → p a) True
% 3.66/3.81  Clause #9 (by clausification #[8]): ∀ (a : Iota), Or (Eq (q a) False) (Eq (p a) True)
% 3.66/3.81  Clause #10 (by clausification #[7]): ∀ (a a_1 a_2 : Iota), Eq (And (p a → p (skS.0 0 a_1)) (q a → p (skS.0 1 a_1 a_2))) False
% 3.66/3.81  Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), Or (Eq (p a → p (skS.0 0 a_1)) False) (Eq (q a → p (skS.0 1 a_1 a_2)) False)
% 3.66/3.81  Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Or (Eq (q a → p (skS.0 1 a_1 a_2)) False) (Eq (p a) True)
% 3.66/3.81  Clause #13 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Or (Eq (q a → p (skS.0 1 a_1 a_2)) False) (Eq (p (skS.0 0 a_1)) False)
% 3.66/3.81  Clause #14 (by clausification #[12]): ∀ (a : Iota), Or (Eq (p a) True) (Eq (q a) True)
% 3.66/3.81  Clause #16 (by superposition #[14, 9]): ∀ (a : Iota), Or (Eq (p a) True) (Or (Eq True False) (Eq (p a) True))
% 3.66/3.81  Clause #17 (by clausification #[16]): ∀ (a : Iota), Or (Eq (p a) True) (Eq (p a) True)
% 3.66/3.81  Clause #18 (by eliminate duplicate literals #[17]): ∀ (a : Iota), Eq (p a) True
% 3.66/3.81  Clause #22 (by clausification #[13]): ∀ (a a_1 : Iota), Or (Eq (p (skS.0 0 a)) False) (Eq (p (skS.0 1 a a_1)) False)
% 3.66/3.81  Clause #25 (by forward demodulation #[22, 18]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (p (skS.0 1 a a_1)) False)
% 3.66/3.81  Clause #26 (by clausification #[25]): ∀ (a a_1 : Iota), Eq (p (skS.0 1 a a_1)) False
% 3.66/3.81  Clause #27 (by superposition #[26, 18]): Eq False True
% 3.66/3.81  Clause #28 (by clausification #[27]): False
% 3.66/3.81  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------