%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : CSR032+1 : TPTP v8.1.2. Released v3.4.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 : Wed Aug 30 21:10:21 EDT 2023

% Result   : Theorem 3.69s 3.89s
% Output   : Proof 3.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% 0.11/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   : Mon Aug 28 11:08:44 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 3.69/3.89  SZS status Theorem for theBenchmark.p
% 3.69/3.89  SZS output start Proof for theBenchmark.p
% 3.69/3.89  Clause #0 (by assumption #[]): Eq (individual (f_citynamedfn s_agen c_france)) True
% 3.69/3.89  Clause #9 (by assumption #[]): Eq (∀ (OBJ : Iota), individual OBJ → trajector_underspecified OBJ) True
% 3.69/3.89  Clause #39 (by assumption #[]): Eq (∀ (X : Iota), trajector_underspecified X → isa X c_trajector_underspecified) True
% 3.69/3.89  Clause #55 (by assumption #[]): Eq (Not (Exists fun COL => mtvisible c_reasoningaboutpossibleantecedentsmt → isa (f_citynamedfn s_agen c_france) COL))
% 3.69/3.89    True
% 3.69/3.89  Clause #60 (by clausification #[9]): ∀ (a : Iota), Eq (individual a → trajector_underspecified a) True
% 3.69/3.89  Clause #61 (by clausification #[60]): ∀ (a : Iota), Or (Eq (individual a) False) (Eq (trajector_underspecified a) True)
% 3.69/3.89  Clause #62 (by superposition #[61, 0]): Or (Eq (trajector_underspecified (f_citynamedfn s_agen c_france)) True) (Eq False True)
% 3.69/3.89  Clause #95 (by clausification #[39]): ∀ (a : Iota), Eq (trajector_underspecified a → isa a c_trajector_underspecified) True
% 3.69/3.89  Clause #96 (by clausification #[95]): ∀ (a : Iota), Or (Eq (trajector_underspecified a) False) (Eq (isa a c_trajector_underspecified) True)
% 3.69/3.89  Clause #238 (by clausification #[62]): Eq (trajector_underspecified (f_citynamedfn s_agen c_france)) True
% 3.69/3.89  Clause #240 (by superposition #[238, 96]): Or (Eq True False) (Eq (isa (f_citynamedfn s_agen c_france) c_trajector_underspecified) True)
% 3.69/3.89  Clause #259 (by clausification #[240]): Eq (isa (f_citynamedfn s_agen c_france) c_trajector_underspecified) True
% 3.69/3.89  Clause #294 (by clausification #[55]): Eq (Exists fun COL => mtvisible c_reasoningaboutpossibleantecedentsmt → isa (f_citynamedfn s_agen c_france) COL) False
% 3.69/3.89  Clause #295 (by clausification #[294]): ∀ (a : Iota), Eq (mtvisible c_reasoningaboutpossibleantecedentsmt → isa (f_citynamedfn s_agen c_france) a) False
% 3.69/3.89  Clause #297 (by clausification #[295]): ∀ (a : Iota), Eq (isa (f_citynamedfn s_agen c_france) a) False
% 3.69/3.89  Clause #299 (by superposition #[297, 259]): Eq False True
% 3.69/3.89  Clause #300 (by clausification #[299]): False
% 3.69/3.89  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------