↑ Up

Duper---1.0.THM-Prf.s

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

% Result   : Theorem 3.39s 3.59s
% Output   : Proof 3.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUM738^1 : TPTP v9.2.0. Released v3.7.0.
% 0.07/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n002.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 08:47:23 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.39/3.59  SZS status Theorem for theBenchmark.p
% 3.39/3.59  SZS output start Proof for theBenchmark.p
% 3.39/3.59  Clause #0 (by assumption #[]): Eq (lessf x y) True
% 3.39/3.59  Clause #1 (by assumption #[]): Eq (eq x z) True
% 3.39/3.59  Clause #2 (by assumption #[]): Eq (eq y u) True
% 3.39/3.59  Clause #3 (by assumption #[]): Eq (∀ (Xx Xy : frac), moref Xx Xy → lessf Xy Xx) True
% 3.39/3.59  Clause #4 (by assumption #[]): Eq (∀ (Xx Xy Xz Xu : frac), moref Xx Xy → eq Xx Xz → eq Xy Xu → moref Xz Xu) True
% 3.39/3.59  Clause #5 (by assumption #[]): Eq (∀ (Xx Xy : frac), lessf Xx Xy → moref Xy Xx) True
% 3.39/3.59  Clause #6 (by assumption #[]): Eq (Not (lessf z u)) True
% 3.39/3.59  Clause #7 (by clausification #[6]): Eq (lessf z u) False
% 3.39/3.59  Clause #8 (by clausification #[3]): ∀ (a : frac), Eq (∀ (Xy : frac), moref a Xy → lessf Xy a) True
% 3.39/3.59  Clause #9 (by clausification #[8]): ∀ (a a_1 : frac), Eq (moref a a_1 → lessf a_1 a) True
% 3.39/3.59  Clause #10 (by clausification #[9]): ∀ (a a_1 : frac), Or (Eq (moref a a_1) False) (Eq (lessf a_1 a) True)
% 3.39/3.59  Clause #11 (by clausification #[4]): ∀ (a : frac), Eq (∀ (Xy Xz Xu : frac), moref a Xy → eq a Xz → eq Xy Xu → moref Xz Xu) True
% 3.39/3.59  Clause #12 (by clausification #[11]): ∀ (a a_1 : frac), Eq (∀ (Xz Xu : frac), moref a a_1 → eq a Xz → eq a_1 Xu → moref Xz Xu) True
% 3.39/3.59  Clause #13 (by clausification #[12]): ∀ (a a_1 a_2 : frac), Eq (∀ (Xu : frac), moref a a_1 → eq a a_2 → eq a_1 Xu → moref a_2 Xu) True
% 3.39/3.59  Clause #14 (by clausification #[13]): ∀ (a a_1 a_2 a_3 : frac), Eq (moref a a_1 → eq a a_2 → eq a_1 a_3 → moref a_2 a_3) True
% 3.39/3.59  Clause #15 (by clausification #[14]): ∀ (a a_1 a_2 a_3 : frac), Or (Eq (moref a a_1) False) (Eq (eq a a_2 → eq a_1 a_3 → moref a_2 a_3) True)
% 3.39/3.59  Clause #16 (by clausification #[15]): ∀ (a a_1 a_2 a_3 : frac), Or (Eq (moref a a_1) False) (Or (Eq (eq a a_2) False) (Eq (eq a_1 a_3 → moref a_2 a_3) True))
% 3.39/3.59  Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 a_3 : frac),
% 3.39/3.59    Or (Eq (moref a a_1) False) (Or (Eq (eq a a_2) False) (Or (Eq (eq a_1 a_3) False) (Eq (moref a_2 a_3) True)))
% 3.39/3.59  Clause #18 (by clausification #[5]): ∀ (a : frac), Eq (∀ (Xy : frac), lessf a Xy → moref Xy a) True
% 3.39/3.59  Clause #19 (by clausification #[18]): ∀ (a a_1 : frac), Eq (lessf a a_1 → moref a_1 a) True
% 3.39/3.59  Clause #20 (by clausification #[19]): ∀ (a a_1 : frac), Or (Eq (lessf a a_1) False) (Eq (moref a_1 a) True)
% 3.39/3.59  Clause #21 (by superposition #[20, 0]): Or (Eq (moref y x) True) (Eq False True)
% 3.39/3.59  Clause #22 (by clausification #[21]): Eq (moref y x) True
% 3.39/3.59  Clause #24 (by superposition #[22, 17]): ∀ (a a_1 : frac), Or (Eq True False) (Or (Eq (eq y a) False) (Or (Eq (eq x a_1) False) (Eq (moref a a_1) True)))
% 3.39/3.59  Clause #25 (by clausification #[24]): ∀ (a a_1 : frac), Or (Eq (eq y a) False) (Or (Eq (eq x a_1) False) (Eq (moref a a_1) True))
% 3.39/3.59  Clause #26 (by superposition #[25, 2]): ∀ (a : frac), Or (Eq (eq x a) False) (Or (Eq (moref u a) True) (Eq False True))
% 3.39/3.59  Clause #27 (by clausification #[26]): ∀ (a : frac), Or (Eq (eq x a) False) (Eq (moref u a) True)
% 3.39/3.59  Clause #28 (by superposition #[27, 1]): Or (Eq (moref u z) True) (Eq False True)
% 3.39/3.59  Clause #29 (by clausification #[28]): Eq (moref u z) True
% 3.39/3.59  Clause #30 (by superposition #[29, 10]): Or (Eq True False) (Eq (lessf z u) True)
% 3.39/3.59  Clause #32 (by clausification #[30]): Eq (lessf z u) True
% 3.39/3.59  Clause #33 (by superposition #[32, 7]): Eq True False
% 3.39/3.59  Clause #35 (by clausification #[33]): False
% 3.39/3.59  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------