%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : REL024+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:24:53 AM UTC 2026
% Result : Theorem 6.78s 1.37s
% Output : CNFRefutation 6.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 13
% Syntax : Number of formulae : 94 ( 94 unt; 0 def)
% Number of atoms : 94 ( 93 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Maximal term depth : 7 ( 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 : 154 ( 4 sgn 28 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(maddux1_join_commutativity,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('theBenchmark.p',maddux1_join_commutativity) ).
fof(maddux2_join_associativity,axiom,
! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
file('theBenchmark.p',maddux2_join_associativity) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X0,X1] : X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))),
file('theBenchmark.p',maddux3_a_kind_of_de_Morgan) ).
fof(maddux4_definiton_of_meet,axiom,
! [X0,X1] : meet(X0,X1) = complement(join(complement(X0),complement(X1))),
file('theBenchmark.p',maddux4_definiton_of_meet) ).
fof(composition_identity,axiom,
! [X0] : composition(X0,one) = X0,
file('theBenchmark.p',composition_identity) ).
fof(composition_distributivity,axiom,
! [X0,X1,X2] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
file('theBenchmark.p',composition_distributivity) ).
fof(converse_idempotence,axiom,
! [X0] : converse(converse(X0)) = X0,
file('theBenchmark.p',converse_idempotence) ).
fof(converse_additivity,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('theBenchmark.p',converse_additivity) ).
fof(converse_multiplicativity,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('theBenchmark.p',converse_multiplicativity) ).
fof(converse_cancellativity,axiom,
! [X0,X1] : join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
file('theBenchmark.p',converse_cancellativity) ).
fof(def_top,axiom,
! [X0] : top = join(X0,complement(X0)),
file('theBenchmark.p',def_top) ).
fof(def_zero,axiom,
! [X0] : zero = meet(X0,complement(X0)),
file('theBenchmark.p',def_zero) ).
fof(goals,conjecture,
! [X0,X1,X2] : join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(meet(X0,converse(X1)),X2)) = composition(meet(X0,converse(X1)),X2),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0,X1,X2] : join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(meet(X0,converse(X1)),X2)) = composition(meet(X0,converse(X1)),X2),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_15,plain,
join(A,B) = join(B,A),
inference(clausify,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_16,plain,
join(join(A,B),C) = join(A,join(B,C)),
inference(clausify,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_17,plain,
join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A,
inference(clausify,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
cnf(c_18,plain,
join(complement(join(complement(A),B)),complement(join(complement(A),complement(B)))) = A,
inference(paramod,[status(thm)],[c_15,c_17]) ).
cnf(c_19,plain,
meet(A,B) = complement(join(complement(A),complement(B))),
inference(clausify,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_21,plain,
composition(A,one) = A,
inference(clausify,[status(thm)],[composition_identity]) ).
cnf(c_22,plain,
composition(join(A,B),C) = join(composition(A,C),composition(B,C)),
inference(clausify,[status(thm)],[composition_distributivity]) ).
cnf(c_23,plain,
converse(converse(A)) = A,
inference(clausify,[status(thm)],[converse_idempotence]) ).
cnf(c_24,plain,
converse(join(A,B)) = join(converse(A),converse(B)),
inference(clausify,[status(thm)],[converse_additivity]) ).
cnf(c_25,plain,
converse(composition(A,B)) = composition(converse(B),converse(A)),
inference(clausify,[status(thm)],[converse_multiplicativity]) ).
cnf(c_26,plain,
complement(A) = join(composition(converse(B),complement(composition(B,A))),complement(A)),
inference(clausify,[status(thm)],[converse_cancellativity]) ).
cnf(c_1994,plain,
complement(A) = join(complement(A),composition(converse(B),complement(composition(B,A)))),
inference(paramod,[status(thm)],[c_15,c_26]) ).
cnf(c_27,plain,
join(complement(A),composition(converse(B),complement(composition(B,A)))) = complement(A),
inference(copy,[status(thm)],[c_1994]) ).
cnf(c_28,plain,
join(A,complement(A)) = top,
inference(clausify,[status(thm)],[def_top]) ).
cnf(c_29,plain,
meet(A,complement(A)) = zero,
inference(clausify,[status(thm)],[def_zero]) ).
cnf(c_1995,plain,
complement(join(complement(A),complement(complement(A)))) = zero,
inference(paramod,[status(thm)],[c_19,c_29]) ).
cnf(c_30,plain,
complement(top) = zero,
inference(paramod,[status(thm)],[c_28,c_1995]) ).
fof(nnf_14,plain,
? [X0,X1,X2] : composition(meet(X0,converse(X1)),X2) != join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(meet(X0,converse(X1)),X2)),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
composition(meet(sK0,converse(sK1)),sK2) != join(composition(meet(sK0,converse(sK1)),meet(sK1,sK2)),composition(meet(sK0,converse(sK1)),sK2)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[nnf_14]) ).
cnf(c_31,negated_conjecture,
composition(meet(sK0,converse(sK1)),sK2) != join(composition(meet(sK0,converse(sK1)),meet(sK1,sK2)),composition(meet(sK0,converse(sK1)),sK2)),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_1996,negated_conjecture,
composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2) != join(composition(meet(sK0,converse(sK1)),meet(sK1,sK2)),composition(meet(sK0,converse(sK1)),sK2)),
inference(paramod,[status(thm)],[c_19,c_31]) ).
cnf(c_1997,negated_conjecture,
composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2) != join(composition(complement(join(complement(sK0),complement(converse(sK1)))),meet(sK1,sK2)),composition(meet(sK0,converse(sK1)),sK2)),
inference(paramod,[status(thm)],[c_19,c_1996]) ).
cnf(c_1998,negated_conjecture,
composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2) != join(composition(complement(join(complement(sK0),complement(converse(sK1)))),complement(join(complement(sK1),complement(sK2)))),composition(meet(sK0,converse(sK1)),sK2)),
inference(paramod,[status(thm)],[c_19,c_1997]) ).
cnf(c_1999,negated_conjecture,
composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2) != join(composition(complement(join(complement(sK0),complement(converse(sK1)))),complement(join(complement(sK1),complement(sK2)))),composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2)),
inference(paramod,[status(thm)],[c_19,c_1998]) ).
cnf(c_2000,negated_conjecture,
composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2) != join(composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2),composition(complement(join(complement(sK0),complement(converse(sK1)))),complement(join(complement(sK1),complement(sK2))))),
inference(paramod,[status(thm)],[c_15,c_1999]) ).
cnf(c_32,negated_conjecture,
join(composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2),composition(complement(join(complement(sK0),complement(converse(sK1)))),complement(join(complement(sK1),complement(sK2))))) != composition(complement(join(complement(sK0),complement(converse(sK1)))),sK2),
inference(copy,[status(thm)],[c_2000]) ).
cnf(c_35,plain,
join(complement(join(A,complement(B))),complement(join(complement(B),complement(A)))) = B,
inference(paramod,[status(thm)],[c_15,c_18]) ).
cnf(c_36,plain,
join(complement(join(complement(A),B)),complement(join(complement(B),complement(A)))) = A,
inference(paramod,[status(thm)],[c_15,c_18]) ).
cnf(c_2001,plain,
converse(A) = composition(converse(one),converse(A)),
inference(paramod,[status(thm)],[c_21,c_25]) ).
cnf(c_43,plain,
composition(converse(one),converse(A)) = converse(A),
inference(copy,[status(thm)],[c_2001]) ).
cnf(c_2002,plain,
converse(join(composition(A,B),composition(C,B))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_22,c_25]) ).
cnf(c_2003,plain,
join(converse(composition(A,B)),converse(composition(C,B))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_24,c_2002]) ).
cnf(c_2004,plain,
join(composition(converse(B),converse(A)),converse(composition(C,B))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_25,c_2003]) ).
cnf(c_2005,plain,
join(composition(converse(B),converse(A)),composition(converse(B),converse(C))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_25,c_2004]) ).
cnf(c_2006,plain,
join(composition(converse(B),converse(A)),composition(converse(B),converse(C))) = composition(converse(B),join(converse(A),converse(C))),
inference(paramod,[status(thm)],[c_24,c_2005]) ).
cnf(c_44,plain,
composition(converse(A),join(converse(B),converse(C))) = join(composition(converse(A),converse(B)),composition(converse(A),converse(C))),
inference(copy,[status(thm)],[c_2006]) ).
cnf(c_2007,plain,
join(complement(top),complement(join(complement(A),complement(complement(complement(A)))))) = A,
inference(paramod,[status(thm)],[c_28,c_18]) ).
cnf(c_55,plain,
join(zero,complement(join(complement(A),complement(complement(complement(A)))))) = A,
inference(paramod,[status(thm)],[c_30,c_2007]) ).
cnf(c_68,plain,
join(complement(join(A,complement(B))),complement(join(complement(A),complement(B)))) = B,
inference(paramod,[status(thm)],[c_15,c_35]) ).
cnf(c_2008,plain,
join(complement(join(complement(complement(A)),A)),complement(top)) = complement(A),
inference(paramod,[status(thm)],[c_28,c_36]) ).
cnf(c_2009,plain,
join(complement(join(A,complement(complement(A)))),complement(top)) = complement(A),
inference(paramod,[status(thm)],[c_15,c_2008]) ).
cnf(c_2010,plain,
join(complement(join(A,complement(complement(A)))),zero) = complement(A),
inference(paramod,[status(thm)],[c_30,c_2009]) ).
cnf(c_86,plain,
join(zero,complement(join(A,complement(complement(A))))) = complement(A),
inference(paramod,[status(thm)],[c_15,c_2010]) ).
cnf(c_92,plain,
complement(complement(A)) = A,
inference(paramod,[status(thm)],[c_86,c_55]) ).
cnf(c_93,plain,
join(zero,complement(join(A,A))) = complement(A),
inference(paramod,[status(thm)],[c_92,c_86]) ).
cnf(c_2011,plain,
composition(converse(one),A) = converse(converse(A)),
inference(paramod,[status(thm)],[c_23,c_43]) ).
cnf(c_101,plain,
composition(converse(one),A) = A,
inference(paramod,[status(thm)],[c_23,c_2011]) ).
cnf(c_2012,plain,
one = converse(one),
inference(paramod,[status(thm)],[c_101,c_21]) ).
cnf(c_103,plain,
converse(one) = one,
inference(copy,[status(thm)],[c_2012]) ).
cnf(c_107,plain,
join(complement(A),complement(composition(one,A))) = complement(A),
inference(paramod,[status(thm)],[c_101,c_27]) ).
cnf(c_108,plain,
composition(one,A) = A,
inference(paramod,[status(thm)],[c_103,c_101]) ).
cnf(c_109,plain,
join(complement(A),complement(A)) = complement(A),
inference(paramod,[status(thm)],[c_108,c_107]) ).
cnf(c_2013,plain,
join(complement(join(complement(A),A)),complement(complement(A))) = A,
inference(paramod,[status(thm)],[c_109,c_18]) ).
cnf(c_2014,plain,
join(complement(join(A,complement(A))),complement(complement(A))) = A,
inference(paramod,[status(thm)],[c_15,c_2013]) ).
cnf(c_2015,plain,
join(complement(top),complement(complement(A))) = A,
inference(paramod,[status(thm)],[c_28,c_2014]) ).
cnf(c_2016,plain,
join(zero,complement(complement(A))) = A,
inference(paramod,[status(thm)],[c_30,c_2015]) ).
cnf(c_168,plain,
join(zero,A) = A,
inference(paramod,[status(thm)],[c_92,c_2016]) ).
cnf(c_180,plain,
complement(join(A,A)) = complement(A),
inference(paramod,[status(thm)],[c_168,c_93]) ).
cnf(c_2017,plain,
join(complement(join(complement(A),B)),complement(join(complement(join(A,A)),complement(B)))) = join(A,A),
inference(paramod,[status(thm)],[c_180,c_18]) ).
cnf(c_2018,plain,
join(complement(join(complement(A),B)),complement(join(complement(A),complement(B)))) = join(A,A),
inference(paramod,[status(thm)],[c_180,c_2017]) ).
cnf(c_2019,plain,
A = join(A,A),
inference(paramod,[status(thm)],[c_18,c_2018]) ).
cnf(c_210,plain,
join(A,A) = A,
inference(copy,[status(thm)],[c_2019]) ).
cnf(c_2020,plain,
composition(A,join(converse(B),converse(C))) = join(composition(converse(converse(A)),converse(B)),composition(converse(converse(A)),converse(C))),
inference(paramod,[status(thm)],[c_23,c_44]) ).
cnf(c_2021,plain,
composition(A,join(converse(B),converse(C))) = join(composition(A,converse(B)),composition(converse(converse(A)),converse(C))),
inference(paramod,[status(thm)],[c_23,c_2020]) ).
cnf(c_222,plain,
composition(A,join(converse(B),converse(C))) = join(composition(A,converse(B)),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_23,c_2021]) ).
cnf(c_2022,plain,
join(A,B) = join(A,join(A,B)),
inference(paramod,[status(thm)],[c_210,c_16]) ).
cnf(c_241,plain,
join(A,join(A,B)) = join(A,B),
inference(copy,[status(thm)],[c_2022]) ).
cnf(c_2023,plain,
join(complement(join(A,B)),complement(join(complement(A),complement(complement(B))))) = complement(B),
inference(paramod,[status(thm)],[c_92,c_68]) ).
cnf(c_507,plain,
join(complement(join(A,B)),complement(join(complement(A),B))) = complement(B),
inference(paramod,[status(thm)],[c_92,c_2023]) ).
cnf(c_2024,plain,
join(complement(join(A,complement(B))),B) = join(complement(join(A,complement(B))),complement(join(complement(A),complement(B)))),
inference(paramod,[status(thm)],[c_68,c_241]) ).
cnf(c_2025,plain,
join(B,complement(join(A,complement(B)))) = join(complement(join(A,complement(B))),complement(join(complement(A),complement(B)))),
inference(paramod,[status(thm)],[c_15,c_2024]) ).
cnf(c_2026,plain,
join(B,complement(join(A,complement(B)))) = complement(complement(B)),
inference(paramod,[status(thm)],[c_507,c_2025]) ).
cnf(c_508,plain,
join(A,complement(join(B,complement(A)))) = A,
inference(paramod,[status(thm)],[c_92,c_2026]) ).
cnf(c_2027,plain,
composition(A,join(B,converse(C))) = join(composition(A,converse(converse(B))),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_23,c_222]) ).
cnf(c_1651,plain,
composition(A,join(B,converse(C))) = join(composition(A,B),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_23,c_2027]) ).
cnf(c_2028,plain,
composition(A,join(B,C)) = join(composition(A,B),composition(A,converse(converse(C)))),
inference(paramod,[status(thm)],[c_23,c_1651]) ).
cnf(c_1911,plain,
composition(A,join(B,C)) = join(composition(A,B),composition(A,C)),
inference(paramod,[status(thm)],[c_23,c_2028]) ).
cnf(c_2029,plain,
composition(A,B) = join(composition(A,B),composition(A,complement(join(C,complement(B))))),
inference(paramod,[status(thm)],[c_508,c_1911]) ).
cnf(c_1992,plain,
join(composition(A,B),composition(A,complement(join(C,complement(B))))) = composition(A,B),
inference(copy,[status(thm)],[c_2029]) ).
cnf(c_1993,plain,
$false,
inference(resolve,[status(thm)],[c_1992,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL024+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 % Computer : n014.cluster.edu
% 0.20/0.44 % Model : x86_64 x86_64
% 0.20/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.44 % Memory : 8046.5625MB
% 0.20/0.44 % OS : Linux 6.8.0-71-generic
% 0.20/0.44 % CPULimit : 300
% 0.20/0.44 % WCLimit : 300
% 0.20/0.44 % DateTime : Sat Sep 26 05:31:46 UTC 2026
% 0.20/0.44 % CPUTime :
% 0.20/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.20/0.44 % Process 2257620 was started by sandbox on n014,
% 0.20/0.44 % Sat Sep 26 05:31:46 2026
% 0.20/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.20/0.45
% 0.20/0.45 % From the command line: assign(max_seconds, 300).
% 6.78/1.37
% 6.78/1.37 % SZS status Theorem for theBenchmark
% 6.78/1.37
% 6.78/1.37 % Proof 1 at 0.69 (+ 0.20) seconds.
% 6.78/1.37 % Length of proof is 55.
% 6.78/1.37 % Level of proof is 13.
% 6.78/1.37 % Maximum clause weight is 69.000.
% 6.78/1.37 % Given clauses 175.
% 6.78/1.37
% 6.78/1.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------