↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n022.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:08:18 PM UTC 2025

% Result   : Theorem 5.59s 5.77s
% Output   : Proof 5.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SYN958+1 : TPTP v9.2.0. Released v3.1.0.
% 0.05/0.11  % Command    : duper %s
% 0.10/0.31  % Computer : n022.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Thu Oct  2 15:46:53 EDT 2025
% 0.10/0.31  % CPUTime    : 
% 5.59/5.77  SZS status Theorem for theBenchmark.p
% 5.59/5.77  SZS output start Proof for theBenchmark.p
% 5.59/5.77  Clause #0 (by assumption #[]): Eq (Not (And (Exists fun X => a X) (∀ (X : Iota), b X) → Exists fun X => And (a X) (b X))) True
% 5.59/5.77  Clause #1 (by betaEtaReduce #[0]): Eq (Not (And (Exists a) (∀ (X : Iota), b X) → Exists fun X => And (a X) (b X))) True
% 5.59/5.77  Clause #2 (by clausification #[1]): Eq (And (Exists a) (∀ (X : Iota), b X) → Exists fun X => And (a X) (b X)) False
% 5.59/5.77  Clause #3 (by clausification #[2]): Eq (And (Exists a) (∀ (X : Iota), b X)) True
% 5.59/5.77  Clause #4 (by clausification #[2]): Eq (Exists fun X => And (a X) (b X)) False
% 5.59/5.77  Clause #5 (by clausification #[3]): Eq (∀ (X : Iota), b X) True
% 5.59/5.77  Clause #6 (by clausification #[3]): Eq (Exists a) True
% 5.59/5.77  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (b a) True
% 5.59/5.77  Clause #8 (by clausification #[6]): ∀ (a_1 : Iota), Eq (a (skS.0 0 a_1)) True
% 5.59/5.77  Clause #9 (by clausification #[4]): ∀ (a_1 : Iota), Eq (And (a a_1) (b a_1)) False
% 5.59/5.77  Clause #10 (by clausification #[9]): ∀ (a_1 : Iota), Or (Eq (a a_1) False) (Eq (b a_1) False)
% 5.59/5.77  Clause #11 (by forward demodulation #[10, 7]): ∀ (a_1 : Iota), Or (Eq (a a_1) False) (Eq True False)
% 5.59/5.77  Clause #12 (by clausification #[11]): ∀ (a_1 : Iota), Eq (a a_1) False
% 5.59/5.77  Clause #13 (by superposition #[12, 8]): Eq False True
% 5.59/5.77  Clause #14 (by clausification #[13]): False
% 5.59/5.77  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------