↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n001.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:02:38 PM UTC 2025

% Result   : Theorem 3.42s 3.68s
% Output   : Proof 3.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU918^5 : TPTP v9.2.0. Released v4.0.0.
% 0.07/0.14  % Command    : duper %s
% 0.14/0.36  % Computer : n001.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri Oct  3 04:23:08 EDT 2025
% 0.14/0.36  % CPUTime    : 
% 3.42/3.68  SZS status Theorem for theBenchmark.p
% 3.42/3.68  SZS output start Proof for theBenchmark.p
% 3.42/3.68  Clause #0 (by assumption #[]): Eq (Not (Ne a b → Not (∀ (Xf Xg : Iota → Iota), Eq (fun Xx => Xf (Xg Xx)) fun Xx => Xg (Xf Xx)))) True
% 3.42/3.68  Clause #1 (by clausification #[0]): Eq (Ne a b → Not (∀ (Xf Xg : Iota → Iota), Eq (fun Xx => Xf (Xg Xx)) fun Xx => Xg (Xf Xx))) False
% 3.42/3.68  Clause #2 (by clausification #[1]): Eq (Ne a b) True
% 3.42/3.68  Clause #3 (by clausification #[1]): Eq (Not (∀ (Xf Xg : Iota → Iota), Eq (fun Xx => Xf (Xg Xx)) fun Xx => Xg (Xf Xx))) False
% 3.42/3.68  Clause #4 (by clausification #[2]): Ne a b
% 3.42/3.68  Clause #5 (by clausification #[3]): Eq (∀ (Xf Xg : Iota → Iota), Eq (fun Xx => Xf (Xg Xx)) fun Xx => Xg (Xf Xx)) True
% 3.42/3.68  Clause #6 (by clausification #[5]): ∀ (a : Iota → Iota), Eq (∀ (Xg : Iota → Iota), Eq (fun Xx => a (Xg Xx)) fun Xx => Xg (a Xx)) True
% 3.42/3.68  Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota → Iota), Eq (Eq (fun Xx => a (a_1 Xx)) fun Xx => a_1 (a Xx)) True
% 3.42/3.68  Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota → Iota), Eq (fun Xx => a (a_1 Xx)) fun Xx => a_1 (a Xx)
% 3.42/3.68  Clause #9 (by argument congruence #[8]): ∀ (a a_1 : Iota → Iota) (a_2 : Iota), Eq ((fun Xx => a (a_1 Xx)) a_2) ((fun Xx => a_1 (a Xx)) a_2)
% 3.42/3.68  Clause #10 (by betaEtaReduce #[9]): ∀ (a a_1 : Iota → Iota) (a_2 : Iota), Eq (a (a_1 a_2)) (a_1 (a a_2))
% 3.42/3.68  Clause #11 (by superposition #[10, 4]): ∀ (a_1 : Iota → Iota), Ne a (a_1 b)
% 3.42/3.68  Clause #14 (by equality resolution #[11]): False
% 3.42/3.68  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------