%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN116-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.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 09:09:32 AM UTC 2026
% Result : Unsatisfiable 0.30s 0.59s
% Output : Proof 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of clauses : 41 ( 27 unt; 0 nHn; 41 RR)
% Number of literals : 65 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_5,axiom,
s0(b),
file('SYN001-0.ax',axiom_5) ).
cnf(axiom_21,axiom,
q0(b,e),
file('SYN001-0.ax',axiom_21) ).
cnf(axiom_30,axiom,
n0(e,e),
file('SYN001-0.ax',axiom_30) ).
cnf(axiom_31,axiom,
m0(b,b,e),
file('SYN001-0.ax',axiom_31) ).
cnf(axiom_32,axiom,
k0(b),
file('SYN001-0.ax',axiom_32) ).
cnf(rule_002,axiom,
( ~ n0(H,G)
| l1(G,G) ),
file('SYN001-0.ax',rule_002) ).
cnf(rule_061,axiom,
( ~ s0(G)
| ~ k0(G)
| n1(G,G,G) ),
file('SYN001-0.ax',rule_061) ).
cnf(rule_062,axiom,
( ~ n1(E,D,E)
| ~ m0(E,E,F)
| n1(D,D,D) ),
file('SYN001-0.ax',rule_062) ).
cnf(rule_130,axiom,
( ~ l1(e,e)
| k2(e,e) ),
file('SYN001-0.ax',rule_130) ).
cnf(rule_252,axiom,
( ~ k2(J,J)
| ~ q0(I,H)
| p3(H,H,H) ),
file('SYN001-0.ax',rule_252) ).
cnf(rule_299,axiom,
( ~ l1(A,C)
| ~ p3(B,C,D)
| s4(A) ),
file('SYN001-0.ax',rule_299) ).
cnf(rule_301,axiom,
( ~ n1(b,b,b)
| ~ s4(e)
| k5(b) ),
file('SYN001-0.ax',rule_301) ).
cnf(prove_this,negated_conjecture,
~ k5(b),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ k5(b),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ s4(e)
| ~ n1(b,b,b)
| k5(b) ),
inference(extension,[status(thm),parent(t1:1)],[rule_301]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ m0(b,b,e)
| ~ n1(b,b,b)
| n1(b,b,b) ),
inference(extension,[status(thm),parent(t2:2)],[rule_062]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ k0(b)
| ~ s0(b)
| n1(b,b,b) ),
inference(extension,[status(thm),parent(t4:2)],[rule_061]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
s0(b),
inference(extension,[status(thm),parent(t6:2)],[axiom_5]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
k0(b),
inference(extension,[status(thm),parent(t6:3)],[axiom_32]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).
cnf(t12,plain,
m0(b,b,e),
inference(extension,[status(thm),parent(t4:3)],[axiom_31]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t4:3]) ).
cnf(t14,plain,
( ~ p3(e,e,e)
| ~ l1(e,e)
| s4(e) ),
inference(extension,[status(thm),parent(t2:3)],[rule_299]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t2:3]) ).
cnf(t16,plain,
( ~ n0(e,e)
| l1(e,e) ),
inference(extension,[status(thm),parent(t14:2)],[rule_002]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
n0(e,e),
inference(extension,[status(thm),parent(t16:2)],[axiom_30]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(l8,lemma,
l1(e,e),
inference(lemma,[status(cth),parent(t14:2),below(t2:3)],[t14:2]) ).
cnf(t20,plain,
( ~ q0(b,e)
| ~ k2(e,e)
| p3(e,e,e) ),
inference(extension,[status(thm),parent(t14:3)],[rule_252]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t14:3]) ).
cnf(t22,plain,
( ~ l1(e,e)
| k2(e,e) ),
inference(extension,[status(thm),parent(t20:2)],[rule_130]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
l1(e,e),
inference(lemma_extension,[status(thm),parent(t22:2)],[l8:1]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t22:2]) ).
cnf(t26,plain,
q0(b,e),
inference(extension,[status(thm),parent(t20:3)],[axiom_21]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t20:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN116-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 This is a CNF_UNS_EPR_NEQ_HRN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n014.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 : Sun Sep 20 06:25:35 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.30/0.59 % SZS status Unsatisfiable for theBenchmark
% 0.30/0.59 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------