↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SET630^5 : TPTP v9.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n022.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:00:18 PM UTC 2025

% Result   : Theorem 3.59s 3.76s
% Output   : Proof 3.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SET630^5 : TPTP v9.2.0. Released v4.0.0.
% 0.04/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Thu Oct  2 13:46:08 EDT 2025
% 0.14/0.35  % CPUTime    : 
% 3.59/3.76  SZS status Theorem for theBenchmark.p
% 3.59/3.76  SZS output start Proof for theBenchmark.p
% 3.59/3.76  Clause #0 (by assumption #[]): Eq
% 3.59/3.76    (Not
% 3.59/3.76      (∀ (X Y : a → Prop),
% 3.59/3.76        Not (Exists fun Xx => And (And (X Xx) (Y Xx)) (Or (And (X Xx) (Not (Y Xx))) (And (Y Xx) (Not (X Xx)))))))
% 3.59/3.76    True
% 3.59/3.76  Clause #1 (by clausification #[0]): Eq
% 3.59/3.76    (∀ (X Y : a → Prop),
% 3.59/3.76      Not (Exists fun Xx => And (And (X Xx) (Y Xx)) (Or (And (X Xx) (Not (Y Xx))) (And (Y Xx) (Not (X Xx))))))
% 3.59/3.76    False
% 3.59/3.76  Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop),
% 3.59/3.76    Eq
% 3.59/3.76      (Not
% 3.59/3.76        (∀ (Y : a → Prop),
% 3.59/3.76          Not
% 3.59/3.76            (Exists fun Xx =>
% 3.59/3.76              And (And (skS.0 0 a_1 Xx) (Y Xx))
% 3.59/3.76                (Or (And (skS.0 0 a_1 Xx) (Not (Y Xx))) (And (Y Xx) (Not (skS.0 0 a_1 Xx)))))))
% 3.59/3.76      True
% 3.59/3.76  Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop),
% 3.59/3.76    Eq
% 3.59/3.76      (∀ (Y : a → Prop),
% 3.59/3.76        Not
% 3.59/3.76          (Exists fun Xx =>
% 3.59/3.76            And (And (skS.0 0 a_1 Xx) (Y Xx))
% 3.59/3.76              (Or (And (skS.0 0 a_1 Xx) (Not (Y Xx))) (And (Y Xx) (Not (skS.0 0 a_1 Xx))))))
% 3.59/3.76      False
% 3.59/3.76  Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop),
% 3.59/3.76    Eq
% 3.59/3.76      (Not
% 3.59/3.76        (Not
% 3.59/3.76          (Exists fun Xx =>
% 3.59/3.76            And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))
% 3.59/3.76              (Or (And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx))) (And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 0 a_1 Xx)))))))
% 3.59/3.76      True
% 3.59/3.76  Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop),
% 3.59/3.76    Eq
% 3.59/3.76      (Not
% 3.59/3.76        (Exists fun Xx =>
% 3.59/3.76          And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))
% 3.59/3.76            (Or (And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx))) (And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 0 a_1 Xx))))))
% 3.59/3.76      False
% 3.59/3.76  Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : a → Prop),
% 3.59/3.76    Eq
% 3.59/3.76      (Exists fun Xx =>
% 3.59/3.76        And (And (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))
% 3.59/3.76          (Or (And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx))) (And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 0 a_1 Xx)))))
% 3.59/3.76      True
% 3.59/3.76  Clause #7 (by clausification #[6]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.59/3.76    Eq
% 3.59/3.76      (And (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))
% 3.59/3.76        (Or (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))))
% 3.59/3.76          (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))))))
% 3.59/3.76      True
% 3.59/3.76  Clause #8 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.59/3.76    Eq
% 3.59/3.76      (Or (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))))
% 3.59/3.76        (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)))))
% 3.59/3.76      True
% 3.59/3.76  Clause #9 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.59/3.76    Eq (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True
% 3.59/3.76  Clause #10 (by clausification #[8]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.59/3.76    Or (Eq (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))) True)
% 3.59/3.76      (Eq (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)))) True)
% 3.59/3.76  Clause #11 (by clausification #[10]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.59/3.76    Or (Eq (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)))) True)
% 3.59/3.76      (Eq (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True)
% 3.59/3.76  Clause #13 (by clausification #[11]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.59/3.76    Or (Eq (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True) (Eq (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))) True)
% 3.59/3.76  Clause #15 (by clausification #[13]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.59/3.76    Or (Eq (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))) True) (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) False)
% 3.59/3.76  Clause #16 (by clausification #[15]): ∀ (a_1 a_2 : a → Prop) (a_3 : a),
% 3.59/3.76    Or (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) False) (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False)
% 3.59/3.76  Clause #17 (by clausification #[9]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) True
% 3.59/3.76  Clause #18 (by clausification #[9]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) True
% 3.59/3.76  Clause #19 (by superposition #[17, 16]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Or (Eq True False) (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False)
% 3.59/3.77  Clause #21 (by clausification #[19]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False
% 3.59/3.77  Clause #22 (by superposition #[21, 18]): Eq False True
% 3.59/3.77  Clause #23 (by clausification #[22]): False
% 3.59/3.77  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------