%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN272-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 : n018.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 2.56s 2.85s
% Output : Proof 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 24 unt; 0 nHn; 37 RR)
% Number of literals : 60 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 17 ( 6 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_28,axiom,
k0(e),
file('SYN001-0.ax',axiom_28) ).
cnf(axiom_34,axiom,
n0(c,d),
file('SYN001-0.ax',axiom_34) ).
cnf(rule_001,axiom,
( ~ n0(J,I)
| k1(I) ),
file('SYN001-0.ax',rule_001) ).
cnf(rule_007,axiom,
( ~ r0(G)
| ~ p0(I,H)
| m1(G,H,G) ),
file('SYN001-0.ax',rule_007) ).
cnf(rule_117,axiom,
( ~ s0(d)
| ~ k0(e)
| q1(d,d,d) ),
file('SYN001-0.ax',rule_117) ).
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_194,axiom,
( ~ k2(G,F)
| k3(F,F,G) ),
file('SYN001-0.ax',rule_194) ).
cnf(rule_287,axiom,
( ~ k3(B,B,C)
| p4(B,C,B) ),
file('SYN001-0.ax',rule_287) ).
cnf(prove_this,negated_conjecture,
~ p4(d,e,X),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ p4(d,e,d),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ k3(d,d,e)
| p4(d,e,d) ),
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,
( ~ k2(e,d)
| k3(d,d,e) ),
inference(extension,[status(thm),parent(t2:2)],[rule_194]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ m1(e,d,e)
| ~ k1(d)
| ~ k2(d,d)
| k2(e,d) ),
inference(extension,[status(thm),parent(t4:2)],[rule_127]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ q1(d,d,d)
| k2(d,d) ),
inference(extension,[status(thm),parent(t6:2)],[rule_129]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ k0(e)
| ~ s0(d)
| q1(d,d,d) ),
inference(extension,[status(thm),parent(t8:2)],[rule_117]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
s0(d),
inference(extension,[status(thm),parent(t10:2)],[axiom_1]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
k0(e),
inference(extension,[status(thm),parent(t10:3)],[axiom_28]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t10:3]) ).
cnf(t16,plain,
( ~ n0(c,d)
| k1(d) ),
inference(extension,[status(thm),parent(t6:3)],[rule_001]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t6:3]) ).
cnf(t18,plain,
n0(c,d),
inference(extension,[status(thm),parent(t16:2)],[axiom_34]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
( ~ p0(b,d)
| ~ r0(e)
| m1(e,d,e) ),
inference(extension,[status(thm),parent(t6:4)],[rule_007]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t6:4]) ).
cnf(t22,plain,
r0(e),
inference(extension,[status(thm),parent(t20:2)],[axiom_13]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
p0(b,d),
inference(extension,[status(thm),parent(t20:3)],[axiom_14]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t20:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN272-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 This is a CNF_UNS_EPR_NEQ_HRN problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n018.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sun Sep 20 06:29:57 UTC 2026
% 0.07/0.34 % CPUTime :
% 2.56/2.85 % SZS status Unsatisfiable for theBenchmark
% 2.56/2.85 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------