%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN148-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 : n005.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:36 AM UTC 2026
% Result : Unsatisfiable 0.21s 0.48s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 27 unt; 0 nHn; 36 RR)
% Number of literals : 59 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 12 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_5,axiom,
s0(b),
file('SYN001-0.ax',axiom_5) ).
cnf(axiom_14,axiom,
p0(b,X),
file('SYN001-0.ax',axiom_14) ).
cnf(axiom_20,axiom,
l0(a),
file('SYN001-0.ax',axiom_20) ).
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_37,axiom,
n0(b,a),
file('SYN001-0.ax',axiom_37) ).
cnf(rule_001,axiom,
( ~ n0(J,I)
| k1(I) ),
file('SYN001-0.ax',rule_001) ).
cnf(rule_002,axiom,
( ~ n0(H,G)
| l1(G,G) ),
file('SYN001-0.ax',rule_002) ).
cnf(rule_004,axiom,
( ~ l1(B,B)
| ~ l0(B)
| ~ k1(A)
| l1(A,A) ),
file('SYN001-0.ax',rule_004) ).
cnf(rule_050,axiom,
( ~ p0(b,E)
| ~ l0(D)
| ~ s0(b)
| n1(D,E,D) ),
file('SYN001-0.ax',rule_050) ).
cnf(rule_054,axiom,
( ~ n1(E,F,E)
| ~ l1(G,E)
| ~ l0(G)
| n1(E,F,F) ),
file('SYN001-0.ax',rule_054) ).
cnf(prove_this,negated_conjecture,
~ n1(c,d,d),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ n1(c,d,d),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ l0(c)
| ~ l1(c,c)
| ~ n1(c,d,c)
| n1(c,d,d) ),
inference(extension,[status(thm),parent(t1:1)],[rule_054]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ s0(b)
| ~ l0(c)
| ~ p0(b,d)
| n1(c,d,c) ),
inference(extension,[status(thm),parent(t2:2)],[rule_050]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
p0(b,d),
inference(extension,[status(thm),parent(t4:2)],[axiom_14]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
l0(c),
inference(extension,[status(thm),parent(t4:3)],[axiom_24]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
s0(b),
inference(extension,[status(thm),parent(t4:4)],[axiom_5]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t4:4]) ).
cnf(t12,plain,
( ~ k1(c)
| ~ l0(a)
| ~ l1(a,a)
| l1(c,c) ),
inference(extension,[status(thm),parent(t2:3)],[rule_004]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t2:3]) ).
cnf(t14,plain,
( ~ n0(b,a)
| l1(a,a) ),
inference(extension,[status(thm),parent(t12:2)],[rule_002]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
n0(b,a),
inference(extension,[status(thm),parent(t14:2)],[axiom_37]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
l0(a),
inference(extension,[status(thm),parent(t12:3)],[axiom_20]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t12:3]) ).
cnf(t20,plain,
( ~ n0(d,c)
| k1(c) ),
inference(extension,[status(thm),parent(t12:4)],[rule_001]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t12:4]) ).
cnf(t22,plain,
n0(d,c),
inference(extension,[status(thm),parent(t20:2)],[axiom_26]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
l0(c),
inference(extension,[status(thm),parent(t2:4)],[axiom_24]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN148-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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 06:26:18 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.21/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.48 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------