↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO092^5 : TPTP v9.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n006.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:35 PM UTC 2025

% Result   : Theorem 3.68s 3.85s
% Output   : Proof 3.68s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO092^5 : TPTP v9.2.0. Released v4.0.0.
% 0.03/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Oct  3 12:54:23 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.68/3.85  SZS status Theorem for theBenchmark.p
% 3.68/3.85  SZS output start Proof for theBenchmark.p
% 3.68/3.85  Clause #0 (by assumption #[]): Eq (Not ((∀ (Xx : Iota), Exists fun Xy => And (cP Xx) (Or (cQ Xy) (cQ Xx))) → Exists fun Xz => And (cP Xz) (cQ Xz)))
% 3.68/3.85    True
% 3.68/3.85  Clause #1 (by clausification #[0]): Eq ((∀ (Xx : Iota), Exists fun Xy => And (cP Xx) (Or (cQ Xy) (cQ Xx))) → Exists fun Xz => And (cP Xz) (cQ Xz)) False
% 3.68/3.85  Clause #2 (by clausification #[1]): Eq (∀ (Xx : Iota), Exists fun Xy => And (cP Xx) (Or (cQ Xy) (cQ Xx))) True
% 3.68/3.85  Clause #3 (by clausification #[1]): Eq (Exists fun Xz => And (cP Xz) (cQ Xz)) False
% 3.68/3.85  Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun Xy => And (cP a) (Or (cQ Xy) (cQ a))) True
% 3.68/3.85  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (And (cP a) (Or (cQ (skS.0 0 a a_1)) (cQ a))) True
% 3.68/3.85  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Or (cQ (skS.0 0 a a_1)) (cQ a)) True
% 3.68/3.85  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (cP a) True
% 3.68/3.85  Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq (cQ (skS.0 0 a a_1)) True) (Eq (cQ a) True)
% 3.68/3.86  Clause #9 (by clausification #[3]): ∀ (a : Iota), Eq (And (cP a) (cQ a)) False
% 3.68/3.86  Clause #10 (by clausification #[9]): ∀ (a : Iota), Or (Eq (cP a) False) (Eq (cQ a) False)
% 3.68/3.86  Clause #11 (by superposition #[10, 7]): ∀ (a : Iota), Or (Eq (cQ a) False) (Eq False True)
% 3.68/3.86  Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (cQ a) False
% 3.68/3.86  Clause #13 (by backward demodulation #[12, 8]): ∀ (a a_1 : Iota), Or (Eq (cQ (skS.0 0 a a_1)) True) (Eq False True)
% 3.68/3.86  Clause #15 (by clausification #[13]): ∀ (a a_1 : Iota), Eq (cQ (skS.0 0 a a_1)) True
% 3.68/3.86  Clause #16 (by superposition #[15, 12]): Eq True False
% 3.68/3.86  Clause #17 (by clausification #[16]): False
% 3.68/3.86  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------