↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n015.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:19 PM UTC 2025

% Result   : Theorem 3.56s 3.80s
% Output   : Proof 3.56s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM784^1 : TPTP v9.2.0. Released v3.7.0.
% 0.11/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n015.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 09:00:08 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.56/3.80  SZS status Theorem for theBenchmark.p
% 3.56/3.80  SZS output start Proof for theBenchmark.p
% 3.56/3.80  Clause #0 (by assumption #[]): Eq (Not (more x0 y0) → is x0 y0) True
% 3.56/3.80  Clause #2 (by assumption #[]): Eq
% 3.56/3.80    (∀ (Xx0 Xy0 : rat),
% 3.56/3.80      Not
% 3.56/3.80        ((is Xx0 Xy0 → Not (more Xx0 Xy0)) →
% 3.56/3.80          Not (Not ((more Xx0 Xy0 → Not (less Xx0 Xy0)) → Not (less Xx0 Xy0 → Not (is Xx0 Xy0))))))
% 3.56/3.80    True
% 3.56/3.80  Clause #3 (by assumption #[]): Eq (Not (Not (less x0 y0))) True
% 3.56/3.80  Clause #8 (by clausification #[0]): Or (Eq (Not (more x0 y0)) False) (Eq (is x0 y0) True)
% 3.56/3.80  Clause #9 (by clausification #[8]): Or (Eq (is x0 y0) True) (Eq (more x0 y0) True)
% 3.56/3.80  Clause #10 (by clausification #[3]): Eq (Not (less x0 y0)) False
% 3.56/3.80  Clause #11 (by clausification #[10]): Eq (less x0 y0) True
% 3.56/3.80  Clause #12 (by clausification #[2]): ∀ (a : rat),
% 3.56/3.80    Eq
% 3.56/3.80      (∀ (Xy0 : rat),
% 3.56/3.80        Not
% 3.56/3.80          ((is a Xy0 → Not (more a Xy0)) →
% 3.56/3.80            Not (Not ((more a Xy0 → Not (less a Xy0)) → Not (less a Xy0 → Not (is a Xy0))))))
% 3.56/3.80      True
% 3.56/3.80  Clause #13 (by clausification #[12]): ∀ (a a_1 : rat),
% 3.56/3.80    Eq
% 3.56/3.80      (Not
% 3.56/3.80        ((is a a_1 → Not (more a a_1)) → Not (Not ((more a a_1 → Not (less a a_1)) → Not (less a a_1 → Not (is a a_1))))))
% 3.56/3.80      True
% 3.56/3.80  Clause #14 (by clausification #[13]): ∀ (a a_1 : rat),
% 3.56/3.80    Eq ((is a a_1 → Not (more a a_1)) → Not (Not ((more a a_1 → Not (less a a_1)) → Not (less a a_1 → Not (is a a_1)))))
% 3.56/3.80      False
% 3.56/3.80  Clause #16 (by clausification #[14]): ∀ (a a_1 : rat), Eq (Not (Not ((more a a_1 → Not (less a a_1)) → Not (less a a_1 → Not (is a a_1))))) False
% 3.56/3.80  Clause #19 (by clausification #[16]): ∀ (a a_1 : rat), Eq (Not ((more a a_1 → Not (less a a_1)) → Not (less a a_1 → Not (is a a_1)))) True
% 3.56/3.80  Clause #20 (by clausification #[19]): ∀ (a a_1 : rat), Eq ((more a a_1 → Not (less a a_1)) → Not (less a a_1 → Not (is a a_1))) False
% 3.56/3.80  Clause #21 (by clausification #[20]): ∀ (a a_1 : rat), Eq (more a a_1 → Not (less a a_1)) True
% 3.56/3.80  Clause #22 (by clausification #[20]): ∀ (a a_1 : rat), Eq (Not (less a a_1 → Not (is a a_1))) False
% 3.56/3.80  Clause #23 (by clausification #[21]): ∀ (a a_1 : rat), Or (Eq (more a a_1) False) (Eq (Not (less a a_1)) True)
% 3.56/3.80  Clause #24 (by clausification #[23]): ∀ (a a_1 : rat), Or (Eq (more a a_1) False) (Eq (less a a_1) False)
% 3.56/3.80  Clause #26 (by clausification #[22]): ∀ (a a_1 : rat), Eq (less a a_1 → Not (is a a_1)) True
% 3.56/3.80  Clause #27 (by clausification #[26]): ∀ (a a_1 : rat), Or (Eq (less a a_1) False) (Eq (Not (is a a_1)) True)
% 3.56/3.80  Clause #28 (by clausification #[27]): ∀ (a a_1 : rat), Or (Eq (less a a_1) False) (Eq (is a a_1) False)
% 3.56/3.80  Clause #29 (by superposition #[28, 11]): Or (Eq (is x0 y0) False) (Eq False True)
% 3.56/3.80  Clause #30 (by clausification #[29]): Eq (is x0 y0) False
% 3.56/3.80  Clause #31 (by backward demodulation #[30, 9]): Or (Eq False True) (Eq (more x0 y0) True)
% 3.56/3.80  Clause #32 (by clausification #[31]): Eq (more x0 y0) True
% 3.56/3.80  Clause #33 (by superposition #[32, 24]): Or (Eq True False) (Eq (less x0 y0) False)
% 3.56/3.80  Clause #34 (by clausification #[33]): Eq (less x0 y0) False
% 3.56/3.80  Clause #35 (by superposition #[34, 11]): Eq False True
% 3.56/3.80  Clause #36 (by clausification #[35]): False
% 3.56/3.80  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------