%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT010-1 : TPTP v9.2.1. Released v2.2.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 : n023.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:18 PM UTC 2026
% Result : Unsatisfiable 22.57s 15.28s
% Output : CNFRefutation 22.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 5 RR)
% Number of literals : 46 ( 45 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 113 ( 17 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_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(nr_3,hypothesis,
meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))) = join(meet(X3,join(X1,meet(X2,X3))),meet(X1,join(X2,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nr_3) ).
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(prove_this,negated_conjecture,
meet(a,meet(join(b,c),join(b,d))) != meet(meet(a,meet(join(b,c),join(b,d))),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(c_0_9,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_10,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_11,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_12,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_13,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_14,hypothesis,
meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))) = join(meet(X3,join(X1,meet(X2,X3))),meet(X1,join(X2,X3))),
nr_3 ).
cnf(c_0_15,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_17,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_19,hypothesis,
join(meet(X1,join(X2,X3)),meet(X3,join(X1,meet(X2,X3)))) = meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))),
inference(rw,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_20,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_23,hypothesis,
meet(X1,meet(join(X2,X3),meet(join(X1,meet(X2,X3)),meet(join(X3,meet(X1,X2)),X4)))) = meet(X1,meet(join(X2,X3),X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_24,plain,
meet(X1,meet(X2,meet(join(X1,X3),X4))) = meet(X1,meet(X4,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_25,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_13]) ).
cnf(c_0_26,plain,
join(X1,join(X2,meet(X3,X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_9]),c_0_16]) ).
cnf(c_0_27,hypothesis,
meet(X1,meet(join(X2,X3),meet(join(X3,meet(X1,X2)),X4))) = meet(X1,meet(join(X2,X3),X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_13]),c_0_20]) ).
cnf(c_0_28,plain,
meet(join(X1,X2),meet(join(X2,meet(X3,X1)),X4)) = meet(join(X2,meet(X3,X1)),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20]) ).
cnf(c_0_29,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_30,hypothesis,
meet(X1,meet(join(X2,meet(X1,X3)),X4)) = meet(X1,meet(join(X3,X2),X4)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
meet(a,meet(join(b,c),join(b,d))) != meet(meet(a,meet(join(b,c),join(b,d))),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))),
prove_this ).
cnf(c_0_32,plain,
meet(join(X1,X2),join(X2,meet(join(X1,X2),X3))) = join(X2,meet(join(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_12]) ).
cnf(c_0_33,hypothesis,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_25]) ).
cnf(c_0_34,negated_conjecture,
meet(a,meet(join(b,c),meet(join(b,d),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))))) != meet(a,meet(join(b,c),join(b,d))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_13]),c_0_13]) ).
cnf(c_0_35,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_36,plain,
join(X1,meet(join(X2,X1),X3)) = meet(join(X2,X1),join(X3,X1)),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
meet(join(X1,X2),join(X1,join(X2,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_38,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_39,negated_conjecture,
meet(a,meet(join(b,c),meet(join(b,d),join(meet(a,c),join(meet(a,d),meet(a,join(b,meet(c,d)))))))) != meet(a,meet(join(b,c),join(b,d))),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_11]),c_0_33]) ).
cnf(c_0_41,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_16]) ).
cnf(c_0_42,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_13]) ).
cnf(c_0_43,plain,
meet(join(X1,X2),join(X1,join(X3,X2))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_10]) ).
cnf(c_0_44,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_26]),c_0_10]),c_0_40]),c_0_41]),c_0_42]),c_0_43]),c_0_42]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT010-1 : TPTP v9.2.1. Released v2.2.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.17/0.33 % Computer : n023.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Mon May 4 20:48:08 EDT 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.34 % start to proof: theBenchmark
% 22.57/15.28 % Version : CSE_E---1.7
% 22.57/15.28 % Problem : theBenchmark.p
% 22.57/15.28 % SZS status Unsatisfiable for theBenchmark.p
% 22.57/15.28 % SZS output start CNFRefutation
% See solution above
% 22.68/15.33 % Total time : 12.392s
%------------------------------------------------------------------------------