%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL402-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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 07:58:49 AM UTC 2026
% Result : Unsatisfiable 4.95s 1.07s
% Output : CNFRefutation 4.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of formulae : 71 ( 39 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 36 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 186 ( 35 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(condensed_detachment,axiom,
! [VAR_0,VAR_1] :
( is_a_theorem(VAR_1)
| ~ is_a_theorem(VAR_0)
| ~ is_a_theorem(implies(VAR_0,VAR_1)) ),
file('theBenchmark.p',condensed_detachment) ).
cnf(c_1,plain,
( is_a_theorem(B)
| ~ is_a_theorem(A)
| ~ is_a_theorem(implies(A,B)) ),
inference(clausify,[status(thm)],[condensed_detachment]) ).
fof(cn_1,axiom,
! [VAR_0,VAR_1,VAR_2] : is_a_theorem(implies(implies(VAR_0,VAR_1),implies(implies(VAR_1,VAR_2),implies(VAR_0,VAR_2)))),
file('theBenchmark.p',cn_1) ).
cnf(c_2,plain,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
inference(clausify,[status(thm)],[cn_1]) ).
fof(cn_2,axiom,
! [VAR_0] : is_a_theorem(implies(implies(not(VAR_0),VAR_0),VAR_0)),
file('theBenchmark.p',cn_2) ).
cnf(c_3,plain,
is_a_theorem(implies(implies(not(A),A),A)),
inference(clausify,[status(thm)],[cn_2]) ).
fof(cn_3,axiom,
! [VAR_0,VAR_1] : is_a_theorem(implies(VAR_0,implies(not(VAR_0),VAR_1))),
file('theBenchmark.p',cn_3) ).
cnf(c_4,plain,
is_a_theorem(implies(A,implies(not(A),B))),
inference(clausify,[status(thm)],[cn_3]) ).
fof(prove_cn_68,axiom,
~ is_a_theorem(implies(not(implies(x,not(y))),y)),
file('theBenchmark.p',prove_cn_68) ).
cnf(c_5,plain,
~ is_a_theorem(implies(not(implies(x,not(y))),y)),
inference(clausify,[status(thm)],[prove_cn_68]) ).
cnf(c_3020,plain,
( is_a_theorem(implies(implies(B,C),implies(A,C)))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_6,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))),
inference(resolve,[status(thm)],[c_3020,c_2]) ).
cnf(c_3021,plain,
( is_a_theorem(implies(implies(B,C),implies(A,C)))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_7,plain,
is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))),
inference(resolve,[status(thm)],[c_3021,c_3]) ).
cnf(c_3022,plain,
( is_a_theorem(implies(implies(B,C),implies(A,C)))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_9,plain,
is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))),
inference(resolve,[status(thm)],[c_3022,c_4]) ).
cnf(c_3023,plain,
( is_a_theorem(implies(implies(C,A),D))
| ~ is_a_theorem(implies(implies(implies(A,B),implies(C,B)),D)) ),
inference(resolve,[status(thm)],[c_1,c_6]) ).
cnf(c_12,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))),
inference(resolve,[status(thm)],[c_3023,c_6]) ).
cnf(c_3024,plain,
( is_a_theorem(implies(implies(not(A),A),B))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_1,c_7]) ).
cnf(c_21,plain,
is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))),
inference(resolve,[status(thm)],[c_3024,c_6]) ).
cnf(c_3025,plain,
( is_a_theorem(implies(implies(C,A),D))
| ~ is_a_theorem(implies(implies(implies(A,B),implies(C,B)),D)) ),
inference(resolve,[status(thm)],[c_1,c_6]) ).
cnf(c_29,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_3025,c_9]) ).
cnf(c_3026,plain,
( is_a_theorem(implies(A,C))
| ~ is_a_theorem(implies(implies(not(A),B),C)) ),
inference(resolve,[status(thm)],[c_1,c_9]) ).
cnf(c_34,plain,
is_a_theorem(implies(A,A)),
inference(resolve,[status(thm)],[c_3026,c_3]) ).
cnf(c_3027,plain,
( is_a_theorem(implies(not(A),B))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_36,plain,
is_a_theorem(implies(not(implies(A,A)),B)),
inference(resolve,[status(thm)],[c_3027,c_34]) ).
cnf(c_3028,plain,
( is_a_theorem(implies(implies(B,C),implies(A,C)))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_43,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))),
inference(resolve,[status(thm)],[c_3028,c_29]) ).
cnf(c_3029,plain,
( is_a_theorem(implies(B,implies(A,C)))
| ~ is_a_theorem(implies(A,not(B))) ),
inference(resolve,[status(thm)],[c_1,c_29]) ).
cnf(c_44,plain,
is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
inference(resolve,[status(thm)],[c_3029,c_36]) ).
cnf(c_3030,plain,
( is_a_theorem(implies(implies(D,B),implies(A,implies(D,C))))
| ~ is_a_theorem(implies(A,implies(B,C))) ),
inference(resolve,[status(thm)],[c_1,c_12]) ).
cnf(c_127,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))),
inference(resolve,[status(thm)],[c_3030,c_7]) ).
cnf(c_3031,plain,
( is_a_theorem(implies(implies(B,C),implies(A,C)))
| ~ is_a_theorem(implies(A,implies(not(B),B))) ),
inference(resolve,[status(thm)],[c_1,c_127]) ).
cnf(c_184,plain,
is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))),
inference(resolve,[status(thm)],[c_3031,c_44]) ).
cnf(c_3032,plain,
( is_a_theorem(implies(implies(B,C),implies(A,C)))
| ~ is_a_theorem(implies(A,implies(not(B),B))) ),
inference(resolve,[status(thm)],[c_1,c_127]) ).
cnf(c_189,plain,
is_a_theorem(implies(implies(A,B),implies(implies(implies(C,C),A),B))),
inference(resolve,[status(thm)],[c_3032,c_184]) ).
cnf(c_3033,plain,
( is_a_theorem(implies(C,B))
| ~ is_a_theorem(implies(implies(A,A),B)) ),
inference(resolve,[status(thm)],[c_1,c_184]) ).
cnf(c_205,plain,
is_a_theorem(implies(A,implies(implies(not(B),B),B))),
inference(resolve,[status(thm)],[c_3033,c_7]) ).
cnf(c_3034,plain,
( is_a_theorem(implies(implies(D,B),implies(A,implies(D,C))))
| ~ is_a_theorem(implies(A,implies(B,C))) ),
inference(resolve,[status(thm)],[c_1,c_12]) ).
cnf(c_415,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
inference(resolve,[status(thm)],[c_3034,c_205]) ).
cnf(c_3035,plain,
( is_a_theorem(implies(implies(implies(C,C),A),B))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_1,c_189]) ).
cnf(c_479,plain,
is_a_theorem(implies(implies(implies(A,A),implies(not(B),B)),B)),
inference(resolve,[status(thm)],[c_3035,c_3]) ).
cnf(c_3036,plain,
( is_a_theorem(implies(implies(B,not(A)),D))
| ~ is_a_theorem(implies(implies(A,implies(B,C)),D)) ),
inference(resolve,[status(thm)],[c_1,c_43]) ).
cnf(c_657,plain,
is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)),
inference(resolve,[status(thm)],[c_3036,c_479]) ).
cnf(c_3037,plain,
( is_a_theorem(implies(implies(B,not(A)),D))
| ~ is_a_theorem(implies(implies(A,implies(B,C)),D)) ),
inference(resolve,[status(thm)],[c_1,c_43]) ).
cnf(c_907,plain,
is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))),
inference(resolve,[status(thm)],[c_3037,c_415]) ).
cnf(c_3038,plain,
( is_a_theorem(implies(A,C))
| ~ is_a_theorem(implies(implies(not(A),B),C)) ),
inference(resolve,[status(thm)],[c_1,c_9]) ).
cnf(c_939,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(resolve,[status(thm)],[c_3038,c_907]) ).
cnf(c_3039,plain,
( is_a_theorem(implies(implies(B,C),implies(A,C)))
| ~ is_a_theorem(implies(A,implies(not(B),B))) ),
inference(resolve,[status(thm)],[c_1,c_127]) ).
cnf(c_980,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(resolve,[status(thm)],[c_3039,c_939]) ).
cnf(c_3040,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_980]) ).
cnf(c_1092,plain,
is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_3040,c_907]) ).
cnf(c_3041,plain,
( is_a_theorem(implies(implies(B,C),implies(A,C)))
| ~ is_a_theorem(implies(A,implies(not(B),B))) ),
inference(resolve,[status(thm)],[c_1,c_127]) ).
cnf(c_1111,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
inference(resolve,[status(thm)],[c_3041,c_1092]) ).
cnf(c_3042,plain,
( is_a_theorem(implies(C,implies(A,B)))
| ~ is_a_theorem(implies(A,implies(not(B),B))) ),
inference(resolve,[status(thm)],[c_1,c_415]) ).
cnf(c_1207,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
inference(resolve,[status(thm)],[c_3042,c_1111]) ).
cnf(c_3043,plain,
( is_a_theorem(implies(not(A),C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_1111]) ).
cnf(c_1222,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(resolve,[status(thm)],[c_3043,c_657]) ).
cnf(c_3044,plain,
( is_a_theorem(implies(C,implies(B,A)))
| ~ is_a_theorem(implies(not(A),not(B))) ),
inference(resolve,[status(thm)],[c_1,c_907]) ).
cnf(c_1245,plain,
is_a_theorem(implies(A,implies(B,not(not(B))))),
inference(resolve,[status(thm)],[c_3044,c_1222]) ).
cnf(c_3045,plain,
( is_a_theorem(implies(B,not(not(B))))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_1245]) ).
cnf(c_1686,plain,
is_a_theorem(implies(A,not(not(A)))),
inference(resolve,[status(thm)],[c_3045,c_1245]) ).
cnf(c_3046,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_980]) ).
cnf(c_1732,plain,
is_a_theorem(implies(A,not(not(implies(B,A))))),
inference(resolve,[status(thm)],[c_3046,c_1686]) ).
cnf(c_3047,plain,
( is_a_theorem(implies(implies(C,A),D))
| ~ is_a_theorem(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D))) ),
inference(resolve,[status(thm)],[c_1,c_21]) ).
cnf(c_2849,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
inference(resolve,[status(thm)],[c_3047,c_1207]) ).
cnf(c_3048,plain,
( is_a_theorem(implies(A,B))
| ~ is_a_theorem(implies(A,implies(A,B))) ),
inference(resolve,[status(thm)],[c_1,c_2849]) ).
cnf(c_2934,plain,
is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))),
inference(resolve,[status(thm)],[c_3048,c_907]) ).
cnf(c_3049,plain,
( is_a_theorem(implies(B,A))
| ~ is_a_theorem(implies(not(A),not(B))) ),
inference(resolve,[status(thm)],[c_1,c_2934]) ).
cnf(c_3018,plain,
is_a_theorem(implies(not(implies(A,not(B))),B)),
inference(resolve,[status(thm)],[c_3049,c_1732]) ).
cnf(c_3019,plain,
$false,
inference(resolve,[status(thm)],[c_3018,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL402-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n009.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 22:27:14 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 2717916 was started by sandbox2 on n009,
% 0.08/0.36 % Fri Sep 25 22:27:14 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 4.95/1.07
% 4.95/1.07 % SZS status Unsatisfiable for theBenchmark
% 4.95/1.07
% 4.95/1.07 % Proof 1 at 0.44 (+ 0.24) seconds.
% 4.95/1.07 % Length of proof is 36.
% 4.95/1.07 % Level of proof is 18.
% 4.95/1.07 % Maximum clause weight is 62.000.
% 4.95/1.07 % Given clauses 136.
% 4.95/1.07
% 4.95/1.07 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------