↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO885^1.033.003 : TPTP v9.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n028.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:37 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO885^1.033.003 : TPTP v9.2.0. Released v7.5.0.
% 0.03/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n028.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 13:51:38 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 3.46/3.64  SZS status Theorem for theBenchmark.p
% 3.46/3.64  SZS output start Proof for theBenchmark.p
% 3.46/3.64  Clause #0 (by assumption #[]): Eq
% 3.46/3.64    (Not
% 3.46/3.64      (Exists fun F =>
% 3.46/3.64        And (And (Eq (F a0 a1 a2) (f a0 a1 a2)) (Eq (F a0 a2 a1) (f a0 a1 a2))) (Eq (F a2 a1 a0) (f a0 a1 a2))))
% 3.46/3.64    True
% 3.46/3.64  Clause #1 (by clausification #[0]): Eq
% 3.46/3.64    (Exists fun F =>
% 3.46/3.64      And (And (Eq (F a0 a1 a2) (f a0 a1 a2)) (Eq (F a0 a2 a1) (f a0 a1 a2))) (Eq (F a2 a1 a0) (f a0 a1 a2)))
% 3.46/3.64    False
% 3.46/3.64  Clause #2 (by clausification #[1]): ∀ (a : Iota → Iota → Iota → Iota),
% 3.46/3.64    Eq (And (And (Eq (a a0 a1 a2) (f a0 a1 a2)) (Eq (a a0 a2 a1) (f a0 a1 a2))) (Eq (a a2 a1 a0) (f a0 a1 a2))) False
% 3.46/3.64  Clause #3 (by clausification #[2]): ∀ (a : Iota → Iota → Iota → Iota),
% 3.46/3.64    Or (Eq (And (Eq (a a0 a1 a2) (f a0 a1 a2)) (Eq (a a0 a2 a1) (f a0 a1 a2))) False)
% 3.46/3.64      (Eq (Eq (a a2 a1 a0) (f a0 a1 a2)) False)
% 3.46/3.64  Clause #4 (by clausification #[3]): ∀ (a : Iota → Iota → Iota → Iota),
% 3.46/3.64    Or (Eq (Eq (a a2 a1 a0) (f a0 a1 a2)) False)
% 3.46/3.64      (Or (Eq (Eq (a a0 a1 a2) (f a0 a1 a2)) False) (Eq (Eq (a a0 a2 a1) (f a0 a1 a2)) False))
% 3.46/3.64  Clause #5 (by clausification #[4]): ∀ (a : Iota → Iota → Iota → Iota),
% 3.46/3.64    Or (Eq (Eq (a a0 a1 a2) (f a0 a1 a2)) False)
% 3.46/3.64      (Or (Eq (Eq (a a0 a2 a1) (f a0 a1 a2)) False) (Ne (a a2 a1 a0) (f a0 a1 a2)))
% 3.46/3.64  Clause #6 (by clausification #[5]): ∀ (a : Iota → Iota → Iota → Iota),
% 3.46/3.64    Or (Eq (Eq (a a0 a2 a1) (f a0 a1 a2)) False) (Or (Ne (a a2 a1 a0) (f a0 a1 a2)) (Ne (a a0 a1 a2) (f a0 a1 a2)))
% 3.46/3.64  Clause #7 (by clausification #[6]): ∀ (a : Iota → Iota → Iota → Iota),
% 3.46/3.64    Or (Ne (a a2 a1 a0) (f a0 a1 a2)) (Or (Ne (a a0 a1 a2) (f a0 a1 a2)) (Ne (a a0 a2 a1) (f a0 a1 a2)))
% 3.46/3.64  Clause #8 (by equality resolution #[7]): Or (Ne ((fun x x x => f a0 a1 a2) a0 a1 a2) (f a0 a1 a2)) (Ne ((fun x x x => f a0 a1 a2) a0 a2 a1) (f a0 a1 a2))
% 3.46/3.64  Clause #9 (by betaEtaReduce #[8]): Or (Ne (f a0 a1 a2) (f a0 a1 a2)) (Ne (f a0 a1 a2) (f a0 a1 a2))
% 3.46/3.64  Clause #10 (by eliminate duplicate literals #[9]): Ne (f a0 a1 a2) (f a0 a1 a2)
% 3.46/3.64  Clause #11 (by eliminate resolved literals #[10]): False
% 3.46/3.64  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------