%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL055-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 : n010.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:51 AM UTC 2026
% Result : Unsatisfiable 0.23s 0.83s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 47 ( 27 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 24 ~; 22 |; 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 : 126 ( 24 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_37,axiom,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(not(a),c))),
file('theBenchmark.p',prove_cn_37) ).
cnf(c_5,plain,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(not(a),c))),
inference(clausify,[status(thm)],[prove_cn_37]) ).
cnf(c_1350,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_1350,c_2]) ).
cnf(c_1351,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_1351,c_3]) ).
cnf(c_1352,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_1352,c_4]) ).
cnf(c_1353,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_1353,c_6]) ).
cnf(c_1354,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_1354,c_9]) ).
cnf(c_1355,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_1355,c_3]) ).
cnf(c_1356,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_1356,c_37]) ).
cnf(c_1357,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_1357,c_32]) ).
cnf(c_1358,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_1358,c_39]) ).
cnf(c_1359,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_1359,c_7]) ).
cnf(c_1360,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_1360,c_47]) ).
cnf(c_1361,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_1361,c_7]) ).
cnf(c_1362,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_1362,c_263]) ).
cnf(c_1363,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_1363,c_518]) ).
cnf(c_1364,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_1364,c_1045]) ).
cnf(c_1365,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_1365,c_1080]) ).
cnf(c_1366,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_1366,c_1045]) ).
cnf(c_1367,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_1367,c_1328]) ).
cnf(c_1349,plain,
$false,
inference(resolve,[status(thm)],[c_1348,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL055-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.65 % Computer : n010.cluster.edu
% 0.18/0.65 % Model : x86_64 x86_64
% 0.18/0.65 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.65 % Memory : 8046.5625MB
% 0.18/0.65 % OS : Linux 6.8.0-71-generic
% 0.18/0.65 % CPULimit : 300
% 0.18/0.65 % WCLimit : 300
% 0.18/0.65 % DateTime : Fri Sep 25 21:47:15 UTC 2026
% 0.18/0.66 % CPUTime :
% 0.18/0.66 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.66 % Process 1769415 was started by sandbox2 on n010,
% 0.18/0.66 % Fri Sep 25 21:47:15 2026
% 0.18/0.66 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.67
% 0.18/0.67 % From the command line: assign(max_seconds, 300).
% 0.23/0.83
% 0.23/0.83 % SZS status Unsatisfiable for theBenchmark
% 0.23/0.83
% 0.23/0.83 % Proof 1 at 0.09 (+ 0.06) seconds.
% 0.23/0.83 % Length of proof is 24.
% 0.23/0.83 % Level of proof is 13.
% 0.23/0.83 % Maximum clause weight is 41.000.
% 0.23/0.83 % Given clauses 86.
% 0.23/0.83
% 0.23/0.83 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------