%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL076-3 : 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 : n016.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:37 AM UTC 2026
% Result : Unsatisfiable 253.81s 254.11s
% Output : Proof 253.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 37 ( 28 unt; 0 nHn; 34 RR)
% Number of literals : 55 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 3 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 : 12 ( 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_18,axiom,
is_a_theorem(implies(X,implies(Y,X))),
file('theBenchmark.p',cn_18) ).
cnf(cn_35,axiom,
is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
file('theBenchmark.p',cn_35) ).
cnf(cn_49,axiom,
is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
file('theBenchmark.p',cn_49) ).
cnf(transitivity,axiom,
( is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X1,X2)) ),
file('theBenchmark.p',transitivity) ).
cnf(prove_cn_40,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('theBenchmark.p',prove_cn_40) ).
cnf(t1,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(start,[status(thm),parent(0:0)],[prove_cn_40]) ).
cnf(t2,plain,
( ~ is_a_theorem(implies(not(not(not(a))),not(a)))
| ~ is_a_theorem(implies(implies(not(not(not(a))),not(a)),implies(a,not(not(a)))))
| is_a_theorem(implies(a,not(not(a)))) ),
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(not(not(not(a))),not(a)),implies(a,not(not(a))))),
inference(extension,[status(thm),parent(t2:2)],[cn_49]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ is_a_theorem(implies(not(not(not(a))),implies(not(not(not(a))),not(a))))
| ~ is_a_theorem(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(a))))
| is_a_theorem(implies(not(not(not(a))),not(a))) ),
inference(extension,[status(thm),parent(t2:3)],[condensed_detachment]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( ~ is_a_theorem(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(not(not(a))))))
| ~ is_a_theorem(implies(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(not(not(a))))),implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(a)))))
| is_a_theorem(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(a)))) ),
inference(extension,[status(thm),parent(t6:2)],[condensed_detachment]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ is_a_theorem(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(implies(not(not(not(a))),not(not(not(a)))),implies(not(not(not(a))),not(a)))))
| ~ is_a_theorem(implies(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(implies(not(not(not(a))),not(not(not(a)))),implies(not(not(not(a))),not(a)))),implies(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(not(not(a))))),implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(a))))))
| is_a_theorem(implies(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(not(not(a))))),implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(a))))) ),
inference(extension,[status(thm),parent(t8:2)],[condensed_detachment]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
is_a_theorem(implies(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(implies(not(not(not(a))),not(not(not(a)))),implies(not(not(not(a))),not(a)))),implies(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(not(not(a))))),implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(a)))))),
inference(extension,[status(thm),parent(t10:2)],[cn_35]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
is_a_theorem(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(implies(not(not(not(a))),not(not(not(a)))),implies(not(not(not(a))),not(a))))),
inference(extension,[status(thm),parent(t10:3)],[cn_35]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t10:3]) ).
cnf(t16,plain,
( ~ is_a_theorem(implies(not(not(not(a))),implies(implies(not(not(not(a))),not(a)),not(not(not(a))))))
| ~ is_a_theorem(implies(implies(not(not(not(a))),implies(implies(not(not(not(a))),not(a)),not(not(not(a))))),implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(not(not(a)))))))
| is_a_theorem(implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(not(not(a)))))) ),
inference(extension,[status(thm),parent(t8:3)],[condensed_detachment]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t8:3]) ).
cnf(t18,plain,
is_a_theorem(implies(implies(not(not(not(a))),implies(implies(not(not(not(a))),not(a)),not(not(not(a))))),implies(implies(not(not(not(a))),implies(not(not(not(a))),not(a))),implies(not(not(not(a))),not(not(not(a))))))),
inference(extension,[status(thm),parent(t16:2)],[cn_35]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
is_a_theorem(implies(not(not(not(a))),implies(implies(not(not(not(a))),not(a)),not(not(not(a)))))),
inference(extension,[status(thm),parent(t16:3)],[cn_18]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t16:3]) ).
cnf(t22,plain,
( ~ is_a_theorem(implies(not(not(not(a))),implies(not(not(a)),not(not(not(not(a)))))))
| ~ is_a_theorem(implies(implies(not(not(a)),not(not(not(not(a))))),implies(not(not(not(a))),not(a))))
| is_a_theorem(implies(not(not(not(a))),implies(not(not(not(a))),not(a)))) ),
inference(extension,[status(thm),parent(t6:3)],[transitivity]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t6:3]) ).
cnf(t24,plain,
is_a_theorem(implies(implies(not(not(a)),not(not(not(not(a))))),implies(not(not(not(a))),not(a)))),
inference(extension,[status(thm),parent(t22:2)],[cn_49]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t22:2]) ).
cnf(t26,plain,
( ~ is_a_theorem(implies(not(not(not(a))),implies(not(not(not(not(not(a))))),not(not(not(a))))))
| ~ is_a_theorem(implies(implies(not(not(not(not(not(a))))),not(not(not(a)))),implies(not(not(a)),not(not(not(not(a)))))))
| is_a_theorem(implies(not(not(not(a))),implies(not(not(a)),not(not(not(not(a))))))) ),
inference(extension,[status(thm),parent(t22:3)],[transitivity]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t22:3]) ).
cnf(t28,plain,
is_a_theorem(implies(implies(not(not(not(not(not(a))))),not(not(not(a)))),implies(not(not(a)),not(not(not(not(a))))))),
inference(extension,[status(thm),parent(t26:2)],[cn_49]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t26:2]) ).
cnf(t30,plain,
is_a_theorem(implies(not(not(not(a))),implies(not(not(not(not(not(a))))),not(not(not(a)))))),
inference(extension,[status(thm),parent(t26:3)],[cn_18]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t26:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL076-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.04 % 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.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 14:08:05 UTC 2026
% 0.09/0.37 % CPUTime :
% 253.81/254.11 % SZS status Unsatisfiable for theBenchmark
% 253.81/254.11 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------