%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LAT035-1 : TPTP v9.3.1. Released v2.4.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 : n017.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:41 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.40s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 16 unt; 0 nHn; 22 RR)
% Number of literals : 35 ( 27 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k_on_join,axiom,
k(join(U,V)) = meet(k(U),k(V)),
file('theBenchmark.p',k_on_join) ).
cnf(k_on_bottom,axiom,
k(n0) = n1,
file('theBenchmark.p',k_on_bottom) ).
cnf(f_on_meet,axiom,
f(meet(U,V)) = join(f(U),f(V)),
file('theBenchmark.p',f_on_meet) ).
cnf(f_on_top,axiom,
f(n1) = n0,
file('theBenchmark.p',f_on_top) ).
cnf(comp_join_hemimorphism,negated_conjecture,
( f(k(n0)) != n0
| f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb))) ),
file('theBenchmark.p',comp_join_hemimorphism) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_7,axiom,
( f(Eq_x_0) = f(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(t1,plain,
( f(k(n0)) != n0
| f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb))) ),
inference(start,[status(thm),parent(0:0)],[comp_join_hemimorphism]) ).
cnf(t2,plain,
( f(meet(k(aa),k(bb))) != join(f(k(aa)),f(k(bb)))
| f(k(join(aa,bb))) != f(meet(k(aa),k(bb)))
| f(k(join(aa,bb))) = join(f(k(aa)),f(k(bb))) ),
inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( k(join(aa,bb)) != meet(k(aa),k(bb))
| f(k(join(aa,bb))) = f(meet(k(aa),k(bb))) ),
inference(extension,[status(thm),parent(t2:2)],[equality_7]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
k(join(aa,bb)) = meet(k(aa),k(bb)),
inference(extension,[status(thm),parent(t4:2)],[k_on_join]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
f(meet(k(aa),k(bb))) = join(f(k(aa)),f(k(bb))),
inference(extension,[status(thm),parent(t2:3)],[f_on_meet]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
cnf(t10,plain,
( f(n1) != n0
| f(k(n0)) != f(n1)
| f(k(n0)) = n0 ),
inference(extension,[status(thm),parent(t1:2)],[equality_3]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t1:2]) ).
cnf(t12,plain,
( k(n0) != n1
| f(k(n0)) = f(n1) ),
inference(extension,[status(thm),parent(t10:2)],[equality_7]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
k(n0) = n1,
inference(extension,[status(thm),parent(t12:2)],[k_on_bottom]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
f(n1) = n0,
inference(extension,[status(thm),parent(t10:3)],[f_on_top]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t10:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT035-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_NUE 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/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 19 12:28:10 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------