↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n022.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:31 PM UTC 2025

% Result   : Theorem 3.63s 3.83s
% Output   : Proof 3.63s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SYN371+1 : TPTP v9.2.0. Released v2.0.0.
% 0.08/0.13  % Command    : duper %s
% 0.12/0.34  % Computer : n022.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:17:38 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 3.63/3.83  SZS status Theorem for theBenchmark.p
% 3.63/3.83  SZS output start Proof for theBenchmark.p
% 3.63/3.83  Clause #0 (by assumption #[]): Eq (Not (((Exists fun X => big_r X X) → ∀ (Y : Iota), big_r Y Y) → Exists fun U => ∀ (V : Iota), big_r U U → big_r V V))
% 3.63/3.83    True
% 3.63/3.83  Clause #1 (by clausification #[0]): Eq (((Exists fun X => big_r X X) → ∀ (Y : Iota), big_r Y Y) → Exists fun U => ∀ (V : Iota), big_r U U → big_r V V) False
% 3.63/3.83  Clause #3 (by clausification #[1]): Eq (Exists fun U => ∀ (V : Iota), big_r U U → big_r V V) False
% 3.63/3.83  Clause #7 (by clausification #[3]): ∀ (a : Iota), Eq (∀ (V : Iota), big_r a a → big_r V V) False
% 3.63/3.83  Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Eq (Not (big_r a a → big_r (skS.0 0 a a_1) (skS.0 0 a a_1))) True
% 3.63/3.83  Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (big_r a a → big_r (skS.0 0 a a_1) (skS.0 0 a a_1)) False
% 3.63/3.83  Clause #10 (by clausification #[9]): ∀ (a : Iota), Eq (big_r a a) True
% 3.63/3.83  Clause #11 (by clausification #[9]): ∀ (a a_1 : Iota), Eq (big_r (skS.0 0 a a_1) (skS.0 0 a a_1)) False
% 3.63/3.83  Clause #12 (by superposition #[11, 10]): Eq False True
% 3.63/3.83  Clause #13 (by clausification #[12]): False
% 3.63/3.83  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------