%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT035-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:37:24 PM UTC 2026
% Result : Unsatisfiable 1.24s 1.72s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 11 unt; 0 nHn; 10 RR)
% Number of literals : 17 ( 16 equ; 8 neg)
% Maximal clause size : 2 ( 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 : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(comp_join_hemimorphism,negated_conjecture,
( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))
| f(k(n0)) != n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',comp_join_hemimorphism) ).
cnf(k_on_bottom,axiom,
k(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_on_bottom) ).
cnf(f_on_top,axiom,
f(n1) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f_on_top) ).
cnf(f_on_meet,axiom,
f(meet(X1,X2)) = join(f(X1),f(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f_on_meet) ).
cnf(k_on_join,axiom,
k(join(X1,X2)) = meet(k(X1),k(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_on_join) ).
cnf(c_0_5,negated_conjecture,
( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))
| f(k(n0)) != n0 ),
comp_join_hemimorphism ).
cnf(c_0_6,axiom,
k(n0) = n1,
k_on_bottom ).
cnf(c_0_7,negated_conjecture,
( join(f(k(aa)),f(k(bb))) != f(k(join(aa,bb)))
| f(n1) != n0 ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
f(n1) = n0,
f_on_top ).
cnf(c_0_9,negated_conjecture,
join(f(k(aa)),f(k(bb))) != f(k(join(aa,bb))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_10,axiom,
f(meet(X1,X2)) = join(f(X1),f(X2)),
f_on_meet ).
cnf(c_0_11,negated_conjecture,
f(meet(k(aa),k(bb))) != f(k(join(aa,bb))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
k(join(X1,X2)) = meet(k(X1),k(X2)),
k_on_join ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT035-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n009.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 20:47:41 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.24/1.72 % Version : CSE_E---1.7
% 1.24/1.72 % Problem : theBenchmark.p
% 1.24/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.72 % SZS output start CNFRefutation
% See solution above
% 1.24/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------