%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : REL049-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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 : Thu Sep 24 08:54:51 AM UTC 2026
% Result : Unsatisfiable 22.15s 22.41s
% Output : Proof 22.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 25 unt; 0 nHn; 31 RR)
% Number of literals : 50 ( 38 equ; 18 neg)
% Maximal clause size : 3 ( 1 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 : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(maddux1_join_commutativity_1,axiom,
join(A,B) = join(B,A),
file('REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(maddux2_join_associativity_2,axiom,
join(A,join(B,C)) = join(join(A,B),C),
file('REL001-0.ax',maddux2_join_associativity_2) ).
cnf(goals_14,negated_conjecture,
join(sk1,sk2) = sk2,
file('theBenchmark.p',goals_14) ).
cnf(goals_15,negated_conjecture,
join(sk3,sk2) = sk2,
file('theBenchmark.p',goals_15) ).
cnf(goals_16,negated_conjecture,
join(join(sk1,sk3),sk2) != sk2,
file('theBenchmark.p',goals_16) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( join(Eq_x_0,Eq_x_1) = join(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(t1,plain,
join(join(sk1,sk3),sk2) != sk2,
inference(start,[status(thm),parent(0:0)],[goals_16]) ).
cnf(t2,plain,
( join(sk3,join(sk1,sk2)) != sk2
| join(join(sk1,sk3),sk2) != join(sk3,join(sk1,sk2))
| join(join(sk1,sk3),sk2) = sk2 ),
inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( join(join(sk3,sk1),sk2) != join(sk3,join(sk1,sk2))
| join(join(sk1,sk3),sk2) != join(join(sk3,sk1),sk2)
| join(join(sk1,sk3),sk2) = join(sk3,join(sk1,sk2)) ),
inference(extension,[status(thm),parent(t2:2)],[equality_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( sk2 != sk2
| join(sk1,sk3) != join(sk3,sk1)
| join(join(sk1,sk3),sk2) = join(join(sk3,sk1),sk2) ),
inference(extension,[status(thm),parent(t4:2)],[equality_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
join(sk1,sk3) = join(sk3,sk1),
inference(extension,[status(thm),parent(t6:2)],[maddux1_join_commutativity_1]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
sk2 = sk2,
inference(extension,[status(thm),parent(t6:3)],[equality_1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).
cnf(t12,plain,
( join(sk3,join(sk1,sk2)) != join(join(sk3,sk1),sk2)
| join(join(sk3,sk1),sk2) = join(sk3,join(sk1,sk2)) ),
inference(extension,[status(thm),parent(t4:3)],[equality_2]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t4:3]) ).
cnf(t14,plain,
join(sk3,join(sk1,sk2)) = join(join(sk3,sk1),sk2),
inference(extension,[status(thm),parent(t12:2)],[maddux2_join_associativity_2]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
( join(sk3,sk2) != sk2
| join(sk3,join(sk1,sk2)) != join(sk3,sk2)
| join(sk3,join(sk1,sk2)) = sk2 ),
inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t2:3]) ).
cnf(t18,plain,
( join(sk1,sk2) != sk2
| sk3 != sk3
| join(sk3,join(sk1,sk2)) = join(sk3,sk2) ),
inference(extension,[status(thm),parent(t16:2)],[equality_4]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
sk3 = sk3,
inference(extension,[status(thm),parent(t18:2)],[equality_1]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
join(sk1,sk2) = sk2,
inference(extension,[status(thm),parent(t18:3)],[goals_14]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t18:3]) ).
cnf(t24,plain,
join(sk3,sk2) = sk2,
inference(extension,[status(thm),parent(t16:3)],[goals_15]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t16:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL049-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.39 % Computer : n007.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sat Sep 19 20:31:19 UTC 2026
% 0.10/0.39 % CPUTime :
% 22.15/22.41 % SZS status Unsatisfiable for theBenchmark
% 22.15/22.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------