↑ Up

Duper---1.0.UNS-Prf.s

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

% Computer : n015.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:09:14 PM UTC 2025

% Result   : Unsatisfiable 4.18s 4.39s
% Output   : Proof 4.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYO520^1 : TPTP v9.2.0. Released v4.1.0.
% 0.07/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri Oct  3 13:53:53 EDT 2025
% 0.14/0.35  % CPUTime    : 
% 4.18/4.39  SZS status Theorem for theBenchmark.p
% 4.18/4.39  SZS output start Proof for theBenchmark.p
% 4.18/4.39  Clause #0 (by assumption #[]): Eq (∀ (P : Iota → Prop), (Exists fun X => P X) → P (eps P)) True
% 4.18/4.39  Clause #1 (by assumption #[]): Eq (p (eps fun X => Not (p X))) True
% 4.18/4.39  Clause #2 (by assumption #[]): Eq (Not (p (eps p))) True
% 4.18/4.39  Clause #3 (by clausification #[2]): Eq (p (eps p)) False
% 4.18/4.39  Clause #4 (by betaEtaReduce #[0]): Eq (∀ (P : Iota → Prop), Exists P → P (eps P)) True
% 4.18/4.39  Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop), Eq (Exists a → a (eps a)) True
% 4.18/4.39  Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop), Or (Eq (Exists a) False) (Eq (a (eps a)) True)
% 4.18/4.39  Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (a (eps a)) True) (Eq (a a_1) False)
% 4.18/4.39  Clause #15 (by superposition #[1, 7]): Or (Eq ((fun x => p x) (eps fun x => p x)) True) (Eq False True)
% 4.18/4.39  Clause #43 (by betaEtaReduce #[15]): Or (Eq (p (eps p)) True) (Eq False True)
% 4.18/4.39  Clause #44 (by clausification #[43]): Eq (p (eps p)) True
% 4.18/4.39  Clause #45 (by superposition #[44, 3]): Eq True False
% 4.18/4.39  Clause #50 (by clausification #[45]): False
% 4.18/4.39  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------