%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL050-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 : n026.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 1.92s 0.64s
% Output : CNFRefutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 5
% Syntax : Number of formulae : 67 ( 37 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 34 ~; 32 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 182 ( 43 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_21,axiom,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
file('theBenchmark.p',prove_cn_21) ).
cnf(c_5,plain,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
inference(clausify,[status(thm)],[prove_cn_21]) ).
cnf(c_1543,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_1543,c_2]) ).
cnf(c_1544,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_1544,c_3]) ).
cnf(c_1545,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_1545,c_4]) ).
cnf(c_1546,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_1546,c_6]) ).
cnf(c_1547,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_1547,c_7]) ).
cnf(c_1548,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_1548,c_9]) ).
cnf(c_1549,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_1549,c_3]) ).
cnf(c_1550,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_1550,c_37]) ).
cnf(c_1551,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_1551,c_39]) ).
cnf(c_1552,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_1552,c_50]) ).
cnf(c_1553,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_1553,c_17]) ).
cnf(c_1554,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_206,plain,
is_a_theorem(implies(A,implies(B,B))),
inference(resolve,[status(thm)],[c_1554,c_3]) ).
cnf(c_1555,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_212,plain,
is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))),
inference(resolve,[status(thm)],[c_1555,c_206]) ).
cnf(c_1556,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_1556,c_205]) ).
cnf(c_1557,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_1557,c_263]) ).
cnf(c_1558,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_413,plain,
is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))),
inference(resolve,[status(thm)],[c_1558,c_212]) ).
cnf(c_1559,plain,
( is_a_theorem(implies(implies(implies(B,B),C),C))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_413]) ).
cnf(c_419,plain,
is_a_theorem(implies(implies(implies(A,A),B),B)),
inference(resolve,[status(thm)],[c_1559,c_413]) ).
cnf(c_1560,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_436,plain,
is_a_theorem(implies(A,implies(implies(implies(B,B),not(A)),C))),
inference(resolve,[status(thm)],[c_1560,c_419]) ).
cnf(c_1561,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_1561,c_409]) ).
cnf(c_1562,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_1562,c_721]) ).
cnf(c_1563,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_1563,c_744]) ).
cnf(c_1564,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_821,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(C,implies(A,C)))),
inference(resolve,[status(thm)],[c_1564,c_797]) ).
cnf(c_1565,plain,
( is_a_theorem(implies(C,implies(A,C)))
| ~ is_a_theorem(implies(A,implies(B,C))) ),
inference(resolve,[status(thm)],[c_1,c_821]) ).
cnf(c_860,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(resolve,[status(thm)],[c_1565,c_436]) ).
cnf(c_1566,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_872,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(resolve,[status(thm)],[c_1566,c_860]) ).
cnf(c_1567,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_872]) ).
cnf(c_921,plain,
is_a_theorem(implies(A,implies(B,implies(implies(A,C),C)))),
inference(resolve,[status(thm)],[c_1567,c_409]) ).
cnf(c_1568,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_1260,plain,
is_a_theorem(implies(A,implies(B,implies(implies(B,C),C)))),
inference(resolve,[status(thm)],[c_1568,c_921]) ).
cnf(c_1569,plain,
( is_a_theorem(implies(B,implies(implies(B,C),C)))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_1260]) ).
cnf(c_1505,plain,
is_a_theorem(implies(A,implies(implies(A,B),B))),
inference(resolve,[status(thm)],[c_1569,c_1260]) ).
cnf(c_1570,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_1541,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_1570,c_1505]) ).
cnf(c_1542,plain,
$false,
inference(resolve,[status(thm)],[c_1541,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL050-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.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 21:49:25 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38 % Process 3532154 was started by sandbox2 on n026,
% 0.11/0.38 % Fri Sep 25 21:49:25 2026
% 0.11/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.38
% 0.11/0.38 % From the command line: assign(max_seconds, 300).
% 1.92/0.64
% 1.92/0.64 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 1.92/0.64
% 1.92/0.64 % SZS status Unsatisfiable for theBenchmark
% 1.92/0.64
% 1.92/0.64 % Proof 1 at 0.18 (+ 0.06) seconds.
% 1.92/0.64 % Length of proof is 34.
% 1.92/0.64 % Level of proof is 19.
% 1.92/0.64 % Maximum clause weight is 53.000.
% 1.92/0.64 % Given clauses 93.
% 1.92/0.64
% 1.92/0.64 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------