↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n023.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:04 PM UTC 2025

% Result   : Theorem 3.55s 3.79s
% Output   : Proof 3.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN733+1 : TPTP v9.2.0. Released v2.5.0.
% 0.11/0.13  % Command    : duper %s
% 0.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % 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   : Thu Oct  2 15:37:23 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 3.55/3.79  SZS status Theorem for theBenchmark.p
% 3.55/3.79  SZS output start Proof for theBenchmark.p
% 3.55/3.79  Clause #0 (by assumption #[]): Eq (Not ((∀ (X : Iota), Exists fun Y => And (p X) (Or (q Y) (q X))) → Exists fun Z => And (p Z) (q Z))) True
% 3.55/3.79  Clause #1 (by clausification #[0]): Eq ((∀ (X : Iota), Exists fun Y => And (p X) (Or (q Y) (q X))) → Exists fun Z => And (p Z) (q Z)) False
% 3.55/3.79  Clause #2 (by clausification #[1]): Eq (∀ (X : Iota), Exists fun Y => And (p X) (Or (q Y) (q X))) True
% 3.55/3.79  Clause #3 (by clausification #[1]): Eq (Exists fun Z => And (p Z) (q Z)) False
% 3.55/3.79  Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun Y => And (p a) (Or (q Y) (q a))) True
% 3.55/3.79  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (And (p a) (Or (q (skS.0 0 a a_1)) (q a))) True
% 3.55/3.79  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Or (q (skS.0 0 a a_1)) (q a)) True
% 3.55/3.79  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (p a) True
% 3.55/3.79  Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq (q (skS.0 0 a a_1)) True) (Eq (q a) True)
% 3.55/3.79  Clause #9 (by clausification #[3]): ∀ (a : Iota), Eq (And (p a) (q a)) False
% 3.55/3.79  Clause #10 (by clausification #[9]): ∀ (a : Iota), Or (Eq (p a) False) (Eq (q a) False)
% 3.55/3.79  Clause #11 (by superposition #[10, 7]): ∀ (a : Iota), Or (Eq (q a) False) (Eq False True)
% 3.55/3.79  Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (q a) False
% 3.55/3.79  Clause #13 (by backward demodulation #[12, 8]): ∀ (a a_1 : Iota), Or (Eq (q (skS.0 0 a a_1)) True) (Eq False True)
% 3.55/3.79  Clause #15 (by clausification #[13]): ∀ (a a_1 : Iota), Eq (q (skS.0 0 a a_1)) True
% 3.55/3.79  Clause #16 (by superposition #[15, 12]): Eq True False
% 3.55/3.79  Clause #17 (by clausification #[16]): False
% 3.55/3.79  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------