%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL069-1 : TPTP v9.3.1. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.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:53 AM UTC 2026
% Result : Unsatisfiable 0.50s 0.57s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% 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 : 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 : 127 ( 30 sgn 11 !; 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_19,axiom,
! [VAR_0,VAR_1,VAR_2] : is_a_theorem(implies(implies(implies(VAR_0,VAR_1),VAR_2),implies(VAR_1,VAR_2))),
file('theBenchmark.p',cn_19) ).
cnf(c_2,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(clausify,[status(thm)],[cn_19]) ).
fof(cn_37,axiom,
! [VAR_0,VAR_1,VAR_2] : is_a_theorem(implies(implies(implies(VAR_0,VAR_1),VAR_2),implies(not(VAR_0),VAR_2))),
file('theBenchmark.p',cn_37) ).
cnf(c_3,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
inference(clausify,[status(thm)],[cn_37]) ).
fof(cn_59,axiom,
! [VAR_0,VAR_1,VAR_2] : is_a_theorem(implies(implies(not(VAR_0),VAR_1),implies(implies(VAR_2,VAR_1),implies(implies(VAR_0,VAR_2),VAR_1)))),
file('theBenchmark.p',cn_59) ).
cnf(c_4,plain,
is_a_theorem(implies(implies(not(A),B),implies(implies(C,B),implies(implies(A,C),B)))),
inference(clausify,[status(thm)],[cn_59]) ).
fof(prove_cn_3,axiom,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('theBenchmark.p',prove_cn_3) ).
cnf(c_5,plain,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(clausify,[status(thm)],[prove_cn_3]) ).
cnf(c_481,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_6,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(resolve,[status(thm)],[c_481,c_2]) ).
cnf(c_482,plain,
( is_a_theorem(implies(not(A),C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_3]) ).
cnf(c_7,plain,
is_a_theorem(implies(not(implies(A,B)),implies(not(A),C))),
inference(resolve,[status(thm)],[c_482,c_3]) ).
cnf(c_483,plain,
( is_a_theorem(implies(not(A),C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_3]) ).
cnf(c_13,plain,
is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_483,c_6]) ).
cnf(c_484,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_14,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(resolve,[status(thm)],[c_484,c_6]) ).
cnf(c_485,plain,
( is_a_theorem(implies(implies(C,B),implies(implies(A,C),B)))
| ~ is_a_theorem(implies(not(A),B)) ),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_19,plain,
is_a_theorem(implies(implies(A,implies(not(B),C)),implies(implies(implies(B,D),A),implies(not(B),C)))),
inference(resolve,[status(thm)],[c_485,c_7]) ).
cnf(c_486,plain,
( is_a_theorem(implies(implies(C,B),implies(implies(A,C),B)))
| ~ is_a_theorem(implies(not(A),B)) ),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_23,plain,
is_a_theorem(implies(implies(A,implies(B,implies(C,not(D)))),implies(implies(D,A),implies(B,implies(C,not(D)))))),
inference(resolve,[status(thm)],[c_486,c_14]) ).
cnf(c_487,plain,
( is_a_theorem(implies(implies(C,B),implies(implies(A,C),B)))
| ~ is_a_theorem(implies(not(A),B)) ),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_36,plain,
is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(implies(C,A),implies(B,implies(C,D))))),
inference(resolve,[status(thm)],[c_487,c_13]) ).
cnf(c_488,plain,
( is_a_theorem(implies(implies(implies(B,D),A),implies(not(B),C)))
| ~ is_a_theorem(implies(A,implies(not(B),C))) ),
inference(resolve,[status(thm)],[c_1,c_19]) ).
cnf(c_108,plain,
is_a_theorem(implies(implies(implies(A,B),not(C)),implies(not(A),implies(C,D)))),
inference(resolve,[status(thm)],[c_488,c_13]) ).
cnf(c_489,plain,
( is_a_theorem(implies(implies(D,A),implies(B,implies(C,not(D)))))
| ~ is_a_theorem(implies(A,implies(B,implies(C,not(D))))) ),
inference(resolve,[status(thm)],[c_1,c_23]) ).
cnf(c_158,plain,
is_a_theorem(implies(implies(A,not(B)),implies(C,implies(B,not(A))))),
inference(resolve,[status(thm)],[c_489,c_13]) ).
cnf(c_490,plain,
( is_a_theorem(implies(implies(D,A),implies(B,implies(C,not(D)))))
| ~ is_a_theorem(implies(A,implies(B,implies(C,not(D))))) ),
inference(resolve,[status(thm)],[c_1,c_23]) ).
cnf(c_174,plain,
is_a_theorem(implies(implies(A,implies(A,not(B))),implies(C,implies(B,not(A))))),
inference(resolve,[status(thm)],[c_490,c_158]) ).
cnf(c_491,plain,
( is_a_theorem(implies(C,implies(B,not(A))))
| ~ is_a_theorem(implies(A,implies(A,not(B)))) ),
inference(resolve,[status(thm)],[c_1,c_174]) ).
cnf(c_225,plain,
is_a_theorem(implies(A,implies(B,not(not(B))))),
inference(resolve,[status(thm)],[c_491,c_6]) ).
cnf(c_492,plain,
( is_a_theorem(implies(C,implies(B,not(A))))
| ~ is_a_theorem(implies(A,implies(A,not(B)))) ),
inference(resolve,[status(thm)],[c_1,c_174]) ).
cnf(c_227,plain,
is_a_theorem(implies(A,implies(not(B),not(B)))),
inference(resolve,[status(thm)],[c_492,c_225]) ).
cnf(c_493,plain,
( is_a_theorem(implies(not(B),not(B)))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_227]) ).
cnf(c_292,plain,
is_a_theorem(implies(not(A),not(A))),
inference(resolve,[status(thm)],[c_493,c_227]) ).
cnf(c_494,plain,
( is_a_theorem(implies(implies(C,B),implies(implies(A,C),B)))
| ~ is_a_theorem(implies(not(A),B)) ),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_301,plain,
is_a_theorem(implies(implies(A,not(B)),implies(implies(B,A),not(B)))),
inference(resolve,[status(thm)],[c_494,c_292]) ).
cnf(c_495,plain,
( is_a_theorem(implies(implies(B,A),not(B)))
| ~ is_a_theorem(implies(A,not(B))) ),
inference(resolve,[status(thm)],[c_1,c_301]) ).
cnf(c_309,plain,
is_a_theorem(implies(implies(A,not(A)),not(A))),
inference(resolve,[status(thm)],[c_495,c_292]) ).
cnf(c_496,plain,
( is_a_theorem(implies(not(A),implies(C,D)))
| ~ is_a_theorem(implies(implies(A,B),not(C))) ),
inference(resolve,[status(thm)],[c_1,c_108]) ).
cnf(c_316,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(resolve,[status(thm)],[c_496,c_309]) ).
cnf(c_497,plain,
( is_a_theorem(implies(implies(C,A),implies(B,implies(C,D))))
| ~ is_a_theorem(implies(A,implies(B,implies(C,D)))) ),
inference(resolve,[status(thm)],[c_1,c_36]) ).
cnf(c_439,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
inference(resolve,[status(thm)],[c_497,c_316]) ).
cnf(c_498,plain,
( is_a_theorem(implies(B,implies(A,C)))
| ~ is_a_theorem(implies(A,not(B))) ),
inference(resolve,[status(thm)],[c_1,c_439]) ).
cnf(c_479,plain,
is_a_theorem(implies(A,implies(not(A),B))),
inference(resolve,[status(thm)],[c_498,c_292]) ).
cnf(c_480,plain,
$false,
inference(resolve,[status(thm)],[c_479,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL069-1 : TPTP v9.3.1. Bugfixed v1.2.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.36 % Computer : n009.cluster.edu
% 0.06/0.36 % Model : x86_64 x86_64
% 0.06/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.36 % Memory : 8046.5625MB
% 0.06/0.36 % OS : Linux 6.8.0-71-generic
% 0.06/0.36 % CPULimit : 300
% 0.06/0.36 % WCLimit : 300
% 0.06/0.36 % DateTime : Fri Sep 25 21:48:29 UTC 2026
% 0.06/0.37 % CPUTime :
% 0.06/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.06/0.38 % Process 2626792 was started by sandbox on n009,
% 0.06/0.38 % Fri Sep 25 21:48:29 2026
% 0.06/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.06/0.38
% 0.06/0.38 % From the command line: assign(max_seconds, 300).
% 0.50/0.57
% 0.50/0.57 % SZS status Unsatisfiable for theBenchmark
% 0.50/0.57
% 0.50/0.57 % Proof 1 at 0.06 (+ 0.02) seconds.
% 0.50/0.57 % Length of proof is 24.
% 0.50/0.57 % Level of proof is 14.
% 0.50/0.57 % Maximum clause weight is 50.000.
% 0.50/0.57 % Given clauses 72.
% 0.50/0.57
% 0.50/0.57 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------