%------------------------------------------------------------------------------
% 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/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:46 AM UTC 2026
% Result : Unsatisfiable 6.11s 1.31s
% Output : CNFRefutation 6.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 24 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 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 : 55 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(composition_distributivity_7,axiom,
! [VAR_0,VAR_1,VAR_2] : composition(join(VAR_0,VAR_1),VAR_2) = join(composition(VAR_0,VAR_2),composition(VAR_1,VAR_2)),
file('theBenchmark.p',composition_distributivity_7) ).
cnf(c_10,plain,
composition(join(A,B),C) = join(composition(A,C),composition(B,C)),
inference(clausify,[status(thm)],[composition_distributivity_7]) ).
fof(converse_idempotence_8,axiom,
! [VAR_0] : converse(converse(VAR_0)) = VAR_0,
file('theBenchmark.p',converse_idempotence_8) ).
cnf(c_11,plain,
converse(converse(A)) = A,
inference(clausify,[status(thm)],[converse_idempotence_8]) ).
fof(converse_additivity_9,axiom,
! [VAR_0,VAR_1] : converse(join(VAR_0,VAR_1)) = join(converse(VAR_0),converse(VAR_1)),
file('theBenchmark.p',converse_additivity_9) ).
cnf(c_12,plain,
converse(join(A,B)) = join(converse(A),converse(B)),
inference(clausify,[status(thm)],[converse_additivity_9]) ).
fof(converse_multiplicativity_10,axiom,
! [VAR_0,VAR_1] : converse(composition(VAR_0,VAR_1)) = composition(converse(VAR_1),converse(VAR_0)),
file('theBenchmark.p',converse_multiplicativity_10) ).
cnf(c_13,plain,
converse(composition(A,B)) = composition(converse(B),converse(A)),
inference(clausify,[status(thm)],[converse_multiplicativity_10]) ).
fof(goals_14,axiom,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
file('theBenchmark.p',goals_14) ).
cnf(c_20,plain,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
inference(clausify,[status(thm)],[goals_14]) ).
cnf(c_1901,plain,
converse(join(composition(A,B),composition(C,B))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_10,c_13]) ).
cnf(c_1902,plain,
join(converse(composition(A,B)),converse(composition(C,B))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_12,c_1901]) ).
cnf(c_1903,plain,
join(composition(converse(B),converse(A)),converse(composition(C,B))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_13,c_1902]) ).
cnf(c_1904,plain,
join(composition(converse(B),converse(A)),composition(converse(B),converse(C))) = composition(converse(B),converse(join(A,C))),
inference(paramod,[status(thm)],[c_13,c_1903]) ).
cnf(c_1905,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_12,c_1904]) ).
cnf(c_32,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_1905]) ).
cnf(c_1906,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_11,c_32]) ).
cnf(c_1907,plain,
composition(A,join(converse(B),converse(C))) = join(composition(A,converse(B)),composition(converse(converse(A)),converse(C))),
inference(paramod,[status(thm)],[c_11,c_1906]) ).
cnf(c_210,plain,
composition(A,join(converse(B),converse(C))) = join(composition(A,converse(B)),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_11,c_1907]) ).
cnf(c_1908,plain,
composition(A,join(B,converse(C))) = join(composition(A,converse(converse(B))),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_11,c_210]) ).
cnf(c_1639,plain,
composition(A,join(B,converse(C))) = join(composition(A,B),composition(A,converse(C))),
inference(paramod,[status(thm)],[c_11,c_1908]) ).
cnf(c_1909,plain,
composition(A,join(B,C)) = join(composition(A,B),composition(A,converse(converse(C)))),
inference(paramod,[status(thm)],[c_11,c_1639]) ).
cnf(c_1899,plain,
composition(A,join(B,C)) = join(composition(A,B),composition(A,C)),
inference(paramod,[status(thm)],[c_11,c_1909]) ).
cnf(c_1900,plain,
$false,
inference(resolve,[status(thm)],[c_1899,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : REL008-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.15/0.40 % Computer : n014.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Sat Sep 26 05:25:46 UTC 2026
% 0.05/0.41 % CPUTime :
% 0.05/0.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.05/0.41 % Process 2242058 was started by sandbox on n014,
% 0.05/0.41 % Sat Sep 26 05:25:46 2026
% 0.05/0.41 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.05/0.42
% 0.05/0.42 % From the command line: assign(max_seconds, 300).
% 6.11/1.31
% 6.11/1.31 % SZS status Unsatisfiable for theBenchmark
% 6.11/1.31
% 6.11/1.31 % Proof 1 at 0.67 (+ 0.21) seconds.
% 6.11/1.31 % Length of proof is 10.
% 6.11/1.31 % Level of proof is 5.
% 6.11/1.31 % Maximum clause weight is 40.000.
% 6.11/1.31 % Given clauses 174.
% 6.11/1.31
% 6.11/1.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------