↑ Up

Duper---1.0.THM-Prf.s

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

% Computer : n006.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:07:33 PM UTC 2025

% Result   : Theorem 3.62s 3.81s
% Output   : Proof 3.62s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN383+1 : TPTP v9.2.0. Released v2.0.0.
% 0.03/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n006.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   : Thu Oct  2 15:47:53 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.62/3.81  SZS status Theorem for theBenchmark.p
% 3.62/3.81  SZS output start Proof for theBenchmark.p
% 3.62/3.81  Clause #0 (by assumption #[]): Eq (Not (Exists fun X => ∀ (Y : Iota), And (big_p X) (big_q Y) → Or (big_q X) (big_p Y))) True
% 3.62/3.81  Clause #1 (by clausification #[0]): Eq (Exists fun X => ∀ (Y : Iota), And (big_p X) (big_q Y) → Or (big_q X) (big_p Y)) False
% 3.62/3.81  Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (∀ (Y : Iota), And (big_p a) (big_q Y) → Or (big_q a) (big_p Y)) False
% 3.62/3.81  Clause #3 (by clausification #[2]): ∀ (a a_1 : Iota), Eq (Not (And (big_p a) (big_q (skS.0 0 a a_1)) → Or (big_q a) (big_p (skS.0 0 a a_1)))) True
% 3.62/3.81  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (And (big_p a) (big_q (skS.0 0 a a_1)) → Or (big_q a) (big_p (skS.0 0 a a_1))) False
% 3.62/3.81  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (And (big_p a) (big_q (skS.0 0 a a_1))) True
% 3.62/3.81  Clause #6 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (Or (big_q a) (big_p (skS.0 0 a a_1))) False
% 3.62/3.81  Clause #8 (by clausification #[5]): ∀ (a : Iota), Eq (big_p a) True
% 3.62/3.81  Clause #9 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (big_p (skS.0 0 a a_1)) False
% 3.62/3.81  Clause #11 (by superposition #[9, 8]): Eq False True
% 3.62/3.81  Clause #12 (by clausification #[11]): False
% 3.62/3.81  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------