↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM666^1 : TPTP v9.2.0. Released v3.7.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 07:57:00 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : NUM666^1 : TPTP v9.2.0. Released v3.7.0.
% 0.06/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n028.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 06:59:08 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.51/3.69  SZS status Theorem for theBenchmark.p
% 3.51/3.69  SZS output start Proof for theBenchmark.p
% 3.51/3.69  Clause #0 (by assumption #[]): Eq (some fun Xu => diffprop x y Xu) True
% 3.51/3.69  Clause #1 (by assumption #[]): Eq (moreis y z) True
% 3.51/3.69  Clause #2 (by assumption #[]): Eq (∀ (Xx Xy Xz : nat), lessis Xx Xy → (some fun Xv => diffprop Xz Xy Xv) → some fun Xv => diffprop Xz Xx Xv) True
% 3.51/3.69  Clause #3 (by assumption #[]): Eq (∀ (Xx Xy : nat), moreis Xx Xy → lessis Xy Xx) True
% 3.51/3.69  Clause #4 (by assumption #[]): Eq (Not (some fun Xu => diffprop x z Xu)) True
% 3.51/3.69  Clause #5 (by clausification #[3]): ∀ (a : nat), Eq (∀ (Xy : nat), moreis a Xy → lessis Xy a) True
% 3.51/3.69  Clause #6 (by clausification #[5]): ∀ (a a_1 : nat), Eq (moreis a a_1 → lessis a_1 a) True
% 3.51/3.69  Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Or (Eq (moreis a a_1) False) (Eq (lessis a_1 a) True)
% 3.51/3.69  Clause #8 (by superposition #[7, 1]): Or (Eq (lessis z y) True) (Eq False True)
% 3.51/3.69  Clause #9 (by clausification #[8]): Eq (lessis z y) True
% 3.51/3.69  Clause #10 (by betaEtaReduce #[0]): Eq (some (diffprop x y)) True
% 3.51/3.69  Clause #11 (by betaEtaReduce #[4]): Eq (Not (some (diffprop x z))) True
% 3.51/3.69  Clause #12 (by clausification #[11]): Eq (some (diffprop x z)) False
% 3.51/3.69  Clause #13 (by betaEtaReduce #[2]): Eq (∀ (Xx Xy Xz : nat), lessis Xx Xy → some (diffprop Xz Xy) → some (diffprop Xz Xx)) True
% 3.51/3.69  Clause #14 (by clausification #[13]): ∀ (a : nat), Eq (∀ (Xy Xz : nat), lessis a Xy → some (diffprop Xz Xy) → some (diffprop Xz a)) True
% 3.51/3.69  Clause #15 (by clausification #[14]): ∀ (a a_1 : nat), Eq (∀ (Xz : nat), lessis a a_1 → some (diffprop Xz a_1) → some (diffprop Xz a)) True
% 3.51/3.69  Clause #16 (by clausification #[15]): ∀ (a a_1 a_2 : nat), Eq (lessis a a_1 → some (diffprop a_2 a_1) → some (diffprop a_2 a)) True
% 3.51/3.69  Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 : nat), Or (Eq (lessis a a_1) False) (Eq (some (diffprop a_2 a_1) → some (diffprop a_2 a)) True)
% 3.51/3.69  Clause #18 (by clausification #[17]): ∀ (a a_1 a_2 : nat),
% 3.51/3.69    Or (Eq (lessis a a_1) False) (Or (Eq (some (diffprop a_2 a_1)) False) (Eq (some (diffprop a_2 a)) True))
% 3.51/3.69  Clause #19 (by superposition #[18, 9]): ∀ (a : nat), Or (Eq (some (diffprop a y)) False) (Or (Eq (some (diffprop a z)) True) (Eq False True))
% 3.51/3.69  Clause #20 (by clausification #[19]): ∀ (a : nat), Or (Eq (some (diffprop a y)) False) (Eq (some (diffprop a z)) True)
% 3.51/3.69  Clause #21 (by superposition #[20, 10]): Or (Eq (some (diffprop x z)) True) (Eq False True)
% 3.51/3.69  Clause #22 (by clausification #[21]): Eq (some (diffprop x z)) True
% 3.51/3.69  Clause #23 (by superposition #[22, 12]): Eq True False
% 3.51/3.69  Clause #24 (by clausification #[23]): False
% 3.51/3.69  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------