↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO140^5 : TPTP v9.2.0. Released v4.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 Oct  3 08:08:39 PM UTC 2025

% Result   : Theorem 3.99s 4.20s
% Output   : Proof 3.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SYO140^5 : TPTP v9.2.0. Released v4.0.0.
% 0.04/0.15  % Command    : duper %s
% 0.14/0.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri Oct  3 13:58:08 EDT 2025
% 0.14/0.36  % CPUTime    : 
% 3.99/4.20  SZS status Theorem for theBenchmark.p
% 3.99/4.20  SZS output start Proof for theBenchmark.p
% 3.99/4.20  Clause #0 (by assumption #[]): Eq (Not ((Exists fun Xx => cP Xx) → (∀ (Xx : Iota), cP Xx → cQ Xx) → Exists fun Xx => cQ Xx)) True
% 3.99/4.20  Clause #1 (by betaEtaReduce #[0]): Eq (Not (Exists cP → (∀ (Xx : Iota), cP Xx → cQ Xx) → Exists cQ)) True
% 3.99/4.20  Clause #2 (by clausification #[1]): Eq (Exists cP → (∀ (Xx : Iota), cP Xx → cQ Xx) → Exists cQ) False
% 3.99/4.20  Clause #3 (by clausification #[2]): Eq (Exists cP) True
% 3.99/4.20  Clause #4 (by clausification #[2]): Eq ((∀ (Xx : Iota), cP Xx → cQ Xx) → Exists cQ) False
% 3.99/4.20  Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (cP (skS.0 0 a)) True
% 3.99/4.20  Clause #6 (by clausification #[4]): Eq (∀ (Xx : Iota), cP Xx → cQ Xx) True
% 3.99/4.20  Clause #7 (by clausification #[4]): Eq (Exists cQ) False
% 3.99/4.20  Clause #8 (by clausification #[6]): ∀ (a : Iota), Eq (cP a → cQ a) True
% 3.99/4.20  Clause #9 (by clausification #[8]): ∀ (a : Iota), Or (Eq (cP a) False) (Eq (cQ a) True)
% 3.99/4.20  Clause #10 (by superposition #[9, 5]): ∀ (a : Iota), Or (Eq (cQ (skS.0 0 a)) True) (Eq False True)
% 3.99/4.20  Clause #11 (by clausification #[7]): ∀ (a : Iota), Eq (cQ a) False
% 3.99/4.20  Clause #12 (by clausification #[10]): ∀ (a : Iota), Eq (cQ (skS.0 0 a)) True
% 3.99/4.20  Clause #13 (by superposition #[12, 11]): Eq True False
% 3.99/4.20  Clause #14 (by clausification #[13]): False
% 3.99/4.20  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------