%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT152-1 : TPTP v9.2.1. Released v3.1.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:35 PM UTC 2026
% Result : Unsatisfiable 1.89s 1.90s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 4 RR)
% Number of literals : 45 ( 44 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 110 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(equation_H40,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,meet(X3,join(X4,meet(X3,join(X1,X2)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H40) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(prove_H6,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_H6) ).
cnf(c_0_10,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_12,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_13,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_14,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_16,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_18,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_17]) ).
cnf(c_0_21,plain,
join(meet(X1,join(X2,X3)),meet(X4,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_23,plain,
join(meet(X1,join(X2,X3)),meet(X4,meet(X1,X3))) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_24,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_25,plain,
join(meet(X1,join(X2,meet(X1,X3))),meet(X4,meet(X1,X3))) = meet(X1,join(X2,meet(X1,X3))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_27,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_17]) ).
cnf(c_0_28,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,meet(X3,join(X4,meet(X3,join(X1,X2)))))),
equation_H40 ).
cnf(c_0_29,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_30,plain,
join(meet(X1,X2),meet(X1,join(X3,meet(X1,X2)))) = meet(X1,join(X3,meet(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_11]) ).
cnf(c_0_31,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]) ).
cnf(c_0_32,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,meet(X3,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_28]),c_0_29]),c_0_24]) ).
cnf(c_0_33,plain,
meet(X1,join(meet(X2,X3),meet(X2,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_30]),c_0_24]),c_0_30]),c_0_31]),c_0_32]) ).
cnf(c_0_34,plain,
meet(X1,join(meet(X2,X3),meet(X1,X2))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_35,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_36,plain,
meet(X1,join(meet(X1,X2),meet(X3,join(X4,meet(X3,X1))))) = meet(X1,join(meet(X1,X2),meet(X3,join(X1,X4)))),
inference(spm,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_37,plain,
meet(X1,join(meet(X1,X2),meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_11]) ).
cnf(c_0_38,plain,
meet(X1,meet(X2,join(meet(X2,X1),X3))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_39,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
prove_H6 ).
cnf(c_0_40,plain,
meet(X1,join(meet(X1,X2),meet(X3,join(X4,meet(X1,X3))))) = meet(X1,join(meet(X1,X2),meet(X3,join(X1,X4)))),
inference(spm,[status(thm)],[c_0_36,c_0_13]) ).
cnf(c_0_41,plain,
meet(X1,join(meet(X1,X2),meet(X3,X2))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
meet(a,join(meet(c,join(a,b)),meet(a,join(b,meet(a,c))))) != meet(a,join(b,meet(a,c))),
inference(rw,[status(thm)],[c_0_39,c_0_11]) ).
cnf(c_0_43,plain,
meet(X1,join(meet(X2,join(X1,X3)),meet(X1,join(X3,meet(X1,X2))))) = meet(X1,join(X3,meet(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_11]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT152-1 : TPTP v9.2.1. Released v3.1.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:51:56 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.89/1.90 % Version : CSE_E---1.7
% 1.89/1.90 % Problem : theBenchmark.p
% 1.89/1.90 % SZS status Unsatisfiable for theBenchmark.p
% 1.89/1.90 % SZS output start CNFRefutation
% See solution above
% 1.89/1.90 % Total time : 1.372s
%------------------------------------------------------------------------------