↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYN379+1 : TPTP v9.2.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n015.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:32 PM UTC 2025

% Result   : Theorem 3.60s 3.77s
% Output   : Proof 3.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN379+1 : TPTP v9.2.0. Released v2.0.0.
% 0.06/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n015.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:07:08 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.60/3.77  SZS status Theorem for theBenchmark.p
% 3.60/3.77  SZS output start Proof for theBenchmark.p
% 3.60/3.77  Clause #0 (by assumption #[]): Eq
% 3.60/3.77    (Not
% 3.60/3.77      ((∀ (X : Iota), big_p X) →
% 3.60/3.77        Exists fun Y => (∀ (X Z : Iota), big_q X Y Z) → Not (∀ (Z : Iota), And (big_p Z) (Not (big_q Y Y Z)))))
% 3.60/3.77    True
% 3.60/3.77  Clause #1 (by clausification #[0]): Eq
% 3.60/3.77    ((∀ (X : Iota), big_p X) →
% 3.60/3.77      Exists fun Y => (∀ (X Z : Iota), big_q X Y Z) → Not (∀ (Z : Iota), And (big_p Z) (Not (big_q Y Y Z))))
% 3.60/3.77    False
% 3.60/3.77  Clause #3 (by clausification #[1]): Eq (Exists fun Y => (∀ (X Z : Iota), big_q X Y Z) → Not (∀ (Z : Iota), And (big_p Z) (Not (big_q Y Y Z)))) False
% 3.60/3.77  Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq ((∀ (X Z : Iota), big_q X a Z) → Not (∀ (Z : Iota), And (big_p Z) (Not (big_q a a Z)))) False
% 3.60/3.77  Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (∀ (X Z : Iota), big_q X a Z) True
% 3.60/3.77  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (Not (∀ (Z : Iota), And (big_p Z) (Not (big_q a a Z)))) False
% 3.60/3.77  Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (∀ (Z : Iota), big_q a a_1 Z) True
% 3.60/3.77  Clause #9 (by clausification #[8]): ∀ (a a_1 a_2 : Iota), Eq (big_q a a_1 a_2) True
% 3.60/3.77  Clause #10 (by clausification #[7]): ∀ (a : Iota), Eq (∀ (Z : Iota), And (big_p Z) (Not (big_q a a Z))) True
% 3.60/3.77  Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (And (big_p a) (Not (big_q a_1 a_1 a))) True
% 3.60/3.77  Clause #12 (by clausification #[11]): ∀ (a a_1 : Iota), Eq (Not (big_q a a a_1)) True
% 3.60/3.77  Clause #13 (by clausification #[12]): ∀ (a a_1 : Iota), Eq (big_q a a a_1) False
% 3.60/3.77  Clause #14 (by superposition #[13, 9]): Eq False True
% 3.60/3.77  Clause #15 (by clausification #[14]): False
% 3.60/3.77  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------