%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN218-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 : 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:47 AM UTC 2026
% Result : Unsatisfiable 0.13s 5.53s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 16 unt; 0 nHn; 20 RR)
% Number of literals : 34 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 11 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_14,axiom,
p0(b,X),
file('SYN001-0.ax',axiom_14) ).
cnf(axiom_17,axiom,
q0(X,d),
file('SYN001-0.ax',axiom_17) ).
cnf(axiom_35,axiom,
m0(d,e,c),
file('SYN001-0.ax',axiom_35) ).
cnf(rule_125,axiom,
( ~ p0(I,I)
| s1(I) ),
file('SYN001-0.ax',rule_125) ).
cnf(rule_126,axiom,
( ~ s1(H)
| ~ q0(F,G)
| s1(F) ),
file('SYN001-0.ax',rule_126) ).
cnf(rule_133,axiom,
( ~ m0(C,B,J)
| ~ s1(B)
| ~ p0(A,A)
| l2(J,J) ),
file('SYN001-0.ax',rule_133) ).
cnf(prove_this,negated_conjecture,
~ l2(c,X),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ l2(c,c),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ p0(b,b)
| ~ s1(e)
| ~ m0(d,e,c)
| l2(c,c) ),
inference(extension,[status(thm),parent(t1:1)],[rule_133]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
m0(d,e,c),
inference(extension,[status(thm),parent(t2:2)],[axiom_35]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ q0(e,d)
| ~ s1(b)
| s1(e) ),
inference(extension,[status(thm),parent(t2:3)],[rule_126]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( ~ p0(b,b)
| s1(b) ),
inference(extension,[status(thm),parent(t6:2)],[rule_125]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
p0(b,b),
inference(extension,[status(thm),parent(t8:2)],[axiom_14]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
q0(e,d),
inference(extension,[status(thm),parent(t6:3)],[axiom_17]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t6:3]) ).
cnf(t14,plain,
p0(b,b),
inference(extension,[status(thm),parent(t2:4)],[axiom_14]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN218-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.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.35 % Computer : n016.cluster.edu
% 0.10/5.35 % Model : x86_64 x86_64
% 0.10/5.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.35 % Memory : 8046.5625MB
% 0.10/5.35 % OS : Linux 6.8.0-71-generic
% 0.10/5.35 % CPULimit : 300
% 0.10/5.35 % WCLimit : 300
% 0.10/5.35 % DateTime : Sun Sep 20 06:32:27 UTC 2026
% 0.10/5.36 % CPUTime :
% 0.13/5.53 % SZS status Unsatisfiable for theBenchmark
% 0.13/5.53 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------