%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN256-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:52 AM UTC 2026
% Result : Unsatisfiable 0.21s 0.47s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 10 unt; 0 nHn; 14 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 6 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_24,axiom,
l0(c),
file('SYN001-0.ax',axiom_24) ).
cnf(axiom_35,axiom,
m0(d,e,c),
file('SYN001-0.ax',axiom_35) ).
cnf(rule_086,axiom,
( ~ m0(J,A,I)
| ~ l0(I)
| p1(I,I,I) ),
file('SYN001-0.ax',rule_086) ).
cnf(rule_137,axiom,
( ~ p1(B,C,A)
| n2(A) ),
file('SYN001-0.ax',rule_137) ).
cnf(prove_this,negated_conjecture,
~ n2(c),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ n2(c),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ p1(c,c,c)
| n2(c) ),
inference(extension,[status(thm),parent(t1:1)],[rule_137]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ l0(c)
| ~ m0(d,e,c)
| p1(c,c,c) ),
inference(extension,[status(thm),parent(t2:2)],[rule_086]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
m0(d,e,c),
inference(extension,[status(thm),parent(t4:2)],[axiom_35]) ).
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]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN256-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.34 % Computer : n005.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 06:27:50 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.21/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.47 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------