↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n002.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:03:07 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEV392^5 : TPTP v9.2.0. Released v4.0.0.
% 0.03/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n002.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri Oct  3 01:02:38 EDT 2025
% 0.14/0.34  % CPUTime    : 
% 3.51/3.68  SZS status Theorem for theBenchmark.p
% 3.51/3.68  SZS output start Proof for theBenchmark.p
% 3.51/3.68  Clause #0 (by assumption #[]): Eq (Not ((Eq (fun Xx => And (cR Xx) (cS Xx)) fun Xz => Or (cR Xz) (cS Xz)) → ∀ (Xx : Iota), cR Xx → cS Xx)) True
% 3.51/3.68  Clause #1 (by clausification #[0]): Eq ((Eq (fun Xx => And (cR Xx) (cS Xx)) fun Xz => Or (cR Xz) (cS Xz)) → ∀ (Xx : Iota), cR Xx → cS Xx) False
% 3.51/3.68  Clause #2 (by clausification #[1]): Eq (Eq (fun Xx => And (cR Xx) (cS Xx)) fun Xz => Or (cR Xz) (cS Xz)) True
% 3.51/3.68  Clause #3 (by clausification #[1]): Eq (∀ (Xx : Iota), cR Xx → cS Xx) False
% 3.51/3.68  Clause #4 (by clausification #[2]): Eq (fun Xx => And (cR Xx) (cS Xx)) fun Xz => Or (cR Xz) (cS Xz)
% 3.51/3.68  Clause #5 (by argument congruence #[4]): ∀ (a : Iota), Eq ((fun Xx => And (cR Xx) (cS Xx)) a) ((fun Xz => Or (cR Xz) (cS Xz)) a)
% 3.51/3.68  Clause #6 (by clausification #[3]): ∀ (a : Iota), Eq (Not (cR (skS.0 0 a) → cS (skS.0 0 a))) True
% 3.51/3.68  Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (cR (skS.0 0 a) → cS (skS.0 0 a)) False
% 3.51/3.68  Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (cR (skS.0 0 a)) True
% 3.51/3.68  Clause #9 (by clausification #[7]): ∀ (a : Iota), Eq (cS (skS.0 0 a)) False
% 3.51/3.68  Clause #10 (by betaEtaReduce #[5]): ∀ (a : Iota), Eq (And (cR a) (cS a)) (Or (cR a) (cS a))
% 3.51/3.68  Clause #12 (by identity boolHoist #[10]): ∀ (a : Iota), Or (Eq (And (cR a) False) (Or (cR a) (cS a))) (Eq (cS a) True)
% 3.51/3.68  Clause #19 (by bool simp #[12]): ∀ (a : Iota), Or (Eq False (Or (cR a) (cS a))) (Eq (cS a) True)
% 3.51/3.68  Clause #21 (by clausification #[19]): ∀ (a : Iota), Or (Eq (cS a) True) (Eq (cR a) False)
% 3.51/3.68  Clause #22 (by superposition #[21, 8]): ∀ (a : Iota), Or (Eq (cS (skS.0 0 a)) True) (Eq False True)
% 3.51/3.68  Clause #23 (by clausification #[22]): ∀ (a : Iota), Eq (cS (skS.0 0 a)) True
% 3.51/3.68  Clause #24 (by superposition #[23, 9]): Eq True False
% 3.51/3.68  Clause #26 (by clausification #[24]): False
% 3.51/3.68  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------