↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM672^1 : TPTP v9.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n027.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:01 PM UTC 2025

% Result   : Theorem 3.52s 3.71s
% Output   : Proof 3.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM672^1 : TPTP v9.2.0. Released v3.7.0.
% 0.11/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n027.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:37:08 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.52/3.71  SZS status Theorem for theBenchmark.p
% 3.52/3.71  SZS output start Proof for theBenchmark.p
% 3.52/3.71  Clause #0 (by assumption #[]): Eq (less x y) True
% 3.52/3.71  Clause #1 (by assumption #[]): Eq (∀ (Xx Xy : nat), more Xx Xy → less Xy Xx) True
% 3.52/3.71  Clause #2 (by assumption #[]): Eq (∀ (Xx Xy Xz : nat), more Xx Xy → more (pl Xx Xz) (pl Xy Xz)) True
% 3.52/3.71  Clause #3 (by assumption #[]): Eq (∀ (Xx Xy : nat), less Xx Xy → more Xy Xx) True
% 3.52/3.71  Clause #4 (by assumption #[]): Eq (Not (less (pl x z) (pl y z))) True
% 3.52/3.71  Clause #5 (by clausification #[3]): ∀ (a : nat), Eq (∀ (Xy : nat), less a Xy → more Xy a) True
% 3.52/3.71  Clause #6 (by clausification #[5]): ∀ (a a_1 : nat), Eq (less a a_1 → more a_1 a) True
% 3.52/3.71  Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Or (Eq (less a a_1) False) (Eq (more a_1 a) True)
% 3.52/3.71  Clause #8 (by superposition #[7, 0]): Or (Eq (more y x) True) (Eq False True)
% 3.52/3.71  Clause #9 (by clausification #[8]): Eq (more y x) True
% 3.52/3.71  Clause #10 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xy : nat), more a Xy → less Xy a) True
% 3.52/3.71  Clause #11 (by clausification #[10]): ∀ (a a_1 : nat), Eq (more a a_1 → less a_1 a) True
% 3.52/3.71  Clause #12 (by clausification #[11]): ∀ (a a_1 : nat), Or (Eq (more a a_1) False) (Eq (less a_1 a) True)
% 3.52/3.71  Clause #14 (by clausification #[2]): ∀ (a : nat), Eq (∀ (Xy Xz : nat), more a Xy → more (pl a Xz) (pl Xy Xz)) True
% 3.52/3.71  Clause #15 (by clausification #[14]): ∀ (a a_1 : nat), Eq (∀ (Xz : nat), more a a_1 → more (pl a Xz) (pl a_1 Xz)) True
% 3.52/3.71  Clause #16 (by clausification #[15]): ∀ (a a_1 a_2 : nat), Eq (more a a_1 → more (pl a a_2) (pl a_1 a_2)) True
% 3.52/3.71  Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 : nat), Or (Eq (more a a_1) False) (Eq (more (pl a a_2) (pl a_1 a_2)) True)
% 3.52/3.71  Clause #18 (by superposition #[17, 9]): ∀ (a : nat), Or (Eq (more (pl y a) (pl x a)) True) (Eq False True)
% 3.52/3.71  Clause #19 (by clausification #[4]): Eq (less (pl x z) (pl y z)) False
% 3.52/3.71  Clause #20 (by clausification #[18]): ∀ (a : nat), Eq (more (pl y a) (pl x a)) True
% 3.52/3.71  Clause #21 (by superposition #[20, 12]): ∀ (a : nat), Or (Eq True False) (Eq (less (pl x a) (pl y a)) True)
% 3.52/3.71  Clause #23 (by clausification #[21]): ∀ (a : nat), Eq (less (pl x a) (pl y a)) True
% 3.52/3.71  Clause #24 (by superposition #[23, 19]): Eq True False
% 3.52/3.71  Clause #26 (by clausification #[24]): False
% 3.52/3.71  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------