%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : REL004+2 : TPTP v9.2.1. Released v4.0.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 : n024.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:09 PM UTC 2026
% Result : Theorem 1.44s 1.71s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 12
% Syntax : Number of formulae : 92 ( 92 unt; 0 def)
% Number of atoms : 92 ( 91 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 135 ( 8 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(goals,conjecture,
! [X1] : converse(complement(X1)) = complement(converse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(c_0_12,plain,
! [X58,X59] : converse(composition(X58,X59)) = composition(converse(X59),converse(X58)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_13,plain,
! [X55] : converse(converse(X55)) = X55,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_14,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X51] : composition(X51,one) = X51,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_17,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X41,X42,X43] : join(X41,join(X42,X43)) = join(join(X41,X42),X43),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
fof(c_0_20,plain,
! [X62] : top = join(X62,complement(X62)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_21,plain,
! [X60,X61] : join(composition(converse(X60),complement(composition(X60,X61))),complement(X61)) = complement(X61),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_22,plain,
! [X39,X40] : join(X39,X40) = join(X40,X39),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_23,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]) ).
cnf(c_0_24,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_29,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
fof(c_0_32,plain,
! [X44,X45] : X44 = join(complement(join(complement(X44),complement(X45))),complement(join(complement(X44),X45))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_33,plain,
! [X46,X47] : meet(X46,X47) = complement(join(complement(X46),complement(X47))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_34,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_35,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28]),c_0_31]) ).
fof(c_0_36,plain,
! [X63] : zero = meet(X63,complement(X63)),
inference(variable_rename,[status(thm)],[def_zero]) ).
cnf(c_0_37,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
join(top,complement(complement(X1))) = join(X1,top),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_40,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25]) ).
cnf(c_0_41,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_25]),c_0_41]) ).
cnf(c_0_45,plain,
join(zero,meet(X1,top)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_27]) ).
cnf(c_0_46,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_27]),c_0_38]) ).
cnf(c_0_47,plain,
complement(join(zero,complement(X1))) = meet(top,X1),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_48,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_35]),c_0_41]) ).
cnf(c_0_49,plain,
join(zero,meet(top,X1)) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
meet(top,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
join(zero,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_48,c_0_51]) ).
cnf(c_0_53,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_52]) ).
cnf(c_0_54,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_53]) ).
cnf(c_0_55,plain,
complement(join(X1,complement(X2))) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_38,c_0_52]) ).
cnf(c_0_56,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_27]),c_0_24]) ).
cnf(c_0_57,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_42]),c_0_27]) ).
cnf(c_0_58,plain,
complement(join(complement(X1),X2)) = meet(complement(X2),X1),
inference(spm,[status(thm)],[c_0_55,c_0_27]) ).
fof(c_0_59,plain,
! [X56,X57] : converse(join(X56,X57)) = join(converse(X56),converse(X57)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_60,plain,
join(X1,join(X2,meet(X1,X3))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_58]) ).
cnf(c_0_62,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_63,plain,
join(complement(X1),meet(X2,X1)) = join(complement(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_27]) ).
cnf(c_0_64,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_62,c_0_15]) ).
cnf(c_0_65,plain,
meet(X1,complement(meet(X2,X1))) = meet(complement(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_63]),c_0_58]),c_0_46]) ).
cnf(c_0_66,plain,
complement(meet(complement(X1),X2)) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_52,c_0_55]) ).
cnf(c_0_67,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_64,c_0_25]) ).
cnf(c_0_68,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_69,plain,
meet(X1,X1) = complement(complement(X1)),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_70,plain,
meet(X1,join(X2,complement(X1))) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_52]) ).
cnf(c_0_71,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,plain,
meet(top,X1) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_52]) ).
cnf(c_0_73,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_69,c_0_52]) ).
cnf(c_0_74,plain,
meet(X1,join(complement(X1),X2)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_70,c_0_27]) ).
cnf(c_0_75,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[c_0_67,c_0_71]) ).
cnf(c_0_76,plain,
meet(X1,top) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_72]) ).
cnf(c_0_77,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[c_0_29,c_0_68]) ).
cnf(c_0_78,plain,
join(X1,zero) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_73]),c_0_27]),c_0_25]),c_0_44]) ).
cnf(c_0_79,plain,
meet(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_46]) ).
cnf(c_0_80,plain,
meet(X1,join(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_77]),c_0_52]),c_0_44]),c_0_78]) ).
cnf(c_0_81,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_54,c_0_27]) ).
cnf(c_0_82,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_79]),c_0_52]),c_0_52]) ).
cnf(c_0_83,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_84,plain,
join(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_82]),c_0_15]),c_0_15]) ).
fof(c_0_85,negated_conjecture,
~ ! [X1] : converse(complement(X1)) = complement(converse(X1)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_86,plain,
converse(complement(converse(complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_46]),c_0_79]) ).
fof(c_0_87,negated_conjecture,
converse(complement(esk1_0)) != complement(converse(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_85])])]) ).
cnf(c_0_88,plain,
complement(converse(complement(X1))) = converse(X1),
inference(spm,[status(thm)],[c_0_15,c_0_86]) ).
cnf(c_0_89,negated_conjecture,
converse(complement(esk1_0)) != complement(converse(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_90,plain,
complement(converse(X1)) = converse(complement(X1)),
inference(spm,[status(thm)],[c_0_52,c_0_88]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : REL004+2 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.07 % 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.07/0.25 % Computer : n024.cluster.edu
% 0.07/0.25 % Model : x86_64 x86_64
% 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25 % Memory : 8042.1875MB
% 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25 % CPULimit : 300
% 0.07/0.25 % WCLimit : 300
% 0.07/0.25 % DateTime : Mon May 4 20:39:27 EDT 2026
% 0.07/0.25 % CPUTime :
% 0.07/0.26 % start to proof: theBenchmark
% 1.44/1.71 % Version : CSE_E---1.7
% 1.44/1.71 % Problem : theBenchmark.p
% 1.44/1.71 % SZS status Theorem for theBenchmark.p
% 1.44/1.71 % SZS output start CNFRefutation
% See solution above
% 1.44/1.72 % Total time : 1.361s
%------------------------------------------------------------------------------