↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : CSR136^2 : TPTP v9.2.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n020.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 Oct  3 07:46:52 PM UTC 2025

% Result   : Theorem 4.10s 4.32s
% Output   : Proof 4.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : CSR136^2 : TPTP v9.2.0. Released v4.1.0.
% 0.10/0.13  % Command    : duper %s
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Thu Oct  2 20:30:08 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 4.10/4.32  SZS status Theorem for theBenchmark.p
% 4.10/4.32  SZS output start Proof for theBenchmark.p
% 4.10/4.32  Clause #0 (by assumption #[]): Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lBill_THFTYPE_i) True
% 4.10/4.32  Clause #1 (by assumption #[]): Eq (Not (likes_THFTYPE_IiioI lSue_THFTYPE_i lMary_THFTYPE_i)) True
% 4.10/4.32  Clause #8 (by assumption #[]): Eq
% 4.10/4.32    (Not
% 4.10/4.32      (Exists fun R =>
% 4.10/4.32        And (And (R lSue_THFTYPE_i lBill_THFTYPE_i) (R lMary_THFTYPE_i lBill_THFTYPE_i)) (Not (∀ (A B : Iota), R A B))))
% 4.10/4.32    True
% 4.10/4.32  Clause #9 (by clausification #[1]): Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lMary_THFTYPE_i) False
% 4.10/4.32  Clause #10 (by clausification #[8]): Eq
% 4.10/4.32    (Exists fun R =>
% 4.10/4.32      And (And (R lSue_THFTYPE_i lBill_THFTYPE_i) (R lMary_THFTYPE_i lBill_THFTYPE_i)) (Not (∀ (A B : Iota), R A B)))
% 4.10/4.32    False
% 4.10/4.32  Clause #11 (by clausification #[10]): ∀ (a : Iota → Iota → Prop),
% 4.10/4.32    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.10/4.32      False
% 4.10/4.32  Clause #12 (by clausification #[11]): ∀ (a : Iota → Iota → Prop),
% 4.10/4.32    Or (Eq (And (a lSue_THFTYPE_i lBill_THFTYPE_i) (a lMary_THFTYPE_i lBill_THFTYPE_i)) False)
% 4.10/4.32      (Eq (Not (∀ (A B : Iota), a A B)) False)
% 4.10/4.32  Clause #13 (by clausification #[12]): ∀ (a : Iota → Iota → Prop),
% 4.10/4.32    Or (Eq (Not (∀ (A B : Iota), a A B)) False)
% 4.10/4.32      (Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False) (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False))
% 4.10/4.32  Clause #14 (by clausification #[13]): ∀ (a : Iota → Iota → Prop),
% 4.10/4.32    Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.10/4.32      (Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False) (Eq (∀ (A B : Iota), a A B) True))
% 4.10/4.32  Clause #15 (by clausification #[14]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota),
% 4.10/4.32    Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.10/4.32      (Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False) (Eq (∀ (B : Iota), a a_1 B) True))
% 4.10/4.32  Clause #16 (by clausification #[15]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.10/4.32    Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.10/4.32      (Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False) (Eq (a a_1 a_2) True))
% 4.10/4.32  Clause #28 (by fluidLoobHoist #[16]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.10/4.32    Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False)
% 4.10/4.32      (Or (Eq (a a_1 a_2) True) (Or (Eq True False) (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)))
% 4.10/4.32  Clause #34 (by clausification #[28]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.10/4.32    Or (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False)
% 4.10/4.32      (Or (Eq (a a_1 a_2) True) (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False))
% 4.10/4.32  Clause #46 (by fluidLoobHoist #[34]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.10/4.32    Or (Eq (a a_1 a_2) True)
% 4.10/4.32      (Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.10/4.32        (Or (Eq True False) (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False)))
% 4.10/4.32  Clause #50 (by clausification #[46]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota),
% 4.10/4.32    Or (Eq (a a_1 a_2) True)
% 4.10/4.32      (Or (Eq (a lSue_THFTYPE_i lBill_THFTYPE_i) False) (Eq (a lMary_THFTYPE_i lBill_THFTYPE_i) False))
% 4.10/4.32  Clause #64 (by superposition #[50, 0]): ∀ (a a_1 : Iota),
% 4.10/4.32    Or (Eq ((fun x x => likes_THFTYPE_IiioI lSue_THFTYPE_i x) a a_1) True)
% 4.10/4.32      (Or (Eq ((fun x x => likes_THFTYPE_IiioI lSue_THFTYPE_i x) lMary_THFTYPE_i lBill_THFTYPE_i) False) (Eq False True))
% 4.10/4.32  Clause #226 (by betaEtaReduce #[64]): ∀ (a : Iota),
% 4.10/4.32    Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True)
% 4.10/4.32      (Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lBill_THFTYPE_i) False) (Eq False True))
% 4.10/4.32  Clause #227 (by clausification #[226]): ∀ (a : Iota),
% 4.10/4.32    Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True) (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lBill_THFTYPE_i) False)
% 4.10/4.32  Clause #228 (by superposition #[227, 0]): ∀ (a : Iota), Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True) (Eq False True)
% 4.10/4.32  Clause #237 (by clausification #[228]): ∀ (a : Iota), Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True
% 4.10/4.32  Clause #238 (by superposition #[237, 9]): Eq True False
% 4.10/4.32  Clause #269 (by clausification #[238]): False
% 4.10/4.32  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------