%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT007-1 : TPTP v9.2.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n025.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 2.02s 1.94s
% Output : CNFRefutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 4 RR)
% Number of literals : 38 ( 37 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 80 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distribution,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distribution) ).
cnf(absorption,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorption) ).
cnf(prove_associativity_of_join,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_associativity_of_join) ).
cnf(c_0_3,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
distribution ).
cnf(c_0_4,axiom,
meet(X1,join(X1,X2)) = X1,
absorption ).
cnf(c_0_5,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X3,join(X1,X2))),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
meet(join(X1,X2),join(X1,X3)) = join(meet(X3,join(X1,X2)),X1),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,plain,
join(X1,join(meet(X2,join(X1,X2)),X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_8,plain,
join(X1,join(X1,X1)) = join(X1,X1),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
join(join(meet(X1,join(X2,X2)),X2),X2) = join(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_6]),c_0_4]),c_0_6]) ).
cnf(c_0_10,plain,
join(join(X1,X1),X1) = join(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_11,plain,
join(join(X1,X1),join(X1,X1)) = join(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_4]),c_0_8]) ).
cnf(c_0_12,plain,
meet(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_13,plain,
meet(join(X1,X1),join(X2,X2)) = meet(X2,join(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_3]),c_0_3]) ).
cnf(c_0_14,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_15,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_4]),c_0_4]) ).
cnf(c_0_16,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_14]),c_0_3]) ).
cnf(c_0_17,plain,
join(meet(X1,X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_15]),c_0_4]) ).
cnf(c_0_18,plain,
meet(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_19,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_21,plain,
join(X1,X2) = join(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6]),c_0_19]) ).
cnf(c_0_22,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_23,plain,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_19]),c_0_21]) ).
cnf(c_0_24,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_14]),c_0_3]) ).
cnf(c_0_25,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_26,plain,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_22]),c_0_23]) ).
cnf(c_0_27,plain,
meet(meet(X1,X2),join(X3,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]) ).
cnf(c_0_28,plain,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]) ).
cnf(c_0_29,plain,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(X1,X3)),
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_30,plain,
join(X1,join(X2,meet(X3,X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_19]) ).
cnf(c_0_31,plain,
join(join(X1,X2),join(X3,X2)) = join(join(X1,X2),X3),
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_32,plain,
join(join(X1,X2),X3) = join(join(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_31]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
prove_associativity_of_join ).
cnf(c_0_34,plain,
join(join(X1,X2),X3) = join(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
join(c,join(a,b)) != join(a,join(b,c)),
inference(rw,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_36,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_34]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT007-1 : TPTP v9.2.1. Released v2.2.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n025.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 20:47:28 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 2.02/1.94 % Version : CSE_E---1.7
% 2.02/1.94 % Problem : theBenchmark.p
% 2.02/1.94 % SZS status Unsatisfiable for theBenchmark.p
% 2.02/1.94 % SZS output start CNFRefutation
% See solution above
% 2.02/1.94 % Total time : 1.371s
%------------------------------------------------------------------------------