%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN083-1 : TPTP v9.3.1. Released v1.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 : 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 : Thu Sep 24 09:09:27 AM UTC 2026
% Result : Unsatisfiable 0.09s 15.45s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 14 ( 11 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f_is_associative,axiom,
f(X,f(Y,Z)) = f(f(X,Y),Z),
file('theBenchmark.p',f_is_associative) ).
cnf(prove_this,negated_conjecture,
f(a,f(b,f(c,d))) != f(f(f(a,b),c),d),
file('theBenchmark.p',prove_this) ).
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(t1,plain,
f(a,f(b,f(c,d))) != f(f(f(a,b),c),d),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( f(f(a,b),f(c,d)) != f(f(f(a,b),c),d)
| f(a,f(b,f(c,d))) != f(f(a,b),f(c,d))
| f(a,f(b,f(c,d))) = f(f(f(a,b),c),d) ),
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,
f(a,f(b,f(c,d))) = f(f(a,b),f(c,d)),
inference(extension,[status(thm),parent(t2:2)],[f_is_associative]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
f(f(a,b),f(c,d)) = f(f(f(a,b),c),d),
inference(extension,[status(thm),parent(t2:3)],[f_is_associative]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN083-1 : TPTP v9.3.1. Released v1.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.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/15.42 % CPULimit : 300
% 0.09/15.42 % WCLimit : 300
% 0.09/15.42 % DateTime : Sun Sep 20 06:25:11 UTC 2026
% 0.09/15.43 % CPUTime :
% 0.09/15.45 % SZS status Unsatisfiable for theBenchmark
% 0.09/15.45 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------