%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL064-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 : n003.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:52 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.46s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 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; 3 con; 0-2 aty)
% Number of variables : 61 ( 10 sgn 7 !; 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_18,axiom,
! [VAR_0,VAR_1] : is_a_theorem(implies(VAR_0,implies(VAR_1,VAR_0))),
file('theBenchmark.p',cn_18) ).
cnf(c_2,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(clausify,[status(thm)],[cn_18]) ).
fof(cn_35,axiom,
! [VAR_0,VAR_1,VAR_2] : is_a_theorem(implies(implies(VAR_0,implies(VAR_1,VAR_2)),implies(implies(VAR_0,VAR_1),implies(VAR_0,VAR_2)))),
file('theBenchmark.p',cn_35) ).
cnf(c_3,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))),
inference(clausify,[status(thm)],[cn_35]) ).
fof(prove_cn_1,axiom,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('theBenchmark.p',prove_cn_1) ).
cnf(c_5,plain,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
inference(clausify,[status(thm)],[prove_cn_1]) ).
cnf(c_659,plain,
( is_a_theorem(implies(B,A))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_6,plain,
is_a_theorem(implies(A,implies(B,implies(C,B)))),
inference(resolve,[status(thm)],[c_659,c_2]) ).
cnf(c_660,plain,
( is_a_theorem(implies(implies(A,B),implies(A,C)))
| ~ is_a_theorem(implies(A,implies(B,C))) ),
inference(resolve,[status(thm)],[c_1,c_3]) ).
cnf(c_7,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))),
inference(resolve,[status(thm)],[c_660,c_3]) ).
cnf(c_661,plain,
( is_a_theorem(implies(B,A))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_8,plain,
is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))),
inference(resolve,[status(thm)],[c_661,c_3]) ).
cnf(c_662,plain,
( is_a_theorem(implies(implies(A,implies(B,C)),implies(A,C)))
| ~ is_a_theorem(implies(implies(A,implies(B,C)),implies(A,B))) ),
inference(resolve,[status(thm)],[c_1,c_7]) ).
cnf(c_16,plain,
is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))),
inference(resolve,[status(thm)],[c_662,c_6]) ).
cnf(c_663,plain,
( is_a_theorem(implies(A,C))
| ~ is_a_theorem(implies(A,implies(implies(B,A),C))) ),
inference(resolve,[status(thm)],[c_1,c_16]) ).
cnf(c_108,plain,
is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))),
inference(resolve,[status(thm)],[c_663,c_8]) ).
cnf(c_664,plain,
( is_a_theorem(implies(implies(A,B),implies(A,C)))
| ~ is_a_theorem(implies(A,implies(B,C))) ),
inference(resolve,[status(thm)],[c_1,c_3]) ).
cnf(c_189,plain,
is_a_theorem(implies(implies(implies(A,B),implies(C,A)),implies(implies(A,B),implies(C,B)))),
inference(resolve,[status(thm)],[c_664,c_108]) ).
cnf(c_665,plain,
( is_a_theorem(implies(implies(A,B),implies(C,B)))
| ~ is_a_theorem(implies(implies(A,B),implies(C,A))) ),
inference(resolve,[status(thm)],[c_1,c_189]) ).
cnf(c_647,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(resolve,[status(thm)],[c_665,c_6]) ).
cnf(c_666,plain,
( is_a_theorem(implies(B,C))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_1,c_647]) ).
cnf(c_657,plain,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
inference(resolve,[status(thm)],[c_666,c_189]) ).
cnf(c_658,plain,
$false,
inference(resolve,[status(thm)],[c_657,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL064-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 : n003.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:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37 % Process 1178924 was started by sandbox2 on n003,
% 0.11/0.37 % Fri Sep 25 21:49:54 2026
% 0.11/0.37 % 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).
% 0.11/0.46
% 0.11/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.46
% 0.11/0.46 % Proof 1 at 0.05 (+ 0.02) seconds.
% 0.11/0.46 % Length of proof is 13.
% 0.11/0.46 % Level of proof is 7.
% 0.11/0.46 % Maximum clause weight is 45.000.
% 0.11/0.46 % Given clauses 83.
% 0.11/0.46
% 0.11/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------