↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n010.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:13 PM UTC 2025

% Result   : Theorem 3.43s 3.64s
% Output   : Proof 3.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM747^1 : TPTP v9.2.0. Released v3.7.0.
% 0.11/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n010.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 07:48:53 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.43/3.64  SZS status Theorem for theBenchmark.p
% 3.43/3.64  SZS output start Proof for theBenchmark.p
% 3.43/3.64  Clause #0 (by assumption #[]): Eq (∀ (Xx Xy : frac), eq Xx Xy → eq Xy Xx) True
% 3.43/3.64  Clause #1 (by assumption #[]): Eq (∀ (Xx1 Xx2 Xn : nat), eq (pf (fr Xx1 Xn) (fr Xx2 Xn)) (fr (pl Xx1 Xx2) Xn)) True
% 3.43/3.64  Clause #2 (by assumption #[]): Eq (Not (eq (fr (pl x1 x2) n) (pf (fr x1 n) (fr x2 n)))) True
% 3.43/3.64  Clause #3 (by clausification #[0]): ∀ (a : frac), Eq (∀ (Xy : frac), eq a Xy → eq Xy a) True
% 3.43/3.64  Clause #4 (by clausification #[3]): ∀ (a a_1 : frac), Eq (eq a a_1 → eq a_1 a) True
% 3.43/3.64  Clause #5 (by clausification #[4]): ∀ (a a_1 : frac), Or (Eq (eq a a_1) False) (Eq (eq a_1 a) True)
% 3.43/3.64  Clause #6 (by clausification #[2]): Eq (eq (fr (pl x1 x2) n) (pf (fr x1 n) (fr x2 n))) False
% 3.43/3.64  Clause #7 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xx2 Xn : nat), eq (pf (fr a Xn) (fr Xx2 Xn)) (fr (pl a Xx2) Xn)) True
% 3.43/3.64  Clause #8 (by clausification #[7]): ∀ (a a_1 : nat), Eq (∀ (Xn : nat), eq (pf (fr a Xn) (fr a_1 Xn)) (fr (pl a a_1) Xn)) True
% 3.43/3.64  Clause #9 (by clausification #[8]): ∀ (a a_1 a_2 : nat), Eq (eq (pf (fr a a_1) (fr a_2 a_1)) (fr (pl a a_2) a_1)) True
% 3.43/3.64  Clause #10 (by superposition #[9, 5]): ∀ (a a_1 a_2 : nat), Or (Eq True False) (Eq (eq (fr (pl a a_1) a_2) (pf (fr a a_2) (fr a_1 a_2))) True)
% 3.43/3.64  Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : nat), Eq (eq (fr (pl a a_1) a_2) (pf (fr a a_2) (fr a_1 a_2))) True
% 3.43/3.64  Clause #12 (by superposition #[11, 6]): Eq True False
% 3.43/3.64  Clause #14 (by clausification #[12]): False
% 3.43/3.64  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------