%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : KRS010-1 : TPTP v9.3.1. Released v2.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 : n018.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 08:47:08 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.43s
% Output : Proof 0.09s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
e(exist),
file('theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
( ~ a(X1)
| d(X1)
| c(X1) ),
file('theBenchmark.p',clause_3) ).
cnf(clause_4,axiom,
( ~ d(X1)
| a(X1) ),
file('theBenchmark.p',clause_4) ).
cnf(clause_5,axiom,
( ~ c(X1)
| a(X1) ),
file('theBenchmark.p',clause_5) ).
cnf(clause_6,axiom,
( ~ c(X3)
| ~ c(X4)
| ~ r(X1,X3)
| ~ r(X1,X4)
| ~ e(X1)
| equalish(X4,X3) ),
file('theBenchmark.p',clause_6) ).
cnf(clause_7,axiom,
( ~ e(X1)
| r3least(X1) ),
file('theBenchmark.p',clause_7) ).
cnf(clause_8,axiom,
( ~ r(X1,X2)
| ~ e(X1)
| a(X2) ),
file('theBenchmark.p',clause_8) ).
cnf(clause_9,axiom,
( ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1)
| ~ a(u1r1(X1))
| e(X1) ),
file('theBenchmark.p',clause_9) ).
cnf(clause_10,axiom,
( ~ r3least(X1)
| ~ a(u1r1(X1))
| c(u1r2(X1))
| e(X1) ),
file('theBenchmark.p',clause_10) ).
cnf(clause_11,axiom,
( ~ r3least(X1)
| ~ a(u1r1(X1))
| c(u1r3(X1))
| e(X1) ),
file('theBenchmark.p',clause_11) ).
cnf(clause_12,axiom,
( ~ r3least(X1)
| ~ a(u1r1(X1))
| r(X1,u1r2(X1))
| e(X1) ),
file('theBenchmark.p',clause_12) ).
cnf(clause_13,axiom,
( ~ r3least(X1)
| ~ a(u1r1(X1))
| r(X1,u1r3(X1))
| e(X1) ),
file('theBenchmark.p',clause_13) ).
cnf(clause_14,axiom,
( ~ equalish(u1r3(X1),u1r2(X1))
| ~ r3least(X1)
| r(X1,u1r1(X1))
| e(X1) ),
file('theBenchmark.p',clause_14) ).
cnf(clause_15,axiom,
( ~ r3least(X1)
| c(u1r2(X1))
| r(X1,u1r1(X1))
| e(X1) ),
file('theBenchmark.p',clause_15) ).
cnf(clause_16,axiom,
( ~ r3least(X1)
| c(u1r3(X1))
| r(X1,u1r1(X1))
| e(X1) ),
file('theBenchmark.p',clause_16) ).
cnf(clause_17,axiom,
( ~ r3least(X1)
| r(X1,u1r2(X1))
| r(X1,u1r1(X1))
| e(X1) ),
file('theBenchmark.p',clause_17) ).
cnf(clause_18,axiom,
( ~ r3least(X1)
| r(X1,u1r3(X1))
| r(X1,u1r1(X1))
| e(X1) ),
file('theBenchmark.p',clause_18) ).
cnf(clause_19,axiom,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
file('theBenchmark.p',clause_19) ).
cnf(clause_20,axiom,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
file('theBenchmark.p',clause_20) ).
cnf(clause_21,axiom,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
file('theBenchmark.p',clause_21) ).
cnf(clause_22,axiom,
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
file('theBenchmark.p',clause_22) ).
cnf(clause_23,axiom,
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
file('theBenchmark.p',clause_23) ).
cnf(clause_24,axiom,
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
file('theBenchmark.p',clause_24) ).
cnf(clause_25,axiom,
( ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r(X1,X4)
| equalish(X3,X2)
| equalish(X4,X2)
| equalish(X4,X3)
| r3least(X1) ),
file('theBenchmark.p',clause_25) ).
cnf(clause_26,axiom,
( ~ f(X1)
| d(u3r1(X1)) ),
file('theBenchmark.p',clause_26) ).
cnf(clause_27,axiom,
( ~ f(X1)
| d(u3r2(X1)) ),
file('theBenchmark.p',clause_27) ).
cnf(clause_28,axiom,
( ~ equalish(u3r2(X1),u3r1(X1))
| ~ f(X1) ),
file('theBenchmark.p',clause_28) ).
cnf(clause_29,axiom,
( ~ f(X1)
| r(X1,u3r1(X1)) ),
file('theBenchmark.p',clause_29) ).
cnf(clause_30,axiom,
( ~ f(X1)
| r(X1,u3r2(X1)) ),
file('theBenchmark.p',clause_30) ).
cnf(clause_31,axiom,
( ~ d(X2)
| ~ d(X3)
| ~ r(X1,X2)
| ~ r(X1,X3)
| equalish(X3,X2)
| f(X1) ),
file('theBenchmark.p',clause_31) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS010-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN 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.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 12:08:11 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.43 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------