%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : REL046-1 : TPTP v9.2.1. Released v4.0.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 : n027.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 05:04:31 PM UTC 2026
% Result : Unsatisfiable 1.52s 1.85s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of clauses : 52 ( 50 unt; 0 nHn; 12 RR)
% Number of literals : 54 ( 53 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(goals_14,negated_conjecture,
join(sk1,meet(sk2,sk3)) = meet(sk2,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
cnf(goals_15,negated_conjecture,
( join(sk1,sk2) != sk2
| join(sk1,sk3) != sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).
cnf(c_0_12,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_13,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_14,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_16,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_18,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_19,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_20,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_21,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_22,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_24,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_26,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_23]) ).
cnf(c_0_27,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_29,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_30,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_32,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_25]),c_0_27]),c_0_18]) ).
cnf(c_0_34,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_37,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_38,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_18]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_37,c_0_18]) ).
cnf(c_0_40,negated_conjecture,
join(sk1,meet(sk2,sk3)) = meet(sk2,sk3),
goals_14 ).
cnf(c_0_41,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
join(sk1,complement(join(complement(sk2),complement(sk3)))) = complement(join(complement(sk2),complement(sk3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_21]),c_0_21]) ).
cnf(c_0_44,plain,
join(X1,complement(join(X2,join(X3,complement(X1))))) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_45,negated_conjecture,
join(complement(sk1),join(complement(sk2),complement(sk3))) = complement(sk1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_35]) ).
cnf(c_0_46,plain,
join(X1,join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_29]),c_0_29]) ).
cnf(c_0_47,negated_conjecture,
( join(sk1,sk2) != sk2
| join(sk1,sk3) != sk3 ),
goals_15 ).
cnf(c_0_48,negated_conjecture,
join(sk1,sk3) = sk3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_35]),c_0_18]) ).
cnf(c_0_49,plain,
join(X1,complement(join(X2,join(complement(X1),X3)))) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
join(sk1,sk2) != sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_35]),c_0_18]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL046-1 : TPTP v9.2.1. Released v4.0.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.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue May 5 01:44:49 EDT 2026
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % start to proof: theBenchmark
% 1.52/1.85 % Version : CSE_E---1.7
% 1.52/1.85 % Problem : theBenchmark.p
% 1.52/1.85 % SZS status Unsatisfiable for theBenchmark.p
% 1.52/1.85 % SZS output start CNFRefutation
% See solution above
% 1.52/1.85 % Total time : 1.375s
%------------------------------------------------------------------------------