%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN037-1 : TPTP v9.3.1. Released v1.0.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 : n020.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:15 AM UTC 2026
% Result : Unsatisfiable 0.45s 0.75s
% Output : Proof 0.45s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
( ~ n10
| ~ n6
| ~ n9
| ~ n2 ),
file('theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
( n10
| n6
| ~ n9
| ~ n2 ),
file('theBenchmark.p',clause_2) ).
cnf(clause_3,negated_conjecture,
( ~ n10
| ~ n6
| n9
| n2 ),
file('theBenchmark.p',clause_3) ).
cnf(clause_4,negated_conjecture,
( n10
| n6
| n9
| n2 ),
file('theBenchmark.p',clause_4) ).
cnf(clause_5,negated_conjecture,
( n10
| ~ n6
| n9
| ~ n2 ),
file('theBenchmark.p',clause_5) ).
cnf(clause_6,negated_conjecture,
( ~ n10
| n6
| n9
| ~ n2 ),
file('theBenchmark.p',clause_6) ).
cnf(clause_7,negated_conjecture,
( n10
| ~ n6
| ~ n9
| n2 ),
file('theBenchmark.p',clause_7) ).
cnf(clause_8,negated_conjecture,
( ~ n10
| n6
| ~ n9
| n2 ),
file('theBenchmark.p',clause_8) ).
cnf(clause_9,negated_conjecture,
( n8
| ~ q(s8) ),
file('theBenchmark.p',clause_9) ).
cnf(clause_10,negated_conjecture,
( q(X10)
| ~ n8 ),
file('theBenchmark.p',clause_10) ).
cnf(clause_11,negated_conjecture,
( n7
| ~ p(X9) ),
file('theBenchmark.p',clause_11) ).
cnf(clause_12,negated_conjecture,
( p(s7)
| ~ n7 ),
file('theBenchmark.p',clause_12) ).
cnf(clause_13,negated_conjecture,
( n6
| ~ n5(X8) ),
file('theBenchmark.p',clause_13) ).
cnf(clause_14,negated_conjecture,
( n5(s6)
| ~ n6 ),
file('theBenchmark.p',clause_14) ).
cnf(clause_15,negated_conjecture,
( n5(W)
| ~ q(W)
| ~ q(s5(W)) ),
file('theBenchmark.p',clause_15) ).
cnf(clause_16,negated_conjecture,
( n5(W)
| q(W)
| q(s5(W)) ),
file('theBenchmark.p',clause_16) ).
cnf(clause_17,negated_conjecture,
( q(W)
| ~ q(X7)
| ~ n5(W) ),
file('theBenchmark.p',clause_17) ).
cnf(clause_18,negated_conjecture,
( ~ q(W)
| q(X7)
| ~ n5(W) ),
file('theBenchmark.p',clause_18) ).
cnf(clause_19,negated_conjecture,
( n4
| ~ p(s4) ),
file('theBenchmark.p',clause_19) ).
cnf(clause_20,negated_conjecture,
( p(X6)
| ~ n4 ),
file('theBenchmark.p',clause_20) ).
cnf(clause_21,negated_conjecture,
( n3
| ~ q(X5) ),
file('theBenchmark.p',clause_21) ).
cnf(clause_22,negated_conjecture,
( q(s3)
| ~ n3 ),
file('theBenchmark.p',clause_22) ).
cnf(clause_23,negated_conjecture,
( n2
| ~ n1(X4) ),
file('theBenchmark.p',clause_23) ).
cnf(clause_24,negated_conjecture,
( n1(s2)
| ~ n2 ),
file('theBenchmark.p',clause_24) ).
cnf(clause_25,negated_conjecture,
( n1(X)
| ~ p(s1(X))
| ~ p(X) ),
file('theBenchmark.p',clause_25) ).
cnf(clause_26,negated_conjecture,
( n1(X)
| p(s1(X))
| p(X) ),
file('theBenchmark.p',clause_26) ).
cnf(clause_27,negated_conjecture,
( p(X3)
| ~ p(X)
| ~ n1(X) ),
file('theBenchmark.p',clause_27) ).
cnf(clause_28,negated_conjecture,
( ~ p(X3)
| p(X)
| ~ n1(X) ),
file('theBenchmark.p',clause_28) ).
cnf(clause_29,negated_conjecture,
( n9
| ~ n4
| ~ n3 ),
file('theBenchmark.p',clause_29) ).
cnf(clause_30,negated_conjecture,
( n9
| n4
| n3 ),
file('theBenchmark.p',clause_30) ).
cnf(clause_31,negated_conjecture,
( ~ n9
| n4
| ~ n3 ),
file('theBenchmark.p',clause_31) ).
cnf(clause_32,negated_conjecture,
( ~ n9
| ~ n4
| n3 ),
file('theBenchmark.p',clause_32) ).
cnf(clause_33,negated_conjecture,
( n10
| ~ n8
| ~ n7 ),
file('theBenchmark.p',clause_33) ).
cnf(clause_34,negated_conjecture,
( n10
| n8
| n7 ),
file('theBenchmark.p',clause_34) ).
cnf(clause_35,negated_conjecture,
( ~ n10
| n8
| ~ n7 ),
file('theBenchmark.p',clause_35) ).
cnf(clause_36,negated_conjecture,
( ~ n10
| ~ n8
| n7 ),
file('theBenchmark.p',clause_36) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN037-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN 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.09/0.35 % Computer : n020.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 06:23:48 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.45/0.75 % SZS status Unsatisfiable for theBenchmark
% 0.45/0.75 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------