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

View Problem - Process Solution

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

% Computer : n007.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 : Fri Sep  1 04:22:07 EDT 2023

% Result   : Theorem 3.46s 3.64s
% Output   : Proof 3.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYO307^5 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n007.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 04:05:56 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.46/3.64  SZS status Theorem for theBenchmark.p
% 3.46/3.64  SZS output start Proof for theBenchmark.p
% 3.46/3.64  Clause #0 (by assumption #[]): Eq
% 3.46/3.64    (Not
% 3.46/3.64      (Exists fun A => ∀ (Xx Xy Xz : Iota), Or (A Xx) (And (A Xy) (A Xz)) → Or (And (p Xx) (cR Xy)) (And (q Xx) (cT Xz))))
% 3.46/3.64    True
% 3.46/3.64  Clause #1 (by clausification #[0]): Eq (Exists fun A => ∀ (Xx Xy Xz : Iota), Or (A Xx) (And (A Xy) (A Xz)) → Or (And (p Xx) (cR Xy)) (And (q Xx) (cT Xz)))
% 3.46/3.64    False
% 3.46/3.64  Clause #2 (by clausification #[1]): ∀ (a : Iota → Prop),
% 3.46/3.64    Eq (∀ (Xx Xy Xz : Iota), Or (a Xx) (And (a Xy) (a Xz)) → Or (And (p Xx) (cR Xy)) (And (q Xx) (cT Xz))) False
% 3.46/3.64  Clause #3 (by clausification #[2]): ∀ (a : Iota → Prop) (a_1 : Iota),
% 3.46/3.64    Eq
% 3.46/3.64      (Not
% 3.46/3.64        (∀ (Xy Xz : Iota),
% 3.46/3.64          Or (a (skS.0 0 a a_1)) (And (a Xy) (a Xz)) →
% 3.46/3.64            Or (And (p (skS.0 0 a a_1)) (cR Xy)) (And (q (skS.0 0 a a_1)) (cT Xz))))
% 3.46/3.64      True
% 3.46/3.64  Clause #4 (by clausification #[3]): ∀ (a : Iota → Prop) (a_1 : Iota),
% 3.46/3.64    Eq
% 3.46/3.64      (∀ (Xy Xz : Iota),
% 3.46/3.64        Or (a (skS.0 0 a a_1)) (And (a Xy) (a Xz)) →
% 3.46/3.64          Or (And (p (skS.0 0 a a_1)) (cR Xy)) (And (q (skS.0 0 a a_1)) (cT Xz)))
% 3.46/3.64      False
% 3.46/3.64  Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota),
% 3.46/3.64    Eq
% 3.46/3.64      (Not
% 3.46/3.64        (∀ (Xz : Iota),
% 3.46/3.64          Or (a (skS.0 0 a a_1)) (And (a (skS.0 1 a a_1 a_2)) (a Xz)) →
% 3.46/3.64            Or (And (p (skS.0 0 a a_1)) (cR (skS.0 1 a a_1 a_2))) (And (q (skS.0 0 a a_1)) (cT Xz))))
% 3.46/3.64      True
% 3.46/3.64  Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota),
% 3.46/3.64    Eq
% 3.46/3.64      (∀ (Xz : Iota),
% 3.46/3.64        Or (a (skS.0 0 a a_1)) (And (a (skS.0 1 a a_1 a_2)) (a Xz)) →
% 3.46/3.64          Or (And (p (skS.0 0 a a_1)) (cR (skS.0 1 a a_1 a_2))) (And (q (skS.0 0 a a_1)) (cT Xz)))
% 3.46/3.64      False
% 3.46/3.64  Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 a_2 a_3 : Iota),
% 3.46/3.64    Eq
% 3.46/3.64      (Not
% 3.46/3.64        (Or (a (skS.0 0 a a_1)) (And (a (skS.0 1 a a_1 a_2)) (a (skS.0 2 a a_1 a_2 a_3))) →
% 3.46/3.64          Or (And (p (skS.0 0 a a_1)) (cR (skS.0 1 a a_1 a_2))) (And (q (skS.0 0 a a_1)) (cT (skS.0 2 a a_1 a_2 a_3)))))
% 3.46/3.64      True
% 3.46/3.64  Clause #8 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 a_2 a_3 : Iota),
% 3.46/3.64    Eq
% 3.46/3.64      (Or (a (skS.0 0 a a_1)) (And (a (skS.0 1 a a_1 a_2)) (a (skS.0 2 a a_1 a_2 a_3))) →
% 3.46/3.64        Or (And (p (skS.0 0 a a_1)) (cR (skS.0 1 a a_1 a_2))) (And (q (skS.0 0 a a_1)) (cT (skS.0 2 a a_1 a_2 a_3))))
% 3.46/3.64      False
% 3.46/3.64  Clause #9 (by clausification #[8]): ∀ (a : Iota → Prop) (a_1 a_2 a_3 : Iota),
% 3.46/3.64    Eq (Or (a (skS.0 0 a a_1)) (And (a (skS.0 1 a a_1 a_2)) (a (skS.0 2 a a_1 a_2 a_3)))) True
% 3.46/3.64  Clause #11 (by clausification #[9]): ∀ (a : Iota → Prop) (a_1 a_2 a_3 : Iota),
% 3.46/3.64    Or (Eq (a (skS.0 0 a a_1)) True) (Eq (And (a (skS.0 1 a a_1 a_2)) (a (skS.0 2 a a_1 a_2 a_3))) True)
% 3.46/3.64  Clause #12 (by clausification #[11]): ∀ (a : Iota → Prop) (a_1 a_2 a_3 : Iota), Or (Eq (a (skS.0 0 a a_1)) True) (Eq (a (skS.0 2 a a_1 a_2 a_3)) True)
% 3.46/3.64  Clause #20 (by equality factoring #[12]): ∀ (a : Prop) (a_1 : Iota), Or (Ne True True) (Eq ((fun x => a) (skS.0 0 (fun x => a) a_1)) True)
% 3.46/3.64  Clause #48 (by betaEtaReduce #[20]): ∀ (a : Prop), Or (Ne True True) (Eq a True)
% 3.46/3.64  Clause #49 (by clausification #[48]): ∀ (a : Prop), Or (Eq a True) (Or (Eq True False) (Eq True False))
% 3.46/3.64  Clause #51 (by clausification #[49]): ∀ (a : Prop), Or (Eq a True) (Eq True False)
% 3.46/3.64  Clause #52 (by clausification #[51]): ∀ (a : Prop), Eq a True
% 3.46/3.64  Clause #53 (by falseElim #[52]): False
% 3.46/3.64  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------