↑ Up

Duper---1.0.THM-Prf.s

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

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

% Result   : Theorem 4.30s 4.50s
% Output   : Proof 4.30s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN395+1 : TPTP v9.2.0. Released v2.0.0.
% 0.07/0.13  % Command    : duper %s
% 0.12/0.34  % Computer : n025.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:45:38 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 4.30/4.50  SZS status Theorem for theBenchmark.p
% 4.30/4.50  SZS output start Proof for theBenchmark.p
% 4.30/4.50  Clause #0 (by assumption #[]): Eq (Not ((∀ (X : Iota), f X → g X) → (Exists fun Y => f Y) → Exists fun Z => g Z)) True
% 4.30/4.50  Clause #1 (by betaEtaReduce #[0]): Eq (Not ((∀ (X : Iota), f X → g X) → Exists f → Exists g)) True
% 4.30/4.50  Clause #2 (by clausification #[1]): Eq ((∀ (X : Iota), f X → g X) → Exists f → Exists g) False
% 4.30/4.50  Clause #3 (by clausification #[2]): Eq (∀ (X : Iota), f X → g X) True
% 4.30/4.50  Clause #4 (by clausification #[2]): Eq (Exists f → Exists g) False
% 4.30/4.50  Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (f a → g a) True
% 4.30/4.50  Clause #6 (by clausification #[5]): ∀ (a : Iota), Or (Eq (f a) False) (Eq (g a) True)
% 4.30/4.50  Clause #7 (by clausification #[4]): Eq (Exists f) True
% 4.30/4.50  Clause #8 (by clausification #[4]): Eq (Exists g) False
% 4.30/4.50  Clause #9 (by clausification #[7]): ∀ (a : Iota), Eq (f (skS.0 0 a)) True
% 4.30/4.50  Clause #10 (by superposition #[9, 6]): ∀ (a : Iota), Or (Eq True False) (Eq (g (skS.0 0 a)) True)
% 4.30/4.50  Clause #11 (by clausification #[8]): ∀ (a : Iota), Eq (g a) False
% 4.30/4.50  Clause #12 (by clausification #[10]): ∀ (a : Iota), Eq (g (skS.0 0 a)) True
% 4.30/4.50  Clause #13 (by superposition #[12, 11]): Eq True False
% 4.30/4.50  Clause #14 (by clausification #[13]): False
% 4.30/4.50  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------