TSTP Solution File: SET599^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SET599^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n015.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:46:59 EDT 2023
% Result : Theorem 3.63s 3.82s
% Output : Proof 3.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET599^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : duper %s
% 0.14/0.35 % Computer : n015.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 : Sat Aug 26 16:01:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.63/3.82 SZS status Theorem for theBenchmark.p
% 3.63/3.82 SZS output start Proof for theBenchmark.p
% 3.63/3.82 Clause #0 (by assumption #[]): Eq (Not (∀ (X Y : a → Prop) (Xx : a), And (X Xx) (Not (Y Xx)) → Or (And (X Xx) (Not (Y Xx))) (And (Y Xx) (Not (X Xx)))))
% 3.63/3.82 True
% 3.63/3.82 Clause #1 (by clausification #[0]): Eq (∀ (X Y : a → Prop) (Xx : a), And (X Xx) (Not (Y Xx)) → Or (And (X Xx) (Not (Y Xx))) (And (Y Xx) (Not (X Xx)))) False
% 3.63/3.82 Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop),
% 3.63/3.82 Eq
% 3.63/3.82 (Not
% 3.63/3.82 (∀ (Y : a → Prop) (Xx : a),
% 3.63/3.82 And (skS.0 0 a_1 Xx) (Not (Y Xx)) → Or (And (skS.0 0 a_1 Xx) (Not (Y Xx))) (And (Y Xx) (Not (skS.0 0 a_1 Xx)))))
% 3.63/3.82 True
% 3.63/3.82 Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop),
% 3.63/3.82 Eq
% 3.63/3.82 (∀ (Y : a → Prop) (Xx : a),
% 3.63/3.82 And (skS.0 0 a_1 Xx) (Not (Y Xx)) → Or (And (skS.0 0 a_1 Xx) (Not (Y Xx))) (And (Y Xx) (Not (skS.0 0 a_1 Xx))))
% 3.63/3.82 False
% 3.63/3.82 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop),
% 3.63/3.82 Eq
% 3.63/3.82 (Not
% 3.63/3.82 (∀ (Xx : a),
% 3.63/3.82 And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx)) →
% 3.63/3.82 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.63/3.82 True
% 3.63/3.82 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop),
% 3.63/3.82 Eq
% 3.63/3.82 (∀ (Xx : a),
% 3.63/3.82 And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx)) →
% 3.63/3.82 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.63/3.82 False
% 3.63/3.82 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.63/3.82 Eq
% 3.63/3.82 (Not
% 3.63/3.82 (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.63/3.82 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.63/3.82 (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.63/3.82 True
% 3.63/3.82 Clause #7 (by clausification #[6]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.63/3.82 Eq
% 3.63/3.82 (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.63/3.82 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.63/3.82 (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.63/3.82 False
% 3.63/3.82 Clause #8 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.63/3.82 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.63/3.82 Clause #9 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.63/3.82 Eq
% 3.63/3.82 (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.63/3.82 (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.63/3.82 False
% 3.63/3.82 Clause #10 (by clausification #[8]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True
% 3.63/3.82 Clause #11 (by clausification #[8]): ∀ (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.63/3.82 Clause #12 (by clausification #[10]): ∀ (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)) False
% 3.63/3.82 Clause #14 (by clausification #[9]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.63/3.82 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)))) False
% 3.63/3.82 Clause #18 (by clausification #[14]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.63/3.82 Or (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False) (Eq (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) False)
% 3.63/3.82 Clause #19 (by clausification #[18]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.63/3.82 Or (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False) (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) True)
% 3.63/3.82 Clause #20 (by forward demodulation #[19, 11]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Or (Eq True False) (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) True)
% 3.63/3.82 Clause #21 (by clausification #[20]): ∀ (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.63/3.82 Clause #22 (by superposition #[21, 12]): Eq True False
% 3.63/3.82 Clause #23 (by clausification #[22]): False
% 3.63/3.82 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------