↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n028.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.52s 3.69s
% Output   : Proof 3.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SYN732+1 : TPTP v9.2.0. Released v2.5.0.
% 0.08/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Thu Oct  2 15:43:53 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.52/3.69  SZS status Theorem for theBenchmark.p
% 3.52/3.69  SZS output start Proof for theBenchmark.p
% 3.52/3.69  Clause #0 (by assumption #[]): Eq
% 3.52/3.69    (Not
% 3.52/3.69      ((∀ (Y : Iota), (∀ (X : Iota), p X Y) → ∀ (U : Iota), q U Y) →
% 3.52/3.69        Exists fun Z => (Exists fun V => p V Z) → Exists fun W => Or (p Z W) (q W Z)))
% 3.52/3.69    True
% 3.52/3.69  Clause #1 (by clausification #[0]): Eq
% 3.52/3.69    ((∀ (Y : Iota), (∀ (X : Iota), p X Y) → ∀ (U : Iota), q U Y) →
% 3.52/3.69      Exists fun Z => (Exists fun V => p V Z) → Exists fun W => Or (p Z W) (q W Z))
% 3.52/3.69    False
% 3.52/3.69  Clause #3 (by clausification #[1]): Eq (Exists fun Z => (Exists fun V => p V Z) → Exists fun W => Or (p Z W) (q W Z)) False
% 3.52/3.69  Clause #9 (by clausification #[3]): ∀ (a : Iota), Eq ((Exists fun V => p V a) → Exists fun W => Or (p a W) (q W a)) False
% 3.52/3.69  Clause #10 (by clausification #[9]): ∀ (a : Iota), Eq (Exists fun V => p V a) True
% 3.52/3.69  Clause #11 (by clausification #[9]): ∀ (a : Iota), Eq (Exists fun W => Or (p a W) (q W a)) False
% 3.52/3.69  Clause #12 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (p (skS.0 1 a a_1) a) True
% 3.52/3.69  Clause #13 (by clausification #[11]): ∀ (a a_1 : Iota), Eq (Or (p a a_1) (q a_1 a)) False
% 3.52/3.69  Clause #15 (by clausification #[13]): ∀ (a a_1 : Iota), Eq (p a a_1) False
% 3.52/3.69  Clause #16 (by superposition #[15, 12]): Eq False True
% 3.52/3.69  Clause #17 (by clausification #[16]): False
% 3.52/3.69  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------