TSTP Solution File: NUN069+2 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUN069+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n019.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 : Thu Aug 31 12:47:19 EDT 2023

% Result   : Theorem 3.57s 3.82s
% Output   : Proof 3.57s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUN069+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.14  % Command    : duper %s
% 0.13/0.35  % Computer : n019.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   : Sun Aug 27 09:18:13 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.57/3.82  SZS status Theorem for theBenchmark.p
% 3.57/3.82  SZS output start Proof for theBenchmark.p
% 3.57/3.82  Clause #0 (by assumption #[]): Eq (Exists fun Y24 => ∀ (X19 : Iota), Or (And (Not (r1 X19)) (Ne X19 Y24)) (And (r1 X19) (Eq X19 Y24))) True
% 3.57/3.82  Clause #1 (by assumption #[]): Eq
% 3.57/3.82    (∀ (X11 : Iota),
% 3.57/3.82      Exists fun Y21 => ∀ (X12 : Iota), Or (And (Not (r2 X11 X12)) (Ne X12 Y21)) (And (r2 X11 X12) (Eq X12 Y21)))
% 3.57/3.82    True
% 3.57/3.82  Clause #11 (by assumption #[]): Eq (Not (Exists fun Y1 => And (Eq Y1 Y1) (Exists fun Y2 => And (r1 Y2) (r2 Y2 Y1)))) True
% 3.57/3.82  Clause #21 (by clausification #[11]): Eq (Exists fun Y1 => And (Eq Y1 Y1) (Exists fun Y2 => And (r1 Y2) (r2 Y2 Y1))) False
% 3.57/3.82  Clause #22 (by clausification #[21]): ∀ (a : Iota), Eq (And (Eq a a) (Exists fun Y2 => And (r1 Y2) (r2 Y2 a))) False
% 3.57/3.82  Clause #23 (by clausification #[22]): ∀ (a : Iota), Or (Eq (Eq a a) False) (Eq (Exists fun Y2 => And (r1 Y2) (r2 Y2 a)) False)
% 3.57/3.82  Clause #24 (by clausification #[23]): ∀ (a : Iota), Or (Eq (Exists fun Y2 => And (r1 Y2) (r2 Y2 a)) False) (Ne a a)
% 3.57/3.82  Clause #25 (by clausification #[24]): ∀ (a a_1 : Iota), Or (Ne a a) (Eq (And (r1 a_1) (r2 a_1 a)) False)
% 3.57/3.82  Clause #26 (by clausification #[25]): ∀ (a a_1 : Iota), Or (Ne a a) (Or (Eq (r1 a_1) False) (Eq (r2 a_1 a) False))
% 3.57/3.82  Clause #27 (by eliminate resolved literals #[26]): ∀ (a a_1 : Iota), Or (Eq (r1 a) False) (Eq (r2 a a_1) False)
% 3.57/3.82  Clause #38 (by clausification #[0]): ∀ (a : Iota), Eq (∀ (X19 : Iota), Or (And (Not (r1 X19)) (Ne X19 (skS.0 2 a))) (And (r1 X19) (Eq X19 (skS.0 2 a)))) True
% 3.57/3.82  Clause #39 (by clausification #[38]): ∀ (a a_1 : Iota), Eq (Or (And (Not (r1 a)) (Ne a (skS.0 2 a_1))) (And (r1 a) (Eq a (skS.0 2 a_1)))) True
% 3.57/3.82  Clause #40 (by clausification #[39]): ∀ (a a_1 : Iota), Or (Eq (And (Not (r1 a)) (Ne a (skS.0 2 a_1))) True) (Eq (And (r1 a) (Eq a (skS.0 2 a_1))) True)
% 3.57/3.82  Clause #41 (by clausification #[40]): ∀ (a a_1 : Iota), Or (Eq (And (r1 a) (Eq a (skS.0 2 a_1))) True) (Eq (Ne a (skS.0 2 a_1)) True)
% 3.57/3.82  Clause #44 (by clausification #[41]): ∀ (a a_1 : Iota), Or (Eq (Ne a (skS.0 2 a_1)) True) (Eq (r1 a) True)
% 3.57/3.82  Clause #47 (by clausification #[44]): ∀ (a a_1 : Iota), Or (Eq (r1 a) True) (Ne a (skS.0 2 a_1))
% 3.57/3.82  Clause #48 (by destructive equality resolution #[47]): ∀ (a : Iota), Eq (r1 (skS.0 2 a)) True
% 3.57/3.82  Clause #49 (by superposition #[48, 27]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (r2 (skS.0 2 a) a_1) False)
% 3.57/3.82  Clause #50 (by clausification #[49]): ∀ (a a_1 : Iota), Eq (r2 (skS.0 2 a) a_1) False
% 3.57/3.82  Clause #59 (by clausification #[1]): ∀ (a : Iota),
% 3.57/3.82    Eq (Exists fun Y21 => ∀ (X12 : Iota), Or (And (Not (r2 a X12)) (Ne X12 Y21)) (And (r2 a X12) (Eq X12 Y21))) True
% 3.57/3.82  Clause #60 (by clausification #[59]): ∀ (a a_1 : Iota),
% 3.57/3.82    Eq (∀ (X12 : Iota), Or (And (Not (r2 a X12)) (Ne X12 (skS.0 3 a a_1))) (And (r2 a X12) (Eq X12 (skS.0 3 a a_1)))) True
% 3.57/3.82  Clause #61 (by clausification #[60]): ∀ (a a_1 a_2 : Iota),
% 3.57/3.82    Eq (Or (And (Not (r2 a a_1)) (Ne a_1 (skS.0 3 a a_2))) (And (r2 a a_1) (Eq a_1 (skS.0 3 a a_2)))) True
% 3.57/3.82  Clause #62 (by clausification #[61]): ∀ (a a_1 a_2 : Iota),
% 3.57/3.82    Or (Eq (And (Not (r2 a a_1)) (Ne a_1 (skS.0 3 a a_2))) True) (Eq (And (r2 a a_1) (Eq a_1 (skS.0 3 a a_2))) True)
% 3.57/3.82  Clause #63 (by clausification #[62]): ∀ (a a_1 a_2 : Iota), Or (Eq (And (r2 a a_1) (Eq a_1 (skS.0 3 a a_2))) True) (Eq (Ne a_1 (skS.0 3 a a_2)) True)
% 3.57/3.82  Clause #66 (by clausification #[63]): ∀ (a a_1 a_2 : Iota), Or (Eq (Ne a (skS.0 3 a_1 a_2)) True) (Eq (r2 a_1 a) True)
% 3.57/3.82  Clause #70 (by clausification #[66]): ∀ (a a_1 a_2 : Iota), Or (Eq (r2 a a_1) True) (Ne a_1 (skS.0 3 a a_2))
% 3.57/3.82  Clause #71 (by destructive equality resolution #[70]): ∀ (a a_1 : Iota), Eq (r2 a (skS.0 3 a a_1)) True
% 3.57/3.82  Clause #72 (by superposition #[71, 50]): Eq True False
% 3.57/3.82  Clause #74 (by clausification #[72]): False
% 3.57/3.82  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------