%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL051-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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 07:57:50 AM UTC 2026
% Result : Unsatisfiable 2.12s 0.74s
% Output : CNFRefutation 2.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 5
% Syntax : Number of formulae : 63 ( 35 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 32 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 173 ( 32 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_22,axiom,
~ is_a_theorem(implies(implies(b,c),implies(implies(a,b),implies(a,c)))),
file('theBenchmark.p',prove_cn_22) ).
cnf(c_5,plain,
~ is_a_theorem(implies(implies(b,c),implies(implies(a,b),implies(a,c)))),
inference(clausify,[status(thm)],[prove_cn_22]) ).
cnf(c_2348,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_2348,c_2]) ).
cnf(c_2349,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_2349,c_3]) ).
cnf(c_2350,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_2350,c_4]) ).
cnf(c_2351,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_26,plain,
is_a_theorem(implies(A,A)),
inference(resolve,[status(thm)],[c_2351,c_3]) ).
cnf(c_2352,plain,
( is_a_theorem(implies(not(A),B))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_28,plain,
is_a_theorem(implies(not(implies(A,A)),B)),
inference(resolve,[status(thm)],[c_2352,c_26]) ).
cnf(c_2353,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_31,plain,
is_a_theorem(implies(implies(A,B),implies(not(implies(C,C)),B))),
inference(resolve,[status(thm)],[c_2353,c_28]) ).
cnf(c_2354,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_45,plain,
is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
inference(resolve,[status(thm)],[c_2354,c_31]) ).
cnf(c_2355,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_91,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))),
inference(resolve,[status(thm)],[c_2355,c_6]) ).
cnf(c_2356,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_97,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_2356,c_9]) ).
cnf(c_2357,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_107,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))),
inference(resolve,[status(thm)],[c_2357,c_97]) ).
cnf(c_2358,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_91]) ).
cnf(c_243,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))),
inference(resolve,[status(thm)],[c_2358,c_7]) ).
cnf(c_2359,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_243]) ).
cnf(c_314,plain,
is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))),
inference(resolve,[status(thm)],[c_2359,c_45]) ).
cnf(c_2360,plain,
( is_a_theorem(implies(C,B))
| ~ is_a_theorem(implies(implies(A,A),B)) ),
inference(resolve,[status(thm)],[c_1,c_314]) ).
cnf(c_338,plain,
is_a_theorem(implies(A,implies(implies(not(B),B),B))),
inference(resolve,[status(thm)],[c_2360,c_7]) ).
cnf(c_2361,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_91]) ).
cnf(c_455,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
inference(resolve,[status(thm)],[c_2361,c_338]) ).
cnf(c_2362,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_107]) ).
cnf(c_808,plain,
is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))),
inference(resolve,[status(thm)],[c_2362,c_455]) ).
cnf(c_2363,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_835,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(resolve,[status(thm)],[c_2363,c_808]) ).
cnf(c_2364,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_243]) ).
cnf(c_846,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(resolve,[status(thm)],[c_2364,c_835]) ).
cnf(c_2365,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_846]) ).
cnf(c_950,plain,
is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_2365,c_808]) ).
cnf(c_2366,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_243]) ).
cnf(c_968,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
inference(resolve,[status(thm)],[c_2366,c_950]) ).
cnf(c_2367,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_455]) ).
cnf(c_1032,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
inference(resolve,[status(thm)],[c_2367,c_968]) ).
cnf(c_2368,plain,
( is_a_theorem(implies(implies(implies(B,C),B),B))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_1032]) ).
cnf(c_1963,plain,
is_a_theorem(implies(implies(implies(A,B),A),A)),
inference(resolve,[status(thm)],[c_2368,c_1032]) ).
cnf(c_2369,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_2000,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
inference(resolve,[status(thm)],[c_2369,c_1963]) ).
cnf(c_2370,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_2021,plain,
is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))),
inference(resolve,[status(thm)],[c_2370,c_2000]) ).
cnf(c_2371,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_846]) ).
cnf(c_2074,plain,
is_a_theorem(implies(A,implies(implies(A,B),B))),
inference(resolve,[status(thm)],[c_2371,c_2021]) ).
cnf(c_2372,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_91]) ).
cnf(c_2126,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_2372,c_2074]) ).
cnf(c_2373,plain,
( is_a_theorem(implies(B,implies(A,C)))
| ~ is_a_theorem(implies(A,implies(B,C))) ),
inference(resolve,[status(thm)],[c_1,c_2126]) ).
cnf(c_2346,plain,
is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))),
inference(resolve,[status(thm)],[c_2373,c_2]) ).
cnf(c_2347,plain,
$false,
inference(resolve,[status(thm)],[c_2346,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL051-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 21:46:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 2985730 was started by sandbox2 on n011,
% 0.10/0.38 % Fri Sep 25 21:46:28 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 2.12/0.74
% 2.12/0.74 % SZS status Unsatisfiable for theBenchmark
% 2.12/0.74
% 2.12/0.74 % Proof 1 at 0.24 (+ 0.11) seconds.
% 2.12/0.74 % Length of proof is 32.
% 2.12/0.74 % Level of proof is 21.
% 2.12/0.74 % Maximum clause weight is 41.000.
% 2.12/0.74 % Given clauses 120.
% 2.12/0.74
% 2.12/0.74 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------