%------------------------------------------------------------------------------
% File     : NUN134-1 : TPTP v8.2.0. Released v8.1.0.
% Domain   : Number Theory
% Problem  : Sum of first n natural numbers is n(n+1)/2 - step case
% Version  : Especial.
% English  :

% Refs     : [Sma21] Smallbone (2021), Email to Geoff Sutcliffe
% Source   : [Sma21]
% Names    : squares.p [Sma21]

% Status   : Unsatisfiable
% Rating   : 0.27 v8.2.0, 0.29 v8.1.0
% Syntax   : Number of clauses     :   15 (  15 unt;   0 nHn;   3 RR)
%            Number of literals    :   15 (  15 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   1 sgn)
% SPC      : CNF_UNS_RFO_PEQ_UEQ

% Comments :
%------------------------------------------------------------------------------
cnf(plus_comm,axiom,
    '+'(X,Y) = '+'(Y,X) ).

cnf(plus_assoc,axiom,
    '+'(X,'+'(Y,Z)) = '+'('+'(X,Y),Z) ).

cnf(times_comm,axiom,
    times(X,Y) = times(Y,X) ).

cnf(times_assoc,axiom,
    times(X,times(Y,Z)) = times(times(X,Y),Z) ).

cnf(plus_zero,axiom,
    '+'(X,zero) = X ).

cnf(times_zero,axiom,
    times(X,zero) = zero ).

cnf(times_one,axiom,
    times(X,one) = X ).

cnf(distr,axiom,
    times(X,'+'(Y,Z)) = '+'(times(X,Y),times(X,Z)) ).

cnf(distr_001,axiom,
    times('+'(X,Y),Z) = '+'(times(X,Z),times(Y,Z)) ).

cnf(plus_s,axiom,
    '+'(s(X),Y) = s('+'(X,Y)) ).

cnf(times_s,axiom,
    times(s(X),Y) = '+'(Y,times(X,Y)) ).

cnf(sum_zero,axiom,
    sum(zero) = zero ).

cnf(sum_s,axiom,
    sum(s(N)) = '+'(s(N),sum(N)) ).

cnf(induction_hypothesis,axiom,
    '+'(sum(a),sum(a)) = times(a,s(a)) ).

cnf(goal,negated_conjecture,
    '+'(sum(s(a)),sum(s(a))) != times(s(a),s(s(a))) ).

%------------------------------------------------------------------------------