%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL367-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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:40 AM UTC 2026
% Result : Unsatisfiable 0.81s 0.49s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 25 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 22 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 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 : 111 ( 25 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_17,axiom,
~ is_a_theorem(implies(x,implies(implies(y,x),x))),
file('theBenchmark.p',prove_cn_17) ).
cnf(c_5,plain,
~ is_a_theorem(implies(x,implies(implies(y,x),x))),
inference(clausify,[status(thm)],[prove_cn_17]) ).
cnf(c_799,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_799,c_2]) ).
cnf(c_800,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_800,c_3]) ).
cnf(c_801,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_801,c_4]) ).
cnf(c_802,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_802,c_6]) ).
cnf(c_803,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_17,plain,
is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))),
inference(resolve,[status(thm)],[c_803,c_7]) ).
cnf(c_804,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_804,c_9]) ).
cnf(c_805,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_805,c_3]) ).
cnf(c_806,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_806,c_37]) ).
cnf(c_807,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_50,plain,
is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
inference(resolve,[status(thm)],[c_807,c_39]) ).
cnf(c_808,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_54,plain,
is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))),
inference(resolve,[status(thm)],[c_808,c_50]) ).
cnf(c_809,plain,
( is_a_theorem(implies(D,C))
| ~ is_a_theorem(implies(implies(not(implies(A,A)),B),C)) ),
inference(resolve,[status(thm)],[c_1,c_54]) ).
cnf(c_205,plain,
is_a_theorem(implies(A,implies(implies(not(B),B),B))),
inference(resolve,[status(thm)],[c_809,c_17]) ).
cnf(c_810,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_263,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
inference(resolve,[status(thm)],[c_810,c_205]) ).
cnf(c_811,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_409,plain,
is_a_theorem(implies(implies(not(A),B),implies(C,implies(implies(B,A),A)))),
inference(resolve,[status(thm)],[c_811,c_263]) ).
cnf(c_812,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_721,plain,
is_a_theorem(implies(A,implies(B,implies(implies(C,A),A)))),
inference(resolve,[status(thm)],[c_812,c_409]) ).
cnf(c_813,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_263]) ).
cnf(c_744,plain,
is_a_theorem(implies(A,implies(B,implies(implies(C,B),B)))),
inference(resolve,[status(thm)],[c_813,c_721]) ).
cnf(c_814,plain,
( is_a_theorem(implies(B,implies(implies(C,B),B)))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_744]) ).
cnf(c_797,plain,
is_a_theorem(implies(A,implies(implies(B,A),A))),
inference(resolve,[status(thm)],[c_814,c_744]) ).
cnf(c_798,plain,
$false,
inference(resolve,[status(thm)],[c_797,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL367-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n005.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 25 22:19:31 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 406030 was started by sandbox on n005,
% 0.08/0.35 % Fri Sep 25 22:19:31 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.35
% 0.08/0.35 % From the command line: assign(max_seconds, 300).
% 0.81/0.49
% 0.81/0.49 % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.81/0.49
% 0.81/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.81/0.49
% 0.81/0.49 % Proof 1 at 0.07 (+ 0.03) seconds.
% 0.81/0.49 % Length of proof is 22.
% 0.81/0.49 % Level of proof is 12.
% 0.81/0.49 % Maximum clause weight is 53.000.
% 0.81/0.49 % Given clauses 66.
% 0.81/0.49
% 0.81/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------