↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n016.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 08:07:33 PM UTC 2025

% Result   : Theorem 3.53s 3.69s
% Output   : Proof 3.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN382^5 : TPTP v9.2.0. Released v4.0.0.
% 0.06/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n016.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 15:26:08 EDT 2025
% 0.13/0.35  % CPUTime    : 
% 3.53/3.69  SZS status Theorem for theBenchmark.p
% 3.53/3.69  SZS output start Proof for theBenchmark.p
% 3.53/3.69  Clause #0 (by assumption #[]): Eq
% 3.53/3.69    (Not
% 3.53/3.69      ((∀ (Xz : Iota), Exists fun Xx => Or (∀ (Xy : Iota), cP Xx Xy) (cQ Xx Xz)) →
% 3.53/3.69        ∀ (Xy : Iota), Exists fun Xx => Or (cP Xx Xy) (cQ Xx Xy)))
% 3.53/3.69    True
% 3.53/3.69  Clause #1 (by clausification #[0]): Eq
% 3.53/3.69    ((∀ (Xz : Iota), Exists fun Xx => Or (∀ (Xy : Iota), cP Xx Xy) (cQ Xx Xz)) →
% 3.53/3.69      ∀ (Xy : Iota), Exists fun Xx => Or (cP Xx Xy) (cQ Xx Xy))
% 3.53/3.69    False
% 3.53/3.69  Clause #2 (by clausification #[1]): Eq (∀ (Xz : Iota), Exists fun Xx => Or (∀ (Xy : Iota), cP Xx Xy) (cQ Xx Xz)) True
% 3.53/3.69  Clause #3 (by clausification #[1]): Eq (∀ (Xy : Iota), Exists fun Xx => Or (cP Xx Xy) (cQ Xx Xy)) False
% 3.53/3.69  Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun Xx => Or (∀ (Xy : Iota), cP Xx Xy) (cQ Xx a)) True
% 3.53/3.69  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (Or (∀ (Xy : Iota), cP (skS.0 0 a a_1) Xy) (cQ (skS.0 0 a a_1) a)) True
% 3.53/3.69  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (∀ (Xy : Iota), cP (skS.0 0 a a_1) Xy) True) (Eq (cQ (skS.0 0 a a_1) a) True)
% 3.53/3.69  Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : Iota), Or (Eq (cQ (skS.0 0 a a_1) a) True) (Eq (cP (skS.0 0 a a_1) a_2) True)
% 3.53/3.69  Clause #8 (by clausification #[3]): ∀ (a : Iota), Eq (Not (Exists fun Xx => Or (cP Xx (skS.0 1 a)) (cQ Xx (skS.0 1 a)))) True
% 3.53/3.69  Clause #9 (by clausification #[8]): ∀ (a : Iota), Eq (Exists fun Xx => Or (cP Xx (skS.0 1 a)) (cQ Xx (skS.0 1 a))) False
% 3.53/3.69  Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Eq (Or (cP a (skS.0 1 a_1)) (cQ a (skS.0 1 a_1))) False
% 3.53/3.69  Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (cQ a (skS.0 1 a_1)) False
% 3.53/3.69  Clause #12 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (cP a (skS.0 1 a_1)) False
% 3.53/3.69  Clause #14 (by superposition #[12, 7]): ∀ (a a_1 : Iota), Or (Eq (cQ (skS.0 0 a a_1) a) True) (Eq False True)
% 3.53/3.69  Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Eq (cQ (skS.0 0 a a_1) a) True
% 3.53/3.69  Clause #16 (by superposition #[15, 11]): Eq True False
% 3.53/3.69  Clause #17 (by clausification #[16]): False
% 3.53/3.69  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------