↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM749^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:14 PM UTC 2025

% Result   : Theorem 3.45s 3.67s
% Output   : Proof 3.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : NUM749^1 : TPTP v9.2.0. Released v3.7.0.
% 0.06/0.13  % Command    : duper %s
% 0.13/0.35  % Computer : n002.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri Oct  3 07:52:53 EDT 2025
% 0.13/0.35  % CPUTime    : 
% 3.45/3.67  SZS status Theorem for theBenchmark.p
% 3.45/3.67  SZS output start Proof for theBenchmark.p
% 3.45/3.67  Clause #0 (by assumption #[]): Eq (∀ (Xx Xy : frac), more Xx Xy → less Xy Xx) True
% 3.45/3.67  Clause #1 (by assumption #[]): Eq (∀ (Xx Xy : frac), more (pf Xx Xy) Xx) True
% 3.45/3.67  Clause #2 (by assumption #[]): Eq (Not (less x (pf x y))) True
% 3.45/3.67  Clause #3 (by clausification #[2]): Eq (less x (pf x y)) False
% 3.45/3.67  Clause #4 (by clausification #[0]): ∀ (a : frac), Eq (∀ (Xy : frac), more a Xy → less Xy a) True
% 3.45/3.67  Clause #5 (by clausification #[4]): ∀ (a a_1 : frac), Eq (more a a_1 → less a_1 a) True
% 3.45/3.67  Clause #6 (by clausification #[5]): ∀ (a a_1 : frac), Or (Eq (more a a_1) False) (Eq (less a_1 a) True)
% 3.45/3.67  Clause #7 (by clausification #[1]): ∀ (a : frac), Eq (∀ (Xy : frac), more (pf a Xy) a) True
% 3.45/3.67  Clause #8 (by clausification #[7]): ∀ (a a_1 : frac), Eq (more (pf a a_1) a) True
% 3.45/3.67  Clause #9 (by superposition #[8, 6]): ∀ (a a_1 : frac), Or (Eq True False) (Eq (less a (pf a a_1)) True)
% 3.45/3.67  Clause #10 (by clausification #[9]): ∀ (a a_1 : frac), Eq (less a (pf a a_1)) True
% 3.45/3.67  Clause #11 (by superposition #[10, 3]): Eq True False
% 3.45/3.67  Clause #12 (by clausification #[11]): False
% 3.45/3.67  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------