%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN250-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 : n006.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:51 AM UTC 2026
% Result : Unsatisfiable 0.55s 0.84s
% Output : Proof 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 28 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 : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_6,axiom,
q0(b,b),
file('SYN001-0.ax',axiom_6) ).
cnf(axiom_13,axiom,
r0(e),
file('SYN001-0.ax',axiom_13) ).
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_24,axiom,
l0(c),
file('SYN001-0.ax',axiom_24) ).
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_016,axiom,
( ~ m1(J,A,I)
| ~ m1(J,I,H)
| m1(H,I,I) ),
file('SYN001-0.ax',rule_016) ).
cnf(rule_024,axiom,
( ~ m1(G,c,G)
| ~ q0(F,G)
| ~ m0(a,H,a)
| m1(F,a,G) ),
file('SYN001-0.ax',rule_024) ).
cnf(rule_034,axiom,
( ~ q0(A,A)
| ~ k1(B)
| ~ k1(a)
| m1(A,B,B) ),
file('SYN001-0.ax',rule_034) ).
cnf(rule_035,axiom,
( ~ l0(J)
| ~ r0(I)
| m1(I,J,I) ),
file('SYN001-0.ax',rule_035) ).
cnf(prove_this,negated_conjecture,
~ m1(e,a,a),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ m1(e,a,a),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ m1(b,a,e)
| ~ m1(b,a,a)
| m1(e,a,a) ),
inference(extension,[status(thm),parent(t1:1)],[rule_016]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ k1(a)
| ~ k1(a)
| ~ q0(b,b)
| m1(b,a,a) ),
inference(extension,[status(thm),parent(t2:2)],[rule_034]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
q0(b,b),
inference(extension,[status(thm),parent(t4:2)],[axiom_6]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ n0(b,a)
| k1(a) ),
inference(extension,[status(thm),parent(t4:3)],[rule_001]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
n0(b,a),
inference(extension,[status(thm),parent(t8:2)],[axiom_37]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(l4,lemma,
k1(a),
inference(lemma,[status(cth),parent(t4:3),below(t2:2)],[t4:3]) ).
cnf(t12,plain,
k1(a),
inference(lemma_extension,[status(thm),parent(t4:4)],[l4:1]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t4:4]) ).
cnf(t14,plain,
( ~ m0(a,d,a)
| ~ q0(b,e)
| ~ m1(e,c,e)
| m1(b,a,e) ),
inference(extension,[status(thm),parent(t2:3)],[rule_024]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t2:3]) ).
cnf(t16,plain,
( ~ r0(e)
| ~ l0(c)
| m1(e,c,e) ),
inference(extension,[status(thm),parent(t14:2)],[rule_035]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
l0(c),
inference(extension,[status(thm),parent(t16:2)],[axiom_24]) ).
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,
q0(b,e),
inference(extension,[status(thm),parent(t14:3)],[axiom_21]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t14:3]) ).
cnf(t24,plain,
m0(a,d,a),
inference(extension,[status(thm),parent(t14:4)],[axiom_19]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t14:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN250-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/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 06:27:28 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.55/0.84 % SZS status Unsatisfiable for theBenchmark
% 0.55/0.84 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------