TSTP Solution File: SET630^5 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SET630^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n001.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 14:47:10 EDT 2023

% Result   : Theorem 3.40s 3.78s
% Output   : Proof 3.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET630^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n001.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 13:30:30 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 3.40/3.78  SZS status Theorem for theBenchmark.p
% 3.40/3.78  SZS output start Proof for theBenchmark.p
% 3.40/3.78  Clause #0 (by assumption #[]): Eq
% 3.40/3.78    (Not
% 3.40/3.78      (∀ (X Y : a → Prop),
% 3.40/3.78        Not (Exists fun Xx => And (And (X Xx) (Y Xx)) (Or (And (X Xx) (Not (Y Xx))) (And (Y Xx) (Not (X Xx)))))))
% 3.40/3.78    True
% 3.40/3.78  Clause #1 (by clausification #[0]): Eq
% 3.40/3.78    (∀ (X Y : a → Prop),
% 3.40/3.78      Not (Exists fun Xx => And (And (X Xx) (Y Xx)) (Or (And (X Xx) (Not (Y Xx))) (And (Y Xx) (Not (X Xx))))))
% 3.40/3.78    False
% 3.40/3.78  Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop),
% 3.40/3.78    Eq
% 3.40/3.78      (Not
% 3.40/3.78        (∀ (Y : a → Prop),
% 3.40/3.78          Not
% 3.40/3.78            (Exists fun Xx =>
% 3.40/3.78              And (And (skS.0 0 a_1 Xx) (Y Xx))
% 3.40/3.78                (Or (And (skS.0 0 a_1 Xx) (Not (Y Xx))) (And (Y Xx) (Not (skS.0 0 a_1 Xx)))))))
% 3.40/3.78      True
% 3.40/3.78  Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop),
% 3.40/3.78    Eq
% 3.40/3.78      (∀ (Y : a → Prop),
% 3.40/3.78        Not
% 3.40/3.78          (Exists fun Xx =>
% 3.40/3.78            And (And (skS.0 0 a_1 Xx) (Y Xx))
% 3.40/3.78              (Or (And (skS.0 0 a_1 Xx) (Not (Y Xx))) (And (Y Xx) (Not (skS.0 0 a_1 Xx))))))
% 3.40/3.78      False
% 3.40/3.78  Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop),
% 3.40/3.78    Eq
% 3.40/3.78      (Not
% 3.40/3.78        (Not
% 3.40/3.78          (Exists fun Xx =>
% 3.40/3.78            And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))
% 3.40/3.78              (Or (And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx))) (And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 0 a_1 Xx)))))))
% 3.40/3.78      True
% 3.40/3.78  Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop),
% 3.40/3.78    Eq
% 3.40/3.78      (Not
% 3.40/3.78        (Exists fun Xx =>
% 3.40/3.78          And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))
% 3.40/3.78            (Or (And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx))) (And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 0 a_1 Xx))))))
% 3.40/3.78      False
% 3.40/3.78  Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : a → Prop),
% 3.40/3.78    Eq
% 3.40/3.78      (Exists fun Xx =>
% 3.40/3.78        And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))
% 3.40/3.78          (Or (And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx))) (And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 0 a_1 Xx)))))
% 3.40/3.78      True
% 3.40/3.78  Clause #7 (by clausification #[6]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.40/3.78    Eq
% 3.40/3.78      (And (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))
% 3.40/3.78        (Or (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))))
% 3.40/3.78          (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))))))
% 3.40/3.78      True
% 3.40/3.78  Clause #8 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.40/3.78    Eq
% 3.40/3.78      (Or (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))))
% 3.40/3.78        (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)))))
% 3.40/3.78      True
% 3.40/3.78  Clause #9 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.40/3.78    Eq (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True
% 3.40/3.78  Clause #10 (by clausification #[8]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.40/3.78    Or (Eq (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))) True)
% 3.40/3.78      (Eq (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)))) True)
% 3.40/3.78  Clause #11 (by clausification #[10]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.40/3.78    Or (Eq (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)))) True)
% 3.40/3.78      (Eq (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True)
% 3.40/3.78  Clause #13 (by clausification #[11]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.40/3.78    Or (Eq (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True) (Eq (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))) True)
% 3.40/3.78  Clause #15 (by clausification #[13]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.40/3.78    Or (Eq (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))) True) (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) False)
% 3.40/3.78  Clause #16 (by clausification #[15]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.40/3.78    Or (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) False) (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False)
% 3.40/3.78  Clause #17 (by clausification #[9]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) True
% 3.40/3.78  Clause #18 (by clausification #[9]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) True
% 3.40/3.78  Clause #19 (by superposition #[17, 16]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Or (Eq True False) (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False)
% 3.40/3.78  Clause #21 (by clausification #[19]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False
% 3.40/3.78  Clause #22 (by superposition #[21, 18]): Eq False True
% 3.40/3.78  Clause #23 (by clausification #[22]): False
% 3.40/3.78  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------