↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n026.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:59:48 PM UTC 2025

% Result   : Theorem 3.47s 3.68s
% Output   : Proof 3.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET201^5 : TPTP v9.2.0. Released v4.0.0.
% 0.03/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n026.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   : Thu Oct  2 13:48:08 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.47/3.68  SZS status Theorem for theBenchmark.p
% 3.47/3.68  SZS output start Proof for theBenchmark.p
% 3.47/3.68  Clause #0 (by assumption #[]): Eq
% 3.47/3.68    (Not
% 3.47/3.68      (∀ (X Y Z : a → Prop),
% 3.47/3.68        And (∀ (Xx : a), X Xx → Y Xx) (∀ (Xx : a), Z Xx → cV Xx) → ∀ (Xx : a), And (X Xx) (Z Xx) → And (Y Xx) (cV Xx)))
% 3.47/3.68    True
% 3.47/3.68  Clause #1 (by clausification #[0]): Eq
% 3.47/3.68    (∀ (X Y Z : a → Prop),
% 3.47/3.68      And (∀ (Xx : a), X Xx → Y Xx) (∀ (Xx : a), Z Xx → cV Xx) → ∀ (Xx : a), And (X Xx) (Z Xx) → And (Y Xx) (cV Xx))
% 3.47/3.68    False
% 3.47/3.68  Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop),
% 3.47/3.68    Eq
% 3.47/3.68      (Not
% 3.47/3.68        (∀ (Y Z : a → Prop),
% 3.47/3.68          And (∀ (Xx : a), skS.0 0 a_1 Xx → Y Xx) (∀ (Xx : a), Z Xx → cV Xx) →
% 3.47/3.68            ∀ (Xx : a), And (skS.0 0 a_1 Xx) (Z Xx) → And (Y Xx) (cV Xx)))
% 3.47/3.68      True
% 3.47/3.68  Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop),
% 3.47/3.68    Eq
% 3.47/3.68      (∀ (Y Z : a → Prop),
% 3.47/3.68        And (∀ (Xx : a), skS.0 0 a_1 Xx → Y Xx) (∀ (Xx : a), Z Xx → cV Xx) →
% 3.47/3.68          ∀ (Xx : a), And (skS.0 0 a_1 Xx) (Z Xx) → And (Y Xx) (cV Xx))
% 3.47/3.68      False
% 3.47/3.68  Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop),
% 3.47/3.68    Eq
% 3.47/3.68      (Not
% 3.47/3.68        (∀ (Z : a → Prop),
% 3.47/3.68          And (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) (∀ (Xx : a), Z Xx → cV Xx) →
% 3.47/3.68            ∀ (Xx : a), And (skS.0 0 a_1 Xx) (Z Xx) → And (skS.0 1 a_1 a_2 Xx) (cV Xx)))
% 3.47/3.68      True
% 3.47/3.68  Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop),
% 3.47/3.68    Eq
% 3.47/3.68      (∀ (Z : a → Prop),
% 3.47/3.68        And (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) (∀ (Xx : a), Z Xx → cV Xx) →
% 3.47/3.68          ∀ (Xx : a), And (skS.0 0 a_1 Xx) (Z Xx) → And (skS.0 1 a_1 a_2 Xx) (cV Xx))
% 3.47/3.68      False
% 3.47/3.68  Clause #6 (by clausification #[5]): ∀ (a_1 a_2 a_3 : a → Prop),
% 3.47/3.68    Eq
% 3.47/3.68      (Not
% 3.47/3.68        (And (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → cV Xx) →
% 3.47/3.68          ∀ (Xx : a), And (skS.0 0 a_1 Xx) (skS.0 2 a_1 a_2 a_3 Xx) → And (skS.0 1 a_1 a_2 Xx) (cV Xx)))
% 3.47/3.68      True
% 3.47/3.68  Clause #7 (by clausification #[6]): ∀ (a_1 a_2 a_3 : a → Prop),
% 3.47/3.68    Eq
% 3.47/3.68      (And (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → cV Xx) →
% 3.47/3.68        ∀ (Xx : a), And (skS.0 0 a_1 Xx) (skS.0 2 a_1 a_2 a_3 Xx) → And (skS.0 1 a_1 a_2 Xx) (cV Xx))
% 3.47/3.68      False
% 3.47/3.68  Clause #8 (by clausification #[7]): ∀ (a_1 a_2 a_3 : a → Prop),
% 3.47/3.68    Eq (And (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → cV Xx)) True
% 3.47/3.68  Clause #9 (by clausification #[7]): ∀ (a_1 a_2 a_3 : a → Prop),
% 3.47/3.68    Eq (∀ (Xx : a), And (skS.0 0 a_1 Xx) (skS.0 2 a_1 a_2 a_3 Xx) → And (skS.0 1 a_1 a_2 Xx) (cV Xx)) False
% 3.47/3.68  Clause #10 (by clausification #[8]): ∀ (a_1 a_2 a_3 : a → Prop), Eq (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → cV Xx) True
% 3.47/3.68  Clause #11 (by clausification #[8]): ∀ (a_1 a_2 : a → Prop), Eq (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) True
% 3.47/3.68  Clause #12 (by clausification #[10]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 2 a_1 a_2 a_3 a_4 → cV a_4) True
% 3.47/3.68  Clause #13 (by clausification #[12]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Or (Eq (skS.0 2 a_1 a_2 a_3 a_4) False) (Eq (cV a_4) True)
% 3.47/3.68  Clause #14 (by clausification #[11]): ∀ (a_1 : a → Prop) (a_2 : a) (a_3 : a → Prop), Eq (skS.0 0 a_1 a_2 → skS.0 1 a_1 a_3 a_2) True
% 3.47/3.68  Clause #15 (by clausification #[14]): ∀ (a_1 : a → Prop) (a_2 : a) (a_3 : a → Prop), Or (Eq (skS.0 0 a_1 a_2) False) (Eq (skS.0 1 a_1 a_3 a_2) True)
% 3.47/3.68  Clause #16 (by clausification #[9]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.47/3.68    Eq
% 3.47/3.68      (Not
% 3.47/3.68        (And (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)) →
% 3.47/3.68          And (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) (cV (skS.0 3 a_1 a_2 a_3 a_4))))
% 3.47/3.68      True
% 3.47/3.68  Clause #17 (by clausification #[16]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.47/3.68    Eq
% 3.47/3.68      (And (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)) →
% 3.47/3.68        And (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) (cV (skS.0 3 a_1 a_2 a_3 a_4)))
% 3.47/3.68      False
% 3.47/3.68  Clause #18 (by clausification #[17]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.47/3.68    Eq (And (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4))) True
% 3.47/3.69  Clause #19 (by clausification #[17]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.47/3.69    Eq (And (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) (cV (skS.0 3 a_1 a_2 a_3 a_4))) False
% 3.47/3.69  Clause #20 (by clausification #[18]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)) True
% 3.47/3.69  Clause #21 (by clausification #[18]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) True
% 3.47/3.69  Clause #22 (by superposition #[20, 13]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Or (Eq True False) (Eq (cV (skS.0 3 a_1 a_2 a_3 a_4)) True)
% 3.47/3.69  Clause #23 (by clausification #[22]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (cV (skS.0 3 a_1 a_2 a_3 a_4)) True
% 3.47/3.69  Clause #24 (by superposition #[21, 15]): ∀ (a_1 a_2 a_3 a_4 : a → Prop) (a_5 : a), Or (Eq True False) (Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_3 a_4 a_5)) True)
% 3.47/3.69  Clause #25 (by clausification #[19]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.47/3.69    Or (Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) False) (Eq (cV (skS.0 3 a_1 a_2 a_3 a_4)) False)
% 3.47/3.69  Clause #26 (by forward demodulation #[25, 23]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Or (Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) False) (Eq True False)
% 3.47/3.69  Clause #27 (by clausification #[26]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) False
% 3.47/3.69  Clause #28 (by clausification #[24]): ∀ (a_1 a_2 a_3 a_4 : a → Prop) (a_5 : a), Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_3 a_4 a_5)) True
% 3.47/3.69  Clause #29 (by superposition #[28, 27]): Eq True False
% 3.47/3.69  Clause #30 (by clausification #[29]): False
% 3.47/3.69  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------