%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : REL008+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:46 AM UTC 2026
% Result : Theorem 4.98s 1.09s
% Output : CNFRefutation 4.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 64 ( 0 sgn 14 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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,X2] : composition(X0,join(X1,X2)) = join(composition(X0,X1),composition(X0,X2)),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0,X1,X2] : composition(X0,join(X1,X2)) = join(composition(X0,X1),composition(X0,X2)),
inference(assume_negation,[status(cth)],[goals]) ).
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]) ).
fof(nnf_14,plain,
? [X0,X1,X2] : composition(X0,join(X1,X2)) != join(composition(X0,X1),composition(X0,X2)),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
composition(sK0,join(sK1,sK2)) != join(composition(sK0,sK1),composition(sK0,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(sK0,join(sK1,sK2)) != join(composition(sK0,sK1),composition(sK0,sK2)),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_1912,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_1913,plain,
join(converse(composition(A,B)),converse(composition(C,B))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_24,c_1912]) ).
cnf(c_1914,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_1913]) ).
cnf(c_1915,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_1914]) ).
cnf(c_1916,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_1915]) ).
cnf(c_43,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_1916]) ).
cnf(c_1917,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_43]) ).
cnf(c_1918,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_1917]) ).
cnf(c_221,plain,
composition(A,join(converse(B),converse(C))) = join(composition(A,converse(B)),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_23,c_1918]) ).
cnf(c_1919,plain,
composition(A,join(B,converse(C))) = join(composition(A,converse(converse(B))),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_23,c_221]) ).
cnf(c_1650,plain,
composition(A,join(B,converse(C))) = join(composition(A,B),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_23,c_1919]) ).
cnf(c_1920,plain,
composition(A,join(B,C)) = join(composition(A,B),composition(A,converse(converse(C)))),
inference(paramod,[status(thm)],[c_23,c_1650]) ).
cnf(c_1910,plain,
composition(A,join(B,C)) = join(composition(A,B),composition(A,C)),
inference(paramod,[status(thm)],[c_23,c_1920]) ).
cnf(c_1911,plain,
$false,
inference(resolve,[status(thm)],[c_1910,c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : REL008+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n011.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 26 05:25:59 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 3860568 was started by sandbox2 on n011,
% 0.09/0.35 % Sat Sep 26 05:25:59 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.36
% 0.09/0.36 % From the command line: assign(max_seconds, 300).
% 4.98/1.09
% 4.98/1.09 % SZS status Theorem for theBenchmark
% 4.98/1.09
% 4.98/1.09 % Proof 1 at 0.54 (+ 0.15) seconds.
% 4.98/1.09 % Length of proof is 15.
% 4.98/1.09 % Level of proof is 6.
% 4.98/1.09 % Maximum clause weight is 40.000.
% 4.98/1.09 % Given clauses 174.
% 4.98/1.09
% 4.98/1.09 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------