%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : REL031+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 : n009.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:25:00 AM UTC 2026
% Result : Theorem 41.79s 10.73s
% Output : CNFRefutation 41.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 70 ( 66 unt; 0 def)
% Number of atoms : 78 ( 77 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 5 ~; 0 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 112 ( 0 sgn 21 !; 2 ?)
% 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(composition_associativity,axiom,
! [X0,X1,X2] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
file('theBenchmark.p',composition_associativity) ).
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(goals,conjecture,
! [X0,X1] :
( ( join(composition(converse(X1),X1),one) = one
& join(composition(converse(X0),X0),one) = one )
=> join(composition(converse(composition(X0,X1)),composition(X0,X1)),one) = one ),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0,X1] :
( ( join(composition(converse(X1),X1),one) = one
& join(composition(converse(X0),X0),one) = one )
=> join(composition(converse(composition(X0,X1)),composition(X0,X1)),one) = one ),
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_20,plain,
composition(composition(A,B),C) = composition(A,composition(B,C)),
inference(clausify,[status(thm)],[composition_associativity]) ).
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,
join(composition(A,B),composition(C,B)) = composition(join(A,C),B),
inference(copy,[status(thm)],[c_22]) ).
cnf(c_24,plain,
converse(converse(A)) = A,
inference(clausify,[status(thm)],[converse_idempotence]) ).
cnf(c_25,plain,
converse(join(A,B)) = join(converse(A),converse(B)),
inference(clausify,[status(thm)],[converse_additivity]) ).
cnf(c_26,plain,
join(converse(A),converse(B)) = converse(join(A,B)),
inference(copy,[status(thm)],[c_25]) ).
cnf(c_27,plain,
converse(composition(A,B)) = composition(converse(B),converse(A)),
inference(clausify,[status(thm)],[converse_multiplicativity]) ).
cnf(c_28,plain,
composition(converse(A),converse(B)) = converse(composition(B,A)),
inference(copy,[status(thm)],[c_27]) ).
fof(nnf_14,plain,
? [X0,X1] :
( join(composition(converse(composition(X0,X1)),composition(X0,X1)),one) != one
& join(composition(converse(X1),X1),one) = one
& join(composition(converse(X0),X0),one) = one ),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
( join(composition(converse(composition(sK0,sK1)),composition(sK0,sK1)),one) != one
& join(composition(converse(sK1),sK1),one) = one
& join(composition(converse(sK0),sK0),one) = one ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[nnf_14]) ).
cnf(c_34,negated_conjecture,
join(composition(converse(sK0),sK0),one) = one,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_35,negated_conjecture,
join(one,composition(converse(sK0),sK0)) = one,
inference(paramod,[status(thm)],[c_15,c_34]) ).
cnf(c_36,negated_conjecture,
join(composition(converse(sK1),sK1),one) = one,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_37,negated_conjecture,
join(one,composition(converse(sK1),sK1)) = one,
inference(paramod,[status(thm)],[c_15,c_36]) ).
cnf(c_38,negated_conjecture,
join(composition(converse(composition(sK0,sK1)),composition(sK0,sK1)),one) != one,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_39,negated_conjecture,
join(one,composition(converse(composition(sK0,sK1)),composition(sK0,sK1))) != one,
inference(paramod,[status(thm)],[c_15,c_38]) ).
cnf(c_10105,plain,
composition(A,B) = composition(A,composition(one,B)),
inference(paramod,[status(thm)],[c_21,c_20]) ).
cnf(c_48,plain,
composition(A,composition(one,B)) = composition(A,B),
inference(copy,[status(thm)],[c_10105]) ).
cnf(c_10106,plain,
join(A,converse(B)) = converse(join(converse(A),B)),
inference(paramod,[status(thm)],[c_24,c_26]) ).
cnf(c_53,plain,
converse(join(converse(A),B)) = join(A,converse(B)),
inference(copy,[status(thm)],[c_10106]) ).
cnf(c_10107,plain,
composition(converse(composition(A,B)),C) = composition(converse(B),composition(converse(A),C)),
inference(paramod,[status(thm)],[c_28,c_20]) ).
cnf(c_55,plain,
composition(converse(A),composition(converse(B),C)) = composition(converse(composition(B,A)),C),
inference(copy,[status(thm)],[c_10107]) ).
cnf(c_56,plain,
join(converse(composition(A,B)),composition(C,converse(A))) = composition(join(converse(B),C),converse(A)),
inference(paramod,[status(thm)],[c_28,c_23]) ).
cnf(c_10108,plain,
composition(A,converse(B)) = converse(composition(B,converse(A))),
inference(paramod,[status(thm)],[c_24,c_28]) ).
cnf(c_58,plain,
converse(composition(A,converse(B))) = composition(B,converse(A)),
inference(copy,[status(thm)],[c_10108]) ).
cnf(c_10109,plain,
composition(converse(A),B) = converse(composition(converse(B),A)),
inference(paramod,[status(thm)],[c_24,c_28]) ).
cnf(c_59,plain,
converse(composition(converse(A),B)) = composition(converse(B),A),
inference(copy,[status(thm)],[c_10109]) ).
cnf(c_10110,plain,
join(one,A) = join(one,join(composition(converse(sK1),sK1),A)),
inference(paramod,[status(thm)],[c_37,c_16]) ).
cnf(c_78,plain,
join(one,join(composition(converse(sK1),sK1),A)) = join(one,A),
inference(copy,[status(thm)],[c_10110]) ).
cnf(c_10111,plain,
converse(converse(A)) = composition(converse(one),A),
inference(paramod,[status(thm)],[c_21,c_59]) ).
cnf(c_10112,plain,
A = composition(converse(one),A),
inference(paramod,[status(thm)],[c_24,c_10111]) ).
cnf(c_434,plain,
composition(converse(one),A) = A,
inference(copy,[status(thm)],[c_10112]) ).
cnf(c_10113,plain,
one = converse(one),
inference(paramod,[status(thm)],[c_434,c_21]) ).
cnf(c_440,plain,
converse(one) = one,
inference(copy,[status(thm)],[c_10113]) ).
cnf(c_10114,plain,
join(A,composition(B,A)) = composition(join(converse(one),B),A),
inference(paramod,[status(thm)],[c_434,c_23]) ).
cnf(c_10115,plain,
join(A,composition(B,A)) = composition(join(one,B),A),
inference(paramod,[status(thm)],[c_440,c_10114]) ).
cnf(c_441,plain,
composition(join(one,A),B) = join(B,composition(A,B)),
inference(copy,[status(thm)],[c_10115]) ).
cnf(c_10116,plain,
composition(converse(one),composition(one,A)) = A,
inference(paramod,[status(thm)],[c_434,c_48]) ).
cnf(c_10117,plain,
composition(one,composition(one,A)) = A,
inference(paramod,[status(thm)],[c_440,c_10116]) ).
cnf(c_445,plain,
composition(one,A) = A,
inference(paramod,[status(thm)],[c_48,c_10117]) ).
cnf(c_10118,plain,
join(converse(converse(composition(A,B))),converse(composition(C,converse(A)))) = converse(composition(join(converse(B),C),converse(A))),
inference(paramod,[status(thm)],[c_56,c_26]) ).
cnf(c_10119,plain,
join(composition(A,B),converse(composition(C,converse(A)))) = converse(composition(join(converse(B),C),converse(A))),
inference(paramod,[status(thm)],[c_24,c_10118]) ).
cnf(c_10120,plain,
join(composition(A,B),composition(A,converse(C))) = converse(composition(join(converse(B),C),converse(A))),
inference(paramod,[status(thm)],[c_58,c_10119]) ).
cnf(c_10121,plain,
join(composition(A,B),composition(A,converse(C))) = composition(A,converse(join(converse(B),C))),
inference(paramod,[status(thm)],[c_58,c_10120]) ).
cnf(c_471,plain,
join(composition(A,B),composition(A,converse(C))) = composition(A,join(B,converse(C))),
inference(paramod,[status(thm)],[c_53,c_10121]) ).
cnf(c_10122,plain,
composition(one,A) = join(A,composition(composition(converse(sK0),sK0),A)),
inference(paramod,[status(thm)],[c_35,c_441]) ).
cnf(c_10123,plain,
A = join(A,composition(composition(converse(sK0),sK0),A)),
inference(paramod,[status(thm)],[c_445,c_10122]) ).
cnf(c_10124,plain,
A = join(A,composition(converse(sK0),composition(sK0,A))),
inference(paramod,[status(thm)],[c_20,c_10123]) ).
cnf(c_490,plain,
join(A,composition(converse(sK0),composition(sK0,A))) = A,
inference(copy,[status(thm)],[c_10124]) ).
cnf(c_10125,plain,
join(composition(A,B),composition(A,C)) = composition(A,join(B,converse(converse(C)))),
inference(paramod,[status(thm)],[c_24,c_471]) ).
cnf(c_6171,plain,
join(composition(A,B),composition(A,C)) = composition(A,join(B,C)),
inference(paramod,[status(thm)],[c_24,c_10125]) ).
cnf(c_6456,plain,
join(one,composition(converse(sK1),join(sK1,A))) = join(one,composition(converse(sK1),A)),
inference(paramod,[status(thm)],[c_6171,c_78]) ).
cnf(c_10126,plain,
join(one,composition(converse(sK1),sK1)) = join(one,composition(converse(sK1),composition(converse(sK0),composition(sK0,sK1)))),
inference(paramod,[status(thm)],[c_490,c_6456]) ).
cnf(c_10127,plain,
one = join(one,composition(converse(sK1),composition(converse(sK0),composition(sK0,sK1)))),
inference(paramod,[status(thm)],[c_37,c_10126]) ).
cnf(c_10128,plain,
one = join(one,composition(converse(composition(sK0,sK1)),composition(sK0,sK1))),
inference(paramod,[status(thm)],[c_55,c_10127]) ).
cnf(c_10129,plain,
join(one,composition(converse(composition(sK0,sK1)),composition(sK0,sK1))) = one,
inference(copy,[status(thm)],[c_10128]) ).
cnf(c_10104,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_39,c_10129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL031+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.16/5.44 % Computer : n009.cluster.edu
% 0.16/5.44 % Model : x86_64 x86_64
% 0.16/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44 % Memory : 8046.5625MB
% 0.16/5.44 % OS : Linux 6.8.0-71-generic
% 0.16/5.44 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Sat Sep 26 05:35:04 UTC 2026
% 0.16/5.44 % CPUTime :
% 0.16/5.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/5.44 % Process 3471435 was started by sandbox on n009,
% 0.16/5.44 % Sat Sep 26 05:35:04 2026
% 0.16/5.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/5.45
% 0.16/5.45 % From the command line: assign(max_seconds, 300).
% 41.79/10.73
% 41.79/10.73 % SZS status Theorem for theBenchmark
% 41.79/10.73
% 41.79/10.73 % Proof 1 at 3.84 (+ 1.11) seconds.
% 41.79/10.73 % Length of proof is 42.
% 41.79/10.73 % Level of proof is 8.
% 41.79/10.73 % Maximum clause weight is 42.000.
% 41.79/10.73 % Given clauses 404.
% 41.79/10.73
% 41.79/10.73 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------