%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : LCL646+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n002.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 : Mon Sep 7 12:43:04 PM UTC 2026
% Result : Theorem 0.09s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 5 ( 2 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 16 ( 10 avg)
% Number of connectives : 100 ( 55 ~; 29 |; 12 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 27 ( 0 sgn 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| p6(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p4(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p5(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p3(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p1(Y) ) ) ).
fof(subgoal_0,plain,
! [X] :
( ( ~ ~ ! [Y] :
( ~ r1(X,Y)
| p6(Y) )
& ~ ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
& ~ ~ ! [Y] :
( ~ r1(X,Y)
| p4(Y) )
& ~ ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
& ~ ! [Y] :
( ~ r1(X,Y)
| p5(Y) )
& ~ ! [Y] :
( ~ r1(X,Y)
| p3(Y) )
& ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) ) )
=> ! [Y] :
( ~ ~ r1(X,Y)
=> p1(Y) ) ),
inference(strip,[],[main]) ).
fof(negate_0_0,plain,
~ ! [X] :
( ( ~ ~ ! [Y] :
( ~ r1(X,Y)
| p6(Y) )
& ~ ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
& ~ ~ ! [Y] :
( ~ r1(X,Y)
| p4(Y) )
& ~ ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
& ~ ! [Y] :
( ~ r1(X,Y)
| p5(Y) )
& ~ ! [Y] :
( ~ r1(X,Y)
| p3(Y) )
& ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) ) )
=> ! [Y] :
( ~ ~ r1(X,Y)
=> p1(Y) ) ),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
$false,
inference(canonicalize,[],[negate_0_0]) ).
cnf(refute_0_0,plain,
$false,
inference(canonicalize,[],[normalize_0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL646+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : metis --show proof --show saturation %s
% 0.09/0.35 % Computer : n002.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 5 11:44:05 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.09/0.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35
% 0.09/0.35 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.12/0.36
%------------------------------------------------------------------------------