%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT073+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 : n011.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:04 AM UTC 2026
% Result : Theorem 0.09s 0.40s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 39 ( 16 ~; 13 |; 9 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 40 ( 0 sgn 27 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axis_compatible_def,axiom,
! [I1lo,I1hi,I2lo,I2hi] :
( axis_compatible(I1lo,I1hi,I2lo,I2hi)
<=> ? [X] :
( in_closed(X,I2lo,I2hi)
& in_closed(X,I1lo,I1hi) ) ),
file('theBenchmark.p',axis_compatible_def) ).
fof(no_false_compatible,conjecture,
? [X] :
( in_closed(X,n5,n10)
& in_closed(X,n0,n10) ),
file('theBenchmark.p',no_false_compatible) ).
fof(no_false_compatible_neg,negated_conjecture,
~ ? [X] :
( in_closed(X,n5,n10)
& in_closed(X,n0,n10) ),
inference(assume_negation,[status(cth)],[no_false_compatible]) ).
fof(nnf_15,plain,
! [I1lo,I1hi,I2lo,I2hi] :
( ( ! [X] :
( ~ in_closed(X,I2lo,I2hi)
| ~ in_closed(X,I1lo,I1hi) )
| axis_compatible(I1lo,I1hi,I2lo,I2hi) )
& ( ? [X0] :
( in_closed(X0,I2lo,I2hi)
& in_closed(X0,I1lo,I1hi) )
| ~ axis_compatible(I1lo,I1hi,I2lo,I2hi) ) ),
inference(fof_nnf,[status(thm)],[axis_compatible_def]) ).
fof(sk_axis_compatible_def_sk,plain,
! [I1lo,I1hi,I2lo,I2hi] :
( ( ! [X] :
( ~ in_closed(X,I2lo,I2hi)
| ~ in_closed(X,I1lo,I1hi) )
| axis_compatible(I1lo,I1hi,I2lo,I2hi) )
& ( ( in_closed(sK0(I1lo,I1hi,I2lo,I2hi),I2lo,I2hi)
& in_closed(sK0(I1lo,I1hi,I2lo,I2hi),I1lo,I1hi) )
| ~ axis_compatible(I1lo,I1hi,I2lo,I2hi) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0(I1lo,I1hi,I2lo,I2hi))],[nnf_15]) ).
fof(sk_axis_compatible_def,plain,
( ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ in_closed(VAR_4,VAR_2,VAR_3)
| ~ in_closed(VAR_4,VAR_0,VAR_1)
| axis_compatible(VAR_0,VAR_1,VAR_2,VAR_3) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( in_closed(sK0(VAR_0,VAR_1,VAR_2,VAR_3),VAR_2,VAR_3)
| ~ axis_compatible(VAR_0,VAR_1,VAR_2,VAR_3) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( in_closed(sK0(VAR_0,VAR_1,VAR_2,VAR_3),VAR_0,VAR_1)
| ~ axis_compatible(VAR_0,VAR_1,VAR_2,VAR_3) ) ),
inference(cnf_transformation,[status(thm)],[sk_axis_compatible_def_sk]) ).
cnf(c_63,plain,
( in_closed(sK0(A,B,C,D),C,D)
| ~ axis_compatible(A,B,C,D) ),
inference(split_conjunct,[status(thm)],[sk_axis_compatible_def]) ).
fof(compatible_hyp,axiom,
axis_compatible(n0,n10,n5,n10),
file('theBenchmark.p',compatible_hyp) ).
cnf(c_65,plain,
axis_compatible(n0,n10,n5,n10),
inference(clausify,[status(thm)],[compatible_hyp]) ).
cnf(c_66,plain,
( in_closed(sK0(A,B,C,D),A,B)
| ~ axis_compatible(A,B,C,D) ),
inference(split_conjunct,[status(thm)],[sk_axis_compatible_def]) ).
cnf(c_75,plain,
in_closed(sK0(n0,n10,n5,n10),n0,n10),
inference(resolve,[status(thm)],[c_66,c_65]) ).
cnf(c_77,plain,
in_closed(sK0(n0,n10,n5,n10),n5,n10),
inference(resolve,[status(thm)],[c_63,c_65]) ).
cnf(c_119,negated_conjecture,
( ~ in_closed(A,n5,n10)
| ~ in_closed(A,n0,n10) ),
inference(clausify,[status(thm)],[no_false_compatible_neg]) ).
cnf(c_206,negated_conjecture,
~ in_closed(sK0(n0,n10,n5,n10),n5,n10),
inference(resolve,[status(thm)],[c_119,c_75]) ).
cnf(c_205,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_77,c_206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT073+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 00:11:29 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 3238239 was started by sandbox on n011,
% 0.09/0.37 % Sat Sep 26 00:11:29 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.09/0.40
% 0.09/0.40 % SZS status Theorem for theBenchmark
% 0.09/0.40
% 0.09/0.40 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.40 % Length of proof is 9.
% 0.09/0.40 % Level of proof is 3.
% 0.09/0.40 % Maximum clause weight is 18.000.
% 0.09/0.40 % Given clauses 39.
% 0.09/0.40
% 0.09/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------