%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL386-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 : 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 : Sun Sep 27 07:58:46 AM UTC 2026
% Result : Unsatisfiable 12.73s 7.13s
% Output : CNFRefutation 12.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 5
% Syntax : Number of formulae : 69 ( 38 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 68 ( 35 ~; 33 |; 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 : 187 ( 29 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_48,axiom,
~ is_a_theorem(implies(implies(not(x),y),implies(not(y),x))),
file('theBenchmark.p',prove_cn_48) ).
cnf(c_5,plain,
~ is_a_theorem(implies(implies(not(x),y),implies(not(y),x))),
inference(clausify,[status(thm)],[prove_cn_48]) ).
cnf(c_12632,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_12632,c_2]) ).
cnf(c_12633,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_12633,c_3]) ).
cnf(c_12634,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_12634,c_4]) ).
cnf(c_12635,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_12635,c_6]) ).
cnf(c_12636,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_12636,c_6]) ).
cnf(c_12637,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_32,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_12637,c_9]) ).
cnf(c_12638,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_37,plain,
is_a_theorem(implies(A,A)),
inference(resolve,[status(thm)],[c_12638,c_3]) ).
cnf(c_12639,plain,
( is_a_theorem(implies(not(A),B))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_39,plain,
is_a_theorem(implies(not(implies(A,A)),B)),
inference(resolve,[status(thm)],[c_12639,c_37]) ).
cnf(c_12640,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_46,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))),
inference(resolve,[status(thm)],[c_12640,c_32]) ).
cnf(c_12641,plain,
( is_a_theorem(implies(B,implies(A,C)))
| ~ is_a_theorem(implies(A,not(B))) ),
inference(resolve,[status(thm)],[c_1,c_32]) ).
cnf(c_47,plain,
is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
inference(resolve,[status(thm)],[c_12641,c_39]) ).
cnf(c_12642,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_80,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))),
inference(resolve,[status(thm)],[c_12642,c_7]) ).
cnf(c_12643,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_80]) ).
cnf(c_240,plain,
is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))),
inference(resolve,[status(thm)],[c_12643,c_47]) ).
cnf(c_12644,plain,
( is_a_theorem(implies(C,B))
| ~ is_a_theorem(implies(implies(A,A),B)) ),
inference(resolve,[status(thm)],[c_1,c_240]) ).
cnf(c_263,plain,
is_a_theorem(implies(A,implies(implies(not(B),B),B))),
inference(resolve,[status(thm)],[c_12644,c_7]) ).
cnf(c_12645,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_518,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
inference(resolve,[status(thm)],[c_12645,c_263]) ).
cnf(c_12646,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_46]) ).
cnf(c_1045,plain,
is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))),
inference(resolve,[status(thm)],[c_12646,c_518]) ).
cnf(c_12647,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_1080,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(resolve,[status(thm)],[c_12647,c_1045]) ).
cnf(c_12648,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_80]) ).
cnf(c_1205,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(resolve,[status(thm)],[c_12648,c_1080]) ).
cnf(c_12649,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_1205]) ).
cnf(c_1328,plain,
is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_12649,c_1045]) ).
cnf(c_12650,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_80]) ).
cnf(c_1348,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
inference(resolve,[status(thm)],[c_12650,c_1328]) ).
cnf(c_12651,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_518]) ).
cnf(c_1552,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
inference(resolve,[status(thm)],[c_12651,c_1348]) ).
cnf(c_12652,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_3086,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
inference(resolve,[status(thm)],[c_12652,c_1552]) ).
cnf(c_12653,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_3172,plain,
is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))),
inference(resolve,[status(thm)],[c_12653,c_3086]) ).
cnf(c_12654,plain,
( is_a_theorem(implies(A,B))
| ~ is_a_theorem(implies(A,implies(A,B))) ),
inference(resolve,[status(thm)],[c_1,c_3086]) ).
cnf(c_3175,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))),
inference(resolve,[status(thm)],[c_12654,c_518]) ).
cnf(c_12655,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_1205]) ).
cnf(c_3394,plain,
is_a_theorem(implies(A,implies(implies(A,B),B))),
inference(resolve,[status(thm)],[c_12655,c_3172]) ).
cnf(c_12656,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_3479,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_12656,c_3394]) ).
cnf(c_12657,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_9975,plain,
is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))),
inference(resolve,[status(thm)],[c_12657,c_3175]) ).
cnf(c_12658,plain,
( is_a_theorem(implies(B,implies(A,C)))
| ~ is_a_theorem(implies(A,implies(B,C))) ),
inference(resolve,[status(thm)],[c_1,c_3479]) ).
cnf(c_10004,plain,
is_a_theorem(implies(implies(A,B),implies(implies(not(B),A),B))),
inference(resolve,[status(thm)],[c_12658,c_9975]) ).
cnf(c_12659,plain,
( is_a_theorem(implies(not(A),C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_1348]) ).
cnf(c_12411,plain,
is_a_theorem(implies(not(A),implies(implies(not(B),A),B))),
inference(resolve,[status(thm)],[c_12659,c_10004]) ).
cnf(c_12660,plain,
( is_a_theorem(implies(B,implies(A,C)))
| ~ is_a_theorem(implies(A,implies(B,C))) ),
inference(resolve,[status(thm)],[c_1,c_3479]) ).
cnf(c_12630,plain,
is_a_theorem(implies(implies(not(A),B),implies(not(B),A))),
inference(resolve,[status(thm)],[c_12660,c_12411]) ).
cnf(c_12631,plain,
$false,
inference(resolve,[status(thm)],[c_12630,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL386-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.11/5.38 % Computer : n002.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Fri Sep 25 22:26:43 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.38 % Process 159054 was started by sandbox2 on n002,
% 0.11/5.38 % Fri Sep 25 22:26:43 2026
% 0.11/5.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/5.39
% 0.11/5.39 % From the command line: assign(max_seconds, 300).
% 12.73/7.13
% 12.73/7.13 % SZS status Unsatisfiable for theBenchmark
% 12.73/7.13
% 12.73/7.13 % Proof 1 at 1.32 (+ 0.41) seconds.
% 12.73/7.13 % Length of proof is 35.
% 12.73/7.13 % Level of proof is 21.
% 12.73/7.13 % Maximum clause weight is 62.000.
% 12.73/7.13 % Given clauses 326.
% 12.73/7.13
% 12.73/7.13 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------