%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL041-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/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 : Thu Sep 24 08:48:34 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 16 unt; 0 nHn; 17 RR)
% Number of literals : 28 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 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 : 9 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
file('theBenchmark.p',condensed_detachment) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X,implies(not(X),Y))),
file('theBenchmark.p',cn_3) ).
cnf(cn_21,axiom,
is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))),
file('theBenchmark.p',cn_21) ).
cnf(cn_54,axiom,
is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
file('theBenchmark.p',cn_54) ).
cnf(prove_cn_30,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
file('theBenchmark.p',prove_cn_30) ).
cnf(t1,plain,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
inference(start,[status(thm),parent(0:0)],[prove_cn_30]) ).
cnf(t2,plain,
( ~ is_a_theorem(implies(not(a),implies(a,b)))
| ~ is_a_theorem(implies(implies(not(a),implies(a,b)),implies(implies(a,implies(a,b)),implies(a,b))))
| is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))) ),
inference(extension,[status(thm),parent(t1:1)],[condensed_detachment]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ is_a_theorem(implies(implies(a,implies(a,b)),implies(implies(not(a),implies(a,b)),implies(a,b))))
| ~ is_a_theorem(implies(implies(implies(a,implies(a,b)),implies(implies(not(a),implies(a,b)),implies(a,b))),implies(implies(not(a),implies(a,b)),implies(implies(a,implies(a,b)),implies(a,b)))))
| is_a_theorem(implies(implies(not(a),implies(a,b)),implies(implies(a,implies(a,b)),implies(a,b)))) ),
inference(extension,[status(thm),parent(t2:2)],[condensed_detachment]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
is_a_theorem(implies(implies(implies(a,implies(a,b)),implies(implies(not(a),implies(a,b)),implies(a,b))),implies(implies(not(a),implies(a,b)),implies(implies(a,implies(a,b)),implies(a,b))))),
inference(extension,[status(thm),parent(t4:2)],[cn_21]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
is_a_theorem(implies(implies(a,implies(a,b)),implies(implies(not(a),implies(a,b)),implies(a,b)))),
inference(extension,[status(thm),parent(t4:3)],[cn_54]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
( ~ is_a_theorem(implies(a,implies(not(a),b)))
| ~ is_a_theorem(implies(implies(a,implies(not(a),b)),implies(not(a),implies(a,b))))
| is_a_theorem(implies(not(a),implies(a,b))) ),
inference(extension,[status(thm),parent(t2:3)],[condensed_detachment]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:3]) ).
cnf(t12,plain,
is_a_theorem(implies(implies(a,implies(not(a),b)),implies(not(a),implies(a,b)))),
inference(extension,[status(thm),parent(t10:2)],[cn_21]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
is_a_theorem(implies(a,implies(not(a),b))),
inference(extension,[status(thm),parent(t10:3)],[cn_3]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t10:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL041-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n013.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 19 13:57:35 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.13/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------