%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN202-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 : n019.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:44 AM UTC 2026
% Result : Unsatisfiable 0.16s 0.73s
% Output : Proof 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of clauses : 54 ( 38 unt; 0 nHn; 50 RR)
% Number of literals : 88 ( 0 equ; 36 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1,axiom,
s0(d),
file('SYN001-0.ax',axiom_1) ).
cnf(axiom_13,axiom,
r0(e),
file('SYN001-0.ax',axiom_13) ).
cnf(axiom_14,axiom,
p0(b,X),
file('SYN001-0.ax',axiom_14) ).
cnf(axiom_17,axiom,
q0(X,d),
file('SYN001-0.ax',axiom_17) ).
cnf(axiom_19,axiom,
m0(X,d,Y),
file('SYN001-0.ax',axiom_19) ).
cnf(axiom_21,axiom,
q0(b,e),
file('SYN001-0.ax',axiom_21) ).
cnf(axiom_28,axiom,
k0(e),
file('SYN001-0.ax',axiom_28) ).
cnf(rule_090,axiom,
( ~ k0(e)
| ~ r0(e)
| p1(e,e,e) ),
file('SYN001-0.ax',rule_090) ).
cnf(rule_117,axiom,
( ~ s0(d)
| ~ k0(e)
| q1(d,d,d) ),
file('SYN001-0.ax',rule_117) ).
cnf(rule_124,axiom,
( ~ q1(d,E,d)
| ~ s0(d)
| ~ q0(D,E)
| r1(D) ),
file('SYN001-0.ax',rule_124) ).
cnf(rule_125,axiom,
( ~ p0(I,I)
| s1(I) ),
file('SYN001-0.ax',rule_125) ).
cnf(rule_126,axiom,
( ~ s1(H)
| ~ q0(F,G)
| s1(F) ),
file('SYN001-0.ax',rule_126) ).
cnf(rule_181,axiom,
( ~ p1(I,I,I)
| q2(I,I,I) ),
file('SYN001-0.ax',rule_181) ).
cnf(rule_187,axiom,
( ~ q2(D,D,D)
| ~ k0(D)
| ~ m0(E,F,C)
| ~ r1(D)
| q2(C,D,C) ),
file('SYN001-0.ax',rule_187) ).
cnf(rule_189,axiom,
( ~ s1(b)
| ~ q2(b,H,b)
| s2(H) ),
file('SYN001-0.ax',rule_189) ).
cnf(prove_this,negated_conjecture,
~ s2(e),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ s2(e),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ q2(b,e,b)
| ~ s1(b)
| s2(e) ),
inference(extension,[status(thm),parent(t1:1)],[rule_189]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ q0(b,e)
| ~ s1(b)
| s1(b) ),
inference(extension,[status(thm),parent(t2:2)],[rule_126]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ p0(b,b)
| s1(b) ),
inference(extension,[status(thm),parent(t4:2)],[rule_125]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
p0(b,b),
inference(extension,[status(thm),parent(t6:2)],[axiom_14]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
q0(b,e),
inference(extension,[status(thm),parent(t4:3)],[axiom_21]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t4:3]) ).
cnf(t12,plain,
( ~ r1(e)
| ~ m0(U_3076,d,b)
| ~ k0(e)
| ~ q2(e,e,e)
| q2(b,e,b) ),
inference(extension,[status(thm),parent(t2:3)],[rule_187]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t2:3]) ).
cnf(t14,plain,
( ~ p1(e,e,e)
| q2(e,e,e) ),
inference(extension,[status(thm),parent(t12:2)],[rule_181]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
( ~ r0(e)
| ~ k0(e)
| p1(e,e,e) ),
inference(extension,[status(thm),parent(t14:2)],[rule_090]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
k0(e),
inference(extension,[status(thm),parent(t16:2)],[axiom_28]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
r0(e),
inference(extension,[status(thm),parent(t16:3)],[axiom_13]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t16:3]) ).
cnf(t22,plain,
k0(e),
inference(extension,[status(thm),parent(t12:3)],[axiom_28]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t12:3]) ).
cnf(l11,lemma,
k0(e),
inference(lemma,[status(cth),parent(t12:3),below(t2:3)],[t12:3]) ).
cnf(t24,plain,
m0(U_3076,d,b),
inference(extension,[status(thm),parent(t12:4)],[axiom_19]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t12:4]) ).
cnf(t26,plain,
( ~ q0(e,d)
| ~ s0(d)
| ~ q1(d,d,d)
| r1(e) ),
inference(extension,[status(thm),parent(t12:5)],[rule_124]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t12:5]) ).
cnf(t28,plain,
( ~ k0(e)
| ~ s0(d)
| q1(d,d,d) ),
inference(extension,[status(thm),parent(t26:2)],[rule_117]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t26:2]) ).
cnf(t30,plain,
s0(d),
inference(extension,[status(thm),parent(t28:2)],[axiom_1]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).
cnf(t32,plain,
k0(e),
inference(lemma_extension,[status(thm),parent(t28:3)],[l11:1]) ).
cnf(t33,plain,
$false,
inference(connection,[status(thm),parent(t32:1)],[t32:1,t28:3]) ).
cnf(t34,plain,
s0(d),
inference(extension,[status(thm),parent(t26:3)],[axiom_1]) ).
cnf(t35,plain,
$false,
inference(connection,[status(thm),parent(t34:1)],[t34:1,t26:3]) ).
cnf(t36,plain,
q0(e,d),
inference(extension,[status(thm),parent(t26:4)],[axiom_17]) ).
cnf(t37,plain,
$false,
inference(connection,[status(thm),parent(t36:1)],[t36:1,t26:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN202-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.11/0.58 % Computer : n019.cluster.edu
% 0.11/0.58 % Model : x86_64 x86_64
% 0.11/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58 % Memory : 8046.5625MB
% 0.11/0.58 % OS : Linux 6.8.0-71-generic
% 0.11/0.58 % CPULimit : 300
% 0.11/0.58 % WCLimit : 300
% 0.11/0.58 % DateTime : Sun Sep 20 06:27:22 UTC 2026
% 0.11/0.58 % CPUTime :
% 0.16/0.73 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.73 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------