↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n027.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:40 PM UTC 2025

% Result   : Theorem 5.67s 5.88s
% Output   : Proof 5.67s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : SYO154^5 : TPTP v9.2.0. Released v4.0.0.
% 0.06/0.11  % Command    : duper %s
% 0.10/0.30  % Computer : n027.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Fri Oct  3 14:36:08 EDT 2025
% 0.10/0.31  % CPUTime    : 
% 5.67/5.88  SZS status Theorem for theBenchmark.p
% 5.67/5.88  SZS output start Proof for theBenchmark.p
% 5.67/5.88  Clause #0 (by assumption #[]): Eq
% 5.67/5.88    (Not
% 5.67/5.88      (And (And (cP a) (∀ (Xx : Iota), cP Xx → cQ (f Xx))) (∀ (Xy : Iota), cQ Xy → cR (g Xy)) → Exists fun Xw => cR Xw))
% 5.67/5.88    True
% 5.67/5.88  Clause #1 (by betaEtaReduce #[0]): Eq (Not (And (And (cP a) (∀ (Xx : Iota), cP Xx → cQ (f Xx))) (∀ (Xy : Iota), cQ Xy → cR (g Xy)) → Exists cR)) True
% 5.67/5.88  Clause #2 (by clausification #[1]): Eq (And (And (cP a) (∀ (Xx : Iota), cP Xx → cQ (f Xx))) (∀ (Xy : Iota), cQ Xy → cR (g Xy)) → Exists cR) False
% 5.67/5.88  Clause #3 (by clausification #[2]): Eq (And (And (cP a) (∀ (Xx : Iota), cP Xx → cQ (f Xx))) (∀ (Xy : Iota), cQ Xy → cR (g Xy))) True
% 5.67/5.88  Clause #4 (by clausification #[2]): Eq (Exists cR) False
% 5.67/5.88  Clause #5 (by clausification #[3]): Eq (∀ (Xy : Iota), cQ Xy → cR (g Xy)) True
% 5.67/5.88  Clause #6 (by clausification #[3]): Eq (And (cP a) (∀ (Xx : Iota), cP Xx → cQ (f Xx))) True
% 5.67/5.88  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (cQ a → cR (g a)) True
% 5.67/5.88  Clause #8 (by clausification #[7]): ∀ (a : Iota), Or (Eq (cQ a) False) (Eq (cR (g a)) True)
% 5.67/5.88  Clause #9 (by clausification #[4]): ∀ (a : Iota), Eq (cR a) False
% 5.67/5.88  Clause #10 (by clausification #[6]): Eq (∀ (Xx : Iota), cP Xx → cQ (f Xx)) True
% 5.67/5.88  Clause #11 (by clausification #[6]): Eq (cP a) True
% 5.67/5.88  Clause #12 (by clausification #[10]): ∀ (a : Iota), Eq (cP a → cQ (f a)) True
% 5.67/5.88  Clause #13 (by clausification #[12]): ∀ (a : Iota), Or (Eq (cP a) False) (Eq (cQ (f a)) True)
% 5.67/5.88  Clause #14 (by superposition #[11, 13]): Or (Eq (cQ (f a)) True) (Eq False True)
% 5.67/5.88  Clause #15 (by clausification #[14]): Eq (cQ (f a)) True
% 5.67/5.88  Clause #16 (by superposition #[15, 8]): Or (Eq True False) (Eq (cR (g (f a))) True)
% 5.67/5.88  Clause #17 (by clausification #[16]): Eq (cR (g (f a))) True
% 5.67/5.88  Clause #18 (by superposition #[17, 9]): Eq True False
% 5.67/5.88  Clause #19 (by clausification #[18]): False
% 5.67/5.88  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------