↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n020.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 07:45:58 PM UTC 2025

% Result   : Theorem 4.14s 4.32s
% Output   : Proof 4.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : COM183^1 : TPTP v9.2.0. Released v7.0.0.
% 0.10/0.13  % Command    : duper %s
% 0.12/0.34  % Computer : n020.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 16:05:23 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 4.14/4.32  SZS status Theorem for theBenchmark.p
% 4.14/4.32  SZS output start Proof for theBenchmark.p
% 4.14/4.32  Clause #0 (by assumption #[]): Eq (gram_L716654942_subtr (sup_sup (set n) ns ns) tr1 tr3) True
% 4.14/4.32  Clause #13 (by assumption #[]): Eq (∀ (A : Type), semilattice_sup A (type2 A) → ∀ (A3 : A), Eq (sup_sup A A3 A3) A3) True
% 4.14/4.32  Clause #243 (by assumption #[]): Eq (∀ (A7 : Type), semilattice_sup (set A7) (type2 (set A7))) True
% 4.14/4.32  Clause #266 (by assumption #[]): Eq (Not (gram_L716654942_subtr ns tr1 tr3)) True
% 4.14/4.32  Clause #277 (by clausification #[266]): Eq (gram_L716654942_subtr ns tr1 tr3) False
% 4.14/4.32  Clause #295 (by clausification #[243]): ∀ (a : Type), Eq (semilattice_sup (set a) (type2 (set a))) True
% 4.14/4.32  Clause #558 (by clausification #[13]): ∀ (a : Type), Eq (semilattice_sup a (type2 a) → ∀ (A3 : a), Eq (sup_sup a A3 A3) A3) True
% 4.14/4.32  Clause #559 (by clausification #[558]): ∀ (a : Type), Or (Eq (semilattice_sup a (type2 a)) False) (Eq (∀ (A3 : a), Eq (sup_sup a A3 A3) A3) True)
% 4.14/4.32  Clause #560 (by clausification #[559]): ∀ (a : Type) (a_1 : a), Or (Eq (semilattice_sup a (type2 a)) False) (Eq (Eq (sup_sup a a_1 a_1) a_1) True)
% 4.14/4.32  Clause #561 (by clausification #[560]): ∀ (a : Type) (a_1 : a), Or (Eq (semilattice_sup a (type2 a)) False) (Eq (sup_sup a a_1 a_1) a_1)
% 4.14/4.32  Clause #563 (by superposition #[561, 295]): ∀ (a : Type) (a_1 : set a), Or (Eq (sup_sup (set a) a_1 a_1) a_1) (Eq False True)
% 4.14/4.32  Clause #621 (by clausification #[563]): ∀ (a : Type) (a_1 : set a), Eq (sup_sup (set a) a_1 a_1) a_1
% 4.14/4.32  Clause #622 (by backward demodulation #[621, 0]): Eq (gram_L716654942_subtr ns tr1 tr3) True
% 4.14/4.32  Clause #632 (by superposition #[622, 277]): Eq True False
% 4.14/4.32  Clause #637 (by clausification #[632]): False
% 4.14/4.32  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------