TSTP Solution File: CSR136^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : CSR136^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n012.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:12:01 EDT 2023
% Result : Theorem 4.12s 4.33s
% Output : Proof 4.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CSR136^2 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.14 % Command : duper %s
% 0.14/0.35 % Computer : n012.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 : Mon Aug 28 11:45:54 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.12/4.33 SZS status Theorem for theBenchmark.p
% 4.12/4.33 SZS output start Proof for theBenchmark.p
% 4.12/4.33 Clause #0 (by assumption #[]): Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lBill_THFTYPE_i) True
% 4.12/4.33 Clause #1 (by assumption #[]): Eq (Not (likes_THFTYPE_IiioI lSue_THFTYPE_i lMary_THFTYPE_i)) True
% 4.12/4.33 Clause #8 (by assumption #[]): Eq
% 4.12/4.33 (Not
% 4.12/4.33 (Exists fun R =>
% 4.12/4.33 And (And (R lSue_THFTYPE_i lBill_THFTYPE_i) (R lMary_THFTYPE_i lBill_THFTYPE_i)) (Not (∀ (A B : Iota), R A B))))
% 4.12/4.33 True
% 4.12/4.33 Clause #9 (by clausification #[1]): Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lMary_THFTYPE_i) False
% 4.12/4.33 Clause #10 (by clausification #[8]): Eq
% 4.12/4.33 (Exists fun R =>
% 4.12/4.33 And (And (R lSue_THFTYPE_i lBill_THFTYPE_i) (R lMary_THFTYPE_i lBill_THFTYPE_i)) (Not (∀ (A B : Iota), R A B)))
% 4.12/4.33 False
% 4.12/4.33 Clause #11 (by clausification #[10]): ∀ (a : Iota → Iota → Prop),
% 4.12/4.33 Eq (And (And (a lSue_THFTYPE_i lBill_THFTYPE_i) (a lMary_THFTYPE_i lBill_THFTYPE_i)) (Not (∀ (A B : Iota), a A B)))
% 4.12/4.33 False
% 4.12/4.33 Clause #12 (by clausification #[11]): ∀ (a : Iota → Iota → Prop),
% 4.12/4.33 Or (Eq (And (a lSue_THFTYPE_i lBill_THFTYPE_i) (a lMary_THFTYPE_i lBill_THFTYPE_i)) False)
% 4.12/4.33 (Eq (Not (∀ (A B : Iota), a A B)) False)
% 4.12/4.33 Clause #13 (by clausification #[12]): ∀ (a : Iota → Iota → Prop),
% 4.12/4.33 Or (Eq (Not (∀ (A B : Iota), a A B)) False)
% 4.12/4.33 (Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False) (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False))
% 4.12/4.33 Clause #14 (by clausification #[13]): ∀ (a : Iota → Iota → Prop),
% 4.12/4.33 Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.12/4.33 (Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False) (Eq (∀ (A B : Iota), a A B) True))
% 4.12/4.33 Clause #15 (by clausification #[14]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota),
% 4.12/4.33 Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.12/4.33 (Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False) (Eq (∀ (B : Iota), a a_1 B) True))
% 4.12/4.33 Clause #16 (by clausification #[15]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.12/4.33 Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.12/4.33 (Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False) (Eq (a a_1 a_2) True))
% 4.12/4.33 Clause #28 (by fluidLoobHoist #[16]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.12/4.33 Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False)
% 4.12/4.33 (Or (Eq (a a_1 a_2) True) (Or (Eq True False) (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)))
% 4.12/4.33 Clause #34 (by clausification #[28]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.12/4.33 Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False)
% 4.12/4.33 (Or (Eq (a a_1 a_2) True) (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False))
% 4.12/4.33 Clause #46 (by fluidLoobHoist #[34]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.12/4.33 Or (Eq (a a_1 a_2) True)
% 4.12/4.33 (Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.12/4.33 (Or (Eq True False) (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False)))
% 4.12/4.33 Clause #50 (by clausification #[46]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.12/4.33 Or (Eq (a a_1 a_2) True)
% 4.12/4.33 (Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False) (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False))
% 4.12/4.33 Clause #64 (by superposition #[50, 0]): ∀ (a a_1 : Iota),
% 4.12/4.33 Or (Eq ((fun x x => likes_THFTYPE_IiioI lSue_THFTYPE_i x) a a_1) True)
% 4.12/4.33 (Or (Eq ((fun x x => likes_THFTYPE_IiioI lSue_THFTYPE_i x) lMary_THFTYPE_i lBill_THFTYPE_i) False) (Eq False True))
% 4.12/4.33 Clause #226 (by betaEtaReduce #[64]): ∀ (a : Iota),
% 4.12/4.33 Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True)
% 4.12/4.33 (Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lBill_THFTYPE_i) False) (Eq False True))
% 4.12/4.33 Clause #227 (by clausification #[226]): ∀ (a : Iota),
% 4.12/4.33 Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True) (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.12/4.33 Clause #228 (by superposition #[227, 0]): ∀ (a : Iota), Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True) (Eq False True)
% 4.12/4.33 Clause #237 (by clausification #[228]): ∀ (a : Iota), Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True
% 4.12/4.33 Clause #238 (by superposition #[237, 9]): Eq True False
% 4.12/4.33 Clause #269 (by clausification #[238]): False
% 4.12/4.33 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------