%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT115+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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 : Sun Sep 27 08:03:09 AM UTC 2026
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 8 unt; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 7 ~; 1 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 4 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(issue_injective,axiom,
! [A,B] :
( issue(A) = issue(B)
=> A = B ),
file('theBenchmark.p',issue_injective) ).
fof(conjecture,conjecture,
issue(pi1) != issue(pi2),
file('theBenchmark.p',conjecture) ).
fof(conjecture_neg,negated_conjecture,
~ ( issue(pi1) != issue(pi2) ),
inference(assume_negation,[status(cth)],[conjecture]) ).
cnf(c_3,negated_conjecture,
issue(pi2) = issue(pi1),
inference(clausify,[status(thm)],[conjecture_neg]) ).
fof(pi1_neq_pi2,axiom,
pi1 != pi2,
file('theBenchmark.p',pi1_neq_pi2) ).
cnf(c_4,plain,
pi1 != pi2,
inference(clausify,[status(thm)],[pi1_neq_pi2]) ).
cnf(c_5,plain,
pi2 != pi1,
inference(copy,[status(thm)],[c_4]) ).
cnf(c_6,plain,
( A = B
| issue(A) != issue(B) ),
inference(clausify,[status(thm)],[issue_injective]) ).
cnf(c_7,negated_conjecture,
pi2 = pi1,
inference(resolve,[status(thm)],[c_6,c_3]) ).
cnf(c_8,plain,
$false,
inference(resolve,[status(thm)],[c_7,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : MGT115+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n003.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sat Sep 26 00:15:55 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.43 % Process 1491282 was started by sandbox on n003,
% 0.16/0.43 % Sat Sep 26 00:15:55 2026
% 0.16/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/0.43
% 0.16/0.43 % From the command line: assign(max_seconds, 300).
% 0.16/0.44
% 0.16/0.44 % SZS status Theorem for theBenchmark
% 0.16/0.44
% 0.16/0.44 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.16/0.44 % Length of proof is 8.
% 0.16/0.44 % Level of proof is 3.
% 0.16/0.44 % Maximum clause weight is 8.000.
% 0.16/0.44 % Given clauses 3.
% 0.16/0.44
% 0.16/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------