%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN115-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 : n016.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:31 AM UTC 2026
% Result : Unsatisfiable 0.15s 5.54s
% Output : Proof 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 26 unt; 0 nHn; 40 RR)
% Number of literals : 64 ( 0 equ; 26 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 : 14 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_13,axiom,
r0(e),
file('SYN001-0.ax',axiom_13) ).
cnf(axiom_18,axiom,
p0(c,b),
file('SYN001-0.ax',axiom_18) ).
cnf(axiom_27,axiom,
m0(e,b,c),
file('SYN001-0.ax',axiom_27) ).
cnf(axiom_30,axiom,
n0(e,e),
file('SYN001-0.ax',axiom_30) ).
cnf(axiom_34,axiom,
n0(c,d),
file('SYN001-0.ax',axiom_34) ).
cnf(rule_003,axiom,
( ~ m0(D,C,E)
| ~ r0(F)
| ~ p0(E,C)
| l1(C,D) ),
file('SYN001-0.ax',rule_003) ).
cnf(rule_030,axiom,
( ~ r0(e)
| m1(e,e,e) ),
file('SYN001-0.ax',rule_030) ).
cnf(rule_176,axiom,
( ~ m1(E,D,E)
| p2(D,E,D) ),
file('SYN001-0.ax',rule_176) ).
cnf(rule_186,axiom,
( ~ l1(H,G)
| q2(G,G,H) ),
file('SYN001-0.ax',rule_186) ).
cnf(rule_240,axiom,
( ~ p2(E,F,D)
| n3(D) ),
file('SYN001-0.ax',rule_240) ).
cnf(rule_255,axiom,
( ~ n0(I,G)
| ~ q2(I,G,H)
| q3(G,H) ),
file('SYN001-0.ax',rule_255) ).
cnf(rule_274,axiom,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
file('SYN001-0.ax',rule_274) ).
cnf(prove_this,negated_conjecture,
~ k4(c),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ k4(c),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ n0(c,d)
| ~ q3(e,b)
| ~ n3(e)
| k4(c) ),
inference(extension,[status(thm),parent(t1:1)],[rule_274]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ p2(e,e,e)
| n3(e) ),
inference(extension,[status(thm),parent(t2:2)],[rule_240]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ m1(e,e,e)
| p2(e,e,e) ),
inference(extension,[status(thm),parent(t4:2)],[rule_176]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ r0(e)
| m1(e,e,e) ),
inference(extension,[status(thm),parent(t6:2)],[rule_030]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
r0(e),
inference(extension,[status(thm),parent(t8:2)],[axiom_13]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( ~ q2(e,e,b)
| ~ n0(e,e)
| q3(e,b) ),
inference(extension,[status(thm),parent(t2:3)],[rule_255]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t2:3]) ).
cnf(t14,plain,
n0(e,e),
inference(extension,[status(thm),parent(t12:2)],[axiom_30]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
( ~ l1(b,e)
| q2(e,e,b) ),
inference(extension,[status(thm),parent(t12:3)],[rule_186]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t12:3]) ).
cnf(t18,plain,
( ~ p0(c,b)
| ~ r0(e)
| ~ m0(e,b,c)
| l1(b,e) ),
inference(extension,[status(thm),parent(t16:2)],[rule_003]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
m0(e,b,c),
inference(extension,[status(thm),parent(t18:2)],[axiom_27]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
r0(e),
inference(extension,[status(thm),parent(t18:3)],[axiom_13]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t18:3]) ).
cnf(t24,plain,
p0(c,b),
inference(extension,[status(thm),parent(t18:4)],[axiom_18]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t18:4]) ).
cnf(t26,plain,
n0(c,d),
inference(extension,[status(thm),parent(t2:4)],[axiom_34]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN115-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.12/5.37 % Computer : n016.cluster.edu
% 0.12/5.37 % Model : x86_64 x86_64
% 0.12/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.37 % Memory : 8046.5625MB
% 0.12/5.37 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Sun Sep 20 06:30:26 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.15/5.54 % SZS status Unsatisfiable for theBenchmark
% 0.15/5.54 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------