↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEU844^5 : TPTP v9.2.0. Released v4.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 08:02:33 PM UTC 2025

% Result   : Theorem 7.28s 7.47s
% Output   : Proof 7.28s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU844^5 : TPTP v9.2.0. Released v4.0.0.
% 0.07/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   : Fri Oct  3 06:03:38 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 7.28/7.47  SZS status Theorem for theBenchmark.p
% 7.28/7.47  SZS output start Proof for theBenchmark.p
% 7.28/7.47  Clause #0 (by assumption #[]): Eq (Not ((∀ (S0 T0 : a → Prop), Eq S0 T0) → And (∀ (Xx : a), cS Xx → cT Xx) (∀ (Xx : a), cT Xx → cS Xx))) True
% 7.28/7.47  Clause #1 (by clausification #[0]): Eq ((∀ (S0 T0 : a → Prop), Eq S0 T0) → And (∀ (Xx : a), cS Xx → cT Xx) (∀ (Xx : a), cT Xx → cS Xx)) False
% 7.28/7.47  Clause #2 (by clausification #[1]): Eq (∀ (S0 T0 : a → Prop), Eq S0 T0) True
% 7.28/7.47  Clause #4 (by clausification #[2]): ∀ (a_1 : a → Prop), Eq (∀ (T0 : a → Prop), Eq a_1 T0) True
% 7.28/7.47  Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop), Eq (Eq a_1 a_2) True
% 7.28/7.47  Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : a → Prop), Eq a_1 a_2
% 7.28/7.47  Clause #7 (by argument congruence #[6]): ∀ (a_1 : a → Prop) (a_2 : a) (a : a → Prop), Eq (a_1 a_2) (a a_2)
% 7.28/7.47  Clause #16 (by fluidSup #[7, 7]): ∀ (a_1 : Prop) (a_2 : a → Prop) (a_3 : a) (a_4 : a → Prop) (a : a), Eq ((fun _ => a_1) (a_2 a_3)) (a_4 a)
% 7.28/7.47  Clause #660 (by betaEtaReduce #[16]): ∀ (a_1 : Prop) (a_2 : a → Prop) (a : a), Eq a_1 (a_2 a)
% 7.28/7.47  Clause #747 (by fluidSup #[660, 660]): ∀ (a a_1 a_2 : Prop), Eq a ((fun _ => a_1) a_2)
% 7.28/7.47  Clause #1067 (by betaEtaReduce #[747]): ∀ (a a_1 : Prop), Eq a a_1
% 7.28/7.47  Clause #1070 (by falseElim #[1067]): False
% 7.28/7.47  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------