%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : REL049-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 : n006.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:07 AM UTC 2026
% Result : Unsatisfiable 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(maddux2_join_associativity_2,axiom,
! [VAR_0,VAR_1,VAR_2] : join(VAR_0,join(VAR_1,VAR_2)) = join(join(VAR_0,VAR_1),VAR_2),
file('theBenchmark.p',maddux2_join_associativity_2) ).
cnf(c_2,plain,
join(A,join(B,C)) = join(join(A,B),C),
inference(clausify,[status(thm)],[maddux2_join_associativity_2]) ).
cnf(c_3,plain,
join(join(A,B),C) = join(A,join(B,C)),
inference(copy,[status(thm)],[c_2]) ).
fof(goals_14,axiom,
join(sk1,sk2) = sk2,
file('theBenchmark.p',goals_14) ).
cnf(c_19,plain,
join(sk1,sk2) = sk2,
inference(clausify,[status(thm)],[goals_14]) ).
fof(goals_15,axiom,
join(sk3,sk2) = sk2,
file('theBenchmark.p',goals_15) ).
cnf(c_20,plain,
join(sk3,sk2) = sk2,
inference(clausify,[status(thm)],[goals_15]) ).
fof(goals_16,axiom,
join(join(sk1,sk3),sk2) != sk2,
file('theBenchmark.p',goals_16) ).
cnf(c_21,plain,
join(join(sk1,sk3),sk2) != sk2,
inference(clausify,[status(thm)],[goals_16]) ).
cnf(c_109,plain,
join(sk1,join(sk3,sk2)) != sk2,
inference(paramod,[status(thm)],[c_3,c_21]) ).
cnf(c_164,plain,
join(sk1,sk2) != sk2,
inference(paramod,[status(thm)],[c_20,c_109]) ).
cnf(c_163,plain,
$false,
inference(resolve,[status(thm)],[c_19,c_164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL049-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.45 % Computer : n006.cluster.edu
% 0.21/0.45 % Model : x86_64 x86_64
% 0.21/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45 % Memory : 8046.5625MB
% 0.21/0.45 % OS : Linux 6.8.0-71-generic
% 0.21/0.45 % CPULimit : 300
% 0.21/0.45 % WCLimit : 300
% 0.21/0.45 % DateTime : Sat Sep 26 05:41:55 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.21/0.46 % Process 496291 was started by sandbox2 on n006,
% 0.21/0.46 % Sat Sep 26 05:41:55 2026
% 0.21/0.46 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.21/0.47
% 0.21/0.47 % From the command line: assign(max_seconds, 300).
% 0.21/0.48
% 0.21/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.48
% 0.21/0.48 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.21/0.48 % Length of proof is 7.
% 0.21/0.48 % Level of proof is 3.
% 0.21/0.48 % Maximum clause weight is 26.000.
% 0.21/0.48 % Given clauses 22.
% 0.21/0.48
% 0.21/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------