↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n028.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:50 PM UTC 2025

% Result   : Theorem 4.69s 4.89s
% Output   : Proof 4.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SYO281^5 : TPTP v9.2.0. Released v4.0.0.
% 0.00/0.11  % Command    : duper %s
% 0.09/0.31  % Computer : n028.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit   : 300
% 0.09/0.31  % WCLimit    : 300
% 0.09/0.31  % DateTime   : Fri Oct  3 13:13:08 EDT 2025
% 0.15/0.31  % CPUTime    : 
% 4.69/4.89  SZS status Theorem for theBenchmark.p
% 4.69/4.89  SZS output start Proof for theBenchmark.p
% 4.69/4.89  Clause #0 (by assumption #[]): Eq (Not (∀ (Xp : Iota → Prop), Exists fun Xq => ∀ (Xx : Iota), Xp Xx → Xq Xx)) True
% 4.69/4.89  Clause #1 (by clausification #[0]): Eq (∀ (Xp : Iota → Prop), Exists fun Xq => ∀ (Xx : Iota), Xp Xx → Xq Xx) False
% 4.69/4.89  Clause #2 (by clausification #[1]): ∀ (a : Iota → Prop), Eq (Not (Exists fun Xq => ∀ (Xx : Iota), skS.0 0 a Xx → Xq Xx)) True
% 4.69/4.89  Clause #3 (by clausification #[2]): ∀ (a : Iota → Prop), Eq (Exists fun Xq => ∀ (Xx : Iota), skS.0 0 a Xx → Xq Xx) False
% 4.69/4.89  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota → Prop), Eq (∀ (Xx : Iota), skS.0 0 a Xx → a_1 Xx) False
% 4.69/4.89  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota → Prop) (a_2 : Iota), Eq (Not (skS.0 0 a (skS.0 1 a a_1 a_2) → a_1 (skS.0 1 a a_1 a_2))) True
% 4.69/4.89  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota → Prop) (a_2 : Iota), Eq (skS.0 0 a (skS.0 1 a a_1 a_2) → a_1 (skS.0 1 a a_1 a_2)) False
% 4.69/4.89  Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota → Prop) (a_2 : Iota), Eq (a (skS.0 1 a_1 a a_2)) False
% 4.69/4.89  Clause #12 (by fluidSup #[8, 8]): ∀ (a : Prop), Eq ((fun _ => a) False) False
% 4.69/4.89  Clause #20 (by betaEtaReduce #[12]): ∀ (a : Prop), Eq a False
% 4.69/4.89  Clause #22 (by falseElim #[20]): False
% 4.69/4.89  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------