%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL396-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 : n013.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:48 AM UTC 2026
% Result : Unsatisfiable 1.18s 0.88s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of formulae : 59 ( 33 unt; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 30 ~; 28 |; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 159 ( 27 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_62,axiom,
~ is_a_theorem(implies(implies(not(not(x)),y),implies(x,y))),
file('theBenchmark.p',prove_cn_62) ).
cnf(c_5,plain,
~ is_a_theorem(implies(implies(not(not(x)),y),implies(x,y))),
inference(clausify,[status(thm)],[prove_cn_62]) ).
cnf(c_1255,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_1255,c_2]) ).
cnf(c_1256,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_1256,c_3]) ).
cnf(c_1257,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_1257,c_4]) ).
cnf(c_1258,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_1258,c_6]) ).
cnf(c_1259,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_29,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_1259,c_9]) ).
cnf(c_1260,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_34,plain,
is_a_theorem(implies(A,A)),
inference(resolve,[status(thm)],[c_1260,c_3]) ).
cnf(c_1261,plain,
( is_a_theorem(implies(not(A),B))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_36,plain,
is_a_theorem(implies(not(implies(A,A)),B)),
inference(resolve,[status(thm)],[c_1261,c_34]) ).
cnf(c_1262,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_43,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))),
inference(resolve,[status(thm)],[c_1262,c_29]) ).
cnf(c_1263,plain,
( is_a_theorem(implies(B,implies(A,C)))
| ~ is_a_theorem(implies(A,not(B))) ),
inference(resolve,[status(thm)],[c_1,c_29]) ).
cnf(c_44,plain,
is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
inference(resolve,[status(thm)],[c_1263,c_36]) ).
cnf(c_1264,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_127,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))),
inference(resolve,[status(thm)],[c_1264,c_7]) ).
cnf(c_1265,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_43]) ).
cnf(c_175,plain,
is_a_theorem(implies(implies(not(A),not(B)),implies(implies(A,C),implies(B,C)))),
inference(resolve,[status(thm)],[c_1265,c_127]) ).
cnf(c_1266,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_127]) ).
cnf(c_184,plain,
is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))),
inference(resolve,[status(thm)],[c_1266,c_44]) ).
cnf(c_1267,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_127]) ).
cnf(c_189,plain,
is_a_theorem(implies(implies(A,B),implies(implies(implies(C,C),A),B))),
inference(resolve,[status(thm)],[c_1267,c_184]) ).
cnf(c_1268,plain,
( is_a_theorem(implies(C,B))
| ~ is_a_theorem(implies(implies(A,A),B)) ),
inference(resolve,[status(thm)],[c_1,c_184]) ).
cnf(c_205,plain,
is_a_theorem(implies(A,implies(implies(not(B),B),B))),
inference(resolve,[status(thm)],[c_1268,c_7]) ).
cnf(c_1269,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_415,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
inference(resolve,[status(thm)],[c_1269,c_205]) ).
cnf(c_1270,plain,
( is_a_theorem(implies(implies(implies(C,C),A),B))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_1,c_189]) ).
cnf(c_479,plain,
is_a_theorem(implies(implies(implies(A,A),implies(not(B),B)),B)),
inference(resolve,[status(thm)],[c_1270,c_3]) ).
cnf(c_1271,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_43]) ).
cnf(c_657,plain,
is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)),
inference(resolve,[status(thm)],[c_1271,c_479]) ).
cnf(c_1272,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_43]) ).
cnf(c_907,plain,
is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))),
inference(resolve,[status(thm)],[c_1272,c_415]) ).
cnf(c_1273,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_939,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(resolve,[status(thm)],[c_1273,c_907]) ).
cnf(c_1274,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_127]) ).
cnf(c_980,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(resolve,[status(thm)],[c_1274,c_939]) ).
cnf(c_1275,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_980]) ).
cnf(c_1092,plain,
is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_1275,c_907]) ).
cnf(c_1276,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_127]) ).
cnf(c_1111,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
inference(resolve,[status(thm)],[c_1276,c_1092]) ).
cnf(c_1277,plain,
( is_a_theorem(implies(not(A),C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_1111]) ).
cnf(c_1222,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(resolve,[status(thm)],[c_1277,c_657]) ).
cnf(c_1278,plain,
( is_a_theorem(implies(implies(A,C),implies(B,C)))
| ~ is_a_theorem(implies(not(A),not(B))) ),
inference(resolve,[status(thm)],[c_1,c_175]) ).
cnf(c_1253,plain,
is_a_theorem(implies(implies(not(not(A)),B),implies(A,B))),
inference(resolve,[status(thm)],[c_1278,c_1222]) ).
cnf(c_1254,plain,
$false,
inference(resolve,[status(thm)],[c_1253,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL396-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43 % Computer : n013.cluster.edu
% 0.10/0.43 % Model : x86_64 x86_64
% 0.10/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.43 % Memory : 8046.5625MB
% 0.10/0.43 % OS : Linux 6.8.0-71-generic
% 0.10/0.43 % CPULimit : 300
% 0.10/0.43 % WCLimit : 300
% 0.10/0.43 % DateTime : Fri Sep 25 22:26:06 UTC 2026
% 0.10/0.44 % CPUTime :
% 0.10/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.44 % Process 1374398 was started by sandbox on n013,
% 0.10/0.44 % Fri Sep 25 22:26:06 2026
% 0.10/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.45
% 0.10/0.45 % From the command line: assign(max_seconds, 300).
% 1.18/0.88
% 1.18/0.88 % SZS status Unsatisfiable for theBenchmark
% 1.18/0.88
% 1.18/0.88 % Proof 1 at 0.12 (+ 0.05) seconds.
% 1.18/0.88 % Length of proof is 30.
% 1.18/0.88 % Level of proof is 15.
% 1.18/0.88 % Maximum clause weight is 41.000.
% 1.18/0.88 % Given clauses 85.
% 1.18/0.88
% 1.18/0.88 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------