↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM781^2 : TPTP v9.2.0. Released v5.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:57:18 PM UTC 2025

% Result   : Theorem 3.43s 3.67s
% Output   : Proof 3.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : NUM781^2 : TPTP v9.2.0. Released v5.1.0.
% 0.08/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n008.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri Oct  3 08:09:23 EDT 2025
% 0.14/0.35  % CPUTime    : 
% 3.43/3.67  SZS status Theorem for theBenchmark.p
% 3.43/3.67  SZS output start Proof for theBenchmark.p
% 3.43/3.67  Clause #0 (by assumption #[]): Eq (Not (∀ (A B : a), Eq A B → Eq B A)) True
% 3.43/3.67  Clause #1 (by clausification #[0]): Eq (∀ (A B : a), Eq A B → Eq B A) False
% 3.43/3.67  Clause #2 (by clausification #[1]): ∀ (a_1 : a), Eq (Not (∀ (B : a), Eq (skS.0 0 a_1) B → Eq B (skS.0 0 a_1))) True
% 3.43/3.67  Clause #3 (by clausification #[2]): ∀ (a_1 : a), Eq (∀ (B : a), Eq (skS.0 0 a_1) B → Eq B (skS.0 0 a_1)) False
% 3.43/3.67  Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a), Eq (Not (Eq (skS.0 0 a_1) (skS.0 1 a_1 a_2) → Eq (skS.0 1 a_1 a_2) (skS.0 0 a_1))) True
% 3.43/3.67  Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a), Eq (Eq (skS.0 0 a_1) (skS.0 1 a_1 a_2) → Eq (skS.0 1 a_1 a_2) (skS.0 0 a_1)) False
% 3.43/3.67  Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : a), Eq (Eq (skS.0 0 a_1) (skS.0 1 a_1 a_2)) True
% 3.43/3.67  Clause #7 (by clausification #[5]): ∀ (a_1 a_2 : a), Eq (Eq (skS.0 1 a_1 a_2) (skS.0 0 a_1)) False
% 3.43/3.67  Clause #8 (by clausification #[6]): ∀ (a_1 a_2 : a), Eq (skS.0 0 a_1) (skS.0 1 a_1 a_2)
% 3.43/3.67  Clause #9 (by clausification #[7]): ∀ (a_1 a_2 : a), Ne (skS.0 1 a_1 a_2) (skS.0 0 a_1)
% 3.43/3.67  Clause #10 (by forward demodulation #[9, 8]): ∀ (a_1 : a), Ne (skS.0 0 a_1) (skS.0 0 a_1)
% 3.43/3.67  Clause #11 (by eliminate resolved literals #[10]): False
% 3.43/3.67  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------