↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:36:01 AM UTC 2026

% Result   : Theorem 8.89s 9.13s
% Output   : Proof 8.89s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05  % Command    : duper %s
% 0.11/0.38  % Computer : n017.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit   : 300
% 0.11/0.38  % WCLimit    : 300
% 0.11/0.38  % DateTime   : Fri Sep  4 14:05:05 UTC 2026
% 0.11/0.39  % CPUTime    : 
% 8.89/9.13  SZS status Theorem for theBenchmark.p
% 8.89/9.13  SZS output start Proof for theBenchmark.p
% 8.89/9.13  Clause #10 (by assumption #[]): Eq (Iff or_2 (∀ (X Y : Iota), is_a_theorem (implies Y (or X Y)))) True
% 8.89/9.13  Clause #22 (by assumption #[]): Eq (Iff r2 (∀ (P Q : Iota), is_a_theorem (implies Q (or P Q)))) True
% 8.89/9.13  Clause #36 (by assumption #[]): Eq r2 True
% 8.89/9.13  Clause #43 (by assumption #[]): Eq (Not or_2) True
% 8.89/9.13  Clause #64 (by clausification #[43]): Eq or_2 False
% 8.89/9.13  Clause #104 (by clausification #[10]): Or (Eq or_2 True) (Eq (∀ (X Y : Iota), is_a_theorem (implies Y (or X Y))) False)
% 8.89/9.13  Clause #106 (by clausification #[104]): ∀ (a : Iota), Or (Eq or_2 True) (Eq (Not (∀ (Y : Iota), is_a_theorem (implies Y (or (skS.0 10 a) Y)))) True)
% 8.89/9.13  Clause #107 (by clausification #[106]): ∀ (a : Iota), Or (Eq or_2 True) (Eq (∀ (Y : Iota), is_a_theorem (implies Y (or (skS.0 10 a) Y))) False)
% 8.89/9.13  Clause #108 (by clausification #[107]): ∀ (a a_1 : Iota),
% 8.89/9.13    Or (Eq or_2 True) (Eq (Not (is_a_theorem (implies (skS.0 11 a a_1) (or (skS.0 10 a) (skS.0 11 a a_1))))) True)
% 8.89/9.13  Clause #109 (by clausification #[108]): ∀ (a a_1 : Iota),
% 8.89/9.13    Or (Eq or_2 True) (Eq (is_a_theorem (implies (skS.0 11 a a_1) (or (skS.0 10 a) (skS.0 11 a a_1)))) False)
% 8.89/9.13  Clause #110 (by forward demodulation #[109, 64]): ∀ (a a_1 : Iota),
% 8.89/9.13    Or (Eq False True) (Eq (is_a_theorem (implies (skS.0 11 a a_1) (or (skS.0 10 a) (skS.0 11 a a_1)))) False)
% 8.89/9.13  Clause #111 (by clausification #[110]): ∀ (a a_1 : Iota), Eq (is_a_theorem (implies (skS.0 11 a a_1) (or (skS.0 10 a) (skS.0 11 a a_1)))) False
% 8.89/9.13  Clause #124 (by clausification #[22]): Or (Eq r2 False) (Eq (∀ (P Q : Iota), is_a_theorem (implies Q (or P Q))) True)
% 8.89/9.13  Clause #136 (by clausification #[124]): ∀ (a : Iota), Or (Eq r2 False) (Eq (∀ (Q : Iota), is_a_theorem (implies Q (or a Q))) True)
% 8.89/9.13  Clause #137 (by clausification #[136]): ∀ (a a_1 : Iota), Or (Eq r2 False) (Eq (is_a_theorem (implies a (or a_1 a))) True)
% 8.89/9.13  Clause #138 (by forward demodulation #[137, 36]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (is_a_theorem (implies a (or a_1 a))) True)
% 8.89/9.13  Clause #139 (by clausification #[138]): ∀ (a a_1 : Iota), Eq (is_a_theorem (implies a (or a_1 a))) True
% 8.89/9.13  Clause #140 (by superposition #[139, 111]): Eq True False
% 8.89/9.13  Clause #142 (by clausification #[140]): False
% 8.89/9.13  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------