↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n008.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:46:55 PM UTC 2025

% Result   : Theorem 11.36s 11.52s
% Output   : Proof 11.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : CSR150^2 : TPTP v9.2.0. Released v4.1.0.
% 0.06/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n008.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Thu Oct  2 20:03:23 EDT 2025
% 0.14/0.34  % CPUTime    : 
% 11.36/11.52  SZS status Theorem for theBenchmark.p
% 11.36/11.52  SZS output start Proof for theBenchmark.p
% 11.36/11.52  Clause #2 (by assumption #[]): Eq
% 11.36/11.52    (∀ (NUMBER2 NUMBER1 : Iota),
% 11.36/11.52      Iff (ltet_THFTYPE_IiioI NUMBER1 NUMBER2) (Or (Eq NUMBER1 NUMBER2) (lt_THFTYPE_IiioI NUMBER1 NUMBER2)))
% 11.36/11.52    True
% 11.36/11.52  Clause #252 (by assumption #[]): Eq
% 11.36/11.52    (Not
% 11.36/11.52      (Exists fun Y =>
% 11.36/11.52        ltet_THFTYPE_IiioI (lCardinalityFn_THFTYPE_IIioIiI fun X => grandchild_THFTYPE_IiioI X lJohn_THFTYPE_i) Y))
% 11.36/11.52    True
% 11.36/11.52  Clause #260 (by clausification #[2]): ∀ (a : Iota),
% 11.36/11.52    Eq (∀ (NUMBER1 : Iota), Iff (ltet_THFTYPE_IiioI NUMBER1 a) (Or (Eq NUMBER1 a) (lt_THFTYPE_IiioI NUMBER1 a))) True
% 11.36/11.52  Clause #261 (by clausification #[260]): ∀ (a a_1 : Iota), Eq (Iff (ltet_THFTYPE_IiioI a a_1) (Or (Eq a a_1) (lt_THFTYPE_IiioI a a_1))) True
% 11.36/11.52  Clause #262 (by clausification #[261]): ∀ (a a_1 : Iota), Or (Eq (ltet_THFTYPE_IiioI a a_1) True) (Eq (Or (Eq a a_1) (lt_THFTYPE_IiioI a a_1)) False)
% 11.36/11.52  Clause #265 (by clausification #[262]): ∀ (a a_1 : Iota), Or (Eq (ltet_THFTYPE_IiioI a a_1) True) (Eq (Eq a a_1) False)
% 11.36/11.52  Clause #3680 (by clausification #[265]): ∀ (a a_1 : Iota), Or (Eq (ltet_THFTYPE_IiioI a a_1) True) (Ne a a_1)
% 11.36/11.52  Clause #3681 (by destructive equality resolution #[3680]): ∀ (a : Iota), Eq (ltet_THFTYPE_IiioI a a) True
% 11.36/11.52  Clause #4033 (by betaEtaReduce #[252]): Eq
% 11.36/11.52    (Not
% 11.36/11.52      (Exists (ltet_THFTYPE_IiioI (lCardinalityFn_THFTYPE_IIioIiI fun X => grandchild_THFTYPE_IiioI X lJohn_THFTYPE_i))))
% 11.36/11.52    True
% 11.36/11.52  Clause #4034 (by clausification #[4033]): Eq (Exists (ltet_THFTYPE_IiioI (lCardinalityFn_THFTYPE_IIioIiI fun X => grandchild_THFTYPE_IiioI X lJohn_THFTYPE_i)))
% 11.36/11.52    False
% 11.36/11.52  Clause #4035 (by clausification #[4034]): ∀ (a : Iota),
% 11.36/11.52    Eq (ltet_THFTYPE_IiioI (lCardinalityFn_THFTYPE_IIioIiI fun X => grandchild_THFTYPE_IiioI X lJohn_THFTYPE_i) a) False
% 11.36/11.52  Clause #4036 (by superposition #[4035, 3681]): Eq False True
% 11.36/11.52  Clause #4037 (by clausification #[4036]): False
% 11.36/11.52  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------