%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT043-1 : TPTP v9.2.1. Released v2.5.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 : n019.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:25 PM UTC 2026
% Result : Unsatisfiable 1.68s 1.84s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of clauses : 58 ( 58 unt; 0 nHn; 3 RR)
% Number of literals : 58 ( 57 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 104 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(invertability2,axiom,
meet(complement(X1),X1) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(invertability1,axiom,
join(complement(X1),X1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(distributivity,axiom,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity) ).
cnf(invertability3,axiom,
complement(complement(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability3) ).
cnf(prove_compatability_law,negated_conjecture,
complement(join(c,d)) != meet(complement(c),complement(d)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_compatability_law) ).
cnf(c_0_11,axiom,
meet(complement(X1),X1) = n0,
invertability2 ).
cnf(c_0_12,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_13,axiom,
join(complement(X1),X1) = n1,
invertability1 ).
cnf(c_0_14,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_15,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_16,plain,
meet(X1,complement(X1)) = n0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_18,plain,
join(X1,complement(X1)) = n1,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
join(X1,n0) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
meet(X1,n1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
join(n0,X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_22,plain,
meet(n1,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_23,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_24,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_25,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_26,plain,
meet(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_27,plain,
join(n1,X1) = n1,
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_28,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,axiom,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
distributivity ).
cnf(c_0_30,plain,
meet(X1,meet(complement(X1),X2)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_26]) ).
cnf(c_0_31,axiom,
complement(complement(X1)) = X1,
invertability3 ).
cnf(c_0_32,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_33,plain,
join(X1,join(complement(X1),X2)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_27]) ).
cnf(c_0_34,plain,
join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
meet(complement(X1),meet(X1,X2)) = n0,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_12]) ).
cnf(c_0_37,plain,
join(complement(X1),join(X1,X2)) = n1,
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_38,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_32]),c_0_14]) ).
cnf(c_0_39,plain,
join(X1,join(X2,complement(join(X1,X2)))) = n1,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_40,plain,
join(X1,meet(X2,complement(X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_18]),c_0_20]) ).
cnf(c_0_41,plain,
meet(complement(X1),meet(X2,X1)) = n0,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
meet(X1,join(complement(X1),X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_21]) ).
cnf(c_0_43,plain,
join(complement(X1),join(X2,X1)) = n1,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
join(X1,join(X2,complement(join(X2,X1)))) = n1,
inference(spm,[status(thm)],[c_0_39,c_0_14]) ).
cnf(c_0_45,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_40,c_0_12]) ).
cnf(c_0_46,plain,
meet(X1,complement(join(X2,X1))) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_32]),c_0_12]) ).
cnf(c_0_47,plain,
meet(complement(X1),join(X1,X2)) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_48,plain,
join(X1,complement(meet(X2,X1))) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_24]),c_0_14]) ).
cnf(c_0_49,plain,
meet(X1,join(X2,complement(join(X2,complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_44]),c_0_20]) ).
cnf(c_0_50,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_19]) ).
cnf(c_0_51,plain,
meet(complement(X1),complement(meet(X2,X1))) = complement(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_20]) ).
cnf(c_0_52,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_49]),c_0_23]),c_0_14]),c_0_50]) ).
cnf(c_0_53,plain,
meet(complement(X1),complement(join(X1,X2))) = complement(join(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_17]),c_0_12]) ).
cnf(c_0_54,plain,
complement(join(X1,complement(X2))) = meet(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_52]),c_0_47]),c_0_53]) ).
cnf(c_0_55,negated_conjecture,
complement(join(c,d)) != meet(complement(c),complement(d)),
prove_compatability_law ).
cnf(c_0_56,plain,
meet(complement(X1),complement(X2)) = complement(join(X1,X2)),
inference(spm,[status(thm)],[c_0_54,c_0_31]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT043-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n019.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 20:48:44 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.68/1.84 % Version : CSE_E---1.7
% 1.68/1.84 % Problem : theBenchmark.p
% 1.68/1.84 % SZS status Unsatisfiable for theBenchmark.p
% 1.68/1.84 % SZS output start CNFRefutation
% See solution above
% 1.68/1.84 % Total time : 1.374s
%------------------------------------------------------------------------------