↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n011.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:03 PM UTC 2025

% Result   : Theorem 3.53s 3.71s
% Output   : Proof 3.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SYN731+1 : TPTP v9.2.0. Released v2.5.0.
% 0.08/0.15  % Command    : duper %s
% 0.14/0.36  % Computer : n011.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   : Thu Oct  2 15:13:53 EDT 2025
% 0.14/0.36  % CPUTime    : 
% 3.53/3.71  SZS status Theorem for theBenchmark.p
% 3.53/3.71  SZS output start Proof for theBenchmark.p
% 3.53/3.71  Clause #0 (by assumption #[]): Eq (Not (Exists fun W => (∀ (X : Iota), Exists fun Y => p W X Y) → Exists fun Z => p Z Z W)) True
% 3.53/3.71  Clause #1 (by betaEtaReduce #[0]): Eq (Not (Exists fun W => (∀ (X : Iota), Exists (p W X)) → Exists fun Z => p Z Z W)) True
% 3.53/3.71  Clause #2 (by clausification #[1]): Eq (Exists fun W => (∀ (X : Iota), Exists (p W X)) → Exists fun Z => p Z Z W) False
% 3.53/3.71  Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq ((∀ (X : Iota), Exists (p a X)) → Exists fun Z => p Z Z a) False
% 3.53/3.71  Clause #4 (by clausification #[3]): ∀ (a : Iota), Eq (∀ (X : Iota), Exists (p a X)) True
% 3.53/3.71  Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (Exists fun Z => p Z Z a) False
% 3.53/3.71  Clause #6 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (Exists (p a a_1)) True
% 3.53/3.71  Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : Iota), Eq (p a a_1 (skS.0 0 a a_1 a_2)) True
% 3.53/3.71  Clause #8 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (p a a a_1) False
% 3.53/3.71  Clause #9 (by superposition #[8, 7]): Eq False True
% 3.53/3.71  Clause #10 (by clausification #[9]): False
% 3.53/3.71  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------