%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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 : Tue Sep 8 06:20:03 AM UTC 2026
% Result : Theorem 0.22s 0.51s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ equal(pi2,pi1),
file('MGT115+1.p',unknown),
[] ).
cnf(4,axiom,
equal(issue(pi2),issue(pi1)),
file('MGT115+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ equal(issue(u),issue(v))
| equal(u,v) ),
file('MGT115+1.p',unknown),
[] ).
cnf(6,plain,
equal(pi2,pi1),
inference(res,[status(thm),theory(equality)],[4,5]),
[iquote('0:Res:4.0,5.0')] ).
cnf(8,plain,
$false,
inference(mrr,[status(thm)],[6,3]),
[iquote('0:MRR:6.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.07/0.35 % Computer : n007.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 7 14:06:26 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.22/0.51
% 0.22/0.51 SPASS V 3.9
% 0.22/0.51 SPASS beiseite: Proof found.
% 0.22/0.51 % SZS status Theorem
% 0.22/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.51 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 6 clauses.
% 0.22/0.51 SPASS allocated 85053 KBytes.
% 0.22/0.51 SPASS spent 0:00:00.14 on the problem.
% 0.22/0.51 0:00:00.06 for the input.
% 0.22/0.51 0:00:00.04 for the FLOTTER CNF translation.
% 0.22/0.51 0:00:00.00 for inferences.
% 0.22/0.51 0:00:00.00 for the backtracking.
% 0.22/0.51 0:00:00.00 for the reduction.
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 Here is a proof with depth 1, length 5 :
% 0.22/0.51 % SZS output start Refutation
% See solution above
% 0.22/0.51 Formulae used in the proof : pi1_neq_pi2 conjecture issue_injective
% 0.22/0.51
%------------------------------------------------------------------------------