↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n014.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:45 PM UTC 2025

% Result   : Theorem 3.56s 3.76s
% Output   : Proof 3.56s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYO214^5 : TPTP v9.2.0. Released v4.0.0.
% 0.11/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n014.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   : Fri Oct  3 13:55:08 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.56/3.76  SZS status Theorem for theBenchmark.p
% 3.56/3.76  SZS output start Proof for theBenchmark.p
% 3.56/3.76  Clause #0 (by assumption #[]): Eq (Not (∀ (R S : Iota → Prop), Eq R S → ∀ (X : Iota), S X → R X)) True
% 3.56/3.76  Clause #1 (by clausification #[0]): Eq (∀ (R S : Iota → Prop), Eq R S → ∀ (X : Iota), S X → R X) False
% 3.56/3.76  Clause #2 (by clausification #[1]): ∀ (a : Iota → Prop), Eq (Not (∀ (S : Iota → Prop), Eq (skS.0 0 a) S → ∀ (X : Iota), S X → skS.0 0 a X)) True
% 3.56/3.76  Clause #3 (by clausification #[2]): ∀ (a : Iota → Prop), Eq (∀ (S : Iota → Prop), Eq (skS.0 0 a) S → ∀ (X : Iota), S X → skS.0 0 a X) False
% 3.56/3.76  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota → Prop), Eq (Not (Eq (skS.0 0 a) (skS.0 1 a a_1) → ∀ (X : Iota), skS.0 1 a a_1 X → skS.0 0 a X)) True
% 3.56/3.76  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota → Prop), Eq (Eq (skS.0 0 a) (skS.0 1 a a_1) → ∀ (X : Iota), skS.0 1 a a_1 X → skS.0 0 a X) False
% 3.56/3.76  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota → Prop), Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) True
% 3.56/3.76  Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota → Prop), Eq (∀ (X : Iota), skS.0 1 a a_1 X → skS.0 0 a X) False
% 3.56/3.76  Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota → Prop), Eq (skS.0 0 a) (skS.0 1 a a_1)
% 3.56/3.76  Clause #9 (by argument congruence #[8]): ∀ (a : Iota → Prop) (a_1 : Iota) (a_2 : Iota → Prop), Eq (skS.0 0 a a_1) (skS.0 1 a a_2 a_1)
% 3.56/3.76  Clause #10 (by clausification #[7]): ∀ (a a_1 : Iota → Prop) (a_2 : Iota), Eq (Not (skS.0 1 a a_1 (skS.0 2 a a_1 a_2) → skS.0 0 a (skS.0 2 a a_1 a_2))) True
% 3.56/3.76  Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota → Prop) (a_2 : Iota), Eq (skS.0 1 a a_1 (skS.0 2 a a_1 a_2) → skS.0 0 a (skS.0 2 a a_1 a_2)) False
% 3.56/3.76  Clause #12 (by clausification #[11]): ∀ (a a_1 : Iota → Prop) (a_2 : Iota), Eq (skS.0 1 a a_1 (skS.0 2 a a_1 a_2)) True
% 3.56/3.76  Clause #13 (by clausification #[11]): ∀ (a a_1 : Iota → Prop) (a_2 : Iota), Eq (skS.0 0 a (skS.0 2 a a_1 a_2)) False
% 3.56/3.76  Clause #16 (by superposition #[9, 12]): ∀ (a a_1 : Iota → Prop) (a_2 : Iota), Eq (skS.0 0 a (skS.0 2 a a_1 a_2)) True
% 3.56/3.76  Clause #17 (by superposition #[13, 16]): Eq True False
% 3.56/3.76  Clause #20 (by clausification #[17]): False
% 3.56/3.76  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------