↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO501^1 : TPTP v9.2.0. Released v4.1.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 08:09:12 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYO501^1 : TPTP v9.2.0. Released v4.1.0.
% 0.07/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n002.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri Oct  3 13:52:08 EDT 2025
% 0.14/0.34  % CPUTime    : 
% 3.64/3.88  SZS status Theorem for theBenchmark.p
% 3.64/3.88  SZS output start Proof for theBenchmark.p
% 3.64/3.88  Clause #0 (by assumption #[]): Eq (Not (Or (Not (p (f x (Not (Not y))))) (p (f x y)))) True
% 3.64/3.88  Clause #1 (by clausification #[0]): Eq (Or (Not (p (f x (Not (Not y))))) (p (f x y))) False
% 3.64/3.88  Clause #2 (by clausification #[1]): Eq (p (f x y)) False
% 3.64/3.88  Clause #3 (by clausification #[1]): Eq (Not (p (f x (Not (Not y))))) False
% 3.64/3.88  Clause #4 (by identity loobHoist #[2]): Or (Eq (p (f x True)) False) (Eq y False)
% 3.64/3.88  Clause #5 (by identity boolHoist #[2]): Or (Eq (p (f x False)) False) (Eq y True)
% 3.64/3.88  Clause #6 (by clausification #[3]): Eq (p (f x (Not (Not y)))) True
% 3.64/3.88  Clause #7 (by bool simp #[6]): Eq (p (f x y)) True
% 3.64/3.88  Clause #8 (by identity loobHoist #[7]): Or (Eq (p (f x True)) True) (Eq y False)
% 3.64/3.88  Clause #9 (by identity boolHoist #[7]): Or (Eq (p (f x False)) True) (Eq y True)
% 3.64/3.88  Clause #10 (by superposition #[9, 5]): Or (Eq y True) (Or (Eq True False) (Eq y True))
% 3.64/3.88  Clause #11 (by clausification #[10]): Or (Eq y True) (Eq y True)
% 3.64/3.88  Clause #12 (by eliminate duplicate literals #[11]): Eq y True
% 3.64/3.88  Clause #13 (by backward demodulation #[12, 4]): Or (Eq (p (f x True)) False) (Eq True False)
% 3.64/3.88  Clause #15 (by backward demodulation #[12, 8]): Or (Eq (p (f x True)) True) (Eq True False)
% 3.64/3.88  Clause #17 (by clausification #[13]): Eq (p (f x True)) False
% 3.64/3.88  Clause #18 (by clausification #[15]): Eq (p (f x True)) True
% 3.64/3.88  Clause #19 (by superposition #[18, 17]): Eq True False
% 3.64/3.88  Clause #20 (by clausification #[19]): False
% 3.64/3.88  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------