%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL043-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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:49 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 11 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 6 |; 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 2 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_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_2,plain,
is_a_theorem(implies(A,implies(not(A),B))),
inference(clausify,[status(thm)],[cn_3]) ).
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_3,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(clausify,[status(thm)],[cn_18]) ).
fof(cn_54,axiom,
! [VAR_0,VAR_1] : is_a_theorem(implies(implies(VAR_0,VAR_1),implies(implies(not(VAR_0),VAR_1),VAR_1))),
file('theBenchmark.p',cn_54) ).
cnf(c_6,plain,
is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))),
inference(clausify,[status(thm)],[cn_54]) ).
fof(prove_cn_39,axiom,
~ is_a_theorem(implies(not(not(a)),a)),
file('theBenchmark.p',prove_cn_39) ).
cnf(c_7,plain,
~ is_a_theorem(implies(not(not(a)),a)),
inference(clausify,[status(thm)],[prove_cn_39]) ).
cnf(c_147,plain,
( is_a_theorem(implies(implies(not(A),B),B))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_1,c_6]) ).
cnf(c_19,plain,
is_a_theorem(implies(implies(not(A),implies(B,A)),implies(B,A))),
inference(resolve,[status(thm)],[c_147,c_3]) ).
cnf(c_148,plain,
( is_a_theorem(implies(B,A))
| ~ is_a_theorem(implies(not(A),implies(B,A))) ),
inference(resolve,[status(thm)],[c_1,c_19]) ).
cnf(c_145,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(resolve,[status(thm)],[c_148,c_2]) ).
cnf(c_146,plain,
$false,
inference(resolve,[status(thm)],[c_145,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL043-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 % Computer : n003.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Fri Sep 25 21:47:37 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.38 % Process 1170567 was started by sandbox on n003,
% 0.12/0.38 % Fri Sep 25 21:47:37 2026
% 0.12/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.39
% 0.12/0.39 % From the command line: assign(max_seconds, 300).
% 0.12/0.42
% 0.12/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.42
% 0.12/0.42 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.12/0.42 % Length of proof is 8.
% 0.12/0.42 % Level of proof is 3.
% 0.12/0.42 % Maximum clause weight is 27.000.
% 0.12/0.42 % Given clauses 37.
% 0.12/0.42
% 0.12/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------