%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : COM043_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n018.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 : Wed Aug 30 18:38:13 EDT 2023

% Result   : Theorem 4.30s 4.50s
% Output   : Proof 4.30s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : COM043_5 : TPTP v8.1.2. Released v6.0.0.
% 0.00/0.14  % Command    : duper %s
% 0.13/0.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 29 13:34:33 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 4.30/4.50  SZS status Theorem for theBenchmark.p
% 4.30/4.50  SZS output start Proof for theBenchmark.p
% 4.30/4.50  Clause #0 (by assumption #[]): Eq (Eq a (nDvd d l ks)) True
% 4.30/4.50  Clause #1 (by assumption #[]): Eq (Eq (div_mod int i (divisor a)) (div_mod int j (divisor a))) True
% 4.30/4.50  Clause #63 (by assumption #[]): Eq (∀ (Ks1 : list int) (I D : int), Eq (divisor (nDvd D I Ks1)) D) True
% 4.30/4.50  Clause #134 (by assumption #[]): Eq (Not (Eq (div_mod int i d) (div_mod int j d))) True
% 4.30/4.50  Clause #135 (by clausification #[0]): Eq a (nDvd d l ks)
% 4.30/4.50  Clause #136 (by clausification #[1]): Eq (div_mod int i (divisor a)) (div_mod int j (divisor a))
% 4.30/4.50  Clause #286 (by clausification #[134]): Eq (Eq (div_mod int i d) (div_mod int j d)) False
% 4.30/4.50  Clause #287 (by clausification #[286]): Ne (div_mod int i d) (div_mod int j d)
% 4.30/4.50  Clause #491 (by clausification #[63]): ∀ (a : list int), Eq (∀ (I D : int), Eq (divisor (nDvd D I a)) D) True
% 4.30/4.50  Clause #492 (by clausification #[491]): ∀ (a : int) (a_1 : list int), Eq (∀ (D : int), Eq (divisor (nDvd D a a_1)) D) True
% 4.30/4.50  Clause #493 (by clausification #[492]): ∀ (a a_1 : int) (a_2 : list int), Eq (Eq (divisor (nDvd a a_1 a_2)) a) True
% 4.30/4.50  Clause #494 (by clausification #[493]): ∀ (a a_1 : int) (a_2 : list int), Eq (divisor (nDvd a a_1 a_2)) a
% 4.30/4.50  Clause #495 (by superposition #[494, 135]): Eq (divisor a) d
% 4.30/4.50  Clause #496 (by backward demodulation #[495, 136]): Eq (div_mod int i d) (div_mod int j (divisor a))
% 4.30/4.50  Clause #510 (by forward demodulation #[496, 495]): Eq (div_mod int i d) (div_mod int j d)
% 4.30/4.50  Clause #511 (by forward contextual literal cutting #[510, 287]): False
% 4.30/4.50  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------