%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT073+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:19:59 AM UTC 2026
% Result : Theorem 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
axis_compatible(n0,n10,n5,n10),
file('MGT073+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ in_closed(u,n5,n10)
| ~ in_closed(u,n0,n10) ),
file('MGT073+1.p',unknown),
[] ).
cnf(55,axiom,
( ~ axis_compatible(u,v,w,x)
| in_closed(skf4(x,w,v,u),u,v) ),
file('MGT073+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ axis_compatible(u,v,w,x)
| in_closed(skf4(x,w,y,z),w,x) ),
file('MGT073+1.p',unknown),
[] ).
cnf(138,plain,
in_closed(skf4(n10,n5,u,v),n5,n10),
inference(res,[status(thm),theory(equality)],[10,56]),
[iquote('0:Res:10.0,56.0')] ).
cnf(142,plain,
~ in_closed(skf4(n10,n5,u,v),n0,n10),
inference(res,[status(thm),theory(equality)],[138,34]),
[iquote('0:Res:138.0,34.0')] ).
cnf(144,plain,
~ axis_compatible(n0,n10,n5,n10),
inference(res,[status(thm),theory(equality)],[55,142]),
[iquote('0:Res:55.1,142.0')] ).
cnf(145,plain,
$false,
inference(mrr,[status(thm)],[144,10]),
[iquote('0:MRR:144.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT073+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.09/0.36 % Computer : n027.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 14:00:15 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.21/0.55
% 0.21/0.55 SPASS V 3.9
% 0.21/0.55 SPASS beiseite: Proof found.
% 0.21/0.55 % SZS status Theorem
% 0.21/0.55 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.55 SPASS derived 58 clauses, backtracked 0 clauses, performed 0 splits and kept 99 clauses.
% 0.21/0.55 SPASS allocated 98175 KBytes.
% 0.21/0.55 SPASS spent 0:00:00.17 on the problem.
% 0.21/0.55 0:00:00.06 for the input.
% 0.21/0.55 0:00:00.06 for the FLOTTER CNF translation.
% 0.21/0.55 0:00:00.00 for inferences.
% 0.21/0.55 0:00:00.00 for the backtracking.
% 0.21/0.55 0:00:00.01 for the reduction.
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 Here is a proof with depth 3, length 8 :
% 0.21/0.55 % SZS output start Refutation
% See solution above
% 0.21/0.55 Formulae used in the proof : compatible_hyp no_false_compatible axis_compatible_def
% 0.21/0.55
%------------------------------------------------------------------------------