%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN273-1 : TPTP v9.3.1. Released v1.1.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 : n001.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:55 AM UTC 2026
% Result : Unsatisfiable 0.57s 0.83s
% Output : Proof 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 20
% Syntax : Number of clauses : 63 ( 41 unt; 0 nHn; 61 RR)
% Number of literals : 103 ( 0 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 25 ( 9 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_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_24,axiom,
l0(c),
file('SYN001-0.ax',axiom_24) ).
cnf(axiom_26,axiom,
n0(d,c),
file('SYN001-0.ax',axiom_26) ).
cnf(axiom_28,axiom,
k0(e),
file('SYN001-0.ax',axiom_28) ).
cnf(axiom_33,axiom,
q0(d,c),
file('SYN001-0.ax',axiom_33) ).
cnf(rule_001,axiom,
( ~ n0(J,I)
| k1(I) ),
file('SYN001-0.ax',rule_001) ).
cnf(rule_035,axiom,
( ~ l0(J)
| ~ r0(I)
| m1(I,J,I) ),
file('SYN001-0.ax',rule_035) ).
cnf(rule_117,axiom,
( ~ s0(d)
| ~ k0(e)
| q1(d,d,d) ),
file('SYN001-0.ax',rule_117) ).
cnf(rule_122,axiom,
( ~ m0(G,H,G)
| q1(G,G,G) ),
file('SYN001-0.ax',rule_122) ).
cnf(rule_124,axiom,
( ~ q1(d,E,d)
| ~ s0(d)
| ~ q0(D,E)
| r1(D) ),
file('SYN001-0.ax',rule_124) ).
cnf(rule_127,axiom,
( ~ k2(F,D)
| ~ k1(F)
| ~ m1(E,D,C)
| k2(C,D) ),
file('SYN001-0.ax',rule_127) ).
cnf(rule_129,axiom,
( ~ q1(A,J,J)
| k2(J,J) ),
file('SYN001-0.ax',rule_129) ).
cnf(rule_188,axiom,
( ~ l0(G)
| ~ r1(G)
| r2(G) ),
file('SYN001-0.ax',rule_188) ).
cnf(rule_202,axiom,
( ~ k3(H,A,J)
| ~ k2(G,J)
| ~ q0(I,H)
| k3(G,G,H) ),
file('SYN001-0.ax',rule_202) ).
cnf(rule_214,axiom,
( ~ r2(c)
| k3(c,c,c) ),
file('SYN001-0.ax',rule_214) ).
cnf(rule_287,axiom,
( ~ k3(B,B,C)
| p4(B,C,B) ),
file('SYN001-0.ax',rule_287) ).
cnf(prove_this,negated_conjecture,
~ p4(e,c,e),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ p4(e,c,e),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ k3(e,e,c)
| p4(e,c,e) ),
inference(extension,[status(thm),parent(t1:1)],[rule_287]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ q0(d,c)
| ~ k2(e,c)
| ~ k3(c,c,c)
| k3(e,e,c) ),
inference(extension,[status(thm),parent(t2:2)],[rule_202]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ r2(c)
| k3(c,c,c) ),
inference(extension,[status(thm),parent(t4:2)],[rule_214]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ r1(c)
| ~ l0(c)
| r2(c) ),
inference(extension,[status(thm),parent(t6:2)],[rule_188]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
l0(c),
inference(extension,[status(thm),parent(t8:2)],[axiom_24]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( ~ q0(c,d)
| ~ s0(d)
| ~ q1(d,d,d)
| r1(c) ),
inference(extension,[status(thm),parent(t8:3)],[rule_124]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
cnf(t14,plain,
( ~ k0(e)
| ~ s0(d)
| q1(d,d,d) ),
inference(extension,[status(thm),parent(t12:2)],[rule_117]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
s0(d),
inference(extension,[status(thm),parent(t14:2)],[axiom_1]) ).
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(t14:3)],[axiom_28]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t14:3]) ).
cnf(t20,plain,
s0(d),
inference(extension,[status(thm),parent(t12:3)],[axiom_1]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t12:3]) ).
cnf(t22,plain,
q0(c,d),
inference(extension,[status(thm),parent(t12:4)],[axiom_17]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t12:4]) ).
cnf(t24,plain,
( ~ m1(e,c,e)
| ~ k1(c)
| ~ k2(c,c)
| k2(e,c) ),
inference(extension,[status(thm),parent(t4:3)],[rule_127]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t4:3]) ).
cnf(t26,plain,
( ~ q1(c,c,c)
| k2(c,c) ),
inference(extension,[status(thm),parent(t24:2)],[rule_129]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t24:2]) ).
cnf(t28,plain,
( ~ m0(c,d,c)
| q1(c,c,c) ),
inference(extension,[status(thm),parent(t26:2)],[rule_122]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t26:2]) ).
cnf(t30,plain,
m0(c,d,c),
inference(extension,[status(thm),parent(t28:2)],[axiom_19]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).
cnf(t32,plain,
( ~ n0(d,c)
| k1(c) ),
inference(extension,[status(thm),parent(t24:3)],[rule_001]) ).
cnf(t33,plain,
$false,
inference(connection,[status(thm),parent(t32:1)],[t32:1,t24:3]) ).
cnf(t34,plain,
n0(d,c),
inference(extension,[status(thm),parent(t32:2)],[axiom_26]) ).
cnf(t35,plain,
$false,
inference(connection,[status(thm),parent(t34:1)],[t34:1,t32:2]) ).
cnf(t36,plain,
( ~ r0(e)
| ~ l0(c)
| m1(e,c,e) ),
inference(extension,[status(thm),parent(t24:4)],[rule_035]) ).
cnf(t37,plain,
$false,
inference(connection,[status(thm),parent(t36:1)],[t36:1,t24:4]) ).
cnf(t38,plain,
l0(c),
inference(extension,[status(thm),parent(t36:2)],[axiom_24]) ).
cnf(t39,plain,
$false,
inference(connection,[status(thm),parent(t38:1)],[t38:1,t36:2]) ).
cnf(t40,plain,
r0(e),
inference(extension,[status(thm),parent(t36:3)],[axiom_13]) ).
cnf(t41,plain,
$false,
inference(connection,[status(thm),parent(t40:1)],[t40:1,t36:3]) ).
cnf(t42,plain,
q0(d,c),
inference(extension,[status(thm),parent(t4:4)],[axiom_33]) ).
cnf(t43,plain,
$false,
inference(connection,[status(thm),parent(t42:1)],[t42:1,t4:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN273-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 This is a CNF_UNS_EPR_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.11/0.35 % Computer : n001.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Sun Sep 20 06:33:42 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.57/0.83 % SZS status Unsatisfiable for theBenchmark
% 0.57/0.83 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------